CombinedText stringlengths 4 3.42M |
|---|
-- *************************************************************************************
--
-- The recipient is warned that this code should be handled in accordance
-- with the HM Government Security Classification indicated throughout.
--
-- This code and its contents shall not be used for other than UK Government
-- purposes.
--
-- The copyright in this code is the property of BAE SYSTEMS Electronic Systems Limited.
-- The Code is supplied by BAE SYSTEMS on the express terms that it is to be treated in
-- confidence and that it may not be copied, used or disclosed to others for any
-- purpose except in accordance with DEFCON 91 (Edn 10/92).
--
-- File Name: Super_Sub.adb
-- Version: As detailed by ClearCase
-- Version Date: As detailed by ClearCase
-- Creation Date: 03-11-99
-- Security Classification: Unclassified
-- Project: SRLE (Sting Ray Life Extension)
-- Author: J Mann
-- Section: Tactical Software/ Software Architecture
-- Division: Underwater Systems Division
-- Description: Generic implementation of Supertype-Subtype relationship
-- Comments:
--
-- MODIFICATION RECORD
-- --------------------
-- NAME DATE ECR No MODIFICATION
--
-- db 22/04/02 SRLE100002907 Procedure initialise removed as surplus to requirements
--
-- db 11/10/02 SRLE100003928 Remove null checks on source navigates and
-- calls to log.
--
-- DNS 20/05/15 CR 10265 For Navigate procedures returning a list,
-- the Return is now an "in" parameter
--
-- **************************************************************************************
with Generic_List;
with Root_Object;
use type Root_Object.Object_Access;
use type Root_Object.Object_List.Node_Access_Type;
with Ada.Tags;
use type Ada.Tags.Tag;
package body Super_Sub is
Super_Side : Ada.Tags.Tag;
---------------------------------------------------------------------
procedure Register_Super_End_Class (Super_Class : in Ada.Tags.Tag) is
begin
Super_Side := Super_Class;
end Register_Super_End_Class;
---------------------------------------------------------------------
Sub_End_Write : Root_Object.Formalised_Relationship_Write_Type;
Sub_End_Read : Root_Object.Formalised_Relationship_Read_Type;
Super_End_Write : Root_Object.Formalised_Relationship_Write_Type;
Super_End_Read : Root_Object.Formalised_Relationship_Read_Type;
-------------------------------------------------------------------
procedure Register_Sub_End_Relationship_Write (To_Write : in Root_Object.Formalised_Relationship_Write_Type) is
begin
Sub_End_Write := To_Write;
end Register_Sub_End_Relationship_Write;
---------------------------------------------------------------------
procedure Register_Sub_End_Relationship_Read (To_Read : in Root_Object.Formalised_Relationship_Read_Type) is
begin
Sub_End_Read := To_Read;
end Register_Sub_End_Relationship_Read;
---------------------------------------------------------------------
procedure Register_Super_End_Relationship_Write (To_Write : in Root_Object.Formalised_Relationship_Write_Type) is
begin
Super_End_Write := To_Write;
end Register_Super_End_Relationship_Write;
---------------------------------------------------------------------
procedure Register_Super_End_Relationship_Read (To_Read : in Root_Object.Formalised_Relationship_Read_Type) is
begin
Super_End_Read := To_Read;
end Register_Super_End_Relationship_Read;
---------------------------------------------------------------------
procedure Link (
A_Instance : in Root_Object.Object_Access;
B_Instance : in Root_Object.Object_Access) is
begin
if A_Instance.all'tag = Super_Side then
--A-Left Link
Sub_End_Write (A_Instance, B_Instance);
Super_End_Write (B_Instance, A_Instance);
elsif B_Instance.all'tag = Super_Side then
--A-Right Link
Super_End_Write (A_Instance, B_Instance);
Sub_End_Write (B_Instance, A_Instance);
end if;
end Link;
---------------------------------------------------------------------
procedure Unlink (
A_Instance : in Root_Object.Object_Access;
B_Instance : in Root_Object.Object_Access) is
begin
if A_Instance.all'tag = Super_Side then
-- A-Left Unlink
Sub_End_Write (A_Instance, null);
Super_End_Write (B_Instance, null);
elsif B_Instance.all'tag = Super_Side then
-- A-Right Unlink
Super_End_Write (A_Instance, null);
Sub_End_Write (B_Instance, null);
end if;
end Unlink;
---------------------------------------------------------------------
procedure Navigate (
From : in Root_Object.Object_Access;
To : out Root_Object.Object_Access) is
begin
if From.all'tag = Super_Side then
-- A-Right Navigate
To := Sub_End_Read (From);
else
--A-Left Navigate
To := Super_End_Read (From);
end if;
end Navigate;
---------------------------------------------------------------------
procedure Navigate (
From : in Root_Object.Object_Access;
Class : in Ada.Tags.Tag;
To : out Root_Object.Object_Access) is
begin
Navigate (
From => From,
To => To);
if To /= null and then To'tag /= Class then
To := null;
end if;
end Navigate;
---------------------------------------------------------------------
procedure Navigate (
From : in Root_Object.Object_List.List_Header_Access_Type;
To : in Root_Object.Object_List.List_Header_Access_Type) is
The_From_Instance : Root_Object.Object_Access;
The_To_Instance : Root_Object.Object_Access;
The_From_Pointer : Root_Object.Object_List.Node_Access_Type;
begin
The_From_Pointer := Root_Object.Object_List.First_Entry_Of (From);
while The_From_Pointer /= null loop
The_From_Instance := The_From_Pointer.Item;
Navigate (
From => The_From_Instance,
To => The_To_Instance);
if The_To_Instance /= null then
Root_Object.Object_List.Insert (
New_Item => The_To_Instance,
On_To => To );
end if;
The_From_Pointer := Root_Object.Object_List.Next_Entry_Of (From);
end loop;
end Navigate;
---------------------------------------------------------------------
procedure Navigate (
From : in Root_Object.Object_List.List_Header_Access_Type;
Class : in Ada.Tags.Tag;
To : in Root_Object.Object_List.List_Header_Access_Type) is
The_From_Instance : Root_Object.Object_Access;
The_To_Instance : Root_Object.Object_Access;
The_From_Pointer : Root_Object.Object_List.Node_Access_Type;
begin
The_From_Pointer := Root_Object.Object_List.First_Entry_Of (From);
while The_From_Pointer /= null loop
The_From_Instance := The_From_Pointer.Item;
Navigate (
From => The_From_Instance,
Class => Class,
To => The_To_Instance);
if The_To_Instance /= null then
Root_Object.Object_List.Insert (
New_Item => The_To_Instance,
On_To => To );
end if;
The_From_Pointer := Root_Object.Object_List.Next_Entry_Of (From);
end loop;
end Navigate;
---------------------------------------------------------------------
end Super_Sub;
|
with Ada.Characters.Latin_1;
package body afrl.cmasi.circle is
function getFullLmcpTypeName(this : Circle) return String is ("afrl.cmasi.circle.Circle");
function getLmcpTypeName(this : Circle) return String is ("Circle");
function getLmcpType(this : Circle) return UInt32_t is (CMASIEnum'Pos(CIRCLE_ENUM));
function getRadius(this : Circle'Class) return Float_t is (this.Radius);
procedure setRadius(this : out Circle'Class; Radius : in Float_t) is
begin
this.Radius := Radius;
end setRadius;
function getCenterPoint (this : Circle'Class) return Location3D_Acc is (this.CenterPoint);
procedure setCenterPoint(this : out Circle'Class; CenterPoint : in Location3D_Acc) is
begin
this.CenterPoint := CenterPoint;
end setCenterPoint;
function toString(this : Circle'Class; depth : Integer) return String is
begin
declare
depth_copy : Integer := depth;
UBS : Unbounded_String;
indent : Unbounded_String;
LF : Unbounded_String := To_Unbounded_String(String'(1 => Ada.Characters.Latin_1.LF));
begin
indent := To_Unbounded_String(String'(1 .. depth_copy*3 => ' '));
UBS := UBS & indent & "Object ( Circle ) {" & LF;
depth_copy := depth_copy + 1;
indent := To_Unbounded_String(String'(1 .. depth_copy*3 => ' '));
UBS := UBS & indent & "CenterPoint (Location3D)";
if(this.CenterPoint = null) then
UBS := UBS & " = null";
end if;
UBS := UBS & LF;
UBS := UBS & indent & "Radius (float) = " & To_Unbounded_String(this.Radius'Image) & LF;
depth_copy := depth_copy - 1;
return To_String(UBS);
end;
end toString;
end afrl.cmasi.circle;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- ADA.STRINGS.UTF_ENCODING.STRINGS --
-- --
-- B o d y --
-- --
-- Copyright (C) 2010-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. --
-- --
------------------------------------------------------------------------------
package body Ada.Strings.UTF_Encoding.Strings is
use Interfaces;
------------
-- Decode --
------------
-- Decode UTF-8/UTF-16BE/UTF-16LE input to String
function Decode
(Item : UTF_String;
Input_Scheme : Encoding_Scheme) return String
is
begin
if Input_Scheme = UTF_8 then
return Decode (Item);
else
return Decode (To_UTF_16 (Item, Input_Scheme));
end if;
end Decode;
-- Decode UTF-8 input to String
function Decode (Item : UTF_8_String) return String is
Result : String (1 .. Item'Length);
-- Result string (worst case is same length as input)
Len : Natural := 0;
-- Length of result stored so far
Iptr : Natural;
-- Input Item pointer
C : Unsigned_8;
R : Unsigned_16;
procedure Get_Continuation;
-- Reads a continuation byte of the form 10xxxxxx, shifts R left
-- by 6 bits, and or's in the xxxxxx to the low order 6 bits. On
-- return Ptr is incremented. Raises exception if continuation
-- byte does not exist or is invalid.
----------------------
-- Get_Continuation --
----------------------
procedure Get_Continuation is
begin
if Iptr > Item'Last then
Raise_Encoding_Error (Iptr - 1);
else
C := To_Unsigned_8 (Item (Iptr));
Iptr := Iptr + 1;
if C not in 2#10_000000# .. 2#10_111111# then
Raise_Encoding_Error (Iptr - 1);
else
R := Shift_Left (R, 6) or Unsigned_16 (C and 2#00_111111#);
end if;
end if;
end Get_Continuation;
-- Start of processing for Decode
begin
Iptr := Item'First;
-- Skip BOM at start
if Item'Length >= 3
and then Item (Iptr .. Iptr + 2) = BOM_8
then
Iptr := Iptr + 3;
-- Error if bad BOM
elsif Item'Length >= 2
and then (Item (Iptr .. Iptr + 1) = BOM_16BE
or else
Item (Iptr .. Iptr + 1) = BOM_16LE)
then
Raise_Encoding_Error (Iptr);
end if;
while Iptr <= Item'Last loop
C := To_Unsigned_8 (Item (Iptr));
Iptr := Iptr + 1;
-- Codes in the range 16#00# - 16#7F# are represented as
-- 0xxxxxxx
if C <= 16#7F# then
R := Unsigned_16 (C);
-- No initial code can be of the form 10xxxxxx. Such codes are used
-- only for continuations.
elsif C <= 2#10_111111# then
Raise_Encoding_Error (Iptr - 1);
-- Codes in the range 16#80# - 16#7FF# are represented as
-- 110yyyxx 10xxxxxx
elsif C <= 2#110_11111# then
R := Unsigned_16 (C and 2#000_11111#);
Get_Continuation;
-- Codes in the range 16#800# - 16#FFFF# are represented as
-- 1110yyyy 10yyyyxx 10xxxxxx
-- Such codes are out of range for type Character
-- Codes in the range 16#10000# - 16#10FFFF# are represented as
-- 11110zzz 10zzyyyy 10yyyyxx 10xxxxxx
-- Such codes are out of range for Wide_String output
-- Thus all remaining cases raise Encoding_Error
else
Raise_Encoding_Error (Iptr - 1);
end if;
Len := Len + 1;
-- The value may still be out of range of Standard.Character. We make
-- the check explicit because the library is typically compiled with
-- range checks disabled.
if R > Character'Pos (Character'Last) then
Raise_Encoding_Error (Iptr - 1);
end if;
Result (Len) := Character'Val (R);
end loop;
return Result (1 .. Len);
end Decode;
-- Decode UTF-16 input to String
function Decode (Item : UTF_16_Wide_String) return String is
Result : String (1 .. Item'Length);
-- Result is same length as input (possibly minus 1 if BOM present)
Len : Natural := 0;
-- Length of result
Iptr : Natural;
-- Index of next Item element
C : Unsigned_16;
begin
-- Skip UTF-16 BOM at start
Iptr := Item'First;
if Item'Length > 0 and then Item (Iptr) = BOM_16 (1) then
Iptr := Iptr + 1;
end if;
-- Loop through input characters
while Iptr <= Item'Last loop
C := To_Unsigned_16 (Item (Iptr));
Iptr := Iptr + 1;
-- Codes in the range 16#0000#..16#00FF# represent their own value
if C <= 16#00FF# then
Len := Len + 1;
Result (Len) := Character'Val (C);
-- All other codes are invalid, either they are invalid UTF-16
-- encoding sequences, or they represent values that are out of
-- range for type Character.
else
Raise_Encoding_Error (Iptr - 1);
end if;
end loop;
return Result (1 .. Len);
end Decode;
------------
-- Encode --
------------
-- Encode String in UTF-8, UTF-16BE or UTF-16LE
function Encode
(Item : String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String
is
begin
-- Case of UTF_8
if Output_Scheme = UTF_8 then
return Encode (Item, Output_BOM);
-- Case of UTF_16LE or UTF_16BE, use UTF-16 intermediary
else
return From_UTF_16 (UTF_16_Wide_String'(Encode (Item)),
Output_Scheme, Output_BOM);
end if;
end Encode;
-- Encode String in UTF-8
function Encode
(Item : String;
Output_BOM : Boolean := False) return UTF_8_String
is
Result : UTF_8_String (1 .. 3 * Item'Length + 3);
-- Worst case is three bytes per input byte + space for BOM
Len : Natural;
-- Number of output codes stored in Result
C : Unsigned_8;
-- Single input character
procedure Store (C : Unsigned_8);
pragma Inline (Store);
-- Store one output code, C is in the range 0 .. 255
-----------
-- Store --
-----------
procedure Store (C : Unsigned_8) is
begin
Len := Len + 1;
Result (Len) := Character'Val (C);
end Store;
-- Start of processing for UTF8_Encode
begin
-- Output BOM if required
if Output_BOM then
Result (1 .. 3) := BOM_8;
Len := 3;
else
Len := 0;
end if;
-- Loop through characters of input
for J in Item'Range loop
C := To_Unsigned_8 (Item (J));
-- Codes in the range 16#00# - 16#7F# are represented as
-- 0xxxxxxx
if C <= 16#7F# then
Store (C);
-- Codes in the range 16#80# - 16#7FF# are represented as
-- 110yyyxx 10xxxxxx
-- For type character of course, the limit is 16#FF# in any case
else
Store (2#110_00000# or Shift_Right (C, 6));
Store (2#10_000000# or (C and 2#00_111111#));
end if;
end loop;
return Result (1 .. Len);
end Encode;
-- Encode String in UTF-16
function Encode
(Item : String;
Output_BOM : Boolean := False) return UTF_16_Wide_String
is
Result : UTF_16_Wide_String
(1 .. Item'Length + Boolean'Pos (Output_BOM));
-- Output is same length as input + possible BOM
Len : Integer;
-- Length of output string
C : Unsigned_8;
begin
-- Output BOM if required
if Output_BOM then
Result (1) := BOM_16 (1);
Len := 1;
else
Len := 0;
end if;
-- Loop through input characters encoding them
for Iptr in Item'Range loop
C := To_Unsigned_8 (Item (Iptr));
-- Codes in the range 16#0000#..16#00FF# are output unchanged. This
-- includes all possible cases of Character values.
Len := Len + 1;
Result (Len) := Wide_Character'Val (C);
end loop;
return Result;
end Encode;
end Ada.Strings.UTF_Encoding.Strings;
|
-----------------------------------------------------------------------
-- mat-events-timelines - Timelines
-- Copyright (C) 2015, 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 MAT.Frames;
package body MAT.Events.Timelines is
use MAT.Events.Targets;
ITERATE_COUNT : constant MAT.Events.Event_Id_Type := 10_000;
procedure Extract (Target : in out MAT.Events.Targets.Target_Events'Class;
Level : in Positive;
Into : in out Timeline_Info_Vector) is
use type MAT.Types.Target_Time;
procedure Collect (Event : in MAT.Events.Target_Event_Type);
First_Event : MAT.Events.Target_Event_Type;
Last_Event : MAT.Events.Target_Event_Type;
Prev_Event : MAT.Events.Target_Event_Type;
Info : Timeline_Info;
First_Id : MAT.Events.Event_Id_Type;
Limit : constant MAT.Types.Target_Time := MAT.Types.Target_Time (Level * 1_000_000);
procedure Collect (Event : in MAT.Events.Target_Event_Type) is
Dt : constant MAT.Types.Target_Time := Event.Time - Prev_Event.Time;
begin
if Dt > Limit then
Into.Append (Info);
Info.Malloc_Count := 0;
Info.Realloc_Count := 0;
Info.Free_Count := 0;
Info.First_Event := Event;
Info.Free_Size := 0;
Info.Alloc_Size := 0;
Prev_Event := Event;
end if;
Info.Last_Event := Event;
if Event.Index = MAT.Events.MSG_MALLOC then
Info.Malloc_Count := Info.Malloc_Count + 1;
Info.Alloc_Size := Info.Alloc_Size + Event.Size;
elsif Event.Index = MAT.Events.MSG_REALLOC then
Info.Realloc_Count := Info.Realloc_Count + 1;
Info.Alloc_Size := Info.Alloc_Size + Event.Size;
Info.Free_Size := Info.Free_Size + Event.Old_Size;
elsif Event.Index = MAT.Events.MSG_FREE then
Info.Free_Count := Info.Free_Count + 1;
Info.Free_Size := Info.Free_Size + Event.Size;
end if;
end Collect;
begin
Target.Get_Limits (First_Event, Last_Event);
Prev_Event := First_Event;
Info.First_Event := First_Event;
First_Id := First_Event.Id;
while First_Id < Last_Event.Id loop
Target.Iterate (Start => First_Id,
Finish => First_Id + ITERATE_COUNT,
Process => Collect'Access);
First_Id := First_Id + ITERATE_COUNT;
end loop;
end Extract;
-- ------------------------------
-- Find in the events stream the events which are associated with a given event.
-- When the <tt>Event</tt> is a memory allocation, find the associated reallocation
-- and free events. When the event is a free, find the associated allocations.
-- Collect at most <tt>Max</tt> events.
-- ------------------------------
procedure Find_Related (Target : in out MAT.Events.Targets.Target_Events'Class;
Event : in MAT.Events.Target_Event_Type;
Max : in Positive;
List : in out MAT.Events.Tools.Target_Event_Vector) is
procedure Collect_Free (Event : in MAT.Events.Target_Event_Type);
procedure Collect_Alloc (Event : in MAT.Events.Target_Event_Type);
First_Id : MAT.Events.Event_Id_Type;
Last_Id : MAT.Events.Event_Id_Type;
First_Event : MAT.Events.Target_Event_Type;
Last_Event : MAT.Events.Target_Event_Type;
Addr : MAT.Types.Target_Addr := Event.Addr;
Done : exception;
procedure Collect_Free (Event : in MAT.Events.Target_Event_Type) is
begin
if Event.Index = MAT.Events.MSG_FREE and then Event.Addr = Addr then
List.Append (Event);
raise Done;
end if;
if Event.Index = MAT.Events.MSG_REALLOC and then Event.Old_Addr = Addr then
List.Append (Event);
if Positive (List.Length) >= Max then
raise Done;
end if;
Addr := Event.Addr;
end if;
end Collect_Free;
procedure Collect_Alloc (Event : in MAT.Events.Target_Event_Type) is
begin
if Event.Index = MAT.Events.MSG_MALLOC and then Event.Addr = Addr then
List.Append (Event);
raise Done;
end if;
if Event.Index = MAT.Events.MSG_REALLOC and then Event.Addr = Addr then
List.Append (Event);
if Positive (List.Length) >= Max then
raise Done;
end if;
Addr := Event.Old_Addr;
end if;
end Collect_Alloc;
begin
Target.Get_Limits (First_Event, Last_Event);
First_Id := Event.Id;
if Event.Index = MAT.Events.MSG_FREE then
-- Search backward for MSG_MALLOC and MSG_REALLOC.
First_Id := First_Id - 1;
while First_Id > First_Event.Id loop
if First_Id > ITERATE_COUNT then
Last_Id := First_Id - ITERATE_COUNT;
else
Last_Id := First_Event.Id;
end if;
Target.Iterate (Start => First_Id,
Finish => Last_Id,
Process => Collect_Alloc'Access);
First_Id := Last_Id;
end loop;
else
-- Search forward for MSG_REALLOC and MSG_FREE
First_Id := First_Id + 1;
while First_Id < Last_Event.Id loop
Target.Iterate (Start => First_Id,
Finish => First_Id + ITERATE_COUNT,
Process => Collect_Free'Access);
First_Id := First_Id + ITERATE_COUNT;
end loop;
end if;
exception
when Done =>
null;
end Find_Related;
-- ------------------------------
-- Find the sizes of malloc and realloc events which is selected by the given filter.
-- Update the <tt>Sizes</tt> map to keep track of the first event and last event and
-- the number of events found for the corresponding size.
-- ------------------------------
procedure Find_Sizes (Target : in out MAT.Events.Targets.Target_Events'Class;
Filter : in MAT.Expressions.Expression_Type;
Sizes : in out MAT.Events.Tools.Size_Event_Info_Map) is
procedure Collect_Event (Event : in MAT.Events.Target_Event_Type);
procedure Collect_Event (Event : in MAT.Events.Target_Event_Type) is
procedure Update_Size (Size : in MAT.Types.Target_Size;
Info : in out MAT.Events.Tools.Event_Info_Type);
procedure Update_Size (Size : in MAT.Types.Target_Size;
Info : in out MAT.Events.Tools.Event_Info_Type) is
pragma Unreferenced (Size);
begin
MAT.Events.Tools.Collect_Info (Info, Event);
end Update_Size;
begin
-- Look for malloc or realloc events which are selected by the filter.
if (Event.Index /= MAT.Events.MSG_MALLOC
and Event.Index /= MAT.Events.MSG_FREE
and Event.Index /= MAT.Events.MSG_REALLOC)
or else not Filter.Is_Selected (Event)
then
return;
end if;
declare
Pos : constant MAT.Events.Tools.Size_Event_Info_Cursor := Sizes.Find (Event.Size);
begin
if MAT.Events.Tools.Size_Event_Info_Maps.Has_Element (Pos) then
-- Increment the count and update the last event.
Sizes.Update_Element (Pos, Update_Size'Access);
else
declare
Info : MAT.Events.Tools.Event_Info_Type;
begin
-- Insert a new size with the event.
Info.First_Event := Event;
MAT.Events.Tools.Collect_Info (Info, Event);
Sizes.Insert (Event.Size, Info);
end;
end if;
end;
end Collect_Event;
begin
Target.Iterate (Process => Collect_Event'Access);
end Find_Sizes;
-- ------------------------------
-- Find the function address from the call event frames for the events which is selected
-- by the given filter. The function addresses are collected up to the given frame depth.
-- Update the <tt>Frames</tt> map to keep track of the first event and last event and
-- the number of events found for the corresponding frame address.
-- ------------------------------
procedure Find_Frames (Target : in out MAT.Events.Targets.Target_Events'Class;
Filter : in MAT.Expressions.Expression_Type;
Depth : in Positive;
Exact : in Boolean;
Frames : in out MAT.Events.Tools.Frame_Event_Info_Map) is
procedure Collect_Event (Event : in MAT.Events.Target_Event_Type);
procedure Collect_Event (Event : in MAT.Events.Target_Event_Type) is
procedure Update_Size (Key : in MAT.Events.Tools.Frame_Key_Type;
Info : in out MAT.Events.Tools.Event_Info_Type);
procedure Update_Size (Key : in MAT.Events.Tools.Frame_Key_Type;
Info : in out MAT.Events.Tools.Event_Info_Type) is
pragma Unreferenced (Key);
begin
MAT.Events.Tools.Collect_Info (Info, Event);
end Update_Size;
begin
-- Look for events which are selected by the filter.
if not Filter.Is_Selected (Event) then
return;
end if;
declare
Backtrace : constant MAT.Frames.Frame_Table := MAT.Frames.Backtrace (Event.Frame);
Key : MAT.Events.Tools.Frame_Key_Type;
First : Natural;
Last : Natural;
begin
if Exact then
First := Depth;
else
First := Backtrace'First;
end if;
if Depth < Backtrace'Last then
Last := Depth;
else
Last := Backtrace'Last;
end if;
for I in First .. Last loop
Key.Addr := Backtrace (Backtrace'Last - I + 1);
Key.Level := I;
declare
Pos : constant MAT.Events.Tools.Frame_Event_Info_Cursor
:= Frames.Find (Key);
begin
if MAT.Events.Tools.Frame_Event_Info_Maps.Has_Element (Pos) then
-- Increment the count and update the last event.
Frames.Update_Element (Pos, Update_Size'Access);
else
declare
Info : MAT.Events.Tools.Event_Info_Type;
begin
-- Insert a new size with the event.
Info.First_Event := Event;
Info.Count := 0;
MAT.Events.Tools.Collect_Info (Info, Event);
Frames.Insert (Key, Info);
end;
end if;
end;
end loop;
end;
end Collect_Event;
begin
Target.Iterate (Process => Collect_Event'Access);
end Find_Frames;
-- ------------------------------
-- Collect the events that match the filter and append them to the events vector.
-- ------------------------------
procedure Filter_Events (Target : in out MAT.Events.Targets.Target_Events'Class;
Filter : in MAT.Expressions.Expression_Type;
Events : in out MAT.Events.Tools.Target_Event_Vector) is
procedure Collect_Event (Event : in MAT.Events.Target_Event_Type);
procedure Collect_Event (Event : in MAT.Events.Target_Event_Type) is
begin
if Filter.Is_Selected (Event) then
Events.Append (Event);
end if;
end Collect_Event;
begin
Target.Iterate (Process => Collect_Event'Access);
end Filter_Events;
end MAT.Events.Timelines;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Holders.Elements;
package body AMF.Internals.Holders.DG_Holders is
---------------
-- To_Holder --
---------------
function To_Holder
(Item : AMF.DG.Canvases.DG_Canvas_Access)
return League.Holders.Holder is
begin
return
AMF.Holders.Elements.To_Holder (AMF.Elements.Element_Access (Item));
end To_Holder;
---------------
-- To_Holder --
---------------
function To_Holder
(Item : AMF.DG.Clip_Paths.DG_Clip_Path_Access)
return League.Holders.Holder is
begin
return
AMF.Holders.Elements.To_Holder (AMF.Elements.Element_Access (Item));
end To_Holder;
---------------
-- To_Holder --
---------------
function To_Holder
(Item : AMF.DG.Fills.DG_Fill_Access)
return League.Holders.Holder is
begin
return
AMF.Holders.Elements.To_Holder (AMF.Elements.Element_Access (Item));
end To_Holder;
---------------
-- To_Holder --
---------------
function To_Holder
(Item : AMF.DG.Graphical_Elements.DG_Graphical_Element_Access)
return League.Holders.Holder is
begin
return
AMF.Holders.Elements.To_Holder (AMF.Elements.Element_Access (Item));
end To_Holder;
---------------
-- To_Holder --
---------------
function To_Holder
(Item : AMF.DG.Groups.DG_Group_Access)
return League.Holders.Holder is
begin
return
AMF.Holders.Elements.To_Holder (AMF.Elements.Element_Access (Item));
end To_Holder;
---------------
-- To_Holder --
---------------
function To_Holder
(Item : AMF.DG.Markers.DG_Marker_Access)
return League.Holders.Holder is
begin
return
AMF.Holders.Elements.To_Holder (AMF.Elements.Element_Access (Item));
end To_Holder;
end AMF.Internals.Holders.DG_Holders;
|
-----------------------------------------------------------------------
-- hyperion-hosts-modules -- Module hosts
-- Copyright (C) 2017 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with ASF.Applications;
with AWA.Modules;
with Hyperion.Hosts.Models;
package Hyperion.Hosts.Modules is
-- The name under which the module is registered.
NAME : constant String := "hosts";
-- ------------------------------
-- Module hosts
-- ------------------------------
type Host_Module is new AWA.Modules.Module with private;
type Host_Module_Access is access all Host_Module'Class;
-- Initialize the hosts module.
overriding
procedure Initialize (Plugin : in out Host_Module;
App : in AWA.Modules.Application_Access;
Props : in ASF.Applications.Config);
-- Create a new host under the name, ip and associated with the agent.
-- Return the host identifier.
procedure Create_Host (Plugin : in out Host_Module;
Agent_Key : in String;
Host : in out Models.Host_Ref);
-- Get the hosts module.
function Get_Host_Module return Host_Module_Access;
private
type Host_Module is new AWA.Modules.Module with null record;
end Hyperion.Hosts.Modules;
|
-----------------------------------------------------------------------
-- util-concurrent-arrays -- Concurrent Arrays
-- Copyright (C) 2012, 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 Ada.Unchecked_Deallocation;
package body Util.Concurrent.Arrays is
procedure Free is
new Ada.Unchecked_Deallocation (Object => Vector_Record,
Name => Vector_Record_Access);
-- ------------------------------
-- Returns True if the container is empty.
-- ------------------------------
function Is_Empty (Container : in Ref) return Boolean is
begin
return Container.Target = null;
end Is_Empty;
-- ------------------------------
-- Iterate over the vector elements and execute the <b>Process</b> procedure
-- with the element as parameter.
-- ------------------------------
procedure Iterate (Container : in Ref;
Process : not null access procedure (Item : in Element_Type)) is
Target : constant Vector_Record_Access := Container.Target;
begin
if Target /= null then
for I in Target.List'Range loop
Process (Target.List (I));
end loop;
end if;
end Iterate;
-- ------------------------------
-- Iterate over the vector elements in reverse order and execute the <b>Process</b> procedure
-- with the element as parameter.
-- ------------------------------
procedure Reverse_Iterate (Container : in Ref;
Process : not null access procedure (Item : in Element_Type)) is
Target : constant Vector_Record_Access := Container.Target;
begin
if Target /= null then
for I in reverse Target.List'Range loop
Process (Target.List (I));
end loop;
end if;
end Reverse_Iterate;
-- ------------------------------
-- Release the reference. Invoke <b>Finalize</b> and free the storage if it was
-- the last reference.
-- ------------------------------
overriding
procedure Finalize (Obj : in out Ref) is
Release : Boolean;
begin
if Obj.Target /= null then
Util.Concurrent.Counters.Decrement (Obj.Target.Ref_Counter, Release);
if Release then
Free (Obj.Target);
else
Obj.Target := null;
end if;
end if;
end Finalize;
-- ------------------------------
-- Update the reference counter after an assignment.
-- ------------------------------
overriding
procedure Adjust (Obj : in out Ref) is
begin
if Obj.Target /= null then
Util.Concurrent.Counters.Increment (Obj.Target.Ref_Counter);
end if;
end Adjust;
-- ------------------------------
-- Get a read-only reference to the vector elements. The referenced vector will never
-- be modified.
-- ------------------------------
function Get (Container : in Vector'Class) return Ref is
begin
return Container.List.Get;
end Get;
-- ------------------------------
-- Append the element to the vector. The modification will not be visible to readers
-- until they call the <b>Get</b> function.
-- ------------------------------
procedure Append (Container : in out Vector;
Item : in Element_Type) is
begin
Container.List.Append (Item);
end Append;
-- ------------------------------
-- Remove the element represented by <b>Item</b> from the vector. The modification will
-- not be visible to readers until they call the <b>Get</b> function.
-- ------------------------------
procedure Remove (Container : in out Vector;
Item : in Element_Type) is
begin
Container.List.Remove (Item);
end Remove;
-- Release the vector elements.
overriding
procedure Finalize (Object : in out Vector) is
begin
null;
end Finalize;
-- Vector of objects
protected body Protected_Vector is
-- ------------------------------
-- Get a readonly reference to the vector.
-- ------------------------------
function Get return Ref is
begin
return Elements;
end Get;
-- ------------------------------
-- Append the element to the vector.
-- ------------------------------
procedure Append (Item : in Element_Type) is
New_Items : Vector_Record_Access;
Len : Natural;
begin
if Elements.Target = null then
New_Items := new Vector_Record (Len => 1);
Len := 1;
else
Len := Elements.Target.Len + 1;
New_Items := new Vector_Record (Len => Len);
New_Items.List (1 .. Len - 1) := Elements.Target.List;
Finalize (Elements);
end if;
New_Items.List (Len) := Item;
Util.Concurrent.Counters.Increment (New_Items.Ref_Counter);
Elements.Target := New_Items;
end Append;
-- ------------------------------
-- Remove the element from the vector.
-- ------------------------------
procedure Remove (Item : in Element_Type) is
New_Items : Vector_Record_Access;
Items : constant Vector_Record_Access := Elements.Target;
begin
if Items = null then
return;
end if;
for I in Items.List'Range loop
if Items.List (I) = Item then
if Items.Len = 1 then
Finalize (Elements);
Elements.Target := null;
else
New_Items := new Vector_Record (Len => Items.Len - 1);
if I > 1 then
New_Items.List (1 .. I - 1) := Items.List (1 .. I - 1);
end if;
if I <= New_Items.List'Last then
New_Items.List (I .. New_Items.List'Last)
:= Items.List (I + 1 .. Items.List'Last);
end if;
Finalize (Elements);
Util.Concurrent.Counters.Increment (New_Items.Ref_Counter);
Elements.Target := New_Items;
end if;
return;
end if;
end loop;
end Remove;
end Protected_Vector;
end Util.Concurrent.Arrays;
|
-- C45523A.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:
-- FOR FLOATING POINT TYPES, IF MACHINE_OVERFLOWS IS TRUE AND
-- EITHER THE RESULT OF MULTIPLICATION LIES OUTSIDE THE RANGE OF THE
-- BASE TYPE, OR AN ATTEMPT IS MADE TO DIVIDE BY ZERO, THEN
-- CONSTRAINT_ERROR IS RAISED. THIS TESTS
-- DIGITS 5.
-- *** NOTE: This test has been modified since ACVC version 1.11 to -- 9X
-- *** remove incompatibilities associated with the transition -- 9X
-- *** to Ada 9X. -- 9X
-- *** -- 9X
-- HISTORY:
-- BCB 02/09/88 CREATED ORIGINAL TEST.
-- MRM 03/30/93 REMOVED NUMERIC_ERROR FOR 9X COMPATIBILITY
-- KAS 11/14/95 DELETED USAGE OF 'SAFE_LARGE
-- KAS 11/30/95 GOT IT RIGHT THIS TIME
WITH REPORT; USE REPORT;
PROCEDURE C45523A IS
TYPE FLT IS DIGITS 5;
F : FLT;
FUNCTION IDENT_FLT(X : FLT) RETURN FLT IS
BEGIN
IF EQUAL(3,3) THEN
RETURN X;
ELSE
RETURN 0.0;
END IF;
END IDENT_FLT;
FUNCTION EQUAL_FLT(ONE, TWO : FLT) RETURN BOOLEAN IS
BEGIN
RETURN ONE = TWO * FLT (IDENT_INT(1));
END EQUAL_FLT;
BEGIN
TEST ("C45523A", "FOR FLOATING POINT TYPES, IF MACHINE_" &
"OVERFLOWS IS TRUE AND EITHER THE RESULT OF " &
"MULTIPLICATION LIES OUTSIDE THE RANGE OF THE " &
"BASE TYPE, OR AN ATTEMPT IS MADE TO DIVIDE BY " &
"ZERO, THEN CONSTRAINT_ERROR IS RAISED." &
"THIS TESTS DIGITS 5");
IF FLT'MACHINE_OVERFLOWS THEN
BEGIN
F := (FLT'BASE'LAST) * IDENT_FLT (2.0);
FAILED ("CONSTRAINT_ERROR WAS NOT RAISED FOR MULTIPLICATION");
IF EQUAL_FLT(F,F**IDENT_INT(1)) THEN
COMMENT ("DON'T OPTIMIZE F");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
COMMENT ("CONSTRAINT_ERROR WAS RAISED FOR " &
"MULTIPLICATION");
WHEN OTHERS =>
FAILED ("AN EXCEPTION OTHER THAN " &
"CONSTRAINT_ERROR WAS RAISED FOR " &
"MULTIPLICATION");
END;
BEGIN
F := (FLT'LAST) / IDENT_FLT (0.0);
FAILED ("CONSTRAINT_ERROR WAS NOT RAISED FOR DIVISION BY ZERO");
IF EQUAL_FLT(F,F**IDENT_INT(1)) THEN
COMMENT ("DON'T OPTIMIZE F");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
COMMENT ("CONSTRAINT_ERROR WAS RAISED FOR " &
"DIVISION BY ZERO");
WHEN OTHERS =>
FAILED ("AN EXCEPTION OTHER THAN CONSTRAINT_ERROR " &
"WAS RAISED FOR DIVISION BY ZERO");
END;
ELSE
NOT_APPLICABLE ("THIS TEST IS NOT APPLICABLE DUE TO " &
"MACHINE_OVERFLOWS BEING FALSE");
END IF;
RESULT;
END C45523A;
|
with Person;
with Ada.Text_IO; use Ada.Text_IO;
package body A is
procedure Print_Modify is
package I is new Ada.Text_IO.Integer_IO (Integer);
begin
I.Put (Person.Unit_Age); New_Line;
Person.Unit_Age := 10;
end Print_Modify;
end A;
|
------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $:
with XASIS.Types;
with XASIS.Utils;
with Asis.Elements;
with Asis.Statements;
with Asis.Definitions;
with Asis.Declarations;
with Asis.Gela.Classes;
with Asis.Gela.Element_Utils;
with Asis.Gela.Inheritance.Utils;
package body Asis.Gela.Inheritance is
function Operate_On_Type
(Oper : Asis.Declaration;
Tipe : Classes.Type_Info) return Boolean;
function Get_Declarative_Items
(Item : Asis.Element) return Asis.Declaration_List;
function Override (Decl : Asis.Declaration) return Boolean;
function Is_Ext_Equal_Operator
(Decl : Asis.Declaration;
Tipe : Classes.Type_Info) return Boolean;
procedure Make_Inherited_Subprogram
(Oper : Asis.Declaration;
Point : in out Visibility.Point;
Tipe : Classes.Type_Info;
Parent : Classes.Type_Info;
Visible : Boolean);
function Get_Parents (Decl : Asis.Declaration) return Asis.Name_List
renames XASIS.Utils.Get_Ancestors;
type Cloner is new Asis.Cloner with record
Tipe : Classes.Type_Info;
Parent : Classes.Type_Info;
Subprogram : Asis.Declaration;
Result_Subtype : Asis.Definition;
end record;
function Clone
(Object : Cloner;
Item : Element;
Parent : Element) return Element;
function Get_Inherited (Def : Asis.Definition)
return Asis.Declaration_List;
---------------------------------
-- Check_Inherited_Subprograms --
---------------------------------
procedure Check_Inherited_Subprograms
(Decl : in Asis.Declaration;
From : in Asis.Element;
Point : in out Visibility.Point)
is
View : constant Asis.Definition :=
Asis.Declarations.Type_Declaration_View (Decl);
List : constant Asis.Declaration_List := Get_Inherited (View);
Name : Asis.Defining_Name;
Parent : Asis.Declaration;
Parent_Name : Asis.Defining_Name;
Overriden : Boolean;
begin
for J in List'Range loop
Name := XASIS.Utils.Declaration_Name (List (J));
Parent := Declarations.Corresponding_Subprogram_Derivation (List (J));
Parent_Name := XASIS.Utils.Declaration_Name (Parent);
if not Visibility.Is_Declared (Name) and
Visibility.Visible_From (Parent_Name, From)
then
Visibility.New_Implicit_Declaration
(List (J), Point, Decl, Overriden);
end if;
end loop;
end Check_Inherited_Subprograms;
-----------
-- Clone --
-----------
function Clone
(Object : Cloner;
Item : Element;
Parent : Element) return Element
is
use Asis.Elements;
use Asis.Gela.Classes;
--------
-- Up --
--------
function Up
(Child : Asis.Element;
Declaration : Asis.Declaration_Kinds := Not_A_Declaration)
return Asis.Element is
begin
if Is_Nil (Child) then
return Asis.Nil_Element;
elsif (Declaration = Not_A_Declaration) or else
Declaration_Kind (Child) = Declaration
then
return Enclosing_Element (Child);
else
return Asis.Nil_Element;
end if;
end Up;
Upper : Asis.Element := Enclosing_Element (Item.all);
Result : Asis.Element;
Place : Asis.Element := Get_Place (Object.Tipe);
Tipe : Type_Info;
begin
if Is_Equal (Upper, Object.Result_Subtype) then
Tipe := Type_From_Subtype_Mark (Item, Place);
if Is_Equal (Tipe, Object.Parent) then
return Utils.Clone_Type (Parent, Object.Tipe);
end if;
else
case Definition_Kind (Upper) is
when A_Subtype_Indication | An_Access_Definition =>
declare
Up_2 : constant Asis.Element := Up (Upper);
Up_3 : constant Asis.Element :=
Up (Up_2, Declaration => A_Parameter_Specification);
begin
if Is_Equal (Up_3, Object.Subprogram) then
Tipe := Type_From_Subtype_Mark (Item, Place);
if Is_Equal (Tipe, Object.Parent) then
return Utils.Clone_Type (Parent, Object.Tipe);
end if;
end if;
end;
when others =>
null;
end case;
end if;
case Element_Kind (Item) is
when A_Declaration =>
case Declaration_Kind (Item) is
when A_Function_Declaration
| A_Function_Body_Declaration
| A_Function_Body_Stub
| A_Function_Renaming_Declaration
| A_Generic_Function_Declaration
| A_Formal_Function_Declaration
| An_Enumeration_Literal_Specification =>
return Utils.Clone_Function (Item, Parent);
when A_Procedure_Declaration
| A_Procedure_Body_Declaration
| A_Procedure_Body_Stub
| A_Procedure_Renaming_Declaration
| A_Generic_Procedure_Declaration
| A_Formal_Procedure_Declaration =>
return Utils.Clone_Procedure (Item, Parent);
when others =>
null;
end case;
when others =>
null;
end case;
Result := Clone (Item.all, Parent);
Utils.Set_Inherited (Result);
return Result;
end Clone;
---------------------------
-- Get_Declarative_Items --
---------------------------
function Get_Declarative_Items
(Item : Asis.Element) return Asis.Declaration_List
is
use Asis.Elements;
begin
case Element_Kind (Item) is
when A_Statement =>
case Statement_Kind (Item) is
when A_Block_Statement =>
return Asis.Statements.Block_Declarative_Items (Item);
when others =>
null;
end case;
when A_Declaration =>
case Declaration_Kind (Item) is
when A_Function_Body_Declaration |
A_Procedure_Body_Declaration |
A_Package_Body_Declaration |
A_Task_Body_Declaration |
An_Entry_Body_Declaration =>
return Asis.Declarations.Body_Declarative_Items (Item);
when others =>
null;
end case;
when others =>
null;
end case;
return Nil_Element_List;
end Get_Declarative_Items;
-------------------
-- Get_Inherited --
-------------------
function Get_Inherited (Def : Asis.Definition)
return Asis.Declaration_List
is
use Asis.Elements;
Def_Kind : constant Asis.Definition_Kinds := Definition_Kind (Def);
begin
if Def_Kind = A_Private_Extension_Definition
or else
(Def_Kind = A_Type_Definition and then
(Type_Kind (Def) in A_Derived_Type_Definition ..
A_Derived_Record_Extension_Definition
or Type_Kind (Def) = An_Interface_Type_Definition))
or else
(Def_Kind = A_Formal_Type_Definition and then
(Formal_Type_Kind (Def) = A_Formal_Derived_Type_Definition or
Formal_Type_Kind (Def) = A_Formal_Interface_Type_Definition))
then
declare
Index : Asis.ASIS_Natural := 0;
List : Asis.Declaration_List :=
Asis.Definitions.Implicit_Inherited_Subprograms (Def);
begin
for I in List'Range loop
if XASIS.Utils.Overloadable_Declaration (List (I)) then
Index := Index + 1;
List (Index) := List (I);
end if;
end loop;
return List (1 .. Index);
end;
else
return Nil_Element_List;
end if;
end Get_Inherited;
---------------------------
-- Is_Ext_Equal_Operator --
---------------------------
function Is_Ext_Equal_Operator
(Decl : Asis.Declaration;
Tipe : Classes.Type_Info) return Boolean
is
use Asis.Elements;
use Asis.Gela.Classes;
Name : Asis.Element_List :=
Asis.Declarations.Names (Decl);
Kind : Asis.Operator_Kinds :=
Operator_Kind (Name (1));
Expr : Asis.Expression;
Info : Type_Info;
Base : Asis.Declaration;
Def : Asis.Definition := Get_Type_Def (Tipe);
begin
if Type_Kind (Def) /= A_Derived_Record_Extension_Definition
then
return False;
end if;
if Kind /= An_Equal_Operator then
return False;
end if;
Expr := XASIS.Utils.Get_Result_Profile (Decl);
Info := Type_From_Subtype_Mark (Expr, Get_Place (Tipe));
Base := Classes.Get_Declaration (Info);
if not Is_Equal (Base, XASIS.Types.Boolean) then
return False;
end if;
declare
List : Asis.Parameter_Specification_List
:= XASIS.Utils.Get_Profile (Decl);
begin
if List'Length = 2 and then
not Is_Equal (Type_Of_Declaration (List (1), Get_Place (Tipe)),
Type_Of_Declaration (List (2), Get_Place (Tipe)))
then
return False;
end if;
end;
return True;
end Is_Ext_Equal_Operator;
-------------------------------
-- Make_Inherited_Subprogram --
-------------------------------
procedure Make_Inherited_Subprogram
(Oper : Asis.Declaration;
Point : in out Visibility.Point;
Tipe : Classes.Type_Info;
Parent : Classes.Type_Info;
Visible : Boolean)
is
use Asis.Elements;
The_Cloner : Cloner;
Name : Asis.Defining_Name;
Def : Asis.Definition := Classes.Get_Type_Def (Tipe);
Decl : Asis.Declaration := Classes.Get_Declaration (Tipe);
Overriden : Boolean;
Result : Asis.Declaration;
begin
The_Cloner.Tipe := Tipe;
The_Cloner.Parent := Parent;
The_Cloner.Subprogram := Oper;
The_Cloner.Result_Subtype := XASIS.Utils.Get_Result_Subtype (Oper);
Result := Deep_Copy (The_Cloner, Oper, Def);
if Declaration_Kind (Oper) = An_Enumeration_Literal_Specification then
Utils.Set_Result_Profile (Result, Tipe);
end if;
Name := XASIS.Utils.Declaration_Name (Result);
if Visible then
Visibility.New_Implicit_Declaration (Result, Point, Decl, Overriden);
else
Visibility.Set_Not_Declared (Name);
end if;
-- if not Overriden then
Element_Utils.Add_Inherited_Subprogram (Def, Result);
-- end if;
if Defining_Name_Kind (Name) = A_Defining_Operator_Symbol then
Element_Utils.Add_Type_Operator (Def, Result);
end if;
end Make_Inherited_Subprogram;
--------------------------------
-- Make_Inherited_Subprograms --
--------------------------------
procedure Make_Inherited_Subprograms
(Decl : Asis.Declaration;
Point : in out Visibility.Point)
is
Tipe : Classes.Type_Info := Classes.Type_From_Declaration (Decl, Decl);
List : Asis.Name_List := Get_Parents (Decl);
begin
for J in List'Range loop
declare
Parent : constant Classes.Type_Info :=
Classes.Type_From_Subtype_Mark (List (J), Decl);
Proc : Asis.Declaration_List :=
User_Primitive_Subprograms (Parent);
Name : Asis.Defining_Name;
begin
for I in Proc'Range loop
Name := XASIS.Utils.Declaration_Name (Proc (I));
if not Is_Ext_Equal_Operator (Proc (I), Tipe) then
Make_Inherited_Subprogram
(Proc (I), Point, Tipe, Parent,
Visible => Visibility.Visible_From (Name, Decl));
end if;
end loop;
end;
end loop;
end Make_Inherited_Subprograms;
---------------------
-- Operate_On_Type --
---------------------
function Operate_On_Type
(Oper : Asis.Declaration;
Tipe : Classes.Type_Info) return Boolean
is
use XASIS.Utils;
Def : Asis.Definition;
Info : Classes.Type_Info;
Place : Asis.Element := Classes.Get_Place (Tipe);
begin
case Asis.Elements.Declaration_Kind (Oper) is
when A_Generic_Function_Declaration =>
return False;
when A_Function_Declaration
| A_Function_Body_Declaration
| A_Function_Body_Stub
| A_Function_Renaming_Declaration
| A_Formal_Function_Declaration =>
Def := Get_Result_Subtype (Oper);
Info := Classes.Type_From_Indication (Def, Place);
if Classes.Is_Equal (Info, Tipe) then
return True;
end if;
when A_Procedure_Declaration
| A_Procedure_Body_Declaration
| A_Procedure_Body_Stub
| A_Procedure_Renaming_Declaration
| A_Generic_Procedure_Declaration
| A_Formal_Procedure_Declaration =>
null;
when others =>
return False;
end case;
declare
List : constant Asis.Parameter_Specification_List :=
Get_Profile (Oper);
begin
for I in List'Range loop
Info := Classes.Type_Of_Declaration (List (I), Place);
if Classes.Is_Expected_Type (Info, Tipe) then
return True;
end if;
end loop;
end;
return False;
end Operate_On_Type;
--------------
-- Override --
--------------
function Override (Decl : Asis.Declaration) return Boolean is
package U renames Asis.Gela.Element_Utils;
List : constant Asis.Defining_Name_List :=
Asis.Declarations.Names (Decl);
begin
return Assigned (U.Override (List (1)));
end Override;
--------------------------------
-- User_Primitive_Subprograms --
--------------------------------
function User_Primitive_Subprograms
(Info : Classes.Type_Info)
return Asis.Declaration_List
is
function Get_Enum_Literals (Def : Asis.Definition)
return Asis.Declaration_List;
function Get_Package_Operations (Info : Classes.Type_Info)
return Asis.Declaration_List;
function Get_Other_Operations (Info : Classes.Type_Info)
return Asis.Declaration_List;
-----------------------
-- Get_Enum_Literals --
-----------------------
function Get_Enum_Literals (Def : Asis.Definition)
return Asis.Declaration_List
is
Def_Kind : Asis.Type_Kinds := Asis.Elements.Type_Kind (Def);
begin
if Def_Kind = An_Enumeration_Type_Definition then
return Asis.Definitions.Enumeration_Literal_Declarations (Def);
else
return Nil_Element_List;
end if;
end Get_Enum_Literals;
----------------------------
-- Get_Package_Operations --
----------------------------
function Get_Package_Operations (Info : Classes.Type_Info)
return Asis.Declaration_List
is
Decl : constant Asis.Declaration :=
Classes.Get_Declaration (Info);
Pkg : constant Asis.Declaration :=
Asis.Elements.Enclosing_Element (Decl);
begin
if Asis.Elements.Declaration_Kind (Pkg) /= A_Package_Declaration then
return Nil_Element_List;
end if;
declare
Index : Asis.ASIS_Natural := 0;
List : Asis.Declaration_List :=
Asis.Declarations.Visible_Part_Declarative_Items (Pkg) &
Asis.Declarations.Private_Part_Declarative_Items (Pkg);
begin
for I in List'Range loop
if Operate_On_Type (List (I), Info) then
Index := Index + 1;
List (Index) := List (I);
end if;
end loop;
return List (1 .. Index);
end;
end Get_Package_Operations;
--------------------------
-- Get_Other_Operations --
--------------------------
function Get_Other_Operations (Info : Classes.Type_Info)
return Asis.Declaration_List
is
Decl : constant Asis.Declaration :=
Classes.Get_Declaration (Info);
Parent : constant Asis.Element :=
Asis.Elements.Enclosing_Element (Decl);
begin
if Asis.Elements.Declaration_Kind (Parent) = A_Package_Declaration
then
return Nil_Element_List;
end if;
declare
Index : Asis.ASIS_Natural := 0;
List : Asis.Declaration_List :=
Get_Declarative_Items (Parent);
begin
for I in List'Range loop
if Operate_On_Type (List (I), Info)
and then Override (List (I))
and then not XASIS.Utils.Is_Completion (List (I))
then
Index := Index + 1;
List (Index) := List (I);
end if;
end loop;
return List (1 .. Index);
end;
end Get_Other_Operations;
Def : constant Asis.Definition := Classes.Get_Type_Def (Info);
Result : constant Asis.Declaration_List :=
Get_Inherited (Def) &
Get_Enum_Literals (Def) &
Get_Package_Operations (Info) &
Get_Other_Operations (Info);
begin
return Result;
end User_Primitive_Subprograms;
end Asis.Gela.Inheritance;
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
|
------------------------------------------------------------------------------
-- --
-- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- A D A . I N T E R R U P T S . N A M E S --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1997-1998 Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 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. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is a NT (native) version of this package.
-- This target-dependent package spec contains names of interrupts
-- supported by the local system.
with System.OS_Interface;
-- used for names of interrupts
package Ada.Interrupts.Names is
-- Beware that the mapping of names to signals may be
-- many-to-one. There may be aliases. Also, for all
-- signal names that are not supported on the current system
-- the value of the corresponding constant will be zero.
SIGINT : constant Interrupt_ID :=
System.OS_Interface.SIGINT; -- interrupt (rubout)
SIGILL : constant Interrupt_ID :=
System.OS_Interface.SIGILL; -- illegal instruction (not reset)
SIGABRT : constant Interrupt_ID := -- used by abort,
System.OS_Interface.SIGABRT; -- replace SIGIOT in the future
SIGFPE : constant Interrupt_ID :=
System.OS_Interface.SIGFPE; -- floating point exception
SIGSEGV : constant Interrupt_ID :=
System.OS_Interface.SIGSEGV; -- segmentation violation
SIGTERM : constant Interrupt_ID :=
System.OS_Interface.SIGTERM; -- software termination signal from kill
end Ada.Interrupts.Names;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . N U M E R I C S . F L O A T _ R A N D O M --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Note: the implementation used in this package is a version of the
-- Mersenne Twister. See s-rannum.adb for details and references.
with System.Random_Numbers;
package Ada.Numerics.Float_Random with
SPARK_Mode => Off
is
-- Basic facilities
type Generator is limited private;
subtype Uniformly_Distributed is Float range 0.0 .. 1.0;
function Random (Gen : Generator) return Uniformly_Distributed;
procedure Reset (Gen : Generator);
procedure Reset (Gen : Generator; Initiator : Integer);
-- Advanced facilities
type State is private;
procedure Save (Gen : Generator; To_State : out State);
procedure Reset (Gen : Generator; From_State : State);
Max_Image_Width : constant := System.Random_Numbers.Max_Image_Width;
function Image (Of_State : State) return String;
function Value (Coded_State : String) return State;
private
type Generator is new System.Random_Numbers.Generator;
type State is new System.Random_Numbers.State;
end Ada.Numerics.Float_Random;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Explanation --
-- --
-- S P E C --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer <Juergen.Pfeifer@T-Online.de> 1996
-- Version Control
-- $Revision: 1.5 $
-- Binding Version 00.93
------------------------------------------------------------------------------
-- Poor mans help system. This scans a sequential file for key lines and
-- then reads the lines up to the next key. Those lines are presented in
-- a window as help or explanation.
--
with Terminal_Interface.Curses;
package Sample.Explanation is
package Curses renames Terminal_Interface.Curses;
procedure Explain (Key : in String);
-- Retrieve the text associated with this key and display it.
procedure Explain_Context;
-- Explain the current context.
procedure Notepad (Key : in String);
-- Put a note on the screen and maintain it with the context
Explanation_Not_Found : exception;
Explanation_Error : exception;
end Sample.Explanation;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with League.Strings;
with Ada.Containers.Vectors;
with Meta.Classes;
package Meta.Read is
package Class_Vectors is new Ada.Containers.Vectors
(Index_Type => Positive,
Element_Type => Meta.Classes.Class,
"=" => Meta.Classes."=");
procedure Read_AST
(File_Name : League.Strings.Universal_String;
Result : out Class_Vectors.Vector);
end Meta.Read;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . S T R I N G _ O P S _ C O N C A T _ 3 --
-- --
-- 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. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the function for concatenating three strings
package System.String_Ops_Concat_3 is
pragma Pure;
function Str_Concat_3 (S1, S2, S3 : String) return String;
-- Concatenate three strings and return resulting string
end System.String_Ops_Concat_3;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017, 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 FE310_SVD.GPIO; use FE310_SVD.GPIO;
with HAL.GPIO; use HAL.GPIO;
package body FE310.GPIO is
---------------------
-- Set_IO_Function --
---------------------
procedure Set_IO_Function (This : in out GPIO_Point;
Func : IO_Function)
is
begin
case Func is
when Disabled =>
GPIO0_Periph.IO_FUNC_EN.Arr (This.Pin) := False;
when IOF0 | IOF1 =>
GPIO0_Periph.IO_FUNC_SEL.Arr (This.Pin) := Func = IOF1;
GPIO0_Periph.IO_FUNC_EN.Arr (This.Pin) := True;
end case;
end Set_IO_Function;
------------
-- Invert --
------------
procedure Invert (This : in out GPIO_Point;
Enabled : Boolean := True)
is
begin
GPIO0_Periph.OUT_XOR.Arr (This.Pin) := Enabled;
end Invert;
-- Invert the output level
function Inverted (This : GPIO_Point) return Boolean
is (GPIO0_Periph.OUT_XOR.Arr (This.Pin));
----------
-- Mode --
----------
overriding
function Mode (This : GPIO_Point) return HAL.GPIO.GPIO_Mode is
begin
if GPIO0_Periph.IO_FUNC_EN.Arr (This.Pin) then
return Unknown;
elsif GPIO0_Periph.OUTPUT_EN.Arr (This.Pin) then
return Output;
else
return Input;
end if;
end Mode;
--------------
-- Set_Mode --
--------------
overriding
function Set_Mode (This : in out GPIO_Point;
Mode : HAL.GPIO.GPIO_Config_Mode) return Boolean is
begin
-- Input mode is always on to make sure we can read IO state even in
-- output mode.
GPIO0_Periph.INPUT_EN.Arr (This.Pin) := True;
GPIO0_Periph.OUTPUT_EN.Arr (This.Pin) := Mode = Output;
return True;
end Set_Mode;
-------------------
-- Pull_Resistor --
-------------------
overriding
function Pull_Resistor (This : GPIO_Point)
return HAL.GPIO.GPIO_Pull_Resistor is
begin
if GPIO0_Periph.PULLUP.Arr (This.Pin) then
return Pull_Up;
else
return Floating;
end if;
end Pull_Resistor;
-----------------------
-- Set_Pull_Resistor --
-----------------------
overriding
function Set_Pull_Resistor (This : in out GPIO_Point;
Pull : HAL.GPIO.GPIO_Pull_Resistor)
return Boolean is
begin
if Pull = Pull_Down then
return False;
else
GPIO0_Periph.PULLUP.Arr (This.Pin) := Pull = Pull_Up;
return True;
end if;
end Set_Pull_Resistor;
---------
-- Set --
---------
overriding
function Set (This : GPIO_Point) return Boolean is
begin
return GPIO0_Periph.VALUE.Arr (This.Pin);
end Set;
---------
-- Set --
---------
overriding
procedure Set (This : in out GPIO_Point) is
begin
GPIO0_Periph.PORT.Arr (This.Pin) := True;
end Set;
-----------
-- Clear --
-----------
overriding
procedure Clear (This : in out GPIO_Point) is
begin
GPIO0_Periph.PORT.Arr (This.Pin) := False;
end Clear;
------------
-- Toggle --
------------
overriding
procedure Toggle (This : in out GPIO_Point) is
begin
GPIO0_Periph.PORT.Arr (This.Pin) := not GPIO0_Periph.VALUE.Arr (This.Pin);
end Toggle;
end FE310.GPIO;
|
pragma Warnings (Off);
pragma Ada_95;
with System;
with System.Parameters;
with System.Secondary_Stack;
package ada_main is
gnat_argc : Integer;
gnat_argv : System.Address;
gnat_envp : System.Address;
pragma Import (C, gnat_argc);
pragma Import (C, gnat_argv);
pragma Import (C, gnat_envp);
gnat_exit_status : Integer;
pragma Import (C, gnat_exit_status);
GNAT_Version : constant String :=
"GNAT Version: Community 2019 (20190517-83)" & ASCII.NUL;
pragma Export (C, GNAT_Version, "__gnat_version");
Ada_Main_Program_Name : constant String := "_ada_main" & ASCII.NUL;
pragma Export (C, Ada_Main_Program_Name, "__gnat_ada_main_program_name");
procedure adainit;
pragma Export (C, adainit, "adainit");
procedure adafinal;
pragma Export (C, adafinal, "adafinal");
function main
(argc : Integer;
argv : System.Address;
envp : System.Address)
return Integer;
pragma Export (C, main, "main");
type Version_32 is mod 2 ** 32;
u00001 : constant Version_32 := 16#edf25caa#;
pragma Export (C, u00001, "mainB");
u00002 : constant Version_32 := 16#050ff2f0#;
pragma Export (C, u00002, "system__standard_libraryB");
u00003 : constant Version_32 := 16#0f7d71d4#;
pragma Export (C, u00003, "system__standard_libraryS");
u00004 : constant Version_32 := 16#76789da1#;
pragma Export (C, u00004, "adaS");
u00005 : constant Version_32 := 16#5b4659fa#;
pragma Export (C, u00005, "ada__charactersS");
u00006 : constant Version_32 := 16#8f637df8#;
pragma Export (C, u00006, "ada__characters__handlingB");
u00007 : constant Version_32 := 16#3b3f6154#;
pragma Export (C, u00007, "ada__characters__handlingS");
u00008 : constant Version_32 := 16#4b7bb96a#;
pragma Export (C, u00008, "ada__characters__latin_1S");
u00009 : constant Version_32 := 16#e6d4fa36#;
pragma Export (C, u00009, "ada__stringsS");
u00010 : constant Version_32 := 16#085b6ffb#;
pragma Export (C, u00010, "systemS");
u00011 : constant Version_32 := 16#34742901#;
pragma Export (C, u00011, "system__exception_tableB");
u00012 : constant Version_32 := 16#55f506b9#;
pragma Export (C, u00012, "system__exception_tableS");
u00013 : constant Version_32 := 16#ae860117#;
pragma Export (C, u00013, "system__soft_linksB");
u00014 : constant Version_32 := 16#4d58644d#;
pragma Export (C, u00014, "system__soft_linksS");
u00015 : constant Version_32 := 16#bd45c2cc#;
pragma Export (C, u00015, "system__secondary_stackB");
u00016 : constant Version_32 := 16#4dcf97e2#;
pragma Export (C, u00016, "system__secondary_stackS");
u00017 : constant Version_32 := 16#d90c4a0d#;
pragma Export (C, u00017, "ada__exceptionsB");
u00018 : constant Version_32 := 16#16307b94#;
pragma Export (C, u00018, "ada__exceptionsS");
u00019 : constant Version_32 := 16#5726abed#;
pragma Export (C, u00019, "ada__exceptions__last_chance_handlerB");
u00020 : constant Version_32 := 16#41e5552e#;
pragma Export (C, u00020, "ada__exceptions__last_chance_handlerS");
u00021 : constant Version_32 := 16#ce4af020#;
pragma Export (C, u00021, "system__exceptionsB");
u00022 : constant Version_32 := 16#6038020d#;
pragma Export (C, u00022, "system__exceptionsS");
u00023 : constant Version_32 := 16#69416224#;
pragma Export (C, u00023, "system__exceptions__machineB");
u00024 : constant Version_32 := 16#d27d9682#;
pragma Export (C, u00024, "system__exceptions__machineS");
u00025 : constant Version_32 := 16#aa0563fc#;
pragma Export (C, u00025, "system__exceptions_debugB");
u00026 : constant Version_32 := 16#76d1963f#;
pragma Export (C, u00026, "system__exceptions_debugS");
u00027 : constant Version_32 := 16#6c2f8802#;
pragma Export (C, u00027, "system__img_intB");
u00028 : constant Version_32 := 16#0a808f39#;
pragma Export (C, u00028, "system__img_intS");
u00029 : constant Version_32 := 16#ced09590#;
pragma Export (C, u00029, "system__storage_elementsB");
u00030 : constant Version_32 := 16#259825ff#;
pragma Export (C, u00030, "system__storage_elementsS");
u00031 : constant Version_32 := 16#39df8c17#;
pragma Export (C, u00031, "system__tracebackB");
u00032 : constant Version_32 := 16#5679b13f#;
pragma Export (C, u00032, "system__tracebackS");
u00033 : constant Version_32 := 16#9ed49525#;
pragma Export (C, u00033, "system__traceback_entriesB");
u00034 : constant Version_32 := 16#0800998b#;
pragma Export (C, u00034, "system__traceback_entriesS");
u00035 : constant Version_32 := 16#bb296fbb#;
pragma Export (C, u00035, "system__traceback__symbolicB");
u00036 : constant Version_32 := 16#c84061d1#;
pragma Export (C, u00036, "system__traceback__symbolicS");
u00037 : constant Version_32 := 16#701f9d88#;
pragma Export (C, u00037, "ada__exceptions__tracebackB");
u00038 : constant Version_32 := 16#20245e75#;
pragma Export (C, u00038, "ada__exceptions__tracebackS");
u00039 : constant Version_32 := 16#a0d3d22b#;
pragma Export (C, u00039, "system__address_imageB");
u00040 : constant Version_32 := 16#a9b7f2c1#;
pragma Export (C, u00040, "system__address_imageS");
u00041 : constant Version_32 := 16#8c33a517#;
pragma Export (C, u00041, "system__wch_conB");
u00042 : constant Version_32 := 16#13264d29#;
pragma Export (C, u00042, "system__wch_conS");
u00043 : constant Version_32 := 16#9721e840#;
pragma Export (C, u00043, "system__wch_stwB");
u00044 : constant Version_32 := 16#3e376128#;
pragma Export (C, u00044, "system__wch_stwS");
u00045 : constant Version_32 := 16#a831679c#;
pragma Export (C, u00045, "system__wch_cnvB");
u00046 : constant Version_32 := 16#1c91f7da#;
pragma Export (C, u00046, "system__wch_cnvS");
u00047 : constant Version_32 := 16#5ab55268#;
pragma Export (C, u00047, "interfacesS");
u00048 : constant Version_32 := 16#ece6fdb6#;
pragma Export (C, u00048, "system__wch_jisB");
u00049 : constant Version_32 := 16#9ce1eefb#;
pragma Export (C, u00049, "system__wch_jisS");
u00050 : constant Version_32 := 16#86dbf443#;
pragma Export (C, u00050, "system__parametersB");
u00051 : constant Version_32 := 16#40b73bd0#;
pragma Export (C, u00051, "system__parametersS");
u00052 : constant Version_32 := 16#75bf515c#;
pragma Export (C, u00052, "system__soft_links__initializeB");
u00053 : constant Version_32 := 16#5697fc2b#;
pragma Export (C, u00053, "system__soft_links__initializeS");
u00054 : constant Version_32 := 16#41837d1e#;
pragma Export (C, u00054, "system__stack_checkingB");
u00055 : constant Version_32 := 16#86e40413#;
pragma Export (C, u00055, "system__stack_checkingS");
u00056 : constant Version_32 := 16#96df1a3f#;
pragma Export (C, u00056, "ada__strings__mapsB");
u00057 : constant Version_32 := 16#1e526bec#;
pragma Export (C, u00057, "ada__strings__mapsS");
u00058 : constant Version_32 := 16#98e13b0e#;
pragma Export (C, u00058, "system__bit_opsB");
u00059 : constant Version_32 := 16#0765e3a3#;
pragma Export (C, u00059, "system__bit_opsS");
u00060 : constant Version_32 := 16#3cdd1378#;
pragma Export (C, u00060, "system__unsigned_typesS");
u00061 : constant Version_32 := 16#92f05f13#;
pragma Export (C, u00061, "ada__strings__maps__constantsS");
u00062 : constant Version_32 := 16#f64b89a4#;
pragma Export (C, u00062, "ada__integer_text_ioB");
u00063 : constant Version_32 := 16#2ec7c168#;
pragma Export (C, u00063, "ada__integer_text_ioS");
u00064 : constant Version_32 := 16#f4e097a7#;
pragma Export (C, u00064, "ada__text_ioB");
u00065 : constant Version_32 := 16#3913d0d6#;
pragma Export (C, u00065, "ada__text_ioS");
u00066 : constant Version_32 := 16#10558b11#;
pragma Export (C, u00066, "ada__streamsB");
u00067 : constant Version_32 := 16#67e31212#;
pragma Export (C, u00067, "ada__streamsS");
u00068 : constant Version_32 := 16#92d882c5#;
pragma Export (C, u00068, "ada__io_exceptionsS");
u00069 : constant Version_32 := 16#d398a95f#;
pragma Export (C, u00069, "ada__tagsB");
u00070 : constant Version_32 := 16#12a0afb8#;
pragma Export (C, u00070, "ada__tagsS");
u00071 : constant Version_32 := 16#796f31f1#;
pragma Export (C, u00071, "system__htableB");
u00072 : constant Version_32 := 16#8c99dc11#;
pragma Export (C, u00072, "system__htableS");
u00073 : constant Version_32 := 16#089f5cd0#;
pragma Export (C, u00073, "system__string_hashB");
u00074 : constant Version_32 := 16#2ec7b76f#;
pragma Export (C, u00074, "system__string_hashS");
u00075 : constant Version_32 := 16#b8e72903#;
pragma Export (C, u00075, "system__val_lluB");
u00076 : constant Version_32 := 16#51139e9a#;
pragma Export (C, u00076, "system__val_lluS");
u00077 : constant Version_32 := 16#269742a9#;
pragma Export (C, u00077, "system__val_utilB");
u00078 : constant Version_32 := 16#a4fbd905#;
pragma Export (C, u00078, "system__val_utilS");
u00079 : constant Version_32 := 16#ec4d5631#;
pragma Export (C, u00079, "system__case_utilB");
u00080 : constant Version_32 := 16#378ed9af#;
pragma Export (C, u00080, "system__case_utilS");
u00081 : constant Version_32 := 16#73d2d764#;
pragma Export (C, u00081, "interfaces__c_streamsB");
u00082 : constant Version_32 := 16#b1330297#;
pragma Export (C, u00082, "interfaces__c_streamsS");
u00083 : constant Version_32 := 16#4e0ce0a1#;
pragma Export (C, u00083, "system__crtlS");
u00084 : constant Version_32 := 16#ec083f01#;
pragma Export (C, u00084, "system__file_ioB");
u00085 : constant Version_32 := 16#af2a8e9e#;
pragma Export (C, u00085, "system__file_ioS");
u00086 : constant Version_32 := 16#86c56e5a#;
pragma Export (C, u00086, "ada__finalizationS");
u00087 : constant Version_32 := 16#95817ed8#;
pragma Export (C, u00087, "system__finalization_rootB");
u00088 : constant Version_32 := 16#47a91c6b#;
pragma Export (C, u00088, "system__finalization_rootS");
u00089 : constant Version_32 := 16#e4774a28#;
pragma Export (C, u00089, "system__os_libB");
u00090 : constant Version_32 := 16#d8e681fb#;
pragma Export (C, u00090, "system__os_libS");
u00091 : constant Version_32 := 16#2a8e89ad#;
pragma Export (C, u00091, "system__stringsB");
u00092 : constant Version_32 := 16#684d436e#;
pragma Export (C, u00092, "system__stringsS");
u00093 : constant Version_32 := 16#f5c4f553#;
pragma Export (C, u00093, "system__file_control_blockS");
u00094 : constant Version_32 := 16#fdedfd10#;
pragma Export (C, u00094, "ada__text_io__integer_auxB");
u00095 : constant Version_32 := 16#2fe01d89#;
pragma Export (C, u00095, "ada__text_io__integer_auxS");
u00096 : constant Version_32 := 16#181dc502#;
pragma Export (C, u00096, "ada__text_io__generic_auxB");
u00097 : constant Version_32 := 16#305a076a#;
pragma Export (C, u00097, "ada__text_io__generic_auxS");
u00098 : constant Version_32 := 16#b10ba0c7#;
pragma Export (C, u00098, "system__img_biuB");
u00099 : constant Version_32 := 16#faff9b35#;
pragma Export (C, u00099, "system__img_biuS");
u00100 : constant Version_32 := 16#4e06ab0c#;
pragma Export (C, u00100, "system__img_llbB");
u00101 : constant Version_32 := 16#bb388bcb#;
pragma Export (C, u00101, "system__img_llbS");
u00102 : constant Version_32 := 16#9dca6636#;
pragma Export (C, u00102, "system__img_lliB");
u00103 : constant Version_32 := 16#19143a2a#;
pragma Export (C, u00103, "system__img_lliS");
u00104 : constant Version_32 := 16#a756d097#;
pragma Export (C, u00104, "system__img_llwB");
u00105 : constant Version_32 := 16#1254a85d#;
pragma Export (C, u00105, "system__img_llwS");
u00106 : constant Version_32 := 16#eb55dfbb#;
pragma Export (C, u00106, "system__img_wiuB");
u00107 : constant Version_32 := 16#94be1ca7#;
pragma Export (C, u00107, "system__img_wiuS");
u00108 : constant Version_32 := 16#0f9783a4#;
pragma Export (C, u00108, "system__val_intB");
u00109 : constant Version_32 := 16#bda40698#;
pragma Export (C, u00109, "system__val_intS");
u00110 : constant Version_32 := 16#383fd226#;
pragma Export (C, u00110, "system__val_unsB");
u00111 : constant Version_32 := 16#09db6ec1#;
pragma Export (C, u00111, "system__val_unsS");
u00112 : constant Version_32 := 16#fb020d94#;
pragma Export (C, u00112, "system__val_lliB");
u00113 : constant Version_32 := 16#6435fd0b#;
pragma Export (C, u00113, "system__val_lliS");
u00114 : constant Version_32 := 16#8ba6725a#;
pragma Export (C, u00114, "mycommandlineB");
u00115 : constant Version_32 := 16#dbf720e9#;
pragma Export (C, u00115, "mycommandlineS");
u00116 : constant Version_32 := 16#01a73f89#;
pragma Export (C, u00116, "ada__command_lineB");
u00117 : constant Version_32 := 16#3cdef8c9#;
pragma Export (C, u00117, "ada__command_lineS");
u00118 : constant Version_32 := 16#e1642826#;
pragma Export (C, u00118, "mystringB");
u00119 : constant Version_32 := 16#ce083c8f#;
pragma Export (C, u00119, "mystringS");
u00120 : constant Version_32 := 16#72d5fbb0#;
pragma Export (C, u00120, "mystringtokeniserB");
u00121 : constant Version_32 := 16#fd8d8b9c#;
pragma Export (C, u00121, "mystringtokeniserS");
u00122 : constant Version_32 := 16#1d2481c9#;
pragma Export (C, u00122, "passworddatabaseB");
u00123 : constant Version_32 := 16#2cee8423#;
pragma Export (C, u00123, "passworddatabaseS");
u00124 : constant Version_32 := 16#179d7d28#;
pragma Export (C, u00124, "ada__containersS");
u00125 : constant Version_32 := 16#8225628b#;
pragma Export (C, u00125, "ada__containers__red_black_treesS");
u00126 : constant Version_32 := 16#bcec81df#;
pragma Export (C, u00126, "ada__containers__helpersB");
u00127 : constant Version_32 := 16#4adfc5eb#;
pragma Export (C, u00127, "ada__containers__helpersS");
u00128 : constant Version_32 := 16#020a3f4d#;
pragma Export (C, u00128, "system__atomic_countersB");
u00129 : constant Version_32 := 16#bc074276#;
pragma Export (C, u00129, "system__atomic_countersS");
u00130 : constant Version_32 := 16#2e260032#;
pragma Export (C, u00130, "system__storage_pools__subpoolsB");
u00131 : constant Version_32 := 16#cc5a1856#;
pragma Export (C, u00131, "system__storage_pools__subpoolsS");
u00132 : constant Version_32 := 16#d96e3c40#;
pragma Export (C, u00132, "system__finalization_mastersB");
u00133 : constant Version_32 := 16#53a75631#;
pragma Export (C, u00133, "system__finalization_mastersS");
u00134 : constant Version_32 := 16#7268f812#;
pragma Export (C, u00134, "system__img_boolB");
u00135 : constant Version_32 := 16#fd821e10#;
pragma Export (C, u00135, "system__img_boolS");
u00136 : constant Version_32 := 16#d7aac20c#;
pragma Export (C, u00136, "system__ioB");
u00137 : constant Version_32 := 16#961998b4#;
pragma Export (C, u00137, "system__ioS");
u00138 : constant Version_32 := 16#6d4d969a#;
pragma Export (C, u00138, "system__storage_poolsB");
u00139 : constant Version_32 := 16#2bb6f156#;
pragma Export (C, u00139, "system__storage_poolsS");
u00140 : constant Version_32 := 16#84042202#;
pragma Export (C, u00140, "system__storage_pools__subpools__finalizationB");
u00141 : constant Version_32 := 16#fe2f4b3a#;
pragma Export (C, u00141, "system__storage_pools__subpools__finalizationS");
u00142 : constant Version_32 := 16#039168f8#;
pragma Export (C, u00142, "system__stream_attributesB");
u00143 : constant Version_32 := 16#8bc30a4e#;
pragma Export (C, u00143, "system__stream_attributesS");
u00144 : constant Version_32 := 16#d33519d1#;
pragma Export (C, u00144, "passwordmanagerB");
u00145 : constant Version_32 := 16#3c6cb760#;
pragma Export (C, u00145, "passwordmanagerS");
u00146 : constant Version_32 := 16#0c5e1d96#;
pragma Export (C, u00146, "pinB");
u00147 : constant Version_32 := 16#553c8633#;
pragma Export (C, u00147, "pinS");
u00148 : constant Version_32 := 16#dde34de3#;
pragma Export (C, u00148, "system__exp_intB");
u00149 : constant Version_32 := 16#11785907#;
pragma Export (C, u00149, "system__exp_intS");
u00150 : constant Version_32 := 16#c9ad0aeb#;
pragma Export (C, u00150, "utilityS");
u00151 : constant Version_32 := 16#e31b7c4e#;
pragma Export (C, u00151, "system__memoryB");
u00152 : constant Version_32 := 16#512609cf#;
pragma Export (C, u00152, "system__memoryS");
-- BEGIN ELABORATION ORDER
-- ada%s
-- ada.characters%s
-- ada.characters.latin_1%s
-- interfaces%s
-- system%s
-- system.atomic_counters%s
-- system.atomic_counters%b
-- system.exp_int%s
-- system.exp_int%b
-- system.img_bool%s
-- system.img_bool%b
-- system.img_int%s
-- system.img_int%b
-- system.img_lli%s
-- system.img_lli%b
-- system.io%s
-- system.io%b
-- system.parameters%s
-- system.parameters%b
-- system.crtl%s
-- interfaces.c_streams%s
-- interfaces.c_streams%b
-- system.storage_elements%s
-- system.storage_elements%b
-- system.stack_checking%s
-- system.stack_checking%b
-- system.string_hash%s
-- system.string_hash%b
-- system.htable%s
-- system.htable%b
-- system.strings%s
-- system.strings%b
-- system.traceback_entries%s
-- system.traceback_entries%b
-- system.unsigned_types%s
-- system.img_biu%s
-- system.img_biu%b
-- system.img_llb%s
-- system.img_llb%b
-- system.img_llw%s
-- system.img_llw%b
-- system.img_wiu%s
-- system.img_wiu%b
-- system.wch_con%s
-- system.wch_con%b
-- system.wch_jis%s
-- system.wch_jis%b
-- system.wch_cnv%s
-- system.wch_cnv%b
-- system.traceback%s
-- system.traceback%b
-- system.secondary_stack%s
-- system.standard_library%s
-- ada.exceptions%s
-- system.exceptions_debug%s
-- system.exceptions_debug%b
-- system.soft_links%s
-- system.wch_stw%s
-- system.wch_stw%b
-- ada.exceptions.last_chance_handler%s
-- ada.exceptions.last_chance_handler%b
-- ada.exceptions.traceback%s
-- ada.exceptions.traceback%b
-- system.address_image%s
-- system.address_image%b
-- system.exception_table%s
-- system.exception_table%b
-- system.exceptions%s
-- system.exceptions%b
-- system.exceptions.machine%s
-- system.exceptions.machine%b
-- system.memory%s
-- system.memory%b
-- system.secondary_stack%b
-- system.soft_links.initialize%s
-- system.soft_links.initialize%b
-- system.soft_links%b
-- system.standard_library%b
-- system.traceback.symbolic%s
-- system.traceback.symbolic%b
-- ada.exceptions%b
-- ada.command_line%s
-- ada.command_line%b
-- ada.containers%s
-- ada.io_exceptions%s
-- ada.strings%s
-- system.case_util%s
-- system.case_util%b
-- system.os_lib%s
-- system.os_lib%b
-- system.val_util%s
-- system.val_util%b
-- system.val_llu%s
-- system.val_llu%b
-- ada.tags%s
-- ada.tags%b
-- ada.streams%s
-- ada.streams%b
-- system.file_control_block%s
-- system.finalization_root%s
-- system.finalization_root%b
-- ada.finalization%s
-- ada.containers.helpers%s
-- ada.containers.helpers%b
-- ada.containers.red_black_trees%s
-- system.file_io%s
-- system.file_io%b
-- system.storage_pools%s
-- system.storage_pools%b
-- system.finalization_masters%s
-- system.finalization_masters%b
-- system.storage_pools.subpools%s
-- system.storage_pools.subpools.finalization%s
-- system.storage_pools.subpools.finalization%b
-- system.storage_pools.subpools%b
-- system.stream_attributes%s
-- system.stream_attributes%b
-- system.val_lli%s
-- system.val_lli%b
-- system.val_uns%s
-- system.val_uns%b
-- system.val_int%s
-- system.val_int%b
-- ada.text_io%s
-- ada.text_io%b
-- ada.text_io.generic_aux%s
-- ada.text_io.generic_aux%b
-- ada.text_io.integer_aux%s
-- ada.text_io.integer_aux%b
-- ada.integer_text_io%s
-- ada.integer_text_io%b
-- system.bit_ops%s
-- system.bit_ops%b
-- ada.strings.maps%s
-- ada.strings.maps%b
-- ada.strings.maps.constants%s
-- ada.characters.handling%s
-- ada.characters.handling%b
-- mycommandline%s
-- mycommandline%b
-- mystring%s
-- mystring%b
-- mystringtokeniser%s
-- mystringtokeniser%b
-- passworddatabase%s
-- passworddatabase%b
-- pin%s
-- pin%b
-- passwordmanager%s
-- passwordmanager%b
-- utility%s
-- main%b
-- END ELABORATION ORDER
end ada_main;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S T Y L E S W --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Hostparm; use Hostparm;
with Opt; use Opt;
with Output; use Output;
package body Stylesw is
-- The following constant defines the default style options for -gnaty
Default_Style : constant String :=
"3" & -- indentation level is 3
"a" & -- check attribute casing
"A" & -- check array attribute indexes
"b" & -- check no blanks at end of lines
"c" & -- check comment formats
"e" & -- check end/exit labels present
"f" & -- check no form/feeds vertical tabs in source
"h" & -- check no horizontal tabs in source
"i" & -- check if-then layout
"k" & -- check casing rules for keywords
"l" & -- check reference manual layout
"m" & -- check line length <= 79 characters
"n" & -- check casing of package Standard idents
"p" & -- check pragma casing
"r" & -- check casing for identifier references
"s" & -- check separate subprogram specs present
"t"; -- check token separation rules
-- The following constant defines the GNAT style options, showing them
-- as additions to the standard default style check options.
GNAT_Style : constant String := Default_Style &
"d" & -- check no DOS line terminators
"I" & -- check mode IN
"S" & -- check separate lines after THEN or ELSE
"u" & -- check no unnecessary blank lines
"x"; -- check extra parentheses around conditionals
-- Note: we intend GNAT_Style to also include the following, but we do
-- not yet have the whole tool suite clean with respect to this.
-- "B" & -- check boolean operators
-------------------------------
-- Reset_Style_Check_Options --
-------------------------------
procedure Reset_Style_Check_Options is
begin
Style_Check_Indentation := 0;
Style_Check_Array_Attribute_Index := False;
Style_Check_Attribute_Casing := False;
Style_Check_Blanks_At_End := False;
Style_Check_Blank_Lines := False;
Style_Check_Boolean_And_Or := False;
Style_Check_Comments := False;
Style_Check_DOS_Line_Terminator := False;
Style_Check_End_Labels := False;
Style_Check_Form_Feeds := False;
Style_Check_Horizontal_Tabs := False;
Style_Check_If_Then_Layout := False;
Style_Check_Keyword_Casing := False;
Style_Check_Layout := False;
Style_Check_Max_Line_Length := False;
Style_Check_Max_Nesting_Level := False;
Style_Check_Missing_Overriding := False;
Style_Check_Mode_In := False;
Style_Check_Order_Subprograms := False;
Style_Check_Pragma_Casing := False;
Style_Check_References := False;
Style_Check_Separate_Stmt_Lines := False;
Style_Check_Specs := False;
Style_Check_Standard := False;
Style_Check_Tokens := False;
Style_Check_Xtra_Parens := False;
end Reset_Style_Check_Options;
---------------------
-- RM_Column_Check --
---------------------
function RM_Column_Check return Boolean is
begin
return Style_Check and Style_Check_Layout;
end RM_Column_Check;
------------------------------
-- Save_Style_Check_Options --
------------------------------
procedure Save_Style_Check_Options (Options : out Style_Check_Options) is
P : Natural := 0;
procedure Add (C : Character; S : Boolean);
-- Add given character C to string if switch S is true
procedure Add_Nat (N : Nat);
-- Add given natural number to string
---------
-- Add --
---------
procedure Add (C : Character; S : Boolean) is
begin
if S then
P := P + 1;
Options (P) := C;
end if;
end Add;
-------------
-- Add_Nat --
-------------
procedure Add_Nat (N : Nat) is
begin
if N > 9 then
Add_Nat (N / 10);
end if;
P := P + 1;
Options (P) := Character'Val (Character'Pos ('0') + N mod 10);
end Add_Nat;
-- Start of processing for Save_Style_Check_Options
begin
for K in Options'Range loop
Options (K) := ' ';
end loop;
Add (Character'Val (Style_Check_Indentation + Character'Pos ('0')),
Style_Check_Indentation /= 0);
Add ('a', Style_Check_Attribute_Casing);
Add ('A', Style_Check_Array_Attribute_Index);
Add ('b', Style_Check_Blanks_At_End);
Add ('B', Style_Check_Boolean_And_Or);
if Style_Check_Comments then
if Style_Check_Comments_Spacing = 2 then
Add ('c', Style_Check_Comments);
elsif Style_Check_Comments_Spacing = 1 then
Add ('C', Style_Check_Comments);
end if;
end if;
Add ('d', Style_Check_DOS_Line_Terminator);
Add ('e', Style_Check_End_Labels);
Add ('f', Style_Check_Form_Feeds);
Add ('h', Style_Check_Horizontal_Tabs);
Add ('i', Style_Check_If_Then_Layout);
Add ('I', Style_Check_Mode_In);
Add ('k', Style_Check_Keyword_Casing);
Add ('l', Style_Check_Layout);
Add ('n', Style_Check_Standard);
Add ('o', Style_Check_Order_Subprograms);
Add ('O', Style_Check_Missing_Overriding);
Add ('p', Style_Check_Pragma_Casing);
Add ('r', Style_Check_References);
Add ('s', Style_Check_Specs);
Add ('S', Style_Check_Separate_Stmt_Lines);
Add ('t', Style_Check_Tokens);
Add ('u', Style_Check_Blank_Lines);
Add ('x', Style_Check_Xtra_Parens);
if Style_Check_Max_Line_Length then
P := P + 1;
Options (P) := 'M';
Add_Nat (Style_Max_Line_Length);
end if;
if Style_Check_Max_Nesting_Level then
P := P + 1;
Options (P) := 'L';
Add_Nat (Style_Max_Nesting_Level);
end if;
pragma Assert (P <= Options'Last);
while P < Options'Last loop
P := P + 1;
Options (P) := ' ';
end loop;
end Save_Style_Check_Options;
-------------------------------------
-- Set_Default_Style_Check_Options --
-------------------------------------
procedure Set_Default_Style_Check_Options is
begin
Reset_Style_Check_Options;
Set_Style_Check_Options (Default_Style);
end Set_Default_Style_Check_Options;
----------------------------------
-- Set_GNAT_Style_Check_Options --
----------------------------------
procedure Set_GNAT_Style_Check_Options is
begin
Reset_Style_Check_Options;
Set_Style_Check_Options (GNAT_Style);
end Set_GNAT_Style_Check_Options;
-----------------------------
-- Set_Style_Check_Options --
-----------------------------
-- Version used when no error checking is required
procedure Set_Style_Check_Options (Options : String) is
OK : Boolean;
EC : Natural;
pragma Warnings (Off, EC);
begin
Set_Style_Check_Options (Options, OK, EC);
pragma Assert (OK);
end Set_Style_Check_Options;
-- Normal version with error checking
procedure Set_Style_Check_Options
(Options : String;
OK : out Boolean;
Err_Col : out Natural)
is
C : Character;
On : Boolean := True;
-- Set to False if minus encountered
-- Set to True if plus encountered
Last_Option : Character := ' ';
-- Set to last character encountered
procedure Add_Img (N : Natural);
-- Concatenates image of N at end of Style_Msg_Buf
procedure Bad_Style_Switch (Msg : String);
-- Called if bad style switch found. Msg is set in Style_Msg_Buf and
-- Style_Msg_Len. OK is set False.
-------------
-- Add_Img --
-------------
procedure Add_Img (N : Natural) is
begin
if N >= 10 then
Add_Img (N / 10);
end if;
Style_Msg_Len := Style_Msg_Len + 1;
Style_Msg_Buf (Style_Msg_Len) :=
Character'Val (N mod 10 + Character'Pos ('0'));
end Add_Img;
----------------------
-- Bad_Style_Switch --
----------------------
procedure Bad_Style_Switch (Msg : String) is
begin
OK := False;
Style_Msg_Len := Msg'Length;
Style_Msg_Buf (1 .. Style_Msg_Len) := Msg;
end Bad_Style_Switch;
-- Start of processing for Set_Style_Check_Options
begin
Err_Col := Options'First;
while Err_Col <= Options'Last loop
C := Options (Err_Col);
Last_Option := C;
Err_Col := Err_Col + 1;
-- Turning switches on
if On then
case C is
when '+' =>
null;
when '-' =>
On := False;
when '0' .. '9' =>
Style_Check_Indentation :=
Character'Pos (C) - Character'Pos ('0');
when 'a' =>
Style_Check_Attribute_Casing := True;
when 'A' =>
Style_Check_Array_Attribute_Index := True;
when 'b' =>
Style_Check_Blanks_At_End := True;
when 'B' =>
Style_Check_Boolean_And_Or := True;
when 'c' =>
Style_Check_Comments := True;
Style_Check_Comments_Spacing := 2;
when 'C' =>
Style_Check_Comments := True;
Style_Check_Comments_Spacing := 1;
when 'd' =>
Style_Check_DOS_Line_Terminator := True;
when 'e' =>
Style_Check_End_Labels := True;
when 'f' =>
Style_Check_Form_Feeds := True;
when 'g' =>
Set_GNAT_Style_Check_Options;
when 'h' =>
Style_Check_Horizontal_Tabs := True;
when 'i' =>
Style_Check_If_Then_Layout := True;
when 'I' =>
Style_Check_Mode_In := True;
when 'k' =>
Style_Check_Keyword_Casing := True;
when 'l' =>
Style_Check_Layout := True;
when 'L' =>
Style_Max_Nesting_Level := 0;
if Err_Col > Options'Last
or else Options (Err_Col) not in '0' .. '9'
then
Bad_Style_Switch ("invalid nesting level");
return;
end if;
loop
Style_Max_Nesting_Level :=
Style_Max_Nesting_Level * 10 +
Character'Pos (Options (Err_Col)) - Character'Pos ('0');
if Style_Max_Nesting_Level > 999 then
Bad_Style_Switch
("max nesting level (999) exceeded in style check");
return;
end if;
Err_Col := Err_Col + 1;
exit when Err_Col > Options'Last
or else Options (Err_Col) not in '0' .. '9';
end loop;
Style_Check_Max_Nesting_Level := Style_Max_Nesting_Level /= 0;
when 'm' =>
Style_Check_Max_Line_Length := True;
Style_Max_Line_Length := 79;
when 'M' =>
Style_Max_Line_Length := 0;
if Err_Col > Options'Last
or else Options (Err_Col) not in '0' .. '9'
then
Bad_Style_Switch
("invalid line length in style check");
return;
end if;
loop
Style_Max_Line_Length :=
Style_Max_Line_Length * 10 +
Character'Pos (Options (Err_Col)) - Character'Pos ('0');
if Style_Max_Line_Length > Int (Max_Line_Length) then
OK := False;
Style_Msg_Buf (1 .. 27) := "max line length allowed is ";
Style_Msg_Len := 27;
Add_Img (Natural (Max_Line_Length));
return;
end if;
Err_Col := Err_Col + 1;
exit when Err_Col > Options'Last
or else Options (Err_Col) not in '0' .. '9';
end loop;
Style_Check_Max_Line_Length := Style_Max_Line_Length /= 0;
when 'n' =>
Style_Check_Standard := True;
when 'N' =>
Reset_Style_Check_Options;
when 'o' =>
Style_Check_Order_Subprograms := True;
when 'O' =>
Style_Check_Missing_Overriding := True;
when 'p' =>
Style_Check_Pragma_Casing := True;
when 'r' =>
Style_Check_References := True;
when 's' =>
Style_Check_Specs := True;
when 'S' =>
Style_Check_Separate_Stmt_Lines := True;
when 't' =>
Style_Check_Tokens := True;
when 'u' =>
Style_Check_Blank_Lines := True;
when 'x' =>
Style_Check_Xtra_Parens := True;
when 'y' =>
Set_Default_Style_Check_Options;
when ' ' =>
null;
when others =>
if Ignore_Unrecognized_VWY_Switches then
Write_Line ("unrecognized switch -gnaty" & C & " ignored");
else
Err_Col := Err_Col - 1;
Bad_Style_Switch ("invalid style switch");
return;
end if;
end case;
-- Turning switches off
else
case C is
when '+' =>
On := True;
when '-' =>
null;
when '0' .. '9' =>
Style_Check_Indentation := 0;
when 'a' =>
Style_Check_Attribute_Casing := False;
when 'A' =>
Style_Check_Array_Attribute_Index := False;
when 'b' =>
Style_Check_Blanks_At_End := False;
when 'B' =>
Style_Check_Boolean_And_Or := False;
when 'c' | 'C' =>
Style_Check_Comments := False;
when 'd' =>
Style_Check_DOS_Line_Terminator := False;
when 'e' =>
Style_Check_End_Labels := False;
when 'f' =>
Style_Check_Form_Feeds := False;
when 'g' =>
Reset_Style_Check_Options;
when 'h' =>
Style_Check_Horizontal_Tabs := False;
when 'i' =>
Style_Check_If_Then_Layout := False;
when 'I' =>
Style_Check_Mode_In := False;
when 'k' =>
Style_Check_Keyword_Casing := False;
when 'l' =>
Style_Check_Layout := False;
when 'L' =>
Style_Max_Nesting_Level := 0;
when 'm' =>
Style_Check_Max_Line_Length := False;
when 'M' =>
Style_Max_Line_Length := 0;
Style_Check_Max_Line_Length := False;
when 'n' =>
Style_Check_Standard := False;
when 'o' =>
Style_Check_Order_Subprograms := False;
when 'O' =>
Style_Check_Missing_Overriding := False;
when 'p' =>
Style_Check_Pragma_Casing := False;
when 'r' =>
Style_Check_References := False;
when 's' =>
Style_Check_Specs := False;
when 'S' =>
Style_Check_Separate_Stmt_Lines := False;
when 't' =>
Style_Check_Tokens := False;
when 'u' =>
Style_Check_Blank_Lines := False;
when 'x' =>
Style_Check_Xtra_Parens := False;
when ' ' =>
null;
when others =>
if Ignore_Unrecognized_VWY_Switches then
Write_Line ("unrecognized switch -gnaty-" & C & " ignored");
else
Err_Col := Err_Col - 1;
Bad_Style_Switch ("invalid style switch");
return;
end if;
end case;
end if;
end loop;
-- Turn on style checking if other than N at end of string
Style_Check := (Last_Option /= 'N');
OK := True;
end Set_Style_Check_Options;
end Stylesw;
|
-- public domain
with Ada.Calendar;
with Ada.Characters.Latin_1;
with Ada.Strings.Maps.Constants;
with Ada.Strings.Maps;
with Ada.Strings.Fixed;
with Ada.Text_IO;
with Interfaces;
package body String_Ops is
use type Interfaces.Unsigned_32;
use type Ada.Strings.Maps.Character_Set;
Hex_Conversion : constant array (Interfaces.Unsigned_32 range 0..15)
of character :=
(00 => '0',
01 => '1',
02 => '2',
03 => '3',
04 => '4',
05 => '5',
06 => '6',
07 => '7',
08 => '8',
09 => '9',
10 => 'A',
11 => 'B',
12 => 'C',
13 => 'D',
14 => 'E',
15 => 'F');
-- All the control characters plus space and non-breaking-space.
--
White_Space_Set : constant Ada.Strings.Maps.Character_Set :=
Ada.Strings.Maps.To_Set(Ada.Characters.Latin_1.Space & Ada.Characters.Latin_1.NBSP) or
Ada.Strings.Maps.Constants.Control_Set;
-----------------------------------------------------------------------------
function Is_White_Space
(Char : in Character) return Boolean is
begin
return Ada.Strings.Maps.Is_In(Char, White_Space_Set);
end Is_White_Space;
-----------------------------------------------------------------------------
procedure Stuff
(This : in String;
Into : out String) is
begin
if This'LENGTH >= Into'LENGTH then
Into := This(This'FIRST .. This'FIRST + Into'LENGTH - 1);
else
Into(Into'FIRST .. Into'FIRST + This'LENGTH - 1) := This;
Into(Into'FIRST + This'LENGTH .. Into'LAST) := (others => ' ');
end if;
end Stuff;
-----------------------------------------------------------------------------
procedure Stuff_Right
(This : in String;
Into : out String) is
begin
if This'LENGTH >= Into'LENGTH then
Into := This(This'FIRST .. This'FIRST + Into'LENGTH - 1);
else
Into(Into'LAST - This'LENGTH + 1 .. Into'LAST) := This;
Into(Into'FIRST .. Into'LAST - This'LENGTH) := (others => ' ');
end if;
end Stuff_Right;
-----------------------------------------------------------------------------
procedure Stuff_Number
(Number : in Integer;
Into : out String) is
Digit : Integer;
Work : Integer := abs(Number);
begin
for Index in reverse Into'RANGE loop
Digit := Work mod 10;
Into(Index) := Character'VAL(Digit + 48);
Work := Work / 10;
end loop;
end Stuff_Number;
-----------------------------------------------------------------------------
procedure Stuff_Hex
(Number : in Interfaces.Unsigned_32;
Into : out String) is
Digit : Interfaces.Unsigned_32;
Work : Interfaces.Unsigned_32 := Number;
begin
for Index in reverse Into'RANGE loop
Digit := Work mod 16;
Into(Index) := Hex_Conversion(Digit);
Work := Work / 16;
end loop;
end Stuff_Hex;
-----------------------------------------------------------------------------
function Drop_Ada_Comments
(The_String : String) return String is
Index : Integer := The_String'FIRST;
Dash_Count : Integer := 0;
begin
Comment_Loop:
while Index <= The_String'LAST loop
if The_String (Index) = '-' then
Dash_Count := Dash_Count + 1;
else
Dash_Count := 0;
end if;
if Dash_Count = 2 then
Index := Index - 2; -- reset it to before the "--"
exit Comment_Loop;
else
Index := Index + 1;
end if;
end loop Comment_Loop;
return The_String (The_String'FIRST .. Index - 1);
end Drop_Ada_Comments;
-----------------------------------------------------------------------------
function Drop_Vole_Comments
(The_String : String) return String is
In_Q : Boolean := False;
begin
for I in The_String'RANGE loop
if The_String(I) = '"' then
In_Q := not In_Q;
end if;
if (not In_Q) and then The_String(I) = '#' then
return The_String(The_String'FIRST .. I-1);
end if;
end loop;
return The_String;
end Drop_Vole_Comments;
-----------------------------------------------------------------------------
function Up_Case
(The_String : String) return String is
begin
return Ada.Strings.Fixed.Translate(The_String, Ada.Strings.Maps.Constants.Upper_Case_Map);
end Up_Case;
-----------------------------------------------------------------------------
function Down_Case
(The_String : String) return String is
begin
return Ada.Strings.Fixed.Translate(The_String, Ada.Strings.Maps.Constants.Lower_Case_Map);
end Down_Case;
-----------------------------------------------------------------------------
function Trim_Blanks
(The_String : String) return String is
Starting : Integer := The_String'FIRST;
Ending : Integer := The_String'LAST;
begin
while Starting < Ending loop
if Is_White_Space(The_String(Starting)) then
Starting := Starting + 1;
else
exit;
end if;
end loop;
while Ending >= Starting loop
if Is_White_Space(The_String(Ending)) then
Ending := Ending - 1;
else
exit;
end if;
end loop;
return The_String(Starting .. Ending);
end Trim_Blanks;
----------------------------------------------------------------------------
function Trim_One_From_Both_Ends(The_String : String) return String is
Index_First : constant Positive := The_String'FIRST + 1;
Index_Last : constant Positive := The_String'LAST - 1;
begin
return The_String(Index_First..Index_Last);
end Trim_One_From_Both_Ends;
-----------------------------------------------------------------------------
function Filter
(The_String : String) return String is
New_String : String(1..The_String'LENGTH);
J : Positive := New_String'FIRST;
begin
for I in The_String'RANGE loop
if The_String(I) in Ada.Characters.Latin_1.Space .. Ada.Characters.Latin_1.Tilde then
New_String(J) := The_String(I);
J := J + 1;
end if;
end loop;
return New_String(1..J-1);
end Filter;
-----------------------------------------------------------------------------
-- Return the first substring of Str (deliniated by a space).
--
function First
(Str : in String) return String is
begin
for I in Str'RANGE loop
if Is_White_Space(Str(I)) then
return Str(Str'FIRST..I-1);
end if;
end loop;
return Str; -- no blanks, return the whole string.
end First;
-----------------------------------------------------------------------------
-- Return the second part of Str.
--
function Rest
(Str : in String) return String is
B : Boolean := False; -- found a blank
begin
for I in Str'RANGE loop
if Is_White_Space(Str(I)) then
B := True;
elsif B then
return Str(I..Str'LAST);
end if;
end loop;
return ""; -- there was no second part to Str
end Rest;
-----------------------------------------------------------------------------
function Second
(Str : in String) return String is
type Search_State_Type is (Start, Blank_1, Word_1, Blank_2, Word_2);
S : Search_State_Type := Start;
L : Natural := 0;
begin
for I in Str'RANGE loop
case S is
when Start => if Is_White_Space(Str(I)) then S := Blank_1; else S := Word_1; end if;
when Blank_1 => if not Is_White_Space(Str(I)) then S := Word_1; end if;
when Word_1 => if Is_White_Space(Str(I)) then S := Blank_2; end if;
when Blank_2 => if not Is_White_Space(Str(I)) then S := Word_2; L := I; end if;
when Word_2 => if Is_White_Space(Str(I)) then return Str(L..I-1); end if;
end case;
end loop;
if S = Word_2 then
return Str(L..Str'LAST);
else
return ""; -- there was no second part to Str
end if;
end Second;
-----------------------------------------------------------------------------
function Second_Rest
(Str : in String) return String is
type Search_State_Type is (Start, Blank_1, Word_1, Blank_2, Word_2, Blank_3);
S : Search_State_Type := Start;
begin
for I in Str'RANGE loop
case S is
when Start => if Is_White_Space(Str(I)) then S := Blank_1; else S := Word_1; end if;
when Blank_1 => if not Is_White_Space(Str(I)) then S := Word_1; end if;
when Word_1 => if Is_White_Space(Str(I)) then S := Blank_2; end if;
when Blank_2 => if not Is_White_Space(Str(I)) then S := Word_2; end if;
when Word_2 => if Is_White_Space(Str(I)) then S := Blank_3; end if;
when Blank_3 => if not Is_White_Space(Str(I)) then return Str(I..Str'LAST); end if;
end case;
end loop;
return ""; -- there was no third part to Str
end Second_Rest;
-----------------------------------------------------------------------------
function Third
(Str : in String) return String is
type Search_State_Type is (Start, Blank_1, Word_1, Blank_2, Word_2, Blank_3, Word_3);
S : Search_State_Type := Start;
L : Natural := 0;
begin
for I in Str'RANGE loop
case S is
when Start => if Is_White_Space(Str(I)) then S := Blank_1; else S := Word_1; end if;
when Blank_1 => if not Is_White_Space(Str(I)) then S := Word_1; end if;
when Word_1 => if Is_White_Space(Str(I)) then S := Blank_2; end if;
when Blank_2 => if not Is_White_Space(Str(I)) then S := Word_2; end if;
when Word_2 => if Is_White_Space(Str(I)) then S := Blank_3; end if;
when Blank_3 => if not Is_White_Space(Str(I)) then S := Word_3; L := I; end if;
when Word_3 => if Is_White_Space(Str(I)) then return Str(L..I-1); end if;
end case;
end loop;
if S = Word_3 then
return Str(L..Str'LAST);
else
return ""; -- there was no second part to Str
end if;
end Third;
-----------------------------------------------------------------------------
function Nth
(Str : in String;
N : in Positive) return String is
Init_State : constant := 0;
State : Natural := Init_State; -- 0 = init, odd = blank, even = word
Start : Natural := Str'FIRST;
Last_Word : Positive := N * 2;
Last_Blank : Positive := Last_Word - 1;
begin
for I in Str'RANGE loop
if State = Init_State then if Is_White_Space(Str(I)) then State := 1; else State := 2; end if;
elsif State = Last_Blank then if not Is_White_Space(Str(I)) then State := State + 1; Start := I; end if;
elsif State = Last_Word then if Is_White_Space(Str(I)) then return Str(Start..I - 1); end if;
elsif State mod 2 = 1 then if not Is_White_Space(Str(I)) then State := State + 1; end if;
else if Is_White_Space(Str(I)) then State := State + 1; end if;
end if;
end loop;
if State = Last_Word then
return Str(Start..Str'LAST);
else
return ""; -- there was no second part to Str
end if;
end Nth;
-----------------------------------------------------------------------------
function Nth
(Str : in String;
N : in Positive;
Set : in Ada.Strings.Maps.Character_Set) return String is
Init_State : constant := 0;
State : Natural := Init_State; -- 0 = init, odd = blank, even = word
Start : Natural := Str'FIRST;
Last_Word : Positive := N * 2;
Last_Blank : Positive := Last_Word - 1;
use Ada.Strings.Maps;
begin
for I in Str'RANGE loop
if State = Init_State then if Is_In(Str(I), Set) then State := 1; else State := 2; end if;
elsif State = Last_Blank then if not Is_In(Str(I), Set) then State := State + 1; Start := I; end if;
elsif State = Last_Word then if Is_In(Str(I), Set) then return Str(Start..I - 1); end if;
elsif State mod 2 = 1 then if not Is_In(Str(I), Set) then State := State + 1; end if;
else if Is_In(Str(I), Set) then State := State + 1; end if;
end if;
end loop;
if State = Last_Word then
return Str(Start..Str'LAST);
else
return ""; -- there was no second part to Str
end if;
end Nth;
-----------------------------------------------------------------------------
function Same(L, R : in String) return Boolean is
A : String(1..L'LENGTH);
B : String(1..R'LENGTH);
begin
if L'LENGTH = R'LENGTH then
A := Ada.Strings.Fixed.Translate(L, Ada.Strings.Maps.Constants.Lower_Case_Map);
B := Ada.Strings.Fixed.Translate(R, Ada.Strings.Maps.Constants.Lower_Case_Map);
return A = B;
end if;
return False;
end Same;
-----------------------------------------------------------------------------
function Conformance
(Master : in String;
Check : in String) return Boolean is
Master_I : Positive := Master'FIRST;
Check_I : Positive := Check'FIRST;
Different : Boolean := False;
begin
--if Verbose then Put_Line("Conformance master <"&Master&"> = <"&Check&">?"); end if;
while Master_I <= Master'LAST and Check_I <= Check'LAST and not Different loop
Different := Master(Master_I) /= Check(Check_I);
Master_I := Master_I + 1;
Check_I := Check_I + 1;
end loop;
return not Different;
end Conformance;
-----------------------------------------------------------------------------
function Integer_To_Hex_String
(Value : in Interfaces.Unsigned_32) return String is
Hex_String_Value : String (1 .. 13) := "16#0000_0000#";
Remainder : Interfaces.Unsigned_32 := Value;
Hex_Value : Interfaces.Unsigned_32;
Position : Integer := 12;
begin
while Remainder /= 0 and Position > 3 loop
Hex_Value := Remainder mod 16;
Remainder := (Remainder - Hex_Value) / 16;
Hex_String_Value(Position) := Hex_Conversion(Hex_Value);
Position := Position - 1;
if Position = 8 then
Position := 7;
end if;
end loop;
return Hex_String_Value;
end Integer_To_Hex_String;
-----------------------------------------------------------------------------
function Str
(Int : Integer) return String is
Last : constant := 30;
Zero : constant := Character'Pos('0');
Converted_Number : String(1..Last);
Number : Integer := abs(Int);
Digit : Integer := 0;
Index : Integer := Last + 1;
begin
if Int = 0 then
Index := Index - 1;
Converted_Number(Index) := '0';
else
while Number /= 0 loop
Digit := Number rem 10;
Number := Number / 10;
Index := Index - 1;
Converted_Number(Index) := Character'Val(Zero + Digit);
end loop;
if Int < 0 then
Index := Index - 1;
Converted_Number(Index) := '-';
end if;
end if;
return Converted_Number(Index..Last);
end Str;
-----------------------------------------------------------------------------
function Str
(Int : Interfaces.Unsigned_32) return String is
Last : constant := 30;
Converted_Number : String(1..Last);
Number : Interfaces.Unsigned_32 := Int;
Digit : Interfaces.Unsigned_32 := 0;
Index : Integer := Last + 1;
begin
if Int = 0 then
Index := Index - 1;
Converted_Number(Index) := '0';
else
while Number /= 0 loop
Digit := Number rem 16;
Number := Number / 16;
Index := Index - 1;
Converted_Number(Index) := Hex_Conversion(Digit);
end loop;
end if;
return Converted_Number(Index..Last);
end Str;
-----------------------------------------------------------------------------
function Img
(Flt : Float) return String is
package Flt_IO is new Ada.Text_IO.Float_IO(Float);
A : constant Float := abs(Flt);
F : String(1..20) := (others => ' ');
Aft : Natural;
begin
if A in 0.001 .. 10000.0 then
if A >= 10000.0 then
Aft := 1;
elsif A >= 1000.0 then
Aft := 2;
elsif A >= 100.0 then
Aft := 3;
elsif A >= 10.0 then
Aft := 4;
elsif A >= 1.0 then
Aft := 5;
elsif A >= 0.1 then
Aft := 6;
elsif A >= 0.01 then
Aft := 7;
else
Aft := 8;
end if;
Flt_IO.Put(F, Flt, Aft, Exp => 0);
return Trim_Blanks(F);
else
return Trim_Blanks(Float'IMAGE(Flt));
end if;
end Img;
-----------------------------------------------------------------------------
function Value
(Str : String) return Float is
Has_Dot : Boolean := False;
begin
for I in Str'RANGE loop
Has_Dot := Str(I) = '.';
exit when Has_Dot;
end loop;
if Has_Dot then
return Float'VALUE(Str);
else
return Float(Integer'VALUE(Str));
end if;
end Value;
-----------------------------------------------------------------------------
function Value
(Str : String) return Integer is
begin
return Integer'VALUE(Str);
end Value;
-----------------------------------------------------------------------------
function IP_Address
(Addr : Interfaces.Unsigned_32) return String is
Temp : Interfaces.Unsigned_32 := Addr;
A, B, C, D : Integer;
begin
D := Integer(Temp mod 16#1_00#);
Temp := Temp / 16#1_00#;
C := Integer(Temp mod 16#1_00#);
Temp := Temp / 16#1_00#;
B := Integer(Temp mod 16#1_00#);
A := Integer(Temp / 16#1_00#);
return Str(A) & '.' & Str(B) & '.' & Str(C) & '.' & Str(D);
end IP_Address;
type Month_Name_Table_Type is array (Ada.Calendar.Month_Number) of String_Pointer_Type;
Month_Name_Table : constant Month_Name_Table_Type :=
(01 => new String'("January"),
02 => new String'("February"),
03 => new String'("March"),
04 => new String'("April"),
05 => new String'("May"),
06 => new String'("June"),
07 => new String'("July"),
08 => new String'("August"),
09 => new String'("September"),
10 => new String'("October"),
11 => new String'("November"),
12 => new String'("December"));
-----------------------------------------------------------------------------
function Long_Date
(Date : in Ada.Calendar.Time := Ada.Calendar.Clock) return String is
Year : Ada.Calendar.Year_Number;
Month : Ada.Calendar.Month_Number;
Day : Ada.Calendar.Day_Number;
Seconds : Ada.Calendar.Day_Duration;
Hours : Integer;
Minutes : Integer;
Secs : Integer;
Hours_Image : String(1..2);
Minutes_Image : String(1..2);
Seconds_Image : String(1..2);
AM_PM : String := "am";
C : constant Character := ':';
begin
Ada.Calendar.Split
(Date => Date,
Year => Year,
Month => Month,
Day => Day,
Seconds => Seconds);
Secs := Integer(Seconds);
Minutes := Secs / 60;
Secs := Secs mod 60;
Hours := Minutes / 60;
Minutes := Minutes mod 60;
if Hours > 12 then
AM_PM := "pm";
Hours := Hours - 12;
end if;
Stuff_Number(Hours, Hours_Image);
Stuff_Number(Minutes, Minutes_Image);
Stuff_Number(Secs, Seconds_Image);
return Month_Name_Table(Month).all & Ada.Calendar.Day_Number'IMAGE(Day) &
", " & Str(Year) & ", " & Hours_Image &C& Minutes_Image &C& Seconds_Image &
" " & AM_PM;
end Long_Date;
-----------------------------------------------------------------------------
function Short_Date
(Date : in Ada.Calendar.Time := Ada.Calendar.Clock) return String is
Year : Ada.Calendar.Year_Number;
Month : Ada.Calendar.Month_Number;
Day : Ada.Calendar.Day_Number;
Seconds : Ada.Calendar.Day_Duration;
Hours : Integer;
Minutes : Integer;
Secs : Integer;
Month_Image : String(1..2);
Day_Image : String(1..2);
Hours_Image : String(1..2);
Minutes_Image : String(1..2);
Seconds_Image : String(1..2);
C : constant Character := ':';
S : constant Character := '/';
begin
Ada.Calendar.Split
(Date => Date,
Year => Year,
Month => Month,
Day => Day,
Seconds => Seconds);
Secs := Integer(Seconds);
Minutes := Secs / 60;
Secs := Secs mod 60;
Hours := Minutes / 60;
Minutes := Minutes mod 60;
Stuff_Number(Month, Month_Image);
Stuff_Number(Day, Day_Image);
Stuff_Number(Hours, Hours_Image);
Stuff_Number(Minutes, Minutes_Image);
Stuff_Number(Secs, Seconds_Image);
return Str(Year) &S& Month_Image &S& Day_Image & ' ' & Hours_Image &C& Minutes_Image &C& Seconds_Image;
end Short_Date;
-----------------------------------------------------------------------------
function Date_As_Filename
(Date : in Ada.Calendar.Time := Ada.Calendar.Clock) return String is
Year : Ada.Calendar.Year_Number;
Month : Ada.Calendar.Month_Number;
Day : Ada.Calendar.Day_Number;
Seconds : Ada.Calendar.Day_Duration;
Hours : Integer;
Minutes : Integer;
Secs : Integer;
Month_Image : String(1..2);
Day_Image : String(1..2);
Hours_Image : String(1..2);
Minutes_Image : String(1..2);
Seconds_Image : String(1..2);
begin
Ada.Calendar.Split
(Date => Date,
Year => Year,
Month => Month,
Day => Day,
Seconds => Seconds);
Secs := Integer(Seconds);
Minutes := Secs / 60;
Secs := Secs mod 60;
Hours := Minutes / 60;
Minutes := Minutes mod 60;
Stuff_Number(Month, Month_Image);
Stuff_Number(Day, Day_Image);
Stuff_Number(Hours, Hours_Image);
Stuff_Number(Minutes, Minutes_Image);
Stuff_Number(Secs, Seconds_Image);
return 'y' & Str(Year) & 'm' & Month_Image & 'd' & Day_Image & "_h" &
Hours_Image & 'm' & Minutes_Image & 's' & Seconds_Image;
end Date_As_Filename;
-----------------------------------------------------------------------------
package body Selection_Ops is
-----------------------------------------------------------------------------
function String_Matches
(Str : in String) return Boolean is
Match_Count : Natural := 0;
Cap_Str : constant String := Up_Case(Str);
begin
for Index in Selection_Type loop
if Conformance(Selection_Type'IMAGE(Index), Cap_Str) then
Match_Count := Match_Count + 1;
end if;
end loop;
return Match_Count = 1;
end String_Matches;
-----------------------------------------------------------------------------
-- Return the number of "Conformance" matches.
--
function String_Matches
(Str : in String) return Natural is
Match_Count : Natural := 0;
Cap_Str : constant String := Up_Case(Str);
begin
for Index in Selection_Type loop
if Conformance(Selection_Type'IMAGE(Index), Cap_Str) then
Match_Count := Match_Count + 1;
end if;
end loop;
return Match_Count;
end String_Matches;
-----------------------------------------------------------------------------
function To_Selection
(Str : in String) return Selection_Type is
Cap_Str : constant String := Up_Case(Str);
begin
for Index in Selection_Type loop
if Conformance(Selection_Type'IMAGE(Index), Cap_Str) then
return Index;
end if;
end loop;
return Selection_Type'FIRST; -- error state
end To_Selection;
end Selection_Ops;
end String_Ops;
|
-- C43215A.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 CONSTRAINT_ERROR IS RAISED FOR A POSITIONAL
-- ARRAY AGGREGATE WHOSE UPPER BOUND EXCEEDS THE UPPER BOUND
-- OF THE INDEX SUBTYPE BUT BELONGS TO THE INDEX BASE TYPE.
-- EG 02/13/84
WITH REPORT;
WITH SYSTEM;
PROCEDURE C43215A IS
USE REPORT;
USE SYSTEM;
BEGIN
TEST("C43215A","CHECK THAT CONSTRAINT_ERROR IS RAISED " &
"FOR A POSITIONAL ARRAY AGGREGATE WHOSE " &
"UPPER BOUND EXCEEDS THE UPPER BOUND OF THE " &
"INDEX SUBTYPE BUT BELONGS TO THE INDEX " &
"BASE TYPE");
BEGIN
CASE_A : DECLARE
LOWER_BOUND : CONSTANT := MAX_INT-3;
UPPER_BOUND : CONSTANT := MAX_INT-1;
TYPE STA IS RANGE LOWER_BOUND .. UPPER_BOUND;
TYPE TA IS ARRAY(STA RANGE <>) OF INTEGER;
A1 : TA(STA);
OK : EXCEPTION;
FUNCTION FUN1 RETURN TA IS
BEGIN
RETURN (1, 2, 3, 4);
EXCEPTION
WHEN CONSTRAINT_ERROR =>
BEGIN
COMMENT ("CASE A : CONSTRAINT_ERROR RAISED");
RAISE OK;
END;
WHEN OTHERS =>
BEGIN
FAILED ("CASE A : EXCEPTION RAISED IN FUN1");
RAISE OK;
END;
END FUN1;
BEGIN
A1 := FUN1;
FAILED ("CASE A : CONSTRAINT_ERROR NOT RAISED");
EXCEPTION
WHEN OK =>
NULL;
WHEN OTHERS =>
FAILED ("CASE A : EXCEPTION RAISED");
END CASE_A;
CASE_B : DECLARE
TYPE ENUM IS (A, B, C, D);
SUBTYPE STB IS ENUM RANGE A .. C;
TYPE TB IS ARRAY(STB RANGE <>) OF INTEGER;
B1 : TB(STB);
OK : EXCEPTION;
FUNCTION FUN1 RETURN TB IS
BEGIN
RETURN (1, 2, 3, 4);
EXCEPTION
WHEN CONSTRAINT_ERROR =>
BEGIN
COMMENT ("CASE B : CONSTRAINT_ERROR RAISED");
RAISE OK;
END;
WHEN OTHERS =>
BEGIN
FAILED ("CASE B : EXCEPTION RAISED IN FUN1");
RAISE OK;
END;
END FUN1;
BEGIN
B1 := FUN1;
FAILED ("CASE B : CONSTRAINT_ERROR NOT RAISED");
EXCEPTION
WHEN OK =>
NULL;
WHEN OTHERS =>
FAILED ("CASE B : EXCEPTION RAISED");
END CASE_B;
END;
RESULT;
END C43215A;
|
-- BSD 3-Clause License
--
-- Copyright (c) 2017, 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 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.Wide_Wide_Text_IO;
with AWS.URL;
with AWS.Response;
package body CvsWeb.HTTP is
---------
-- Get --
---------
not overriding procedure Get
(Self : in out Connection;
URL : League.Strings.Universal_String;
Result : out League.Stream_Element_Vectors.Stream_Element_Vector;
Success : out Boolean)
is
Request : constant AWS.URL.Object :=
AWS.URL.Parse (URL.To_UTF_8_String);
Response : AWS.Response.Data;
begin
if not Self.Ready then
AWS.Client.Create
(Connection => Self.Server,
Host => AWS.URL.URL (Request));
Self.Ready := True;
end if;
Ada.Wide_Wide_Text_IO.Put_Line (URL.To_Wide_Wide_String);
AWS.Client.Get
(Connection => Self.Server,
Result => Response,
URI => AWS.URL.Pathname_And_Parameters (Request));
Result.Clear;
Result.Append (AWS.Response.Message_Body (Response));
Success := True;
exception
when others =>
Success := False;
end Get;
end CvsWeb.HTTP;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2018-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 Interfaces;
package USB.Device.HID.Mouse is
Mouse_Report_Size : constant := 3;
type Instance
is new Abstract_HID_Class (Mouse_Report_Size)
with private;
procedure Set_Move (This : in out Instance;
X, Y : Interfaces.Integer_8);
-- Set the relative movement of the mouse cursor
procedure Set_Click (This : in out Instance;
Btn1, Btn2, Btn3 : Boolean := False);
-- Set the mouse buttons state
private
type Instance
is new Abstract_HID_Class (Mouse_Report_Size)
with null record;
HID_Mouse_Report_Desc : aliased constant UInt8_Array :=
(
-- https://eleccelerator.com/tutorial-about-usb-hid-report-descriptors/
16#05#, 16#01#, -- USAGE_PAGE (Generic Desktop)
16#09#, 16#02#, -- USAGE (Mouse)
16#a1#, 16#01#, -- COLLECTION (Application)
16#09#, 16#01#, -- USAGE (Pointer)
16#a1#, 16#00#, -- COLLECTION (Physical)
16#05#, 16#09#, -- USAGE_PAGE (Button)
16#19#, 16#01#, -- USAGE_MINIMUM (Button 1)
16#29#, 16#03#, -- USAGE_MAXIMUM (Button 3)
16#15#, 16#00#, -- LOGICAL_MINIMUM (0)
16#25#, 16#01#, -- LOGICAL_MAXIMUM (1)
16#95#, 16#03#, -- REPORT_COUNT (3)
16#75#, 16#01#, -- REPORT_SIZE (1)
16#81#, 16#02#, -- INPUT (Data,Var,Abs)
16#95#, 16#01#, -- REPORT_COUNT (1)
16#75#, 16#05#, -- REPORT_SIZE (5)
16#81#, 16#03#, -- INPUT (Cnst,Var,Abs)
16#05#, 16#01#, -- USAGE_PAGE (Generic Desktop)
16#09#, 16#30#, -- USAGE (X)
16#09#, 16#31#, -- USAGE (Y)
16#15#, 16#81#, -- LOGICAL_MINIMUM (-127)
16#25#, 16#7f#, -- LOGICAL_MAXIMUM (127)
16#75#, 16#08#, -- REPORT_SIZE (8)
16#95#, 16#02#, -- REPORT_COUNT (2)
16#81#, 16#06#, -- INPUT (Data,Var,Rel)
16#c0#, -- END_COLLECTION
16#c0# -- END_COLLECTION
);
overriding
function Report_Descriptor (This : Instance)
return not null Report_Descriptor_Access
is (HID_Mouse_Report_Desc'Access);
end USB.Device.HID.Mouse;
|
------------------------------------------------------------------------------
-- --
-- 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.UML.Elements;
limited with AMF.UML.Elements.Collections;
with League.Strings;
package AMF.MOF.Tags is
pragma Preelaborate;
type MOF_Tag is limited interface
and AMF.UML.Elements.UML_Element;
type MOF_Tag_Access is
access all MOF_Tag'Class;
for MOF_Tag_Access'Storage_Size use 0;
not overriding function Get_Name
(Self : not null access constant MOF_Tag)
return League.Strings.Universal_String is abstract;
-- Getter of Tag::name.
--
not overriding procedure Set_Name
(Self : not null access MOF_Tag;
To : League.Strings.Universal_String) is abstract;
-- Setter of Tag::name.
--
not overriding function Get_Value
(Self : not null access constant MOF_Tag)
return League.Strings.Universal_String is abstract;
-- Getter of Tag::value.
--
not overriding procedure Set_Value
(Self : not null access MOF_Tag;
To : League.Strings.Universal_String) is abstract;
-- Setter of Tag::value.
--
not overriding function Get_Element
(Self : not null access constant MOF_Tag)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is abstract;
-- Getter of Tag::element.
--
not overriding function Get_Tag_Owner
(Self : not null access constant MOF_Tag)
return AMF.UML.Elements.UML_Element_Access is abstract;
-- Getter of Tag::tagOwner.
--
not overriding procedure Set_Tag_Owner
(Self : not null access MOF_Tag;
To : AMF.UML.Elements.UML_Element_Access) is abstract;
-- Setter of Tag::tagOwner.
--
end AMF.MOF.Tags;
|
-----------------------------------------------------------------------
-- swagger-testsuite - Swagger Test suite
-- Copyright (C) 2017 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Tests;
package Swagger.Testsuite is
function Suite return Util.Tests.Access_Test_Suite;
end Swagger.Testsuite;
|
-----------------------------------------------------------------------
-- awa-events -- AWA Events
-- Copyright (C) 2012 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Strings;
with Util.Events;
with Util.Beans.Objects;
with Util.Beans.Basic;
with Util.Beans.Objects.Maps;
with ADO;
-- == Introduction ==
-- The <b>AWA.Events</b> package defines an event framework for modules to post events
-- and have Ada bean methods be invoked when these events are dispatched. Subscription to
-- events is done through configuration files. This allows to configure the modules and
-- integrate them together easily at configuration time.
--
-- === Declaration ===
-- Modules define the events that they can generate by instantiating the <b>Definition</b>
-- package. This is a static definition of the event. Each event is given a unique name.
--
-- package Event_New_User is new AWA.Events.Definition ("new-user");
--
-- === Posting an event ===
-- The module can post an event to inform other modules or the system that a particular
-- action occurred. The module creates the event instance of type <b>Module_Event</b> and
-- populates that event with useful properties for event receivers.
--
-- Event : AWA.Events.Module_Event;
--
-- Event.Set_Event_Kind (Event_New_User.Kind);
-- Event.Set_Parameter ("email", "harry.potter@hogwarts.org");
--
-- The module will post the event by using the <b>Send_Event</b> operation.
--
-- Manager.Send_Event (Event);
--
-- === Receiving an event ===
-- Modules or applications interested by a particular event will configure the event manager
-- to dispatch the event to an Ada bean event action. The Ada bean is an object that must
-- implement a procedure that matches the prototype:
--
-- type Action_Bean is new Util.Beans.Basic.Readonly_Bean ...;
-- procedure Action (Bean : in out Action_Bean; Event : in AWA.Events.Module_Event'Class);
--
-- The Ada bean method and object are registered as other Ada beans.
--
-- The configuration file indicates how to bind the Ada bean action and the event together.
-- The action is specified using an EL Method Expression (See Ada EL or JSR 245).
--
-- <on-event name="new_user">
-- <action>#{ada_bean.action}</action>
-- </on-event>
--
-- === Event queues and dispatchers ===
-- The *AWA.Events* framework posts events on queues and it uses a dispatcher to process them.
-- There are two kinds of dispatchers:
--
-- * Synchronous dispatcher process the event when it is posted. The task which posts
-- the event invokes the Ada bean action. In this dispatching mode, there is no event queue.
-- If the action method raises an exception, it will however be blocked.
--
-- * Asynchronous dispatcher are executed by dedicated tasks. The event is put in an event
-- queue. A dispatcher task processes the event and invokes the action method at a later
-- time.
--
-- When the event is queued, there are two types of event queues:
--
-- * A Fifo memory queue manages the event and dispatches them in FIFO order.
-- If the application is stopped, the events present in the Fifo queue are lost.
--
-- * A persistent event queue manages the event in a similar way as the FIFO queue but
-- saves them in the database. If the application is stopped, events that have not yet
-- been processed will be dispatched when the application is started again.
--
-- == Data Model ==
-- @include Queues.hbm.xml
--
package AWA.Events is
type Queue_Index is new Natural;
type Event_Index is new Natural;
-- ------------------------------
-- Event kind definition
-- ------------------------------
-- This package must be instantiated for each event that a module can post.
generic
Name : String;
package Definition is
function Kind return Event_Index;
pragma Inline_Always (Kind);
end Definition;
-- Exception raised if an event name is not found.
Not_Found : exception;
-- Identifies an invalid event.
Invalid_Event : constant Event_Index := 0;
-- Find the event runtime index given the event name.
-- Raises Not_Found exception if the event name is not recognized.
function Find_Event_Index (Name : in String) return Event_Index;
-- ------------------------------
-- Module event
-- ------------------------------
type Module_Event is new Util.Events.Event and Util.Beans.Basic.Readonly_Bean with private;
type Module_Event_Access is access all Module_Event'Class;
-- Set the event type which identifies the event.
procedure Set_Event_Kind (Event : in out Module_Event;
Kind : in Event_Index);
-- Get the event type which identifies the event.
function Get_Event_Kind (Event : in Module_Event) return Event_Index;
-- Set a parameter on the message.
procedure Set_Parameter (Event : in out Module_Event;
Name : in String;
Value : in String);
-- Get the parameter with the given name.
function Get_Parameter (Event : in Module_Event;
Name : in String) return String;
-- Get the value that corresponds to the parameter with the given name.
overriding
function Get_Value (Event : in Module_Event;
Name : in String) return Util.Beans.Objects.Object;
-- Get the entity identifier associated with the event.
function Get_Entity_Identifier (Event : in Module_Event) return ADO.Identifier;
-- Set the entity identifier associated with the event.
procedure Set_Entity_Identifier (Event : in out Module_Event;
Id : in ADO.Identifier);
-- Copy the event properties to the map passed in <tt>Into</tt>.
procedure Copy (Event : in Module_Event;
Into : in out Util.Beans.Objects.Maps.Map);
private
type Module_Event is new Util.Events.Event and Util.Beans.Basic.Readonly_Bean with record
Kind : Event_Index := Invalid_Event;
Props : Util.Beans.Objects.Maps.Map;
Entity : ADO.Identifier := ADO.NO_IDENTIFIER;
Entity_Type : ADO.Entity_Type := ADO.NO_ENTITY_TYPE;
end record;
-- The index of the last event definition.
Last_Event : Event_Index := 0;
-- Get the event type name.
function Get_Event_Type_Name (Index : in Event_Index) return Util.Strings.Name_Access;
-- Make and return a copy of the event.
function Copy (Event : in Module_Event) return Module_Event_Access;
end AWA.Events;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure Test_Non_Continuous is
type Sequence is array (Positive range <>) of Integer;
procedure Put_NCS
( Tail : Sequence; -- To generate subsequences of
Head : Sequence := (1..0 => 1); -- Already generated
Contiguous : Boolean := True -- It is still continuous
) is
begin
if not Contiguous and then Head'Length > 1 then
for I in Head'Range loop
Put (Integer'Image (Head (I)));
end loop;
New_Line;
end if;
if Tail'Length /= 0 then
declare
New_Head : Sequence (Head'First..Head'Last + 1);
begin
New_Head (Head'Range) := Head;
for I in Tail'Range loop
New_Head (New_Head'Last) := Tail (I);
Put_NCS
( Tail => Tail (I + 1..Tail'Last),
Head => New_Head,
Contiguous => Contiguous and then (I = Tail'First or else Head'Length = 0)
);
end loop;
end;
end if;
end Put_NCS;
begin
Put_NCS ((1,2,3)); New_Line;
Put_NCS ((1,2,3,4)); New_Line;
Put_NCS ((1,2,3,4,5)); New_Line;
end Test_Non_Continuous;
|
-- ////////////////////////////////////////////////////////////
-- //
-- // SFML - Simple and Fast Multimedia Library
-- // Copyright (C) 2007-2009 Laurent Gomila (laurent.gom@gmail.com)
-- //
-- // 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.
-- //
-- ////////////////////////////////////////////////////////////
-- ////////////////////////////////////////////////////////////
-- // Headers
-- ////////////////////////////////////////////////////////////
with Sf.Config;
with Sf.Graphics.Glyph;
with Sf.Graphics.Types;
package Sf.Graphics.Font is
use Sf.Config;
use Sf.Graphics.Glyph;
use Sf.Graphics.Types;
-- ////////////////////////////////////////////////////////////
-- /// Create a new empty font
-- ///
-- /// \return A new sfFont object, or NULL if it failed
-- ///
-- ////////////////////////////////////////////////////////////
function sfFont_Create return sfFont_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Create a new font from a file
-- ///
-- /// \param Filename : Path of the font file to load
-- /// \param CharSize : Size of characters in bitmap - the bigger, the higher quality
-- /// \param Charset : Characters set to generate (just pass NULL to get the default charset)
-- ///
-- /// \return A new sfFont object, or NULL if it failed
-- ///
-- ////////////////////////////////////////////////////////////
function sfFont_CreateFromFile
(Filename : String;
CharSize : sfUint32;
Charset : sfUint32_Ptr)
return sfFont_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Create a new image font a file in memory
-- ///
-- /// \param Data : Pointer to the file data in memory
-- /// \param SizeInBytes : Size of the data to load, in bytes
-- /// \param CharSize : Size of characters in bitmap - the bigger, the higher quality
-- /// \param Charset : Characters set to generate (just pass NULL to get the default charset)
-- ///
-- /// \return A new sfFont object, or NULL if it failed
-- ///
-- ////////////////////////////////////////////////////////////
function sfFont_CreateFromMemory
(Data : sfInt8_Ptr;
SizeInBytes : sfSize_t;
CharSize : sfUint32;
Charset : sfUint32_Ptr)
return sfFont_Ptr;
-- ////////////////////////////////////////////////////////////
-- /// Destroy an existing font
-- ///
-- /// \param Font : Font to delete
-- ///
-- ////////////////////////////////////////////////////////////
procedure sfFont_Destroy (Font : sfFont_Ptr);
-- ////////////////////////////////////////////////////////////
-- /// Get the base size of characters in a font;
-- /// All glyphs dimensions are based on this value
-- ///
-- /// \param Font : Font object
-- ///
-- /// \return Base size of characters
-- ///
-- ////////////////////////////////////////////////////////////
function sfFont_GetCharacterSize (Font : sfFont_Ptr) return sfUint32;
-- ////////////////////////////////////////////////////////////
-- /// Get the built-in default font (Arial)
-- ///
-- /// \return Pointer to the default font
-- ///
-- ////////////////////////////////////////////////////////////
function sfFont_GetDefaultFont return sfFont_Ptr;
private
pragma Import (C, sfFont_Create, "sfFont_Create");
pragma Import (C, sfFont_CreateFromMemory, "sfFont_CreateFromMemory");
pragma Import (C, sfFont_Destroy, "sfFont_Destroy");
pragma Import (C, sfFont_GetCharacterSize, "sfFont_GetCharacterSize");
pragma Import (C, sfFont_GetDefaultFont, "sfFont_GetDefaultFont");
end Sf.Graphics.Font;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 2 8 --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 28
package System.Pack_28 is
pragma Preelaborate;
Bits : constant := 28;
type Bits_28 is mod 2 ** Bits;
for Bits_28'Size use Bits;
function Get_28 (Arr : System.Address; N : Natural) return Bits_28;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_28 (Arr : System.Address; N : Natural; E : Bits_28);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
function GetU_28 (Arr : System.Address; N : Natural) return Bits_28;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned. This version
-- is used when Arr may represent an unaligned address.
procedure SetU_28 (Arr : System.Address; N : Natural; E : Bits_28);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value. This version
-- is used when Arr may represent an unaligned address
end System.Pack_28;
|
with System.Wid_Enum;
package body System.WWd_Enum is
function Wide_Width_Enumeration_8 (
Names : String;
Indexes : Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method := 1)
return Natural
is
pragma Unreferenced (EM);
begin
return Wid_Enum.Width_Enumeration_8 (Names, Indexes, Lo, Hi);
end Wide_Width_Enumeration_8;
function Wide_Width_Enumeration_16 (
Names : String;
Indexes : Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method := 1)
return Natural
is
pragma Unreferenced (EM);
begin
return Wid_Enum.Width_Enumeration_16 (Names, Indexes, Lo, Hi);
end Wide_Width_Enumeration_16;
function Wide_Width_Enumeration_32 (
Names : String;
Indexes : Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method := 1)
return Natural
is
pragma Unreferenced (EM);
begin
return Wid_Enum.Width_Enumeration_32 (Names, Indexes, Lo, Hi);
end Wide_Width_Enumeration_32;
function Wide_Wide_Width_Enumeration_8 (
Names : String;
Indexes : Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method := 1)
return Natural
is
pragma Unreferenced (EM);
begin
return Wid_Enum.Width_Enumeration_8 (Names, Indexes, Lo, Hi);
end Wide_Wide_Width_Enumeration_8;
function Wide_Wide_Width_Enumeration_16 (
Names : String;
Indexes : Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method := 1)
return Natural
is
pragma Unreferenced (EM);
begin
return Wid_Enum.Width_Enumeration_16 (Names, Indexes, Lo, Hi);
end Wide_Wide_Width_Enumeration_16;
function Wide_Wide_Width_Enumeration_32 (
Names : String;
Indexes : Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method := 1)
return Natural
is
pragma Unreferenced (EM);
begin
return Wid_Enum.Width_Enumeration_32 (Names, Indexes, Lo, Hi);
end Wide_Wide_Width_Enumeration_32;
end System.WWd_Enum;
|
-- convert UCD/UnicodeData.txt (13, 14)
-- bin/ucd_simplecasemapping $UCD/UnicodeData.txt > ../source/strings/a-uscama.ads
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Containers.Ordered_Maps;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Text_IO; use Ada.Text_IO;
procedure ucd_simplecasemapping is
function Value (S : String) return Wide_Wide_Character is
Img : constant String := "Hex_" & (1 .. 8 - S'Length => '0') & S;
begin
return Wide_Wide_Character'Value (Img);
end Value;
procedure Put_16 (Item : Integer) is
S : String (1 .. 8); -- "16#XXXX#"
begin
Put (S, Item, Base => 16);
S (1) := '1';
S (2) := '6';
S (3) := '#';
for I in reverse 4 .. 6 loop
if S (I) = '#' then
S (4 .. I) := (others => '0');
exit;
end if;
end loop;
Put (S);
end Put_16;
package WWC_Maps is
new Ada.Containers.Ordered_Maps (
Wide_Wide_Character,
Wide_Wide_Character);
use WWC_Maps;
function Compressible (I : WWC_Maps.Cursor) return Boolean is
begin
return Wide_Wide_Character'Pos (Element (I)) - Wide_Wide_Character'Pos (Key (I))
in -128 .. 127;
end Compressible;
Upper_Table, Lower_Table, Shared_Table : WWC_Maps.Map;
Upper_Num, Lower_Num : Natural;
type Bit is (In_16, In_32);
function Get_Bit (C : Wide_Wide_Character) return Bit is
begin
if C > Wide_Wide_Character'Val (16#FFFF#) then
return In_32;
else
return In_16;
end if;
end Get_Bit;
Shared_Num : array (Bit, Boolean) of Natural;
begin
declare
File : Ada.Text_IO.File_Type;
begin
Open (File, In_File, Argument (1));
while not End_Of_File (File) loop
declare
Line : constant String := Get_Line (File);
type Range_Type is record
First : Positive;
Last : Natural;
end record;
Fields : array (1 .. 14) of Range_Type;
P : Positive := Line'First;
N : Natural;
Code : Wide_Wide_Character;
begin
for I in Fields'Range loop
N := P;
while N <= Line'Last and then Line (N) /= ';' loop
N := N + 1;
end loop;
if (N <= Line'Last) /= (I < Field'Last) then
raise Data_Error with Line & " -- A";
end if;
Fields (I).First := P;
Fields (I).Last := N - 1;
P := N + 1; -- skip ';'
end loop;
Code := Value (Line (Fields (1).First .. Fields (1).Last));
if Fields (13).First <= Fields (13).Last then -- uppercase
Insert (
Upper_Table,
Code,
Value (Line (Fields (13).First .. Fields (13).Last)));
end if;
if Fields (14).First <= Fields (14).Last then -- lowercase
Insert (
Lower_Table,
Code,
Value (Line (Fields (14).First .. Fields (14).Last)));
end if;
-- note: last field (15) is titlecase.
end;
end loop;
Close (File);
end;
Upper_Num := Natural (Length (Upper_Table));
Lower_Num := Natural (Length (Lower_Table));
declare
I : WWC_Maps.Cursor := First (Lower_Table);
begin
while Has_Element (I) loop
if Contains (Upper_Table, Element (I))
and then Element (Upper_Table, Element (I)) = Key (I)
then
Insert (Shared_Table, Key (I), Element (I));
end if;
I := Next (I);
end loop;
end;
for B in Bit loop
for Compressed in Boolean loop
Shared_Num (B, Compressed) := 0;
end loop;
end loop;
declare
I : WWC_Maps.Cursor := First (Shared_Table);
begin
while Has_Element (I) loop
declare
B : Bit := Get_Bit (Key (I));
begin
if Compressible (I) then
declare
K : Wide_Wide_Character := Key (I);
E : Wide_Wide_Character := Element (I);
N : WWC_Maps.Cursor := Next (I);
RLE : Positive := 1;
Compressed : Boolean;
begin
while Has_Element (N)
and then RLE < 255
and then Compressible (N)
and then Key (N) = Wide_Wide_Character'Succ (K)
and then Element (N) = Wide_Wide_Character'Succ (E)
loop
K := Key (N);
E := Element (N);
N := Next (N);
RLE := RLE + 1;
end loop;
I := N;
Compressed := RLE > 1;
Shared_Num (B, Compressed) := Shared_Num (B, Compressed) + 1;
end;
else
Shared_Num (B, False) := Shared_Num (B, False) + 1;
I := Next (I);
end if;
end;
end loop;
end;
Put_Line ("pragma License (Unrestricted);");
Put_Line ("-- implementation unit, translated from UnicodeData.txt (13, 14)");
Put_Line ("package Ada.UCD.Simple_Case_Mapping is");
Put_Line (" pragma Pure;");
New_Line;
Put (" L_Total : constant := ");
Put (Lower_Num, Width => 1);
Put (";");
New_Line;
Put (" U_Total : constant := ");
Put (Upper_Num, Width => 1);
Put (";");
New_Line;
New_Line;
Put_Line (" type Run_Length_8 is mod 2 ** 8;");
New_Line;
Put_Line (" type Compressed_Item_Type is record");
Put_Line (" Start : UCS_2;");
Put_Line (" Length : Run_Length_8;");
Put_Line (" Diff : Difference_8;");
Put_Line (" end record;");
Put_Line (" pragma Suppress_Initialization (Compressed_Item_Type);");
Put_Line (" for Compressed_Item_Type'Size use 32; -- 16 + 8 + 8");
Put_Line (" for Compressed_Item_Type use record");
Put_Line (" Start at 0 range 0 .. 15;");
Put_Line (" Length at 0 range 16 .. 23;");
Put_Line (" Diff at 0 range 24 .. 31;");
Put_Line (" end record;");
New_Line;
Put_Line (" type Compressed_Type is array (Positive range <>) of Compressed_Item_Type;");
Put_Line (" pragma Suppress_Initialization (Compressed_Type);");
Put_Line (" for Compressed_Type'Component_Size use 32;");
New_Line;
Put (" subtype SL_Table_XXXX_Type is Map_16x1_Type (1 .. ");
Put (Shared_Num (In_16, False), Width => 1);
Put (");");
New_Line;
Put (" subtype SL_Table_XXXX_Compressed_Type is Compressed_Type (1 .. ");
Put (Shared_Num (In_16, True), Width => 1);
Put (");");
New_Line;
Put (" subtype SL_Table_1XXXX_Compressed_Type is Compressed_Type (1 .. ");
Put (Shared_Num (In_32, True), Width => 1);
Put (");");
New_Line;
if Shared_Num (In_32, False) /= 0 then
raise Data_Error with "num of shared";
end if;
Put (" subtype DL_Table_XXXX_Type is Map_16x1_Type (1 .. ");
Put (Lower_Num - Natural (Length (Shared_Table)), Width => 1);
Put (");");
New_Line;
Put (" subtype DU_Table_XXXX_Type is Map_16x1_Type (1 .. ");
Put (Upper_Num - Natural (Length (Shared_Table)), Width => 1);
Put (");");
New_Line;
New_Line;
for B in Bit loop
for Compressed in Boolean loop
if Shared_Num (B, Compressed) > 0 then
Put (" SL_Table_");
if B = In_32 then
Put ("1");
end if;
Put ("XXXX");
if Compressed then
Put ("_Compressed");
end if;
Put (" : constant SL_Table_");
if B = In_32 then
Put ("1");
end if;
Put ("XXXX");
if Compressed then
Put ("_Compressed");
end if;
Put ("_Type := (");
New_Line;
declare
Offset : Integer := 0;
I : WWC_Maps.Cursor := First (Shared_Table);
Second : Boolean := False;
begin
if B = In_32 then
Offset := 16#10000#;
end if;
while Has_Element (I) loop
declare
Item_B : Bit := Get_Bit (Key (I));
Item_RLE : Positive := 1;
N : WWC_Maps.Cursor := Next (I);
begin
if Compressible (I) then
declare
K : Wide_Wide_Character := Key (I);
E : Wide_Wide_Character := Element (I);
begin
while Has_Element (N)
and then Item_RLE < 255
and then Compressible (N)
and then Key (N) = Wide_Wide_Character'Succ (K)
and then Element (N) = Wide_Wide_Character'Succ (E)
loop
K := Key (N);
E := Element (N);
N := Next (N);
Item_RLE := Item_RLE + 1;
end loop;
end;
end if;
if Item_B = B
and then (Item_RLE > 1) = Compressed
then
if Second then
Put (",");
New_Line;
end if;
Put (" ");
if Shared_Num (B, Compressed) = 1 then
Put ("1 => ");
end if;
Put ("(");
Put_16 (Wide_Wide_Character'Pos (Key (I)) - Offset);
Put (", ");
if Compressed then
Put (Item_RLE, Width => 1);
Put (", ");
Put (
Wide_Wide_Character'Pos (Element (I))
- Wide_Wide_Character'Pos (Key (I)),
Width => 1);
else
Put_16 (
Wide_Wide_Character'Pos (Element (I)) - Offset);
end if;
Put (")");
Second := True;
end if;
I := N;
end;
end loop;
Put (");");
New_Line;
end;
New_Line;
end if;
end loop;
end loop;
Put_Line (" DL_Table_XXXX : constant DL_Table_XXXX_Type := (");
declare
I : WWC_Maps.Cursor := First (Lower_Table);
Second : Boolean := False;
begin
while Has_Element (I) loop
if not (
Contains (Shared_Table, Key (I))
and then Element (Shared_Table, Key (I)) = Element (I))
then
if Second then
Put (",");
New_Line;
end if;
Put (" (");
Put_16 (Wide_Wide_Character'Pos (Key (I)));
Put (", ");
Put_16 (Wide_Wide_Character'Pos (Element (I)));
Put (")");
Second := True;
end if;
I := Next (I);
end loop;
Put (");");
New_Line;
end;
New_Line;
Put_Line (" DU_Table_XXXX : constant DU_Table_XXXX_Type := (");
declare
I : WWC_Maps.Cursor := First (Upper_Table);
Second : Boolean := False;
begin
while Has_Element (I) loop
if not (
Contains (Shared_Table, Element (I))
and then Element (Shared_Table, Element (I)) = Key (I))
then
if Second then
Put (",");
New_Line;
end if;
Put (" (");
Put_16 (Wide_Wide_Character'Pos (Key (I)));
Put (", ");
Put_16 (Wide_Wide_Character'Pos (Element (I)));
Put (")");
Second := True;
end if;
I := Next (I);
end loop;
Put (");");
New_Line;
end;
New_Line;
Put_Line ("end Ada.UCD.Simple_Case_Mapping;");
end ucd_simplecasemapping;
|
with Symbol_Tables.Generic_Symbol_Table;
with Ada.Text_IO; use Ada.Text_IO;
procedure Symbol_Tables.Test is
package St is
new Generic_Symbol_Table (Symbol_Name => ID_Type,
Symbol_Value => Integer,
Hash => Hash_Id,
Equivalent_Names => Equivalent_Id);
Table : St.Symbol_Table;
begin
Table.Create (Name => "pippo",
Initial_Value => 12);
Put_Line (Boolean'Image (Table.Contains ("pippo")));
Put_Line (St.Value (Table.Find ("pippo"))'Image);
Table.Open_Internal_Namespace;
Put_Line (Boolean'Image (Table.Contains ("pippo")));
Table.Create (Name => "pippo",
Initial_Value => 42);
Table.Create (Name => "pluto",
Initial_Value => 0);
Put_Line (Boolean'Image (Table.Contains ("pippo")));
Put_Line (St.Value (Table.Find ("pippo"))'Image);
Put_Line (Boolean'Image (Table.Contains ("pluto")));
Put_Line (St.Value (Table.Find ("pluto"))'Image);
Table.Open_External_Namespace;
Put_Line (Boolean'Image (Table.Contains ("pippo")));
Put_Line (Boolean'Image (Table.Contains ("pluto")));
Table.Create (Name => "pippo",
Initial_Value => 111);
Put_Line (Boolean'Image (Table.Contains ("pippo")));
Put_Line (St.Value (Table.Find ("pippo"))'Image);
Table.Close_Namespace;
Put_Line (St.Value (Table.Find ("pippo"))'Image);
Table.Close_Namespace;
Put_Line (St.Value (Table.Find ("pippo"))'Image);
end Symbol_Tables.Test;
|
with Tkmrpc.Servers.Ike;
with Tkmrpc.Results;
with Tkmrpc.Request.Ike.Dh_Generate_Key.Convert;
with Tkmrpc.Response.Ike.Dh_Generate_Key.Convert;
package body Tkmrpc.Operation_Handlers.Ike.Dh_Generate_Key is
-------------------------------------------------------------------------
procedure Handle (Req : Request.Data_Type; Res : out Response.Data_Type) is
Specific_Req : Request.Ike.Dh_Generate_Key.Request_Type;
Specific_Res : Response.Ike.Dh_Generate_Key.Response_Type;
begin
Specific_Res := Response.Ike.Dh_Generate_Key.Null_Response;
Specific_Req :=
Request.Ike.Dh_Generate_Key.Convert.From_Request (S => Req);
if Specific_Req.Data.Dh_Id'Valid and
Specific_Req.Data.Pubvalue.Size'Valid
then
Servers.Ike.Dh_Generate_Key
(Result => Specific_Res.Header.Result,
Dh_Id => Specific_Req.Data.Dh_Id,
Pubvalue => Specific_Req.Data.Pubvalue);
Res :=
Response.Ike.Dh_Generate_Key.Convert.To_Response
(S => Specific_Res);
else
Res.Header.Result := Results.Invalid_Parameter;
end if;
end Handle;
end Tkmrpc.Operation_Handlers.Ike.Dh_Generate_Key;
|
with Trendy_Test;
package Trendy_Test.Assertions is
-- Forcibly fail a test.
procedure Fail (Op : in out Operation'Class;
Message : String;
Loc : Source_Location := Make_Source_Location);
-- A boolean check which must be passed for the test to continue.
procedure Assert (Op : in out Operation'Class;
Condition : Boolean;
Loc : Source_Location := Make_Source_Location);
procedure Assert_EQ (Op : in out Trendy_Test.Operation'Class;
Left : String;
Right : String;
Loc : Source_Location := Make_Source_Location);
end Trendy_Test.Assertions;
|
-- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired)
--
-- Copyright William A. Whitaker (1936–2010)
--
-- This is a free program, which means it is proper to copy it and pass
-- it on to your friends. Consider it a developmental item for which
-- there is no charge. However, just for form, it is Copyrighted
-- (c). Permission is hereby freely given for any and all use of program
-- and data. You can sell it as your own, but at least tell me.
--
-- This version is distributed without obligation, but the developer
-- would appreciate comments and suggestions.
--
-- All parts of the WORDS system, source code and data files, are made freely
-- available to anyone who wishes to use them, for whatever purpose.
with Ada.Text_IO;
with Latin_Utils.Strings_Package; use Latin_Utils.Strings_Package;
with Latin_Utils.Latin_File_Names; use Latin_Utils.Latin_File_Names;
with Latin_Utils.Inflections_Package; use Latin_Utils.Inflections_Package;
with Latin_Utils.Dictionary_Package; use Latin_Utils.Dictionary_Package;
with Words_Engine.English_Support_Package;
use Words_Engine.English_Support_Package;
with Weed;
with Weed_All;
with Support_Utils.Dictionary_Form;
with Latin_Utils.General;
use Latin_Utils;
procedure Makeewds is
package Integer_IO is new Ada.Text_IO.Integer_IO (Integer);
use Ada.Text_IO;
use Integer_IO;
use Dictionary_Entry_IO;
use Part_Entry_IO;
use Part_Of_Speech_Type_IO;
use Age_Type_IO;
use Area_Type_IO;
use Geo_Type_IO;
use Frequency_Type_IO;
use Source_Type_IO;
use Ewds_Record_Io;
Porting : constant Boolean := False;
Checking : constant Boolean := True;
D_K : Dictionary_Kind := Xxx; -- ######################
Start_Stem_1 : constant := 1;
Start_Stem_2 : constant := Start_Stem_1 + Max_Stem_Size + 1;
Start_Stem_3 : constant := Start_Stem_2 + Max_Stem_Size + 1;
Start_Stem_4 : constant := Start_Stem_3 + Max_Stem_Size + 1;
Start_Part : constant := Start_Stem_4 + Max_Stem_Size + 1;
Line_Number : Integer := 0;
subtype Line_Type is String (1 .. 400);
N : Integer := 0;
Input, Output, Check : Ada.Text_IO.File_Type;
De : Dictionary_Entry;
S, Line : Line_Type := (others => ' ');
Blank_Line : constant Line_Type := (others => ' ');
L, Last : Integer := 0;
Ewa : Ewds_Array (1 .. 40) := (others => Null_Ewds_Record);
Ewr : Ewds_Record := Null_Ewds_Record;
-- First we supplement MEAN with singles of any hyphenated words
-- In principle this could be done in the main EXTRACT, much same logic/code
-- However this is difficult code for an old man, EXTRACT was hard
-- when I was a bit younger, and I cannot remember anything about it.
-- Separating them out makes it much easier to test
function Add_Hyphenated (S : String) return String is
-------- I tried to do something with hyphenated but so far it
-------- does not work
-- Find hyphenated words and add them to MEAN with a / connector,
-- right before the parse so one has both the individual words (may
-- be more than two) and a single combined word
-- counting-board -> counting board/countingboard
-- Cannot be bigger:
T : String (1 .. Max_Meaning_Size * 2 + 20) := (others => ' ');
Word_Start : Integer := 1;
Word_End : Integer := 0;
I, J, Jmax : Integer := 0;
Hyphenated : Boolean := False;
begin
--PUT_LINE (S);
while I < S'Last loop
I := I + 1;
J := J + 1;
Word_End := 0;
--PUT (INTEGER'IMAGE (I) & "-");
-- First clear away or ignore all the non-words stuff
if S (I) = '|' then -- Skip continuation |'s
Word_Start := I + 1;
T (J) := S (I);
J := J + 1;
Jmax := Jmax + 1;
null;
I := I + 1;
elsif S (I) = '"' then -- Skip "'S
Word_Start := I + 1;
T (J) := S (I);
J := J + 1;
Jmax := Jmax + 1;
null;
I := I + 1;
else
if S (I) = '(' then -- ( .. .) not to be parsed
T (J) := S (I);
J := J + 1;
Jmax := Jmax + 1;
I := I + 1;
while S (I) /= ')' loop
T (J) := S (I);
J := J + 1;
Jmax := Jmax + 1;
I := I + 1;
end loop;
Word_Start := I + 2; -- Skip };
Word_End := 0;
elsif S (I) = '[' then -- ( .. .) not to be parsed
T (J) := S (I);
J := J + 1;
Jmax := Jmax + 1;
I := I + 1;
while S (I - 1 .. I) /= "=>" loop
T (J) := S (I);
J := J + 1;
Jmax := Jmax + 1;
I := I + 1;
end loop;
Word_Start := I + 2;
Word_End := 0;
end if;
-- Finished with the non-word stuff
if S (I) = '-' then
Word_End := I - 1;
-- if (I /= S'FIRST) and then -- Not -word
-- ( (S (I-1) /= ' ') and
-- (S (I-1) /= '/') ) then
-- HYPHENATED := TRUE;
-- end if;
end if;
if
S (I) = ' ' or
S (I) = '/' or
S (I) = ',' or
S (I) = ';' or
S (I) = '!' or
S (I) = '?' or
S (I) = '+' or
S (I) = '*' or
S (I) = '"' or
S (I) = '('
then
Word_End := I - 1;
if Hyphenated then
T (J) := '/';
J := J + 1;
Jmax := Jmax + 1;
for K in Word_Start .. Word_End loop
if S (K) /= '-' then
T (J) := S (K);
J := J + 1;
Jmax := Jmax + 1;
end if;
end loop;
Hyphenated := False;
end if;
end if;
if --WORD_END /= 0 and then
S (I) = ' ' or S (I) = '/'
then
Word_Start := I + 1;
Word_End := 0;
end if;
end if; -- On '|'
-- Set up the Output to return
--PUT ('|' & INTEGER'IMAGE (J) & '/' & INTEGER'IMAGE (I));
T (J) := S (I);
Jmax := Jmax + 1;
end loop; -- Over S'RANGE
return T (1 .. Jmax);
exception
when others =>
Put_Line ("ADD_HYPHENATED Exception LINE = " &
Integer'Image (Line_Number));
Put_Line (S);
Put (De); New_Line;
return T (1 .. Jmax);
end Add_Hyphenated;
procedure Extract_Words (S : in String;
Pofs : in Part_Of_Speech_Type;
N : out Integer;
Ewa : out Ewds_Array) is
-- i, j, js, k, l, m, im, ic : Integer := 0;
J, K, L, M, Im, Ic : Integer := 0;
End_Semi : constant Integer := 1;
-- Have to expand type to take care of hyphenated
subtype X_Meaning_Type is String (1 .. Max_Meaning_Size * 2 + 20);
Null_X_Meaning_Type : constant X_Meaning_Type := (others => ' ');
Semi, Comma : X_Meaning_Type := Null_X_Meaning_Type;
Ww : Integer := 0; -- For debug
begin
-- i := 1; -- Element Position in line, per SEMI
J := 1; -- Position in word
K := 0; -- SEMI - Division in line
L := 1; -- Position in MEAN, for EXTRACTing SEMI
M := 1; -- COMMA in SEMI
N := 1; -- Word number
Im := 0; -- Position in SEMI
Ic := 0; -- Position in COMMA
Ewa (N) := Null_Ewds_Record;
-- Slightly disparage extension
if S (S'First) = '|' then
K := 3;
end if;
while L <= S'Last loop -- loop over MEAN
if S (L) = ' ' then -- Clear initial blanks
L := L + 1;
end if;
Semi := Null_X_Meaning_Type;
Im := 1;
Extract_Semi : loop
if S (L) = '|' then
null; -- Ignore continuation flag | as word
elsif S (L) in '0' .. '9' then
null; -- Ignore numbers
elsif S (L) = ';' then -- Division Terminator
K := K + 1;
--PUT ('+');
L := L + 1; -- Clear ;
exit Extract_Semi;
elsif S (L) = '(' then -- Skip ( .. .) !
while S (L) /= ')' loop
--PUT ('+');
--PUT (INTEGER'IMAGE (L));
--PUT (S (L));
exit when L = S'Last; -- Run out
L := L + 1;
end loop;
-- L := L + 1; -- Clear the ')'
--PUT ('^');
--PUT (INTEGER'IMAGE (L));
--PUT (S (L));
if L > S'Last then
L := S'Last;
else
if S (L) = ';' then -- );
exit Extract_Semi;
end if;
end if;
--PUT (']');
if L >= S'Last then -- Ends in )
-- PUT ('!');
exit Extract_Semi;
end if;
--PUT ('+');
--L := L + 1; -- Clear the ')'
elsif L = S'Last then
--PUT ('|');
L := L + 1; -- To end the loop
exit Extract_Semi;
else
Semi (Im) := S (L);
Im := Im + 1;
end if;
--PUT ('+');
--IM := IM + 1; -- To next Character
L := L + 1; -- To next Character
end loop Extract_Semi;
Ww := 10;
Process_Semi : declare
St : constant String := Trim (Semi);
Sm : constant String (St'First .. St'Last) := St;
begin
if St'Length > 0 then
Comma := Null_X_Meaning_Type;
Im := Sm'First;
M := 0;
--I := SM'FIRST;
--while I <= ST'LAST loop
--PUT (S (I));
--PUT ('*');
--COMMA := NULL_X_MEANING_TYPE;
Ic := 1;
Loop_Over_Semi :
while Im <= Sm'Last loop
Comma := Null_X_Meaning_Type;
Ww := 20;
Find_Comma :
loop
--PUT (INTEGER'IMAGE (IM) & " ( " & SM (IM));
if Sm (Im) = '(' then -- Skip ( .. .) !
while Sm (Im) /= ')' loop
Im := Im + 1;
end loop;
Im := Im + 1;
-- Clear the ')'
-- IM := IM + 1; -- Go to next Character
if Im >= End_Semi then
exit Find_Comma;
end if;
if (Sm (Im) = ';') or (Sm (Im) = ',') then
-- Foumd COMMA
M := M + 1;
Ic := 1;
Im := Im + 1; -- Clear ;,
exit Find_Comma;
elsif Sm (Im) = ' ' then
Im := Im + 1;
end if;
--PUT_LINE ("------------------------");
end if;
if Sm (Im) = '[' then -- Take end of [=>]
while Sm (Im) /= '>' loop
exit when Sm (Im) = ']'; -- If no >
Im := Im + 1;
end loop;
Im := Im + 1; -- Clear the '>' or ']'
if Sm (Im) = ';' then
-- Foumd COMMA
M := M + 1;
Ic := 1;
Im := Im + 1; -- Clear ;
exit Find_Comma;
elsif Sm (Im) = ' ' then
Im := Im + 1;
end if;
end if;
-- But could be 2 =>!
--PUT_LINE ("Through ()[] I = " & INTEGER'IMAGE (I));
exit Find_Comma when Im > Sm'Last;
--PUT (INTEGER'IMAGE (IM) & " ) " & SM (IM));
if Sm (Im) = ',' then
-- Foumd COMMA
M := M + 1;
Ic := 1;
Im := Im + 1; -- Clear ,
exit Find_Comma;
elsif Im >= Sm'Last or Im = S'Last then
-- Foumd COMMA
Comma (Ic) := Sm (Im);
M := M + 1;
Ic := 1;
exit Find_Comma;
else
Comma (Ic) := Sm (Im);
Im := Im + 1;
Ic := Ic + 1;
end if;
--PUT (INTEGER'IMAGE (IM) & " ! " & SM (IM));
end loop Find_Comma;
Im := Im + 1;
Ww := 30;
Process_Comma :
declare
Ct : constant String := Trim (Comma);
Cs : String (Ct'First .. Ct'Last) := Ct;
Pure : Boolean := True;
W_Start, W_End : Integer := 0;
begin
Ww := 31;
if Ct'Length > 0 then
-- Is COMMA non empty
-- Are there any blanks?
-- If not then it is a pure word
-- Or words with /
for Ip in Cs'Range loop
if Cs (Ip) = ' ' then
Pure := False;
end if;
end loop;
Ww := 32;
-- Check for WEED words and eliminate them
W_Start := Cs'First;
W_End := Cs'Last;
for Iw in Cs'Range loop
--PUT ('-');
--PUT (CS (IW));
if (Cs (Iw) = '(') or
(Cs (Iw) = '[')
then
Ww := 33;
W_Start := Iw + 1;
else
Ww := 34;
if (Cs (Iw) = ' ') or
(Cs (Iw) = '_') or
(Cs (Iw) = '-') or
(Cs (Iw) = ''') or
(Cs (Iw) = '!') or
(Cs (Iw) = '/') or
(Cs (Iw) = ':') or
(Cs (Iw) = '.') or
(Cs (Iw) = '!') or
(Cs (Iw) = ')') or
(Cs (Iw) = ']') or
(Iw = Cs'Last)
then
Ww := 35;
if Iw = Cs'Last then
W_End := Iw;
elsif Iw /= Cs'First then
W_End := Iw - 1;
end if;
Ww := 36;
-- KLUDGE
if Cs (W_Start) = '"' then
Ww := 361;
W_Start := W_Start + 1;
Ww := 362;
elsif Cs (W_End) = '"' then
Ww := 364;
W_End := W_End - 1;
Ww := 365;
end if;
Ww := 37;
--& " " & CS (W_START .. W_END)
--);
Weed_All (Cs (W_Start .. W_End));
if not Pure then
Weed (Cs (W_Start .. W_End), Pofs);
end if;
W_Start := Iw + 1;
end if;
Ww := 38;
end if;
Ww := 39;
end loop; -- On CS'RANGE
--PUT_LINE (INTEGER'IMAGE (LINE_NUMBER) & "WEED done");
Ww := 40;
-- Main process of COMMA
Ic := 1;
J := 1;
while Ic <= Cs'Last loop
--PUT (CS (IC));
if Cs (Ic) = '"' or -- Skip all "
Cs (Ic) = '(' or -- Skip initial (
Cs (Ic) = '?' or -- Ignore ?
Cs (Ic) = '~' or -- Ignore about ~
Cs (Ic) = '*' or
Cs (Ic) = '%' or -- Ignore % unless word
Cs (Ic) = '.' or -- Ignore . ..
Cs (Ic) = '\' or -- Ignore weed
(Cs (Ic) in '0' .. '9')
then -- Skip numbers
Ic := Ic + 1;
Ww := 50;
----PUT ('-');
else
if
Cs (Ic) = '/' or
Cs (Ic) = ' ' or
Cs (Ic) = ''' or -- Ignore all ' incl 's ???
Cs (Ic) = '-' or -- Hyphen causes 2 words XXX
Cs (Ic) = '+' or -- Plus causes 2 words
Cs (Ic) = '_' or -- Underscore causes 2 words
Cs (Ic) = '=' or -- = space/terminates
Cs (Ic) = '>' or
Cs (Ic) = ')' or
Cs (Ic) = ']' or
Cs (Ic) = '!' or
Cs (Ic) = '?' or
Cs (Ic) = '+' or
Cs (Ic) = ':' or
Cs (Ic) = ']'
then -- Found word
Ww := 60;
--PUT ('/');
Ewa (N).Semi := K;
if Pure then
if K = 1 then
Ewa (N).Kind := 15;
else
Ewa (N).Kind := 10;
end if;
else
Ewa (N).Kind := 0;
end if;
Ww := 70;
N := N + 1; -- Start new word in COMMA
Ic := Ic + 1;
J := 1;
Ewa (N) := Null_Ewds_Record;
elsif Ic = Cs'Last then -- Order of if important
-- End, Found word
--PUT ('!');
Ewa (N).W (J) := Cs (Ic);
Ewa (N).Semi := K;
if Pure then
if K = 1 then
Ewa (N).Kind := 15;
else
Ewa (N).Kind := 10;
end if;
else
Ewa (N).Kind := 0;
end if;
N := N + 1; -- Start new word/COMMA
Ewa (N) := Null_Ewds_Record;
exit;
else
Ww := 80;
--PUT ('+');
Ewa (N).W (J) := Cs (Ic);
J := J + 1;
Ic := Ic + 1;
end if;
end if;
Ww := 90;
end loop;
end if; -- On COMMA being empty
end Process_Comma;
--PUT_LINE ("COMMA Processed ");
end loop Loop_Over_Semi;
--PUT_LINE ("LOOP OVER SEMI Processed ");
end if;
-- On ST'LENGTH > 0
--PUT_LINE ("LOOP OVER SEMI after ST'LENGTH 0 ");
end Process_Semi;
--PUT_LINE ("SEMI Processed ");
-- I = " & INTEGER'IMAGE (I)
--& " S (I) = " & S (I)
--);
if (L < S'Last) and then (S (L) = ';') then
-- ??????
--PUT_LINE ("Clear L = " & INTEGER'IMAGE (L));
L := L + 1;
end if;
-- investigate this:
-- js := l; -- Odd but necessary ?????
for J in L .. S'Last loop
exit when J = S'Last;
if S (J) = ' ' then
L := L + 1;
else
exit;
end if;
end loop;
exit when L >= S'Last;
end loop; -- loop over MEAN
--PUT_LINE ("SEMI loop Processed");
if Ewa (N) = Null_Ewds_Record then
N := N - 1; -- Clean up danglers
end if;
if Ewa (N) = Null_Ewds_Record then -- AGAIN!!!!!!
N := N - 1; -- Clean up danglers
end if;
exception
when others =>
if (S (S'Last) /= ')') or (S (S'Last) /= ']') then -- KLUDGE
New_Line;
Put_Line ("Extract Exception WW = "
& Integer'Image (Ww) & " LINE = " &
Integer'Image (Line_Number));
Put_Line (S);
Put (De); New_Line;
end if;
end Extract_Words;
begin
Put_Line ("Takes a DICTLINE.D_K and produces a EWDSLIST.D_K ");
Latin_Utils.General.Load_Dictionary (Line, Last, D_K);
Open (Input, In_File, Add_File_Name_Extension (Dict_Line_Name,
Dictionary_Kind'Image (D_K)));
--PUT_LINE ("OPEN");
if not Porting then
--PUT_LINE ("CREATING");
Create (Output, Out_File, Add_File_Name_Extension ("EWDSLIST",
Dictionary_Kind'Image (D_K)));
if Checking then
Create (Check, Out_File, "CHECKEWD.");
end if;
--PUT_LINE ("CREATED");
end if;
-- Now do the rest
Over_Lines :
while not End_Of_File (Input) loop
S := Blank_Line;
Get_Line (Input, S, Last);
if Trim (S (1 .. Last)) /= "" then -- If non-blank line
L := 0;
Form_De : begin
De.Stems (1) := S (Start_Stem_1 .. Max_Stem_Size);
--NEW_LINE; PUT (DE.STEMS (1));
De.Stems (2) := S (Start_Stem_2 .. Start_Stem_2
+ Max_Stem_Size - 1);
De.Stems (3) := S (Start_Stem_3 .. Start_Stem_3
+ Max_Stem_Size - 1);
De.Stems (4) := S (Start_Stem_4 .. Start_Stem_4
+ Max_Stem_Size - 1);
--PUT ('#'); PUT (INTEGER'IMAGE (L)); PUT (INTEGER'IMAGE (LAST));
--PUT ('@');
Get (S (Start_Part .. Last), De.Part, L);
--PUT ('%'); PUT (INTEGER'IMAGE (L)); PUT (INTEGER'IMAGE (LAST));
--PUT ('&'); PUT (S (L+1 .. LAST)); PUT ('3');
--GET (S (L+1 .. LAST), DE.PART.POFS, DE.KIND, L);
-- FIXME: Why not Translation_Record_IO.Put ?
Get (S (L + 1 .. Last), De.Tran.Age, L);
Get (S (L + 1 .. Last), De.Tran.Area, L);
Get (S (L + 1 .. Last), De.Tran.Geo, L);
Get (S (L + 1 .. Last), De.Tran.Freq, L);
Get (S (L + 1 .. Last), De.Tran.Source, L);
De.Mean := Head (S (L + 2 .. Last), Max_Meaning_Size);
-- Note that this allows initial blanks
-- L+2 skips over the SPACER, required because
-- this is STRING, not ENUM
exception
when others =>
New_Line;
Put_Line ("GET Exception LAST = " & Integer'Image (Last));
Put_Line (S (1 .. Last));
Integer_IO.Put (Line_Number); New_Line;
Put (De); New_Line;
end Form_De;
Line_Number := Line_Number + 1;
if De.Part.Pofs = V and then De.Part.V.Con.Which = 8 then
-- V 8 is a kludge for variant forms of verbs
-- that have regular forms elsewhere
null;
else
-- Extract words
Extract_Words (Add_Hyphenated (Trim (De.Mean)),
De.Part.Pofs, N, Ewa);
-- EWORD_SIZE : constant := 38;
-- AUX_WORD_SIZE : constant := 9;
-- LINE_NUMBER_WIDTH : constant := 10;
--
-- type EWDS_RECORD is
-- record
-- POFS : PART_OF_SPEECH_TYPE := X;
-- W : STRING (1 .. EWORD_SIZE);
-- AUX : STRING (1 .. AUX_WORD_SIZE);
-- N : INTEGER;
-- end record;
for I in 1 .. N loop
if Trim (Ewa (I).W)'Length /= 0 then
Ewr.W := Head (Trim (Ewa (I).W), Eword_Size);
Ewr.Aux := Head ("", Aux_Word_Size);
Ewr.N := Line_Number;
Ewr.Pofs := De.Part.Pofs;
Ewr.Freq := De.Tran.Freq;
Ewr.Semi := Ewa (I).Semi;
Ewr.Kind := Ewa (I).Kind;
Ewr.Rank := 80 - Frequency_Type'Pos (Ewr.Freq) * 10
+ Ewr.Kind + (Ewr.Semi - 1) * (-3);
if Ewr.Freq = Inflections_Package.N then
Ewr.Rank := Ewr.Rank + 25;
end if;
--PUT (EWA (I)); NEW_LINE;
--PUT (EWR); NEW_LINE;
Put (Output, Ewr);
-- SET_COL (OUTPUT, 71);
-- INTEGER_IO.PUT (OUTPUT, I, 2);
New_Line (Output);
if Checking then
-- Now make the CHECK file
Put (Check, Ewr.W);
Set_Col (Check, 25);
declare
Df : constant String :=
Support_Utils.Dictionary_Form (De);
Ii : Integer := 1;
begin
if Df'Length > 0 then
while Df (Ii) /= ' ' and
Df (Ii) /= '.' and
Df (Ii) /= ','
loop
Put (Check, Df (Ii));
Ii := Ii + 1;
exit when Ii = 19;
end loop;
end if;
end;
Set_Col (Check, 44);
Put (Check, Ewr.N, 6);
Put (Check, ' ');
Put (Check, Ewr.Pofs);
Put (Check, ' ');
Put (Check, Ewr.Freq);
Put (Check, ' ');
Put (Check, Ewr.Semi, 5);
Put (Check, ' ');
Put (Check, Ewr.Kind, 5);
Put (Check, ' ');
Put (Check, Ewr.Rank, 5);
Put (Check, ' ');
Put (Check, De.Mean);
New_Line (Check);
end if;
end if;
end loop;
end if; -- If non-blank line
end if;
end loop Over_Lines;
Put_Line ("NUMBER_OF_LINES = " & Integer'Image (Line_Number));
if not Porting then
Close (Output);
if Checking then
Close (Check);
end if;
end if;
exception
when Ada.Text_IO.Data_Error =>
null;
when others =>
Put_Line (S (1 .. Last));
Integer_IO.Put (Line_Number); New_Line;
Close (Output);
if Checking then
Close (Check);
end if;
end Makeewds;
|
-- Copyright 2016-2019 NXP
-- All rights reserved.SPDX-License-Identifier: BSD-3-Clause
-- This spec has been automatically generated from LPC55S6x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package NXP_SVD.SCT is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- SCT operation
type CONFIG_UNIFY_Field is
(
-- The SCT operates as two 16-bit counters named COUNTER_L and
-- COUNTER_H.
Dual_Counter,
-- The SCT operates as a unified 32-bit counter.
Unified_Counter)
with Size => 1;
for CONFIG_UNIFY_Field use
(Dual_Counter => 0,
Unified_Counter => 1);
-- SCT clock mode
type CONFIG_CLKMODE_Field is
(
-- System Clock Mode. The system clock clocks the entire SCT module
-- including the counter(s) and counter prescalers.
System_Clock_Mode,
-- Sampled System Clock Mode. The system clock clocks the SCT module,
-- but the counter and prescalers are only enabled to count when the
-- designated edge is detected on the input selected by the CKSEL field.
-- The minimum pulse width on the selected clock-gate input is 1 bus
-- clock period. This mode is the high-performance, sampled-clock mode.
Sampled_System_Clock_Mode,
-- SCT Input Clock Mode. The input/edge selected by the CKSEL field
-- clocks the SCT module, including the counters and prescalers, after
-- first being synchronized to the system clock. The minimum pulse width
-- on the clock input is 1 bus clock period. This mode is the low-power,
-- sampled-clock mode.
Sct_Input_Clock_Mode,
-- Asynchronous Mode. The entire SCT module is clocked directly by the
-- input/edge selected by the CKSEL field. In this mode, the SCT outputs
-- are switched synchronously to the SCT input clock - not the system
-- clock. The input clock rate must be at least half the system clock
-- rate and can be the same or faster than the system clock.
Asynchronous_Mode)
with Size => 2;
for CONFIG_CLKMODE_Field use
(System_Clock_Mode => 0,
Sampled_System_Clock_Mode => 1,
Sct_Input_Clock_Mode => 2,
Asynchronous_Mode => 3);
-- SCT clock select. The specific functionality of the designated
-- input/edge is dependent on the CLKMODE bit selection in this register.
type CONFIG_CKSEL_Field is
(
-- Rising edges on input 0.
Input_0_Rising_Edges,
-- Falling edges on input 0.
Input_0_Falling_Edge,
-- Rising edges on input 1.
Input_1_Rising_Edges,
-- Falling edges on input 1.
Input_1_Falling_Edge,
-- Rising edges on input 2.
Input_2_Rising_Edges,
-- Falling edges on input 2.
Input_2_Falling_Edge,
-- Rising edges on input 3.
Input_3_Rising_Edges,
-- Falling edges on input 3.
Input_3_Falling_Edge,
-- Rising edges on input 4.
Input_4_Rising_Edges,
-- Falling edges on input 4.
Input_4_Falling_Edge,
-- Rising edges on input 5.
Input_5_Rising_Edges,
-- Falling edges on input 5.
Input_5_Falling_Edge,
-- Rising edges on input 6.
Input_6_Rising_Edges,
-- Falling edges on input 6.
Input_6_Falling_Edge,
-- Rising edges on input 7.
Input_7_Rising_Edges,
-- Falling edges on input 7.
Input_7_Falling_Edge)
with Size => 4;
for CONFIG_CKSEL_Field use
(Input_0_Rising_Edges => 0,
Input_0_Falling_Edge => 1,
Input_1_Rising_Edges => 2,
Input_1_Falling_Edge => 3,
Input_2_Rising_Edges => 4,
Input_2_Falling_Edge => 5,
Input_3_Rising_Edges => 6,
Input_3_Falling_Edge => 7,
Input_4_Rising_Edges => 8,
Input_4_Falling_Edge => 9,
Input_5_Rising_Edges => 10,
Input_5_Falling_Edge => 11,
Input_6_Rising_Edges => 12,
Input_6_Falling_Edge => 13,
Input_7_Rising_Edges => 14,
Input_7_Falling_Edge => 15);
subtype CONFIG_INSYNC_Field is HAL.UInt4;
-- SCT configuration register
type CONFIG_Register is record
-- SCT operation
UNIFY : CONFIG_UNIFY_Field := NXP_SVD.SCT.Dual_Counter;
-- SCT clock mode
CLKMODE : CONFIG_CLKMODE_Field := NXP_SVD.SCT.System_Clock_Mode;
-- SCT clock select. The specific functionality of the designated
-- input/edge is dependent on the CLKMODE bit selection in this
-- register.
CKSEL : CONFIG_CKSEL_Field := NXP_SVD.SCT.Input_0_Rising_Edges;
-- A 1 in this bit prevents the lower match registers from being
-- reloaded from their respective reload registers. Setting this bit
-- eliminates the need to write to the reload registers MATCHREL if the
-- match values are fixed. Software can write to set or clear this bit
-- at any time. This bit applies to both the higher and lower registers
-- when the UNIFY bit is set.
NORELOAD_L : Boolean := False;
-- A 1 in this bit prevents the higher match registers from being
-- reloaded from their respective reload registers. Setting this bit
-- eliminates the need to write to the reload registers MATCHREL if the
-- match values are fixed. Software can write to set or clear this bit
-- at any time. This bit is not used when the UNIFY bit is set.
NORELOAD_H : Boolean := False;
-- Synchronization for input N (bit 9 = input 0, bit 10 = input 1,, bit
-- 12 = input 3); all other bits are reserved. A 1 in one of these bits
-- subjects the corresponding input to synchronization to the SCT clock,
-- before it is used to create an event. If an input is known to already
-- be synchronous to the SCT clock, this bit may be set to 0 for faster
-- input response. (Note: The SCT clock is the system clock for CKMODEs
-- 0-2. It is the selected, asynchronous SCT input clock for CKMODE3).
-- Note that the INSYNC field only affects inputs used for event
-- generation. It does not apply to the clock input specified in the
-- CKSEL field.
INSYNC : CONFIG_INSYNC_Field := 16#F#;
-- unspecified
Reserved_13_16 : HAL.UInt4 := 16#0#;
-- A one in this bit causes a match on match register 0 to be treated as
-- a de-facto LIMIT condition without the need to define an associated
-- event. As with any LIMIT event, this automatic limit causes the
-- counter to be cleared to zero in unidirectional mode or to change the
-- direction of count in bi-directional mode. Software can write to set
-- or clear this bit at any time. This bit applies to both the higher
-- and lower registers when the UNIFY bit is set.
AUTOLIMIT_L : Boolean := False;
-- A one in this bit will cause a match on match register 0 to be
-- treated as a de-facto LIMIT condition without the need to define an
-- associated event. As with any LIMIT event, this automatic limit
-- causes the counter to be cleared to zero in unidirectional mode or to
-- change the direction of count in bi-directional mode. Software can
-- write to set or clear this bit at any time. This bit is not used when
-- the UNIFY bit is set.
AUTOLIMIT_H : Boolean := False;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CONFIG_Register use record
UNIFY at 0 range 0 .. 0;
CLKMODE at 0 range 1 .. 2;
CKSEL at 0 range 3 .. 6;
NORELOAD_L at 0 range 7 .. 7;
NORELOAD_H at 0 range 8 .. 8;
INSYNC at 0 range 9 .. 12;
Reserved_13_16 at 0 range 13 .. 16;
AUTOLIMIT_L at 0 range 17 .. 17;
AUTOLIMIT_H at 0 range 18 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
-- L or unified counter direction select
type CTRL_BIDIR_L_Field is
(
-- Up. The counter counts up to a limit condition, then is cleared to
-- zero.
Up,
-- Up-down. The counter counts up to a limit, then counts down to a
-- limit condition or to 0.
Up_Down)
with Size => 1;
for CTRL_BIDIR_L_Field use
(Up => 0,
Up_Down => 1);
subtype CTRL_PRE_L_Field is HAL.UInt8;
-- Direction select
type CTRL_BIDIR_H_Field is
(
-- The H counter counts up to its limit condition, then is cleared to
-- zero.
Up,
-- The H counter counts up to its limit, then counts down to a limit
-- condition or to 0.
Up_Down)
with Size => 1;
for CTRL_BIDIR_H_Field use
(Up => 0,
Up_Down => 1);
subtype CTRL_PRE_H_Field is HAL.UInt8;
-- SCT control register
type CTRL_Register is record
-- This bit is 1 when the L or unified counter is counting down.
-- Hardware sets this bit when the counter is counting up, counter limit
-- occurs, and BIDIR = 1.Hardware clears this bit when the counter is
-- counting down and a limit condition occurs or when the counter
-- reaches 0.
DOWN_L : Boolean := False;
-- When this bit is 1 and HALT is 0, the L or unified counter does not
-- run, but I/O events related to the counter can occur. If a designated
-- start event occurs, this bit is cleared and counting resumes.
STOP_L : Boolean := False;
-- When this bit is 1, the L or unified counter does not run and no
-- events can occur. A reset sets this bit. When the HALT_L bit is one,
-- the STOP_L bit is cleared. It is possible to remove the halt
-- condition while keeping the SCT in the stop condition (not running)
-- with a single write to this register to simultaneously clear the HALT
-- bit and set the STOP bit. Once set, only software can clear this bit
-- to restore counter operation. This bit is set on reset.
HALT_L : Boolean := True;
-- Writing a 1 to this bit clears the L or unified counter. This bit
-- always reads as 0.
CLRCTR_L : Boolean := False;
-- L or unified counter direction select
BIDIR_L : CTRL_BIDIR_L_Field := NXP_SVD.SCT.Up;
-- Specifies the factor by which the SCT clock is prescaled to produce
-- the L or unified counter clock. The counter clock is clocked at the
-- rate of the SCT clock divided by PRE_L+1. Clear the counter (by
-- writing a 1 to the CLRCTR bit) whenever changing the PRE value.
PRE_L : CTRL_PRE_L_Field := 16#0#;
-- unspecified
Reserved_13_15 : HAL.UInt3 := 16#0#;
-- This bit is 1 when the H counter is counting down. Hardware sets this
-- bit when the counter is counting, a counter limit condition occurs,
-- and BIDIR is 1. Hardware clears this bit when the counter is counting
-- down and a limit condition occurs or when the counter reaches 0.
DOWN_H : Boolean := False;
-- When this bit is 1 and HALT is 0, the H counter does not, run but I/O
-- events related to the counter can occur. If such an event matches the
-- mask in the Start register, this bit is cleared and counting resumes.
STOP_H : Boolean := False;
-- When this bit is 1, the H counter does not run and no events can
-- occur. A reset sets this bit. When the HALT_H bit is one, the STOP_H
-- bit is cleared. It is possible to remove the halt condition while
-- keeping the SCT in the stop condition (not running) with a single
-- write to this register to simultaneously clear the HALT bit and set
-- the STOP bit. Once set, this bit can only be cleared by software to
-- restore counter operation. This bit is set on reset.
HALT_H : Boolean := True;
-- Writing a 1 to this bit clears the H counter. This bit always reads
-- as 0.
CLRCTR_H : Boolean := False;
-- Direction select
BIDIR_H : CTRL_BIDIR_H_Field := NXP_SVD.SCT.Up;
-- Specifies the factor by which the SCT clock is prescaled to produce
-- the H counter clock. The counter clock is clocked at the rate of the
-- SCT clock divided by PRELH+1. Clear the counter (by writing a 1 to
-- the CLRCTR bit) whenever changing the PRE value.
PRE_H : CTRL_PRE_H_Field := 16#0#;
-- unspecified
Reserved_29_31 : HAL.UInt3 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CTRL_Register use record
DOWN_L at 0 range 0 .. 0;
STOP_L at 0 range 1 .. 1;
HALT_L at 0 range 2 .. 2;
CLRCTR_L at 0 range 3 .. 3;
BIDIR_L at 0 range 4 .. 4;
PRE_L at 0 range 5 .. 12;
Reserved_13_15 at 0 range 13 .. 15;
DOWN_H at 0 range 16 .. 16;
STOP_H at 0 range 17 .. 17;
HALT_H at 0 range 18 .. 18;
CLRCTR_H at 0 range 19 .. 19;
BIDIR_H at 0 range 20 .. 20;
PRE_H at 0 range 21 .. 28;
Reserved_29_31 at 0 range 29 .. 31;
end record;
subtype LIMIT_LIMMSK_L_Field is HAL.UInt16;
subtype LIMIT_LIMMSK_H_Field is HAL.UInt16;
-- SCT limit event select register
type LIMIT_Register is record
-- If bit n is one, event n is used as a counter limit for the L or
-- unified counter (event 0 = bit 0, event 1 = bit 1, etc.). The number
-- of bits = number of events in this SCT.
LIMMSK_L : LIMIT_LIMMSK_L_Field := 16#0#;
-- If bit n is one, event n is used as a counter limit for the H counter
-- (event 0 = bit 16, event 1 = bit 17, etc.). The number of bits =
-- number of events in this SCT.
LIMMSK_H : LIMIT_LIMMSK_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for LIMIT_Register use record
LIMMSK_L at 0 range 0 .. 15;
LIMMSK_H at 0 range 16 .. 31;
end record;
subtype HALT_HALTMSK_L_Field is HAL.UInt16;
subtype HALT_HALTMSK_H_Field is HAL.UInt16;
-- SCT halt event select register
type HALT_Register is record
-- If bit n is one, event n sets the HALT_L bit in the CTRL register
-- (event 0 = bit 0, event 1 = bit 1, etc.). The number of bits = number
-- of events in this SCT.
HALTMSK_L : HALT_HALTMSK_L_Field := 16#0#;
-- If bit n is one, event n sets the HALT_H bit in the CTRL register
-- (event 0 = bit 16, event 1 = bit 17, etc.). The number of bits =
-- number of events in this SCT.
HALTMSK_H : HALT_HALTMSK_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for HALT_Register use record
HALTMSK_L at 0 range 0 .. 15;
HALTMSK_H at 0 range 16 .. 31;
end record;
subtype STOP_STOPMSK_L_Field is HAL.UInt16;
subtype STOP_STOPMSK_H_Field is HAL.UInt16;
-- SCT stop event select register
type STOP_Register is record
-- If bit n is one, event n sets the STOP_L bit in the CTRL register
-- (event 0 = bit 0, event 1 = bit 1, etc.). The number of bits = number
-- of events in this SCT.
STOPMSK_L : STOP_STOPMSK_L_Field := 16#0#;
-- If bit n is one, event n sets the STOP_H bit in the CTRL register
-- (event 0 = bit 16, event 1 = bit 17, etc.). The number of bits =
-- number of events in this SCT.
STOPMSK_H : STOP_STOPMSK_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for STOP_Register use record
STOPMSK_L at 0 range 0 .. 15;
STOPMSK_H at 0 range 16 .. 31;
end record;
subtype START_STARTMSK_L_Field is HAL.UInt16;
subtype START_STARTMSK_H_Field is HAL.UInt16;
-- SCT start event select register
type START_Register is record
-- If bit n is one, event n clears the STOP_L bit in the CTRL register
-- (event 0 = bit 0, event 1 = bit 1, etc.). The number of bits = number
-- of events in this SCT.
STARTMSK_L : START_STARTMSK_L_Field := 16#0#;
-- If bit n is one, event n clears the STOP_H bit in the CTRL register
-- (event 0 = bit 16, event 1 = bit 17, etc.). The number of bits =
-- number of events in this SCT.
STARTMSK_H : START_STARTMSK_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for START_Register use record
STARTMSK_L at 0 range 0 .. 15;
STARTMSK_H at 0 range 16 .. 31;
end record;
subtype COUNT_CTR_L_Field is HAL.UInt16;
subtype COUNT_CTR_H_Field is HAL.UInt16;
-- SCT counter register
type COUNT_Register is record
-- When UNIFY = 0, read or write the 16-bit L counter value. When UNIFY
-- = 1, read or write the lower 16 bits of the 32-bit unified counter.
CTR_L : COUNT_CTR_L_Field := 16#0#;
-- When UNIFY = 0, read or write the 16-bit H counter value. When UNIFY
-- = 1, read or write the upper 16 bits of the 32-bit unified counter.
CTR_H : COUNT_CTR_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for COUNT_Register use record
CTR_L at 0 range 0 .. 15;
CTR_H at 0 range 16 .. 31;
end record;
subtype STATE_STATE_L_Field is HAL.UInt5;
subtype STATE_STATE_H_Field is HAL.UInt5;
-- SCT state register
type STATE_Register is record
-- State variable.
STATE_L : STATE_STATE_L_Field := 16#0#;
-- unspecified
Reserved_5_15 : HAL.UInt11 := 16#0#;
-- State variable.
STATE_H : STATE_STATE_H_Field := 16#0#;
-- unspecified
Reserved_21_31 : HAL.UInt11 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for STATE_Register use record
STATE_L at 0 range 0 .. 4;
Reserved_5_15 at 0 range 5 .. 15;
STATE_H at 0 range 16 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
-- INPUT_AIN array
type INPUT_AIN_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for INPUT_AIN
type INPUT_AIN_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AIN as a value
Val : HAL.UInt16;
when True =>
-- AIN as an array
Arr : INPUT_AIN_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for INPUT_AIN_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- INPUT_SIN array
type INPUT_SIN_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for INPUT_SIN
type INPUT_SIN_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- SIN as a value
Val : HAL.UInt16;
when True =>
-- SIN as an array
Arr : INPUT_SIN_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for INPUT_SIN_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- SCT input register
type INPUT_Register is record
-- Read-only. Input 0 state. Input 0 state on the last SCT clock edge.
AIN : INPUT_AIN_Field;
-- Read-only. Input 0 state. Input 0 state following the synchronization
-- specified by INSYNC.
SIN : INPUT_SIN_Field;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for INPUT_Register use record
AIN at 0 range 0 .. 15;
SIN at 0 range 16 .. 31;
end record;
subtype REGMODE_REGMOD_L_Field is HAL.UInt16;
subtype REGMODE_REGMOD_H_Field is HAL.UInt16;
-- SCT match/capture mode register
type REGMODE_Register is record
-- Each bit controls one match/capture register (register 0 = bit 0,
-- register 1 = bit 1, etc.). The number of bits = number of
-- match/captures in this SCT. 0 = register operates as match register.
-- 1 = register operates as capture register.
REGMOD_L : REGMODE_REGMOD_L_Field := 16#0#;
-- Each bit controls one match/capture register (register 0 = bit 16,
-- register 1 = bit 17, etc.). The number of bits = number of
-- match/captures in this SCT. 0 = register operates as match registers.
-- 1 = register operates as capture registers.
REGMOD_H : REGMODE_REGMOD_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for REGMODE_Register use record
REGMOD_L at 0 range 0 .. 15;
REGMOD_H at 0 range 16 .. 31;
end record;
subtype OUTPUT_OUT_Field is HAL.UInt16;
-- SCT output register
type OUTPUT_Register is record
-- Writing a 1 to bit n forces the corresponding output HIGH. Writing a
-- 0 forces the corresponding output LOW (output 0 = bit 0, output 1 =
-- bit 1, etc.). The number of bits = number of outputs in this SCT.
OUT_k : OUTPUT_OUT_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OUTPUT_Register use record
OUT_k at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- Set/clear operation on output 0. Value 0x3 is reserved. Do not program
-- this value.
type OUTPUTDIRCTRL_SETCLR0_Field is
(
-- Set and clear do not depend on the direction of any counter.
Independent,
-- Set and clear are reversed when counter L or the unified counter is
-- counting down.
L_Reversed,
-- Set and clear are reversed when counter H is counting down. Do not
-- use if UNIFY = 1.
H_Reversed)
with Size => 2;
for OUTPUTDIRCTRL_SETCLR0_Field use
(Independent => 0,
L_Reversed => 1,
H_Reversed => 2);
-- OUTPUTDIRCTRL_SETCLR array
type OUTPUTDIRCTRL_SETCLR_Field_Array is array (0 .. 15)
of OUTPUTDIRCTRL_SETCLR0_Field
with Component_Size => 2, Size => 32;
-- SCT output counter direction control register
type OUTPUTDIRCTRL_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- SETCLR as a value
Val : HAL.UInt32;
when True =>
-- SETCLR as an array
Arr : OUTPUTDIRCTRL_SETCLR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for OUTPUTDIRCTRL_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- Effect of simultaneous set and clear on output 0.
type RES_O0RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR0 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR0 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O0RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 1.
type RES_O1RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR1 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR1 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O1RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 2.
type RES_O2RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR2 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output n (or set based on the SETCLR2 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O2RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 3.
type RES_O3RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR3 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR3 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O3RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 4.
type RES_O4RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR4 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR4 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O4RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 5.
type RES_O5RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR5 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR5 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O5RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 6.
type RES_O6RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR6 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR6 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O6RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 7.
type RES_O7RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR7 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output n (or set based on the SETCLR7 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O7RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 8.
type RES_O8RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR8 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR8 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O8RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 9.
type RES_O9RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR9 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR9 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O9RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 10.
type RES_O10RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR10 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR10 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O10RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 11.
type RES_O11RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR11 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR11 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O11RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 12.
type RES_O12RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR12 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR12 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O12RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 13.
type RES_O13RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR13 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR13 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O13RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 14.
type RES_O14RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR14 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR14 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O14RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- Effect of simultaneous set and clear on output 15.
type RES_O15RES_Field is
(
-- No change.
No_Change,
-- Set output (or clear based on the SETCLR15 field in the OUTPUTDIRCTRL
-- register).
Set,
-- Clear output (or set based on the SETCLR15 field).
Clear,
-- Toggle output.
Toggle_Output)
with Size => 2;
for RES_O15RES_Field use
(No_Change => 0,
Set => 1,
Clear => 2,
Toggle_Output => 3);
-- SCT conflict resolution register
type RES_Register is record
-- Effect of simultaneous set and clear on output 0.
O0RES : RES_O0RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 1.
O1RES : RES_O1RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 2.
O2RES : RES_O2RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 3.
O3RES : RES_O3RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 4.
O4RES : RES_O4RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 5.
O5RES : RES_O5RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 6.
O6RES : RES_O6RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 7.
O7RES : RES_O7RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 8.
O8RES : RES_O8RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 9.
O9RES : RES_O9RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 10.
O10RES : RES_O10RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 11.
O11RES : RES_O11RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 12.
O12RES : RES_O12RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 13.
O13RES : RES_O13RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 14.
O14RES : RES_O14RES_Field := NXP_SVD.SCT.No_Change;
-- Effect of simultaneous set and clear on output 15.
O15RES : RES_O15RES_Field := NXP_SVD.SCT.No_Change;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for RES_Register use record
O0RES at 0 range 0 .. 1;
O1RES at 0 range 2 .. 3;
O2RES at 0 range 4 .. 5;
O3RES at 0 range 6 .. 7;
O4RES at 0 range 8 .. 9;
O5RES at 0 range 10 .. 11;
O6RES at 0 range 12 .. 13;
O7RES at 0 range 14 .. 15;
O8RES at 0 range 16 .. 17;
O9RES at 0 range 18 .. 19;
O10RES at 0 range 20 .. 21;
O11RES at 0 range 22 .. 23;
O12RES at 0 range 24 .. 25;
O13RES at 0 range 26 .. 27;
O14RES at 0 range 28 .. 29;
O15RES at 0 range 30 .. 31;
end record;
subtype DMAREQ0_DEV_0_Field is HAL.UInt16;
-- SCT DMA request 0 register
type DMAREQ0_Register is record
-- If bit n is one, event n triggers DMA request 0 (event 0 = bit 0,
-- event 1 = bit 1, etc.). The number of bits = number of events in this
-- SCT.
DEV_0 : DMAREQ0_DEV_0_Field := 16#0#;
-- unspecified
Reserved_16_29 : HAL.UInt14 := 16#0#;
-- A 1 in this bit triggers DMA request 0 when it loads the
-- MATCH_L/Unified registers from the RELOAD_L/Unified registers.
DRL0 : Boolean := False;
-- This read-only bit indicates the state of DMA Request 0. Note that if
-- the related DMA channel is enabled and properly set up, it is
-- unlikely that software will see this flag, it will be cleared rapidly
-- by the DMA service. The flag remaining set could point to an issue
-- with DMA setup.
DRQ0 : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DMAREQ0_Register use record
DEV_0 at 0 range 0 .. 15;
Reserved_16_29 at 0 range 16 .. 29;
DRL0 at 0 range 30 .. 30;
DRQ0 at 0 range 31 .. 31;
end record;
subtype DMAREQ1_DEV_1_Field is HAL.UInt16;
-- SCT DMA request 1 register
type DMAREQ1_Register is record
-- If bit n is one, event n triggers DMA request 1 (event 0 = bit 0,
-- event 1 = bit 1, etc.). The number of bits = number of events in this
-- SCT.
DEV_1 : DMAREQ1_DEV_1_Field := 16#0#;
-- unspecified
Reserved_16_29 : HAL.UInt14 := 16#0#;
-- A 1 in this bit triggers DMA request 1 when it loads the Match
-- L/Unified registers from the Reload L/Unified registers.
DRL1 : Boolean := False;
-- This read-only bit indicates the state of DMA Request 1. Note that if
-- the related DMA channel is enabled and properly set up, it is
-- unlikely that software will see this flag, it will be cleared rapidly
-- by the DMA service. The flag remaining set could point to an issue
-- with DMA setup.
DRQ1 : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DMAREQ1_Register use record
DEV_1 at 0 range 0 .. 15;
Reserved_16_29 at 0 range 16 .. 29;
DRL1 at 0 range 30 .. 30;
DRQ1 at 0 range 31 .. 31;
end record;
subtype EVEN_IEN_Field is HAL.UInt16;
-- SCT event interrupt enable register
type EVEN_Register is record
-- The SCT requests an interrupt when bit n of this register and the
-- event flag register are both one (event 0 = bit 0, event 1 = bit 1,
-- etc.). The number of bits = number of events in this SCT.
IEN : EVEN_IEN_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EVEN_Register use record
IEN at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype EVFLAG_FLAG_Field is HAL.UInt16;
-- SCT event flag register
type EVFLAG_Register is record
-- Bit n is one if event n has occurred since reset or a 1 was last
-- written to this bit (event 0 = bit 0, event 1 = bit 1, etc.). The
-- number of bits = number of events in this SCT.
FLAG : EVFLAG_FLAG_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EVFLAG_Register use record
FLAG at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CONEN_NCEN_Field is HAL.UInt16;
-- SCT conflict interrupt enable register
type CONEN_Register is record
-- The SCT requests an interrupt when bit n of this register and the SCT
-- conflict flag register are both one (output 0 = bit 0, output 1 = bit
-- 1, etc.). The number of bits = number of outputs in this SCT.
NCEN : CONEN_NCEN_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CONEN_Register use record
NCEN at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CONFLAG_NCFLAG_Field is HAL.UInt16;
-- SCT conflict flag register
type CONFLAG_Register is record
-- Bit n is one if a no-change conflict event occurred on output n since
-- reset or a 1 was last written to this bit (output 0 = bit 0, output 1
-- = bit 1, etc.). The number of bits = number of outputs in this SCT.
NCFLAG : CONFLAG_NCFLAG_Field := 16#0#;
-- unspecified
Reserved_16_29 : HAL.UInt14 := 16#0#;
-- The most recent bus error from this SCT involved writing CTR
-- L/Unified, STATE L/Unified, MATCH L/Unified, or the Output register
-- when the L/U counter was not halted. A word write to certain L and H
-- registers can be half successful and half unsuccessful.
BUSERRL : Boolean := False;
-- The most recent bus error from this SCT involved writing CTR H, STATE
-- H, MATCH H, or the Output register when the H counter was not halted.
BUSERRH : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CONFLAG_Register use record
NCFLAG at 0 range 0 .. 15;
Reserved_16_29 at 0 range 16 .. 29;
BUSERRL at 0 range 30 .. 30;
BUSERRH at 0 range 31 .. 31;
end record;
subtype CAP_CAPn_L_Field is HAL.UInt16;
subtype CAP_CAPn_H_Field is HAL.UInt16;
-- SCT capture register of capture channel
type CAP_Register is record
-- When UNIFY = 0, read the 16-bit counter value at which this register
-- was last captured. When UNIFY = 1, read the lower 16 bits of the
-- 32-bit value at which this register was last captured.
CAPn_L : CAP_CAPn_L_Field := 16#0#;
-- When UNIFY = 0, read the 16-bit counter value at which this register
-- was last captured. When UNIFY = 1, read the upper 16 bits of the
-- 32-bit value at which this register was last captured.
CAPn_H : CAP_CAPn_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CAP_Register use record
CAPn_L at 0 range 0 .. 15;
CAPn_H at 0 range 16 .. 31;
end record;
subtype MATCH_MATCHn_L_Field is HAL.UInt16;
subtype MATCH_MATCHn_H_Field is HAL.UInt16;
-- SCT match value register of match channels
type MATCH_Register is record
-- When UNIFY = 0, read or write the 16-bit value to be compared to the
-- L counter. When UNIFY = 1, read or write the lower 16 bits of the
-- 32-bit value to be compared to the unified counter.
MATCHn_L : MATCH_MATCHn_L_Field := 16#0#;
-- When UNIFY = 0, read or write the 16-bit value to be compared to the
-- H counter. When UNIFY = 1, read or write the upper 16 bits of the
-- 32-bit value to be compared to the unified counter.
MATCHn_H : MATCH_MATCHn_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for MATCH_Register use record
MATCHn_L at 0 range 0 .. 15;
MATCHn_H at 0 range 16 .. 31;
end record;
subtype CAPCTRL_CAPCONn_L_Field is HAL.UInt16;
subtype CAPCTRL_CAPCONn_H_Field is HAL.UInt16;
-- SCT capture control register
type CAPCTRL_Register is record
-- If bit m is one, event m causes the CAPn_L (UNIFY = 0) or the CAPn
-- (UNIFY = 1) register to be loaded (event 0 = bit 0, event 1 = bit 1,
-- etc.). The number of bits = number of match/captures in this SCT.
CAPCONn_L : CAPCTRL_CAPCONn_L_Field := 16#0#;
-- If bit m is one, event m causes the CAPn_H (UNIFY = 0) register to be
-- loaded (event 0 = bit 16, event 1 = bit 17, etc.). The number of bits
-- = number of match/captures in this SCT.
CAPCONn_H : CAPCTRL_CAPCONn_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CAPCTRL_Register use record
CAPCONn_L at 0 range 0 .. 15;
CAPCONn_H at 0 range 16 .. 31;
end record;
subtype MATCHREL_RELOADn_L_Field is HAL.UInt16;
subtype MATCHREL_RELOADn_H_Field is HAL.UInt16;
-- SCT match reload value register
type MATCHREL_Register is record
-- When UNIFY = 0, specifies the 16-bit value to be loaded into the
-- MATCHn_L register. When UNIFY = 1, specifies the lower 16 bits of the
-- 32-bit value to be loaded into the MATCHn register.
RELOADn_L : MATCHREL_RELOADn_L_Field := 16#0#;
-- When UNIFY = 0, specifies the 16-bit to be loaded into the MATCHn_H
-- register. When UNIFY = 1, specifies the upper 16 bits of the 32-bit
-- value to be loaded into the MATCHn register.
RELOADn_H : MATCHREL_RELOADn_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for MATCHREL_Register use record
RELOADn_L at 0 range 0 .. 15;
RELOADn_H at 0 range 16 .. 31;
end record;
----------------------------
-- EV cluster's Registers --
----------------------------
subtype EV_STATE_EV_STATEMSKn_Field is HAL.UInt16;
-- SCT event state register 0
type EV_STATE_EV_Register is record
-- If bit m is one, event n happens in state m of the counter selected
-- by the HEVENT bit (n = event number, m = state number; state 0 = bit
-- 0, state 1= bit 1, etc.). The number of bits = number of states in
-- this SCT.
STATEMSKn : EV_STATE_EV_STATEMSKn_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EV_STATE_EV_Register use record
STATEMSKn at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype EV_CTRL_EV_MATCHSEL_Field is HAL.UInt4;
-- Select L/H counter. Do not set this bit if UNIFY = 1.
type EV_CTRL_HEVENT_Field is
(
-- Selects the L state and the L match register selected by MATCHSEL.
L_Counter,
-- Selects the H state and the H match register selected by MATCHSEL.
H_Counter)
with Size => 1;
for EV_CTRL_HEVENT_Field use
(L_Counter => 0,
H_Counter => 1);
-- Input/output select
type EV_CTRL_OUTSEL_Field is
(
-- Selects the inputs selected by IOSEL.
Input,
-- Selects the outputs selected by IOSEL.
Output)
with Size => 1;
for EV_CTRL_OUTSEL_Field use
(Input => 0,
Output => 1);
subtype EV_CTRL_EV_IOSEL_Field is HAL.UInt4;
-- Selects the I/O condition for event n. (The detection of edges on
-- outputs lag the conditions that switch the outputs by one SCT clock). In
-- order to guarantee proper edge/state detection, an input must have a
-- minimum pulse width of at least one SCT clock period .
type EV_CTRL_IOCOND_Field is
(
-- LOW
Low,
-- Rise
Rise,
-- Fall
Fall,
-- HIGH
High)
with Size => 2;
for EV_CTRL_IOCOND_Field use
(Low => 0,
Rise => 1,
Fall => 2,
High => 3);
-- Selects how the specified match and I/O condition are used and combined.
type EV_CTRL_COMBMODE_Field is
(
-- OR. The event occurs when either the specified match or I/O condition
-- occurs.
Or_k,
-- MATCH. Uses the specified match only.
Match,
-- IO. Uses the specified I/O condition only.
Io,
-- AND. The event occurs when the specified match and I/O condition
-- occur simultaneously.
And_k)
with Size => 2;
for EV_CTRL_COMBMODE_Field use
(Or_k => 0,
Match => 1,
Io => 2,
And_k => 3);
-- This bit controls how the STATEV value modifies the state selected by
-- HEVENT when this event is the highest-numbered event occurring for that
-- state.
type EV_CTRL_STATELD_Field is
(
-- STATEV value is added into STATE (the carry-out is ignored).
Add,
-- STATEV value is loaded into STATE.
Load)
with Size => 1;
for EV_CTRL_STATELD_Field use
(Add => 0,
Load => 1);
subtype EV_CTRL_EV_STATEV_Field is HAL.UInt5;
-- Direction qualifier for event generation. This field only applies when
-- the counters are operating in BIDIR mode. If BIDIR = 0, the SCT ignores
-- this field. Value 0x3 is reserved.
type EV_CTRL_DIRECTION_Field is
(
-- Direction independent. This event is triggered regardless of the
-- count direction.
Direction_Independent,
-- Counting up. This event is triggered only during up-counting when
-- BIDIR = 1.
Counting_Up,
-- Counting down. This event is triggered only during down-counting when
-- BIDIR = 1.
Counting_Down)
with Size => 2;
for EV_CTRL_DIRECTION_Field use
(Direction_Independent => 0,
Counting_Up => 1,
Counting_Down => 2);
-- SCT event control register 0
type EV_CTRL_EV_Register is record
-- Selects the Match register associated with this event (if any). A
-- match can occur only when the counter selected by the HEVENT bit is
-- running.
MATCHSEL : EV_CTRL_EV_MATCHSEL_Field := 16#0#;
-- Select L/H counter. Do not set this bit if UNIFY = 1.
HEVENT : EV_CTRL_HEVENT_Field := NXP_SVD.SCT.L_Counter;
-- Input/output select
OUTSEL : EV_CTRL_OUTSEL_Field := NXP_SVD.SCT.Input;
-- Selects the input or output signal number associated with this event
-- (if any). Do not select an input in this register if CKMODE is 1x. In
-- this case the clock input is an implicit ingredient of every event.
IOSEL : EV_CTRL_EV_IOSEL_Field := 16#0#;
-- Selects the I/O condition for event n. (The detection of edges on
-- outputs lag the conditions that switch the outputs by one SCT clock).
-- In order to guarantee proper edge/state detection, an input must have
-- a minimum pulse width of at least one SCT clock period .
IOCOND : EV_CTRL_IOCOND_Field := NXP_SVD.SCT.Low;
-- Selects how the specified match and I/O condition are used and
-- combined.
COMBMODE : EV_CTRL_COMBMODE_Field := NXP_SVD.SCT.Or_k;
-- This bit controls how the STATEV value modifies the state selected by
-- HEVENT when this event is the highest-numbered event occurring for
-- that state.
STATELD : EV_CTRL_STATELD_Field := NXP_SVD.SCT.Add;
-- This value is loaded into or added to the state selected by HEVENT,
-- depending on STATELD, when this event is the highest-numbered event
-- occurring for that state. If STATELD and STATEV are both zero, there
-- is no change to the STATE value.
STATEV : EV_CTRL_EV_STATEV_Field := 16#0#;
-- If this bit is one and the COMBMODE field specifies a match component
-- to the triggering of this event, then a match is considered to be
-- active whenever the counter value is GREATER THAN OR EQUAL TO the
-- value specified in the match register when counting up, LESS THEN OR
-- EQUAL TO the match value when counting down. If this bit is zero, a
-- match is only be active during the cycle when the counter is equal to
-- the match value.
MATCHMEM : Boolean := False;
-- Direction qualifier for event generation. This field only applies
-- when the counters are operating in BIDIR mode. If BIDIR = 0, the SCT
-- ignores this field. Value 0x3 is reserved.
DIRECTION : EV_CTRL_DIRECTION_Field :=
NXP_SVD.SCT.Direction_Independent;
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EV_CTRL_EV_Register use record
MATCHSEL at 0 range 0 .. 3;
HEVENT at 0 range 4 .. 4;
OUTSEL at 0 range 5 .. 5;
IOSEL at 0 range 6 .. 9;
IOCOND at 0 range 10 .. 11;
COMBMODE at 0 range 12 .. 13;
STATELD at 0 range 14 .. 14;
STATEV at 0 range 15 .. 19;
MATCHMEM at 0 range 20 .. 20;
DIRECTION at 0 range 21 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- no description available
type EV_Cluster is record
-- SCT event state register 0
EV_STATE : aliased EV_STATE_EV_Register;
-- SCT event control register 0
EV_CTRL : aliased EV_CTRL_EV_Register;
end record
with Volatile, Size => 64;
for EV_Cluster use record
EV_STATE at 16#0# range 0 .. 31;
EV_CTRL at 16#4# range 0 .. 31;
end record;
-- no description available
type EV_Clusters is array (0 .. 15) of EV_Cluster;
-----------------------------
-- OUT cluster's Registers --
-----------------------------
subtype OUT_SET_OUT_SET_Field is HAL.UInt16;
-- SCT output 0 set register
type OUT_SET_OUT_Register is record
-- A 1 in bit m selects event m to set output n (or clear it if SETCLRn
-- = 0x1 or 0x2) output 0 = bit 0, output 1 = bit 1, etc. The number of
-- bits = number of events in this SCT. When the counter is used in
-- bi-directional mode, it is possible to reverse the action specified
-- by the output set and clear registers when counting down, See the
-- OUTPUTCTRL register.
SET : OUT_SET_OUT_SET_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OUT_SET_OUT_Register use record
SET at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype OUT_CLR_OUT_CLR_Field is HAL.UInt16;
-- SCT output 0 clear register
type OUT_CLR_OUT_Register is record
-- A 1 in bit m selects event m to clear output n (or set it if SETCLRn
-- = 0x1 or 0x2) event 0 = bit 0, event 1 = bit 1, etc. The number of
-- bits = number of events in this SCT. When the counter is used in
-- bi-directional mode, it is possible to reverse the action specified
-- by the output set and clear registers when counting down, See the
-- OUTPUTCTRL register.
CLR : OUT_CLR_OUT_CLR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OUT_CLR_OUT_Register use record
CLR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- no description available
type OUT_Cluster is record
-- SCT output 0 set register
OUT_SET : aliased OUT_SET_OUT_Register;
-- SCT output 0 clear register
OUT_CLR : aliased OUT_CLR_OUT_Register;
end record
with Volatile, Size => 64;
for OUT_Cluster use record
OUT_SET at 16#0# range 0 .. 31;
OUT_CLR at 16#4# range 0 .. 31;
end record;
-- no description available
type OUT_Clusters is array (0 .. 9) of OUT_Cluster;
-----------------
-- Peripherals --
-----------------
type SCT0_Disc is
(
Mode_1,
Mode_2);
-- SCTimer/PWM (SCT)
type SCT0_Peripheral
(Discriminent : SCT0_Disc := Mode_1)
is record
-- SCT configuration register
CONFIG : aliased CONFIG_Register;
-- SCT control register
CTRL : aliased CTRL_Register;
-- SCT limit event select register
LIMIT : aliased LIMIT_Register;
-- SCT halt event select register
HALT : aliased HALT_Register;
-- SCT stop event select register
STOP : aliased STOP_Register;
-- SCT start event select register
START : aliased START_Register;
-- SCT counter register
COUNT : aliased COUNT_Register;
-- SCT state register
STATE : aliased STATE_Register;
-- SCT input register
INPUT : aliased INPUT_Register;
-- SCT match/capture mode register
REGMODE : aliased REGMODE_Register;
-- SCT output register
OUTPUT : aliased OUTPUT_Register;
-- SCT output counter direction control register
OUTPUTDIRCTRL : aliased OUTPUTDIRCTRL_Register;
-- SCT conflict resolution register
RES : aliased RES_Register;
-- SCT DMA request 0 register
DMAREQ0 : aliased DMAREQ0_Register;
-- SCT DMA request 1 register
DMAREQ1 : aliased DMAREQ1_Register;
-- SCT event interrupt enable register
EVEN : aliased EVEN_Register;
-- SCT event flag register
EVFLAG : aliased EVFLAG_Register;
-- SCT conflict interrupt enable register
CONEN : aliased CONEN_Register;
-- SCT conflict flag register
CONFLAG : aliased CONFLAG_Register;
-- no description available
EV : aliased EV_Clusters;
-- no description available
OUT_k : aliased OUT_Clusters;
case Discriminent is
when Mode_1 =>
-- SCT capture register of capture channel
CAP0 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP1 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP2 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP3 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP4 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP5 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP6 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP7 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP8 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP9 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP10 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP11 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP12 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP13 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP14 : aliased CAP_Register;
-- SCT capture register of capture channel
CAP15 : aliased CAP_Register;
-- SCT capture control register
CAPCTRL0 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL1 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL2 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL3 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL4 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL5 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL6 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL7 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL8 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL9 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL10 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL11 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL12 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL13 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL14 : aliased CAPCTRL_Register;
-- SCT capture control register
CAPCTRL15 : aliased CAPCTRL_Register;
when Mode_2 =>
-- SCT match value register of match channels
MATCH0 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH1 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH2 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH3 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH4 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH5 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH6 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH7 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH8 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH9 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH10 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH11 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH12 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH13 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH14 : aliased MATCH_Register;
-- SCT match value register of match channels
MATCH15 : aliased MATCH_Register;
-- SCT match reload value register
MATCHREL0 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL1 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL2 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL3 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL4 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL5 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL6 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL7 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL8 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL9 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL10 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL11 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL12 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL13 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL14 : aliased MATCHREL_Register;
-- SCT match reload value register
MATCHREL15 : aliased MATCHREL_Register;
end case;
end record
with Unchecked_Union, Volatile;
for SCT0_Peripheral use record
CONFIG at 16#0# range 0 .. 31;
CTRL at 16#4# range 0 .. 31;
LIMIT at 16#8# range 0 .. 31;
HALT at 16#C# range 0 .. 31;
STOP at 16#10# range 0 .. 31;
START at 16#14# range 0 .. 31;
COUNT at 16#40# range 0 .. 31;
STATE at 16#44# range 0 .. 31;
INPUT at 16#48# range 0 .. 31;
REGMODE at 16#4C# range 0 .. 31;
OUTPUT at 16#50# range 0 .. 31;
OUTPUTDIRCTRL at 16#54# range 0 .. 31;
RES at 16#58# range 0 .. 31;
DMAREQ0 at 16#5C# range 0 .. 31;
DMAREQ1 at 16#60# range 0 .. 31;
EVEN at 16#F0# range 0 .. 31;
EVFLAG at 16#F4# range 0 .. 31;
CONEN at 16#F8# range 0 .. 31;
CONFLAG at 16#FC# range 0 .. 31;
EV at 16#300# range 0 .. 1023;
OUT_k at 16#500# range 0 .. 639;
CAP0 at 16#100# range 0 .. 31;
CAP1 at 16#104# range 0 .. 31;
CAP2 at 16#108# range 0 .. 31;
CAP3 at 16#10C# range 0 .. 31;
CAP4 at 16#110# range 0 .. 31;
CAP5 at 16#114# range 0 .. 31;
CAP6 at 16#118# range 0 .. 31;
CAP7 at 16#11C# range 0 .. 31;
CAP8 at 16#120# range 0 .. 31;
CAP9 at 16#124# range 0 .. 31;
CAP10 at 16#128# range 0 .. 31;
CAP11 at 16#12C# range 0 .. 31;
CAP12 at 16#130# range 0 .. 31;
CAP13 at 16#134# range 0 .. 31;
CAP14 at 16#138# range 0 .. 31;
CAP15 at 16#13C# range 0 .. 31;
CAPCTRL0 at 16#200# range 0 .. 31;
CAPCTRL1 at 16#204# range 0 .. 31;
CAPCTRL2 at 16#208# range 0 .. 31;
CAPCTRL3 at 16#20C# range 0 .. 31;
CAPCTRL4 at 16#210# range 0 .. 31;
CAPCTRL5 at 16#214# range 0 .. 31;
CAPCTRL6 at 16#218# range 0 .. 31;
CAPCTRL7 at 16#21C# range 0 .. 31;
CAPCTRL8 at 16#220# range 0 .. 31;
CAPCTRL9 at 16#224# range 0 .. 31;
CAPCTRL10 at 16#228# range 0 .. 31;
CAPCTRL11 at 16#22C# range 0 .. 31;
CAPCTRL12 at 16#230# range 0 .. 31;
CAPCTRL13 at 16#234# range 0 .. 31;
CAPCTRL14 at 16#238# range 0 .. 31;
CAPCTRL15 at 16#23C# range 0 .. 31;
MATCH0 at 16#100# range 0 .. 31;
MATCH1 at 16#104# range 0 .. 31;
MATCH2 at 16#108# range 0 .. 31;
MATCH3 at 16#10C# range 0 .. 31;
MATCH4 at 16#110# range 0 .. 31;
MATCH5 at 16#114# range 0 .. 31;
MATCH6 at 16#118# range 0 .. 31;
MATCH7 at 16#11C# range 0 .. 31;
MATCH8 at 16#120# range 0 .. 31;
MATCH9 at 16#124# range 0 .. 31;
MATCH10 at 16#128# range 0 .. 31;
MATCH11 at 16#12C# range 0 .. 31;
MATCH12 at 16#130# range 0 .. 31;
MATCH13 at 16#134# range 0 .. 31;
MATCH14 at 16#138# range 0 .. 31;
MATCH15 at 16#13C# range 0 .. 31;
MATCHREL0 at 16#200# range 0 .. 31;
MATCHREL1 at 16#204# range 0 .. 31;
MATCHREL2 at 16#208# range 0 .. 31;
MATCHREL3 at 16#20C# range 0 .. 31;
MATCHREL4 at 16#210# range 0 .. 31;
MATCHREL5 at 16#214# range 0 .. 31;
MATCHREL6 at 16#218# range 0 .. 31;
MATCHREL7 at 16#21C# range 0 .. 31;
MATCHREL8 at 16#220# range 0 .. 31;
MATCHREL9 at 16#224# range 0 .. 31;
MATCHREL10 at 16#228# range 0 .. 31;
MATCHREL11 at 16#22C# range 0 .. 31;
MATCHREL12 at 16#230# range 0 .. 31;
MATCHREL13 at 16#234# range 0 .. 31;
MATCHREL14 at 16#238# range 0 .. 31;
MATCHREL15 at 16#23C# range 0 .. 31;
end record;
-- SCTimer/PWM (SCT)
SCT0_Periph : aliased SCT0_Peripheral
with Import, Address => System'To_Address (16#40085000#);
end NXP_SVD.SCT;
|
--------------------------------------------------------------------------------
-- Fichier : input.ads
-- Auteur : MOUDDENE Hamza & CAZES Noa
-- Objectif : Implantation du module Input
-- Crée : Dimanche Déc 01 2019
--------------------------------------------------------------------------------
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Characters.Latin_1; use Ada.Characters.Latin_1;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Text_IO.Unbounded_IO; use Ada.Text_IO.Unbounded_IO;
package body Input is
-- lire au clavier un entier quelconque.
procedure Input_Integer (value : out Integer) is
begin
Get (value);
exception
when Data_Error =>
New_Line;
Put_Line (ESC & "[31m" & "ERREUR : " & ESC & "[0m" & "Vous n'avez pas saisi un entier.");
Skip_Line;
New_Line;
Put ("Réessayez encore une fois : ");
Input_Integer (value);
end Input_Integer;
-- Entrer le choix du menu.
procedure Input_Choice (Choice : out Integer) is
begin
Put ("Entrez votre choix : ");
loop
Input_Integer (Choice);
if (Choice < 0 or Choice > 13) then
Put_Line(ESC & "[31m" & "ERREUR : " & ESC & "[0m" & "Il faut entrer un entier entre 0 et 11.");
New_Line;
Put ("Réessayez encore une fois : ");
end if;
exit when Choice >= 0 and Choice <= 13;
end loop;
end Input_Choice;
-- Entrer le sex d'un individu.
function Input_Sex return Character is
Sex : Character;
begin
loop
Get (Sex);
if (Sex /= 'H' and Sex /= 'F' and Sex /= 'U') then
New_Line;
Put_Line (ESC & "[31m" & "ERREUR : " & ESC & "[0m" & "sexe introuvable.");
New_Line;
Put ("Veuillez saisir " & ESC & "[31m" & "F" & ESC & "[0m" & " pour une femme, " & ESC & "[32m" & "H" & ESC & "[0m" & " pour un homme ou " & ESC & "[34m" & "U" & ESC & "[0m" & " pour tout autre type de sexe : ");
end if;
exit when (Sex = 'H' or Sex = 'F' or Sex = 'U');
end loop;
return Sex;
end Input_Sex;
-- Entrer les données personnelles d'une personne.
function Demander_Donnee return T_Donnee is
Nom, Prenom, Lieu_N, Lieu_D, Email : Unbounded_String;
Tel, N_Jour, N_Mois, N_Annee, D_Jour, D_Mois, D_Annee: Integer;
Sexe : Character;
begin
New_Line;
Put ("Veuillez saisir un nom : ");
Nom := Get_Line;
Skip_Line;
New_Line;
Put ("Veuillez saisir un prenom : ");
Prenom := Get_Line;
New_Line;
Put ("Veuillez saisir un jour de naissance : ");
Input_Integer (N_Jour);
New_Line;
Put ("Veuillez saisir un mois de naissance : ");
Input_Integer (N_Mois);
New_Line;
Put ("Veuillez saisir une année de naissance : ");
Input_Integer (N_Annee);
New_Line;
Put ("Veuillez saisir un lieu de naissance : ");
Lieu_N := Get_Line;
Skip_Line;
New_Line;
Put ("Veuillez saisir un jour de décès : ");
Input_Integer (D_Jour);
New_Line;
Put ("Veuillez saisir un mois de décès : ");
Input_Integer (D_Mois);
New_Line;
Put ("Veuillez saisir une année de décès : ");
Input_Integer (D_Annee);
New_Line;
Put ("Veuillez saisir un lieu de décès : ");
Lieu_D := Get_Line;
Skip_Line;
New_Line;
Put ("Veuillez saisir " & ESC & "[31m" & "F" & ESC & "[0m" & " pour une femme, " & ESC & "[32m" & "H" & ESC & "[0m" & " pour un homme ou " & ESC & "[34m" & "U" & ESC & "[0m" & " pour tout autre type de sexe : ");
Sexe := Input_Sex;
New_Line;
Put ("Veuillez saisir un email : ");
Email := Get_Line;
Skip_Line;
New_Line;
Put ("Veuillez saisir un numéro de téléphone sous la forme 0612345678 : ");
Input_Integer (Tel);
return Initialiser_Donnee (Nom, Prenom, Initialiser_Date(N_Jour, N_Mois, N_Annee), Lieu_N, Initialiser_Date(D_Jour, D_Mois, D_Annee), Lieu_D, Sexe, Email, Tel);
end Demander_Donnee;
-- Entrer l'ID d'un individu.
procedure Input_ID (ID : out Integer; Message : in String) is
begin
New_Line;
Put (Message);
Input_Integer (ID);
end Input_ID;
-- Entrer si le parent que vous souhaiterez ajouter est le père ou la mère.
-- Entrer 0 s'il s'agit d'un père, 1 si c'est la mère.
procedure Input_Flag (Flag : out Integer) is
begin
loop
New_Line;
Put_Line ("Entrez " & ESC & "[32m" & "0" & ESC & "[0m" & " s'il s'agit du père, si c'est la mère entrez " & ESC & "[31m" & "1" & ESC & "[0m" & ".");
New_Line;
Put ("Entrez Votre choix : ");
Input_Integer (Flag);
if (Flag /=0 and Flag /= 1) then
New_Line;
Put_Line (ESC & "[31m" & "ERREUR : " & ESC & "[0m" & "Entrée éronnée.");
end if;
exit when (Flag = 0 or Flag = 1);
end loop;
end Input_Flag;
-- Entrez la géneration des ancetres.
procedure Input_Generation (Generation : out Integer) is
begin
New_Line;
Put ("Entrez la géneration des ancetres que vous souhaitez les trouver : ");
Input_Integer (Generation);
end Input_Generation;
end Input;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Declarations;
with Program.Lexical_Elements;
with Program.Elements.Defining_Identifiers;
with Program.Elements.Known_Discriminant_Parts;
with Program.Elements.Aspect_Specifications;
with Program.Elements.Expressions;
with Program.Elements.Protected_Definitions;
package Program.Elements.Protected_Type_Declarations is
pragma Pure (Program.Elements.Protected_Type_Declarations);
type Protected_Type_Declaration is
limited interface and Program.Elements.Declarations.Declaration;
type Protected_Type_Declaration_Access is
access all Protected_Type_Declaration'Class with Storage_Size => 0;
not overriding function Name
(Self : Protected_Type_Declaration)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access is abstract;
not overriding function Discriminant_Part
(Self : Protected_Type_Declaration)
return Program.Elements.Known_Discriminant_Parts
.Known_Discriminant_Part_Access is abstract;
not overriding function Aspects
(Self : Protected_Type_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access is abstract;
not overriding function Progenitors
(Self : Protected_Type_Declaration)
return Program.Elements.Expressions.Expression_Vector_Access is abstract;
not overriding function Definition
(Self : Protected_Type_Declaration)
return not null Program.Elements.Protected_Definitions
.Protected_Definition_Access is abstract;
type Protected_Type_Declaration_Text is limited interface;
type Protected_Type_Declaration_Text_Access is
access all Protected_Type_Declaration_Text'Class with Storage_Size => 0;
not overriding function To_Protected_Type_Declaration_Text
(Self : aliased in out Protected_Type_Declaration)
return Protected_Type_Declaration_Text_Access is abstract;
not overriding function Protected_Token
(Self : Protected_Type_Declaration_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Type_Token
(Self : Protected_Type_Declaration_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function With_Token
(Self : Protected_Type_Declaration_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Is_Token
(Self : Protected_Type_Declaration_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function New_Token
(Self : Protected_Type_Declaration_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function With_Token_2
(Self : Protected_Type_Declaration_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Semicolon_Token
(Self : Protected_Type_Declaration_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Protected_Type_Declarations;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A L I . U T I L --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2003 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This child unit provides utility data structures and procedures used
-- for manipulation of ALI data by the gnatbind and gnatmake.
package ALI.Util is
-----------------------
-- Source File Table --
-----------------------
-- A source file table entry is built for every source file that is
-- in the source dependency table of any of the ALI files that make
-- up the current program.
No_Source_Id : constant Source_Id := Source_Id'First;
-- Special value indicating no Source table entry
First_Source_Entry : constant Source_Id := No_Source_Id + 1;
-- Id of first actual entry in table
type Source_Record is record
Sfile : File_Name_Type;
-- Name of source file
Stamp : Time_Stamp_Type;
-- Time stamp value. If Check_Source_Files is set and the source
-- file is located, then Stamp is set from the source file. Otherwise
-- Stamp is set from the latest stamp value found in any of the
-- ALI files for the current program.
Source_Found : Boolean;
-- This flag is set to True if the corresponding source file was
-- located and the Stamp value was set from the actual source file.
-- It is always false if Check_Source_Files is not set.
All_Timestamps_Match : Boolean;
-- This flag is set only if all files referencing this source file
-- have a matching time stamp, and also, if Source_Found is True,
-- then the stamp of the source file also matches. If this flag is
-- True, then checksums for this file are never referenced. We only
-- use checksums if there are time stamp mismatches.
All_Checksums_Match : Boolean;
-- This flag is set only if all files referencing this source file
-- have checksums, and if all these checksums match. If this flag
-- is set to True, then the binder will ignore a timestamp mismatch.
-- An absent checksum causes this flag to be set False, and a mismatch
-- of checksums also causes it to be set False. The checksum of the
-- actual source file (if Source_Found is True) is included only if
-- All_Timestamps_Match is False (since checksums are only interesting
-- if we have time stamp mismatches, and we want to avoid computing the
-- checksum of the source file if it is not needed.)
Checksum : Word;
-- If no dependency line has a checksum for this source file (i.e. the
-- corresponding entries in the source dependency records all have the
-- Checksum_Present flag set False), then this field is undefined. If
-- at least one dependency entry has a checksum present, then this
-- field contains one of the possible checksum values that has been
-- seen. This is used to set All_Checksums_Match properly.
end record;
package Source is new Table.Table (
Table_Component_Type => Source_Record,
Table_Index_Type => Source_Id,
Table_Low_Bound => First_Source_Entry,
Table_Initial => 1000,
Table_Increment => 200,
Table_Name => "Source");
procedure Initialize_ALI_Source;
-- Initialize Source table
--------------------------------------------------
-- Subprograms for Manipulating ALI Information --
--------------------------------------------------
procedure Read_ALI (Id : ALI_Id);
-- Process an ALI file which has been read and scanned by looping
-- through all withed units in the ALI file, checking if they have
-- been processed. Each unit that has not yet been processed will
-- be read, scanned, and processed recursively.
procedure Set_Source_Table (A : ALI_Id);
-- Build source table entry corresponding to the ALI file whose id is A.
procedure Set_Source_Table;
-- Build the entire source table.
function Time_Stamp_Mismatch
(A : ALI_Id;
Read_Only : Boolean := False)
return File_Name_Type;
-- Looks in the Source_Table and checks time stamp mismatches between
-- the sources there and the sources in the Sdep section of ali file whose
-- id is A. If no time stamp mismatches are found No_File is returned.
-- Otherwise return the first file for which there is a mismatch.
-- Note that in check source files mode (Check_Source_Files = True), the
-- time stamp in the Source_Table should be the actual time stamp of the
-- source files. In minimal recompilation mode (Minimal_Recompilation set
-- to True, no mismatch is found if the file's timestamp has not changed.
-- If Read_Only is True, missing sources are not considered.
--------------------------------------------
-- Subprograms for manipulating checksums --
--------------------------------------------
Checksum_Error : constant Word := 16#FFFF_FFFF#;
-- This value is used to indicate an error in computing the checksum.
-- When comparing checksums for smart recompilation, the CRC_Error
-- value is never considered to match. This could possibly result
-- in a false negative, but that is never harmful, it just means
-- that in unusual cases an unnecessary recompilation occurs.
function Get_File_Checksum (Fname : Name_Id) return Word;
-- Compute checksum for the given file. As far as possible, this circuit
-- computes exactly the same value computed by the compiler, but it does
-- not matter if it gets it wrong in marginal cases, since the only result
-- is to miss some smart recompilation cases, correct functioning is not
-- affected by a miscomputation. Returns Checksum_Error if the file is
-- missing or has an error.
function Checksums_Match (Checksum1, Checksum2 : Word) return Boolean;
pragma Inline (Checksums_Match);
-- Returns True if Checksum1 and Checksum2 have the same value and are
-- not equal to Checksum_Error, returns False in all other cases. This
-- routine must always be used to compare for checksum equality, to
-- ensure that the case of Checksum_Error is handled properly.
end ALI.Util;
|
with
Interfaces.C,
System;
package GLX
is
use Interfaces;
---------
-- Types
--
-- XEventQueueOwner
--
type XEventQueueOwner is (nil);
for XEventQueueOwner use (nil => 0);
pragma Convention (C, XEventQueueOwner);
type XEventQueueOwner_Pointer is access all XEventQueueOwner;
type XEventQueueOwner_array is array (C.size_t range <>) of aliased XEventQueueOwner;
type XEventQueueOwner_Pointers is array (C.size_t range <>) of aliased XEventQueueOwner_Pointer;
-- XEventQueueOwner_Pointer_Pointer
--
type XEventQueueOwner_Pointer_Pointer is access all glx.XEventQueueOwner_Pointer;
-- VisualID
--
subtype VisualID is C.unsigned_long;
type VisualID_array is array (C.size_t range <>) of aliased VisualID;
-- XVisualInfo
--
subtype XVisualInfo is system.Address;
type XVisualInfo_array is array (C.size_t range <>) of aliased XVisualInfo;
-- Pixmap
--
subtype Pixmap is system.Address;
type Pixmap_array is array (C.size_t range <>) of aliased Pixmap;
-- Font
--
subtype Font is system.Address;
type Font_array is array (C.size_t range <>) of aliased Font;
-- Window
--
subtype Window is system.Address;
type Window_array is array (C.size_t range <>) of aliased Window;
-- Bool
--
subtype Bool is C.int;
type Bool_array is array (C.size_t range <>) of aliased Bool;
-- ContextRec
--
subtype ContextRec is system.Address;
type ContextRec_array is array (C.size_t range <>) of aliased ContextRec;
-- XID
--
subtype XID is system.Address;
type XID_array is array (C.size_t range <>) of aliased XID;
-- GLXPixmap
--
subtype GLXPixmap is XID;
type GLXPixmap_array is array (C.size_t range <>) of aliased glxPixmap;
-- GLXDrawable
--
subtype Drawable is glx.XID;
type Drawable_array is array (C.size_t range <>) of aliased Drawable;
-- FBConfig
--
subtype FBConfig is system.Address;
type FBConfig_array is array (C.size_t range <>) of aliased FBConfig;
-- FBConfigID
--
subtype FBConfigID is XID;
type FBConfigID_array is array (C.size_t range <>) of aliased FBConfigID;
-- ContextID
--
subtype ContextID is XID;
type ContextID_array is array (C.size_t range <>) of aliased ContextID;
-- Window
--
subtype GLXWindow is XID;
type GLXWindow_array is array (C.size_t range <>) of aliased GLXWindow;
-- GLXPbuffer
--
subtype PBuffer is XID;
type PBuffer_array is array (C.size_t range <>) of aliased PBuffer;
-------------
-- Constants
--
GLX_VERSION_1_1 : constant := 1;
GLX_VERSION_1_2 : constant := 1;
GLX_VERSION_1_3 : constant := 1;
GLX_VERSION_1_4 : constant := 1;
GLX_USE_GL : constant := 1;
GLX_BUFFER_SIZE : constant := 2;
GLX_LEVEL : constant := 3;
GLX_RGBA : constant := 4;
GLX_DOUBLEBUFFER : constant := 5;
GLX_STEREO : constant := 6;
GLX_AUX_BUFFERS : constant := 7;
GLX_RED_SIZE : constant := 8;
GLX_GREEN_SIZE : constant := 9;
GLX_BLUE_SIZE : constant := 10;
GLX_ALPHA_SIZE : constant := 11;
GLX_DEPTH_SIZE : constant := 12;
GLX_STENCIL_SIZE : constant := 13;
GLX_ACCUM_RED_SIZE : constant := 14;
GLX_ACCUM_GREEN_SIZE : constant := 15;
GLX_ACCUM_BLUE_SIZE : constant := 16;
GLX_ACCUM_ALPHA_SIZE : constant := 17;
GLX_BAD_SCREEN : constant := 1;
GLX_BAD_ATTRIBUTE : constant := 2;
GLX_NO_EXTENSION : constant := 3;
GLX_BAD_VISUAL : constant := 4;
GLX_BAD_CONTEXT : constant := 5;
GLX_BAD_VALUE : constant := 6;
GLX_BAD_ENUM : constant := 7;
GLX_VENDOR : constant := 1;
GLX_VERSION : constant := 2;
GLX_EXTENSIONS : constant := 3;
GLX_CONFIG_CAVEAT : constant := 16#20#;
GLX_DONT_CARE : constant := 16#ffffffff#;
GLX_X_VISUAL_TYPE : constant := 16#22#;
GLX_TRANSPARENT_TYPE : constant := 16#23#;
GLX_TRANSPARENT_INDEX_VALUE : constant := 16#24#;
GLX_TRANSPARENT_RED_VALUE : constant := 16#25#;
GLX_TRANSPARENT_GREEN_VALUE : constant := 16#26#;
GLX_TRANSPARENT_BLUE_VALUE : constant := 16#27#;
GLX_TRANSPARENT_ALPHA_VALUE : constant := 16#28#;
GLX_WINDOW_BIT : constant := 16#1#;
GLX_PIXMAP_BIT : constant := 16#2#;
GLX_PBUFFER_BIT : constant := 16#4#;
GLX_AUX_BUFFERS_BIT : constant := 16#10#;
GLX_FRONT_LEFT_BUFFER_BIT : constant := 16#1#;
GLX_FRONT_RIGHT_BUFFER_BIT : constant := 16#2#;
GLX_BACK_LEFT_BUFFER_BIT : constant := 16#4#;
GLX_BACK_RIGHT_BUFFER_BIT : constant := 16#8#;
GLX_DEPTH_BUFFER_BIT : constant := 16#20#;
GLX_STENCIL_BUFFER_BIT : constant := 16#40#;
GLX_ACCUM_BUFFER_BIT : constant := 16#80#;
GLX_NONE : constant := 16#8000#;
GLX_SLOW_CONFIG : constant := 16#8001#;
GLX_TRUE_COLOR : constant := 16#8002#;
GLX_DIRECT_COLOR : constant := 16#8003#;
GLX_PSEUDO_COLOR : constant := 16#8004#;
GLX_STATIC_COLOR : constant := 16#8005#;
GLX_GRAY_SCALE : constant := 16#8006#;
GLX_STATIC_GRAY : constant := 16#8007#;
GLX_TRANSPARENT_RGB : constant := 16#8008#;
GLX_TRANSPARENT_INDEX : constant := 16#8009#;
GLX_VISUAL_ID : constant := 16#800b#;
GLX_SCREEN : constant := 16#800c#;
GLX_NON_CONFORMANT_CONFIG : constant := 16#800d#;
GLX_DRAWABLE_TYPE : constant := 16#8010#;
GLX_RENDER_TYPE : constant := 16#8011#;
GLX_X_RENDERABLE : constant := 16#8012#;
GLX_FBCONFIG_ID : constant := 16#8013#;
GLX_RGBA_TYPE : constant := 16#8014#;
GLX_COLOR_INDEX_TYPE : constant := 16#8015#;
GLX_MAX_PBUFFER_WIDTH : constant := 16#8016#;
GLX_MAX_PBUFFER_HEIGHT : constant := 16#8017#;
GLX_MAX_PBUFFER_PIXELS : constant := 16#8018#;
GLX_PRESERVED_CONTENTS : constant := 16#801b#;
GLX_LARGEST_PBUFFER : constant := 16#801c#;
GLX_WIDTH : constant := 16#801d#;
GLX_HEIGHT : constant := 16#801e#;
GLX_EVENT_MASK : constant := 16#801f#;
GLX_DAMAGED : constant := 16#8020#;
GLX_SAVED : constant := 16#8021#;
GLX_WINDOW : constant := 16#8022#;
GLX_PBUFFER : constant := 16#8023#;
GLX_PBUFFER_HEIGHT : constant := 16#8040#;
GLX_PBUFFER_WIDTH : constant := 16#8041#;
GLX_RGBA_BIT : constant := 16#1#;
GLX_COLOR_INDEX_BIT : constant := 16#2#;
GLX_PBUFFER_CLOBBER_MASK : constant := 16#8000000#;
GLX_SAMPLE_BUFFERS : constant := 16#186a0#;
GLX_SAMPLES : constant := 16#186a1#;
GLX_PbufferClobber : constant := 0;
GLX_BufferSwapComplete : constant := 1;
a_a_GLX_NUMBER_EVENTS : constant := 17;
GLX_ARB_render_texture : constant := 1;
GLX_EXT_texture_from_pixmap : constant := 1;
GLX_BIND_TO_TEXTURE_RGB_EXT : constant := 16#20d0#;
GLX_BIND_TO_TEXTURE_RGBA_EXT : constant := 16#20d1#;
GLX_BIND_TO_MIPMAP_TEXTURE_EXT : constant := 16#20d2#;
GLX_BIND_TO_TEXTURE_TARGETS_EXT : constant := 16#20d3#;
GLX_Y_INVERTED_EXT : constant := 16#20d4#;
GLX_TEXTURE_FORMAT_EXT : constant := 16#20d5#;
GLX_TEXTURE_TARGET_EXT : constant := 16#20d6#;
GLX_MIPMAP_TEXTURE_EXT : constant := 16#20d7#;
GLX_TEXTURE_FORMAT_NONE_EXT : constant := 16#20d8#;
GLX_TEXTURE_FORMAT_RGB_EXT : constant := 16#20d9#;
GLX_TEXTURE_FORMAT_RGBA_EXT : constant := 16#20da#;
GLX_TEXTURE_1D_BIT_EXT : constant := 16#1#;
GLX_TEXTURE_2D_BIT_EXT : constant := 16#2#;
GLX_TEXTURE_RECTANGLE_BIT_EXT : constant := 16#4#;
GLX_TEXTURE_1D_EXT : constant := 16#20db#;
GLX_TEXTURE_2D_EXT : constant := 16#20dc#;
GLX_TEXTURE_RECTANGLE_EXT : constant := 16#20dd#;
GLX_FRONT_LEFT_EXT : constant := 16#20de#;
GLX_FRONT_RIGHT_EXT : constant := 16#20df#;
GLX_BACK_LEFT_EXT : constant := 16#20e0#;
GLX_BACK_RIGHT_EXT : constant := 16#20e1#;
GLX_FRONT_EXT : constant := 16#20de#;
GLX_BACK_EXT : constant := 16#20e0#;
GLX_AUX0_EXT : constant := 16#20e2#;
GLX_AUX1_EXT : constant := 16#20e3#;
GLX_AUX2_EXT : constant := 16#20e4#;
GLX_AUX3_EXT : constant := 16#20e5#;
GLX_AUX4_EXT : constant := 16#20e6#;
GLX_AUX5_EXT : constant := 16#20e7#;
GLX_AUX6_EXT : constant := 16#20e8#;
GLX_AUX7_EXT : constant := 16#20e9#;
GLX_AUX8_EXT : constant := 16#20ea#;
GLX_AUX9_EXT : constant := 16#20eb#;
end GLX;
|
--
-- N-Body integrations demonstrate the need for high accuracy and
-- reliable error estimates.
--
-- N-Body equation:
-- Acceleration(Body_j)
-- = SumOver(Body_k) { Mass(Body_k) * G * DeltaR / NORM(DeltaR)**3 }
--
-- where DeltaR = (X(Body_k) - X(Body_j)) is a vector,
-- and where G is the gravitaional constant.
--
-- Natural units:
-- Unit of time is earth_orbital_period : t_0.
-- Unit of distance is earth's orbital semi-major axis : a_0.
-- Unit of mass is sum of Sun and Earth mass : m_0.
-- These are related to each other by Kepler's law:
--
-- t_0 = 2 * Pi * SQRT (a_0**3 / (G * m_0))
--
-- where G is the gravitaional constant. If you divide variable of
-- time in the N_Body equation by t_0 to get natural units, the equation
-- becomes:
--
-- Acceleration(Body_j) = 2*2*Pi*Pi*
-- SumOver(Body_k) { Mass(Body_k) * DeltaR / NORM(DeltaR)**3 }
--
-- where DeltaR = (X(Body_k) - X(Body_j)).
--
-- Mass, time, and distance are in the natural units given above -
-- gets rid of the gravitational constant G. In the Equation
-- as implemented below, the masses are multiplied by 2*2*pi*pi
-- when they are defined in order to avoid an excessive number of
-- multiplications during evaluation of F(t, Y).
with Runge_8th;
with Text_IO; use Text_IO;
with Four_Body;
procedure runge_8th_order_demo_4 is
type Real is digits 15;
package rio is new Float_IO(Real);
use rio;
package Bodies_4 is new Four_Body (Real);
use Bodies_4;
package N_Body_Solve is new
Runge_8th (Real, State_Index, Dynamical_Variable, F, "*", "+", "-", Norm);
use N_Body_Solve;
Initial_State : Dynamical_Variable;
Final_Y : Dynamical_Variable;
Previous_Y : Dynamical_Variable;
Final_t : Real;
Previous_t : Real;
ErrorTolerance : constant Real := 2.0E-12;
-- 2nd body :
a : constant Real := 21.71534093275925;
Orbital_Period : constant Real := 80.0;
Orbits_Per_int : constant Real := 10.0;
No_Of_Steps_Per_int : constant step_integer := 120_000;
Delta_t : constant Real := Orbital_Period * Orbits_Per_int;
X2, X0, Z2, Z0 : Real;
-- Choose initial conditions.
-- Body1 is the larger, mass = 1.0 (sun mass).
-- Body2 is the smaller, mass = 0.6 (sun mass).
-- Assume the orbital period of the 2 stars is 80.0 years.
-- Say the planet is body 3: one earth distance
-- from the larger star with 1 earth mass.
-- From these calculate the semimajor axis "a" in
-- Kepler's law given above; then put the three bodies in
-- near circular orbits and observe stability.
-- Remember to use the reduced-mass formulas to get distance
-- from center of mass:
--
-- Body_1_Radius r1 = a*m2 / (m1+m2)
-- Body_2_Radius r2 = a*m1 / (m1+m2)
--Planet_Orbital_Radius : constant Real := 1.0;-- earth's orbital period
--Planet_Period : constant Real := 1.0;
--Planet_Orbital_Radius : constant Real := 2.0;-- Twice earth's orbit
--Planet_Period : constant Real := 2.82842712474619;
--Planet_Orbital_Radius : constant Real := 3.0;-- Thrice earth's orbit
--Planet_Period : constant Real := 5.196152422706632;
--Planet_Orbital_Radius2 : constant Real := 1.587401052; -- 1.59 earth's orbit
--Planet_Period2 : constant Real := 2.0;-- 1.59**1.5 from Kepler's law
Planet_Orbital_Radius1 : constant Real := 1.0;-- 1 times earth's orbit
Planet_Period1 : constant Real := 1.0;-- 4**1.5 from Kepler's law
Planet_Orbital_Radius2 : constant Real := 4.0; -- 1.59 earth's orbit
Planet_Period2 : constant Real := 8.0;-- 4.0**1.5 from Kepler's law
m1 : constant Real := Mass(0);
m2 : constant Real := Mass(1);
Body_1_Radius : constant Real := a * m2 / (m1+m2);
Body_2_Radius : constant Real := a * m1 / (m1+m2);
Body_3_Radius : constant Real := Planet_Orbital_Radius1 + Body_1_Radius;
Body_4_Radius : constant Real := Planet_Orbital_Radius2 + Body_1_Radius;
Body_1_Speed : constant Real := TwoPii*Body_1_Radius / Orbital_Period;
Body_2_Speed : constant Real := TwoPii*Body_2_Radius / Orbital_Period;
Ratio : Constant Real := Body_3_Radius / Body_1_Radius;
Body_3_Speed : constant Real
:= (TwoPii * Planet_Orbital_Radius1 / Planet_Period1) + Body_1_Speed;
Body_4_Speed : constant Real
:= (TwoPii * Planet_Orbital_Radius2 / Planet_Period2) + Body_1_Speed;
d_X, d_Z : Real;
Orbit : Real := 0.0;
Radius2 : Real;
Min : Real := 100000.0;
Max : Real := 0.0;
Min3, Min1 : Real := 100000.0;
Max3, Max1 : Real := 0.0;
begin
Update_State (Initial_State, 0,
0.0, Body_1_Radius, Body_1_Speed, 0.0);
Update_State (Initial_State, 1,
0.0, -Body_2_Radius, -Body_2_Speed, 0.0);
Update_State (Initial_State, 2,
0.0, Body_3_Radius, Body_3_Speed, 0.0);
Update_State (Initial_State, 3,
0.0, Body_4_Radius, Body_4_Speed, 0.0);
--Initial_State(0) := (0.0, Body_1_Radius, -- 1st body XY position
-- Body_1_Speed, 0.0);-- 1st body UW velocity
--Initial_State(1) := (0.0, -Body_2_Radius, -- 2nd body XY position
-- -Body_2_Speed, 0.0);-- 2nd body UW velocity
--Initial_State(2) := (0.0, Body_3_Radius, -- 3rd body XY position
-- Body_3_Speed, 0.0);-- 3rd body UW velocity
--Initial_State(3) := (0.0, Body_4_Radius, -- 4rth body XY position
-- Body_4_Speed, 0.0);-- 4rth body UW velocity
-- Notice that they are all rotating clockwise
-- looking down on the XZ plane.
Previous_t := 0.0;
Previous_Y := Initial_State;
Final_t := Delta_t;
new_line;
loop
Integrate
(Final_State => Final_Y, -- output the result.
Final_Time => Final_t, -- integrate out to here.
Initial_State => Previous_Y, -- input an initial condition.
Initial_Time => Previous_t, -- start integrating here.
No_Of_Steps => No_Of_Steps_Per_int);
Previous_t := Final_t;
Previous_Y := Final_Y;
Final_t := Previous_t + Delta_t;
Orbit := Orbit + Orbits_Per_int;
X2 := State_Val (Final_Y,2,0);
X0 := State_Val (Final_Y,0,0);
Z2 := State_Val (Final_Y,2,1);
Z0 := State_Val (Final_Y,0,1);
d_X := X2 - X0;
d_Z := Z2 - Z0;
Radius2 := d_X**2 + d_Z**2;
if Radius2 > Max then
Max := Radius2;
end if;
if Radius2 < Min then
Min := Radius2;
end if;
put ("Year = "); put (Orbit * Orbital_Period); new_line;
put (" Max = "); put (Max); put(" Min = "); put (Min); new_line;
X2 := State_Val (Final_Y,3,0);
X0 := State_Val (Final_Y,0,0);
Z2 := State_Val (Final_Y,3,1);
Z0 := State_Val (Final_Y,0,1);
d_X := X2 - X0;
d_Z := Z2 - Z0;
Radius2 := d_X**2 + d_Z**2;
if Radius2 > Max3 then
Max3 := Radius2;
end if;
if Radius2 < Min3 then
Min3 := Radius2;
end if;
put (" Max3 ="); put (Max3);
put (" Min3 ="); put (Min3); new_line;
X2 := State_Val (Final_Y,1,0);
X0 := State_Val (Final_Y,0,0);
Z2 := State_Val (Final_Y,1,1);
Z0 := State_Val (Final_Y,0,1);
d_X := X2 - X0;
d_Z := Z2 - Z0;
Radius2 := d_X**2 + d_Z**2;
if Radius2 > Max1 then
Max1 := Radius2;
end if;
if Radius2 < Min1 then
Min1 := Radius2;
end if;
put (" Max1 ="); put (Max1);
put (" Min1 ="); put (Min1); new_line;
--exit when Count = 2;
end loop;
end;
|
with Ada.Numerics.Discrete_Random;
package body Pig is
function Score(P: Player) return Natural is (P.Score);
function All_Recent(P: Player) return Natural is (P.All_Recent);
function Recent(P: Player) return Natural is (Natural(P.Recent_Roll));
function Has_Won(P: Player) return Boolean is (P.Score >= 100);
package RND is new Ada.Numerics.Discrete_Random(Dice_Score);
Gen: RND.Generator;
procedure Roll(P: in out Player) is
begin
P.Recent_Roll := RND.Random(Gen);
if P.Recent = 1 then
P.All_Recent := 0;
else
P.All_Recent := P.All_Recent + P.Recent;
end if;
end Roll;
procedure Add_To_Score(P: in out Player) is
begin
P.Score := P.Score + P.All_Recent;
P.All_Recent := 0;
end Add_To_Score;
procedure Play(First, Second: Actor'Class;
First_Wins: out Boolean) is
P1, P2: Player;
begin
loop
Roll(P1);
while First.Roll_More(P1, P2) and then P1.Recent > 1 loop
Roll(P1);
end loop;
Add_To_Score(P1);
exit when P1.Score >= 100;
Roll(P2);
while Second.Roll_More(P2, P1) and then P2.Recent > 1 loop
Roll(P2);
end loop;
Add_To_Score(P2);
exit when P2.Score >= 100;
end loop;
First_Wins := P1.Score >= 100;
end Play;
begin
RND.Reset(Gen);
end Pig;
|
with Ada.Exceptions, Interfaces;
with Ada.Streams;
use Ada.Exceptions, Interfaces;
use Ada.Streams;
package Bitcoin is
subtype BT_Raw_Addr is Stream_Element_Array(1..25);
subtype BT_Checksum is Stream_Element_Array(1..4);
subtype BT_Addr is String(1..34);
subtype Sha256String is String(1..64);
Invalid_Address_Error : Exception;
function Double_Sha256(S : Stream_Element_Array) return BT_Checksum;
function Is_Valid(A : BT_Raw_Addr) return Boolean;
procedure Base58_Decode(S : BT_Addr; A : out BT_Raw_Addr) ;
private
Base58 : constant String := "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
function Hex_Val (C, C2 : Character) return Stream_Element;
end Bitcoin;
with GNAT.SHA256, Ada.Strings.Fixed;
use GNAT.SHA256, Ada.Strings.Fixed;
package body Bitcoin is
function Hex_Val (C, C2 : Character) return Stream_Element is
subtype Nibble is Integer range 0..15;
HEX : array (0..255) of Nibble := (
48=>0, 49=>1, 50=>2, 51=>3, 52=>4, 53=>5, 54=>6, 55=>7, 56=>8, 57=>9
, 65=>10, 66=>11, 67=>12, 68 =>13, 69 =>14, 70 =>15
, 97=>10, 98=>11, 99=>12, 100=>13, 101=>14, 102=>15
, Others=>0
);
begin
return Stream_Element(HEX(Character'Pos(C)) * 16 + HEX(Character'Pos(C2)));
end Hex_Val;
function Double_Sha256(S : Stream_Element_Array) return BT_Checksum is
Ctx : Context := Initial_Context;
D : Message_Digest;
S2 : Stream_Element_Array(1..32);
Ctx2 : Context := Initial_Context;
C : BT_Checksum;
begin
Update(Ctx, S);
D := Digest(Ctx);
for I in S2'Range loop
S2(I) := Hex_Val(D(Integer(I)*2-1), D(Integer(I)*2));
end loop;
Update(Ctx2, S2);
D := Digest(Ctx2);
for I in C'Range loop
C(I) := Hex_Val(D(Integer(I)*2-1), D(Integer(I)*2));
end loop;
return C;
end Double_Sha256;
--------------------------------------------------------------------------------
-- Summary of Base58: --
-- We decode S into a 200 bit unsigned integer. --
-- We could use a BigNum library, but choose to go without. --
--------------------------------------------------------------------------------
procedure Base58_Decode(S : BT_Addr; A : out BT_Raw_Addr) is
begin
A := (Others => 0);
for I in S'Range loop
declare
P : Natural := Index(Base58, String(S(I..I)));
C : Natural;
begin
if P = 0 then
raise Invalid_Address_Error;
end if;
C := P - 1;
for J in reverse A'Range loop
C := C + Natural(A(J)) * 58;
A(J) := Stream_Element(Unsigned_32(C) and 255); -- 0x00FF
C := Natural(Shift_Right(Unsigned_32(C),8) and 255); -- 0xFF00
end loop;
if C /= 0 then
raise Invalid_Address_Error;
end if;
end;
end loop;
end Base58_Decode;
function Is_Valid(A : BT_Raw_Addr) return Boolean is
begin
return A(1) = 0 and A(22..25) = Double_Sha256(A(1..21));
end Is_Valid;
end Bitcoin;
with Ada.Text_IO, Bitcoin;
use Ada.Text_IO, Bitcoin;
procedure Bitcoin_Addr_Validate is
begin
declare
BTs : array (positive range <>) of BT_Addr := (
"1AGNa15ZQXAZUgFiqJ2i7Z2DPU2J6hW62i" -- VALID
, "1Q1pE5vPGEEMqRcVRMbtBK842Y6Pzo6nK9" -- VALID
, "1AGNa15ZQXAZUgFiqJ2i7Z2DPU2J6hW62X" -- checksum changed, original data.
, "1ANNa15ZQXAZUgFiqJ2i7Z2DPU2J6hW62i" -- data changed, original checksum.
, "1A Na15ZQXAZUgFiqJ2i7Z2DPU2J6hW62i" -- invalid chars
);
begin
for I in Bts'Range loop
declare
A : BT_Raw_Addr;
Valid : Boolean;
begin
Put(BTs(I) & " validity: ");
Base58_Decode(BTs(I), A);
Valid := Is_Valid(A);
Put_Line(Boolean'Image(Valid));
exception
when E : Invalid_Address_Error =>
Put_Line ("*** Error: Invalid BT address.");
end;
end loop;
end;
end Bitcoin_Addr_Validate;
|
-- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: License.txt
with Ada.Command_Line;
with Ada.Text_IO;
with Actions;
with PortScan.Pilot;
with Parameters;
with Unix;
procedure synth
is
type mandate_type is (unset, status, help, configure, version, up_system,
prep_system, purge, everything, build, install, force,
just_build, test, status_everything, gen_repo);
mandate : mandate_type := unset;
package CLI renames Ada.Command_Line;
package TIO renames Ada.Text_IO;
package ACT renames Actions;
package PIL renames PortScan.Pilot;
begin
if CLI.Argument_Count = 0 then
ACT.print_version;
return;
end if;
declare
first : constant String := CLI.Argument (1);
comerr : constant String := "Synth command error: ";
badcfg : constant String := "Configuration failed to load.";
regjoe : constant String := "Only the root user can execute that.";
holdon : constant String := "Synth is already running on this system.";
badmnt : constant String := "Builder mounts detected; attempting to " &
"remove them automatically ...";
badwrk : constant String := "Old work directories detected; attempting " &
"to remove them automatically ...";
badcwd : constant String := "Please change the current directory; " &
"Synth is unable to launch from here.";
begin
if first = "help" then
mandate := help;
elsif first = "status" then
mandate := status;
elsif first = "version" then
mandate := version;
elsif first = "configure" then
mandate := configure;
elsif first = "install" then
mandate := install;
elsif first = "build" then
mandate := build;
elsif first = "force" then
mandate := force;
elsif first = "just-build" then
mandate := just_build;
elsif first = "upgrade-system" then
mandate := up_system;
elsif first = "prepare-system" then
mandate := prep_system;
elsif first = "rebuild-repository" then
mandate := gen_repo;
elsif first = "purge-distfiles" then
mandate := purge;
elsif first = "everything" then
mandate := everything;
elsif first = "status-everything" then
mandate := status_everything;
elsif first = "test" then
mandate := test;
end if;
if CLI.Argument_Count > 1 then
case mandate is
when unset =>
ACT.print_version;
TIO.Put_Line (comerr & "'" & first & "' is not a valid keyword.");
return;
when help | configure | version | prep_system | up_system | purge |
everything | status_everything =>
ACT.print_version;
TIO.Put_Line (comerr & "'" & first & "' keyword uses no arguments.");
return;
when others => null;
end case;
PortScan.set_cores;
if Parameters.load_configuration (PortScan.cores_available) then
PIL.set_replicant_platform;
else
TIO.Put_Line (badcfg);
return;
end if;
if not Parameters.all_paths_valid then
return;
end if;
if not PIL.valid_system_root then
return;
end if;
if not PIL.TERM_defined_in_environment then
return;
end if;
if PIL.synth_launch_clash then
TIO.Put_Line (badcwd);
return;
end if;
if PIL.insufficient_privileges then
TIO.Put_Line (regjoe);
return;
end if;
if PIL.already_running then
TIO.Put_Line (holdon);
return;
end if;
if PIL.previous_run_mounts_detected then
TIO.Put_Line (badmnt);
if not PIL.old_mounts_successfully_removed then
return;
end if;
end if;
if PIL.previous_realfs_work_detected then
TIO.Put_Line (badwrk);
if not PIL.old_realfs_work_successfully_removed then
return;
end if;
end if;
if PIL.synthexec_missing then
return;
end if;
if not PIL.ensure_port_index then
-- error messages emitted by ensure_port_index
return;
end if;
if not PIL.store_origins then
-- error messages emitted by store_origins, just exit now
return;
end if;
PIL.create_pidfile;
Unix.ignore_background_tty;
Unix.cone_of_silence (deploy => True);
----------------------------------
-- Multiple argument commands --
----------------------------------
case mandate is
when help | configure | version | prep_system | up_system | purge |
everything | status_everything | gen_repo | unset =>
-- Handled above. Don't use "others" here;
-- we don't want to disable full coverage
null;
when status =>
if PIL.prerequisites_available and then
PIL.scan_stack_of_single_ports (testmode => False) and then
PIL.sanity_check_then_prefail (delete_first => False, dry_run => True)
then
PIL.display_results_of_dry_run;
end if;
when just_build =>
if PIL.prerequisites_available and then
PIL.scan_stack_of_single_ports (testmode => False) and then
PIL.sanity_check_then_prefail
then
PIL.perform_bulk_run (testmode => False);
end if;
when build =>
if PIL.prerequisites_available and then
PIL.scan_stack_of_single_ports (testmode => False) and then
PIL.sanity_check_then_prefail
then
PIL.perform_bulk_run (testmode => False);
if PIL.verify_desire_to_rebuild_repository and then
PIL.write_pkg_repos_configuration_file and then
PIL.rebuild_local_respository (remove_invalid_packages => False) and then
PIL.verify_desire_to_install_packages
then
PIL.upgrade_system_exactly;
end if;
end if;
when force =>
if PIL.prerequisites_available and then
PIL.scan_stack_of_single_ports (testmode => False, always_build => True) and then
PIL.sanity_check_then_prefail (delete_first => True)
then
PIL.perform_bulk_run (testmode => False);
if PIL.verify_desire_to_rebuild_repository and then
PIL.write_pkg_repos_configuration_file and then
PIL.rebuild_local_respository (remove_invalid_packages => False) and then
PIL.verify_desire_to_install_packages
then
PIL.upgrade_system_exactly;
end if;
end if;
when install =>
if PIL.prerequisites_available and then
PIL.scan_stack_of_single_ports (testmode => False) and then
PIL.sanity_check_then_prefail
then
PIL.perform_bulk_run (testmode => False);
if PIL.write_pkg_repos_configuration_file and then
PIL.rebuild_local_respository (remove_invalid_packages => False)
then
PIL.upgrade_system_exactly;
end if;
end if;
when test =>
if PIL.prerequisites_available and then
PIL.scan_stack_of_single_ports (testmode => True, always_build => True) and then
PIL.sanity_check_then_prefail (delete_first => True)
then
if PIL.interact_with_single_builder then
PIL.bulk_run_then_interact_with_final_port;
else
PIL.perform_bulk_run (testmode => True);
end if;
end if;
end case;
else
--------------------------------
-- Single argument commands --
--------------------------------
case mandate is
when build | force | just_build | install | test =>
ACT.print_version;
TIO.Put_Line (comerr & "'" & first &
"' requires at least one argument.");
return;
when version =>
ACT.print_version;
return;
when help =>
ACT.print_help;
return;
when unset =>
ACT.print_version;
TIO.Put_Line (comerr & "'" & first &
"' is not a valid keyword.");
return;
when others => null;
end case;
if PIL.insufficient_privileges then
TIO.Put_Line (regjoe);
return;
end if;
if PIL.already_running then
TIO.Put_Line (holdon);
return;
end if;
PortScan.set_cores;
if Parameters.load_configuration (PortScan.cores_available) then
PIL.set_replicant_platform;
else
TIO.Put_Line (badcfg);
return;
end if;
if not PIL.TERM_defined_in_environment then
return;
end if;
if PIL.synth_launch_clash then
TIO.Put_Line (badcwd);
return;
end if;
if not (mandate = configure) then
if not Parameters.all_paths_valid then
return;
end if;
if not PIL.valid_system_root then
return;
end if;
end if;
if PIL.previous_run_mounts_detected then
TIO.Put_Line (badmnt);
if not PIL.old_mounts_successfully_removed then
return;
end if;
end if;
if PIL.previous_realfs_work_detected then
TIO.Put_Line (badwrk);
if not PIL.old_realfs_work_successfully_removed then
return;
end if;
end if;
if PIL.synthexec_missing then
return;
end if;
if mandate /= configure then
if not PIL.ensure_port_index then
-- error messages emitted by ensure_port_index
return;
end if;
end if;
PIL.create_pidfile;
Unix.ignore_background_tty;
if mandate /= configure then
Unix.cone_of_silence (deploy => True);
end if;
case mandate is
when build | just_build | install | test | version | help |
force | unset =>
-- Handled above. Don't use "others" here;
-- we don't want to disable full coverage
null;
when configure =>
ACT.launch_configure_menu (PortScan.cores_available);
when status =>
PIL.upgrade_system_everything (skip_installation => True, dry_run => True);
when up_system =>
if PIL.write_pkg_repos_configuration_file then
PIL.upgrade_system_everything;
end if;
when prep_system =>
PIL.upgrade_system_everything (skip_installation => True);
when gen_repo =>
if PIL.prerequisites_available and then
PIL.rebuild_local_respository (remove_invalid_packages => True)
then
if PIL.host_pkg8_conservative_upgrade_set then
TIO.Put_Line ("Note: This system's pkg(8) is configured " &
"with CONSERVATIVE_UPGRADE = true");
TIO.Put_Line (" You may wish to toggle that " &
"setting if this is a local repository.");
end if;
end if;
when purge =>
PIL.purge_distfiles;
when everything =>
if PIL.prerequisites_available and then
PIL.fully_scan_ports_tree and then
PIL.sanity_check_then_prefail
then
PIL.perform_bulk_run (testmode => False);
if PIL.rebuild_local_respository (remove_invalid_packages => True) then
null;
end if;
end if;
when status_everything =>
if PIL.prerequisites_available and then
PIL.fully_scan_ports_tree and then
PIL.sanity_check_then_prefail (delete_first => False, dry_run => True)
then
PIL.display_results_of_dry_run;
end if;
end case;
end if;
end;
Unix.cone_of_silence (deploy => False);
PIL.destroy_pidfile;
end synth;
|
-- Copyright (c) 2021 Devin Hill
-- zlib License -- see LICENSE for details.
with Ada.Unchecked_Conversion;
package body GBA.Input.Buffered is
procedure Update_Key_State is
begin
Last_Key_State := Current_Key_State;
Current_Key_State := Read_Key_State;
end;
function Is_Key_Down (K : Key) return Boolean is
( (Current_Key_State and To_Flags(K)) /= 0 );
function Was_Key_Pressed (K : Key) return Boolean is
( (Current_Key_State and (not Last_Key_State) and To_Flags(K)) /= 0 );
function Was_Key_Released (K : Key) return Boolean is
( ((not Current_Key_State) and Last_Key_State and To_Flags(K)) /= 0 );
function Was_Key_Held (K : Key) return Boolean is
( (Current_Key_State and Last_Key_State and To_Flags(K)) /= 0 );
function Was_Key_Untouched (K : Key) return Boolean is
( ((not Current_Key_State) and (not Last_Key_State) and To_Flags(K)) /= 0 );
function Are_Any_Down (F : Key_Flags) return Boolean is
( (Current_Key_State and F) /= 0 );
function Were_Any_Pressed (F : Key_Flags) return Boolean is
( (Current_Key_State and (not Last_Key_State) and F) /= 0 );
function Were_Any_Released (F : Key_Flags) return Boolean is
( ((not Current_Key_State) and Last_Key_State and F) /= 0 );
function Were_Any_Held (F : Key_Flags) return Boolean is
( (Current_Key_State and Last_Key_State and F) /= 0 );
function Were_Any_Untouched (F : Key_Flags) return Boolean is
( ((not Current_Key_State) and (not Last_Key_State) and F) /= 0 );
function Are_All_Down (F : Key_Flags) return Boolean is
( (Current_Key_State and F) = F );
function Were_All_Pressed (F : Key_Flags) return Boolean is
( (Current_Key_State and (not Last_Key_State) and F) = F );
function Were_All_Released (F : Key_Flags) return Boolean is
( ((not Current_Key_State) and Last_Key_State and F) = F );
function Were_All_Held (F : Key_Flags) return Boolean is
( (Current_Key_State and Last_Key_State and F) = F );
function Were_All_Untouched (F : Key_Flags) return Boolean is
( ((not Current_Key_State) and (not Last_Key_State) and F) = F );
end GBA.Input.Buffered;
|
with Interfaces; use Interfaces;
package body Simple_Webapps.Commands.Upload_Servers.File is
P : constant array (0 .. 0) of Natural :=
(0 .. 0 => 1);
T1 : constant array (0 .. 0) of Unsigned_8 :=
(0 .. 0 => 0);
T2 : constant array (0 .. 0) of Unsigned_8 :=
(0 .. 0 => 13);
G : constant array (0 .. 13) of Unsigned_8 :=
(0, 0, 0, 4, 0, 0, 0, 0, 0, 5, 0, 3, 2, 1);
function Hash (S : String) return Natural is
F : constant Natural := S'First - 1;
L : constant Natural := S'Length;
F1, F2 : Natural := 0;
J : Natural;
begin
for K in P'Range loop
exit when L < P (K);
J := Character'Pos (S (P (K) + F));
F1 := (F1 + Natural (T1 (K)) * J) mod 14;
F2 := (F2 + Natural (T2 (K)) * J) mod 14;
end loop;
return (Natural (G (F1)) + Natural (G (F2))) mod 6;
end Hash;
end Simple_Webapps.Commands.Upload_Servers.File;
|
with Ada.Text_IO;
procedure CLS is
begin
Ada.Text_IO.Put(ASCII.ESC & "[2J");
end CLS;
|
-- { dg-do run }
-- { dg-options "-gnatws -gnatVa" }
pragma Initialize_Scalars;
procedure Invalid1 is
X : Boolean;
A : Boolean := False;
procedure Uninit (B : out Boolean) is
begin
if A then
B := True;
raise Program_Error;
end if;
end;
begin
-- first, check that initialize_scalars is enabled
begin
if X then
A := False;
end if;
raise Program_Error;
exception
when Constraint_Error => null;
end;
-- second, check if copyback of an invalid value raises constraint error
begin
Uninit (A);
if A then
-- we expect constraint error in the 'if' above according to gnat ug:
-- ....
-- call. Note that there is no specific option to test `out'
-- parameters, but any reference within the subprogram will be tested
-- in the usual manner, and if an invalid value is copied back, any
-- reference to it will be subject to validity checking.
-- ...
raise Program_Error;
end if;
raise Program_Error;
exception
when Constraint_Error => null;
end;
end;
|
-- Copyright 2005-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
procedure Dummy is
begin
null; -- START
end Dummy;
|
-- 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-2022 POK team
pragma No_Run_Time;
with APEX;
use APEX;
with APEX.Timing;
use APEX.Timing;
with Interfaces.C;
package Activity is
procedure Thr1_Job;
end Activity;
|
------------------------------------------------------------------------------
-- Copyright (c) 2015, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.Web.Sites.Test_Updates provides special Site_Update types to --
-- make testing easier. --
------------------------------------------------------------------------------
with Ada.Calendar;
with Natools.Web.Sites.Updates;
package Natools.Web.Sites.Test_Updates is
type Load_Date_Override is new Updates.Site_Update with record
New_Date : Ada.Calendar.Time;
end record;
overriding procedure Update
(Self : in Load_Date_Override; Object : in out Site);
-- Set Object.Load_Date to Self.New_Date
end Natools.Web.Sites.Test_Updates;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Elements.Expressions;
with Program.Elements.Definitions;
with Program.Elements.Derived_Record_Extensions;
with Program.Element_Visitors;
package Program.Nodes.Derived_Record_Extensions is
pragma Preelaborate;
type Derived_Record_Extension is
new Program.Nodes.Node
and Program.Elements.Derived_Record_Extensions
.Derived_Record_Extension
and Program.Elements.Derived_Record_Extensions
.Derived_Record_Extension_Text
with private;
function Create
(Abstract_Token : Program.Lexical_Elements.Lexical_Element_Access;
Limited_Token : Program.Lexical_Elements.Lexical_Element_Access;
New_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Parent : not null Program.Elements.Expressions
.Expression_Access;
And_Token : Program.Lexical_Elements.Lexical_Element_Access;
Progenitors : Program.Elements.Expressions.Expression_Vector_Access;
With_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Record_Definition : not null Program.Elements.Definitions
.Definition_Access)
return Derived_Record_Extension;
type Implicit_Derived_Record_Extension is
new Program.Nodes.Node
and Program.Elements.Derived_Record_Extensions
.Derived_Record_Extension
with private;
function Create
(Parent : not null Program.Elements.Expressions
.Expression_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Record_Definition : not null Program.Elements.Definitions
.Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False;
Has_Abstract : Boolean := False;
Has_Limited : Boolean := False)
return Implicit_Derived_Record_Extension
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Derived_Record_Extension is
abstract new Program.Nodes.Node
and Program.Elements.Derived_Record_Extensions.Derived_Record_Extension
with record
Parent : not null Program.Elements.Expressions
.Expression_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Record_Definition : not null Program.Elements.Definitions
.Definition_Access;
end record;
procedure Initialize
(Self : aliased in out Base_Derived_Record_Extension'Class);
overriding procedure Visit
(Self : not null access Base_Derived_Record_Extension;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Parent
(Self : Base_Derived_Record_Extension)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Progenitors
(Self : Base_Derived_Record_Extension)
return Program.Elements.Expressions.Expression_Vector_Access;
overriding function Record_Definition
(Self : Base_Derived_Record_Extension)
return not null Program.Elements.Definitions.Definition_Access;
overriding function Is_Derived_Record_Extension_Element
(Self : Base_Derived_Record_Extension)
return Boolean;
overriding function Is_Type_Definition_Element
(Self : Base_Derived_Record_Extension)
return Boolean;
overriding function Is_Definition_Element
(Self : Base_Derived_Record_Extension)
return Boolean;
type Derived_Record_Extension is
new Base_Derived_Record_Extension
and Program.Elements.Derived_Record_Extensions
.Derived_Record_Extension_Text
with record
Abstract_Token : Program.Lexical_Elements.Lexical_Element_Access;
Limited_Token : Program.Lexical_Elements.Lexical_Element_Access;
New_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
And_Token : Program.Lexical_Elements.Lexical_Element_Access;
With_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Derived_Record_Extension_Text
(Self : aliased in out Derived_Record_Extension)
return Program.Elements.Derived_Record_Extensions
.Derived_Record_Extension_Text_Access;
overriding function Abstract_Token
(Self : Derived_Record_Extension)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function Limited_Token
(Self : Derived_Record_Extension)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function New_Token
(Self : Derived_Record_Extension)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function And_Token
(Self : Derived_Record_Extension)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function With_Token
(Self : Derived_Record_Extension)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Has_Abstract
(Self : Derived_Record_Extension)
return Boolean;
overriding function Has_Limited
(Self : Derived_Record_Extension)
return Boolean;
type Implicit_Derived_Record_Extension is
new Base_Derived_Record_Extension
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
Has_Abstract : Boolean;
Has_Limited : Boolean;
end record;
overriding function To_Derived_Record_Extension_Text
(Self : aliased in out Implicit_Derived_Record_Extension)
return Program.Elements.Derived_Record_Extensions
.Derived_Record_Extension_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Derived_Record_Extension)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Derived_Record_Extension)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Derived_Record_Extension)
return Boolean;
overriding function Has_Abstract
(Self : Implicit_Derived_Record_Extension)
return Boolean;
overriding function Has_Limited
(Self : Implicit_Derived_Record_Extension)
return Boolean;
end Program.Nodes.Derived_Record_Extensions;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- XML Processor --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
pragma Ada_2012;
package Matreshka.Internals.XML.Element_Tables is
pragma Preelaborate;
type Element_Table is limited private;
procedure New_Element
(Self : in out Element_Table;
Element : out Element_Identifier);
-- Allocates new element and returns its identifier.
function Is_Declared
(Self : Element_Table;
Element : Element_Identifier) return Boolean;
-- Returns True when element was declared.
procedure Set_Is_Declared
(Self : in out Element_Table;
Element : Element_Identifier;
Declared : Boolean);
-- Sets flag to specified value.
function Is_Attributes_Declared
(Self : Element_Table;
Element : Element_Identifier) return Boolean;
-- Returns True when attribute list of element type was declared.
procedure Set_Is_Attributes_Declared
(Self : in out Element_Table;
Element : Element_Identifier;
Declared : Boolean);
-- Sets flag to specified value.
function Attributes
(Self : Element_Table;
Element : Element_Identifier) return Attribute_Identifier;
-- Returns first attribute in the list of declared attributes.
procedure Set_Attributes
(Self : in out Element_Table;
Element : Element_Identifier;
Attribute : Attribute_Identifier);
-- Sets first attribute in the list of declared attributes.
function Is_Mixed_Content
(Self : Element_Table;
Element : Element_Identifier) return Boolean;
procedure Set_Is_Mixed_Content
(Self : in out Element_Table;
Element : Element_Identifier;
Value : Boolean);
function Is_Empty
(Self : Element_Table;
Element : Element_Identifier) return Boolean;
procedure Set_Is_Empty
(Self : in out Element_Table;
Element : Element_Identifier;
Value : Boolean);
function Is_Any
(Self : Element_Table;
Element : Element_Identifier) return Boolean;
procedure Set_Is_Any
(Self : in out Element_Table;
Element : Element_Identifier;
Value : Boolean);
function Has_Children
(Self : Element_Table;
Element : Element_Identifier) return Boolean;
-- XXX This subprogram is used to check syntax of the mixed content
-- declaration temporary. It probably should be removed after
-- implementation of DTD validation.
procedure Set_Has_Children
(Self : in out Element_Table;
Element : Element_Identifier;
Value : Boolean);
-- XXX This subprogram is used to check syntax of the mixed content
-- declaration temporary. It probably should be removed after
-- implementation of DTD validation.
procedure Reset (Self : in out Element_Table);
-- Resets internal structures to initial state.
procedure Finalize (Self : in out Element_Table);
-- Releases all ocupied resources.
function First_Element (Self : Element_Table) return Element_Identifier
with Inline => True;
-- Returns first element of the element table if any; returns No_Element
-- when table is empty.
procedure Next_Element
(Self : Element_Table;
Element : in out Element_Identifier)
with Inline => True;
-- Sets Element to the next element in the element table if present or to
-- No_Element if where is no more element.
private
type Element_Record is record
Attributes : Attribute_Identifier;
Is_Declared : Boolean;
Is_Attributes_Declared : Boolean;
Is_Empty : Boolean;
Is_Any : Boolean;
Is_Mixed_Content : Boolean;
Has_Children : Boolean;
end record;
type Element_Array is array (Element_Identifier range <>) of Element_Record;
type Element_Array_Access is access all Element_Array;
type Element_Table is limited record
Table : Element_Array_Access := new Element_Array (1 .. 16);
Last : Element_Identifier := No_Element;
end record;
pragma Inline (Attributes);
pragma Inline (Is_Attributes_Declared);
pragma Inline (Is_Declared);
pragma Inline (Set_Attributes);
pragma Inline (Set_Is_Attributes_Declared);
pragma Inline (Set_Is_Declared);
end Matreshka.Internals.XML.Element_Tables;
|
pragma License (Restricted);
--
-- Copyright (C) 2020 Jesper Quorning All Rights Reserved.
--
-- The author disclaims copyright to this source code. In place of
-- a legal notice, here is a blessing:
--
-- May you do good and not evil.
-- May you find forgiveness for yourself and forgive others.
-- May you share freely, not taking more than you give.
--
with Ada.Text_IO;
with Ada.Exceptions;
with Setup;
with Command_Line;
with Database.Jobs;
with SQL_Database;
with Parser;
-- with Web_Server;
with Terminal_IO;
with Interactive;
with Navigate;
with Files;
procedure iDoNu_Program
is
Config : Setup.Configuration;
begin
Terminal_IO.Put_Banner;
declare
List : Files.Collection_List;
begin
Files.Append_Collections (List, ".");
Files.Append_Collections (List, "..");
Files.Append_Collections (List, "/Users/jquorning/");
Files.Append_Collections (List, "/Users/jquorning/var/");
end;
Command_Line.Parse (Config);
Interactive.Initialize;
SQL_Database.Open;
-- Web_Server.Startup;
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line ("List:");
Navigate.Build_Path (Database.Jobs.Get_Current_Job);
Terminal_IO.Put_Path;
Navigate.Refresh_List;
Terminal_IO.Put_Jobs;
loop
Parser.Parse_Input (Interactive.Get_Line);
exit when Parser.Exit_Program;
end loop;
-- Web_Server.Shutdown;
Interactive.Finalize;
Command_Line.Set_Exit_Status (Command_Line.Success);
exception
when Command_Line.Terminate_Program =>
null;
when Occurrence : others =>
declare
use Ada.Exceptions;
Message : String renames Exception_Message (Occurrence);
begin
if Message = "" then
raise;
else
Ada.Text_IO.Put_Line (Ada.Text_IO.Standard_Error, Message);
end if;
end;
end iDoNu_Program;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . I N T E R R U P T S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1991-2017, Florida State University --
-- Copyright (C) 1995-2020, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This version is for systems that do not support interrupts (or signals)
package body System.Interrupts is
pragma Warnings (Off); -- kill warnings on unreferenced formals
use System.Tasking;
-----------------------
-- Local Subprograms --
-----------------------
procedure Unimplemented;
-- This procedure raises a Program_Error with an appropriate message
-- indicating that an unimplemented feature has been used.
--------------------
-- Attach_Handler --
--------------------
procedure Attach_Handler
(New_Handler : Parameterless_Handler;
Interrupt : Interrupt_ID;
Static : Boolean := False)
is
begin
Unimplemented;
end Attach_Handler;
-----------------------------
-- Bind_Interrupt_To_Entry --
-----------------------------
procedure Bind_Interrupt_To_Entry
(T : Task_Id;
E : Task_Entry_Index;
Int_Ref : System.Address)
is
begin
Unimplemented;
end Bind_Interrupt_To_Entry;
---------------------
-- Block_Interrupt --
---------------------
procedure Block_Interrupt (Interrupt : Interrupt_ID) is
begin
Unimplemented;
end Block_Interrupt;
---------------------
-- Current_Handler --
---------------------
function Current_Handler
(Interrupt : Interrupt_ID) return Parameterless_Handler
is
begin
Unimplemented;
return null;
end Current_Handler;
--------------------
-- Detach_Handler --
--------------------
procedure Detach_Handler
(Interrupt : Interrupt_ID;
Static : Boolean := False)
is
begin
Unimplemented;
end Detach_Handler;
------------------------------
-- Detach_Interrupt_Entries --
------------------------------
procedure Detach_Interrupt_Entries (T : Task_Id) is
begin
Unimplemented;
end Detach_Interrupt_Entries;
----------------------
-- Exchange_Handler --
----------------------
procedure Exchange_Handler
(Old_Handler : out Parameterless_Handler;
New_Handler : Parameterless_Handler;
Interrupt : Interrupt_ID;
Static : Boolean := False)
is
begin
Old_Handler := null;
Unimplemented;
end Exchange_Handler;
--------------
-- Finalize --
--------------
procedure Finalize (Object : in out Static_Interrupt_Protection) is
begin
Unimplemented;
end Finalize;
-------------------------------------
-- Has_Interrupt_Or_Attach_Handler --
-------------------------------------
function Has_Interrupt_Or_Attach_Handler
(Object : access Dynamic_Interrupt_Protection)
return Boolean
is
pragma Warnings (Off, Object);
begin
Unimplemented;
return True;
end Has_Interrupt_Or_Attach_Handler;
function Has_Interrupt_Or_Attach_Handler
(Object : access Static_Interrupt_Protection)
return Boolean
is
pragma Warnings (Off, Object);
begin
Unimplemented;
return True;
end Has_Interrupt_Or_Attach_Handler;
----------------------
-- Ignore_Interrupt --
----------------------
procedure Ignore_Interrupt (Interrupt : Interrupt_ID) is
begin
Unimplemented;
end Ignore_Interrupt;
----------------------
-- Install_Handlers --
----------------------
procedure Install_Handlers
(Object : access Static_Interrupt_Protection;
New_Handlers : New_Handler_Array)
is
begin
Unimplemented;
end Install_Handlers;
---------------------------------
-- Install_Restricted_Handlers --
---------------------------------
procedure Install_Restricted_Handlers
(Prio : Any_Priority;
Handlers : New_Handler_Array)
is
begin
Unimplemented;
end Install_Restricted_Handlers;
----------------
-- Is_Blocked --
----------------
function Is_Blocked (Interrupt : Interrupt_ID) return Boolean is
begin
Unimplemented;
return True;
end Is_Blocked;
-----------------------
-- Is_Entry_Attached --
-----------------------
function Is_Entry_Attached (Interrupt : Interrupt_ID) return Boolean is
begin
Unimplemented;
return True;
end Is_Entry_Attached;
-------------------------
-- Is_Handler_Attached --
-------------------------
function Is_Handler_Attached (Interrupt : Interrupt_ID) return Boolean is
begin
Unimplemented;
return True;
end Is_Handler_Attached;
----------------
-- Is_Ignored --
----------------
function Is_Ignored (Interrupt : Interrupt_ID) return Boolean is
begin
Unimplemented;
return True;
end Is_Ignored;
-----------------
-- Is_Reserved --
-----------------
function Is_Reserved (Interrupt : Interrupt_ID) return Boolean is
begin
Unimplemented;
return True;
end Is_Reserved;
---------------
-- Reference --
---------------
function Reference (Interrupt : Interrupt_ID) return System.Address is
begin
Unimplemented;
return Interrupt'Address;
end Reference;
--------------------------------
-- Register_Interrupt_Handler --
--------------------------------
procedure Register_Interrupt_Handler
(Handler_Addr : System.Address)
is
begin
Unimplemented;
end Register_Interrupt_Handler;
-----------------------
-- Unblock_Interrupt --
-----------------------
procedure Unblock_Interrupt (Interrupt : Interrupt_ID) is
begin
Unimplemented;
end Unblock_Interrupt;
------------------
-- Unblocked_By --
------------------
function Unblocked_By (Interrupt : Interrupt_ID)
return System.Tasking.Task_Id is
begin
Unimplemented;
return null;
end Unblocked_By;
------------------------
-- Unignore_Interrupt --
------------------------
procedure Unignore_Interrupt (Interrupt : Interrupt_ID) is
begin
Unimplemented;
end Unignore_Interrupt;
-------------------
-- Unimplemented; --
-------------------
procedure Unimplemented is
begin
raise Program_Error with "interrupts/signals not implemented";
end Unimplemented;
end System.Interrupts;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ W I D E _ B O U N D E D --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Strings.Wide_Wide_Maps;
with Ada.Strings.Wide_Wide_Superbounded;
package Ada.Strings.Wide_Wide_Bounded is
pragma Preelaborate;
generic
Max : Positive;
-- Maximum length of a Bounded_Wide_Wide_String
package Generic_Bounded_Length is
Max_Length : constant Positive := Max;
type Bounded_Wide_Wide_String is private;
pragma Preelaborable_Initialization (Bounded_Wide_Wide_String);
Null_Bounded_Wide_Wide_String : constant Bounded_Wide_Wide_String;
subtype Length_Range is Natural range 0 .. Max_Length;
function Length (Source : Bounded_Wide_Wide_String) return Length_Range;
--------------------------------------------------------
-- Conversion, Concatenation, and Selection Functions --
--------------------------------------------------------
function To_Bounded_Wide_Wide_String
(Source : Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
function To_Wide_Wide_String
(Source : Bounded_Wide_Wide_String) return Wide_Wide_String;
procedure Set_Bounded_Wide_Wide_String
(Target : out Bounded_Wide_Wide_String;
Source : Wide_Wide_String;
Drop : Truncation := Error);
pragma Ada_05 (Set_Bounded_Wide_Wide_String);
function Append
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
function Append
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
function Append
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
function Append
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_Character;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
function Append
(Left : Wide_Wide_Character;
Right : Bounded_Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
procedure Append
(Source : in out Bounded_Wide_Wide_String;
New_Item : Bounded_Wide_Wide_String;
Drop : Truncation := Error);
procedure Append
(Source : in out Bounded_Wide_Wide_String;
New_Item : Wide_Wide_String;
Drop : Truncation := Error);
procedure Append
(Source : in out Bounded_Wide_Wide_String;
New_Item : Wide_Wide_Character;
Drop : Truncation := Error);
function "&"
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Bounded_Wide_Wide_String;
function "&"
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Bounded_Wide_Wide_String;
function "&"
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Bounded_Wide_Wide_String;
function "&"
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_Character) return Bounded_Wide_Wide_String;
function "&"
(Left : Wide_Wide_Character;
Right : Bounded_Wide_Wide_String) return Bounded_Wide_Wide_String;
function Element
(Source : Bounded_Wide_Wide_String;
Index : Positive) return Wide_Wide_Character;
procedure Replace_Element
(Source : in out Bounded_Wide_Wide_String;
Index : Positive;
By : Wide_Wide_Character);
function Slice
(Source : Bounded_Wide_Wide_String;
Low : Positive;
High : Natural) return Wide_Wide_String;
function Bounded_Slice
(Source : Bounded_Wide_Wide_String;
Low : Positive;
High : Natural) return Bounded_Wide_Wide_String;
pragma Ada_05 (Bounded_Slice);
procedure Bounded_Slice
(Source : Bounded_Wide_Wide_String;
Target : out Bounded_Wide_Wide_String;
Low : Positive;
High : Natural);
pragma Ada_05 (Bounded_Slice);
function "="
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean;
function "="
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean;
function "="
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean;
function "<"
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean;
function "<"
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean;
function "<"
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean;
function "<="
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean;
function "<="
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean;
function "<="
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean;
function ">"
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean;
function ">"
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean;
function ">"
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean;
function ">="
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean;
function ">="
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean;
function ">="
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean;
----------------------
-- Search Functions --
----------------------
function Index
(Source : Bounded_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 : Bounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Index
(Source : Bounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
function Index
(Source : Bounded_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 : Bounded_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 : Bounded_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 : Bounded_Wide_Wide_String;
Going : Direction := Forward) return Natural;
function Index_Non_Blank
(Source : Bounded_Wide_Wide_String;
From : Positive;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index_Non_Blank);
function Count
(Source : Bounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping :=
Wide_Wide_Maps.Identity)
return Natural;
function Count
(Source : Bounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Count
(Source : Bounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set) return Natural;
procedure Find_Token
(Source : Bounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
From : Positive;
Test : Membership;
First : out Positive;
Last : out Natural);
pragma Ada_2012 (Find_Token);
procedure Find_Token
(Source : Bounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural);
------------------------------------
-- String Translation Subprograms --
------------------------------------
function Translate
(Source : Bounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping)
return Bounded_Wide_Wide_String;
procedure Translate
(Source : in out Bounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping);
function Translate
(Source : Bounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Bounded_Wide_Wide_String;
procedure Translate
(Source : in out Bounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function);
---------------------------------------
-- String Transformation Subprograms --
---------------------------------------
function Replace_Slice
(Source : Bounded_Wide_Wide_String;
Low : Positive;
High : Natural;
By : Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
procedure Replace_Slice
(Source : in out Bounded_Wide_Wide_String;
Low : Positive;
High : Natural;
By : Wide_Wide_String;
Drop : Truncation := Error);
function Insert
(Source : Bounded_Wide_Wide_String;
Before : Positive;
New_Item : Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
procedure Insert
(Source : in out Bounded_Wide_Wide_String;
Before : Positive;
New_Item : Wide_Wide_String;
Drop : Truncation := Error);
function Overwrite
(Source : Bounded_Wide_Wide_String;
Position : Positive;
New_Item : Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
procedure Overwrite
(Source : in out Bounded_Wide_Wide_String;
Position : Positive;
New_Item : Wide_Wide_String;
Drop : Truncation := Error);
function Delete
(Source : Bounded_Wide_Wide_String;
From : Positive;
Through : Natural) return Bounded_Wide_Wide_String;
procedure Delete
(Source : in out Bounded_Wide_Wide_String;
From : Positive;
Through : Natural);
---------------------------------
-- String Selector Subprograms --
---------------------------------
function Trim
(Source : Bounded_Wide_Wide_String;
Side : Trim_End) return Bounded_Wide_Wide_String;
procedure Trim
(Source : in out Bounded_Wide_Wide_String;
Side : Trim_End);
function Trim
(Source : Bounded_Wide_Wide_String;
Left : Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : Wide_Wide_Maps.Wide_Wide_Character_Set)
return Bounded_Wide_Wide_String;
procedure Trim
(Source : in out Bounded_Wide_Wide_String;
Left : Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : Wide_Wide_Maps.Wide_Wide_Character_Set);
function Head
(Source : Bounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
procedure Head
(Source : in out Bounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space;
Drop : Truncation := Error);
function Tail
(Source : Bounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
procedure Tail
(Source : in out Bounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space;
Drop : Truncation := Error);
------------------------------------
-- String Constructor Subprograms --
------------------------------------
function "*"
(Left : Natural;
Right : Wide_Wide_Character) return Bounded_Wide_Wide_String;
function "*"
(Left : Natural;
Right : Wide_Wide_String) return Bounded_Wide_Wide_String;
function "*"
(Left : Natural;
Right : Bounded_Wide_Wide_String) return Bounded_Wide_Wide_String;
function Replicate
(Count : Natural;
Item : Wide_Wide_Character;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
function Replicate
(Count : Natural;
Item : Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
function Replicate
(Count : Natural;
Item : Bounded_Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String;
private
-- Most of the implementation is in the separate non generic package
-- Ada.Strings.Wide_Wide_Superbounded. Type Bounded_Wide_Wide_String is
-- derived from type Wide_Wide_Superbounded.Super_String with the
-- maximum length constraint. In almost all cases, the routines in
-- Wide_Wide_Superbounded can be called with no requirement to pass the
-- maximum length explicitly, since there is at least one
-- Bounded_Wide_Wide_String argument from which the maximum length can
-- be obtained. For all such routines, the implementation in this
-- private part is simply renaming of the corresponding routine in the
-- super bouded package.
-- The five exceptions are the * and Replicate routines operating on
-- character values. For these cases, we have a routine in the body
-- that calls the superbounded routine passing the maximum length
-- explicitly as an extra parameter.
type Bounded_Wide_Wide_String is
new Wide_Wide_Superbounded.Super_String (Max_Length);
-- Deriving Bounded_Wide_Wide_String from
-- Wide_Wide_Superbounded.Super_String is the real trick, it ensures
-- that the type Bounded_Wide_Wide_String declared in the generic
-- instantiation is compatible with the Super_String type declared in
-- the Wide_Wide_Superbounded package.
Null_Bounded_Wide_Wide_String : constant Bounded_Wide_Wide_String :=
(Max_Length => Max_Length,
Current_Length => 0,
Data =>
(1 .. Max_Length =>
Wide_Wide_Superbounded.Wide_Wide_NUL));
pragma Inline (To_Bounded_Wide_Wide_String);
procedure Set_Bounded_Wide_Wide_String
(Target : out Bounded_Wide_Wide_String;
Source : Wide_Wide_String;
Drop : Truncation := Error)
renames Set_Super_String;
function Length
(Source : Bounded_Wide_Wide_String) return Length_Range
renames Super_Length;
function To_Wide_Wide_String
(Source : Bounded_Wide_Wide_String) return Wide_Wide_String
renames Super_To_String;
function Append
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Append;
function Append
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Append;
function Append
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Append;
function Append
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_Character;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Append;
function Append
(Left : Wide_Wide_Character;
Right : Bounded_Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Append;
procedure Append
(Source : in out Bounded_Wide_Wide_String;
New_Item : Bounded_Wide_Wide_String;
Drop : Truncation := Error)
renames Super_Append;
procedure Append
(Source : in out Bounded_Wide_Wide_String;
New_Item : Wide_Wide_String;
Drop : Truncation := Error)
renames Super_Append;
procedure Append
(Source : in out Bounded_Wide_Wide_String;
New_Item : Wide_Wide_Character;
Drop : Truncation := Error)
renames Super_Append;
function "&"
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Bounded_Wide_Wide_String
renames Concat;
function "&"
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Bounded_Wide_Wide_String
renames Concat;
function "&"
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Bounded_Wide_Wide_String
renames Concat;
function "&"
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_Character) return Bounded_Wide_Wide_String
renames Concat;
function "&"
(Left : Wide_Wide_Character;
Right : Bounded_Wide_Wide_String) return Bounded_Wide_Wide_String
renames Concat;
function Element
(Source : Bounded_Wide_Wide_String;
Index : Positive) return Wide_Wide_Character
renames Super_Element;
procedure Replace_Element
(Source : in out Bounded_Wide_Wide_String;
Index : Positive;
By : Wide_Wide_Character)
renames Super_Replace_Element;
function Slice
(Source : Bounded_Wide_Wide_String;
Low : Positive;
High : Natural) return Wide_Wide_String
renames Super_Slice;
function Bounded_Slice
(Source : Bounded_Wide_Wide_String;
Low : Positive;
High : Natural) return Bounded_Wide_Wide_String
renames Super_Slice;
procedure Bounded_Slice
(Source : Bounded_Wide_Wide_String;
Target : out Bounded_Wide_Wide_String;
Low : Positive;
High : Natural)
renames Super_Slice;
overriding function "="
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean
renames Equal;
function "="
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean
renames Equal;
function "="
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean
renames Equal;
function "<"
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean
renames Less;
function "<"
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean
renames Less;
function "<"
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean
renames Less;
function "<="
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean
renames Less_Or_Equal;
function "<="
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean
renames Less_Or_Equal;
function "<="
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean
renames Less_Or_Equal;
function ">"
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean
renames Greater;
function ">"
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean
renames Greater;
function ">"
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean
renames Greater;
function ">="
(Left : Bounded_Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean
renames Greater_Or_Equal;
function ">="
(Left : Bounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean
renames Greater_Or_Equal;
function ">="
(Left : Wide_Wide_String;
Right : Bounded_Wide_Wide_String) return Boolean
renames Greater_Or_Equal;
function Index
(Source : Bounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping :=
Wide_Wide_Maps.Identity)
return Natural
renames Super_Index;
function Index
(Source : Bounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural
renames Super_Index;
function Index
(Source : Bounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
renames Super_Index;
function Index
(Source : Bounded_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
renames Super_Index;
function Index
(Source : Bounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural
renames Super_Index;
function Index
(Source : Bounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
renames Super_Index;
function Index_Non_Blank
(Source : Bounded_Wide_Wide_String;
Going : Direction := Forward) return Natural
renames Super_Index_Non_Blank;
function Index_Non_Blank
(Source : Bounded_Wide_Wide_String;
From : Positive;
Going : Direction := Forward) return Natural
renames Super_Index_Non_Blank;
function Count
(Source : Bounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping :=
Wide_Wide_Maps.Identity)
return Natural
renames Super_Count;
function Count
(Source : Bounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural
renames Super_Count;
function Count
(Source : Bounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set) return Natural
renames Super_Count;
procedure Find_Token
(Source : Bounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
From : Positive;
Test : Membership;
First : out Positive;
Last : out Natural)
renames Super_Find_Token;
procedure Find_Token
(Source : Bounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural)
renames Super_Find_Token;
function Translate
(Source : Bounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping)
return Bounded_Wide_Wide_String
renames Super_Translate;
procedure Translate
(Source : in out Bounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping)
renames Super_Translate;
function Translate
(Source : Bounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Bounded_Wide_Wide_String
renames Super_Translate;
procedure Translate
(Source : in out Bounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
renames Super_Translate;
function Replace_Slice
(Source : Bounded_Wide_Wide_String;
Low : Positive;
High : Natural;
By : Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Replace_Slice;
procedure Replace_Slice
(Source : in out Bounded_Wide_Wide_String;
Low : Positive;
High : Natural;
By : Wide_Wide_String;
Drop : Truncation := Error)
renames Super_Replace_Slice;
function Insert
(Source : Bounded_Wide_Wide_String;
Before : Positive;
New_Item : Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Insert;
procedure Insert
(Source : in out Bounded_Wide_Wide_String;
Before : Positive;
New_Item : Wide_Wide_String;
Drop : Truncation := Error)
renames Super_Insert;
function Overwrite
(Source : Bounded_Wide_Wide_String;
Position : Positive;
New_Item : Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Overwrite;
procedure Overwrite
(Source : in out Bounded_Wide_Wide_String;
Position : Positive;
New_Item : Wide_Wide_String;
Drop : Truncation := Error)
renames Super_Overwrite;
function Delete
(Source : Bounded_Wide_Wide_String;
From : Positive;
Through : Natural) return Bounded_Wide_Wide_String
renames Super_Delete;
procedure Delete
(Source : in out Bounded_Wide_Wide_String;
From : Positive;
Through : Natural)
renames Super_Delete;
function Trim
(Source : Bounded_Wide_Wide_String;
Side : Trim_End) return Bounded_Wide_Wide_String
renames Super_Trim;
procedure Trim
(Source : in out Bounded_Wide_Wide_String;
Side : Trim_End)
renames Super_Trim;
function Trim
(Source : Bounded_Wide_Wide_String;
Left : Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : Wide_Wide_Maps.Wide_Wide_Character_Set)
return Bounded_Wide_Wide_String
renames Super_Trim;
procedure Trim
(Source : in out Bounded_Wide_Wide_String;
Left : Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : Wide_Wide_Maps.Wide_Wide_Character_Set)
renames Super_Trim;
function Head
(Source : Bounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Head;
procedure Head
(Source : in out Bounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space;
Drop : Truncation := Error)
renames Super_Head;
function Tail
(Source : Bounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Tail;
procedure Tail
(Source : in out Bounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space;
Drop : Truncation := Error)
renames Super_Tail;
function "*"
(Left : Natural;
Right : Bounded_Wide_Wide_String) return Bounded_Wide_Wide_String
renames Times;
function Replicate
(Count : Natural;
Item : Bounded_Wide_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_Wide_String
renames Super_Replicate;
end Generic_Bounded_Length;
end Ada.Strings.Wide_Wide_Bounded;
|
--------------------------------------------------------------------------------------------------------------------
-- 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
--
-- Ada 2012 bindings to the SDL 2.x.y library.
--------------------------------------------------------------------------------------------------------------------
with Interfaces.C;
package SDL is
package C renames Interfaces.C;
use type C.int;
type Init_Flags is mod 2 ** 32 with
Convention => C;
Null_Init_Flags : constant Init_Flags := 16#0000_0000#;
Enable_Timer : constant Init_Flags := 16#0000_0001#;
Enable_Audio : constant Init_Flags := 16#0000_0010#;
Enable_Screen : constant Init_Flags := 16#0000_0020#;
Enable_Joystick : constant Init_Flags := 16#0000_0200#;
Enable_Haptic : constant Init_Flags := 16#0000_1000#;
Enable_Game_Controller : constant Init_Flags := 16#0000_2000#;
Enable_Events : constant Init_Flags := 16#0000_4000#;
Enable_No_Parachute : constant Init_Flags := 16#0010_0000#;
Enable_Everything : constant Init_Flags :=
Enable_Timer or Enable_Audio or Enable_Screen or Enable_Joystick or Enable_Haptic or
Enable_Game_Controller or Enable_Events or Enable_No_Parachute;
-- Coordinates are for positioning things.
subtype Coordinate is C.int;
subtype Natural_Coordinate is Coordinate range 0 .. Coordinate'Last;
subtype Positive_Coordinate is Coordinate range 1 .. Coordinate'Last;
Centre_Coordinate : constant Coordinate := 0;
type Coordinates is
record
X : SDL.Coordinate;
Y : SDL.Coordinate;
end record with
Convention => C;
Zero_Coordinate : constant Coordinates := (others => 0);
subtype Natural_Coordinates is Coordinates with
Dynamic_Predicate =>
Natural_Coordinates.X >= Natural_Coordinate'First and Natural_Coordinates.Y >= Natural_Coordinate'First;
subtype Positive_Coordinates is Coordinates with
Dynamic_Predicate =>
Positive_Coordinates.X >= Positive_Coordinate'First and Positive_Coordinates.Y >= Positive_Coordinate'First;
-- Dimensions are for sizing things.
subtype Dimension is C.int;
subtype Natural_Dimension is Dimension range 0 .. Dimension'Last;
subtype Positive_Dimension is Dimension range 1 .. Dimension'Last;
type Sizes is
record
Width : Dimension;
Height : Dimension;
end record with
Convention => C;
Zero_Size : constant Sizes := (others => Natural_Dimension'First);
subtype Natural_Sizes is Sizes with
Dynamic_Predicate => Natural_Sizes.Width >= 0 and Natural_Sizes.Height >= 0;
subtype Positive_Sizes is Sizes with
Dynamic_Predicate => Positive_Sizes.Width >= 1 and Positive_Sizes.Height >= 1;
function "*" (Left : in Sizes; Scale : in Positive_Dimension) return Sizes is
(Sizes'(Width => Left.Width * Scale, Height => Left.Height * Scale));
function "/" (Left : in Sizes; Scale : in Positive_Dimension) return Sizes is
(Sizes'(Width => Left.Width / Scale, Height => Left.Height / Scale));
function Initialise (Flags : in Init_Flags := Enable_Everything) return Boolean;
procedure Finalise with
Import => True,
Convention => C,
External_Name => "SDL_Quit";
function Initialise_Sub_System (Flags : in Init_Flags) return Boolean;
procedure Finalise_Sub_System
(Flags : in Init_Flags) with
Import => True,
Convention => C,
External_Name => "SDL_QuitSubSystem";
-- Get which sub-systems were initialised.
function Was_Initialised return Init_Flags;
-- Check whether a set of sub-systems were initialised.
function Was_Initialised (Flags : in Init_Flags) return Boolean;
private
Success : constant Interfaces.C.int := 0;
type SDL_Bool is (SDL_False, SDL_True) with
Convention => C;
-- The next value is used in mapping the Ada types onto the C types, it is the word size used for all data
-- in SDL, i.e. all data is 4 byte aligned so it works with 32-bit architectures.
Word : constant := 4;
-- These constants are internal to the events system.
SDL_Query : constant C.int := -1;
SDL_Ignore : constant C.int := 0;
SDL_Disable : constant C.int := 0;
SDL_Enable : constant C.int := 1;
end SDL;
|
------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A S I S . D A T A _ D E C O M P O S I T I O N . S E T _ G E T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2009, Free Software Foundation, Inc. --
-- --
-- ASIS-for-GNAT is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 2, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be use- --
-- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- --
-- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General --
-- Public License for more details. You should have received a copy of the --
-- GNU General Public License distributed with ASIS-for-GNAT; see file --
-- COPYING. If not, write to the Free Software Foundation, 51 Franklin --
-- Street, Fifth Floor, Boston, MA 02110-1301, USA. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the --
-- Software Engineering Laboratory of the Swiss Federal Institute of --
-- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the --
-- Scientific Research Computer Center of Moscow State University (SRCC --
-- MSU), Russia, with funding partially provided by grants from the Swiss --
-- National Science Foundation and the Swiss Academy of Engineering --
-- Sciences. ASIS-for-GNAT is now maintained by AdaCore --
-- (http://www.adacore.com). --
-- --
------------------------------------------------------------------------------
with System; use System;
with Asis.Declarations; use Asis.Declarations;
with Asis.Definitions; use Asis.Definitions;
with Asis.Elements; use Asis.Elements;
with Asis.Extensions; use Asis.Extensions;
with Asis.Iterator; use Asis.Iterator;
with Asis.Set_Get; use Asis.Set_Get;
with Asis.Data_Decomposition.Aux; use Asis.Data_Decomposition.Aux;
with A4G.Contt; use A4G.Contt;
with Atree; use Atree;
with Sinfo; use Sinfo;
with Einfo; use Einfo;
with Nlists; use Nlists;
with Uintp; use Uintp;
package body Asis.Data_Decomposition.Set_Get is
-----------------------
-- Local subprograms --
-----------------------
procedure Set_Derived_Type_Components (E : Asis.Element);
-- Provided that E is a derived type definition, this procedure sets in
-- Asis_Element_Table the defining identifiers of the components of the
-- corresponding type. (For inherited components it sets the corresponding
-- implicit names)
--------------------
-- Component_Name --
--------------------
function Component_Name (Comp : RC) return Asis.Defining_Name is
begin
return Comp.Component_Name;
end Component_Name;
---------------
-- Dimension --
---------------
function Dimension (Comp : AC) return ASIS_Natural
is
begin
return Comp.Dimension;
end Dimension;
---------------------------
-- Get_Array_Type_Entity --
---------------------------
function Get_Array_Type_Entity (Comp : AC) return Entity_Id is
Result : Entity_Id;
pragma Warnings (Off, Result);
begin
-- ???!!! This is a trick needed to reset the right tree!
-- ???!!! Should be replaced by a proper tree handling for
-- ???!!! array components
Result := Node (Comp.Parent_Array_Type);
Result := Comp.Array_Type_Entity;
return Result;
end Get_Array_Type_Entity;
---------------------
-- Get_Comp_Entity --
---------------------
function Get_Comp_Entity (Comp : RC) return Entity_Id is
begin
return R_Node (Component_Name (Comp));
end Get_Comp_Entity;
-----------------------
-- Get_Record_Entity --
-----------------------
function Get_Record_Entity (Comp : RC) return Entity_Id is
Result : Entity_Id;
begin
Result := R_Node (Parent_Record_Type (Comp));
while Nkind (Result) /= N_Full_Type_Declaration loop
Result := Parent (Result);
end loop;
Result := Defining_Identifier (Result);
return Result;
end Get_Record_Entity;
---------------------
-- Get_Type_Entity --
---------------------
function Get_Type_Entity (Comp : RC) return Node_Id is
Result : Node_Id;
begin
Result := Etype (R_Node (Component_Name (Comp)));
if Ekind (Result) = E_Private_Type then
Result := Full_View (Result);
end if;
return Result;
end Get_Type_Entity;
-------------------
-- Is_Array_Comp --
-------------------
function Is_Array_Comp (Comp : AC) return Boolean is
begin
return Comp.Is_Array_Comp;
end Is_Array_Comp;
function Is_Array_Comp (Comp : RC) return Boolean is
begin
return Comp.Is_Array_Comp;
end Is_Array_Comp;
--------------------
-- Is_Record_Comp --
--------------------
function Is_Record_Comp (Comp : AC) return Boolean is
begin
return Comp.Is_Record_Comp;
end Is_Record_Comp;
function Is_Record_Comp (Comp : RC) return Boolean is
begin
return Comp.Is_Record_Comp;
end Is_Record_Comp;
-----------------------
-- Parent_Array_Type --
-----------------------
function Parent_Array_Type (Comp : AC) return Asis.Declaration is
begin
return Comp.Parent_Array_Type;
end Parent_Array_Type;
---------------------
-- Parent_Discrims --
---------------------
function Parent_Discrims (Comp : AC) return Discrim_List is
begin
if Comp.Parent_Discrims = null then
return Null_Discrims;
else
return Comp.Parent_Discrims.all;
end if;
end Parent_Discrims;
function Parent_Discrims (Comp : RC) return Discrim_List is
begin
if Comp.Parent_Discrims = null then
return Null_Discrims;
else
return Comp.Parent_Discrims.all;
end if;
end Parent_Discrims;
------------------------
-- Parent_Record_Type --
------------------------
function Parent_Record_Type (Comp : RC) return Asis.Declaration is
begin
return Comp.Parent_Record_Type;
end Parent_Record_Type;
-------------------------
-- Set_Array_Componnet --
-------------------------
function Set_Array_Componnet
(Array_Type_Definition : Element;
Enclosing_Record_Component : Record_Component := Nil_Record_Component;
Parent_Indication : Element := Nil_Element;
Parent_Discriminants : Discrim_List := Null_Discrims;
Parent_First_Bit_Offset : ASIS_Natural := 0;
Dynamic_Array : Boolean := False)
return Array_Component
is
Comp_Node : Node_Id;
Comp_Type_Entity : Node_Id;
Result : Array_Component := Nil_Array_Component;
Enclosing_Array_Type : Element;
Array_Entity : Entity_Id := Empty;
-- This should be a type entity defining the enclosed
-- array type. This may be an implicit type created by the compiler,
-- but the point is that in should contain real ranges for
-- this component
Dim : Asis.ASIS_Positive;
Tmp_Node : Node_Id;
Comp_Size : ASIS_Natural;
begin
Result.Parent_Array_Type := Array_Type_Definition;
Result.Parent_Component_Name :=
Component_Name (Enclosing_Record_Component);
Comp_Node := Node (Array_Type_Definition);
Comp_Type_Entity := Defining_Identifier (Parent (Comp_Node));
if Ekind (Comp_Type_Entity) in Object_Kind then
-- Array definition as a part of an object definition, here we have
-- an anonymous array type
Comp_Type_Entity := Etype (Etype (Comp_Type_Entity));
Array_Entity := Comp_Type_Entity;
end if;
Comp_Type_Entity := Component_Type (Comp_Type_Entity);
if Ekind (Comp_Type_Entity) = E_Private_Type then
Comp_Type_Entity := Full_View (Comp_Type_Entity);
end if;
Result.Is_Record_Comp := Is_Record_Type (Comp_Type_Entity);
Result.Is_Array_Comp := Is_Array_Type (Comp_Type_Entity);
if not Is_Nil (Enclosing_Record_Component) then
Array_Entity := R_Node (Enclosing_Record_Component.Component_Name);
Array_Entity := Etype (Array_Entity);
elsif not Is_Nil (Parent_Indication) then
Enclosing_Array_Type := Enclosing_Element (Parent_Indication);
Enclosing_Array_Type := Enclosing_Element (Enclosing_Array_Type);
Enclosing_Array_Type := Enclosing_Element (Enclosing_Array_Type);
Array_Entity := Defining_Identifier (R_Node (Enclosing_Array_Type));
Array_Entity := Component_Type (Array_Entity);
elsif No (Array_Entity) then
Enclosing_Array_Type := Enclosing_Element (Array_Type_Definition);
Array_Entity := Defining_Identifier (R_Node (Enclosing_Array_Type));
end if;
if Ekind (Array_Entity) = E_Private_Type then
Array_Entity := Full_View (Array_Entity);
end if;
Result.Array_Type_Entity := Array_Entity;
-- Computing dimentions and lengths:
Tmp_Node := First_Index (Array_Entity);
Dim := ASIS_Positive (List_Length (List_Containing (Tmp_Node)));
Result.Dimension := Dim;
Result.Length := (others => 0);
for I in 1 .. Dim loop
if Dynamic_Array then
Result.Length (I) := 0;
else
Result.Length (I) := Get_Length (Typ => Array_Entity,
Sub => I,
Discs => Parent_Discriminants);
end if;
end loop;
Comp_Size := ASIS_Natural (UI_To_Int (
Get_Component_Size (Array_Entity)));
Result.Position := Parent_First_Bit_Offset / Storage_Unit;
Result.First_Bit := Parent_First_Bit_Offset mod Storage_Unit;
Result.Last_Bit := Result.First_Bit + Comp_Size - 1;
Result.Size := Comp_Size;
Set_Parent_Discrims (Result, Parent_Discriminants);
Result.Parent_Context := Get_Current_Cont;
Result.Obtained := A_OS_Time;
return Result;
end Set_Array_Componnet;
------------------------------
-- Set_All_Named_Components --
------------------------------
procedure Set_All_Named_Components (E : Element) is
Discr_Part : Element;
begin
if Asis.Elements.Type_Kind (E) = A_Derived_Type_Definition then
Set_Derived_Type_Components (E);
else
Discr_Part := Discriminant_Part (Enclosing_Element (E));
Set_Named_Components (Discr_Part, New_List);
Set_Named_Components (E, Append);
end if;
end Set_All_Named_Components;
---------------------------------
-- Set_Derived_Type_Components --
---------------------------------
procedure Set_Derived_Type_Components (E : Asis.Element) is
Discr_Part : constant Asis.Element :=
Discriminant_Part (Enclosing_Element (E));
Impl_Comps : constant Asis.Element_List :=
Implicit_Inherited_Declarations (E);
begin
Set_Named_Components (Discr_Part, New_List);
for J in Impl_Comps'Range loop
Asis_Element_Table.Append (Names (Impl_Comps (J)) (1));
end loop;
end Set_Derived_Type_Components;
--------------------------
-- Set_Named_Components --
--------------------------
procedure Set_Named_Components (E : Element; List_Kind : List_Kinds) is
Control : Traverse_Control := Continue;
State : No_State := Not_Used;
procedure Set_Def_Name
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out No_State);
-- If Element is of A_Defining_Identifier kind, this procedure stores
-- it in the Asis Element Table. Used as Pre-Operation
procedure Set_Def_Name
(Element : Asis.Element;
Control : in out Traverse_Control;
State : in out No_State)
is
begin
pragma Unreferenced (Control);
pragma Unreferenced (State);
if Int_Kind (Element) /= A_Defining_Identifier then
return;
end if;
Asis_Element_Table.Append (Element);
end Set_Def_Name;
procedure Create_Name_List is new Traverse_Element (
State_Information => No_State,
Pre_Operation => Set_Def_Name,
Post_Operation => No_Op);
begin
if List_Kind = New_List then
Asis_Element_Table.Init;
end if;
if Is_Nil (E) then
return;
end if;
Create_Name_List
(Element => E,
Control => Control,
State => State);
end Set_Named_Components;
-------------------------
-- Set_Parent_Discrims --
-------------------------
procedure Set_Parent_Discrims (Comp : in out AC; Discs : Discrim_List) is
begin
if Discs = Null_Discrims then
Comp.Parent_Discrims := null;
else
Comp.Parent_Discrims := new Discrim_List'(Discs);
end if;
end Set_Parent_Discrims;
----------------------------
-- Set_Record_Type_Entity --
----------------------------
procedure Set_Record_Type_Entity (AC : Array_Component) is
begin
Record_Type_Entity := Get_Array_Type_Entity (AC);
Record_Type_Entity := Component_Type (Record_Type_Entity);
end Set_Record_Type_Entity;
procedure Set_Record_Type_Entity (RC : Record_Component) is
begin
Record_Type_Entity := R_Node (Component_Name (RC));
Record_Type_Entity := Etype (Record_Type_Entity);
end Set_Record_Type_Entity;
procedure Set_Record_Type_Entity is
begin
Record_Type_Entity :=
Defining_Identifier (Parent (R_Node (Parent_Type_Definition)));
end Set_Record_Type_Entity;
--------------------------------
-- Set_Parent_Type_Definition --
--------------------------------
procedure Set_Parent_Type_Definition (E : Element) is
begin
Parent_Type_Definition := E;
end Set_Parent_Type_Definition;
--------------------------------------
-- Set_Record_Components_From_Names --
--------------------------------------
procedure Set_Record_Components_From_Names
(Parent_First_Bit : ASIS_Natural := 0;
Data_Stream : Portable_Data := Nil_Portable_Data;
Discriminants : Boolean := False)
is
New_Comp : Asis.List_Index;
Component_Name : Element;
Comp_Entity : Node_Id;
Discs : constant Discrim_List :=
Build_Discrim_List_If_Data_Presented
(Rec => Record_Type_Entity,
Data => Data_Stream,
Ignore_Discs => Discriminants);
Comp_Type_Entity : Node_Id;
Comp_First_Bit_Offset : ASIS_Natural;
Comp_Position : ASIS_Natural;
Comp_Size : ASIS_Natural;
begin
Record_Component_Table.Init;
for I in 1 .. Asis_Element_Table.Last loop
Component_Name := Def_N_Table (I);
Comp_Entity := Node (Component_Name);
if Discs = Null_Discrims or else
Component_Present (Comp_Entity, Discs)
then
Record_Component_Table.Increment_Last;
New_Comp := Record_Component_Table.Last;
RC_Table (New_Comp).Parent_Record_Type := Parent_Type_Definition;
RC_Table (New_Comp).Component_Name := Component_Name;
Comp_Type_Entity := Etype (Comp_Entity);
if Ekind (Comp_Type_Entity) = E_Private_Type then
Comp_Type_Entity := Full_View (Comp_Type_Entity);
end if;
RC_Table (New_Comp).Is_Record_Comp :=
Is_Record_Type (Comp_Type_Entity);
RC_Table (New_Comp).Is_Array_Comp :=
Is_Array_Type (Comp_Type_Entity);
if Discs = Null_Discrims then
RC_Table (New_Comp).Parent_Discrims := null;
else
RC_Table (New_Comp).Parent_Discrims :=
new Discrim_List'(Discs);
end if;
Comp_First_Bit_Offset := Parent_First_Bit +
ASIS_Natural (UI_To_Int (
Get_Component_Bit_Offset (Comp_Entity, Discs)));
Comp_Position := Comp_First_Bit_Offset / Storage_Unit;
Comp_Size := ASIS_Natural (UI_To_Int
(Get_Esize (Comp_Entity, Discs)));
RC_Table (New_Comp).Position := Comp_Position;
RC_Table (New_Comp).First_Bit :=
Comp_First_Bit_Offset mod Storage_Unit;
RC_Table (New_Comp).Last_Bit :=
RC_Table (New_Comp).First_Bit + Comp_Size - 1;
RC_Table (New_Comp).Size := Comp_Size;
RC_Table (New_Comp).Parent_Context := Get_Current_Cont;
RC_Table (New_Comp).Obtained := A_OS_Time;
end if;
end loop;
end Set_Record_Components_From_Names;
end Asis.Data_Decomposition.Set_Get;
|
--
-- 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 ewok.tasks; use ewok.tasks;
with ewok.tasks_shared; use ewok.tasks_shared;
with ewok.devices_shared; use ewok.devices_shared;
with ewok.exported.devices; use ewok.exported.devices;
with ewok.devices;
with ewok.sanitize;
with ewok.dma;
with ewok.syscalls.dma;
with ewok.mpu;
with ewok.perm;
with ewok.sched;
with ewok.debug;
package body ewok.syscalls.init
with spark_mode => off
is
package TSK renames ewok.tasks;
procedure init_do_reg_devaccess
(caller_id : in ewok.tasks_shared.t_task_id;
params : in t_parameters;
mode : in ewok.tasks_shared.t_task_mode)
is
udev : aliased ewok.exported.devices.t_user_device
with import, address => to_address (params(1));
-- Device descriptor transmitted to userspace
descriptor : unsigned_8 range 0 .. ewok.tasks.MAX_DEVS_PER_TASK
with address => to_address (params(2));
dev_id : ewok.devices_shared.t_device_id;
ok : boolean;
begin
-- Forbidden after end of task initialization
if TSK.is_init_done (caller_id) then
goto ret_denied;
end if;
-- NOTE
-- The kernel might register some devices using this syscall
-- for user tasks. The device_t structure may be stored in
-- RAM (.data section) or in flash (.rodata section)
if TSK.is_real_user (caller_id) and then
(not ewok.sanitize.is_range_in_data_slot
(to_system_address (udev'address),
udev'size/8,
caller_id,
mode)
and
not ewok.sanitize.is_range_in_txt_slot
(to_system_address (udev'address),
udev'size/8,
caller_id))
then
pragma DEBUG (debug.log (debug.ERROR,
"init_do_reg_devaccess(): udev not in task's memory space"));
goto ret_denied;
end if;
if TSK.is_real_user (caller_id) and then
not ewok.sanitize.is_word_in_data_slot
(to_system_address (descriptor'address), caller_id, mode)
then
pragma DEBUG (debug.log (debug.ERROR,
"init_do_reg_devaccess(): descriptor not in task's memory space"));
goto ret_denied;
end if;
-- Ada based sanitization
if not udev'valid_scalars
then
pragma DEBUG (debug.log (debug.ERROR, "init_do_reg_devaccess(): invalid udev scalars"));
goto ret_inval;
end if;
if TSK.is_real_user (caller_id) and then
not ewok.devices.sanitize_user_defined_device
(udev'unchecked_access, caller_id)
then
pragma DEBUG (debug.log (debug.ERROR, "init_do_reg_devaccess(): invalid udev"));
goto ret_inval;
end if;
if TSK.tasks_list(caller_id).num_devs = TSK.MAX_DEVS_PER_TASK then
pragma DEBUG (debug.log (debug.ERROR,
"init_do_reg_devaccess(): no space left to register the device"));
goto ret_busy;
end if;
if udev.size > 0 and
udev.map_mode = DEV_MAP_AUTO and
TSK.tasks_list(caller_id).num_devs_mounted = ewok.mpu.MAX_DEVICE_REGIONS
then
pragma DEBUG (debug.log (debug.ERROR,
"init_do_reg_devaccess(): no free region left to map the device"));
goto ret_busy;
end if;
--
-- Registering the device
--
ewok.devices.register_device (caller_id, udev'unchecked_access, dev_id, ok);
if not ok then
pragma DEBUG (debug.log (debug.ERROR,
"init_do_reg_devaccess(): failed to register the device"));
goto ret_denied;
end if;
--
-- Recording registered devices in the task record
--
TSK.append_device
(caller_id, dev_id, descriptor, ok);
if not ok then
raise program_error; -- Should never happen here
end if;
-- Mount DEV_MAP_AUTO devices in memory
if udev.size > 0 and udev.map_mode = DEV_MAP_AUTO then
TSK.mount_device (caller_id, dev_id, ok);
if not ok then
raise program_error; -- Should never happen here
end if;
end if;
set_return_value (caller_id, mode, SYS_E_DONE);
ewok.tasks.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_busy>>
set_return_value (caller_id, mode, SYS_E_BUSY);
ewok.tasks.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_inval>>
set_return_value (caller_id, mode, SYS_E_INVAL);
ewok.tasks.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_denied>>
set_return_value (caller_id, mode, SYS_E_DENIED);
ewok.tasks.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
end init_do_reg_devaccess;
procedure init_do_done
(caller_id : in ewok.tasks_shared.t_task_id;
mode : in ewok.tasks_shared.t_task_mode)
is
ok : boolean;
udev : ewok.devices.t_checked_user_device_access;
begin
-- Forbidden after end of task initialization
if TSK.is_init_done (caller_id) then
goto ret_denied;
end if;
-- We enable auto mapped devices (MAP_AUTO)
for i in TSK.tasks_list(caller_id).device_id'range loop
if TSK.tasks_list(caller_id).device_id(i) /= ID_DEV_UNUSED then
udev := ewok.devices.get_user_device
(TSK.tasks_list(caller_id).device_id(i));
if udev.all.map_mode = DEV_MAP_AUTO then
-- FIXME - Create new syscalls for enabling/disabling devices?
ewok.devices.enable_device
(TSK.tasks_list(caller_id).device_id(i), ok);
if not ok then
goto ret_denied;
end if;
end if;
end if;
end loop;
#if CONFIG_KERNEL_DMA_ENABLE
for i in 1 .. TSK.tasks_list(caller_id).num_dma_id loop
ewok.dma.enable_dma_irq (TSK.tasks_list(caller_id).dma_id(i));
end loop;
#end if;
TSK.tasks_list(caller_id).init_done := true;
set_return_value (caller_id, mode, SYS_E_DONE);
ewok.tasks.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
-- Request a schedule to ensure that the task has its devices mapped
-- afterward
-- FIXME - has to be changed when device mapping will be synchronously done
ewok.sched.request_schedule;
return;
<<ret_denied>>
set_return_value (caller_id, mode, SYS_E_DENIED);
ewok.tasks.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
end init_do_done;
procedure init_do_get_taskid
(caller_id : in ewok.tasks_shared.t_task_id;
params : in t_parameters;
mode : in ewok.tasks_shared.t_task_mode)
is
target_name : TSK.t_task_name
with address => to_address (params(1));
target_id : ewok.tasks_shared.t_task_id
with address => to_address (params(2));
tmp_id : ewok.tasks_shared.t_task_id;
begin
-- Forbidden after end of task initialization
if TSK.is_init_done (caller_id) then
goto ret_denied;
end if;
-- Does &target_id is in the caller address space ?
if not ewok.sanitize.is_word_in_data_slot
(to_system_address (target_id'address), caller_id, mode)
then
goto ret_denied;
end if;
-- We retrieve the 'id' related to the target name. Before updating the
-- parameter passed by the user, we must check that the 2 tasked are
-- allowed to communicate
tmp_id := TSK.get_task_id (target_name);
if tmp_id = ID_UNUSED then
goto ret_inval;
end if;
#if CONFIG_KERNEL_DOMAIN
if TSK.get_domain (tmp_id) /= TSK.get_domain (caller_id) then
goto ret_inval;
end if;
#end if;
-- Are tasks allowed to communicate through IPCs or DMA_SHM ?
if not ewok.perm.ipc_is_granted (caller_id, tmp_id) and
not ewok.perm.dmashm_is_granted (caller_id, tmp_id)
then
goto ret_inval;
end if;
-- We may update the target_id
target_id := tmp_id;
set_return_value (caller_id, mode, SYS_E_DONE);
ewok.tasks.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_inval>>
set_return_value (caller_id, mode, SYS_E_INVAL);
ewok.tasks.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
<<ret_denied>>
set_return_value (caller_id, mode, SYS_E_DENIED);
ewok.tasks.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
end init_do_get_taskid;
procedure sys_init
(caller_id : in ewok.tasks_shared.t_task_id;
params : in out t_parameters;
mode : in ewok.tasks_shared.t_task_mode)
is
syscall : t_syscalls_init
with import, address => params(0)'address;
begin
if not syscall'valid then
set_return_value (caller_id, mode, SYS_E_INVAL);
ewok.tasks.set_state (caller_id, mode, TASK_STATE_RUNNABLE);
return;
end if;
case syscall is
when INIT_DEVACCESS => init_do_reg_devaccess
(caller_id, params, mode);
#if CONFIG_KERNEL_DMA_ENABLE
when INIT_DMA => ewok.syscalls.dma.init_do_reg_dma
(caller_id, params, mode);
when INIT_DMA_SHM => ewok.syscalls.dma.init_do_reg_dma_shm
(caller_id, params, mode);
#end if;
when INIT_GETTASKID => init_do_get_taskid (caller_id, params, mode);
when INIT_DONE => init_do_done (caller_id, mode);
end case;
end sys_init;
end ewok.syscalls.init;
|
------------------------------------------------------------------------------
-- --
-- Giza --
-- --
-- Copyright (C) 2015 Fabien Chouteau (chouteau@adacore.com) --
-- --
-- --
-- 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 Giza.Types; use Giza.Types;
package Giza.Events is
type Event is abstract tagged null record;
type Event_Ref is access constant Event'Class;
type Event_Not_Null_Ref is not null access constant Event'Class;
-- Built-in events
type Redraw_Event is new Event with null record;
type Redraw_Event_Ref is not null access constant Redraw_Event'Class;
type Position_Event is new Event with record
Pos : Point_T := (0, 0);
end record;
type Position_Event_Ref is not null access constant Position_Event'Class;
type Click_Event is new Position_Event with record
Something : Boolean;
end record;
type Click_Event_Ref is not null access all Click_Event'Class;
type Click_Event_Constant_Ref is not null access constant Click_Event'Class;
type Click_Released_Event is new Event with record
Something : Boolean;
end record;
type Click_Released_Event_Ref is not null access all
Click_Released_Event'Class;
type Timer_Event is new Event with null record;
type Timer_Event_Not_Null_Ref is not null access constant Timer_Event'Class;
function Triggered (Timer : Timer_Event) return Boolean is (True);
type Basic_Timer_Callback is access function return Boolean;
type Basic_Timer_Event is new Timer_Event with record
Callback : Basic_Timer_Callback;
end record;
overriding
function Triggered (Timer : Basic_Timer_Event) return Boolean;
end Giza.Events;
|
-----------------------------------------------------------------------
-- keystore-io-headers -- Keystore file header operations
-- Copyright (C) 2019, 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.Log.Loggers;
with Util.Encoders.HMAC.SHA256;
with Keystore.Marshallers;
-- === Header block ===
-- The first block of the file is the keystore header block which contains clear
-- information signed by an HMAC header. The header block contains the keystore
-- UUID as well as a short description of each storage data file. It also contains
-- some optional header data.
--
-- ```
-- +------------------+
-- | 41 64 61 00 | 4b = Ada
-- | 00 9A 72 57 | 4b = 10/12/1815
-- | 01 9D B1 AC | 4b = 27/11/1852
-- | 00 01 | 2b = Version 1
-- | 00 01 | 2b = File header length in blocks
-- +------------------+
-- | Keystore UUID | 16b
-- | Storage ID | 4b
-- | Block size | 4b
-- | Storage count | 4b
-- | Header Data count| 2b
-- +------------------+-----
-- | Header Data size | 2b
-- | Header Data type | 2b = 0 (NONE), 1 (GPG1) 2, (GPG2)
-- +------------------+
-- | Header Data | Nb
-- +------------------+-----
-- | ... |
-- +------------------+-----
-- | 0 |
-- +------------------+-----
-- | ... |
-- +------------------+-----
-- | Storage ID | 4b
-- | Storage type | 2b
-- | Storage status | 2b 00 = open, Ada = sealed
-- | Storage max bloc | 4b
-- | Storage HMAC | 32b = 44b
-- +------------------+----
-- | Header HMAC-256 | 32b
-- +------------------+----
-- ```
package body Keystore.IO.Headers is
use type Interfaces.Unsigned_16;
use type Interfaces.Unsigned_32;
use type Keystore.Buffers.Storage_Identifier;
-- Header magic numbers.
MAGIC_1 : constant := 16#41646100#;
MAGIC_2 : constant := 16#009A7257#;
MAGIC_3 : constant := 16#019DB1AC#;
VERSION_1 : constant := 1;
-- Header positions and length.
STORAGE_COUNT_POS : constant := 1 + 16 + 16 + 4 + 4;
HEADER_DATA_POS : constant := STORAGE_COUNT_POS + 4;
STORAGE_SLOT_LENGTH : constant := 4 + 2 + 2 + 4 + 32;
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Keystore.IO.Headers");
function Get_Storage_Offset (Index : in Natural) return Block_Index is
(Block_Index'Last - STORAGE_SLOT_LENGTH * Stream_Element_Offset (Index) - 1);
function Get_Header_Data_Size (Header : in Wallet_Header) return Buffer_Size;
procedure Seek_Header_Data (Buffer : in out Keystore.Marshallers.Marshaller;
Index : in Header_Slot_Index_Type);
-- ------------------------------
-- Build a new header with the given UUID and for the storage.
-- The header buffer is allocated and filled so that it can be written by Write_Header.
-- ------------------------------
procedure Build_Header (UUID : in UUID_Type;
Storage : in Storage_Identifier;
Header : in out Wallet_Header) is
Buffer : Keystore.Marshallers.Marshaller;
begin
Header.Buffer := Buffers.Allocate ((Storage, HEADER_BLOCK_NUM));
Buffer.Buffer := Header.Buffer;
Marshallers.Set_Header (Buffer, MAGIC_1);
Marshallers.Put_Unsigned_32 (Buffer, MAGIC_2);
Marshallers.Put_Unsigned_32 (Buffer, MAGIC_3);
Marshallers.Put_Unsigned_16 (Buffer, VERSION_1);
Marshallers.Put_Unsigned_16 (Buffer, 1);
Marshallers.Put_UUID (Buffer, UUID);
Marshallers.Put_Unsigned_32 (Buffer, Interfaces.Unsigned_32 (Storage));
Marshallers.Put_Unsigned_32 (Buffer, Buffers.Block_Size);
Marshallers.Put_Unsigned_32 (Buffer, 0);
Buffer.Buffer.Data.Value.Data (Buffer.Pos .. Buffers.Block_Type'Last) := (others => 0);
end Build_Header;
-- ------------------------------
-- Read the header block and verify its integrity.
-- ------------------------------
procedure Read_Header (Header : in out Wallet_Header) is
Buffer : Keystore.Marshallers.Marshaller;
Value : Interfaces.Unsigned_32;
Value16 : Interfaces.Unsigned_16;
Storage_Count : Interfaces.Unsigned_32;
begin
Buffer.Buffer := Header.Buffer;
-- Verify values found in header block.
Value := Marshallers.Get_Header (Buffer);
if Value /= MAGIC_1 then
Log.Warn ("Header magic 1 is invalid:{0}",
Interfaces.Unsigned_32'Image (Value));
raise Invalid_Keystore;
end if;
Value := Marshallers.Get_Unsigned_32 (Buffer);
if Value /= MAGIC_2 then
Log.Warn ("Header magic 2 is invalid:{0}",
Interfaces.Unsigned_32'Image (Value));
raise Invalid_Keystore;
end if;
Value := Marshallers.Get_Unsigned_32 (Buffer);
if Value /= MAGIC_3 then
Log.Warn ("Header magic 3 is invalid:{0}",
Interfaces.Unsigned_32'Image (Value));
raise Invalid_Keystore;
end if;
Header.Version := Natural (Marshallers.Get_Unsigned_16 (Buffer));
if Header.Version /= 1 then
Log.Warn ("Header version is not supported:{0}",
Natural'Image (Header.Version));
raise Invalid_Keystore;
end if;
Value := Interfaces.Unsigned_32 (Marshallers.Get_Unsigned_16 (Buffer));
if Value /= 1 then
Log.Warn ("Header block size bloc{0} is invalid:{0}",
Interfaces.Unsigned_32'Image (Value));
raise Invalid_Keystore;
end if;
-- Get keystore UUID
Marshallers.Get_UUID (Buffer, Header.UUID);
Header.Identifier := Storage_Identifier (Marshallers.Get_Unsigned_32 (Buffer));
if Header.Identifier /= Header.Buffer.Block.Storage then
Log.Warn ("Header storage identifier does not match:{0}",
Storage_Identifier'Image (Header.Identifier));
raise Invalid_Keystore;
end if;
Value := Marshallers.Get_Unsigned_32 (Buffer);
if Value /= Buffers.Block_Size then
Log.Warn ("Header block size is not supported:{0}",
Interfaces.Unsigned_32'Image (Value));
raise Invalid_Keystore;
end if;
Header.Block_Size := Natural (Value);
Storage_Count := Marshallers.Get_Unsigned_32 (Buffer);
Header.Storage_Count := Natural (Storage_Count);
Value16 := Marshallers.Get_Unsigned_16 (Buffer);
if Value16 > Interfaces.Unsigned_16 (Header_Slot_Count_Type'Last) then
Log.Warn ("Header data count is out of range:{0}",
Interfaces.Unsigned_16 'Image (Value16));
raise Invalid_Keystore;
end if;
Header.Data_Count := Header_Slot_Count_Type (Value16);
end Read_Header;
-- ------------------------------
-- Scan the header block for the storage and call the Process procedure for each
-- storage information found in the header block.
-- ------------------------------
procedure Scan_Storage (Header : in out Wallet_Header;
Process : not null access procedure (Storage : in Wallet_Storage)) is
Buf : constant Buffers.Buffer_Accessor := Header.Buffer.Data.Value;
Buffer : Keystore.Marshallers.Marshaller;
begin
Buffer.Buffer := Header.Buffer;
for I in 1 .. Header.Storage_Count loop
declare
S : Wallet_Storage;
Status : Interfaces.Unsigned_16;
begin
Buffer.Pos := Get_Storage_Offset (I);
S.Pos := Buffer.Pos + 1;
S.Identifier := Storage_Identifier (Marshallers.Get_Unsigned_32 (Buffer));
S.Kind := Marshallers.Get_Unsigned_16 (Buffer);
Status := Marshallers.Get_Unsigned_16 (Buffer);
S.Readonly := Status > 0;
S.Sealed := Status > 0;
S.Max_Block := Natural (Marshallers.Get_Unsigned_32 (Buffer));
S.HMAC := Buf.Data (Buffer.Pos + 1 .. Buffer.Pos + 32);
Process (S);
end;
end loop;
end Scan_Storage;
-- ------------------------------
-- Sign the header block for the storage.
-- ------------------------------
procedure Sign_Header (Header : in out Wallet_Header;
Sign : in Secret_Key) is
Buf : constant Buffers.Buffer_Accessor := Header.Buffer.Data.Value;
Context : Util.Encoders.HMAC.SHA256.Context;
begin
Util.Encoders.HMAC.SHA256.Set_Key (Context, Sign);
Util.Encoders.HMAC.SHA256.Update (Context, Buf.Data);
Util.Encoders.HMAC.SHA256.Finish (Context, Header.HMAC);
end Sign_Header;
procedure Seek_Header_Data (Buffer : in out Keystore.Marshallers.Marshaller;
Index : in Header_Slot_Index_Type) is
Size : Buffer_Size;
begin
Buffer.Pos := HEADER_DATA_POS + 2 - 1;
-- Skip entries until we reach the correct slot.
for I in 1 .. Index - 1 loop
Size := Marshallers.Get_Buffer_Size (Buffer);
Marshallers.Skip (Buffer, Size + 2);
end loop;
end Seek_Header_Data;
function Get_Header_Data_Size (Header : in Wallet_Header) return Buffer_Size is
Buffer : Keystore.Marshallers.Marshaller;
Total : Buffer_Size := 0;
Size : Buffer_Size;
begin
Buffer.Buffer := Header.Buffer;
Buffer.Pos := HEADER_DATA_POS + 2 - 1;
for I in 1 .. Header.Data_Count loop
Size := Marshallers.Get_Buffer_Size (Buffer);
Marshallers.Skip (Buffer, Size + 2);
Total := Total + Size + 4;
end loop;
return Total;
end Get_Header_Data_Size;
-- ------------------------------
-- Set some header data in the keystore file.
-- ------------------------------
procedure Set_Header_Data (Header : in out Wallet_Header;
Index : in Header_Slot_Index_Type;
Kind : in Header_Slot_Type;
Data : in Ada.Streams.Stream_Element_Array) is
Buf : constant Buffers.Buffer_Accessor := Header.Buffer.Data.Value;
Buffer : Keystore.Marshallers.Marshaller;
Size : Buffer_Size;
Last : Block_Index;
Space : Stream_Element_Offset;
Start : Stream_Element_Offset;
Limit : constant Stream_Element_Offset := Get_Storage_Offset (Header.Storage_Count);
begin
if Index > Header.Data_Count + 1 then
Log.Warn ("Not enough header slots to add a header data");
raise No_Header_Slot;
end if;
Buffer.Buffer := Header.Buffer;
Seek_Header_Data (Buffer, Index);
if Index <= Header.Data_Count then
Size := Marshallers.Get_Buffer_Size (Buffer);
Space := Data'Length - Size;
Buffer.Pos := Buffer.Pos - 2;
else
Space := Data'Length;
end if;
Last := Get_Header_Data_Size (Header) + HEADER_DATA_POS;
-- Verify there is enough room.
if Last + Space + 8 >= Limit then
Log.Warn ("Not enough header space to add a header data");
raise No_Header_Slot;
end if;
-- Shift
if Index < Header.Data_Count and Space /= 0 then
Start := Buffer.Pos + 4 + Size;
Buf.Data (Start + Space .. Last + Space) := Buf.Data (Start .. Last);
end if;
-- Update the header data slot.
Marshallers.Put_Buffer_Size (Buffer, Data'Length);
Marshallers.Put_Unsigned_16 (Buffer, Interfaces.Unsigned_16 (Kind));
Buf.Data (Buffer.Pos + 1 .. Buffer.Pos + Data'Length) := Data;
-- Update the header data count.
if Index > Header.Data_Count then
Header.Data_Count := Index;
end if;
Buffer.Pos := HEADER_DATA_POS - 1;
Marshallers.Put_Unsigned_16 (Buffer, Interfaces.Unsigned_16 (Header.Data_Count));
end Set_Header_Data;
-- ------------------------------
-- Get the header data information from the keystore file.
-- ------------------------------
procedure Get_Header_Data (Header : in out Wallet_Header;
Index : in Header_Slot_Index_Type;
Kind : out Header_Slot_Type;
Data : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset) is
Buffer : Keystore.Marshallers.Marshaller;
Size : Buffer_Size;
begin
if Index > Header.Data_Count then
Kind := SLOT_EMPTY;
Last := Data'First - 1;
return;
end if;
Buffer.Buffer := Header.Buffer;
Seek_Header_Data (Buffer, Index);
-- Extract data slot and truncate if the buffer is too small.
Size := Marshallers.Get_Buffer_Size (Buffer);
Kind := Header_Slot_Type (Marshallers.Get_Unsigned_16 (Buffer));
if Size > Data'Length then
Size := Data'Length;
end if;
Marshallers.Get_Data (Buffer, Size, Data, Last);
end Get_Header_Data;
-- ------------------------------
-- Add a new storage reference in the header and return its position in the header.
-- Raises the No_Header_Slot if there is no room in the header.
-- ------------------------------
procedure Add_Storage (Header : in out Wallet_Header;
Identifier : in Storage_Identifier;
Max_Block : in Positive;
Pos : out Block_Index) is
Buffer : Keystore.Marshallers.Marshaller;
Last : constant Block_Index := Get_Header_Data_Size (Header) + HEADER_DATA_POS;
begin
Pos := Get_Storage_Offset (Header.Storage_Count + 1);
if Pos <= Last + 4 then
Log.Warn ("Not enough header space to add a new storage file");
raise No_Header_Slot;
end if;
Buffer.Pos := Pos;
Header.Storage_Count := Header.Storage_Count + 1;
Buffer.Buffer := Header.Buffer;
Marshallers.Put_Unsigned_32 (Buffer, Interfaces.Unsigned_32 (Identifier));
Marshallers.Put_Unsigned_16 (Buffer, 0);
Marshallers.Put_Unsigned_16 (Buffer, 0);
Marshallers.Put_Unsigned_32 (Buffer, Interfaces.Unsigned_32 (Max_Block));
Buffer.Pos := STORAGE_COUNT_POS - 1;
Marshallers.Put_Unsigned_32 (Buffer, Interfaces.Unsigned_32 (Header.Storage_Count));
end Add_Storage;
end Keystore.IO.Headers;
|
-----------------------------------------------------------------------
-- EL.Methods.Proc_in -- Procedure Binding with 1 in argument
-- Copyright (C) 2010, 2011, 2012, 2013 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with EL.Expressions;
with EL.Contexts;
with Util.Beans.Methods;
with Util.Beans.Basic;
generic
type Param1_Type (<>) is limited private;
package EL.Methods.Proc_In is
use Util.Beans.Methods;
-- Returns True if the method is a valid method which accepts the arguments
-- defined by the package instantiation.
function Is_Valid (Method : in EL.Expressions.Method_Info) return Boolean;
-- Execute the method describe by the method expression
-- and with the given context. The method signature is:
--
-- procedure F (Obj : in out <Bean>;
-- Param : in out Param1_Type);
--
-- where <Bean> inherits from <b>Readonly_Bean</b>
-- (See <b>Bind</b> package)
--
-- Raises <b>Invalid_Method</b> if the method referenced by
-- the method expression does not exist or does not match
-- the signature.
procedure Execute (Method : in EL.Expressions.Method_Expression'Class;
Param : in Param1_Type;
Context : in EL.Contexts.ELContext'Class);
-- Execute the method describe by the method binding object.
-- The method signature is:
--
-- procedure F (Obj : in out <Bean>;
-- Param : in out Param1_Type);
--
-- where <Bean> inherits from <b>Readonly_Bean</b>
-- (See <b>Bind</b> package)
--
-- Raises <b>Invalid_Method</b> if the method referenced by
-- the method expression does not exist or does not match
-- the signature.
procedure Execute (Method : in EL.Expressions.Method_Info;
Param : in Param1_Type);
-- Function access to the proxy.
type Proxy_Access is
access procedure (O : access Util.Beans.Basic.Readonly_Bean'Class;
P : in Param1_Type);
-- The binding record which links the method name
-- to the proxy function.
type Binding is new Method_Binding with record
Method : Proxy_Access;
end record;
type Binding_Access is access constant Binding;
-- Proxy for the binding.
-- The proxy declares the binding definition that links
-- the name to the function and it implements the necessary
-- object conversion to translate the <b>Readonly_Bean</b>
-- object to the target object type.
generic
-- Name of the method (as exposed in the EL expression)
Name : String;
-- The bean type
type Bean is abstract new Util.Beans.Basic.Readonly_Bean with private;
-- The bean method to invoke
with procedure Method (O : in out Bean;
P1 : in Param1_Type);
package Bind is
-- Method that <b>Execute</b> will invoke.
procedure Method_Access (O : access Util.Beans.Basic.Readonly_Bean'Class;
P1 : in Param1_Type);
F_NAME : aliased constant String := Name;
-- The proxy binding that can be exposed through
-- the <b>Method_Bean</b> interface.
Proxy : aliased constant Binding
:= Binding '(Name => F_NAME'Access,
Method => Method_Access'Access);
end Bind;
end EL.Methods.Proc_In;
|
with Ada.Text_IO;
use Ada.Text_IO;
procedure Two_Tasks is
T1 : constant := 1.1;
T2 : constant := 2.67;
task Thread1;
task Thread2;
task body Thread1 is begin
loop Put_Line("Thread 1 calling!");
delay T1;
end loop;
end Thread1;
task body Thread2 is begin
loop Put_Line("Thread 2 calling!");
delay T2;
end loop;
end Thread2;
begin
null;
end Two_Tasks;
|
with
gel.Joint,
openGL.Model,
openGL.Visual,
openGL.Program,
physics.Model,
physics.Object,
physics.Shape,
physics.Space,
lace.Subject_and_deferred_Observer,
lace.Response,
ada.Containers.Vectors;
limited
with
gel.World;
package gel.Sprite
--
-- Combines a graphics 'visual' and a physics 'solid'.
--
is
use Math;
type Item is limited new lace.Subject_and_deferred_Observer.item with private;
type View is access all Item'Class;
type Items is array (math.Index range <>) of aliased Item;
type Views is array (math.Index range <>) of View;
null_Sprites : constant Sprite.views;
type physics_Space_view is access all physics.Space.item'Class;
type World_view is access all gel.World.item'Class;
--------------
--- Containers
--
type Grid is array (math.Index range <>,
math.Index range <>) of Sprite.view;
type Grid_view is access all Grid;
package Vectors is new ada.Containers.Vectors (Positive, Sprite.view);
----------
--- Forge
--
procedure define (Self : access Item; World : in World_view;
at_Site : in Vector_3;
graphics_Model : access openGL. Model.item'Class;
physics_Model : access physics.Model.item'Class;
owns_Graphics : in Boolean;
owns_Physics : in Boolean;
is_Kinematic : in Boolean := False);
procedure destroy (Self : access Item; and_Children : in Boolean);
function is_Destroyed (Self : in Item) return Boolean;
procedure free (Self : in out View);
package Forge
is
function to_Sprite (Name : in String;
World : in World_view;
at_Site : in Vector_3;
graphics_Model : access openGL. Model.item'Class;
physics_Model : access physics.Model.item'Class;
owns_Graphics : in Boolean;
owns_Physics : in Boolean;
is_Kinematic : in Boolean := False) return Item;
function new_Sprite (Name : in String;
World : in World_view;
at_Site : in Vector_3;
graphics_Model : access openGL. Model.item'Class;
physics_Model : access physics.Model.item'Class;
owns_Graphics : in Boolean := True;
owns_Physics : in Boolean := True;
is_Kinematic : in Boolean := False) return View;
end Forge;
---------------
--- Attributes
--
function World (Self : in Item'Class) return access gel.World.item'Class;
function Id (Self : in Item'Class) return gel.sprite_Id;
procedure Id_is (Self : in out Item'Class; Now : in gel.sprite_Id);
function Visual (Self : access Item'Class) return openGL.Visual.view;
function graphics_Model (Self : in Item'Class) return openGL.Model.view;
procedure Model_is (Self : in out Item'Class; Now : in openGL.Model.view);
function owns_Graphics (Self : in Item) return Boolean;
function physics_Model (Self : in Item'Class) return access physics.Model.item'class;
procedure physics_Model_is (Self : in out Item'Class; Now : in physics.Model.view);
function Scale (Self : in Item'Class) return Vector_3;
procedure Scale_is (Self : in out Item'Class; Now : in Vector_3);
function Mass (Self : in Item'Class) return Real;
function is_Static (Self : in Item'Class) return Boolean;
function is_Kinematic (Self : in Item'Class) return Boolean;
function Depth_in_camera_space (Self : in Item'Class) return Real;
procedure mvp_Matrix_is (Self : in out Item'Class; Now : in Matrix_4x4);
function mvp_Matrix (Self : in Item'Class) return Matrix_4x4;
procedure is_Visible (Self : in out Item'Class; Now : in Boolean);
function is_Visible (Self : in Item'Class) return Boolean;
procedure key_Response_is (Self : in out Item'Class; Now : in lace.Response.view);
function key_Response (Self : in Item'Class) return lace.Response.view;
subtype physics_Object_view is physics.Object.view;
subtype physics_Shape_view is physics.Shape .view;
function Solid (Self : in Item'Class) return physics_Object_view;
procedure Solid_is (Self : out Item'Class; Now : in physics_Object_view);
function Shape (Self : in Item'Class) return physics_Shape_view;
function to_GEL (the_Solid : in physics_Object_view) return gel.Sprite.view;
-------------
--- Dynamics
--
--- Bounds
--
function Bounds (Self : in Item) return Geometry_3d.bounding_Box;
--- Site
--
function Site (Self : in Item) return Vector_3;
procedure Site_is (Self : in out Item; Now : in Vector_3);
procedure move (Self : in out Item; to_Site : in Vector_3);
--
-- Moves the sprite to a new site and recursively move children such that
-- relative positions are maintained.
--- Spin
--
function Spin (Self : in Item) return Matrix_3x3;
procedure Spin_is (Self : in out Item; Now : in Matrix_3x3);
function xy_Spin (Self : in Item) return Radians;
procedure xy_Spin_is (Self : in out Item; Now : in Radians);
procedure rotate (Self : in out Item; to_Spin : in Matrix_3x3);
--
-- Rotates the sprite to a new spin and recursively moves and rotates children such that
-- relative positions/orientations are maintained.
--- Transform
--
function Transform (Self : in Item) return Matrix_4x4;
procedure Transform_is (Self : in out Item; Now : in Matrix_4x4);
--- Speed
--
function Speed (Self : in Item) return Vector_3;
procedure Speed_is (Self : in out Item; Now : in Vector_3);
procedure set_Speed (Self : in out Item; to_Speed : in Vector_3);
--
-- Set Self and all children to given value.
--- Gyre
--
function Gyre (Self : in Item) return Vector_3;
procedure Gyre_is (Self : in out Item; Now : in Vector_3);
procedure set_Gyre (Self : in out Item; to_Gyre : in Vector_3);
--
-- Set Self and all children to given value.
--- Forces
--
procedure apply_Torque (Self : in out Item; Torque : in Vector_3);
procedure apply_Torque_impulse (Self : in out Item; Torque : in Vector_3);
procedure apply_Force (Self : in out Item; Force : in Vector_3);
--- Mirrored Dynamics
--
function desired_Site (Self : in Item) return Vector_3;
procedure desired_Site_is (Self : in out Item; Now : in Vector_3);
procedure desired_Spin_is (Self : in out Item; Now : in Quaternion);
procedure interpolate_Motion (Self : in out Item'Class);
--- Hierachy
--
type DoF_Limits is
record
Low : math.Real;
High : math.Real;
end record;
function parent_Joint (Self : in Item'Class) return gel.Joint.view;
function child_Joints (Self : in Item'Class) return gel.Joint.views;
function top_Parent (Self : access Item'Class) return gel.Sprite.view;
function Parent (Self : in Item) return gel.Sprite.view;
function tree_Depth (Self : in Item) return Natural;
procedure detach (Self : in out Item; the_Child : gel.Sprite.view);
no_such_Child : exception;
type Action is access procedure (the_Sprite : in out Item'Class);
procedure apply (Self : in out Item; do_Action : Action);
--
-- Applies an action to a sprite and its children recursively.
--- Hinge
--
procedure attach_via_Hinge (Self : access Item'Class; the_Child : in Sprite.view;
pivot_Axis : in Vector_3;
Anchor : in Vector_3;
child_Anchor : in Vector_3;
low_Limit : in Real;
high_Limit : in Real;
collide_Connected : in Boolean;
new_joint : out gel.Joint.view);
procedure attach_via_Hinge (Self : access Item'Class; the_Child : in Sprite.view;
pivot_Axis : in Vector_3;
pivot_Anchor : in Vector_3;
low_Limit : in Real;
high_Limit : in Real;
new_joint : out gel.Joint.view);
procedure attach_via_Hinge (Self : access Item'Class; the_Child : in Sprite.view;
pivot_Axis : in Vector_3;
low_Limit : in Real;
high_Limit : in Real;
new_joint : out gel.Joint.view);
--
-- Uses midpoint between Self and the_Child sprite as pivot_Anchor.
procedure attach_via_Hinge (Self : access Item'Class; the_Child : in Sprite.view;
Frame_in_parent : in Matrix_4x4;
Frame_in_child : in Matrix_4x4;
Limits : in DoF_Limits;
collide_Connected : in Boolean;
new_joint : out gel.Joint.view);
--- Ball/Socket
--
procedure attach_via_ball_Socket (Self : access Item'Class; the_Child : in Sprite.view;
pivot_Anchor : in Vector_3;
pivot_Axis : in Matrix_3x3;
pitch_Limits : in DoF_Limits;
yaw_Limits : in DoF_Limits;
roll_Limits : in DoF_Limits;
new_joint : out gel.Joint.view);
procedure attach_via_ball_Socket (Self : access Item'Class; the_Child : in Sprite.view;
Frame_in_parent : in Matrix_4x4;
Frame_in_child : in Matrix_4x4;
pitch_Limits : in DoF_Limits;
yaw_Limits : in DoF_Limits;
roll_Limits : in DoF_Limits;
new_joint : out gel.Joint.view);
--- Graphics
--
procedure program_Parameters_are (Self : in out Item'Class; Now : in opengl.Program.Parameters_view);
function program_Parameters (Self : in Item'Class) return opengl.Program.Parameters_view;
--- Physics
--
procedure rebuild_Shape (Self : in out Item);
procedure rebuild_Solid (Self : in out Item; at_Site : in Vector_3);
private
type access_Joint_views is access all Joint.views;
use type Joint.view;
package joint_Vectors is new ada.Containers.Vectors (Positive, Joint.view);
-- protected
-- type safe_Matrix_4x4
-- is
-- function Value return Matrix_4x4;
-- procedure Value_is (Now : in Matrix_4x4);
-- procedure Site_is (Now : in Vector_3);
--
-- private
-- the_Value : Matrix_4x4 := Identity_4x4;
-- end safe_Matrix_4x4;
type Item is limited new lace.Subject_and_deferred_Observer.item with
record
Id : gel.sprite_Id := null_sprite_Id;
Visual : openGL.Visual.view := new openGL.Visual.item;
program_Parameters : openGL.program.Parameters_view;
owns_Graphics : Boolean;
physics_Model : physics.Model.view;
owns_Physics : Boolean;
World : World_view;
Shape : physics_Shape_view;
Solid : physics_Object_view;
is_Kinematic : Boolean;
-- Transform : safe_Matrix_4x4;
-- Transform : Matrix_4x4;
Depth_in_camera_space : Real;
desired_Site : Vector_3;
interpolation_Vector : Vector_3;
initial_Spin : Quaternion := (0.0, (0.0, 1.0, 0.0));
desired_Spin : Quaternion := (0.0, (0.0, 1.0, 0.0));
interpolation_spin_Time : Real := 0.0;
parent_Joint : gel.Joint.view;
child_Joints : joint_Vectors.Vector;
is_Visible : Boolean := True;
key_Response : lace.Response.view;
is_Destroyed : Boolean := False;
end record;
null_Sprites : constant Sprite.views (1 .. 0) := (others => null);
end gel.Sprite;
|
-- A line editor
--
-- Main-program procedure is Lined.Program
--
-- Invoked as (assuming lined-program is in the path)
-- lined-program {filename}
-- Starts the editor
-- If filename is supplied, makes it the default file name
-- If filename is supplied and exists, opens it and reads it into the buffer
-- The current line is zero
--
-- Commands can be preceded by zero or more line numbers, separated by commas (',') or semicolons (';')
-- See the description of line numbers in lined-line_numbers.ads
-- Commands take zero, one, or two line numbers; there are default line number for those that take more than zero
-- When more line numbers are given than the command takes, the last zero, one, or two are used
--
-- Examples
-- 1,$p Prints the entire buffer
-- /pattern/;.-5,.+5p Prints lines around the next occurence of pattern (note the semicolon)
--
-- Commands, with the number of line numbers they take and their defaults are (things in [] are optional); a following p prints an
-- affected or next line for confirmation
--
-- Line numbers Command Description
-- [.+1] The null command: Prints the specified line
-- [.] =[p] Prints the line number of the specified line (for example, $=); p prints the line as well
-- [.] a Append: Reads lines from the keyboard and appends them after the specified line; input is
-- terminated by a line containing only a dot ('.')
-- [.,.] c Change: Replaces the specified lines with lines read from the keyboard as for Append
-- [.,.] d[p] Deletes the specified lines; p prints the line after the deleted lines or the last line if the
-- last line was deleted
-- e [filename] Edit: Clears the buffer, then reads the specified file (or the default file) into the buffer and
-- prints the number of lines read; if filename is given, makes it the default file
-- f {filename] File: Prints the specified filename (or the default file); if filename is given, makes it the
-- default file
-- [.] i Inserts lines read from the keyboard as for Append before the specified line
-- [.,.] m dest[p] Moves the specified lines to after line number dest; p prints the last line moved
-- [.,.] p Prints the specified lines
-- [.] r [filename] Reads the specified file (or the default file) into the buffer after the specified line; if
-- filename is given, makes it the default file
-- [,.,] s/pat/sub/[g][p] Substitute: Without g, changes the 1st occurrence of pat (a regular expression) into sub on the
-- specified lines; instances of @ not preceded by & in sub are replaced by the matched text
-- With g, changes all the occurrences of pat into sub
-- p prints the last line
-- [1,$] w [filename] Writes the specified lines to filename (or the default file); if filename is given, makes it the
-- default file
--
-- The commands =, d, m, p, s, r, and w may be preceded by a global prefix
-- [1,$] g/pattern/command
-- [1,$] x/pattern/command
-- g applies command to every line in the specified range that matches pattern; x, to every line that does not match
-- command may include line numbers of its own; they are re-evaluated each time with the current line set to the matching line
--
-- Examples
-- g/procedure/=p Prints the line number and line of every line containing "procedure"
-- 1,10x/* end/s/#*?$// Blanks all lines that do not start with "end" in the first 10 lines
--
-- The regular expressions used for line numbers, global prefixes, and the substitute command are defined in
-- PragmARC.Matching.Regular_Expression and PragmARC.Matching.Character_Regular_Expression; they are different from those used by
-- grep
--
package Lined with SPARK_Mode, Pure is
pragma Assertion_Policy (Check);
Invalid_Input : exception;
end Lined;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- ncurses --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 2000,2006 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Eugene V. Melaragno <aldomel@ix.netcom.com> 2000
-- Version Control
-- $Revision: 1.2 $
-- $Date: 2006/06/25 14:24:40 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with ncurses2.util; use ncurses2.util;
with Terminal_Interface.Curses; use Terminal_Interface.Curses;
with Ada.Strings.Fixed;
procedure ncurses2.color_test is
use Int_IO;
procedure show_color_name (y, x : Integer; color : Integer);
color_names : constant array (0 .. 15) of String (1 .. 7) :=
(
"black",
"red",
"green",
"yellow",
"blue",
"magenta",
"cyan",
"white",
"BLACK",
"RED",
"GREEN",
"YELLOW",
"BLUE",
"MAGENTA",
"CYAN",
"WHITE"
);
procedure show_color_name (y, x : Integer; color : Integer) is
tmp5 : String (1 .. 5);
begin
if Number_Of_Colors > 8 then
Put (tmp5, color);
Add (Line => Line_Position (y), Column => Column_Position (x),
Str => tmp5);
else
Add (Line => Line_Position (y), Column => Column_Position (x),
Str => color_names (color));
end if;
end show_color_name;
top, width : Integer;
hello : String (1 .. 5);
-- tmp3 : String (1 .. 3);
-- tmp2 : String (1 .. 2);
begin
Refresh;
Add (Str => "There are ");
-- Put(tmp3, Number_Of_Colors*Number_Of_Colors);
Add (Str => Ada.Strings.Fixed.Trim (Integer'Image (Number_Of_Colors *
Number_Of_Colors),
Ada.Strings.Left));
Add (Str => " color pairs");
Add (Ch => newl);
if Number_Of_Colors > 8 then
width := 4;
else
width := 8;
end if;
if Number_Of_Colors > 8 then
hello := "Test";
else
hello := "Hello";
end if;
for Bright in Boolean loop
if Number_Of_Colors > 8 then
top := 0;
else
top := Boolean'Pos (Bright) * (Number_Of_Colors + 3);
end if;
Clear_To_End_Of_Screen;
Move_Cursor (Line => Line_Position (top) + 1, Column => 0);
-- Put(tmp2, Number_Of_Colors);
Add (Str => Ada.Strings.Fixed.Trim (Integer'Image (Number_Of_Colors),
Ada.Strings.Left));
Add (Ch => 'x');
Add (Str => Ada.Strings.Fixed.Trim (Integer'Image (Number_Of_Colors),
Ada.Strings.Left));
Add (Str => " matrix of foreground/background colors, bright *");
if Bright then
Add (Str => "on");
else
Add (Str => "off");
end if;
Add (Ch => '*');
for i in 0 .. Number_Of_Colors - 1 loop
show_color_name (top + 2, (i + 1) * width, i);
end loop;
for i in 0 .. Number_Of_Colors - 1 loop
show_color_name (top + 3 + i, 0, i);
end loop;
for i in 1 .. Number_Of_Color_Pairs - 1 loop
Init_Pair (Color_Pair (i), Color_Number (i mod Number_Of_Colors),
Color_Number (i / Number_Of_Colors));
-- attron((attr_t) COLOR_PAIR(i)) -- Huh?
Set_Color (Pair => Color_Pair (i));
if Bright then
Switch_Character_Attribute (Attr => (Bold_Character => True,
others => False));
end if;
Add (Line => Line_Position (top + 3 + (i / Number_Of_Colors)),
Column => Column_Position ((i mod Number_Of_Colors + 1) *
width),
Str => hello);
Set_Character_Attributes;
end loop;
if Number_Of_Colors > 8 or Bright then
Pause;
end if;
end loop;
Erase;
End_Windows;
end ncurses2.color_test;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.UML.Operations.Hash is
new AMF.Elements.Generic_Hash (UML_Operation, UML_Operation_Access);
|
-- C47002B.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 VALUES BELONGING TO EACH CLASS OF TYPE CAN BE WRITTEN AS
-- THE OPERANDS OF QUALIFIED EXPRESSIONS.
-- THIS TEST IS FOR REAL TYPES.
-- RJW 7/23/86
WITH REPORT; USE REPORT;
PROCEDURE C47002B IS
BEGIN
TEST( "C47002B", "CHECK THAT VALUES HAVING REAL TYPES " &
"CAN BE WRITTEN AS THE OPERANDS OF " &
"QUALIFIED EXPRESSIONS" );
DECLARE -- FLOATING POINT TYPES.
TYPE RESULTS IS (FL1, FL2, FL3);
TYPE FLT IS DIGITS 3 RANGE -5.0 .. 5.0;
TYPE NFLT IS NEW FLOAT;
FUNCTION F (FL : FLT) RETURN RESULTS IS
BEGIN
RETURN FL1;
END F;
FUNCTION F (FL : NFLT) RETURN RESULTS IS
BEGIN
RETURN FL2;
END F;
FUNCTION F (FL : FLOAT) RETURN RESULTS IS
BEGIN
RETURN FL3;
END F;
BEGIN
IF F (FLT'(0.0)) /= FL1 THEN
FAILED ( "INCORRECT RESULTS FOR TYPE FLT" );
END IF;
IF F (NFLT'(0.0)) /= FL2 THEN
FAILED ( "INCORRECT RESULTS FOR TYPE NFLT" );
END IF;
IF F (FLOAT'(0.0)) /= FL3 THEN
FAILED ( "INCORRECT RESULTS FOR TYPE FLOAT" );
END IF;
END;
DECLARE -- FIXED POINT TYPES.
TYPE RESULTS IS (FI1, FI2, FI3);
TYPE FIXED IS DELTA 0.5 RANGE -5.0 .. 5.0;
TYPE NFIX IS NEW FIXED;
FUNCTION F (FI : FIXED) RETURN RESULTS IS
BEGIN
RETURN FI1;
END F;
FUNCTION F (FI : NFIX) RETURN RESULTS IS
BEGIN
RETURN FI2;
END F;
FUNCTION F (FI : DURATION) RETURN RESULTS IS
BEGIN
RETURN FI3;
END F;
BEGIN
IF F (FIXED'(0.0)) /= FI1 THEN
FAILED ( "INCORRECT RESULTS FOR TYPE FIXED" );
END IF;
IF F (NFIX'(0.0)) /= FI2 THEN
FAILED ( "INCORRECT RESULTS FOR TYPE NFIX" );
END IF;
IF F (DURATION'(0.0)) /= FI3 THEN
FAILED ( "INCORRECT RESULTS FOR TYPE DURATION" );
END IF;
END;
RESULT;
END C47002B;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A D A . U N C H E C K E D _ C O N V E R S I O N --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
generic
type Source (<>) is limited private;
type Target (<>) is limited private;
function Ada.Unchecked_Conversion (S : Source) return Target;
pragma Pure (Unchecked_Conversion);
pragma Import (Intrinsic, Unchecked_Conversion);
|
-- Copyright 2016-2021 Bartek thindil Jasicki
--
-- This file is part of Steam Sky.
--
-- Steam Sky 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.
--
-- Steam Sky 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 Steam Sky. If not, see <http://www.gnu.org/licenses/>.
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Goals; use Goals;
with Ships; use Ships;
with Config; use Config;
package body Statistics is
procedure UpdateDestroyedShips(ShipName: Unbounded_String) is
Updated: Boolean := False;
ShipIndex: Unbounded_String;
begin
Proto_Ships_Loop :
for I in Proto_Ships_List.Iterate loop
if Proto_Ships_List(I).Name = ShipName then
ShipIndex := Proto_Ships_Container.Key(I);
GameStats.Points :=
GameStats.Points + (Proto_Ships_List(I).Combat_Value / 10);
exit Proto_Ships_Loop;
end if;
end loop Proto_Ships_Loop;
if ShipIndex = Null_Unbounded_String then
return;
end if;
Destroyed_Ships_Loop :
for DestroyedShip of GameStats.DestroyedShips loop
if DestroyedShip.Index = ShipIndex then
DestroyedShip.Amount := DestroyedShip.Amount + 1;
Updated := True;
exit Destroyed_Ships_Loop;
end if;
end loop Destroyed_Ships_Loop;
if not Updated then
GameStats.DestroyedShips.Append
(New_Item => (Index => ShipIndex, Amount => 1));
end if;
end UpdateDestroyedShips;
procedure ClearGameStats is
begin
GameStats.DestroyedShips.Clear;
GameStats.BasesVisited := 1;
GameStats.MapVisited := 1;
GameStats.DistanceTraveled := 0;
GameStats.CraftingOrders.Clear;
GameStats.AcceptedMissions := 0;
GameStats.FinishedMissions.Clear;
GameStats.FinishedGoals.Clear;
GameStats.KilledMobs.Clear;
GameStats.Points := 0;
end ClearGameStats;
procedure UpdateFinishedGoals(Index: Unbounded_String) is
Updated: Boolean := False;
begin
Find_Goal_Index_Loop :
for Goal of Goals_List loop
if Goal.Index = Index then
GameStats.Points :=
GameStats.Points + (Goal.Amount * Goal.Multiplier);
exit Find_Goal_Index_Loop;
end if;
end loop Find_Goal_Index_Loop;
Update_Finished_Goals_Loop :
for FinishedGoal of GameStats.FinishedGoals loop
if FinishedGoal.Index = Index then
FinishedGoal.Amount := FinishedGoal.Amount + 1;
Updated := True;
exit Update_Finished_Goals_Loop;
end if;
end loop Update_Finished_Goals_Loop;
if not Updated then
Add_Finished_Goal_Loop :
for Goal of Goals_List loop
if Goal.Index = Index then
GameStats.FinishedGoals.Append
(New_Item => (Index => Goal.Index, Amount => 1));
exit Add_Finished_Goal_Loop;
end if;
end loop Add_Finished_Goal_Loop;
end if;
end UpdateFinishedGoals;
procedure UpdateFinishedMissions(MType: Unbounded_String) is
Updated: Boolean := False;
begin
Update_Finished_Missions_Loop :
for FinishedMission of GameStats.FinishedMissions loop
if FinishedMission.Index = MType then
FinishedMission.Amount := FinishedMission.Amount + 1;
Updated := True;
exit Update_Finished_Missions_Loop;
end if;
end loop Update_Finished_Missions_Loop;
if not Updated then
GameStats.FinishedMissions.Append
(New_Item => (Index => MType, Amount => 1));
end if;
GameStats.Points := GameStats.Points + 50;
end UpdateFinishedMissions;
procedure UpdateCraftingOrders(Index: Unbounded_String) is
Updated: Boolean := False;
begin
Update_Crafting_Loop :
for CraftingOrder of GameStats.CraftingOrders loop
if CraftingOrder.Index = Index then
CraftingOrder.Amount := CraftingOrder.Amount + 1;
Updated := True;
exit Update_Crafting_Loop;
end if;
end loop Update_Crafting_Loop;
if not Updated then
GameStats.CraftingOrders.Append
(New_Item => (Index => Index, Amount => 1));
end if;
GameStats.Points := GameStats.Points + 5;
end UpdateCraftingOrders;
procedure UpdateKilledMobs
(Mob: Member_Data; FractionName: Unbounded_String) is
Updated: Boolean := False;
begin
Get_Attribute_Points_Loop :
for Attribute of Mob.Attributes loop
GameStats.Points := GameStats.Points + Attribute.Level;
end loop Get_Attribute_Points_Loop;
Get_Skill_Points_Loop :
for Skill of Mob.Skills loop
GameStats.Points := GameStats.Points + Skill.Level;
end loop Get_Skill_Points_Loop;
Update_Killed_Mobs_Loop :
for KilledMob of GameStats.KilledMobs loop
if To_Lower(To_String(KilledMob.Index)) = To_String(FractionName) then
KilledMob.Amount := KilledMob.Amount + 1;
Updated := True;
exit Update_Killed_Mobs_Loop;
end if;
end loop Update_Killed_Mobs_Loop;
if not Updated then
GameStats.KilledMobs.Append
(New_Item =>
(Index =>
To_Unbounded_String
(To_Upper(Slice(FractionName, 1, 1)) &
Slice(FractionName, 2, Length(FractionName))),
Amount => 1));
end if;
end UpdateKilledMobs;
function GetGamePoints return Natural is
MalusIndexes: constant array(Positive range <>) of Positive :=
(2, 4, 5, 6);
DifficultyValues: constant array(1 .. 7) of Bonus_Type :=
(New_Game_Settings.Enemy_Damage_Bonus,
New_Game_Settings.Player_Damage_Bonus,
New_Game_Settings.Enemy_Melee_Damage_Bonus,
New_Game_Settings.Player_Melee_Damage_Bonus,
New_Game_Settings.Experience_Bonus,
New_Game_Settings.Reputation_Bonus,
New_Game_Settings.Upgrade_Cost_Bonus);
PointsBonus, Value: Float := 0.0;
begin
Get_Game_Points_Loop :
for I in DifficultyValues'Range loop
Value := Float(DifficultyValues(I));
Update_Game_Points_Loop :
for J in MalusIndexes'Range loop
if I = MalusIndexes(J) then
if Value < 1.0 then
Value := 1.0 + ((1.0 - Value) * 4.0);
elsif Value > 1.0 then
Value := 1.0 - Value;
end if;
exit Update_Game_Points_Loop;
end if;
end loop Update_Game_Points_Loop;
PointsBonus := PointsBonus + Value;
end loop Get_Game_Points_Loop;
PointsBonus := PointsBonus / Float(DifficultyValues'Length);
if PointsBonus < 0.01 then
PointsBonus := 0.01;
end if;
return Natural(Float(GameStats.Points) * PointsBonus);
end GetGamePoints;
end Statistics;
|
-- Copyright 2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Pkg is
R : Rec_Type;
begin
R := (C => 'd');
null; -- STOP
R := (C => Character'First, X_First => 27);
null; -- STOP2
end Pkg;
|
package body agar.gui.widget.vbox is
package cbinds is
procedure set_homogenous
(box : vbox_access_t;
homogenous : c.int);
pragma import (c, set_homogenous, "agar_gui_widget_vbox_set_homogenous");
procedure set_padding
(box : vbox_access_t;
padding : c.int);
pragma import (c, set_padding, "agar_gui_widget_vbox_set_padding");
procedure set_spacing
(box : vbox_access_t;
spacing : c.int);
pragma import (c, set_spacing, "agar_gui_widget_vbox_set_spacing");
end cbinds;
procedure set_homogenous
(box : vbox_access_t;
homogenous : boolean := true) is
begin
if homogenous then
cbinds.set_homogenous (box, 1);
else
cbinds.set_homogenous (box, 0);
end if;
end set_homogenous;
procedure set_padding
(box : vbox_access_t;
padding : natural) is
begin
cbinds.set_padding
(box => box,
padding => c.int (padding));
end set_padding;
procedure set_spacing
(box : vbox_access_t;
spacing : natural) is
begin
cbinds.set_spacing
(box => box,
spacing => c.int (spacing));
end set_spacing;
function widget (box : vbox_access_t) return widget_access_t is
begin
return agar.gui.widget.box.widget (box.box'access);
end widget;
end agar.gui.widget.vbox;
|
-- { dg-do compile }
procedure Unaligned_Rep_Clause is
type One_Bit_Record is
record
B : Boolean;
end record;
Pragma Pack(One_Bit_Record);
subtype Version_Number_Type is String (1 .. 3);
type Inter is
record
Version : Version_Number_Type;
end record;
type Msg_Type is
record
Status : One_Bit_Record;
Version : Inter;
end record;
for Msg_Type use
record
Status at 0 range 0 .. 0;
Version at 0 range 1 .. 24;
end record;
for Msg_Type'Size use 25;
Data : Msg_Type;
Pragma Warnings (Off, Data);
Version : Inter;
begin
Version := Data.Version;
end;
|
-- SipHash24_String_Hashing
-- Instantiations of SipHash with recommended parameters for the String types
-- in order to replace Ada.Strings.Hash and friends.
-- Copyright (c) 2015, James Humphry - see LICENSE file for details
pragma Spark_Mode;
with Ada.Characters.Handling, Ada.Wide_Characters.Handling;
with Ada.Wide_Wide_Characters.Handling;
with Ada.Strings.UTF_Encoding.Wide_Wide_Strings;
package body SipHash24_String_Hashing is
function String_Hash_Case_Insensitive (Key : String)
return Ada.Containers.Hash_Type
is
(String_Hash(Ada.Characters.Handling.To_Lower(Key)));
function Wide_String_Hash_Case_Insensitive (Key : Wide_String)
return Ada.Containers.Hash_Type
is
(Wide_String_Hash(Ada.Wide_Characters.Handling.To_Lower(Key)));
function Wide_Wide_String_Hash_Case_Insensitive (Key : Wide_Wide_String)
return Ada.Containers.Hash_Type
is
(Wide_Wide_String_Hash(Ada.Wide_Wide_Characters.Handling.To_Lower(Key)));
function UTF_8_String_Hash_Case_Insensitive
(Key : UTF_8_String)
return Ada.Containers.Hash_Type is
Decoded_String : constant Wide_Wide_String
:= Ada.Wide_Wide_Characters.Handling.To_Lower(Ada.Strings.UTF_Encoding.Wide_Wide_Strings.Decode(Key));
begin
return Wide_Wide_String_Hash(Decoded_String);
end UTF_8_String_Hash_Case_Insensitive;
end SipHash24_String_Hashing;
|
-- { dg-do compile }
pragma Implicit_Packing;
package Rep_Clause5 is
type Modes_Type is (Mode_0, Mode_1);
for Modes_Type'size use 8;
type Mode_Record_Type is
record
Mode_1 : aliased Modes_Type;
Mode_2 : aliased Modes_Type;
Mode_3 : aliased Modes_Type;
Mode_4 : aliased Modes_Type;
Time : aliased Float;
end record;
for Mode_Record_Type use
record
Mode_1 at 00 range 00 .. 07;
Mode_2 at 01 range 00 .. 07;
Mode_3 at 02 range 00 .. 07;
Mode_4 at 03 range 00 .. 07;
Time at 04 range 00 .. 31;
end record;
for Mode_Record_Type'Size use 64;
for Mode_Record_Type'Alignment use 4;
type Array_1_Type is array (0 .. 31) of Boolean;
for Array_1_Type'size use 32;
type Array_2_Type is array (0 .. 127) of Boolean;
for Array_2_Type'size use 128;
type Array_3_Type is array (0 .. 31) of Boolean;
for Array_3_Type'size use 32;
type Unsigned_Long is mod 2 ** 32;
type Array_4_Type is array (1 .. 6) of unsigned_Long;
type Primary_Data_Type is
record
Array_1 : aliased Array_1_Type;
Mode_Record : aliased Mode_Record_Type;
Array_2 : aliased Array_2_Type;
Array_3 : Array_3_Type;
Array_4 : Array_4_Type;
end record;
for Primary_Data_Type use
record
Array_1 at 0 range 0 .. 31; -- WORD 1
Mode_Record at 4 range 0 .. 63; -- WORD 2 .. 3
Array_2 at 12 range 0 .. 127; -- WORD 4 .. 7
Array_3 at 28 range 0 .. 31; -- WORD 8
Array_4 at 32 range 0 .. 191; -- WORD 9 .. 14
end record;
for Primary_Data_Type'Size use 448;
type Results_Record_Type is
record
Thirty_Two_Bit_Pad : Float;
Result : Primary_Data_Type;
end record;
for Results_Record_Type use
record
Thirty_Two_Bit_Pad at 0 range 0 .. 31;
Result at 4 range 0 .. 447;
end record;
end Rep_Clause5;
|
package Taft_Type2_Pkg is
type T is private;
function Open return T;
private
type Buffer_T;
type T is access Buffer_T;
end Taft_Type2_Pkg;
|
-- This spec has been automatically generated from STM32L151.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
-- STM32L151
package STM32_SVD is
pragma Preelaborate;
--------------------
-- Base addresses --
--------------------
AES_Base : constant System.Address :=
System'To_Address (16#50060000#);
COMP_Base : constant System.Address :=
System'To_Address (16#40007C00#);
CRC_Base : constant System.Address :=
System'To_Address (16#40023000#);
DAC_Base : constant System.Address :=
System'To_Address (16#40007400#);
DMA1_Base : constant System.Address :=
System'To_Address (16#40026000#);
DMA2_Base : constant System.Address :=
System'To_Address (16#40026400#);
EXTI_Base : constant System.Address :=
System'To_Address (16#40010400#);
Flash_Base : constant System.Address :=
System'To_Address (16#40023C00#);
FSMC_Base : constant System.Address :=
System'To_Address (16#A0000000#);
GPIOA_Base : constant System.Address :=
System'To_Address (16#40020000#);
GPIOB_Base : constant System.Address :=
System'To_Address (16#40020400#);
GPIOC_Base : constant System.Address :=
System'To_Address (16#40020800#);
GPIOD_Base : constant System.Address :=
System'To_Address (16#40020C00#);
GPIOE_Base : constant System.Address :=
System'To_Address (16#40021000#);
GPIOF_Base : constant System.Address :=
System'To_Address (16#40021800#);
GPIOG_Base : constant System.Address :=
System'To_Address (16#40021C00#);
GPIOH_Base : constant System.Address :=
System'To_Address (16#40021400#);
I2C1_Base : constant System.Address :=
System'To_Address (16#40005400#);
I2C2_Base : constant System.Address :=
System'To_Address (16#40005800#);
IWDG_Base : constant System.Address :=
System'To_Address (16#40003000#);
LCD_Base : constant System.Address :=
System'To_Address (16#40002400#);
OPAMP_Base : constant System.Address :=
System'To_Address (16#40007C5C#);
PWR_Base : constant System.Address :=
System'To_Address (16#40007000#);
RCC_Base : constant System.Address :=
System'To_Address (16#40023800#);
RI_Base : constant System.Address :=
System'To_Address (16#40007C04#);
RTC_Base : constant System.Address :=
System'To_Address (16#40002800#);
SDIO_Base : constant System.Address :=
System'To_Address (16#40012C00#);
SPI1_Base : constant System.Address :=
System'To_Address (16#40013000#);
SPI2_Base : constant System.Address :=
System'To_Address (16#40003800#);
SPI3_Base : constant System.Address :=
System'To_Address (16#40003C00#);
SYSCFG_Base : constant System.Address :=
System'To_Address (16#40010000#);
TIM10_Base : constant System.Address :=
System'To_Address (16#40010C00#);
TIM11_Base : constant System.Address :=
System'To_Address (16#40011000#);
TIM2_Base : constant System.Address :=
System'To_Address (16#40000000#);
TIM3_Base : constant System.Address :=
System'To_Address (16#40000400#);
TIM4_Base : constant System.Address :=
System'To_Address (16#40000800#);
TIM5_Base : constant System.Address :=
System'To_Address (16#40000C00#);
TIM6_Base : constant System.Address :=
System'To_Address (16#40001000#);
TIM7_Base : constant System.Address :=
System'To_Address (16#40001400#);
TIM9_Base : constant System.Address :=
System'To_Address (16#40010800#);
USART1_Base : constant System.Address :=
System'To_Address (16#40013800#);
USART2_Base : constant System.Address :=
System'To_Address (16#40004400#);
USART3_Base : constant System.Address :=
System'To_Address (16#40004800#);
UART4_Base : constant System.Address :=
System'To_Address (16#40004C00#);
UART5_Base : constant System.Address :=
System'To_Address (16#40005000#);
USB_Base : constant System.Address :=
System'To_Address (16#40005C00#);
USB_SRAM_Base : constant System.Address :=
System'To_Address (16#40006000#);
WWDG_Base : constant System.Address :=
System'To_Address (16#40002C00#);
ADC_Base : constant System.Address :=
System'To_Address (16#40012400#);
NVIC_Base : constant System.Address :=
System'To_Address (16#E000E100#);
DBGMCU_Base : constant System.Address :=
System'To_Address (16#E0042000#);
MPU_Base : constant System.Address :=
System'To_Address (16#E000ED90#);
SCB_ACTRL_Base : constant System.Address :=
System'To_Address (16#E000E008#);
NVIC_STIR_Base : constant System.Address :=
System'To_Address (16#E000EF00#);
SCB_Base : constant System.Address :=
System'To_Address (16#E000ED00#);
STK_Base : constant System.Address :=
System'To_Address (16#E000E010#);
end STM32_SVD;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ C H 1 3 --
-- --
-- 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. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Checks; use Checks;
with Einfo; use Einfo;
with Exp_Ch3; use Exp_Ch3;
with Exp_Ch6; use Exp_Ch6;
with Exp_Imgv; use Exp_Imgv;
with Exp_Util; use Exp_Util;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Ch7; use Sem_Ch7;
with Sem_Ch8; use Sem_Ch8;
with Sem_Eval; use Sem_Eval;
with Sem_Util; use Sem_Util;
with Sinfo; use Sinfo;
with Snames; use Snames;
with Stand; use Stand;
with Stringt; use Stringt;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
package body Exp_Ch13 is
------------------------------------------
-- Expand_N_Attribute_Definition_Clause --
------------------------------------------
-- Expansion action depends on attribute involved
procedure Expand_N_Attribute_Definition_Clause (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Exp : constant Node_Id := Expression (N);
Ent : Entity_Id;
V : Node_Id;
begin
Ent := Entity (Name (N));
if Is_Type (Ent) then
Ent := Underlying_Type (Ent);
end if;
case Get_Attribute_Id (Chars (N)) is
-------------
-- Address --
-------------
when Attribute_Address =>
-- If there is an initialization which did not come from
-- the source program, then it is an artifact of our
-- expansion, and we suppress it. The case we are most
-- concerned about here is the initialization of a packed
-- array to all false, which seems inappropriate for a
-- variable to which an address clause is applied. The
-- expression may itself have been rewritten if the type is a
-- packed array, so we need to examine whether the original
-- node is in the source.
declare
Decl : constant Node_Id := Declaration_Node (Ent);
begin
if Nkind (Decl) = N_Object_Declaration
and then Present (Expression (Decl))
and then
not Comes_From_Source (Original_Node (Expression (Decl)))
then
Set_Expression (Decl, Empty);
end if;
end;
---------------
-- Alignment --
---------------
when Attribute_Alignment =>
-- As required by Gigi, we guarantee that the operand is an
-- integer literal (this simplifies things in Gigi).
if Nkind (Exp) /= N_Integer_Literal then
Rewrite
(Exp, Make_Integer_Literal (Loc, Expr_Value (Exp)));
end if;
------------------
-- External_Tag --
------------------
-- For the rep clause "for x'external_tag use y" generate:
-- xV : constant string := y;
-- Set_External_Tag (x'tag, xV'Address);
-- Register_Tag (x'tag);
-- note that register_tag has been delayed up to now because
-- the external_tag must be set before resistering.
when Attribute_External_Tag => External_Tag : declare
E : Entity_Id;
Old_Val : String_Id := Strval (Expr_Value_S (Exp));
New_Val : String_Id;
begin
-- Create a new nul terminated string if it is not already
if String_Length (Old_Val) > 0
and then Get_String_Char (Old_Val, String_Length (Old_Val)) = 0
then
New_Val := Old_Val;
else
Start_String (Old_Val);
Store_String_Char (Get_Char_Code (ASCII.NUL));
New_Val := End_String;
end if;
E :=
Make_Defining_Identifier (Loc,
New_External_Name (Chars (Ent), 'A'));
Insert_Action (N,
Make_Object_Declaration (Loc,
Defining_Identifier => E,
Constant_Present => True,
Object_Definition =>
New_Reference_To (Standard_String, Loc),
Expression =>
Make_String_Literal (Loc, Strval => New_Val)));
Insert_Actions (N, New_List (
Make_Procedure_Call_Statement (Loc,
Name => New_Reference_To (RTE (RE_Set_External_Tag), Loc),
Parameter_Associations => New_List (
Make_Attribute_Reference (Loc,
Attribute_Name => Name_Tag,
Prefix => New_Occurrence_Of (Ent, Loc)),
Make_Attribute_Reference (Loc,
Attribute_Name => Name_Address,
Prefix => New_Occurrence_Of (E, Loc)))),
Make_Procedure_Call_Statement (Loc,
Name => New_Reference_To (RTE (RE_Register_Tag), Loc),
Parameter_Associations => New_List (
Make_Attribute_Reference (Loc,
Attribute_Name => Name_Tag,
Prefix => New_Occurrence_Of (Ent, Loc))))));
end External_Tag;
------------------
-- Storage_Size --
------------------
when Attribute_Storage_Size =>
-- If the type is a task type, then assign the value of the
-- storage size to the Size variable associated with the task.
-- task_typeZ := expression
if Ekind (Ent) = E_Task_Type then
Insert_Action (N,
Make_Assignment_Statement (Loc,
Name => New_Reference_To (Storage_Size_Variable (Ent), Loc),
Expression =>
Convert_To (RTE (RE_Size_Type), Expression (N))));
-- For Storage_Size for an access type, create a variable to hold
-- the value of the specified size with name typeV and expand an
-- assignment statement to initialze this value.
elsif Is_Access_Type (Ent) then
V := Make_Defining_Identifier (Loc,
New_External_Name (Chars (Ent), 'V'));
Insert_Action (N,
Make_Object_Declaration (Loc,
Defining_Identifier => V,
Object_Definition =>
New_Reference_To (RTE (RE_Storage_Offset), Loc),
Expression =>
Convert_To (RTE (RE_Storage_Offset), Expression (N))));
Set_Storage_Size_Variable (Ent, Entity_Id (V));
end if;
-- Other attributes require no expansion
when others =>
null;
end case;
end Expand_N_Attribute_Definition_Clause;
----------------------------
-- Expand_N_Freeze_Entity --
----------------------------
procedure Expand_N_Freeze_Entity (N : Node_Id) is
E : constant Entity_Id := Entity (N);
E_Scope : Entity_Id;
S : Entity_Id;
In_Other_Scope : Boolean;
In_Outer_Scope : Boolean;
Decl : Node_Id;
begin
-- For object, with address clause, check alignment is OK
if Is_Object (E) then
Apply_Alignment_Check (E, N);
-- Only other items requiring any front end action are
-- types and subprograms.
elsif not Is_Type (E) and then not Is_Subprogram (E) then
return;
end if;
-- Here E is a type or a subprogram
E_Scope := Scope (E);
-- If we are freezing entities defined in protected types, they
-- belong in the enclosing scope, given that the original type
-- has been expanded away. The same is true for entities in task types,
-- in particular the parameter records of entries (Entities in bodies
-- are all frozen within the body). If we are in the task body, this
-- is a proper scope.
if Ekind (E_Scope) = E_Protected_Type
or else (Ekind (E_Scope) = E_Task_Type
and then not Has_Completion (E_Scope))
then
E_Scope := Scope (E_Scope);
end if;
S := Current_Scope;
while S /= Standard_Standard and then S /= E_Scope loop
S := Scope (S);
end loop;
In_Other_Scope := not (S = E_Scope);
In_Outer_Scope := (not In_Other_Scope) and then (S /= Current_Scope);
-- If the entity being frozen is defined in a scope that is not
-- currently on the scope stack, we must establish the proper
-- visibility before freezing the entity and related subprograms.
if In_Other_Scope then
New_Scope (E_Scope);
Install_Visible_Declarations (E_Scope);
if Ekind (E_Scope) = E_Package or else
Ekind (E_Scope) = E_Generic_Package or else
Is_Protected_Type (E_Scope) or else
Is_Task_Type (E_Scope)
then
Install_Private_Declarations (E_Scope);
end if;
-- If the entity is in an outer scope, then that scope needs to
-- temporarily become the current scope so that operations created
-- during type freezing will be declared in the right scope and
-- can properly override any corresponding inherited operations.
elsif In_Outer_Scope then
New_Scope (E_Scope);
end if;
-- If type, freeze the type
if Is_Type (E) then
Freeze_Type (N);
-- And for enumeration type, build the enumeration tables
if Is_Enumeration_Type (E) then
Build_Enumeration_Image_Tables (E, N);
end if;
-- If subprogram, freeze the subprogram
elsif Is_Subprogram (E) then
Freeze_Subprogram (N);
end if;
-- Analyze actions generated by freezing. The init_proc contains
-- source expressions that may raise constraint_error, and the
-- assignment procedure for complex types needs checks on individual
-- component assignments, but all other freezing actions should be
-- compiled with all checks off.
if Present (Actions (N)) then
Decl := First (Actions (N));
while Present (Decl) loop
if Nkind (Decl) = N_Subprogram_Body
and then (Chars (Defining_Entity (Decl)) = Name_uInit_Proc
or else Chars (Defining_Entity (Decl)) = Name_uAssign)
then
Analyze (Decl);
-- A subprogram body created for a renaming_as_body completes
-- a previous declaration, which may be in a different scope.
-- Establish the proper scope before analysis.
elsif Nkind (Decl) = N_Subprogram_Body
and then Present (Corresponding_Spec (Decl))
and then Scope (Corresponding_Spec (Decl)) /= Current_Scope
then
New_Scope (Scope (Corresponding_Spec (Decl)));
Analyze (Decl, Suppress => All_Checks);
Pop_Scope;
else
Analyze (Decl, Suppress => All_Checks);
end if;
Next (Decl);
end loop;
end if;
if In_Other_Scope then
if Ekind (Current_Scope) = E_Package then
End_Package_Scope (E_Scope);
else
End_Scope;
end if;
elsif In_Outer_Scope then
Pop_Scope;
end if;
end Expand_N_Freeze_Entity;
-------------------------------------------
-- Expand_N_Record_Representation_Clause --
-------------------------------------------
-- The only expansion required is for the case of a mod clause present,
-- which is removed, and translated into an alignment representation
-- clause inserted immediately after the record rep clause with any
-- initial pragmas inserted at the start of the component clause list.
procedure Expand_N_Record_Representation_Clause (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Rectype : constant Entity_Id := Entity (Identifier (N));
Mod_Val : Uint;
Citems : List_Id;
Repitem : Node_Id;
AtM_Nod : Node_Id;
begin
if Present (Mod_Clause (N)) then
Mod_Val := Expr_Value (Expression (Mod_Clause (N)));
Citems := Pragmas_Before (Mod_Clause (N));
if Present (Citems) then
Append_List_To (Citems, Component_Clauses (N));
Set_Component_Clauses (N, Citems);
end if;
AtM_Nod :=
Make_Attribute_Definition_Clause (Loc,
Name => New_Reference_To (Base_Type (Rectype), Loc),
Chars => Name_Alignment,
Expression => Make_Integer_Literal (Loc, Mod_Val));
Set_From_At_Mod (AtM_Nod);
Insert_After (N, AtM_Nod);
Set_Mod_Clause (N, Empty);
end if;
-- If the record representation clause has no components, then
-- completely remove it. Note that we also have to remove
-- ourself from the Rep Item list.
if Is_Empty_List (Component_Clauses (N)) then
if First_Rep_Item (Rectype) = N then
Set_First_Rep_Item (Rectype, Next_Rep_Item (N));
else
Repitem := First_Rep_Item (Rectype);
while Present (Next_Rep_Item (Repitem)) loop
if Next_Rep_Item (Repitem) = N then
Set_Next_Rep_Item (Repitem, Next_Rep_Item (N));
exit;
end if;
Next_Rep_Item (Repitem);
end loop;
end if;
Rewrite (N,
Make_Null_Statement (Loc));
end if;
end Expand_N_Record_Representation_Clause;
end Exp_Ch13;
|
------------------------------------------------------------------------------
-- --
-- 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.DC;
with AMF.DG.Clip_Paths;
with AMF.DG.Groups;
with AMF.DG.Styles.Collections;
with AMF.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.DD_Attributes;
with AMF.Visitors.DG_Iterators;
with AMF.Visitors.DG_Visitors;
package body AMF.Internals.DG_Ellipses is
----------------
-- Get_Center --
----------------
overriding function Get_Center
(Self : not null access constant DG_Ellipse_Proxy)
return AMF.DC.DC_Point is
begin
return
AMF.Internals.Tables.DD_Attributes.Internal_Get_Center
(Self.Element);
end Get_Center;
----------------
-- Set_Center --
----------------
overriding procedure Set_Center
(Self : not null access DG_Ellipse_Proxy;
To : AMF.DC.DC_Point) is
begin
AMF.Internals.Tables.DD_Attributes.Internal_Set_Center
(Self.Element, To);
end Set_Center;
---------------
-- Get_Radii --
---------------
overriding function Get_Radii
(Self : not null access constant DG_Ellipse_Proxy)
return AMF.DC.DC_Dimension is
begin
return
AMF.Internals.Tables.DD_Attributes.Internal_Get_Radii
(Self.Element);
end Get_Radii;
---------------
-- Set_Radii --
---------------
overriding procedure Set_Radii
(Self : not null access DG_Ellipse_Proxy;
To : AMF.DC.DC_Dimension) is
begin
AMF.Internals.Tables.DD_Attributes.Internal_Set_Radii
(Self.Element, To);
end Set_Radii;
---------------
-- Get_Group --
---------------
overriding function Get_Group
(Self : not null access constant DG_Ellipse_Proxy)
return AMF.DG.Groups.DG_Group_Access is
begin
return
AMF.DG.Groups.DG_Group_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.DD_Attributes.Internal_Get_Group
(Self.Element)));
end Get_Group;
---------------
-- Set_Group --
---------------
overriding procedure Set_Group
(Self : not null access DG_Ellipse_Proxy;
To : AMF.DG.Groups.DG_Group_Access) is
begin
AMF.Internals.Tables.DD_Attributes.Internal_Set_Group
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Group;
---------------------
-- Get_Local_Style --
---------------------
overriding function Get_Local_Style
(Self : not null access constant DG_Ellipse_Proxy)
return AMF.DG.Styles.Collections.Ordered_Set_Of_DG_Style is
begin
return
AMF.DG.Styles.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.DD_Attributes.Internal_Get_Local_Style
(Self.Element)));
end Get_Local_Style;
----------------------
-- Get_Shared_Style --
----------------------
overriding function Get_Shared_Style
(Self : not null access constant DG_Ellipse_Proxy)
return AMF.DG.Styles.Collections.Ordered_Set_Of_DG_Style is
begin
return
AMF.DG.Styles.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.DD_Attributes.Internal_Get_Shared_Style
(Self.Element)));
end Get_Shared_Style;
-------------------
-- Get_Transform --
-------------------
overriding function Get_Transform
(Self : not null access constant DG_Ellipse_Proxy)
return AMF.DG.Sequence_Of_DG_Transform is
begin
return
AMF.Internals.Tables.DD_Attributes.Internal_Get_Transform
(Self.Element);
end Get_Transform;
-------------------
-- Get_Clip_Path --
-------------------
overriding function Get_Clip_Path
(Self : not null access constant DG_Ellipse_Proxy)
return AMF.DG.Clip_Paths.DG_Clip_Path_Access is
begin
return
AMF.DG.Clip_Paths.DG_Clip_Path_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.DD_Attributes.Internal_Get_Clip_Path
(Self.Element)));
end Get_Clip_Path;
-------------------
-- Set_Clip_Path --
-------------------
overriding procedure Set_Clip_Path
(Self : not null access DG_Ellipse_Proxy;
To : AMF.DG.Clip_Paths.DG_Clip_Path_Access) is
begin
AMF.Internals.Tables.DD_Attributes.Internal_Set_Clip_Path
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Clip_Path;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant DG_Ellipse_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.DG_Visitors.DG_Visitor'Class then
AMF.Visitors.DG_Visitors.DG_Visitor'Class
(Visitor).Enter_Ellipse
(AMF.DG.Ellipses.DG_Ellipse_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant DG_Ellipse_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.DG_Visitors.DG_Visitor'Class then
AMF.Visitors.DG_Visitors.DG_Visitor'Class
(Visitor).Leave_Ellipse
(AMF.DG.Ellipses.DG_Ellipse_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant DG_Ellipse_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.DG_Iterators.DG_Iterator'Class then
AMF.Visitors.DG_Iterators.DG_Iterator'Class
(Iterator).Visit_Ellipse
(Visitor,
AMF.DG.Ellipses.DG_Ellipse_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.DG_Ellipses;
|
-- *************************************************************************************
-- The recipient is warned that this code should be handled in accordance
-- with the HM Government Security Classification indicated throughout.
--
-- This code and its contents shall not be used for other than UK Government
-- purposes.
--
-- The copyright in this code is the property of BAE SYSTEMS Electronic Systems Limited.
-- The Code is supplied by BAE SYSTEMS on the express terms that it is to be treated in
-- confidence and that it may not be copied, used or disclosed to others for any
-- purpose except in accordance with DEFCON 91 (Edn 10/92).
--
-- File Name: Generic_FIFO.adb
-- Version: As detailed by ClearCase
-- Version Date: As detailed by ClearCase
-- Creation Date: 03-11-99
-- Security Classification: Unclassified
-- Project: SRLE (Sting Ray Life Extension)
-- Author: J Mann
-- Section: Tactical Software/ Software Architecture
-- Division: Underwater Systems Division
-- Description: Specification and implementation of application-wide FIFO type
-- Comments:
--
-- MODIFICATION RECORD
-- --------------------
-- NAME DATE ECR No MODIFICATION
--
-- **************************************************************************************
package body Generic_FIFO is
--
-- The free list retains the memory space of deleted items. If it results in unacceptable sizes
-- at run time, the option of deallocating excesses will be addressed
--
Free_List: FIFO_Access_Type;
--
------------------------------------------------------------------------------------------------
--
-- The FIFO is less used than the list structure, so does not as yet have the same diagnostic
-- operations. If they prove desirable, their inclusion will be considered.
--
procedure Push (
Item : in Element_Type;
Target_FIFO : in out FIFO_Type;
Top : in boolean := false) is
New_Cell: FIFO_Access_Type;
begin
-- Log.Put_Line ("Push: 'before' queue size -> "&integer'image (Target_FIFO.Size));
if Free_List = null then
--
-- there are no 'old' entries available for reuse
--
-- log.put_line ("Push called - no 'old' entries");
begin
New_Cell:= new FIFO_Cell_Type;
exception
when Storage_Error => raise FIFO_Overflow_Error ;
end;
else
--
-- there are,.. so take the first one and step on the free list
New_Cell := Free_List;
Free_List := Free_List. Next_Cell;
end if;
--
-- the new cell has been identified, so set the fields up
--
if Top then
--
-- put to FRONT of queue
--
New_Cell.all := (
Element_Pointer => Item,
Next_Cell => null,
Previous_Cell => Target_FIFO.Last_Entry);
--
-- link the new cell into the FIFO
--
if Target_FIFO.First_Entry = null then
Target_FIFO.First_Entry := New_Cell;
else
Target_FIFO.Last_Entry.Next_Cell := New_Cell;
end if;
Target_FIFO.Last_Entry := New_Cell;
else
--
-- (normal) put to back of queue
--
New_Cell.all := (
Element_Pointer => Item,
Next_Cell => Target_FIFO.First_Entry,
Previous_Cell => null);
--
-- link the new cell into the FIFO
--
if Target_FIFO.First_Entry = null then
Target_FIFO.Last_Entry := New_Cell;
else
Target_FIFO.First_Entry.Previous_Cell := New_Cell;
end if;
Target_FIFO.First_Entry := New_Cell;
end if;
--
-- and increment the size of the store
--
Target_FIFO.Size := Target_FIFO. Size + 1;
if Target_FIFO.Size > Target_FIFO.Max_Count then
Target_FIFO.Max_Count := Target_FIFO.Size;
end if;
end Push;
--
---------------------------------------------------------------------
--
procedure Pop (
Item : out Element_Type;
Target_FIFO : in out FIFO_Type) is
Old_Cell: FIFO_Access_Type;
begin
Target_FIFO := Target_FIFO;
if Target_FIFO. Last_Entry = null then raise FIFO_Underflow_Error;
--
-- trying to extract from an already-empty queue
--
else
--
-- set output parameter to be oldest entry (in time)
--
Item := Target_FIFO.Last_Entry.Element_Pointer ;
--
-- and undo and remake the links from the FIFO list
--
Old_Cell := Target_FIFO.Last_Entry;
Target_FIFO.Last_Entry := Target_FIFO.Last_Entry.Previous_Cell;
if Target_FIFO.Last_Entry /= null then
Target_FIFO.Last_Entry.Next_Cell := null;
else
Target_FIFO.First_Entry := null;
end if;
--
-- and decrement the size of the store
--
Target_FIFO.Size := Target_FIFO.Size - 1;
--
-- add deleted cell to the free list available for reuse
--
Old_Cell.Next_Cell := Free_List;
Old_Cell.Previous_Cell := null;
Free_List := Old_Cell;
end if;
end Pop;
--
---------------------------------------------------------------------
--
--
-- This function is provided only as an interface operation
--
function Queue_Length (Queue: FIFO_Type) return Natural is
begin
return Queue.Size;
end Queue_Length;
--
---------------------------------------------------------------------
function Max_Count_Of (Queue: FIFO_Type) return Natural is
begin
return Queue.Max_Count;
end Max_Count_Of;
---------------------------------------------------------------------
--
end Generic_FIFO;
|
------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
-- Purpose:
-- This is effective implementation of double linked list container.
-- Item of the list contains embeded link to next and prev elements, so
-- + no memory allocation required
-- + limited undefinite types allowed as items of list
-- - it can't be in more then one list at once.
-- - easy to break list if pass element to wrong list
with Gela.Embeded_Links.Lists;
generic
type Element_Type (<>) is limited private;
type Element_Access is access all Element_Type;
-- get embeded link of element
with function Get_Next (Item : Element_Access) return Element_Access is <>;
with function Get_Prev (Item : Element_Access) return Element_Access is <>;
-- set embeded link of element
with procedure Set_Next (Item, Next : Element_Access) is <>;
with procedure Set_Prev (Item, Prev : Element_Access) is <>;
package Gela.Embeded_Links.Double_Lists is
package Simple_Lists is
new Gela.Embeded_Links.Lists (Element_Type, Element_Access);
type List is new Simple_Lists.List;
-- Empty_List : List renames List (Simple_Lists.Empty_List); ???
procedure Clear (Container : in out List);
procedure Insert_After
(Container : in out List;
After : in Element_Access;
New_Item : in Element_Access);
procedure Insert
(Container : in out List;
Before : in Element_Access;
New_Item : in Element_Access);
procedure Append
(Container : in out List;
New_Item : in Element_Access);
procedure Prepend
(Container : in out List;
New_Item : in Element_Access);
procedure Delete
(Container : in out List;
Item : in Element_Access);
procedure Delete_Next
(Container : in out List;
After : in Element_Access;
Removed : out Element_Access);
procedure Delete_First
(Container : in out List;
Removed : out Element_Access);
procedure Delete_Last
(Container : in out List;
Removed : out Element_Access);
procedure Splice_After
(Target : in out List;
Source : in out List;
After : in Element_Access := null);
generic package Generic_Search renames Simple_Lists.Generic_Search;
generic procedure For_Each renames Simple_Lists.For_Each;
generic procedure For_Each_With_Param
renames Simple_Lists.For_Each_With_Param;
generic function To_Array renames Simple_Lists.To_Array;
generic function Agreed_To_Array renames Simple_Lists.Agreed_To_Array;
generic function Agreed_To_Array_With_Param
renames Simple_Lists.Agreed_To_Array_With_Param;
private
-- Empty_List : constant List := (Tail => null);
pragma Inline (Insert);
pragma Inline (Insert_After);
pragma Inline (Append);
pragma Inline (Prepend);
pragma Inline (Delete);
pragma Inline (Delete_Next);
pragma Inline (Delete_First);
pragma Inline (Delete_Last);
pragma Inline (Splice_After);
end Gela.Embeded_Links.Double_Lists;
------------------------------------------------------------------------------
-- Copyright (c) 2006, 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.
------------------------------------------------------------------------------
|
-- Copyright 2012-2014 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
type Color is (Black, Red, Green, Blue, White);
type Full_Table is array (Color) of Boolean;
pragma Pack (Full_Table);
procedure Do_Nothing (A : System.Address);
end Pck;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.UML.Classifiers;
with AMF.Visitors.Standard_Profile_L2_Iterators;
with AMF.Visitors.Standard_Profile_L2_Visitors;
package body AMF.Internals.Standard_Profile_L2_Specifications is
-------------------------
-- Get_Base_Classifier --
-------------------------
overriding function Get_Base_Classifier
(Self : not null access constant Standard_Profile_L2_Specification_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access is
begin
return
AMF.UML.Classifiers.UML_Classifier_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Base_Classifier
(Self.Element)));
end Get_Base_Classifier;
-------------------------
-- Set_Base_Classifier --
-------------------------
overriding procedure Set_Base_Classifier
(Self : not null access Standard_Profile_L2_Specification_Proxy;
To : AMF.UML.Classifiers.UML_Classifier_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Base_Classifier
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Base_Classifier;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant Standard_Profile_L2_Specification_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.Standard_Profile_L2_Visitors.Standard_Profile_L2_Visitor'Class then
AMF.Visitors.Standard_Profile_L2_Visitors.Standard_Profile_L2_Visitor'Class
(Visitor).Enter_Specification
(AMF.Standard_Profile_L2.Specifications.Standard_Profile_L2_Specification_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant Standard_Profile_L2_Specification_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.Standard_Profile_L2_Visitors.Standard_Profile_L2_Visitor'Class then
AMF.Visitors.Standard_Profile_L2_Visitors.Standard_Profile_L2_Visitor'Class
(Visitor).Leave_Specification
(AMF.Standard_Profile_L2.Specifications.Standard_Profile_L2_Specification_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant Standard_Profile_L2_Specification_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.Standard_Profile_L2_Iterators.Standard_Profile_L2_Iterator'Class then
AMF.Visitors.Standard_Profile_L2_Iterators.Standard_Profile_L2_Iterator'Class
(Iterator).Visit_Specification
(Visitor,
AMF.Standard_Profile_L2.Specifications.Standard_Profile_L2_Specification_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.Standard_Profile_L2_Specifications;
|
with Ada.Strings.Fixed;
package body Surface.Window is
procedure Attach (Application : in out Reference) is
begin
null;
end Attach;
procedure Setup (self : in out Instance) is
begin
Background_Color (self, raylib.LIGHTGRAY);
Size (self, 1027, 768);
Title (self, "Unnamed");
end Setup;
procedure Run (Self : in out Instance'Class) is
delta_time : Float := 0.0;
Windows_Area : raylib.Rectangle;
use type raylib.int;
begin
Windows_Area := (0.0,0.0,float(self.window_Width),float(self.window_Height));
Instance(Self).Setup;
self.Setup;
Raylib.Window.Init (self.window_Width, self.window_Height, self.window_title);
while not raylib.window.should_close loop
raylib.begin_drawing;
raylib.clear_background (self.Background_Color);
self.Update (delta_time);
if self.Border_Width > 0 then
raylib.shapes.draw_rectangle_lines_ex (Windows_Area,
raylib.int(self.Border_Width),
self.Border_Color);
end if;
raylib.end_drawing;
end loop;
raylib.window.close;
end run;
procedure Title (Self : in out Instance ; Title : String) is
begin
Ada.Strings.Fixed.Move (Title, Self.Window_Title);
end Title;
procedure Background_Color (Self : in out instance ; Tint : raylib.Color) is
begin
Self.Background_Color := Tint;
end Background_Color;
procedure Size (Self : in out Instance ; Width, Height : Integer) is
begin
Self.Window_Width := Width;
Self.Window_Height := Height;
end Size;
end Surface.Window;
|
------------------------------------------------------------------------------
-- --
-- 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 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. --
-- --
------------------------------------------------------------------------------
-- The file declares the main procedure for the demonstration. The LEDs
-- will blink in a sequence on the board. The blue user button generates
-- an interrupt that changes the direction.
with Driver; pragma Unreferenced (Driver);
-- The Driver package contains the task that actually controls the app so
-- although it is not referenced directly in the main procedure, we need it
-- in the closure of the context clauses so that it will be included in the
-- executable.
with Last_Chance_Handler; pragma Unreferenced (Last_Chance_Handler);
-- The "last chance handler" is the user-defined routine that is called when
-- an exception is propagated. We need it in the executable, therefore it
-- must be somewhere in the closure of the context clauses.
with System;
procedure Hello_World is
pragma Priority (System.Priority'First);
begin
loop
null;
end loop;
end Hello_World;
|
with C.malloc.malloc;
function System.System_Allocators.Allocated_Size (
Storage_Address : Address)
return Storage_Elements.Storage_Count
is
pragma Suppress (All_Checks);
begin
return Storage_Elements.Storage_Offset (
C.malloc.malloc.malloc_size (C.void_const_ptr (Storage_Address)));
end System.System_Allocators.Allocated_Size;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . F O R M A L _ H A S H E D _ M A P S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2010-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/>. --
------------------------------------------------------------------------------
with Ada.Containers.Hash_Tables.Generic_Bounded_Operations;
pragma Elaborate_All (Ada.Containers.Hash_Tables.Generic_Bounded_Operations);
with Ada.Containers.Hash_Tables.Generic_Bounded_Keys;
pragma Elaborate_All (Ada.Containers.Hash_Tables.Generic_Bounded_Keys);
with Ada.Containers.Prime_Numbers; use Ada.Containers.Prime_Numbers;
with System; use type System.Address;
package body Ada.Containers.Formal_Hashed_Maps with
SPARK_Mode => Off
is
-----------------------
-- Local Subprograms --
-----------------------
-- All local subprograms require comments ???
function Equivalent_Keys
(Key : Key_Type;
Node : Node_Type) return Boolean;
pragma Inline (Equivalent_Keys);
procedure Free
(HT : in out Map;
X : Count_Type);
generic
with procedure Set_Element (Node : in out Node_Type);
procedure Generic_Allocate
(HT : in out Map;
Node : out Count_Type);
function Hash_Node (Node : Node_Type) return Hash_Type;
pragma Inline (Hash_Node);
function Next (Node : Node_Type) return Count_Type;
pragma Inline (Next);
procedure Set_Next (Node : in out Node_Type; Next : Count_Type);
pragma Inline (Set_Next);
function Vet (Container : Map; Position : Cursor) return Boolean;
--------------------------
-- Local Instantiations --
--------------------------
package HT_Ops is
new Hash_Tables.Generic_Bounded_Operations
(HT_Types => HT_Types,
Hash_Node => Hash_Node,
Next => Next,
Set_Next => Set_Next);
package Key_Ops is
new Hash_Tables.Generic_Bounded_Keys
(HT_Types => HT_Types,
Next => Next,
Set_Next => Set_Next,
Key_Type => Key_Type,
Hash => Hash,
Equivalent_Keys => Equivalent_Keys);
---------
-- "=" --
---------
function "=" (Left, Right : Map) return Boolean is
begin
if Length (Left) /= Length (Right) then
return False;
end if;
if Length (Left) = 0 then
return True;
end if;
declare
Node : Count_Type;
ENode : Count_Type;
begin
Node := First (Left).Node;
while Node /= 0 loop
ENode :=
Find
(Container => Right,
Key => Left.Content.Nodes (Node).Key).Node;
if ENode = 0 or else
Right.Content.Nodes (ENode).Element /=
Left.Content.Nodes (Node).Element
then
return False;
end if;
Node := HT_Ops.Next (Left.Content, Node);
end loop;
return True;
end;
end "=";
------------
-- Assign --
------------
procedure Assign (Target : in out Map; Source : Map) is
procedure Insert_Element (Source_Node : Count_Type);
pragma Inline (Insert_Element);
procedure Insert_Elements is
new HT_Ops.Generic_Iteration (Insert_Element);
--------------------
-- Insert_Element --
--------------------
procedure Insert_Element (Source_Node : Count_Type) is
N : Node_Type renames Source.Content.Nodes (Source_Node);
begin
Insert (Target, N.Key, N.Element);
end Insert_Element;
-- Start of processing for Assign
begin
if Target'Address = Source'Address then
return;
end if;
if Target.Capacity < Length (Source) then
raise Constraint_Error with -- correct exception ???
"Source length exceeds Target capacity";
end if;
Clear (Target);
Insert_Elements (Source.Content);
end Assign;
--------------
-- Capacity --
--------------
function Capacity (Container : Map) return Count_Type is
begin
return Container.Content.Nodes'Length;
end Capacity;
-----------
-- Clear --
-----------
procedure Clear (Container : in out Map) is
begin
HT_Ops.Clear (Container.Content);
end Clear;
------------------------
-- Constant_Reference --
------------------------
function Constant_Reference
(Container : aliased Map;
Position : Cursor) return not null access constant Element_Type
is
begin
if not Has_Element (Container, Position) then
raise Constraint_Error with "Position cursor has no element";
end if;
pragma Assert
(Vet (Container, Position),
"bad cursor in function Constant_Reference");
return Container.Content.Nodes (Position.Node).Element'Access;
end Constant_Reference;
function Constant_Reference
(Container : aliased Map;
Key : Key_Type) return not null access constant Element_Type
is
Node : constant Count_Type := Find (Container, Key).Node;
begin
if Node = 0 then
raise Constraint_Error with
"no element available because key not in map";
end if;
return Container.Content.Nodes (Node).Element'Access;
end Constant_Reference;
--------------
-- Contains --
--------------
function Contains (Container : Map; Key : Key_Type) return Boolean is
begin
return Find (Container, Key) /= No_Element;
end Contains;
----------
-- Copy --
----------
function Copy
(Source : Map;
Capacity : Count_Type := 0) return Map
is
C : constant Count_Type :=
Count_Type'Max (Capacity, Source.Capacity);
Cu : Cursor;
H : Hash_Type;
N : Count_Type;
Target : Map (C, Source.Modulus);
begin
if 0 < Capacity and then Capacity < Source.Capacity then
raise Capacity_Error;
end if;
Target.Content.Length := Source.Content.Length;
Target.Content.Free := Source.Content.Free;
H := 1;
while H <= Source.Modulus loop
Target.Content.Buckets (H) := Source.Content.Buckets (H);
H := H + 1;
end loop;
N := 1;
while N <= Source.Capacity loop
Target.Content.Nodes (N) := Source.Content.Nodes (N);
N := N + 1;
end loop;
while N <= C loop
Cu := (Node => N);
Free (Target, Cu.Node);
N := N + 1;
end loop;
return Target;
end Copy;
---------------------
-- Default_Modulus --
---------------------
function Default_Modulus (Capacity : Count_Type) return Hash_Type is
begin
return To_Prime (Capacity);
end Default_Modulus;
------------
-- Delete --
------------
procedure Delete (Container : in out Map; Key : Key_Type) is
X : Count_Type;
begin
Key_Ops.Delete_Key_Sans_Free (Container.Content, Key, X);
if X = 0 then
raise Constraint_Error with "attempt to delete key not in map";
end if;
Free (Container, X);
end Delete;
procedure Delete (Container : in out Map; Position : in out Cursor) is
begin
if not Has_Element (Container, Position) then
raise Constraint_Error with
"Position cursor of Delete has no element";
end if;
pragma Assert (Vet (Container, Position), "bad cursor in Delete");
HT_Ops.Delete_Node_Sans_Free (Container.Content, Position.Node);
Free (Container, Position.Node);
Position := No_Element;
end Delete;
-------------
-- Element --
-------------
function Element (Container : Map; Key : Key_Type) return Element_Type is
Node : constant Count_Type := Find (Container, Key).Node;
begin
if Node = 0 then
raise Constraint_Error with
"no element available because key not in map";
end if;
return Container.Content.Nodes (Node).Element;
end Element;
function Element (Container : Map; Position : Cursor) return Element_Type is
begin
if not Has_Element (Container, Position) then
raise Constraint_Error with "Position cursor equals No_Element";
end if;
pragma Assert
(Vet (Container, Position), "bad cursor in function Element");
return Container.Content.Nodes (Position.Node).Element;
end Element;
---------------------
-- Equivalent_Keys --
---------------------
function Equivalent_Keys
(Key : Key_Type;
Node : Node_Type) return Boolean
is
begin
return Equivalent_Keys (Key, Node.Key);
end Equivalent_Keys;
-------------
-- Exclude --
-------------
procedure Exclude (Container : in out Map; Key : Key_Type) is
X : Count_Type;
begin
Key_Ops.Delete_Key_Sans_Free (Container.Content, Key, X);
Free (Container, X);
end Exclude;
----------
-- Find --
----------
function Find (Container : Map; Key : Key_Type) return Cursor is
Node : constant Count_Type := Key_Ops.Find (Container.Content, Key);
begin
if Node = 0 then
return No_Element;
end if;
return (Node => Node);
end Find;
-----------
-- First --
-----------
function First (Container : Map) return Cursor is
Node : constant Count_Type := HT_Ops.First (Container.Content);
begin
if Node = 0 then
return No_Element;
end if;
return (Node => Node);
end First;
------------------
-- Formal_Model --
------------------
package body Formal_Model is
----------
-- Find --
----------
function Find
(Container : K.Sequence;
Key : Key_Type) return Count_Type
is
begin
for I in 1 .. K.Length (Container) loop
if Equivalent_Keys (Key, K.Get (Container, I)) then
return I;
end if;
end loop;
return 0;
end Find;
---------------------
-- K_Keys_Included --
---------------------
function K_Keys_Included
(Left : K.Sequence;
Right : K.Sequence) return Boolean
is
begin
for I in 1 .. K.Length (Left) loop
if not K.Contains (Right, 1, K.Length (Right), K.Get (Left, I))
then
return False;
end if;
end loop;
return True;
end K_Keys_Included;
----------
-- Keys --
----------
function Keys (Container : Map) return K.Sequence is
Position : Count_Type := HT_Ops.First (Container.Content);
R : K.Sequence;
begin
-- Can't use First, Next or Element here, since they depend on models
-- for their postconditions.
while Position /= 0 loop
R := K.Add (R, Container.Content.Nodes (Position).Key);
Position := HT_Ops.Next (Container.Content, Position);
end loop;
return R;
end Keys;
----------------------------
-- Lift_Abstraction_Level --
----------------------------
procedure Lift_Abstraction_Level (Container : Map) is null;
-----------------------
-- Mapping_Preserved --
-----------------------
function Mapping_Preserved
(K_Left : K.Sequence;
K_Right : K.Sequence;
P_Left : P.Map;
P_Right : P.Map) return Boolean
is
begin
for C of P_Left loop
if not P.Has_Key (P_Right, C)
or else P.Get (P_Left, C) > K.Length (K_Left)
or else P.Get (P_Right, C) > K.Length (K_Right)
or else K.Get (K_Left, P.Get (P_Left, C)) /=
K.Get (K_Right, P.Get (P_Right, C))
then
return False;
end if;
end loop;
return True;
end Mapping_Preserved;
-----------
-- Model --
-----------
function Model (Container : Map) return M.Map is
Position : Count_Type := HT_Ops.First (Container.Content);
R : M.Map;
begin
-- Can't use First, Next or Element here, since they depend on models
-- for their postconditions.
while Position /= 0 loop
R :=
M.Add
(Container => R,
New_Key => Container.Content.Nodes (Position).Key,
New_Item => Container.Content.Nodes (Position).Element);
Position := HT_Ops.Next (Container.Content, Position);
end loop;
return R;
end Model;
---------------
-- Positions --
---------------
function Positions (Container : Map) return P.Map is
I : Count_Type := 1;
Position : Count_Type := HT_Ops.First (Container.Content);
R : P.Map;
begin
-- Can't use First, Next or Element here, since they depend on models
-- for their postconditions.
while Position /= 0 loop
R := P.Add (R, (Node => Position), I);
pragma Assert (P.Length (R) = I);
Position := HT_Ops.Next (Container.Content, Position);
I := I + 1;
end loop;
return R;
end Positions;
end Formal_Model;
----------
-- Free --
----------
procedure Free (HT : in out Map; X : Count_Type) is
begin
if X /= 0 then
pragma Assert (X <= HT.Capacity);
HT.Content.Nodes (X).Has_Element := False;
HT_Ops.Free (HT.Content, X);
end if;
end Free;
----------------------
-- Generic_Allocate --
----------------------
procedure Generic_Allocate (HT : in out Map; Node : out Count_Type) is
procedure Allocate is
new HT_Ops.Generic_Allocate (Set_Element);
begin
Allocate (HT.Content, Node);
HT.Content.Nodes (Node).Has_Element := True;
end Generic_Allocate;
-----------------
-- Has_Element --
-----------------
function Has_Element (Container : Map; Position : Cursor) return Boolean is
begin
if Position.Node = 0
or else not Container.Content.Nodes (Position.Node).Has_Element
then
return False;
else
return True;
end if;
end Has_Element;
---------------
-- Hash_Node --
---------------
function Hash_Node (Node : Node_Type) return Hash_Type is
begin
return Hash (Node.Key);
end Hash_Node;
-------------
-- Include --
-------------
procedure Include
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type)
is
Position : Cursor;
Inserted : Boolean;
begin
Insert (Container, Key, New_Item, Position, Inserted);
if not Inserted then
declare
N : Node_Type renames Container.Content.Nodes (Position.Node);
begin
N.Key := Key;
N.Element := New_Item;
end;
end if;
end Include;
------------
-- Insert --
------------
procedure Insert
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean)
is
procedure Assign_Key (Node : in out Node_Type);
pragma Inline (Assign_Key);
function New_Node return Count_Type;
pragma Inline (New_Node);
procedure Local_Insert is
new Key_Ops.Generic_Conditional_Insert (New_Node);
procedure Allocate is
new Generic_Allocate (Assign_Key);
-----------------
-- Assign_Key --
-----------------
procedure Assign_Key (Node : in out Node_Type) is
begin
Node.Key := Key;
Node.Element := New_Item;
end Assign_Key;
--------------
-- New_Node --
--------------
function New_Node return Count_Type is
Result : Count_Type;
begin
Allocate (Container, Result);
return Result;
end New_Node;
-- Start of processing for Insert
begin
Local_Insert (Container.Content, Key, Position.Node, Inserted);
end Insert;
procedure Insert
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type)
is
Position : Cursor;
pragma Unreferenced (Position);
Inserted : Boolean;
begin
Insert (Container, Key, New_Item, Position, Inserted);
if not Inserted then
raise Constraint_Error with "attempt to insert key already in map";
end if;
end Insert;
--------------
-- Is_Empty --
--------------
function Is_Empty (Container : Map) return Boolean is
begin
return Length (Container) = 0;
end Is_Empty;
---------
-- Key --
---------
function Key (Container : Map; Position : Cursor) return Key_Type is
begin
if not Has_Element (Container, Position) then
raise Constraint_Error with
"Position cursor of function Key has no element";
end if;
pragma Assert (Vet (Container, Position), "bad cursor in function Key");
return Container.Content.Nodes (Position.Node).Key;
end Key;
------------
-- Length --
------------
function Length (Container : Map) return Count_Type is
begin
return Container.Content.Length;
end Length;
----------
-- Move --
----------
procedure Move
(Target : in out Map;
Source : in out Map)
is
NN : HT_Types.Nodes_Type renames Source.Content.Nodes;
X : Count_Type;
Y : Count_Type;
begin
if Target'Address = Source'Address then
return;
end if;
if Target.Capacity < Length (Source) then
raise Constraint_Error with -- ???
"Source length exceeds Target capacity";
end if;
Clear (Target);
if Source.Content.Length = 0 then
return;
end if;
X := HT_Ops.First (Source.Content);
while X /= 0 loop
Insert (Target, NN (X).Key, NN (X).Element); -- optimize???
Y := HT_Ops.Next (Source.Content, X);
HT_Ops.Delete_Node_Sans_Free (Source.Content, X);
Free (Source, X);
X := Y;
end loop;
end Move;
----------
-- Next --
----------
function Next (Node : Node_Type) return Count_Type is
begin
return Node.Next;
end Next;
function Next (Container : Map; Position : Cursor) return Cursor is
begin
if Position.Node = 0 then
return No_Element;
end if;
if not Has_Element (Container, Position) then
raise Constraint_Error with "Position has no element";
end if;
pragma Assert (Vet (Container, Position), "bad cursor in function Next");
declare
Node : constant Count_Type :=
HT_Ops.Next (Container.Content, Position.Node);
begin
if Node = 0 then
return No_Element;
end if;
return (Node => Node);
end;
end Next;
procedure Next (Container : Map; Position : in out Cursor) is
begin
Position := Next (Container, Position);
end Next;
---------------
-- Reference --
---------------
function Reference
(Container : not null access Map;
Position : Cursor) return not null access Element_Type
is
begin
if not Has_Element (Container.all, Position) then
raise Constraint_Error with "Position cursor has no element";
end if;
pragma Assert
(Vet (Container.all, Position), "bad cursor in function Reference");
return Container.Content.Nodes (Position.Node).Element'Access;
end Reference;
function Reference
(Container : not null access Map;
Key : Key_Type) return not null access Element_Type
is
Node : constant Count_Type := Find (Container.all, Key).Node;
begin
if Node = 0 then
raise Constraint_Error with
"no element available because key not in map";
end if;
return Container.Content.Nodes (Node).Element'Access;
end Reference;
-------------
-- Replace --
-------------
procedure Replace
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type)
is
Node : constant Count_Type := Key_Ops.Find (Container.Content, Key);
begin
if Node = 0 then
raise Constraint_Error with "attempt to replace key not in map";
end if;
declare
N : Node_Type renames Container.Content.Nodes (Node);
begin
N.Key := Key;
N.Element := New_Item;
end;
end Replace;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Container : in out Map;
Position : Cursor;
New_Item : Element_Type)
is
begin
if not Has_Element (Container, Position) then
raise Constraint_Error with
"Position cursor of Replace_Element has no element";
end if;
pragma Assert
(Vet (Container, Position), "bad cursor in Replace_Element");
Container.Content.Nodes (Position.Node).Element := New_Item;
end Replace_Element;
----------------------
-- Reserve_Capacity --
----------------------
procedure Reserve_Capacity
(Container : in out Map;
Capacity : Count_Type)
is
begin
if Capacity > Container.Capacity then
raise Capacity_Error with "requested capacity is too large";
end if;
end Reserve_Capacity;
--------------
-- Set_Next --
--------------
procedure Set_Next (Node : in out Node_Type; Next : Count_Type) is
begin
Node.Next := Next;
end Set_Next;
---------
-- Vet --
---------
function Vet (Container : Map; Position : Cursor) return Boolean is
begin
if Position.Node = 0 then
return True;
end if;
declare
X : Count_Type;
begin
if Container.Content.Length = 0 then
return False;
end if;
if Container.Capacity = 0 then
return False;
end if;
if Container.Content.Buckets'Length = 0 then
return False;
end if;
if Position.Node > Container.Capacity then
return False;
end if;
if Container.Content.Nodes (Position.Node).Next = Position.Node then
return False;
end if;
X :=
Container.Content.Buckets
(Key_Ops.Index
(Container.Content,
Container.Content.Nodes (Position.Node).Key));
for J in 1 .. Container.Content.Length loop
if X = Position.Node then
return True;
end if;
if X = 0 then
return False;
end if;
if X = Container.Content.Nodes (X).Next then
-- Prevent unnecessary looping
return False;
end if;
X := Container.Content.Nodes (X).Next;
end loop;
return False;
end;
end Vet;
end Ada.Containers.Formal_Hashed_Maps;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="17">
<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>udpTxEngine</name>
<module_structure>Pipeline</module_structure>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>7</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>txUdpDataOut_V_data_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>62</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>txUdpDataOut_V_keep_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>3621216858</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>64</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>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>txUdpDataOut_V_strb_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>192</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>64</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>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>txUdpDataOut_V_last_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>187</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</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>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>txthMetaData</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>187</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>agmdpayloadLenOut</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>184</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_7">
<Value>
<Obj>
<type>1</type>
<id>16</id>
<name>agmdDataOut</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>192</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1024</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>120</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>ute_state_load</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>304</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</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>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>304</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275338800</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>p_Val2_s</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;512, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_512_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;512, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>48</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>p_Val2_1</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;64, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_64_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;64, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276086208</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>180</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>_ln304</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>304</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>304</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4273437280</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>12</count>
<item_version>0</item_version>
<item>181</item>
<item>182</item>
<item>184</item>
<item>185</item>
<item>187</item>
<item>188</item>
<item>190</item>
<item>191</item>
<item>193</item>
<item>194</item>
<item>196</item>
<item>197</item>
</oprand_edges>
<opcode>switch</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.65</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp_9_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>empty</contextFuncName>
<contextNormFuncName>empty</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>empty</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>550</item>
<item>551</item>
<item>552</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>br_ln396</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>396</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>396</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4274835696</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>553</item>
<item>554</item>
<item>555</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>agmdDataOut_read_2</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4273437280</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1024</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>556</item>
<item>557</item>
<item>858</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.15</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>currWord_last_V_1</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>currWord.last.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>558</item>
<item>559</item>
<item>560</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>br_ln398</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>398</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>398</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>561</item>
<item>562</item>
<item>563</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>ute_state_write_ln399</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>399</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>399</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275191152</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>564</item>
<item>565</item>
<item>853</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>br_ln399</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>399</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>399</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276103328</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>566</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>br_ln400</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>400</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>400</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275191152</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>567</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>br_ln401</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>401</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>401</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1701273971</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>568</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>p_Result_14</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;512, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_512_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;512, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276107680</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>224</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>534</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>zext_ln414</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;512, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_512_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;512, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>535</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>84</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>p_Result_15</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;64, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_64_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;64, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>536</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>zext_ln414_1</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;64, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_64_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;64, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1819113532</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>537</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>85</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>txUdpDataOut_V_data_V_write_ln304</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_axi_sdata.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>304</lineNumber>
<contextFuncName>write</contextFuncName>
<contextNormFuncName>write</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_axi_sdata.h</first>
<second>write</second>
</first>
<second>304</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275759888</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>538</item>
<item>539</item>
<item>540</item>
<item>541</item>
<item>542</item>
<item>543</item>
<item>544</item>
<item>545</item>
<item>546</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>86</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>ute_state_write_ln393</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>393</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>393</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>547</item>
<item>548</item>
<item>846</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>br_ln394</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>394</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>394</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275167984</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>549</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>117</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>tmp_2_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>empty</contextFuncName>
<contextNormFuncName>empty</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>empty</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275866688</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>455</item>
<item>456</item>
<item>457</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>br_ln362</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>362</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>362</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>458</item>
<item>459</item>
<item>460</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>agmdDataOut_read_1</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1330007625</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1024</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>461</item>
<item>462</item>
<item>859</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.15</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>currWord_last_V</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>currWord.last.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>176</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>463</item>
<item>464</item>
<item>465</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>trunc_ln674_7</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1931488294</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>224</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>466</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>trunc_ln674_8</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1634038388</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>467</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>trunc_ln674_9</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1769236822</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>288</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>468</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>p_Result_12</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;512, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_512_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;512, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>470</item>
<item>471</item>
<item>472</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>87</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>p_Result_13_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4274833816</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>36</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>473</item>
<item>474</item>
<item>475</item>
<item>476</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>p_Result_13</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;64, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_64_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;64, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>2701618</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>477</item>
<item>478</item>
<item>479</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>88</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>p_Result_15_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1953396066</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>224</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>480</item>
<item>481</item>
<item>482</item>
<item>483</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>p_Result_4</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;512, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_512_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;512, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4273721504</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>484</item>
<item>485</item>
<item>486</item>
<item>487</item>
<item>488</item>
</oprand_edges>
<opcode>partset</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>prevWord_data_V_write_ln414</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;512, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_512_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;512, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275603536</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>489</item>
<item>490</item>
<item>849</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>p_Result_16_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>491</item>
<item>492</item>
<item>493</item>
<item>494</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>p_Result_5</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;64, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_64_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;64, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>495</item>
<item>496</item>
<item>497</item>
<item>498</item>
<item>499</item>
</oprand_edges>
<opcode>partset</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>prevWord_keep_V_write_ln414</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;64, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_64_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;64, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>500</item>
<item>501</item>
<item>850</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>br_ln376</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>376</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>376</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>784</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>502</item>
<item>503</item>
<item>504</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>tmp_7</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>819</lineNumber>
<contextFuncName>operator bool</contextFuncName>
<contextNormFuncName>operator_bool</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator bool</second>
</first>
<second>819</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4294967295</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>505</item>
<item>506</item>
<item>507</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>br_ln377</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>377</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>377</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>176</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>508</item>
<item>509</item>
<item>510</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>ute_state_write_ln381</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>381</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>381</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>514</item>
<item>515</item>
<item>857</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>br_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1936028192</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>516</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>ute_state_write_ln378</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>378</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>378</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1951605309</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>511</item>
<item>512</item>
<item>856</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>br_ln378</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>378</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>378</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1701519394</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>513</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>sendWord_last_V_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sendWord.last.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1129537348</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>517</item>
<item>518</item>
<item>519</item>
<item>520</item>
<item>521</item>
<item>522</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>89</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>txUdpDataOut_V_data_V_write_ln304</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_axi_sdata.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>304</lineNumber>
<contextFuncName>write</contextFuncName>
<contextNormFuncName>write</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_axi_sdata.h</first>
<second>write</second>
</first>
<second>304</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>779315571</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>523</item>
<item>524</item>
<item>525</item>
<item>526</item>
<item>527</item>
<item>528</item>
<item>529</item>
<item>530</item>
<item>531</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>90</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>br_ln385</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>385</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>385</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1869635878</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>532</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>118</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>br_ln386</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>386</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>386</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1948262960</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>533</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>tmp_1_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>empty</contextFuncName>
<contextNormFuncName>empty</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>empty</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276089824</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>271</item>
<item>272</item>
<item>273</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>br_ln316</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>316</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>316</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276089152</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>274</item>
<item>275</item>
<item>276</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>40</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>agmdDataOut_read</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276092456</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1024</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>278</item>
<item>279</item>
<item>860</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.15</m_delay>
<m_topoIndex>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>inputVector_V</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>321</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>inputVector.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276093408</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>280</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>91</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>p_Result_55_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276094672</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>282</item>
<item>283</item>
<item>285</item>
<item>287</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>92</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>trunc_ln674</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276095568</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>288</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>93</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>inputVector_V_1</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>328</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>328</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>inputVector.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>289</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>94</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>p_Result_64_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276096496</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>291</item>
<item>292</item>
<item>294</item>
<item>296</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>95</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>p_Result_64_1_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276099344</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>297</item>
<item>298</item>
<item>300</item>
<item>302</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>96</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>p_Result_64_2_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>303</item>
<item>304</item>
<item>305</item>
<item>306</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>97</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>trunc_ln674_1</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>307</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>98</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name>inputVector_V_2</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>329</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>329</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>inputVector.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1870099557</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>308</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>99</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>105</id>
<name>p_Result_67_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276216016</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>309</item>
<item>310</item>
<item>311</item>
<item>312</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>100</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name>p_Result_67_1_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>313</item>
<item>314</item>
<item>315</item>
<item>316</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>101</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name>p_Result_67_2_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276218528</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>317</item>
<item>318</item>
<item>319</item>
<item>320</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>102</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>108</id>
<name>trunc_ln674_2</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>321</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>103</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name>tmp_2</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>323</item>
<item>324</item>
<item>326</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>inputVector_V_3</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>331</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>331</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>inputVector.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>327</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>104</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>p_Result_70_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>328</item>
<item>329</item>
<item>330</item>
<item>331</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>105</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name>trunc_ln674_3</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276031040</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>332</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>106</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name>inputVector_V_4</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>332</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>332</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>inputVector.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276041192</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>333</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>107</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>114</id>
<name>p_Result_73_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276043896</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>334</item>
<item>335</item>
<item>336</item>
<item>337</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>108</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name>trunc_ln674_4</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1819113532</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>338</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>109</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name>inputVector_V_5</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>333</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>333</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>inputVector.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276046752</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>339</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>110</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name>p_Result_76_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>340</item>
<item>341</item>
<item>342</item>
<item>343</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>111</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name>trunc_ln674_5</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>344</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>112</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name>trunc_ln674_6</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276044928</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>288</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>345</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>120</id>
<name>p_Result_10</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;512, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_512_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;512, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>21</count>
<item_version>0</item_version>
<item>347</item>
<item>348</item>
<item>350</item>
<item>351</item>
<item>352</item>
<item>353</item>
<item>354</item>
<item>355</item>
<item>356</item>
<item>357</item>
<item>358</item>
<item>359</item>
<item>360</item>
<item>361</item>
<item>362</item>
<item>363</item>
<item>364</item>
<item>366</item>
<item>367</item>
<item>368</item>
<item>370</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>113</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name>p_Result_3_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276065744</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>36</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>372</item>
<item>373</item>
<item>375</item>
<item>377</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>122</id>
<name>p_Result_11</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;64, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_64_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;64, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>379</item>
<item>380</item>
<item>382</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>114</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>123</id>
<name>p_Result_5_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276077360</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>224</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>384</item>
<item>385</item>
<item>387</item>
<item>389</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name>p_Result_s</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;512, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_512_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;512, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>391</item>
<item>392</item>
<item>393</item>
<item>395</item>
<item>397</item>
</oprand_edges>
<opcode>partset</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>125</id>
<name>prevWord_data_V_write_ln414</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;512, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_512_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;512, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276080472</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>398</item>
<item>399</item>
<item>847</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>126</id>
<name>p_Result_7_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276081792</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>401</item>
<item>402</item>
<item>404</item>
<item>406</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name>p_Result_1</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;64, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_64_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;64, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276082848</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>408</item>
<item>409</item>
<item>410</item>
<item>411</item>
<item>413</item>
</oprand_edges>
<opcode>partset</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>128</id>
<name>prevWord_keep_V_write_ln414</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>414</lineNumber>
<contextFuncName>operator=&lt;64, false&gt;</contextFuncName>
<contextNormFuncName>operator_assign_64_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator=&lt;64, false&gt;</second>
</first>
<second>414</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>480</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>414</item>
<item>415</item>
<item>848</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>br_ln346</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>346</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>346</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>39</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>416</item>
<item>417</item>
<item>418</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>131</id>
<name>ute_state_write_ln355</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>355</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>355</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>431</item>
<item>432</item>
<item>852</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>132</id>
<name>br_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275843072</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>433</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>134</id>
<name>tmp_6</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>819</lineNumber>
<contextFuncName>operator bool</contextFuncName>
<contextNormFuncName>operator_bool</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>operator bool</second>
</first>
<second>819</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>28</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>419</item>
<item>420</item>
<item>421</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>54</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name>br_ln347</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>347</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>347</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>176</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>422</item>
<item>423</item>
<item>424</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>55</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>137</id>
<name>ute_state_write_ln351</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>351</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>351</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>428</item>
<item>429</item>
<item>855</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>56</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>138</id>
<name>br_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275852176</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>430</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>57</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>140</id>
<name>ute_state_write_ln348</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>348</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>348</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275853208</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>425</item>
<item>426</item>
<item>854</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>58</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>141</id>
<name>br_ln348</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>348</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>348</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275854600</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>427</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>59</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>143</id>
<name>sendWord_last_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sendWord.last.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>435</item>
<item>436</item>
<item>437</item>
<item>438</item>
<item>440</item>
<item>441</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>115</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_101">
<Value>
<Obj>
<type>0</type>
<id>144</id>
<name>txUdpDataOut_V_data_V_write_ln304</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_axi_sdata.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>304</lineNumber>
<contextFuncName>write</contextFuncName>
<contextNormFuncName>write</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_axi_sdata.h</first>
<second>write</second>
</first>
<second>304</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>176</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>9</count>
<item_version>0</item_version>
<item>443</item>
<item>444</item>
<item>445</item>
<item>446</item>
<item>447</item>
<item>448</item>
<item>449</item>
<item>451</item>
<item>452</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>116</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>145</id>
<name>br_ln359</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>359</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>359</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275857952</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>453</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>119</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>147</id>
<name>br_ln360</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>360</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>360</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275860984</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>454</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>60</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>149</id>
<name>tmp_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>empty</contextFuncName>
<contextNormFuncName>empty</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>empty</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1953394531</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>199</item>
<item>200</item>
<item>202</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>61</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>150</id>
<name>br_ln306</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>306</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>306</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276009408</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>203</item>
<item>204</item>
<item>205</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>62</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_106">
<Value>
<Obj>
<type>0</type>
<id>152</id>
<name>tmp_i_104</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>empty</contextFuncName>
<contextNormFuncName>empty</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>empty</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>207</item>
<item>208</item>
<item>209</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>63</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_107">
<Value>
<Obj>
<type>0</type>
<id>153</id>
<name>br_ln306</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>306</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>306</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276024832</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>210</item>
<item>211</item>
<item>212</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>64</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_108">
<Value>
<Obj>
<type>0</type>
<id>155</id>
<name>txthMetaData_read</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276011888</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>214</item>
<item>215</item>
<item>861</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.15</m_delay>
<m_topoIndex>65</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_109">
<Value>
<Obj>
<type>0</type>
<id>156</id>
<name>trunc_ln145</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>216</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>66</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_110">
<Value>
<Obj>
<type>0</type>
<id>157</id>
<name>currMetaData_theirIP_V_write_ln145</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276011888</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>217</item>
<item>218</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>67</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_111">
<Value>
<Obj>
<type>0</type>
<id>158</id>
<name>trunc_ln145_2</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276027696</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>220</item>
<item>221</item>
<item>223</item>
<item>225</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>68</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_112">
<Value>
<Obj>
<type>0</type>
<id>159</id>
<name>currMetaData_myIP_V_write_ln145</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>226</item>
<item>227</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>69</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_113">
<Value>
<Obj>
<type>0</type>
<id>160</id>
<name>trunc_ln145_3</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276011904</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>229</item>
<item>230</item>
<item>232</item>
<item>234</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>70</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_114">
<Value>
<Obj>
<type>0</type>
<id>161</id>
<name>currMetaData_theirPort_V_write_ln145</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276031696</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>235</item>
<item>236</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>71</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_115">
<Value>
<Obj>
<type>0</type>
<id>162</id>
<name>trunc_ln145_4</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276034008</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>237</item>
<item>238</item>
<item>240</item>
<item>242</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>72</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_116">
<Value>
<Obj>
<type>0</type>
<id>163</id>
<name>currMetaData_myPort_V_write_ln145</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276032136</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>243</item>
<item>244</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>73</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_117">
<Value>
<Obj>
<type>0</type>
<id>164</id>
<name>tmp_5</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276035440</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>246</item>
<item>247</item>
<item>249</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>74</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_118">
<Value>
<Obj>
<type>0</type>
<id>165</id>
<name>currLen_V</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>currLen.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276037216</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>251</item>
<item>252</item>
<item>862</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.15</m_delay>
<m_topoIndex>75</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_119">
<Value>
<Obj>
<type>0</type>
<id>166</id>
<name>add_ln223</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>223</lineNumber>
<contextFuncName>ap_uint&lt;34&gt;</contextFuncName>
<contextNormFuncName>ap_uint_34_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int.h</first>
<second>ap_uint&lt;34&gt;</second>
</first>
<second>223</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276038464</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>253</item>
<item>255</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.78</m_delay>
<m_topoIndex>76</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_120">
<Value>
<Obj>
<type>0</type>
<id>167</id>
<name>ip_len_V_write_ln310</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>310</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>310</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276057488</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>256</item>
<item>257</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>77</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_121">
<Value>
<Obj>
<type>0</type>
<id>168</id>
<name>add_ln223_1</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>223</lineNumber>
<contextFuncName>ap_uint&lt;33&gt;</contextFuncName>
<contextNormFuncName>ap_uint_33_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int.h</first>
<second>ap_uint&lt;33&gt;</second>
</first>
<second>223</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>204</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>258</item>
<item>260</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.78</m_delay>
<m_topoIndex>78</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_122">
<Value>
<Obj>
<type>0</type>
<id>169</id>
<name>udp_len_V_write_ln311</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>311</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>311</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>261</item>
<item>262</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>79</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_123">
<Value>
<Obj>
<type>0</type>
<id>170</id>
<name>select_ln312</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>312</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>312</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276062272</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>263</item>
<item>264</item>
<item>265</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.27</m_delay>
<m_topoIndex>80</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_124">
<Value>
<Obj>
<type>0</type>
<id>171</id>
<name>ute_state_write_ln312</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>312</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>312</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276063272</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>266</item>
<item>267</item>
<item>851</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>81</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_125">
<Value>
<Obj>
<type>0</type>
<id>172</id>
<name>br_ln313</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>313</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>313</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>268</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>82</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_126">
<Value>
<Obj>
<type>0</type>
<id>174</id>
<name>br_ln314</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>314</lineNumber>
<contextFuncName>udpTxEngine</contextFuncName>
<contextNormFuncName>udpTxEngine</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/UDP/udp.cpp</first>
<second>udpTxEngine</second>
</first>
<second>314</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>176</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>269</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>83</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_127">
<Value>
<Obj>
<type>0</type>
<id>176</id>
<name>_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276067776</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>120</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>38</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_128">
<Value>
<Obj>
<type>2</type>
<id>183</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276097600</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_129">
<Value>
<Obj>
<type>2</type>
<id>186</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>176</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_130">
<Value>
<Obj>
<type>2</type>
<id>189</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276069648</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_131">
<Value>
<Obj>
<type>2</type>
<id>192</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_132">
<Value>
<Obj>
<type>2</type>
<id>195</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276070400</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_133">
<Value>
<Obj>
<type>2</type>
<id>201</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276071504</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_134">
<Value>
<Obj>
<type>2</type>
<id>222</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276069232</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_135">
<Value>
<Obj>
<type>2</type>
<id>224</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276072576</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>63</content>
</item>
<item class_id_reference="16" object_id="_136">
<Value>
<Obj>
<type>2</type>
<id>231</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275372672</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_137">
<Value>
<Obj>
<type>2</type>
<id>233</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275373392</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>79</content>
</item>
<item class_id_reference="16" object_id="_138">
<Value>
<Obj>
<type>2</type>
<id>239</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275373632</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>80</content>
</item>
<item class_id_reference="16" object_id="_139">
<Value>
<Obj>
<type>2</type>
<id>241</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275374240</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>95</content>
</item>
<item class_id_reference="16" object_id="_140">
<Value>
<Obj>
<type>2</type>
<id>248</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1667331187</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>96</content>
</item>
<item class_id_reference="16" object_id="_141">
<Value>
<Obj>
<type>2</type>
<id>254</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275377856</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>28</content>
</item>
<item class_id_reference="16" object_id="_142">
<Value>
<Obj>
<type>2</type>
<id>259</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275376688</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_143">
<Value>
<Obj>
<type>2</type>
<id>284</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275376752</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_144">
<Value>
<Obj>
<type>2</type>
<id>286</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275377264</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>15</content>
</item>
<item class_id_reference="16" object_id="_145">
<Value>
<Obj>
<type>2</type>
<id>293</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>24</content>
</item>
<item class_id_reference="16" object_id="_146">
<Value>
<Obj>
<type>2</type>
<id>295</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>31</content>
</item>
<item class_id_reference="16" object_id="_147">
<Value>
<Obj>
<type>2</type>
<id>299</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1966088236</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_148">
<Value>
<Obj>
<type>2</type>
<id>301</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1966040429</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>23</content>
</item>
<item class_id_reference="16" object_id="_149">
<Value>
<Obj>
<type>2</type>
<id>325</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>576</content>
</item>
<item class_id_reference="16" object_id="_150">
<Value>
<Obj>
<type>2</type>
<id>349</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275382752</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_151">
<Value>
<Obj>
<type>2</type>
<id>365</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>448</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>18966575579136</content>
</item>
<item class_id_reference="16" object_id="_152">
<Value>
<Obj>
<type>2</type>
<id>369</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275385792</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>69</content>
</item>
<item class_id_reference="16" object_id="_153">
<Value>
<Obj>
<type>2</type>
<id>374</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275386400</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>512</content>
</item>
<item class_id_reference="16" object_id="_154">
<Value>
<Obj>
<type>2</type>
<id>376</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275387008</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>547</content>
</item>
<item class_id_reference="16" object_id="_155">
<Value>
<Obj>
<type>2</type>
<id>381</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275387280</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<const_type>0</const_type>
<content>268435455</content>
</item>
<item class_id_reference="16" object_id="_156">
<Value>
<Obj>
<type>2</type>
<id>386</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>288</content>
</item>
<item class_id_reference="16" object_id="_157">
<Value>
<Obj>
<type>2</type>
<id>388</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>511</content>
</item>
<item class_id_reference="16" object_id="_158">
<Value>
<Obj>
<type>2</type>
<id>394</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_159">
<Value>
<Obj>
<type>2</type>
<id>396</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>223</content>
</item>
<item class_id_reference="16" object_id="_160">
<Value>
<Obj>
<type>2</type>
<id>403</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>608</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>548</content>
</item>
<item class_id_reference="16" object_id="_161">
<Value>
<Obj>
<type>2</type>
<id>405</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>742093927</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>575</content>
</item>
<item class_id_reference="16" object_id="_162">
<Value>
<Obj>
<type>2</type>
<id>412</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>27</content>
</item>
<item class_id_reference="16" object_id="_163">
<Value>
<Obj>
<type>2</type>
<id>434</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275342864</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_164">
<Value>
<Obj>
<type>2</type>
<id>439</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_165">
<Value>
<Obj>
<type>2</type>
<id>450</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>542329928</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>5</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>27</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_166">
<Obj>
<type>3</type>
<id>35</id>
<name>entry</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>448</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_167">
<Obj>
<type>3</type>
<id>38</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4273437280</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>37</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_168">
<Obj>
<type>3</type>
<id>42</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4274878784</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>39</item>
<item>40</item>
<item>41</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_169">
<Obj>
<type>3</type>
<id>45</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4273721808</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>44</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_170">
<Obj>
<type>3</type>
<id>47</id>
<name>._crit_edge34.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276093712</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_171">
<Obj>
<type>3</type>
<id>49</id>
<name>._crit_edge33.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_172">
<Obj>
<type>3</type>
<id>57</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275190704</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_173">
<Obj>
<type>3</type>
<id>60</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275864160</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>58</item>
<item>59</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_174">
<Obj>
<type>3</type>
<id>76</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>15</count>
<item_version>0</item_version>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_175">
<Obj>
<type>3</type>
<id>79</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275591032</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>77</item>
<item>78</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_176">
<Obj>
<type>3</type>
<id>82</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275594072</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>80</item>
<item>81</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_177">
<Obj>
<type>3</type>
<id>85</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1397508130</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>83</item>
<item>84</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_178">
<Obj>
<type>3</type>
<id>89</id>
<name>._crit_edge32.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1599296852</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>86</item>
<item>87</item>
<item>88</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_179">
<Obj>
<type>3</type>
<id>91</id>
<name>._crit_edge31.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>539119430</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_180">
<Obj>
<type>3</type>
<id>94</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276078816</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>92</item>
<item>93</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_181">
<Obj>
<type>3</type>
<id>130</id>
<name>.split57.0.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>6775040</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>35</count>
<item_version>0</item_version>
<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>
<item>113</item>
<item>114</item>
<item>115</item>
<item>116</item>
<item>117</item>
<item>118</item>
<item>119</item>
<item>120</item>
<item>121</item>
<item>122</item>
<item>123</item>
<item>124</item>
<item>125</item>
<item>126</item>
<item>127</item>
<item>128</item>
<item>129</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_182">
<Obj>
<type>3</type>
<id>133</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276088936</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>131</item>
<item>132</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_183">
<Obj>
<type>3</type>
<id>136</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>2182</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_184">
<Obj>
<type>3</type>
<id>139</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>137</item>
<item>138</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_185">
<Obj>
<type>3</type>
<id>142</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1330010203</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>140</item>
<item>141</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_186">
<Obj>
<type>3</type>
<id>146</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275855120</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>143</item>
<item>144</item>
<item>145</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_187">
<Obj>
<type>3</type>
<id>148</id>
<name>._crit_edge30.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4274577152</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>147</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_188">
<Obj>
<type>3</type>
<id>151</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4275862864</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>149</item>
<item>150</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_189">
<Obj>
<type>3</type>
<id>154</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276021080</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>152</item>
<item>153</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_190">
<Obj>
<type>3</type>
<id>173</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>18</count>
<item_version>0</item_version>
<item>155</item>
<item>156</item>
<item>157</item>
<item>158</item>
<item>159</item>
<item>160</item>
<item>161</item>
<item>162</item>
<item>163</item>
<item>164</item>
<item>165</item>
<item>166</item>
<item>167</item>
<item>168</item>
<item>169</item>
<item>170</item>
<item>171</item>
<item>172</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_191">
<Obj>
<type>3</type>
<id>175</id>
<name>._crit_edge28.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276064224</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>174</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_192">
<Obj>
<type>3</type>
<id>177</id>
<name>udpTxEngine.exit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>4276059008</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>176</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>344</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_193">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_195">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>182</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>185</id>
<edge_type>2</edge_type>
<source_obj>151</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>188</id>
<edge_type>2</edge_type>
<source_obj>94</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>189</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>191</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>194</id>
<edge_type>2</edge_type>
<source_obj>57</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>195</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>197</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>204</id>
<edge_type>2</edge_type>
<source_obj>175</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>205</id>
<edge_type>2</edge_type>
<source_obj>154</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>152</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>152</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>152</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>211</id>
<edge_type>2</edge_type>
<source_obj>175</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>212</id>
<edge_type>2</edge_type>
<source_obj>173</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>156</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>157</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>157</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>222</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>224</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>158</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>231</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>233</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>160</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>239</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>241</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>248</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>165</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>165</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>166</source_obj>
<sink_obj>167</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>167</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>165</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>259</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>261</id>
<edge_type>1</edge_type>
<source_obj>168</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_247">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>264</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>195</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_251">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>171</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_252">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>171</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_253">
<id>268</id>
<edge_type>2</edge_type>
<source_obj>175</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>269</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>174</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>273</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_258">
<id>275</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_259">
<id>276</id>
<edge_type>2</edge_type>
<source_obj>130</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>279</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_262">
<id>283</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_263">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>284</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_264">
<id>287</id>
<edge_type>1</edge_type>
<source_obj>286</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_265">
<id>288</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_266">
<id>289</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_267">
<id>292</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_268">
<id>294</id>
<edge_type>1</edge_type>
<source_obj>293</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_269">
<id>296</id>
<edge_type>1</edge_type>
<source_obj>295</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_270">
<id>298</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_271">
<id>300</id>
<edge_type>1</edge_type>
<source_obj>299</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_272">
<id>302</id>
<edge_type>1</edge_type>
<source_obj>301</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_273">
<id>304</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_274">
<id>305</id>
<edge_type>1</edge_type>
<source_obj>284</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_275">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>286</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_276">
<id>307</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_277">
<id>308</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_278">
<id>310</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_279">
<id>311</id>
<edge_type>1</edge_type>
<source_obj>293</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_280">
<id>312</id>
<edge_type>1</edge_type>
<source_obj>295</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_281">
<id>314</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_282">
<id>315</id>
<edge_type>1</edge_type>
<source_obj>299</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_283">
<id>316</id>
<edge_type>1</edge_type>
<source_obj>301</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_284">
<id>318</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_285">
<id>319</id>
<edge_type>1</edge_type>
<source_obj>284</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_286">
<id>320</id>
<edge_type>1</edge_type>
<source_obj>286</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_287">
<id>321</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_288">
<id>324</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_289">
<id>326</id>
<edge_type>1</edge_type>
<source_obj>325</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_290">
<id>327</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_291">
<id>329</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_292">
<id>330</id>
<edge_type>1</edge_type>
<source_obj>284</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_293">
<id>331</id>
<edge_type>1</edge_type>
<source_obj>286</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_294">
<id>332</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_295">
<id>333</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_296">
<id>335</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_297">
<id>336</id>
<edge_type>1</edge_type>
<source_obj>284</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_298">
<id>337</id>
<edge_type>1</edge_type>
<source_obj>286</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_299">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_300">
<id>339</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_301">
<id>341</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_302">
<id>342</id>
<edge_type>1</edge_type>
<source_obj>284</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_303">
<id>343</id>
<edge_type>1</edge_type>
<source_obj>286</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_304">
<id>344</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_305">
<id>345</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_306">
<id>348</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_307">
<id>350</id>
<edge_type>1</edge_type>
<source_obj>349</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_308">
<id>351</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_309">
<id>352</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_310">
<id>353</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_311">
<id>354</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_312">
<id>355</id>
<edge_type>1</edge_type>
<source_obj>112</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_313">
<id>356</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_314">
<id>357</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_315">
<id>358</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_316">
<id>359</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_317">
<id>360</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_318">
<id>361</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_319">
<id>362</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_320">
<id>363</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_321">
<id>364</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_322">
<id>366</id>
<edge_type>1</edge_type>
<source_obj>365</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_323">
<id>367</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_324">
<id>368</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_325">
<id>370</id>
<edge_type>1</edge_type>
<source_obj>369</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_326">
<id>373</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_327">
<id>375</id>
<edge_type>1</edge_type>
<source_obj>374</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_328">
<id>377</id>
<edge_type>1</edge_type>
<source_obj>376</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_329">
<id>380</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_330">
<id>382</id>
<edge_type>1</edge_type>
<source_obj>381</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_331">
<id>385</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_332">
<id>387</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_333">
<id>389</id>
<edge_type>1</edge_type>
<source_obj>388</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_334">
<id>392</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_335">
<id>393</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_336">
<id>395</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_337">
<id>397</id>
<edge_type>1</edge_type>
<source_obj>396</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_338">
<id>398</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_339">
<id>399</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_340">
<id>402</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_341">
<id>404</id>
<edge_type>1</edge_type>
<source_obj>403</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_342">
<id>406</id>
<edge_type>1</edge_type>
<source_obj>405</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_343">
<id>409</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_344">
<id>410</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_345">
<id>411</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_346">
<id>413</id>
<edge_type>1</edge_type>
<source_obj>412</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_347">
<id>414</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_348">
<id>415</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_349">
<id>416</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_350">
<id>417</id>
<edge_type>2</edge_type>
<source_obj>133</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_351">
<id>418</id>
<edge_type>2</edge_type>
<source_obj>136</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_352">
<id>420</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_353">
<id>421</id>
<edge_type>1</edge_type>
<source_obj>403</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_354">
<id>422</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_355">
<id>423</id>
<edge_type>2</edge_type>
<source_obj>139</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_356">
<id>424</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_357">
<id>425</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_358">
<id>426</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_359">
<id>427</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_360">
<id>428</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_361">
<id>429</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_362">
<id>430</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_363">
<id>431</id>
<edge_type>1</edge_type>
<source_obj>189</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_364">
<id>432</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_365">
<id>433</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_366">
<id>435</id>
<edge_type>1</edge_type>
<source_obj>434</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_367">
<id>436</id>
<edge_type>2</edge_type>
<source_obj>133</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_368">
<id>437</id>
<edge_type>1</edge_type>
<source_obj>434</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_369">
<id>438</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_370">
<id>440</id>
<edge_type>1</edge_type>
<source_obj>439</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_371">
<id>441</id>
<edge_type>2</edge_type>
<source_obj>139</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_372">
<id>444</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_373">
<id>445</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_374">
<id>446</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_375">
<id>447</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_376">
<id>448</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_377">
<id>449</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_378">
<id>451</id>
<edge_type>1</edge_type>
<source_obj>450</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_379">
<id>452</id>
<edge_type>1</edge_type>
<source_obj>143</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_380">
<id>453</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_381">
<id>454</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_382">
<id>456</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_383">
<id>457</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_384">
<id>458</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_385">
<id>459</id>
<edge_type>2</edge_type>
<source_obj>91</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_386">
<id>460</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_387">
<id>462</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_388">
<id>464</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_389">
<id>465</id>
<edge_type>1</edge_type>
<source_obj>325</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_390">
<id>466</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_391">
<id>467</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_392">
<id>468</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_393">
<id>471</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_394">
<id>472</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_395">
<id>474</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_396">
<id>475</id>
<edge_type>1</edge_type>
<source_obj>374</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_397">
<id>476</id>
<edge_type>1</edge_type>
<source_obj>376</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_398">
<id>478</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_399">
<id>479</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_400">
<id>481</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_401">
<id>482</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_402">
<id>483</id>
<edge_type>1</edge_type>
<source_obj>388</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_403">
<id>485</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_404">
<id>486</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_405">
<id>487</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_406">
<id>488</id>
<edge_type>1</edge_type>
<source_obj>396</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_407">
<id>489</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_408">
<id>490</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_409">
<id>492</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_410">
<id>493</id>
<edge_type>1</edge_type>
<source_obj>403</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_411">
<id>494</id>
<edge_type>1</edge_type>
<source_obj>405</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_412">
<id>496</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_413">
<id>497</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_414">
<id>498</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_415">
<id>499</id>
<edge_type>1</edge_type>
<source_obj>412</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_416">
<id>500</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_417">
<id>501</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_418">
<id>502</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_419">
<id>503</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_420">
<id>504</id>
<edge_type>2</edge_type>
<source_obj>79</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_421">
<id>506</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_422">
<id>507</id>
<edge_type>1</edge_type>
<source_obj>403</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_423">
<id>508</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_424">
<id>509</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_425">
<id>510</id>
<edge_type>2</edge_type>
<source_obj>85</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_426">
<id>511</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_427">
<id>512</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_428">
<id>513</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_429">
<id>514</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_430">
<id>515</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_431">
<id>516</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_432">
<id>517</id>
<edge_type>1</edge_type>
<source_obj>434</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_433">
<id>518</id>
<edge_type>2</edge_type>
<source_obj>85</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_434">
<id>519</id>
<edge_type>1</edge_type>
<source_obj>439</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_435">
<id>520</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_436">
<id>521</id>
<edge_type>1</edge_type>
<source_obj>434</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_437">
<id>522</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_438">
<id>524</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_439">
<id>525</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_440">
<id>526</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_441">
<id>527</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_442">
<id>528</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_443">
<id>529</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_444">
<id>530</id>
<edge_type>1</edge_type>
<source_obj>450</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_445">
<id>531</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_446">
<id>532</id>
<edge_type>2</edge_type>
<source_obj>91</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_447">
<id>533</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_448">
<id>534</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_449">
<id>535</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_450">
<id>536</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_451">
<id>537</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_452">
<id>539</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_453">
<id>540</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_454">
<id>541</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_455">
<id>542</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_456">
<id>543</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_457">
<id>544</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_458">
<id>545</id>
<edge_type>1</edge_type>
<source_obj>450</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_459">
<id>546</id>
<edge_type>1</edge_type>
<source_obj>439</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_460">
<id>547</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_461">
<id>548</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_462">
<id>549</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_463">
<id>551</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_464">
<id>552</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_465">
<id>553</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_466">
<id>554</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_467">
<id>555</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_468">
<id>557</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_469">
<id>559</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_470">
<id>560</id>
<edge_type>1</edge_type>
<source_obj>325</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_471">
<id>561</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_472">
<id>562</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_473">
<id>563</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_474">
<id>564</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_475">
<id>565</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_476">
<id>566</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_477">
<id>567</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_478">
<id>568</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_479">
<id>805</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_480">
<id>806</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_481">
<id>807</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_482">
<id>808</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_483">
<id>809</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_484">
<id>810</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_485">
<id>811</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_486">
<id>812</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_487">
<id>813</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_488">
<id>814</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_489">
<id>815</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_490">
<id>816</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_491">
<id>817</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_492">
<id>818</id>
<edge_type>2</edge_type>
<source_obj>57</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_493">
<id>819</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_494">
<id>820</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_495">
<id>821</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_496">
<id>822</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_497">
<id>823</id>
<edge_type>2</edge_type>
<source_obj>79</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_498">
<id>824</id>
<edge_type>2</edge_type>
<source_obj>79</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_499">
<id>825</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_500">
<id>826</id>
<edge_type>2</edge_type>
<source_obj>85</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_501">
<id>827</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_502">
<id>828</id>
<edge_type>2</edge_type>
<source_obj>91</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_503">
<id>829</id>
<edge_type>2</edge_type>
<source_obj>94</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_504">
<id>830</id>
<edge_type>2</edge_type>
<source_obj>94</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_505">
<id>831</id>
<edge_type>2</edge_type>
<source_obj>130</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_506">
<id>832</id>
<edge_type>2</edge_type>
<source_obj>130</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_507">
<id>833</id>
<edge_type>2</edge_type>
<source_obj>133</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_508">
<id>834</id>
<edge_type>2</edge_type>
<source_obj>136</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_509">
<id>835</id>
<edge_type>2</edge_type>
<source_obj>136</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_510">
<id>836</id>
<edge_type>2</edge_type>
<source_obj>139</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_511">
<id>837</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_512">
<id>838</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_513">
<id>839</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_514">
<id>840</id>
<edge_type>2</edge_type>
<source_obj>151</source_obj>
<sink_obj>154</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_515">
<id>841</id>
<edge_type>2</edge_type>
<source_obj>151</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_516">
<id>842</id>
<edge_type>2</edge_type>
<source_obj>154</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_517">
<id>843</id>
<edge_type>2</edge_type>
<source_obj>154</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_518">
<id>844</id>
<edge_type>2</edge_type>
<source_obj>173</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_519">
<id>845</id>
<edge_type>2</edge_type>
<source_obj>175</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_520">
<id>846</id>
<edge_type>4</edge_type>
<source_obj>31</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_521">
<id>847</id>
<edge_type>4</edge_type>
<source_obj>32</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_522">
<id>848</id>
<edge_type>4</edge_type>
<source_obj>33</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_523">
<id>849</id>
<edge_type>4</edge_type>
<source_obj>32</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_524">
<id>850</id>
<edge_type>4</edge_type>
<source_obj>33</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_525">
<id>851</id>
<edge_type>4</edge_type>
<source_obj>31</source_obj>
<sink_obj>171</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_526">
<id>852</id>
<edge_type>4</edge_type>
<source_obj>31</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_527">
<id>853</id>
<edge_type>4</edge_type>
<source_obj>31</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_528">
<id>854</id>
<edge_type>4</edge_type>
<source_obj>31</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_529">
<id>855</id>
<edge_type>4</edge_type>
<source_obj>31</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_530">
<id>856</id>
<edge_type>4</edge_type>
<source_obj>31</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_531">
<id>857</id>
<edge_type>4</edge_type>
<source_obj>31</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_532">
<id>858</id>
<edge_type>4</edge_type>
<source_obj>36</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_533">
<id>859</id>
<edge_type>4</edge_type>
<source_obj>58</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_534">
<id>860</id>
<edge_type>4</edge_type>
<source_obj>92</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_535">
<id>861</id>
<edge_type>4</edge_type>
<source_obj>149</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_536">
<id>862</id>
<edge_type>4</edge_type>
<source_obj>152</source_obj>
<sink_obj>165</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_537">
<mId>1</mId>
<mTag>udpTxEngine</mTag>
<mNormTag>udpTxEngine</mNormTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>27</count>
<item_version>0</item_version>
<item>35</item>
<item>38</item>
<item>42</item>
<item>45</item>
<item>47</item>
<item>49</item>
<item>57</item>
<item>60</item>
<item>76</item>
<item>79</item>
<item>82</item>
<item>85</item>
<item>89</item>
<item>91</item>
<item>94</item>
<item>130</item>
<item>133</item>
<item>136</item>
<item>139</item>
<item>142</item>
<item>146</item>
<item>148</item>
<item>151</item>
<item>154</item>
<item>173</item>
<item>175</item>
<item>177</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2</mMinLatency>
<mMaxLatency>2</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>120</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>31</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>1</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>1</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>126</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>127</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>128</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>129</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>132</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>134</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>137</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>138</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>140</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>141</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>143</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>144</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>145</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>147</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>149</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>150</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>152</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>153</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>155</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>156</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>157</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>158</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>159</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>160</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>161</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>162</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>163</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>164</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>165</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>166</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>167</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>168</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>169</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>170</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>171</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>172</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>174</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>176</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>27</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>35</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>0</first>
<second>2</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>0</first>
<second>2</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>130</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>133</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>139</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>142</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>146</first>
<second>
<first>0</first>
<second>2</second>
</second>
</item>
<item>
<first>148</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>151</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>154</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>173</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>175</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>177</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_538">
<region_name>udpTxEngine</region_name>
<basic_blocks>
<count>27</count>
<item_version>0</item_version>
<item>35</item>
<item>38</item>
<item>42</item>
<item>45</item>
<item>47</item>
<item>49</item>
<item>57</item>
<item>60</item>
<item>76</item>
<item>79</item>
<item>82</item>
<item>85</item>
<item>89</item>
<item>91</item>
<item>94</item>
<item>130</item>
<item>133</item>
<item>136</item>
<item>139</item>
<item>142</item>
<item>146</item>
<item>148</item>
<item>151</item>
<item>154</item>
<item>173</item>
<item>175</item>
<item>177</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>
<mDBIIViolationVec class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</mDBIIViolationVec>
</item>
</regions>
<dp_fu_nodes class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>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="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core>
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
-------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- Copyright (C) 2010, Alexander Senier
-- Copyright (C) 2010, secunet Security Networks AG
-- 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.
-------------------------------------------------------------------------------
-------------------------------------------------------------------------------
-- Base package of libsparkcrypto internal API
-------------------------------------------------------------------------------
package LSC.Internal is
pragma Pure;
end LSC.Internal;
|
-- C35502A.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 THE ATTRIBUTE 'WIDTH' YIELDS THE CORRECT RESULTS
-- WHEN THE PREFIX IS AN ENUMERATION TYPE OTHER THAN A BOOLEAN OR
-- A CHARACTER TYPE.
-- RJW 5/05/86
WITH REPORT; USE REPORT;
PROCEDURE C35502A IS
BEGIN
TEST( "C35502A" , "CHECK THAT THE ATTRIBUTE 'WIDTH' YIELDS " &
"THE CORRECT RESULTS WHEN THE PREFIX " &
"IS AN ENUMERATION TYPE OTHER THAN " &
"A BOOLEAN OR A CHARACTER TYPE" );
DECLARE
TYPE ENUM IS (A, BC, ABC, A_B_C, ABCD);
SUBTYPE SUBENUM IS ENUM RANGE A .. ABC;
SUBTYPE NOENUM IS ENUM RANGE ABC .. A;
TYPE NEWENUM IS NEW ENUM;
BEGIN
IF ENUM'WIDTH /= IDENT_INT(5) THEN
FAILED( "INCORRECT WIDTH FOR ENUM" );
END IF;
IF NEWENUM'WIDTH /= IDENT_INT(5) THEN
FAILED( "INCORRECT WIDTH FOR NEWENUM" );
END IF;
IF SUBENUM'WIDTH /= IDENT_INT(3) THEN
FAILED( "INCORRECT WIDTH FOR SUBENUM" );
END IF;
IF NOENUM'WIDTH /= IDENT_INT(0) THEN
FAILED( "INCORRECT WIDTH FOR NOENUM" );
END IF;
END;
RESULT;
END C35502A;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2019, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package SAM.DMAC.Sources is
DISABLE : constant Trigger_Source := 16#00#;
RTC_TIMESTAMP : constant Trigger_Source := 16#01#;
DSU_DCC0 : constant Trigger_Source := 16#02#;
DSU_DCC1 : constant Trigger_Source := 16#03#;
SERCOM0_RX : constant Trigger_Source := 16#04#;
SERCOM0_TX : constant Trigger_Source := 16#05#;
SERCOM1_RX : constant Trigger_Source := 16#06#;
SERCOM1_TX : constant Trigger_Source := 16#07#;
SERCOM2_RX : constant Trigger_Source := 16#08#;
SERCOM2_TX : constant Trigger_Source := 16#09#;
SERCOM3_RX : constant Trigger_Source := 16#0A#;
SERCOM3_TX : constant Trigger_Source := 16#0B#;
SERCOM4_RX : constant Trigger_Source := 16#0C#;
SERCOM4_TX : constant Trigger_Source := 16#0D#;
SERCOM5_RX : constant Trigger_Source := 16#0E#;
SERCOM5_TX : constant Trigger_Source := 16#0F#;
SERCOM6_RX : constant Trigger_Source := 16#10#;
SERCOM6_TX : constant Trigger_Source := 16#11#;
SERCOM7_RX : constant Trigger_Source := 16#12#;
SERCOM7_TX : constant Trigger_Source := 16#13#;
CAN0_DEBUG : constant Trigger_Source := 16#14#;
CAN1_DEBUG : constant Trigger_Source := 16#15#;
TCC0_OVF : constant Trigger_Source := 16#16#;
TCC0_MC0 : constant Trigger_Source := 16#17#;
TCC0_MC1 : constant Trigger_Source := 16#18#;
TCC0_MC2 : constant Trigger_Source := 16#19#;
TCC0_MC3 : constant Trigger_Source := 16#1A#;
TCC0_MC4 : constant Trigger_Source := 16#1B#;
TCC0_MC5 : constant Trigger_Source := 16#1C#;
TCC1_OVF : constant Trigger_Source := 16#1D#;
TCC1_MC0 : constant Trigger_Source := 16#1E#;
TCC1_MC1 : constant Trigger_Source := 16#1F#;
TCC1_MC2 : constant Trigger_Source := 16#20#;
TCC1_MC3 : constant Trigger_Source := 16#21#;
TCC2_OVF : constant Trigger_Source := 16#22#;
TCC2_MC0 : constant Trigger_Source := 16#23#;
TCC2_MC1 : constant Trigger_Source := 16#24#;
TCC2_MC2 : constant Trigger_Source := 16#25#;
TCC3_OVF : constant Trigger_Source := 16#26#;
TCC3_MC0 : constant Trigger_Source := 16#27#;
TCC3_MC1 : constant Trigger_Source := 16#28#;
TCC4_OVF : constant Trigger_Source := 16#29#;
TCC4_MC0 : constant Trigger_Source := 16#2A#;
TCC4_MC1 : constant Trigger_Source := 16#2B#;
TC0_OVF : constant Trigger_Source := 16#2C#;
TC0_MC0 : constant Trigger_Source := 16#2D#;
TC0_MC1 : constant Trigger_Source := 16#2E#;
TC1_OVF : constant Trigger_Source := 16#2F#;
TC1_MC0 : constant Trigger_Source := 16#30#;
TC1_MC1 : constant Trigger_Source := 16#31#;
TC2_OVF : constant Trigger_Source := 16#32#;
TC2_MC0 : constant Trigger_Source := 16#33#;
TC2_MC1 : constant Trigger_Source := 16#34#;
TC3_OVF : constant Trigger_Source := 16#35#;
TC3_MC0 : constant Trigger_Source := 16#36#;
TC3_MC1 : constant Trigger_Source := 16#37#;
TC4_OVF : constant Trigger_Source := 16#38#;
TC4_MC0 : constant Trigger_Source := 16#39#;
TC4_MC1 : constant Trigger_Source := 16#3A#;
TC5_OVF : constant Trigger_Source := 16#3B#;
TC5_MC0 : constant Trigger_Source := 16#3C#;
TC5_MC1 : constant Trigger_Source := 16#3D#;
TC6_OVF : constant Trigger_Source := 16#3E#;
TC6_MC0 : constant Trigger_Source := 16#3F#;
TC6_MC1 : constant Trigger_Source := 16#40#;
TC7_OVF : constant Trigger_Source := 16#41#;
TC7_MC0 : constant Trigger_Source := 16#42#;
TC7_MC1 : constant Trigger_Source := 16#43#;
ADC0_RESRDY : constant Trigger_Source := 16#44#;
ADC0_SEQ : constant Trigger_Source := 16#45#;
ADC1_RESRDY : constant Trigger_Source := 16#46#;
ADC1_SEQ : constant Trigger_Source := 16#47#;
DAC_EMPTY_0 : constant Trigger_Source := 16#48#;
DAC_EMPTY_1 : constant Trigger_Source := 16#49#;
DAC_RESRDY_0 : constant Trigger_Source := 16#4A#;
DAC_RESRDY_1 : constant Trigger_Source := 16#4B#;
I2S_RX_Ready_0 : constant Trigger_Source := 16#4C#;
I2S_RX_Ready_1 : constant Trigger_Source := 16#4D#;
I2S_TX_Ready_0 : constant Trigger_Source := 16#4E#;
I2S_TX_Ready_1 : constant Trigger_Source := 16#4F#;
PCC_RX : constant Trigger_Source := 16#50#;
AES_WR : constant Trigger_Source := 16#51#;
AES_RD : constant Trigger_Source := 16#52#;
QSPI_RX : constant Trigger_Source := 16#53#;
QSPI_TX : constant Trigger_Source := 16#54#;
end SAM.DMAC.Sources;
|
with Ada.Integer_Text_IO;
procedure Afficher_Un_Entier (N: in Integer) is
begin
Ada.Integer_Text_IO.Put (N, 1);
end Afficher_Un_Entier;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . T A S K _ S T A C K _ U S A G E --
-- --
-- S p e c --
-- --
-- Copyright (C) 2009-2011, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
------------------------------------------------------------------------------
-- This package provides an API to query for tasks stack usage at runtime
-- and during debug.
-- See file s-stusta.ads for full documentation of the interface
with System.Stack_Usage.Tasking;
package GNAT.Task_Stack_Usage renames System.Stack_Usage.Tasking;
|
-- Copyright 2008-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
type Data_T is (One, Two, Three);
pragma Atomic (Data_T);
Data_Flag : Data_T := One;
procedure Increment is
begin
if Data_Flag = Data_T'Last then
Data_Flag := Data_T'First;
else
Data_Flag := Data_T'Succ (Data_Flag);
end if;
end Increment;
function Is_First return Boolean is
begin
return Data_Flag = Data_T'First;
end Is_First;
end Pck;
|
<?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>linebuffer_1</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>3</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_axi_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_axi_stream.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</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>in_axi_stream_V_last_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_axi_stream.V.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>out_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_stream.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>288</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>in_stream_V_value_V</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>545</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>545</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>in_stream.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>11</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>4</count>
<item_version>0</item_version>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>556</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>556</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
<item>25</item>
<item>107</item>
<item>108</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>557</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>557</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_8">
<Value>
<Obj>
<type>2</type>
<id>15</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_9">
<Value>
<Obj>
<type>2</type>
<id>17</id>
<name>linebuffer_Loop_1_pr</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>
<const_type>6</const_type>
<content><constant:linebuffer_Loop_1_pr></content>
</item>
<item class_id_reference="16" object_id="_10">
<Value>
<Obj>
<type>2</type>
<id>22</id>
<name>linebuffer</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>
<const_type>6</const_type>
<content><constant:linebuffer></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_11">
<Obj>
<type>3</type>
<id>14</id>
<name>linebuffer.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>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>7</item>
<item>11</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_12">
<id>16</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_13">
<id>18</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_14">
<id>19</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_15">
<id>20</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_16">
<id>21</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_17">
<id>23</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_18">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_19">
<id>25</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_20">
<id>107</id>
<edge_type>4</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_21">
<id>108</id>
<edge_type>4</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_22">
<mId>1</mId>
<mTag>linebuffer.1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2077921</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>1</mIsDfPipe>
<mDfPipe class_id="23" tracking_level="1" version="0" object_id="_23">
<port_list class_id="24" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port_list>
<process_list class_id="25" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_24">
<type>0</type>
<name>linebuffer_Loop_1_pr_U0</name>
<ssdmobj_id>11</ssdmobj_id>
<pins class_id="27" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_25">
<port class_id="29" tracking_level="1" version="0" object_id="_26">
<name>in_axi_stream_V_value_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id="30" tracking_level="1" version="0" object_id="_27">
<type>0</type>
<name>linebuffer_Loop_1_pr_U0</name>
<ssdmobj_id>11</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_28">
<port class_id_reference="29" object_id="_29">
<name>in_axi_stream_V_last_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_27"></inst>
</item>
<item class_id_reference="28" object_id="_30">
<port class_id_reference="29" object_id="_31">
<name>in_stream_V_value_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_27"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_32">
<type>0</type>
<name>linebuffer_U0</name>
<ssdmobj_id>12</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_33">
<port class_id_reference="29" object_id="_34">
<name>in_stream_V_value_V</name>
<dir>0</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_35">
<type>0</type>
<name>linebuffer_U0</name>
<ssdmobj_id>12</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_36">
<port class_id_reference="29" object_id="_37">
<name>out_stream_V_value_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_35"></inst>
</item>
</pins>
</item>
</process_list>
<channel_list class_id="31" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="1" version="0" object_id="_38">
<type>1</type>
<name>in_stream_V_value_V</name>
<ssdmobj_id>7</ssdmobj_id>
<ctype>0</ctype>
<depth>1</depth>
<bitwidth>32</bitwidth>
<source class_id_reference="28" object_id="_39">
<port class_id_reference="29" object_id="_40">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_27"></inst>
</source>
<sink class_id_reference="28" object_id="_41">
<port class_id_reference="29" object_id="_42">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_35"></inst>
</sink>
</item>
</channel_list>
<net_list class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</net_list>
</mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="36" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="37" tracking_level="0" version="0">
<first>7</first>
<second class_id="38" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="39" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>14</first>
<second class_id="41" tracking_level="0" version="0">
<first>0</first>
<second>3</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="42" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="1" version="0" object_id="_43">
<region_name>linebuffer.1</region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</basic_blocks>
<nodes>
<count>10</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>16</region_type>
<interval>0</interval>
<pipe_depth>0</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="44" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="45" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="46" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="47" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="48" 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>
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 2 --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 42
package System.Pack_42 is
pragma Preelaborate;
Bits : constant := 42;
type Bits_42 is mod 2 ** Bits;
for Bits_42'Size use Bits;
function Get_42 (Arr : System.Address; N : Natural) return Bits_42;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_42 (Arr : System.Address; N : Natural; E : Bits_42);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
function GetU_42 (Arr : System.Address; N : Natural) return Bits_42;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned. This version
-- is used when Arr may represent an unaligned address.
procedure SetU_42 (Arr : System.Address; N : Natural; E : Bits_42);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value. This version
-- is used when Arr may represent an unaligned address
end System.Pack_42;
|
--------------------------------------------------------------------------------
-- --
-- B B . I D E A L --
-- Ball on Beam Simulator - Ideal interface --
-- --
-- Body --
-- --
-- Ideal interface to the Ball on Beam system. --
-- --
-- Author: Jorge Real --
-- Universitat Politecnica de Valencia --
-- July, 2020 - Version 1 --
-- February, 2021 - Version 2 --
-- --
-- This is free software in the ample sense: you can use it freely, --
-- provided you preserve this comment at the header of source files and --
-- you clearly indicate the changes made to the original file, if any. --
-- --
--------------------------------------------------------------------------------
package body BB.Ideal is
--------------------
-- Set_Beam_Angle --
--------------------
procedure Set_Beam_Angle (Inclination : Angle) renames
BB.Set_Beam_Angle;
-------------------
-- Ball_Position --
-------------------
function Ball_Position return Position renames
BB.Ball_Position;
end BB.Ideal;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ U N S T --
-- --
-- B o d y --
-- --
-- Copyright (C) 2014-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Debug; use Debug;
with Einfo; use Einfo;
with Elists; use Elists;
with Exp_Util; use Exp_Util;
with Lib; use Lib;
with Namet; use Namet;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt;
with Output; use Output;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Ch8; use Sem_Ch8;
with Sem_Mech; use Sem_Mech;
with Sem_Res; use Sem_Res;
with Sem_Util; use Sem_Util;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Snames; use Snames;
with Stand; use Stand;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
package body Exp_Unst is
-----------------------
-- Local Subprograms --
-----------------------
procedure Unnest_Subprogram
(Subp : Entity_Id; Subp_Body : Node_Id; For_Inline : Boolean := False);
-- Subp is a library-level subprogram which has nested subprograms, and
-- Subp_Body is the corresponding N_Subprogram_Body node. This procedure
-- declares the AREC types and objects, adds assignments to the AREC record
-- as required, defines the xxxPTR types for uplevel referenced objects,
-- adds the ARECP parameter to all nested subprograms which need it, and
-- modifies all uplevel references appropriately. If For_Inline is True,
-- we're unnesting this subprogram because it's on the list of inlined
-- subprograms and should unnest it despite it not being part of the main
-- unit.
-----------
-- Calls --
-----------
-- Table to record calls within the nest being analyzed. These are the
-- calls which may need to have an AREC actual added. This table is built
-- new for each subprogram nest and cleared at the end of processing each
-- subprogram nest.
type Call_Entry is record
N : Node_Id;
-- The actual call
Caller : Entity_Id;
-- Entity of the subprogram containing the call (can be at any level)
Callee : Entity_Id;
-- Entity of the subprogram called (always at level 2 or higher). Note
-- that in accordance with the basic rules of nesting, the level of To
-- is either less than or equal to the level of From, or one greater.
end record;
package Calls is new Table.Table (
Table_Component_Type => Call_Entry,
Table_Index_Type => Nat,
Table_Low_Bound => 1,
Table_Initial => 100,
Table_Increment => 200,
Table_Name => "Unnest_Calls");
-- Records each call within the outer subprogram and all nested subprograms
-- that are to other subprograms nested within the outer subprogram. These
-- are the calls that may need an additional parameter.
procedure Append_Unique_Call (Call : Call_Entry);
-- Append a call entry to the Calls table. A check is made to see if the
-- table already contains this entry and if so it has no effect.
----------------------------------
-- Subprograms For Fat Pointers --
----------------------------------
function Build_Access_Type_Decl
(E : Entity_Id;
Scop : Entity_Id) return Node_Id;
-- For an uplevel reference that involves an unconstrained array type,
-- build an access type declaration for the corresponding activation
-- record component. The relevant attributes of the access type are
-- set here to avoid a full analysis that would require a scope stack.
function Needs_Fat_Pointer (E : Entity_Id) return Boolean;
-- A formal parameter of an unconstrained array type that appears in an
-- uplevel reference requires the construction of an access type, to be
-- used in the corresponding component declaration.
-----------
-- Urefs --
-----------
-- Table to record explicit uplevel references to objects (variables,
-- constants, formal parameters). These are the references that will
-- need rewriting to use the activation table (AREC) pointers. Also
-- included are implicit and explicit uplevel references to types, but
-- these do not get rewritten by the front end. This table is built new
-- for each subprogram nest and cleared at the end of processing each
-- subprogram nest.
type Uref_Entry is record
Ref : Node_Id;
-- The reference itself. For objects this is always an entity reference
-- and the referenced entity will have its Is_Uplevel_Referenced_Entity
-- flag set and will appear in the Uplevel_Referenced_Entities list of
-- the subprogram declaring this entity.
Ent : Entity_Id;
-- The Entity_Id of the uplevel referenced object or type
Caller : Entity_Id;
-- The entity for the subprogram immediately containing this entity
Callee : Entity_Id;
-- The entity for the subprogram containing the referenced entity. Note
-- that the level of Callee must be less than the level of Caller, since
-- this is an uplevel reference.
end record;
package Urefs is new Table.Table (
Table_Component_Type => Uref_Entry,
Table_Index_Type => Nat,
Table_Low_Bound => 1,
Table_Initial => 100,
Table_Increment => 200,
Table_Name => "Unnest_Urefs");
------------------------
-- Append_Unique_Call --
------------------------
procedure Append_Unique_Call (Call : Call_Entry) is
begin
for J in Calls.First .. Calls.Last loop
if Calls.Table (J) = Call then
return;
end if;
end loop;
Calls.Append (Call);
end Append_Unique_Call;
-----------------------------
-- Build_Access_Type_Decl --
-----------------------------
function Build_Access_Type_Decl
(E : Entity_Id;
Scop : Entity_Id) return Node_Id
is
Loc : constant Source_Ptr := Sloc (E);
Typ : Entity_Id;
begin
Typ := Make_Temporary (Loc, 'S');
Set_Ekind (Typ, E_General_Access_Type);
Set_Etype (Typ, Typ);
Set_Scope (Typ, Scop);
Set_Directly_Designated_Type (Typ, Etype (E));
return
Make_Full_Type_Declaration (Loc,
Defining_Identifier => Typ,
Type_Definition =>
Make_Access_To_Object_Definition (Loc,
Subtype_Indication => New_Occurrence_Of (Etype (E), Loc)));
end Build_Access_Type_Decl;
---------------
-- Get_Level --
---------------
function Get_Level (Subp : Entity_Id; Sub : Entity_Id) return Nat is
Lev : Nat;
S : Entity_Id;
begin
Lev := 1;
S := Sub;
loop
if S = Subp then
return Lev;
else
Lev := Lev + 1;
S := Enclosing_Subprogram (S);
end if;
end loop;
end Get_Level;
--------------------------
-- In_Synchronized_Unit --
--------------------------
function In_Synchronized_Unit (Subp : Entity_Id) return Boolean is
S : Entity_Id := Scope (Subp);
begin
while Present (S) and then S /= Standard_Standard loop
if Is_Concurrent_Type (S) then
return True;
elsif Is_Private_Type (S)
and then Present (Full_View (S))
and then Is_Concurrent_Type (Full_View (S))
then
return True;
end if;
S := Scope (S);
end loop;
return False;
end In_Synchronized_Unit;
-----------------------
-- Needs_Fat_Pointer --
-----------------------
function Needs_Fat_Pointer (E : Entity_Id) return Boolean is
Typ : Entity_Id := Etype (E);
begin
if Is_Private_Type (Typ) and then Present (Full_View (Typ)) then
Typ := Full_View (Typ);
end if;
return Is_Array_Type (Typ) and then not Is_Constrained (Typ);
end Needs_Fat_Pointer;
----------------
-- Subp_Index --
----------------
function Subp_Index (Sub : Entity_Id) return SI_Type is
E : Entity_Id := Sub;
begin
pragma Assert (Is_Subprogram (E));
if Subps_Index (E) = Uint_0 then
E := Ultimate_Alias (E);
-- The body of a protected operation has a different name and
-- has been scanned at this point, and thus has an entry in the
-- subprogram table.
if E = Sub and then Present (Protected_Body_Subprogram (E)) then
E := Protected_Body_Subprogram (E);
end if;
if Ekind (E) = E_Function
and then Rewritten_For_C (E)
and then Present (Corresponding_Procedure (E))
then
E := Corresponding_Procedure (E);
end if;
end if;
pragma Assert (Subps_Index (E) /= Uint_0);
return SI_Type (UI_To_Int (Subps_Index (E)));
end Subp_Index;
-----------------------
-- Unnest_Subprogram --
-----------------------
procedure Unnest_Subprogram
(Subp : Entity_Id; Subp_Body : Node_Id; For_Inline : Boolean := False) is
function AREC_Name (J : Pos; S : String) return Name_Id;
-- Returns name for string ARECjS, where j is the decimal value of j
function Enclosing_Subp (Subp : SI_Type) return SI_Type;
-- Subp is the index of a subprogram which has a Lev greater than 1.
-- This function returns the index of the enclosing subprogram which
-- will have a Lev value one less than this.
function Img_Pos (N : Pos) return String;
-- Return image of N without leading blank
function Upref_Name
(Ent : Entity_Id;
Index : Pos;
Clist : List_Id) return Name_Id;
-- This function returns the name to be used in the activation record to
-- reference the variable uplevel. Clist is the list of components that
-- have been created in the activation record so far. Normally the name
-- is just a copy of the Chars field of the entity. The exception is
-- when the name has already been used, in which case we suffix the name
-- with the index value Index to avoid duplication. This happens with
-- declare blocks and generic parameters at least.
---------------
-- AREC_Name --
---------------
function AREC_Name (J : Pos; S : String) return Name_Id is
begin
return Name_Find ("AREC" & Img_Pos (J) & S);
end AREC_Name;
--------------------
-- Enclosing_Subp --
--------------------
function Enclosing_Subp (Subp : SI_Type) return SI_Type is
STJ : Subp_Entry renames Subps.Table (Subp);
Ret : constant SI_Type := Subp_Index (Enclosing_Subprogram (STJ.Ent));
begin
pragma Assert (STJ.Lev > 1);
pragma Assert (Subps.Table (Ret).Lev = STJ.Lev - 1);
return Ret;
end Enclosing_Subp;
-------------
-- Img_Pos --
-------------
function Img_Pos (N : Pos) return String is
Buf : String (1 .. 20);
Ptr : Natural;
NV : Nat;
begin
Ptr := Buf'Last;
NV := N;
while NV /= 0 loop
Buf (Ptr) := Character'Val (48 + NV mod 10);
Ptr := Ptr - 1;
NV := NV / 10;
end loop;
return Buf (Ptr + 1 .. Buf'Last);
end Img_Pos;
----------------
-- Upref_Name --
----------------
function Upref_Name
(Ent : Entity_Id;
Index : Pos;
Clist : List_Id) return Name_Id
is
C : Node_Id;
begin
C := First (Clist);
loop
if No (C) then
return Chars (Ent);
elsif Chars (Defining_Identifier (C)) = Chars (Ent) then
return
Name_Find (Get_Name_String (Chars (Ent)) & Img_Pos (Index));
else
Next (C);
end if;
end loop;
end Upref_Name;
-- Start of processing for Unnest_Subprogram
begin
-- Nothing to do inside a generic (all processing is for instance)
if Inside_A_Generic then
return;
end if;
-- If the main unit is a package body then we need to examine the spec
-- to determine whether the main unit is generic (the scope stack is not
-- present when this is called on the main unit).
if not For_Inline
and then Ekind (Cunit_Entity (Main_Unit)) = E_Package_Body
and then Is_Generic_Unit (Spec_Entity (Cunit_Entity (Main_Unit)))
then
return;
-- Only unnest when generating code for the main source unit or if
-- we're unnesting for inline. But in some Annex E cases the Sloc
-- points to a different unit, so also make sure that the Parent
-- isn't in something that we know we're generating code for.
elsif not For_Inline
and then not In_Extended_Main_Code_Unit (Subp_Body)
and then not In_Extended_Main_Code_Unit (Parent (Subp_Body))
then
return;
end if;
-- This routine is called late, after the scope stack is gone. The
-- following creates a suitable dummy scope stack to be used for the
-- analyze/expand calls made from this routine.
Push_Scope (Subp);
-- First step, we must mark all nested subprograms that require a static
-- link (activation record) because either they contain explicit uplevel
-- references (as indicated by Is_Uplevel_Referenced_Entity being set at
-- this point), or they make calls to other subprograms in the same nest
-- that require a static link (in which case we set this flag).
-- This is a recursive definition, and to implement this, we have to
-- build a call graph for the set of nested subprograms, and then go
-- over this graph to implement recursively the invariant that if a
-- subprogram has a call to a subprogram requiring a static link, then
-- the calling subprogram requires a static link.
-- First populate the above tables
Subps_First := Subps.Last + 1;
Calls.Init;
Urefs.Init;
Build_Tables : declare
Current_Subprogram : Entity_Id := Empty;
-- When we scan a subprogram body, we set Current_Subprogram to the
-- corresponding entity. This gets recursively saved and restored.
function Visit_Node (N : Node_Id) return Traverse_Result;
-- Visit a single node in Subp
-----------
-- Visit --
-----------
procedure Visit is new Traverse_Proc (Visit_Node);
-- Used to traverse the body of Subp, populating the tables
----------------
-- Visit_Node --
----------------
function Visit_Node (N : Node_Id) return Traverse_Result is
Ent : Entity_Id;
Caller : Entity_Id;
Callee : Entity_Id;
procedure Check_Static_Type
(In_T : Entity_Id;
N : Node_Id;
DT : in out Boolean;
Check_Designated : Boolean := False);
-- Given a type In_T, checks if it is a static type defined as
-- a type with no dynamic bounds in sight. If so, the only
-- action is to set Is_Static_Type True for In_T. If In_T is
-- not a static type, then all types with dynamic bounds
-- associated with In_T are detected, and their bounds are
-- marked as uplevel referenced if not at the library level,
-- and DT is set True. If N is specified, it's the node that
-- will need to be replaced. If not specified, it means we
-- can't do a replacement because the bound is implicit.
-- If Check_Designated is True and In_T or its full view
-- is an access type, check whether the designated type
-- has dynamic bounds.
procedure Note_Uplevel_Ref
(E : Entity_Id;
N : Node_Id;
Caller : Entity_Id;
Callee : Entity_Id);
-- Called when we detect an explicit or implicit uplevel reference
-- from within Caller to entity E declared in Callee. E can be a
-- an object or a type.
procedure Register_Subprogram (E : Entity_Id; Bod : Node_Id);
-- Enter a subprogram whose body is visible or which is a
-- subprogram instance into the subprogram table.
-----------------------
-- Check_Static_Type --
-----------------------
procedure Check_Static_Type
(In_T : Entity_Id;
N : Node_Id;
DT : in out Boolean;
Check_Designated : Boolean := False)
is
T : constant Entity_Id := Get_Fullest_View (In_T);
procedure Note_Uplevel_Bound (N : Node_Id; Ref : Node_Id);
-- N is the bound of a dynamic type. This procedure notes that
-- this bound is uplevel referenced, it can handle references
-- to entities (typically _FIRST and _LAST entities), and also
-- attribute references of the form T'name (name is typically
-- FIRST or LAST) where T is the uplevel referenced bound.
-- Ref, if Present, is the location of the reference to
-- replace.
------------------------
-- Note_Uplevel_Bound --
------------------------
procedure Note_Uplevel_Bound (N : Node_Id; Ref : Node_Id) is
begin
-- Entity name case. Make sure that the entity is declared
-- in a subprogram. This may not be the case for a type in a
-- loop appearing in a precondition.
-- Exclude explicitly discriminants (that can appear
-- in bounds of discriminated components).
if Is_Entity_Name (N) then
if Present (Entity (N))
and then not Is_Type (Entity (N))
and then Present (Enclosing_Subprogram (Entity (N)))
and then Ekind (Entity (N)) /= E_Discriminant
then
Note_Uplevel_Ref
(E => Entity (N),
N => Empty,
Caller => Current_Subprogram,
Callee => Enclosing_Subprogram (Entity (N)));
end if;
-- Attribute or indexed component case
elsif Nkind (N) in
N_Attribute_Reference | N_Indexed_Component
then
Note_Uplevel_Bound (Prefix (N), Ref);
-- The indices of the indexed components, or the
-- associated expressions of an attribute reference,
-- may also involve uplevel references.
declare
Expr : Node_Id;
begin
Expr := First (Expressions (N));
while Present (Expr) loop
Note_Uplevel_Bound (Expr, Ref);
Next (Expr);
end loop;
end;
-- The type of the prefix may be have an uplevel
-- reference if this needs bounds.
if Nkind (N) = N_Attribute_Reference then
declare
Attr : constant Attribute_Id :=
Get_Attribute_Id (Attribute_Name (N));
DT : Boolean := False;
begin
if (Attr = Attribute_First
or else Attr = Attribute_Last
or else Attr = Attribute_Length)
and then Is_Constrained (Etype (Prefix (N)))
then
Check_Static_Type
(Etype (Prefix (N)), Empty, DT);
end if;
end;
end if;
-- Binary operator cases. These can apply to arrays for
-- which we may need bounds.
elsif Nkind (N) in N_Binary_Op then
Note_Uplevel_Bound (Left_Opnd (N), Ref);
Note_Uplevel_Bound (Right_Opnd (N), Ref);
-- Unary operator case
elsif Nkind (N) in N_Unary_Op then
Note_Uplevel_Bound (Right_Opnd (N), Ref);
-- Explicit dereference and selected component case
elsif Nkind (N) in
N_Explicit_Dereference | N_Selected_Component
then
Note_Uplevel_Bound (Prefix (N), Ref);
-- Conditional expressions
elsif Nkind (N) = N_If_Expression then
declare
Expr : Node_Id;
begin
Expr := First (Expressions (N));
while Present (Expr) loop
Note_Uplevel_Bound (Expr, Ref);
Next (Expr);
end loop;
end;
elsif Nkind (N) = N_Case_Expression then
declare
Alternative : Node_Id;
begin
Note_Uplevel_Bound (Expression (N), Ref);
Alternative := First (Alternatives (N));
while Present (Alternative) loop
Note_Uplevel_Bound (Expression (Alternative), Ref);
end loop;
end;
-- Conversion case
elsif Nkind (N) = N_Type_Conversion then
Note_Uplevel_Bound (Expression (N), Ref);
end if;
end Note_Uplevel_Bound;
-- Start of processing for Check_Static_Type
begin
-- If already marked static, immediate return
if Is_Static_Type (T) and then not Check_Designated then
return;
end if;
-- If the type is at library level, always consider it static,
-- since such uplevel references are irrelevant.
if Is_Library_Level_Entity (T) then
Set_Is_Static_Type (T);
return;
end if;
-- Otherwise figure out what the story is with this type
-- For a scalar type, check bounds
if Is_Scalar_Type (T) then
-- If both bounds static, then this is a static type
declare
LB : constant Node_Id := Type_Low_Bound (T);
UB : constant Node_Id := Type_High_Bound (T);
begin
if not Is_Static_Expression (LB) then
Note_Uplevel_Bound (LB, N);
DT := True;
end if;
if not Is_Static_Expression (UB) then
Note_Uplevel_Bound (UB, N);
DT := True;
end if;
end;
-- For record type, check all components and discriminant
-- constraints if present.
elsif Is_Record_Type (T) then
declare
C : Entity_Id;
D : Elmt_Id;
begin
C := First_Component_Or_Discriminant (T);
while Present (C) loop
Check_Static_Type (Etype (C), N, DT);
Next_Component_Or_Discriminant (C);
end loop;
if Has_Discriminants (T)
and then Present (Discriminant_Constraint (T))
then
D := First_Elmt (Discriminant_Constraint (T));
while Present (D) loop
if not Is_Static_Expression (Node (D)) then
Note_Uplevel_Bound (Node (D), N);
DT := True;
end if;
Next_Elmt (D);
end loop;
end if;
end;
-- For array type, check index types and component type
elsif Is_Array_Type (T) then
declare
IX : Node_Id;
begin
Check_Static_Type (Component_Type (T), N, DT);
IX := First_Index (T);
while Present (IX) loop
Check_Static_Type (Etype (IX), N, DT);
Next_Index (IX);
end loop;
end;
-- For private type, examine whether full view is static
elsif Is_Incomplete_Or_Private_Type (T)
and then Present (Full_View (T))
then
Check_Static_Type (Full_View (T), N, DT, Check_Designated);
if Is_Static_Type (Full_View (T)) then
Set_Is_Static_Type (T);
end if;
-- For access types, check designated type when required
elsif Is_Access_Type (T) and then Check_Designated then
Check_Static_Type (Directly_Designated_Type (T), N, DT);
-- For now, ignore other types
else
return;
end if;
if not DT then
Set_Is_Static_Type (T);
end if;
end Check_Static_Type;
----------------------
-- Note_Uplevel_Ref --
----------------------
procedure Note_Uplevel_Ref
(E : Entity_Id;
N : Node_Id;
Caller : Entity_Id;
Callee : Entity_Id)
is
Full_E : Entity_Id := E;
begin
-- Nothing to do for static type
if Is_Static_Type (E) then
return;
end if;
-- Nothing to do if Caller and Callee are the same
if Caller = Callee then
return;
-- Callee may be a function that returns an array, and that has
-- been rewritten as a procedure. If caller is that procedure,
-- nothing to do either.
elsif Ekind (Callee) = E_Function
and then Rewritten_For_C (Callee)
and then Corresponding_Procedure (Callee) = Caller
then
return;
elsif Ekind (Callee) in E_Entry | E_Entry_Family then
return;
end if;
-- We have a new uplevel referenced entity
if Ekind (E) = E_Constant and then Present (Full_View (E)) then
Full_E := Full_View (E);
end if;
-- All we do at this stage is to add the uplevel reference to
-- the table. It's too early to do anything else, since this
-- uplevel reference may come from an unreachable subprogram
-- in which case the entry will be deleted.
Urefs.Append ((N, Full_E, Caller, Callee));
end Note_Uplevel_Ref;
-------------------------
-- Register_Subprogram --
-------------------------
procedure Register_Subprogram (E : Entity_Id; Bod : Node_Id) is
L : constant Nat := Get_Level (Subp, E);
begin
-- Subprograms declared in tasks and protected types cannot be
-- eliminated because calls to them may be in other units, so
-- they must be treated as reachable.
Subps.Append
((Ent => E,
Bod => Bod,
Lev => L,
Reachable => In_Synchronized_Unit (E)
or else Address_Taken (E),
Uplevel_Ref => L,
Declares_AREC => False,
Uents => No_Elist,
Last => 0,
ARECnF => Empty,
ARECn => Empty,
ARECnT => Empty,
ARECnPT => Empty,
ARECnP => Empty,
ARECnU => Empty));
Set_Subps_Index (E, UI_From_Int (Subps.Last));
-- If we marked this reachable because it's in a synchronized
-- unit, we have to mark all enclosing subprograms as reachable
-- as well. We do the same for subprograms with Address_Taken,
-- because otherwise we can run into problems with looking at
-- enclosing subprograms in Subps.Table due to their being
-- unreachable (the Subp_Index of unreachable subps is later
-- set to zero and their entry in Subps.Table is removed).
if In_Synchronized_Unit (E) or else Address_Taken (E) then
declare
S : Entity_Id := E;
begin
for J in reverse 1 .. L - 1 loop
S := Enclosing_Subprogram (S);
Subps.Table (Subp_Index (S)).Reachable := True;
end loop;
end;
end if;
end Register_Subprogram;
-- Start of processing for Visit_Node
begin
case Nkind (N) is
-- Record a subprogram call
when N_Function_Call
| N_Procedure_Call_Statement
=>
-- We are only interested in direct calls, not indirect
-- calls (where Name (N) is an explicit dereference) at
-- least for now!
if Nkind (Name (N)) in N_Has_Entity then
Ent := Entity (Name (N));
-- We are only interested in calls to subprograms nested
-- within Subp. Calls to Subp itself or to subprograms
-- outside the nested structure do not affect us.
if Scope_Within (Ent, Subp)
and then Is_Subprogram (Ent)
and then not Is_Imported (Ent)
then
Append_Unique_Call ((N, Current_Subprogram, Ent));
end if;
end if;
-- For all calls where the formal is an unconstrained array
-- and the actual is constrained we need to check the bounds
-- for uplevel references.
declare
Actual : Entity_Id;
DT : Boolean := False;
Formal : Node_Id;
Subp : Entity_Id;
begin
if Nkind (Name (N)) = N_Explicit_Dereference then
Subp := Etype (Name (N));
else
Subp := Entity (Name (N));
end if;
Actual := First_Actual (N);
Formal := First_Formal_With_Extras (Subp);
while Present (Actual) loop
if Is_Array_Type (Etype (Formal))
and then not Is_Constrained (Etype (Formal))
and then Is_Constrained (Etype (Actual))
then
Check_Static_Type (Etype (Actual), Empty, DT);
end if;
Next_Actual (Actual);
Next_Formal_With_Extras (Formal);
end loop;
end;
-- An At_End_Proc in a statement sequence indicates that there
-- is a call from the enclosing construct or block to that
-- subprogram. As above, the called entity must be local and
-- not imported.
when N_Handled_Sequence_Of_Statements =>
if Present (At_End_Proc (N))
and then Scope_Within (Entity (At_End_Proc (N)), Subp)
and then not Is_Imported (Entity (At_End_Proc (N)))
then
Append_Unique_Call
((N, Current_Subprogram, Entity (At_End_Proc (N))));
end if;
-- Similarly, the following constructs include a semantic
-- attribute Procedure_To_Call that must be handled like
-- other calls. Likewise for attribute Storage_Pool.
when N_Allocator
| N_Extended_Return_Statement
| N_Free_Statement
| N_Simple_Return_Statement
=>
declare
Pool : constant Entity_Id := Storage_Pool (N);
Proc : constant Entity_Id := Procedure_To_Call (N);
begin
if Present (Proc)
and then Scope_Within (Proc, Subp)
and then not Is_Imported (Proc)
then
Append_Unique_Call ((N, Current_Subprogram, Proc));
end if;
if Present (Pool)
and then not Is_Library_Level_Entity (Pool)
and then Scope_Within_Or_Same (Scope (Pool), Subp)
then
Caller := Current_Subprogram;
Callee := Enclosing_Subprogram (Pool);
if Callee /= Caller then
Note_Uplevel_Ref (Pool, Empty, Caller, Callee);
end if;
end if;
end;
-- For an allocator with a qualified expression, check type
-- of expression being qualified. The explicit type name is
-- handled as an entity reference.
if Nkind (N) = N_Allocator
and then Nkind (Expression (N)) = N_Qualified_Expression
then
declare
DT : Boolean := False;
begin
Check_Static_Type
(Etype (Expression (Expression (N))), Empty, DT);
end;
-- For a Return or Free (all other nodes we handle here),
-- we usually need the size of the object, so we need to be
-- sure that any nonstatic bounds of the expression's type
-- that are uplevel are handled.
elsif Nkind (N) /= N_Allocator
and then Present (Expression (N))
then
declare
DT : Boolean := False;
begin
Check_Static_Type
(Etype (Expression (N)),
Empty,
DT,
Check_Designated => Nkind (N) = N_Free_Statement);
end;
end if;
-- A 'Access reference is a (potential) call. So is 'Address,
-- in particular on imported subprograms. Other attributes
-- require special handling.
when N_Attribute_Reference =>
declare
Attr : constant Attribute_Id :=
Get_Attribute_Id (Attribute_Name (N));
begin
case Attr is
when Attribute_Access
| Attribute_Unchecked_Access
| Attribute_Unrestricted_Access
| Attribute_Address
=>
if Nkind (Prefix (N)) in N_Has_Entity then
Ent := Entity (Prefix (N));
-- We only need to examine calls to subprograms
-- nested within current Subp.
if Scope_Within (Ent, Subp) then
if Is_Imported (Ent) then
null;
elsif Is_Subprogram (Ent) then
Append_Unique_Call
((N, Current_Subprogram, Ent));
end if;
end if;
end if;
-- References to bounds can be uplevel references if
-- the type isn't static.
when Attribute_First
| Attribute_Last
| Attribute_Length
=>
-- Special-case attributes of objects whose bounds
-- may be uplevel references. More complex prefixes
-- handled during full traversal. Note that if the
-- nominal subtype of the prefix is unconstrained,
-- the bound must be obtained from the object, not
-- from the (possibly) uplevel reference. We call
-- Get_Referenced_Object to deal with prefixes that
-- are object renamings (prefixes that are types
-- can be passed and will simply be returned). But
-- it's also legal to get the bounds from the type
-- of the prefix, so we have to handle both cases.
declare
DT : Boolean := False;
begin
if Is_Constrained
(Etype (Get_Referenced_Object (Prefix (N))))
then
Check_Static_Type
(Etype (Get_Referenced_Object (Prefix (N))),
Empty, DT);
end if;
if Is_Constrained (Etype (Prefix (N))) then
Check_Static_Type
(Etype (Prefix (N)), Empty, DT);
end if;
end;
when others =>
null;
end case;
end;
-- Component associations in aggregates are either static or
-- else the aggregate will be expanded into assignments, in
-- which case the expression is analyzed later and provides
-- no relevant code generation.
when N_Component_Association =>
if No (Expression (N))
or else No (Etype (Expression (N)))
then
return Skip;
end if;
-- Generic associations are not analyzed: the actuals are
-- transferred to renaming and subtype declarations that
-- are the ones that must be examined.
when N_Generic_Association =>
return Skip;
-- Indexed references can be uplevel if the type isn't static
-- and if the lower bound (or an inner bound for a multi-
-- dimensional array) is uplevel.
when N_Indexed_Component
| N_Slice
=>
if Is_Constrained (Etype (Prefix (N))) then
declare
DT : Boolean := False;
begin
Check_Static_Type (Etype (Prefix (N)), Empty, DT);
end;
end if;
-- A selected component can have an implicit up-level
-- reference due to the bounds of previous fields in the
-- record. We simplify the processing here by examining
-- all components of the record.
-- Selected components appear as unit names and end labels
-- for child units. Prefixes of these nodes denote parent
-- units and carry no type information so they are skipped.
when N_Selected_Component =>
if Present (Etype (Prefix (N))) then
declare
DT : Boolean := False;
begin
Check_Static_Type (Etype (Prefix (N)), Empty, DT);
end;
end if;
-- For EQ/NE comparisons, we need the type of the operands
-- in order to do the comparison, which means we need the
-- bounds.
when N_Op_Eq
| N_Op_Ne
=>
declare
DT : Boolean := False;
begin
Check_Static_Type (Etype (Left_Opnd (N)), Empty, DT);
Check_Static_Type (Etype (Right_Opnd (N)), Empty, DT);
end;
-- Likewise we need the sizes to compute how much to move in
-- an assignment.
when N_Assignment_Statement =>
declare
DT : Boolean := False;
begin
Check_Static_Type (Etype (Name (N)), Empty, DT);
Check_Static_Type (Etype (Expression (N)), Empty, DT);
end;
-- Record a subprogram. We record a subprogram body that acts
-- as a spec. Otherwise we record a subprogram declaration,
-- providing that it has a corresponding body we can get hold
-- of. The case of no corresponding body being available is
-- ignored for now.
when N_Subprogram_Body =>
Ent := Unique_Defining_Entity (N);
-- Ignore generic subprogram
if Is_Generic_Subprogram (Ent) then
return Skip;
end if;
-- Make new entry in subprogram table if not already made
Register_Subprogram (Ent, N);
-- We make a recursive call to scan the subprogram body, so
-- that we can save and restore Current_Subprogram.
declare
Save_CS : constant Entity_Id := Current_Subprogram;
Decl : Node_Id;
begin
Current_Subprogram := Ent;
-- Scan declarations
Decl := First (Declarations (N));
while Present (Decl) loop
Visit (Decl);
Next (Decl);
end loop;
-- Scan statements
Visit (Handled_Statement_Sequence (N));
-- Restore current subprogram setting
Current_Subprogram := Save_CS;
end;
-- Now at this level, return skipping the subprogram body
-- descendants, since we already took care of them!
return Skip;
-- If we have a body stub, visit the associated subunit, which
-- is a semantic descendant of the stub.
when N_Body_Stub =>
Visit (Library_Unit (N));
-- A declaration of a wrapper package indicates a subprogram
-- instance for which there is no explicit body. Enter the
-- subprogram instance in the table.
when N_Package_Declaration =>
if Is_Wrapper_Package (Defining_Entity (N)) then
Register_Subprogram
(Related_Instance (Defining_Entity (N)), Empty);
end if;
-- Skip generic declarations
when N_Generic_Declaration =>
return Skip;
-- Skip generic package body
when N_Package_Body =>
if Present (Corresponding_Spec (N))
and then Ekind (Corresponding_Spec (N)) = E_Generic_Package
then
return Skip;
end if;
-- Pragmas and component declarations are ignored. Quantified
-- expressions are expanded into explicit loops and the
-- original epression must be ignored.
when N_Component_Declaration
| N_Pragma
| N_Quantified_Expression
=>
return Skip;
-- We want to skip the function spec for a generic function
-- to avoid looking at any generic types that might be in
-- its formals.
when N_Function_Specification =>
if Is_Generic_Subprogram (Unique_Defining_Entity (N)) then
return Skip;
end if;
-- Otherwise record an uplevel reference in a local identifier
when others =>
if Nkind (N) in N_Has_Entity
and then Present (Entity (N))
then
Ent := Entity (N);
-- Only interested in entities declared within our nest
if not Is_Library_Level_Entity (Ent)
and then Scope_Within_Or_Same (Scope (Ent), Subp)
-- Skip entities defined in inlined subprograms
and then
Chars (Enclosing_Subprogram (Ent)) /= Name_uParent
-- Constants and variables are potentially uplevel
-- references to global declarations.
and then
(Ekind (Ent) in E_Constant
| E_Loop_Parameter
| E_Variable
-- Formals are interesting, but not if being used
-- as mere names of parameters for name notation
-- calls.
or else
(Is_Formal (Ent)
and then not
(Nkind (Parent (N)) = N_Parameter_Association
and then Selector_Name (Parent (N)) = N))
-- Types other than known Is_Static types are
-- potentially interesting.
or else
(Is_Type (Ent) and then not Is_Static_Type (Ent)))
then
-- Here we have a potentially interesting uplevel
-- reference to examine.
if Is_Type (Ent) then
declare
DT : Boolean := False;
begin
Check_Static_Type (Ent, N, DT);
return OK;
end;
end if;
Caller := Current_Subprogram;
Callee := Enclosing_Subprogram (Ent);
if Callee /= Caller
and then (not Is_Static_Type (Ent)
or else Needs_Fat_Pointer (Ent))
then
Note_Uplevel_Ref (Ent, N, Caller, Callee);
-- Check the type of a formal parameter of the current
-- subprogram, whose formal type may be an uplevel
-- reference.
elsif Is_Formal (Ent)
and then Scope (Ent) = Current_Subprogram
then
declare
DT : Boolean := False;
begin
Check_Static_Type (Etype (Ent), Empty, DT);
end;
end if;
end if;
end if;
end case;
-- Fall through to continue scanning children of this node
return OK;
end Visit_Node;
-- Start of processing for Build_Tables
begin
-- Traverse the body to get subprograms, calls and uplevel references
Visit (Subp_Body);
end Build_Tables;
-- Now do the first transitive closure which determines which
-- subprograms in the nest are actually reachable.
Reachable_Closure : declare
Modified : Boolean;
begin
Subps.Table (Subps_First).Reachable := True;
-- We use a simple minded algorithm as follows (obviously this can
-- be done more efficiently, using one of the standard algorithms
-- for efficient transitive closure computation, but this is simple
-- and most likely fast enough that its speed does not matter).
-- Repeatedly scan the list of calls. Any time we find a call from
-- A to B, where A is reachable, but B is not, then B is reachable,
-- and note that we have made a change by setting Modified True. We
-- repeat this until we make a pass with no modifications.
Outer : loop
Modified := False;
Inner : for J in Calls.First .. Calls.Last loop
declare
CTJ : Call_Entry renames Calls.Table (J);
SINF : constant SI_Type := Subp_Index (CTJ.Caller);
SINT : constant SI_Type := Subp_Index (CTJ.Callee);
SUBF : Subp_Entry renames Subps.Table (SINF);
SUBT : Subp_Entry renames Subps.Table (SINT);
begin
if SUBF.Reachable and then not SUBT.Reachable then
SUBT.Reachable := True;
Modified := True;
end if;
end;
end loop Inner;
exit Outer when not Modified;
end loop Outer;
end Reachable_Closure;
-- Remove calls from unreachable subprograms
declare
New_Index : Nat;
begin
New_Index := 0;
for J in Calls.First .. Calls.Last loop
declare
CTJ : Call_Entry renames Calls.Table (J);
SINF : constant SI_Type := Subp_Index (CTJ.Caller);
SINT : constant SI_Type := Subp_Index (CTJ.Callee);
SUBF : Subp_Entry renames Subps.Table (SINF);
SUBT : Subp_Entry renames Subps.Table (SINT);
begin
if SUBF.Reachable then
pragma Assert (SUBT.Reachable);
New_Index := New_Index + 1;
Calls.Table (New_Index) := Calls.Table (J);
end if;
end;
end loop;
Calls.Set_Last (New_Index);
end;
-- Remove uplevel references from unreachable subprograms
declare
New_Index : Nat;
begin
New_Index := 0;
for J in Urefs.First .. Urefs.Last loop
declare
URJ : Uref_Entry renames Urefs.Table (J);
SINF : constant SI_Type := Subp_Index (URJ.Caller);
SINT : constant SI_Type := Subp_Index (URJ.Callee);
SUBF : Subp_Entry renames Subps.Table (SINF);
SUBT : Subp_Entry renames Subps.Table (SINT);
S : Entity_Id;
begin
-- Keep reachable reference
if SUBF.Reachable then
New_Index := New_Index + 1;
Urefs.Table (New_Index) := Urefs.Table (J);
-- And since we know we are keeping this one, this is a good
-- place to fill in information for a good reference.
-- Mark all enclosing subprograms need to declare AREC
S := URJ.Caller;
loop
S := Enclosing_Subprogram (S);
-- If we are at the top level, as can happen with
-- references to formals in aspects of nested subprogram
-- declarations, there are no further subprograms to mark
-- as requiring activation records.
exit when No (S);
declare
SUBI : Subp_Entry renames Subps.Table (Subp_Index (S));
begin
SUBI.Declares_AREC := True;
-- If this entity was marked reachable because it is
-- in a task or protected type, there may not appear
-- to be any calls to it, which would normally adjust
-- the levels of the parent subprograms. So we need to
-- be sure that the uplevel reference of that entity
-- takes into account possible calls.
if In_Synchronized_Unit (SUBF.Ent)
and then SUBT.Lev < SUBI.Uplevel_Ref
then
SUBI.Uplevel_Ref := SUBT.Lev;
end if;
end;
exit when S = URJ.Callee;
end loop;
-- Add to list of uplevel referenced entities for Callee.
-- We do not add types to this list, only actual references
-- to objects that will be referenced uplevel, and we use
-- the flag Is_Uplevel_Referenced_Entity to avoid making
-- duplicate entries in the list. Discriminants are also
-- excluded, only the enclosing object can appear in the
-- list.
if not Is_Uplevel_Referenced_Entity (URJ.Ent)
and then Ekind (URJ.Ent) /= E_Discriminant
then
Set_Is_Uplevel_Referenced_Entity (URJ.Ent);
Append_New_Elmt (URJ.Ent, SUBT.Uents);
end if;
-- And set uplevel indication for caller
if SUBT.Lev < SUBF.Uplevel_Ref then
SUBF.Uplevel_Ref := SUBT.Lev;
end if;
end if;
end;
end loop;
Urefs.Set_Last (New_Index);
end;
-- Remove unreachable subprograms from Subps table. Note that we do
-- this after eliminating entries from the other two tables, since
-- those elimination steps depend on referencing the Subps table.
declare
New_SI : SI_Type;
begin
New_SI := Subps_First - 1;
for J in Subps_First .. Subps.Last loop
declare
STJ : Subp_Entry renames Subps.Table (J);
Spec : Node_Id;
Decl : Node_Id;
begin
-- Subprogram is reachable, copy and reset index
if STJ.Reachable then
New_SI := New_SI + 1;
Subps.Table (New_SI) := STJ;
Set_Subps_Index (STJ.Ent, UI_From_Int (New_SI));
-- Subprogram is not reachable
else
-- Clear index, since no longer active
Set_Subps_Index (Subps.Table (J).Ent, Uint_0);
-- Output debug information if -gnatd.3 set
if Debug_Flag_Dot_3 then
Write_Str ("Eliminate ");
Write_Name (Chars (Subps.Table (J).Ent));
Write_Str (" at ");
Write_Location (Sloc (Subps.Table (J).Ent));
Write_Str (" (not referenced)");
Write_Eol;
end if;
-- Rewrite declaration, body, and corresponding freeze node
-- to null statements.
-- A subprogram instantiation does not have an explicit
-- body. If unused, we could remove the corresponding
-- wrapper package and its body (TBD).
if Present (STJ.Bod) then
Spec := Corresponding_Spec (STJ.Bod);
if Present (Spec) then
Decl := Parent (Declaration_Node (Spec));
Rewrite (Decl, Make_Null_Statement (Sloc (Decl)));
if Present (Freeze_Node (Spec)) then
Rewrite (Freeze_Node (Spec),
Make_Null_Statement (Sloc (Decl)));
end if;
end if;
Rewrite (STJ.Bod, Make_Null_Statement (Sloc (STJ.Bod)));
end if;
end if;
end;
end loop;
Subps.Set_Last (New_SI);
end;
-- Now it is time for the second transitive closure, which follows calls
-- and makes sure that A calls B, and B has uplevel references, then A
-- is also marked as having uplevel references.
Closure_Uplevel : declare
Modified : Boolean;
begin
-- We use a simple minded algorithm as follows (obviously this can
-- be done more efficiently, using one of the standard algorithms
-- for efficient transitive closure computation, but this is simple
-- and most likely fast enough that its speed does not matter).
-- Repeatedly scan the list of calls. Any time we find a call from
-- A to B, where B has uplevel references, make sure that A is marked
-- as having at least the same level of uplevel referencing.
Outer2 : loop
Modified := False;
Inner2 : for J in Calls.First .. Calls.Last loop
declare
CTJ : Call_Entry renames Calls.Table (J);
SINF : constant SI_Type := Subp_Index (CTJ.Caller);
SINT : constant SI_Type := Subp_Index (CTJ.Callee);
SUBF : Subp_Entry renames Subps.Table (SINF);
SUBT : Subp_Entry renames Subps.Table (SINT);
begin
if SUBT.Lev > SUBT.Uplevel_Ref
and then SUBF.Uplevel_Ref > SUBT.Uplevel_Ref
then
SUBF.Uplevel_Ref := SUBT.Uplevel_Ref;
Modified := True;
end if;
end;
end loop Inner2;
exit Outer2 when not Modified;
end loop Outer2;
end Closure_Uplevel;
-- We have one more step before the tables are complete. An uplevel
-- call from subprogram A to subprogram B where subprogram B has uplevel
-- references is in effect an uplevel reference, and must arrange for
-- the proper activation link to be passed.
for J in Calls.First .. Calls.Last loop
declare
CTJ : Call_Entry renames Calls.Table (J);
SINF : constant SI_Type := Subp_Index (CTJ.Caller);
SINT : constant SI_Type := Subp_Index (CTJ.Callee);
SUBF : Subp_Entry renames Subps.Table (SINF);
SUBT : Subp_Entry renames Subps.Table (SINT);
A : Entity_Id;
begin
-- If callee has uplevel references
if SUBT.Uplevel_Ref < SUBT.Lev
-- And this is an uplevel call
and then SUBT.Lev < SUBF.Lev
then
-- We need to arrange for finding the uplink
A := CTJ.Caller;
loop
A := Enclosing_Subprogram (A);
Subps.Table (Subp_Index (A)).Declares_AREC := True;
exit when A = CTJ.Callee;
-- In any case exit when we get to the outer level. This
-- happens in some odd cases with generics (in particular
-- sem_ch3.adb does not compile without this kludge ???).
exit when A = Subp;
end loop;
end if;
end;
end loop;
-- The tables are now complete, so we can record the last index in the
-- Subps table for later reference in Cprint.
Subps.Table (Subps_First).Last := Subps.Last;
-- Next step, create the entities for code we will insert. We do this
-- at the start so that all the entities are defined, regardless of the
-- order in which we do the code insertions.
Create_Entities : for J in Subps_First .. Subps.Last loop
declare
STJ : Subp_Entry renames Subps.Table (J);
Loc : constant Source_Ptr := Sloc (STJ.Bod);
begin
-- First we create the ARECnF entity for the additional formal for
-- all subprograms which need an activation record passed.
if STJ.Uplevel_Ref < STJ.Lev then
STJ.ARECnF :=
Make_Defining_Identifier (Loc, Chars => AREC_Name (J, "F"));
end if;
-- Define the AREC entities for the activation record if needed
if STJ.Declares_AREC then
STJ.ARECn :=
Make_Defining_Identifier (Loc, AREC_Name (J, ""));
STJ.ARECnT :=
Make_Defining_Identifier (Loc, AREC_Name (J, "T"));
STJ.ARECnPT :=
Make_Defining_Identifier (Loc, AREC_Name (J, "PT"));
STJ.ARECnP :=
Make_Defining_Identifier (Loc, AREC_Name (J, "P"));
-- Define uplink component entity if inner nesting case
if Present (STJ.ARECnF) then
STJ.ARECnU :=
Make_Defining_Identifier (Loc, AREC_Name (J, "U"));
end if;
end if;
end;
end loop Create_Entities;
-- Loop through subprograms
Subp_Loop : declare
Addr : Entity_Id := Empty;
begin
for J in Subps_First .. Subps.Last loop
declare
STJ : Subp_Entry renames Subps.Table (J);
begin
-- First add the extra formal if needed. This applies to all
-- nested subprograms that require an activation record to be
-- passed, as indicated by ARECnF being defined.
if Present (STJ.ARECnF) then
-- Here we need the extra formal. We do the expansion and
-- analysis of this manually, since it is fairly simple,
-- and it is not obvious how we can get what we want if we
-- try to use the normal Analyze circuit.
Add_Extra_Formal : declare
Encl : constant SI_Type := Enclosing_Subp (J);
STJE : Subp_Entry renames Subps.Table (Encl);
-- Index and Subp_Entry for enclosing routine
Form : constant Entity_Id := STJ.ARECnF;
-- The formal to be added. Note that n here is one less
-- than the level of the subprogram itself (STJ.Ent).
procedure Add_Form_To_Spec (F : Entity_Id; S : Node_Id);
-- S is an N_Function/Procedure_Specification node, and F
-- is the new entity to add to this subprogramn spec as
-- the last Extra_Formal.
----------------------
-- Add_Form_To_Spec --
----------------------
procedure Add_Form_To_Spec (F : Entity_Id; S : Node_Id) is
Sub : constant Entity_Id := Defining_Entity (S);
Ent : Entity_Id;
begin
-- Case of at least one Extra_Formal is present, set
-- ARECnF as the new last entry in the list.
if Present (Extra_Formals (Sub)) then
Ent := Extra_Formals (Sub);
while Present (Extra_Formal (Ent)) loop
Ent := Extra_Formal (Ent);
end loop;
Set_Extra_Formal (Ent, F);
-- No Extra formals present
else
Set_Extra_Formals (Sub, F);
Ent := Last_Formal (Sub);
if Present (Ent) then
Set_Extra_Formal (Ent, F);
end if;
end if;
end Add_Form_To_Spec;
-- Start of processing for Add_Extra_Formal
begin
-- Decorate the new formal entity
Set_Scope (Form, STJ.Ent);
Set_Ekind (Form, E_In_Parameter);
Set_Etype (Form, STJE.ARECnPT);
Set_Mechanism (Form, By_Copy);
Set_Never_Set_In_Source (Form, True);
Set_Analyzed (Form, True);
Set_Comes_From_Source (Form, False);
Set_Is_Activation_Record (Form, True);
-- Case of only body present
if Acts_As_Spec (STJ.Bod) then
Add_Form_To_Spec (Form, Specification (STJ.Bod));
-- Case of separate spec
else
Add_Form_To_Spec (Form, Parent (STJ.Ent));
end if;
end Add_Extra_Formal;
end if;
-- Processing for subprograms that declare an activation record
if Present (STJ.ARECn) then
-- Local declarations for one such subprogram
declare
Loc : constant Source_Ptr := Sloc (STJ.Bod);
Decls : constant List_Id := New_List;
-- List of new declarations we create
Clist : List_Id;
Comp : Entity_Id;
Decl_Assign : Node_Id;
-- Assignment to set uplink, Empty if none
Decl_ARECnT : Node_Id;
Decl_ARECnPT : Node_Id;
Decl_ARECn : Node_Id;
Decl_ARECnP : Node_Id;
-- Declaration nodes for the AREC entities we build
begin
-- Build list of component declarations for ARECnT and
-- load System.Address.
Clist := Empty_List;
if No (Addr) then
Addr := RTE (RE_Address);
end if;
-- If we are in a subprogram that has a static link that
-- is passed in (as indicated by ARECnF being defined),
-- then include ARECnU : ARECmPT where ARECmPT comes from
-- the level one higher than the current level, and the
-- entity ARECnPT comes from the enclosing subprogram.
if Present (STJ.ARECnF) then
declare
STJE : Subp_Entry
renames Subps.Table (Enclosing_Subp (J));
begin
Append_To (Clist,
Make_Component_Declaration (Loc,
Defining_Identifier => STJ.ARECnU,
Component_Definition =>
Make_Component_Definition (Loc,
Subtype_Indication =>
New_Occurrence_Of (STJE.ARECnPT, Loc))));
end;
end if;
-- Add components for uplevel referenced entities
if Present (STJ.Uents) then
declare
Elmt : Elmt_Id;
Ptr_Decl : Node_Id;
Uent : Entity_Id;
Indx : Nat;
-- 1's origin of index in list of elements. This is
-- used to uniquify names if needed in Upref_Name.
begin
Elmt := First_Elmt (STJ.Uents);
Indx := 0;
while Present (Elmt) loop
Uent := Node (Elmt);
Indx := Indx + 1;
Comp :=
Make_Defining_Identifier (Loc,
Chars => Upref_Name (Uent, Indx, Clist));
Set_Activation_Record_Component
(Uent, Comp);
if Needs_Fat_Pointer (Uent) then
-- Build corresponding access type
Ptr_Decl :=
Build_Access_Type_Decl
(Etype (Uent), STJ.Ent);
Append_To (Decls, Ptr_Decl);
-- And use its type in the corresponding
-- component.
Append_To (Clist,
Make_Component_Declaration (Loc,
Defining_Identifier => Comp,
Component_Definition =>
Make_Component_Definition (Loc,
Subtype_Indication =>
New_Occurrence_Of
(Defining_Identifier (Ptr_Decl),
Loc))));
else
Append_To (Clist,
Make_Component_Declaration (Loc,
Defining_Identifier => Comp,
Component_Definition =>
Make_Component_Definition (Loc,
Subtype_Indication =>
New_Occurrence_Of (Addr, Loc))));
end if;
Next_Elmt (Elmt);
end loop;
end;
end if;
-- Now we can insert the AREC declarations into the body
-- type ARECnT is record .. end record;
-- pragma Suppress_Initialization (ARECnT);
-- Note that we need to set the Suppress_Initialization
-- flag after Decl_ARECnT has been analyzed.
Decl_ARECnT :=
Make_Full_Type_Declaration (Loc,
Defining_Identifier => STJ.ARECnT,
Type_Definition =>
Make_Record_Definition (Loc,
Component_List =>
Make_Component_List (Loc,
Component_Items => Clist)));
Append_To (Decls, Decl_ARECnT);
-- type ARECnPT is access all ARECnT;
Decl_ARECnPT :=
Make_Full_Type_Declaration (Loc,
Defining_Identifier => STJ.ARECnPT,
Type_Definition =>
Make_Access_To_Object_Definition (Loc,
All_Present => True,
Subtype_Indication =>
New_Occurrence_Of (STJ.ARECnT, Loc)));
Append_To (Decls, Decl_ARECnPT);
-- ARECn : aliased ARECnT;
Decl_ARECn :=
Make_Object_Declaration (Loc,
Defining_Identifier => STJ.ARECn,
Aliased_Present => True,
Object_Definition =>
New_Occurrence_Of (STJ.ARECnT, Loc));
Append_To (Decls, Decl_ARECn);
-- ARECnP : constant ARECnPT := ARECn'Access;
Decl_ARECnP :=
Make_Object_Declaration (Loc,
Defining_Identifier => STJ.ARECnP,
Constant_Present => True,
Object_Definition =>
New_Occurrence_Of (STJ.ARECnPT, Loc),
Expression =>
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of (STJ.ARECn, Loc),
Attribute_Name => Name_Access));
Append_To (Decls, Decl_ARECnP);
-- If we are in a subprogram that has a static link that
-- is passed in (as indicated by ARECnF being defined),
-- then generate ARECn.ARECmU := ARECmF where m is
-- one less than the current level to set the uplink.
if Present (STJ.ARECnF) then
Decl_Assign :=
Make_Assignment_Statement (Loc,
Name =>
Make_Selected_Component (Loc,
Prefix =>
New_Occurrence_Of (STJ.ARECn, Loc),
Selector_Name =>
New_Occurrence_Of (STJ.ARECnU, Loc)),
Expression =>
New_Occurrence_Of (STJ.ARECnF, Loc));
Append_To (Decls, Decl_Assign);
else
Decl_Assign := Empty;
end if;
if No (Declarations (STJ.Bod)) then
Set_Declarations (STJ.Bod, Decls);
else
Prepend_List_To (Declarations (STJ.Bod), Decls);
end if;
-- Analyze the newly inserted declarations. Note that we
-- do not need to establish the whole scope stack, since
-- we have already set all entity fields (so there will
-- be no searching of upper scopes to resolve names). But
-- we do set the scope of the current subprogram, so that
-- newly created entities go in the right entity chain.
-- We analyze with all checks suppressed (since we do
-- not expect any exceptions).
Push_Scope (STJ.Ent);
Analyze (Decl_ARECnT, Suppress => All_Checks);
-- Note that we need to call Set_Suppress_Initialization
-- after Decl_ARECnT has been analyzed, but before
-- analyzing Decl_ARECnP so that the flag is properly
-- taking into account.
Set_Suppress_Initialization (STJ.ARECnT);
Analyze (Decl_ARECnPT, Suppress => All_Checks);
Analyze (Decl_ARECn, Suppress => All_Checks);
Analyze (Decl_ARECnP, Suppress => All_Checks);
if Present (Decl_Assign) then
Analyze (Decl_Assign, Suppress => All_Checks);
end if;
Pop_Scope;
-- Next step, for each uplevel referenced entity, add
-- assignment operations to set the component in the
-- activation record.
if Present (STJ.Uents) then
declare
Elmt : Elmt_Id;
begin
Elmt := First_Elmt (STJ.Uents);
while Present (Elmt) loop
declare
Ent : constant Entity_Id := Node (Elmt);
Loc : constant Source_Ptr := Sloc (Ent);
Dec : constant Node_Id :=
Declaration_Node (Ent);
Asn : Node_Id;
Attr : Name_Id;
Comp : Entity_Id;
Ins : Node_Id;
Rhs : Node_Id;
begin
-- For parameters, we insert the assignment
-- right after the declaration of ARECnP.
-- For all other entities, we insert the
-- assignment immediately after the
-- declaration of the entity or after the
-- freeze node if present.
-- Note: we don't need to mark the entity
-- as being aliased, because the address
-- attribute will mark it as Address_Taken,
-- and that is good enough.
if Is_Formal (Ent) then
Ins := Decl_ARECnP;
elsif Has_Delayed_Freeze (Ent) then
Ins := Freeze_Node (Ent);
else
Ins := Dec;
end if;
-- Build and insert the assignment:
-- ARECn.nam := nam'Address
-- or else 'Access for unconstrained array
if Needs_Fat_Pointer (Ent) then
Attr := Name_Unchecked_Access;
else
Attr := Name_Address;
end if;
Rhs :=
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of (Ent, Loc),
Attribute_Name => Attr);
-- If the entity is an unconstrained formal
-- we wrap the attribute reference in an
-- unchecked conversion to the type of the
-- activation record component, to prevent
-- spurious subtype conformance errors within
-- instances.
if Is_Formal (Ent)
and then not Is_Constrained (Etype (Ent))
then
-- Find target component and its type
Comp := First_Component (STJ.ARECnT);
while Chars (Comp) /= Chars (Ent) loop
Next_Component (Comp);
end loop;
Rhs :=
Unchecked_Convert_To (Etype (Comp), Rhs);
end if;
Asn :=
Make_Assignment_Statement (Loc,
Name =>
Make_Selected_Component (Loc,
Prefix =>
New_Occurrence_Of (STJ.ARECn, Loc),
Selector_Name =>
New_Occurrence_Of
(Activation_Record_Component
(Ent),
Loc)),
Expression => Rhs);
-- If we have a loop parameter, we have
-- to insert before the first statement
-- of the loop. Ins points to the
-- N_Loop_Parameter_Specification or to
-- an N_Iterator_Specification.
if Nkind (Ins) in
N_Iterator_Specification |
N_Loop_Parameter_Specification
then
-- Quantified expression are rewritten as
-- loops during expansion.
if Nkind (Parent (Ins)) =
N_Quantified_Expression
then
null;
else
Ins :=
First
(Statements
(Parent (Parent (Ins))));
Insert_Before (Ins, Asn);
end if;
else
Insert_After (Ins, Asn);
end if;
-- Analyze the assignment statement. We do
-- not need to establish the relevant scope
-- stack entries here, because we have
-- already set the correct entity references,
-- so no name resolution is required, and no
-- new entities are created, so we don't even
-- need to set the current scope.
-- We analyze with all checks suppressed
-- (since we do not expect any exceptions).
Analyze (Asn, Suppress => All_Checks);
end;
Next_Elmt (Elmt);
end loop;
end;
end if;
end;
end if;
end;
end loop;
end Subp_Loop;
-- Next step, process uplevel references. This has to be done in a
-- separate pass, after completing the processing in Sub_Loop because we
-- need all the AREC declarations generated, inserted, and analyzed so
-- that the uplevel references can be successfully analyzed.
Uplev_Refs : for J in Urefs.First .. Urefs.Last loop
declare
UPJ : Uref_Entry renames Urefs.Table (J);
begin
-- Ignore type references, these are implicit references that do
-- not need rewriting (e.g. the appearence in a conversion).
-- Also ignore if no reference was specified or if the rewriting
-- has already been done (this can happen if the N_Identifier
-- occurs more than one time in the tree). Also ignore references
-- when not generating C code (in particular for the case of LLVM,
-- since GNAT-LLVM will handle the processing for up-level refs).
if No (UPJ.Ref)
or else not Is_Entity_Name (UPJ.Ref)
or else not Present (Entity (UPJ.Ref))
or else not Opt.Generate_C_Code
then
goto Continue;
end if;
-- Rewrite one reference
Rewrite_One_Ref : declare
Loc : constant Source_Ptr := Sloc (UPJ.Ref);
-- Source location for the reference
Typ : constant Entity_Id := Etype (UPJ.Ent);
-- The type of the referenced entity
Atyp : Entity_Id;
-- The actual subtype of the reference
RS_Caller : constant SI_Type := Subp_Index (UPJ.Caller);
-- Subp_Index for caller containing reference
STJR : Subp_Entry renames Subps.Table (RS_Caller);
-- Subp_Entry for subprogram containing reference
RS_Callee : constant SI_Type := Subp_Index (UPJ.Callee);
-- Subp_Index for subprogram containing referenced entity
STJE : Subp_Entry renames Subps.Table (RS_Callee);
-- Subp_Entry for subprogram containing referenced entity
Pfx : Node_Id;
Comp : Entity_Id;
SI : SI_Type;
begin
Atyp := Etype (UPJ.Ref);
if Ekind (Atyp) /= E_Record_Subtype then
Atyp := Get_Actual_Subtype (UPJ.Ref);
end if;
-- Ignore if no ARECnF entity for enclosing subprogram which
-- probably happens as a result of not properly treating
-- instance bodies. To be examined ???
-- If this test is omitted, then the compilation of freeze.adb
-- and inline.adb fail in unnesting mode.
if No (STJR.ARECnF) then
goto Continue;
end if;
-- If this is a reference to a global constant, use its value
-- rather than create a reference. It is more efficient and
-- furthermore indispensable if the context requires a
-- constant, such as a branch of a case statement.
if Ekind (UPJ.Ent) = E_Constant
and then Is_True_Constant (UPJ.Ent)
and then Present (Constant_Value (UPJ.Ent))
and then Is_Static_Expression (Constant_Value (UPJ.Ent))
then
Rewrite (UPJ.Ref, New_Copy_Tree (Constant_Value (UPJ.Ent)));
goto Continue;
end if;
-- Push the current scope, so that the pointer type Tnn, and
-- any subsidiary entities resulting from the analysis of the
-- rewritten reference, go in the right entity chain.
Push_Scope (STJR.Ent);
-- Now we need to rewrite the reference. We have a reference
-- from level STJR.Lev to level STJE.Lev. The general form of
-- the rewritten reference for entity X is:
-- Typ'Deref (ARECaF.ARECbU.ARECcU.ARECdU....ARECmU.X)
-- where a,b,c,d .. m =
-- STJR.Lev - 1, STJR.Lev - 2, .. STJE.Lev
pragma Assert (STJR.Lev > STJE.Lev);
-- Compute the prefix of X. Here are examples to make things
-- clear (with parens to show groupings, the prefix is
-- everything except the .X at the end).
-- level 2 to level 1
-- AREC1F.X
-- level 3 to level 1
-- (AREC2F.AREC1U).X
-- level 4 to level 1
-- ((AREC3F.AREC2U).AREC1U).X
-- level 6 to level 2
-- (((AREC5F.AREC4U).AREC3U).AREC2U).X
-- In the above, ARECnF and ARECnU are pointers, so there are
-- explicit dereferences required for these occurrences.
Pfx :=
Make_Explicit_Dereference (Loc,
Prefix => New_Occurrence_Of (STJR.ARECnF, Loc));
SI := RS_Caller;
for L in STJE.Lev .. STJR.Lev - 2 loop
SI := Enclosing_Subp (SI);
Pfx :=
Make_Explicit_Dereference (Loc,
Prefix =>
Make_Selected_Component (Loc,
Prefix => Pfx,
Selector_Name =>
New_Occurrence_Of (Subps.Table (SI).ARECnU, Loc)));
end loop;
-- Get activation record component (must exist)
Comp := Activation_Record_Component (UPJ.Ent);
pragma Assert (Present (Comp));
-- Do the replacement. If the component type is an access type,
-- this is an uplevel reference for an entity that requires a
-- fat pointer, so dereference the component.
if Is_Access_Type (Etype (Comp)) then
Rewrite (UPJ.Ref,
Make_Explicit_Dereference (Loc,
Prefix =>
Make_Selected_Component (Loc,
Prefix => Pfx,
Selector_Name =>
New_Occurrence_Of (Comp, Loc))));
else
Rewrite (UPJ.Ref,
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Atyp, Loc),
Attribute_Name => Name_Deref,
Expressions => New_List (
Make_Selected_Component (Loc,
Prefix => Pfx,
Selector_Name =>
New_Occurrence_Of (Comp, Loc)))));
end if;
-- Analyze and resolve the new expression. We do not need to
-- establish the relevant scope stack entries here, because we
-- have already set all the correct entity references, so no
-- name resolution is needed. We have already set the current
-- scope, so that any new entities created will be in the right
-- scope.
-- We analyze with all checks suppressed (since we do not
-- expect any exceptions)
Analyze_And_Resolve (UPJ.Ref, Typ, Suppress => All_Checks);
-- Generate an extra temporary to facilitate the C backend
-- processing this dereference
if Opt.Modify_Tree_For_C
and then Nkind (Parent (UPJ.Ref)) in
N_Type_Conversion | N_Unchecked_Type_Conversion
then
Force_Evaluation (UPJ.Ref, Mode => Strict);
end if;
Pop_Scope;
end Rewrite_One_Ref;
end;
<<Continue>>
null;
end loop Uplev_Refs;
-- Finally, loop through all calls adding extra actual for the
-- activation record where it is required.
Adjust_Calls : for J in Calls.First .. Calls.Last loop
-- Process a single call, we are only interested in a call to a
-- subprogram that actually needs a pointer to an activation record,
-- as indicated by the ARECnF entity being set. This excludes the
-- top level subprogram, and any subprogram not having uplevel refs.
Adjust_One_Call : declare
CTJ : Call_Entry renames Calls.Table (J);
STF : Subp_Entry renames Subps.Table (Subp_Index (CTJ.Caller));
STT : Subp_Entry renames Subps.Table (Subp_Index (CTJ.Callee));
Loc : constant Source_Ptr := Sloc (CTJ.N);
Extra : Node_Id;
ExtraP : Node_Id;
SubX : SI_Type;
Act : Node_Id;
begin
if Present (STT.ARECnF)
and then Nkind (CTJ.N) in N_Subprogram_Call
then
-- CTJ.N is a call to a subprogram which may require a pointer
-- to an activation record. The subprogram containing the call
-- is CTJ.From and the subprogram being called is CTJ.To, so we
-- have a call from level STF.Lev to level STT.Lev.
-- There are three possibilities:
-- For a call to the same level, we just pass the activation
-- record passed to the calling subprogram.
if STF.Lev = STT.Lev then
Extra := New_Occurrence_Of (STF.ARECnF, Loc);
-- For a call that goes down a level, we pass a pointer to the
-- activation record constructed within the caller (which may
-- be the outer-level subprogram, but also may be a more deeply
-- nested caller).
elsif STT.Lev = STF.Lev + 1 then
Extra := New_Occurrence_Of (STF.ARECnP, Loc);
-- Otherwise we must have an upcall (STT.Lev < STF.LEV),
-- since it is not possible to do a downcall of more than
-- one level.
-- For a call from level STF.Lev to level STT.Lev, we
-- have to find the activation record needed by the
-- callee. This is as follows:
-- ARECaF.ARECbU.ARECcU....ARECmU
-- where a,b,c .. m =
-- STF.Lev - 1, STF.Lev - 2, STF.Lev - 3 .. STT.Lev
else
pragma Assert (STT.Lev < STF.Lev);
Extra := New_Occurrence_Of (STF.ARECnF, Loc);
SubX := Subp_Index (CTJ.Caller);
for K in reverse STT.Lev .. STF.Lev - 1 loop
SubX := Enclosing_Subp (SubX);
Extra :=
Make_Selected_Component (Loc,
Prefix => Extra,
Selector_Name =>
New_Occurrence_Of
(Subps.Table (SubX).ARECnU, Loc));
end loop;
end if;
-- Extra is the additional parameter to be added. Build a
-- parameter association that we can append to the actuals.
ExtraP :=
Make_Parameter_Association (Loc,
Selector_Name =>
New_Occurrence_Of (STT.ARECnF, Loc),
Explicit_Actual_Parameter => Extra);
if No (Parameter_Associations (CTJ.N)) then
Set_Parameter_Associations (CTJ.N, Empty_List);
end if;
Append (ExtraP, Parameter_Associations (CTJ.N));
-- We need to deal with the actual parameter chain as well. The
-- newly added parameter is always the last actual.
Act := First_Named_Actual (CTJ.N);
if No (Act) then
Set_First_Named_Actual (CTJ.N, Extra);
-- If call has been relocated (as with an expression in
-- an aggregate), set First_Named pointer in original node
-- as well, because that's the parent of the parameter list.
Set_First_Named_Actual
(Parent (List_Containing (ExtraP)), Extra);
-- Here we must follow the chain and append the new entry
else
loop
declare
PAN : Node_Id;
NNA : Node_Id;
begin
PAN := Parent (Act);
pragma Assert (Nkind (PAN) = N_Parameter_Association);
NNA := Next_Named_Actual (PAN);
if No (NNA) then
Set_Next_Named_Actual (PAN, Extra);
exit;
end if;
Act := NNA;
end;
end loop;
end if;
-- Analyze and resolve the new actual. We do not need to
-- establish the relevant scope stack entries here, because
-- we have already set all the correct entity references, so
-- no name resolution is needed.
-- We analyze with all checks suppressed (since we do not
-- expect any exceptions, and also we temporarily turn off
-- Unested_Subprogram_Mode to avoid trying to mark uplevel
-- references (not needed at this stage, and in fact causes
-- a bit of recursive chaos).
Opt.Unnest_Subprogram_Mode := False;
Analyze_And_Resolve
(Extra, Etype (STT.ARECnF), Suppress => All_Checks);
Opt.Unnest_Subprogram_Mode := True;
end if;
end Adjust_One_Call;
end loop Adjust_Calls;
return;
end Unnest_Subprogram;
------------------------
-- Unnest_Subprograms --
------------------------
procedure Unnest_Subprograms (N : Node_Id) is
function Search_Subprograms (N : Node_Id) return Traverse_Result;
-- Tree visitor that search for outer level procedures with nested
-- subprograms and invokes Unnest_Subprogram()
---------------
-- Do_Search --
---------------
procedure Do_Search is new Traverse_Proc (Search_Subprograms);
-- Subtree visitor instantiation
------------------------
-- Search_Subprograms --
------------------------
function Search_Subprograms (N : Node_Id) return Traverse_Result is
begin
if Nkind (N) in N_Subprogram_Body | N_Subprogram_Body_Stub then
declare
Spec_Id : constant Entity_Id := Unique_Defining_Entity (N);
begin
-- We are only interested in subprograms (not generic
-- subprograms), that have nested subprograms.
if Is_Subprogram (Spec_Id)
and then Has_Nested_Subprogram (Spec_Id)
and then Is_Library_Level_Entity (Spec_Id)
then
Unnest_Subprogram (Spec_Id, N);
end if;
end;
-- The proper body of a stub may contain nested subprograms, and
-- therefore must be visited explicitly. Nested stubs are examined
-- recursively in Visit_Node.
elsif Nkind (N) in N_Body_Stub then
Do_Search (Library_Unit (N));
-- Skip generic packages
elsif Nkind (N) = N_Package_Body
and then Ekind (Corresponding_Spec (N)) = E_Generic_Package
then
return Skip;
end if;
return OK;
end Search_Subprograms;
Subp : Entity_Id;
Subp_Body : Node_Id;
-- Start of processing for Unnest_Subprograms
begin
if not Opt.Unnest_Subprogram_Mode or not Opt.Expander_Active then
return;
end if;
-- A specification will contain bodies if it contains instantiations so
-- examine package or subprogram declaration of the main unit, when it
-- is present.
if Nkind (Unit (N)) = N_Package_Body
or else (Nkind (Unit (N)) = N_Subprogram_Body
and then not Acts_As_Spec (N))
then
Do_Search (Library_Unit (N));
end if;
Do_Search (N);
-- Unnest any subprograms passed on the list of inlined subprograms
Subp := First_Inlined_Subprogram (N);
while Present (Subp) loop
Subp_Body := Parent (Declaration_Node (Subp));
if Nkind (Subp_Body) = N_Subprogram_Declaration
and then Present (Corresponding_Body (Subp_Body))
then
Subp_Body := Parent (Declaration_Node
(Corresponding_Body (Subp_Body)));
end if;
Unnest_Subprogram (Subp, Subp_Body, For_Inline => True);
Next_Inlined_Subprogram (Subp);
end loop;
end Unnest_Subprograms;
end Exp_Unst;
|
WITH Board, Input_Line, Screen;
WITH Text_IO;
PROCEDURE Mahjongg IS
--------------------------------------------------------------------
--| Program : Mah Jongg Version : 1.0a
--------------------------------------------------------------------
--| Abstract : Main Driver for Mahjongg game.
--------------------------------------------------------------------
--| Compiler/System : Meridian Ada
--| Author : John Dalbey Date : 5/95
--| References : Requirements Document and Specification
--------------------------------------------------------------------
--| Useage : Uses a data file: mah.sav
--------------------------------------------------------------------
Version: constant STRING := "1";
GameOver: BOOLEAN := FALSE; -- global variable set in Dispatch_Command
-------------------------------------------------------------------------------
PROCEDURE Provide_Help IS
-- PURPOSE: Provide a page of help text explaining how to play the game.
--
-- USED BY: Dispatch_Command
-- PSEUDOCODE:
-- Display a screen of help text.
-- Pause until user presses Enter.
-- Redisplay the game board.
BEGIN
null;
END Provide_Help;
-------------------------------------------------------------------------------
PROCEDURE Load_Game IS
-- PURPOSE: Load the board from a saved game file.
--
-- USED BY: Dispatch_Command
BEGIN
Board.Load(" ");
Board.Show(Version);
END Load_Game;
------------------------------------------------------------------------------
PROCEDURE Dispatch_Command IS
-- PURPOSE: Dispatch the command.
--
-- USED BY: Take_Turn
package IL renames Input_Line; -- IL is shorthand for Input_Line
BEGIN
CASE (IL.Get_Command) IS
WHEN IL.Load => Load_Game;
WHEN IL.Quit => GameOver := TRUE;
WHEN Others => null;
END CASE;
END Dispatch_Command;
------------------------------------------------------------------------------
PROCEDURE Take_Turn IS
-- PURPOSE: Allow the user to enter a move or a command and then do it.
--
-- USED BY: Main Driver
BEGIN -- Take Turn
-- Display prompt
Screen.MoveCursor(22,1);
Text_io.PUT (Input_Line.Prompt);
Input_Line.Get ; -- Obtain user input
-- Loop until is command or is move
-- Determine if Command or Move
IF Input_Line.IsCommand THEN
Dispatch_Command;
ELSE -- must be move
-- if move is valid then make it
null;
END IF;
END Take_Turn;
--=======================================================================
-- PURPOSE: Main driver module. It orchestrates the entire system.
-- USED BY: None. This is the top dog on the structure chart.
BEGIN
Board.Clear;
Board.Show (Version);
LOOP
Take_Turn;
EXIT WHEN GameOver ;
END LOOP;
END Mahjongg;
|
with RP.Device;
with RP.I2C_Master;
with RP.GPIO;
with Pico;
package body BB_Pico_Bsp.I2C is
I2C_Port : RP.I2C_Master.I2C_Master_Port renames RP.Device.I2C_0;
I2C_SDA : RP.GPIO.GPIO_Point renames Pico.GP4;
I2C_SCL : RP.GPIO.GPIO_Point renames Pico.GP5;
procedure Initialize;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
I2C_SDA.Configure (RP.GPIO.Output, RP.GPIO.Pull_Up, RP.GPIO.I2C);
I2C_SCL.Configure (RP.GPIO.Output, RP.GPIO.Pull_Up, RP.GPIO.I2C);
I2C_Port.Configure (400_000);
end Initialize;
----------
-- Port --
----------
function Port return not null HAL.I2C.Any_I2C_Port is
begin
return I2C_Port'Access;
end Port;
begin
Initialize;
end BB_Pico_Bsp.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/>.
with System;
package Pck is
procedure Do_Nothing (A : System.Address);
end Pck;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.