CombinedText stringlengths 4 3.42M |
|---|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
-- A function behavior is an opaque behavior that does not access or modify
-- any objects or other external data.
------------------------------------------------------------------------------
with AMF.UML.Opaque_Behaviors;
package AMF.UML.Function_Behaviors is
pragma Preelaborate;
type UML_Function_Behavior is limited interface
and AMF.UML.Opaque_Behaviors.UML_Opaque_Behavior;
type UML_Function_Behavior_Access is
access all UML_Function_Behavior'Class;
for UML_Function_Behavior_Access'Storage_Size use 0;
end AMF.UML.Function_Behaviors;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . P O O L _ L O C A L --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-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/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Memory;
with Ada.Unchecked_Conversion;
package body System.Pool_Local is
package SSE renames System.Storage_Elements;
use type SSE.Storage_Offset;
Pointer_Size : constant SSE.Storage_Offset := Address'Size / Storage_Unit;
Pointers_Size : constant SSE.Storage_Offset := 2 * Pointer_Size;
type Acc_Address is access all Address;
function To_Acc_Address is
new Ada.Unchecked_Conversion (Address, Acc_Address);
-----------------------
-- Local Subprograms --
-----------------------
function Next (A : Address) return Acc_Address;
pragma Inline (Next);
-- Given an address of a block, return an access to the next block
function Prev (A : Address) return Acc_Address;
pragma Inline (Prev);
-- Given an address of a block, return an access to the previous block
--------------
-- Allocate --
--------------
procedure Allocate
(Pool : in out Unbounded_Reclaim_Pool;
Address : out System.Address;
Storage_Size : SSE.Storage_Count;
Alignment : SSE.Storage_Count)
is
pragma Warnings (Off, Alignment);
Allocated : constant System.Address :=
Memory.Alloc
(Memory.size_t (Storage_Size + Pointers_Size));
begin
-- The call to Alloc returns an address whose alignment is compatible
-- with the worst case alignment requirement for the machine; thus the
-- Alignment argument can be safely ignored.
if Allocated = Null_Address then
raise Storage_Error;
else
Address := Allocated + Pointers_Size;
Next (Allocated).all := Pool.First;
Prev (Allocated).all := Null_Address;
if Pool.First /= Null_Address then
Prev (Pool.First).all := Allocated;
end if;
Pool.First := Allocated;
end if;
end Allocate;
----------------
-- Deallocate --
----------------
procedure Deallocate
(Pool : in out Unbounded_Reclaim_Pool;
Address : System.Address;
Storage_Size : SSE.Storage_Count;
Alignment : SSE.Storage_Count)
is
pragma Warnings (Off, Storage_Size);
pragma Warnings (Off, Alignment);
Allocated : constant System.Address := Address - Pointers_Size;
begin
if Prev (Allocated).all = Null_Address then
Pool.First := Next (Allocated).all;
-- Comment needed
if Pool.First /= Null_Address then
Prev (Pool.First).all := Null_Address;
end if;
else
Next (Prev (Allocated).all).all := Next (Allocated).all;
end if;
if Next (Allocated).all /= Null_Address then
Prev (Next (Allocated).all).all := Prev (Allocated).all;
end if;
Memory.Free (Allocated);
end Deallocate;
--------------
-- Finalize --
--------------
procedure Finalize (Pool : in out Unbounded_Reclaim_Pool) is
N : System.Address := Pool.First;
Allocated : System.Address;
begin
while N /= Null_Address loop
Allocated := N;
N := Next (N).all;
Memory.Free (Allocated);
end loop;
end Finalize;
----------
-- Next --
----------
function Next (A : Address) return Acc_Address is
begin
return To_Acc_Address (A);
end Next;
----------
-- Prev --
----------
function Prev (A : Address) return Acc_Address is
begin
return To_Acc_Address (A + Pointer_Size);
end Prev;
end System.Pool_Local;
|
------------------------------------------------------------------------------
-- --
-- Copyright (c) 2014-2017 Vitalij Bondarenko <vibondare@gmail.com> --
-- --
------------------------------------------------------------------------------
-- --
-- The MIT License (MIT) --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, sublicense, and/or sell copies of the Software, and to --
-- permit persons to whom the Software is furnished to do so, subject to --
-- the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY --
-- CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, --
-- TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE --
-- SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
------------------------------------------------------------------------------
-- The set of functions to support message translation.
with Interfaces.C; use Interfaces.C;
with L10n; use L10n;
package I18n is
pragma Preelaborate;
function Gettext (Msg : String) return String;
-- Searches the currently selected message catalogs for a string which is
-- equal to Msg. If there is such a string available it is returned.
-- Otherwise the argument string Msg is returned.
function "-" (Msg : String) return String renames Gettext;
-- Shortcut for Gettext (Msg)
function Dgettext
(Domain : String; Msg : String) return String;
-- The Dgettext functions acts just like the Gettext function. It only
-- takes an additional first argument Domain which guides the selection of
-- the message catalogs which are searched for the translation. If the
-- Domain parameter is the empty string the Dgettext function is exactly
-- equivalent to Gettext since the default value for the domain name is
-- used.
function Dcgettext
(Domain : String; Msg : String; Category : Locale_Category) return String;
-- The Dcgettext adds another argument to those which Dgettext takes. This
-- argument Category specifies the last piece of information needed to
-- localize the message catalog. I.e., the domain name and the locale
-- category exactly specify which message catalog has to be used.
-- Look up Msg in the Domain message catalog for the Category locale.
function Ngettext
(Msg1 : String; Msg2 : String; N : unsigned_long) return String;
-- The Ngettext function is similar to the Gettext function as it finds the
-- message catalogs in the same way. But it takes two extra arguments.
-- The Msg1 parameter must contain the singular form of the string to be
-- converted. It is also used as the key for the search in the catalog.
-- The Msg2 parameter is the plural form. The parameter N is used to
-- determine the plural form. If no message catalog is found Msg1 is
-- returned if N = 1, otherwise Msg2.
function Dngettext
(Domain : String;
Msg1 : String;
Msg2 : String;
N : unsigned_long) return String;
-- The Dngettext is similar to the Dgettext function in the way the message
-- catalog is selected. The difference is that it takes two extra parameter
-- to provide the correct plural form. These two parameters are handled in
-- the same way Ngettext handles them.
function Dcngettext
(Domain : String;
Msg1 : String;
Msg2 : String;
N : unsigned_long;
Category : Locale_Category) return String;
-- The Dcngettext is similar to the Dcgettext function in the way the
-- message catalog is selected. The difference is that it takes two extra
-- parameter to provide the correct plural form. These two parameters are
-- handled in the same way Ngettext handles them.
procedure Text_Domain (Domain_Name : String);
-- Sets the default domain, which is used in all future Gettext calls,
-- to Domain_Name.
--
-- If the Domain_Name parameter is the empty string the default domain is
-- reset to its initial value, the domain with the name messages. This
-- possibility is questionable to use since the domain messages really
-- never should be used.
function Default_Text_Domain return String;
-- Return the currently selected default domain.
procedure Bind_Text_Domain (Domain_Name : String; Dirname : String);
-- The Bind_Text_Domain function can be used to specify the directory which
-- contains the message catalogs for domain Domain_Name for the different
-- languages. To be correct, this is the directory where the hierarchy of
-- directories is expected.
-- The Dirname string ought to be an absolute pathname.
function Text_Domain_Directory (Domain_Name : String) return String;
-- Returns the currently selected directory for the domain with the name
-- Domain_Name.
procedure Bind_Text_Domain_Codeset (Domain_Name : String; Codeset : String);
-- The Bind_Text_Domain_Codeset function can be used to specify the output
-- character set for message catalogs for domain Domain_Name. The Codeset
-- argument must be a valid codeset name which can be used for the
-- 'iconv_open' function from 'libc' library.
function Text_Domain_Codeset (Domain_Name : String) return String;
-- Returns the currently selected codeset for the domain with the name
-- Domain_Name. It returns empty string if no codeset has yet been selected.
end I18n;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . B B . C P U _ S P E C I F I C --
-- --
-- S p e c --
-- --
-- Copyright (C) 1999-2002 Universidad Politecnica de Madrid --
-- Copyright (C) 2003-2004 The European Space Agency --
-- Copyright (C) 2003-2020, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the primitives which are dependent on the
-- underlying processor.
pragma Restrictions (No_Elaboration_Code);
with System;
package System.BB.CPU_Specific is
pragma Preelaborate;
------------------------
-- Context management --
------------------------
-- The context buffer is a type that represents thread's state and is not
-- otherwise stored in main memory. This typically includes all user-
-- visible registers, and possibly some other status as well.
-- In case different contexts have different amounts of state (for example,
-- due to absence of a floating-point unit in a particular configuration,
-- or just the FPU not being used), it is expected that these details are
-- handled in the implementation.
type Context_Buffer is record
-- Only callee-saved registers need to be saved
R1 : System.Address;
R2 : System.Address;
R13 : System.Address;
R14 : System.Address;
R15 : System.Address;
R16 : System.Address;
R17 : System.Address;
R18 : System.Address;
R19 : System.Address;
R20 : System.Address;
R21 : System.Address;
R22 : System.Address;
R23 : System.Address;
R24 : System.Address;
R25 : System.Address;
R26 : System.Address;
R27 : System.Address;
R28 : System.Address;
R29 : System.Address;
R30 : System.Address;
R31 : System.Address;
CR : System.Address;
LR : System.Address;
F14 : Long_Float;
F15 : Long_Float;
F16 : Long_Float;
F17 : Long_Float;
F18 : Long_Float;
F19 : Long_Float;
F20 : Long_Float;
F21 : Long_Float;
F22 : Long_Float;
F23 : Long_Float;
F24 : Long_Float;
F25 : Long_Float;
F26 : Long_Float;
F27 : Long_Float;
F28 : Long_Float;
F29 : Long_Float;
F30 : Long_Float;
F31 : Long_Float;
FPSCR : Long_Long_Integer;
end record;
Stack_Alignment : constant := 16;
-- Stack alignment defined by the ABI
--------------------
-- Initialization --
--------------------
procedure Initialize_CPU;
procedure Finish_Initialize_Context
(Buffer : not null access Context_Buffer);
-- Complete context initialization
---------------------------------
-- Interrupt and trap handling --
---------------------------------
type Vector_Id is range 0 .. 16#2fff#;
External_Interrupt_Excp : constant Vector_Id := 16#500#;
Decrementer_Excp : constant Vector_Id := 16#900#;
System_Management_Excp : constant Vector_Id := 16#1400#;
procedure Install_Exception_Handler
(Service_Routine : System.Address;
Vector : Vector_Id);
-- Install a new handler in the exception table
procedure Install_Error_Handlers;
-- Called at system initialization time to install a CPU specific trap
-- handler, GNAT_Error_Handler, that converts synchronous traps to
-- appropriate exceptions.
-------------
-- Variant --
-------------
PowerPC_Book_E : constant Boolean := False;
-- Does the CPU implement PowerPC Book-E standard
------------------------------
-- CPU Register Definitions --
------------------------------
-- Machine State Register (MSR)
type Privilege is (Supervisor, User);
type Machine_State_Register is record
Power_Management_Enable : Boolean;
Temporary_GPR_Enable : Boolean;
Exception_Little_Endian_Enable : Boolean;
External_Interrupt_Enable : Boolean;
Privilege_Level : Privilege;
Floating_Point_Available : Boolean;
Machine_Check_Enable : Boolean;
FP_Exception_Mode_0 : Boolean;
Single_Step_Trace_Enable : Boolean;
Branch_Trace_Enable : Boolean;
FP_Exception_Mode_1 : Boolean;
Critical_Interrupt_Enable : Boolean;
Exception_Prefix : Boolean;
Instruction_Address_Space : Boolean;
Data_Address_Space : Boolean;
Recoverable_Exception : Boolean;
Little_Endian_Mode_Enable : Boolean;
end record with Size => 32;
for Machine_State_Register use record
Power_Management_Enable at 0 range 13 .. 13;
Temporary_GPR_Enable at 0 range 14 .. 14;
Exception_Little_Endian_Enable at 0 range 15 .. 15;
External_Interrupt_Enable at 0 range 16 .. 16;
Privilege_Level at 0 range 17 .. 17;
Floating_Point_Available at 0 range 18 .. 18;
Machine_Check_Enable at 0 range 19 .. 19;
FP_Exception_Mode_0 at 0 range 20 .. 20;
Single_Step_Trace_Enable at 0 range 21 .. 21;
Branch_Trace_Enable at 0 range 22 .. 22;
FP_Exception_Mode_1 at 0 range 23 .. 23;
Critical_Interrupt_Enable at 0 range 24 .. 24;
Exception_Prefix at 0 range 25 .. 25;
Instruction_Address_Space at 0 range 26 .. 26;
Data_Address_Space at 0 range 27 .. 27;
Recoverable_Exception at 0 range 30 .. 30;
Little_Endian_Mode_Enable at 0 range 31 .. 31;
end record;
end System.BB.CPU_Specific;
|
package body Opt15_Pkg is
procedure Trace_Non_Inlined is
begin
raise Program_Error;
end;
procedure Trace_Inlined is
begin
Trace_Non_Inlined;
end;
end Opt15_Pkg;
|
-- Copyright (c) 2015-2017 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
-- @summary
-- Incremental Analysis Component
--
-- @description
-- This package provides namespace for incremental analysis algorithms
-- and related data structures.
--
-- We try to (re-)implement ideas described by Tim A. Wagner his work
-- "Practical Algorithms for Incremental Software Development Environments"
--
-- For each analysed document we keep a persistent history of its parsing
-- tree changes as a sequence (actually tree) of versions. Each such version
-- represents consistent state. Each node of parsing tree provides a flag
-- to report if nested nodes were changed in given version of the document.
-- This allows us to quickly locate the changed subtrees.
--
package Incr is
pragma Pure;
end Incr;
|
--
-- 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.
--
--
package ewok.debug
with spark_mode => off
is
type t_level is (DEBUG, INFO, WARNING, ERROR, ALERT);
BG_COLOR_BLACK : constant string := ASCII.ESC & "[37;40m";
BG_COLOR_RED : constant string := ASCII.ESC & "[37;41m";
BG_COLOR_ORANGE : constant string := ASCII.ESC & "[37;43m";
BG_COLOR_BLUE : constant string := ASCII.ESC & "[37;44m";
procedure log (s : string; nl : boolean := true);
procedure log (level : t_level; s : string);
procedure alert (s : string);
procedure newline;
procedure panic (s : string);
end ewok.debug;
|
-- C34006G.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT THE REQUIRED PREDEFINED OPERATIONS ARE DECLARED
-- (IMPLICITLY) FOR DERIVED RECORD TYPES WITHOUT DISCRIMINANTS AND
-- WITH A LIMITED COMPONENT TYPE.
-- HISTORY:
-- JRK 08/24/87 CREATED ORIGINAL TEST.
-- PWN 11/30/94 REMOVED 'BASE USE ILLEGAL IN ADA 9X.
-- PWN 01/31/95 REMOVED INCONSISTENCIES WITH ADA 9X.
WITH SYSTEM; USE SYSTEM;
WITH REPORT; USE REPORT;
PROCEDURE C34006G IS
PACKAGE PKG_L IS
TYPE LP IS LIMITED PRIVATE;
FUNCTION CREATE (X : INTEGER) RETURN LP;
FUNCTION EQUAL (X, Y : LP) RETURN BOOLEAN;
PROCEDURE ASSIGN (X : OUT LP; Y : LP);
C1 : CONSTANT LP;
PRIVATE
TYPE LP IS NEW INTEGER;
C1 : CONSTANT LP := 1;
END PKG_L;
USE PKG_L;
SUBTYPE COMPONENT IS LP;
PACKAGE PKG_P IS
TYPE PARENT IS
RECORD
C : COMPONENT;
B : BOOLEAN := TRUE;
END RECORD;
FUNCTION EQUAL (X, Y : PARENT) RETURN BOOLEAN;
FUNCTION AGGR (C : COMPONENT; B : BOOLEAN) RETURN PARENT;
END PKG_P;
USE PKG_P;
TYPE T IS NEW PARENT;
X : T;
W : PARENT;
B : BOOLEAN := FALSE;
PROCEDURE A (X : ADDRESS) IS
BEGIN
B := IDENT_BOOL (TRUE);
END A;
PACKAGE BODY PKG_L IS
FUNCTION CREATE (X : INTEGER) RETURN LP IS
BEGIN
RETURN LP (IDENT_INT (X));
END CREATE;
FUNCTION EQUAL (X, Y : LP) RETURN BOOLEAN IS
BEGIN
RETURN X = Y;
END EQUAL;
PROCEDURE ASSIGN (X : OUT LP; Y : LP) IS
BEGIN
X := Y;
END ASSIGN;
END PKG_L;
PACKAGE BODY PKG_P IS
FUNCTION EQUAL (X, Y : PARENT) RETURN BOOLEAN IS
BEGIN
RETURN EQUAL (X.C, Y.C) AND X.B = Y.B;
END EQUAL;
FUNCTION AGGR (C : COMPONENT; B : BOOLEAN) RETURN PARENT IS
RESULT : PARENT;
BEGIN
ASSIGN (RESULT.C, C);
RESULT.B := B;
RETURN RESULT;
END AGGR;
END PKG_P;
BEGIN
TEST ("C34006G", "CHECK THAT THE REQUIRED PREDEFINED OPERATIONS " &
"ARE DECLARED (IMPLICITLY) FOR DERIVED " &
"RECORD TYPES WITHOUT DISCRIMINANTS AND WITH A " &
"LIMITED COMPONENT TYPE");
ASSIGN (X.C, CREATE (1));
X.B := IDENT_BOOL (TRUE);
ASSIGN (W.C, CREATE (1));
W.B := IDENT_BOOL (TRUE);
IF NOT EQUAL (T'(X), AGGR (C1, TRUE)) THEN
FAILED ("INCORRECT QUALIFICATION");
END IF;
IF NOT EQUAL (T (X), AGGR (C1, TRUE)) THEN
FAILED ("INCORRECT SELF CONVERSION");
END IF;
IF NOT EQUAL (T (W), AGGR (C1, TRUE)) THEN
FAILED ("INCORRECT CONVERSION FROM PARENT");
END IF;
IF NOT EQUAL (PARENT (X), AGGR (C1, TRUE)) THEN
FAILED ("INCORRECT CONVERSION TO PARENT");
END IF;
IF NOT EQUAL (X.C, C1) OR X.B /= TRUE THEN
FAILED ("INCORRECT SELECTION (VALUE)");
END IF;
X.B := IDENT_BOOL (FALSE);
IF NOT EQUAL (X, AGGR (C1, FALSE)) THEN
FAILED ("INCORRECT SELECTION (ASSIGNMENT)");
END IF;
X.B := IDENT_BOOL (TRUE);
IF NOT (X IN T) THEN
FAILED ("INCORRECT ""IN""");
END IF;
IF X NOT IN T THEN
FAILED ("INCORRECT ""NOT IN""");
END IF;
B := FALSE;
A (X'ADDRESS);
IF NOT B THEN
FAILED ("INCORRECT 'ADDRESS");
END IF;
IF X.C'FIRST_BIT < 0 THEN
FAILED ("INCORRECT 'FIRST_BIT");
END IF;
IF X.C'LAST_BIT < 0 OR
X.C'LAST_BIT - X.C'FIRST_BIT + 1 /= X.C'SIZE THEN
FAILED ("INCORRECT 'LAST_BIT");
END IF;
IF X.C'POSITION < 0 THEN
FAILED ("INCORRECT 'POSITION");
END IF;
IF X'SIZE < T'SIZE OR
X.C'SIZE < COMPONENT'SIZE OR
X.B'SIZE < BOOLEAN'SIZE THEN
FAILED ("INCORRECT OBJECT'SIZE");
END IF;
RESULT;
END C34006G;
|
pragma License (Unrestricted);
-- implementation unit required by compiler
package System.Parameters is
pragma Pure;
-- required for task by compiler (s-parame.ads)
type Size_Type is new Integer;
Unspecified_Size : constant := Size_Type'First;
-- required for 'Storage_Size by compiler (s-parame.ads)
function Adjust_Storage_Size (Size : Size_Type) return Size_Type
renames "+"; -- no effect
-- required by compiler ??? (s-parame.ads)
-- function Default_Stack_Size return Size_Type;
-- Garbage_Collected : constant Boolean := False;
end System.Parameters;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A D A . E X C E P T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- No subprogram ordering check, due to logical grouping
pragma Polling (Off);
-- We must turn polling off for this unit, because otherwise we get
-- elaboration circularities with System.Exception_Tables.
with System; use System;
with System.Exceptions; use System.Exceptions;
with System.Exceptions_Debug; use System.Exceptions_Debug;
with System.Standard_Library; use System.Standard_Library;
with System.Soft_Links; use System.Soft_Links;
with System.WCh_Con; use System.WCh_Con;
with System.WCh_StW; use System.WCh_StW;
pragma Warnings (Off);
-- Suppress complaints about Symbolic not being referenced, and about it not
-- having pragma Preelaborate.
with System.Traceback.Symbolic;
-- Bring Symbolic into the closure. If it is the s-trasym-dwarf.adb version,
-- it will install symbolic tracebacks as the default decorator. Otherwise,
-- symbolic tracebacks are not supported, and we fall back to hexadecimal
-- addresses.
pragma Warnings (On);
package body Ada.Exceptions is
pragma Suppress (All_Checks);
-- We definitely do not want exceptions occurring within this unit, or
-- we are in big trouble. If an exceptional situation does occur, better
-- that it not be raised, since raising it can cause confusing chaos.
-----------------------
-- Local Subprograms --
-----------------------
-- Note: the exported subprograms in this package body are called directly
-- from C clients using the given external name, even though they are not
-- technically visible in the Ada sense.
function Code_Address_For_AAA return System.Address;
function Code_Address_For_ZZZ return System.Address;
-- Return start and end of procedures in this package
--
-- These procedures are used to provide exclusion bounds in
-- calls to Call_Chain at exception raise points from this unit. The
-- purpose is to arrange for the exception tracebacks not to include
-- frames from subprograms involved in the raise process, as these are
-- meaningless from the user's standpoint.
--
-- For these bounds to be meaningful, we need to ensure that the object
-- code for the subprograms involved in processing a raise is located
-- after the object code Code_Address_For_AAA and before the object
-- code Code_Address_For_ZZZ. This will indeed be the case as long as
-- the following rules are respected:
--
-- 1) The bodies of the subprograms involved in processing a raise
-- are located after the body of Code_Address_For_AAA and before the
-- body of Code_Address_For_ZZZ.
--
-- 2) No pragma Inline applies to any of these subprograms, as this
-- could delay the corresponding assembly output until the end of
-- the unit.
procedure Call_Chain (Excep : EOA);
-- Store up to Max_Tracebacks in Excep, corresponding to the current
-- call chain.
function Image (Index : Integer) return String;
-- Return string image corresponding to Index
procedure To_Stderr (S : String);
pragma Export (Ada, To_Stderr, "__gnat_to_stderr");
-- Little routine to output string to stderr that is also used
-- in the tasking run time.
procedure To_Stderr (C : Character);
pragma Inline (To_Stderr);
pragma Export (Ada, To_Stderr, "__gnat_to_stderr_char");
-- Little routine to output a character to stderr, used by some of
-- the separate units below.
package Exception_Data is
-----------------------------------
-- Exception Message Subprograms --
-----------------------------------
procedure Set_Exception_C_Msg
(Excep : EOA;
Id : Exception_Id;
Msg1 : System.Address;
Line : Integer := 0;
Column : Integer := 0;
Msg2 : System.Address := System.Null_Address);
-- This routine is called to setup the exception referenced by X
-- to contain the indicated Id value and message. Msg1 is a null
-- terminated string which is generated as the exception message. If
-- line is non-zero, then a colon and the decimal representation of
-- this integer is appended to the message. Ditto for Column. When Msg2
-- is non-null, a space and this additional null terminated string is
-- added to the message.
procedure Set_Exception_Msg
(Excep : EOA;
Id : Exception_Id;
Message : String);
-- This routine is called to setup the exception referenced by X
-- to contain the indicated Id value and message. Message is a string
-- which is generated as the exception message.
---------------------------------------
-- Exception Information Subprograms --
---------------------------------------
function Untailored_Exception_Information
(X : Exception_Occurrence) return String;
-- This is used by Stream_Attributes.EO_To_String to convert an
-- Exception_Occurrence to a String for the stream attributes.
-- String_To_EO understands the format, as documented here.
--
-- The format of the string is as follows:
--
-- raised <exception name> : <message>
-- (" : <message>" is present only if Exception_Message is not empty)
-- PID=nnnn (only if nonzero)
-- Call stack traceback locations: (only if at least one location)
-- <0xyyyyyyyy 0xyyyyyyyy ...> (is recorded)
--
-- The lines are separated by a ASCII.LF character.
-- The nnnn is the partition Id given as decimal digits.
-- The 0x... line represents traceback program counter locations, in
-- execution order with the first one being the exception location.
--
-- The Exception_Name and Message lines are omitted in the abort
-- signal case, since this is not really an exception.
--
-- Note: If the format of the generated string is changed, please note
-- that an equivalent modification to the routine String_To_EO must be
-- made to preserve proper functioning of the stream attributes.
function Exception_Information (X : Exception_Occurrence) return String;
-- This is the implementation of Ada.Exceptions.Exception_Information,
-- as defined in the Ada RM.
--
-- If no traceback decorator (see GNAT.Exception_Traces) is currently
-- in place, this is the same as Untailored_Exception_Information.
-- Otherwise, the decorator is used to produce a symbolic traceback
-- instead of hexadecimal addresses.
--
-- Note that unlike Untailored_Exception_Information, there is no need
-- to keep the output of Exception_Information stable for streaming
-- purposes, and in fact the output differs across platforms.
end Exception_Data;
package Exception_Traces is
-------------------------------------------------
-- Run-Time Exception Notification Subprograms --
-------------------------------------------------
-- These subprograms provide a common run-time interface to trigger the
-- actions required when an exception is about to be propagated (e.g.
-- user specified actions or output of exception information). They are
-- exported to be usable by the Ada exception handling personality
-- routine when the GCC 3 mechanism is used.
procedure Notify_Handled_Exception (Excep : EOA);
pragma Export
(C, Notify_Handled_Exception, "__gnat_notify_handled_exception");
-- This routine is called for a handled occurrence is about to be
-- propagated.
procedure Notify_Unhandled_Exception (Excep : EOA);
pragma Export
(C, Notify_Unhandled_Exception, "__gnat_notify_unhandled_exception");
-- This routine is called when an unhandled occurrence is about to be
-- propagated.
procedure Unhandled_Exception_Terminate (Excep : EOA);
pragma No_Return (Unhandled_Exception_Terminate);
-- This procedure is called to terminate execution following an
-- unhandled exception. The exception information, including
-- traceback if available is output, and execution is then
-- terminated. Note that at the point where this routine is
-- called, the stack has typically been destroyed.
end Exception_Traces;
package Exception_Propagation is
---------------------------------------
-- Exception Propagation Subprograms --
---------------------------------------
function Allocate_Occurrence return EOA;
-- Allocate an exception occurrence (as well as the machine occurrence)
procedure Propagate_Exception (Excep : Exception_Occurrence);
pragma No_Return (Propagate_Exception);
-- This procedure propagates the exception represented by Excep
end Exception_Propagation;
package Stream_Attributes is
----------------------------------
-- Stream Attribute Subprograms --
----------------------------------
function EId_To_String (X : Exception_Id) return String;
function String_To_EId (S : String) return Exception_Id;
-- Functions for implementing Exception_Id stream attributes
function EO_To_String (X : Exception_Occurrence) return String;
function String_To_EO (S : String) return Exception_Occurrence;
-- Functions for implementing Exception_Occurrence stream
-- attributes
end Stream_Attributes;
procedure Complete_Occurrence (X : EOA);
-- Finish building the occurrence: save the call chain and notify the
-- debugger.
procedure Complete_And_Propagate_Occurrence (X : EOA);
pragma No_Return (Complete_And_Propagate_Occurrence);
-- This is a simple wrapper to Complete_Occurrence and
-- Exception_Propagation.Propagate_Exception.
function Create_Occurrence_From_Signal_Handler
(E : Exception_Id;
M : System.Address) return EOA;
-- Create and build an exception occurrence using exception id E and
-- nul-terminated message M.
function Create_Machine_Occurrence_From_Signal_Handler
(E : Exception_Id;
M : System.Address) return System.Address;
pragma Export (C, Create_Machine_Occurrence_From_Signal_Handler,
"__gnat_create_machine_occurrence_from_signal_handler");
-- Create and build an exception occurrence using exception id E and
-- nul-terminated message M. Return the machine occurrence.
procedure Raise_Exception_No_Defer
(E : Exception_Id;
Message : String := "");
pragma Export
(Ada, Raise_Exception_No_Defer,
"ada__exceptions__raise_exception_no_defer");
pragma No_Return (Raise_Exception_No_Defer);
-- Similar to Raise_Exception, but with no abort deferral
procedure Raise_With_Msg (E : Exception_Id);
pragma No_Return (Raise_With_Msg);
pragma Export (C, Raise_With_Msg, "__gnat_raise_with_msg");
-- Raises an exception with given exception id value. A message
-- is associated with the raise, and has already been stored in the
-- exception occurrence referenced by the Current_Excep in the TSD.
-- Abort is deferred before the raise call.
procedure Raise_With_Location_And_Msg
(E : Exception_Id;
F : System.Address;
L : Integer;
C : Integer := 0;
M : System.Address := System.Null_Address);
pragma No_Return (Raise_With_Location_And_Msg);
-- Raise an exception with given exception id value. A filename and line
-- number is associated with the raise and is stored in the exception
-- occurrence and in addition a column and a string message M may be
-- appended to this (if not null/0).
procedure Raise_Constraint_Error (File : System.Address; Line : Integer);
pragma No_Return (Raise_Constraint_Error);
pragma Export (C, Raise_Constraint_Error, "__gnat_raise_constraint_error");
-- Raise constraint error with file:line information
procedure Raise_Constraint_Error_Msg
(File : System.Address;
Line : Integer;
Column : Integer;
Msg : System.Address);
pragma No_Return (Raise_Constraint_Error_Msg);
pragma Export
(C, Raise_Constraint_Error_Msg, "__gnat_raise_constraint_error_msg");
-- Raise constraint error with file:line:col + msg information
procedure Raise_Program_Error (File : System.Address; Line : Integer);
pragma No_Return (Raise_Program_Error);
pragma Export (C, Raise_Program_Error, "__gnat_raise_program_error");
-- Raise program error with file:line information
procedure Raise_Program_Error_Msg
(File : System.Address;
Line : Integer;
Msg : System.Address);
pragma No_Return (Raise_Program_Error_Msg);
pragma Export
(C, Raise_Program_Error_Msg, "__gnat_raise_program_error_msg");
-- Raise program error with file:line + msg information
procedure Raise_Storage_Error (File : System.Address; Line : Integer);
pragma No_Return (Raise_Storage_Error);
pragma Export (C, Raise_Storage_Error, "__gnat_raise_storage_error");
-- Raise storage error with file:line information
procedure Raise_Storage_Error_Msg
(File : System.Address;
Line : Integer;
Msg : System.Address);
pragma No_Return (Raise_Storage_Error_Msg);
pragma Export
(C, Raise_Storage_Error_Msg, "__gnat_raise_storage_error_msg");
-- Raise storage error with file:line + reason msg information
-- The exception raising process and the automatic tracing mechanism rely
-- on some careful use of flags attached to the exception occurrence. The
-- graph below illustrates the relations between the Raise_ subprograms
-- and identifies the points where basic flags such as Exception_Raised
-- are initialized.
-- (i) signs indicate the flags initialization points. R stands for Raise,
-- W for With, and E for Exception.
-- R_No_Msg R_E R_Pe R_Ce R_Se
-- | | | | |
-- +--+ +--+ +---+ | +---+
-- | | | | |
-- R_E_No_Defer(i) R_W_Msg(i) R_W_Loc
-- | | | |
-- +------------+ | +-----------+ +--+
-- | | | |
-- | | | Set_E_C_Msg(i)
-- | | |
-- Complete_And_Propagate_Occurrence
procedure Reraise;
pragma No_Return (Reraise);
pragma Export (C, Reraise, "__gnat_reraise");
-- Reraises the exception referenced by the Current_Excep field
-- of the TSD (all fields of this exception occurrence are set).
-- Abort is deferred before the reraise operation. Called from
-- System.Tasking.RendezVous.Exceptional_Complete_RendezVous
procedure Transfer_Occurrence
(Target : Exception_Occurrence_Access;
Source : Exception_Occurrence);
pragma Export (C, Transfer_Occurrence, "__gnat_transfer_occurrence");
-- Called from s-tasren.adb:Local_Complete_RendezVous and
-- s-tpobop.adb:Exceptional_Complete_Entry_Body to setup Target from
-- Source as an exception to be propagated in the caller task. Target is
-- expected to be a pointer to the fixed TSD occurrence for this task.
--------------------------------
-- Run-Time Check Subprograms --
--------------------------------
-- These subprograms raise a specific exception with a reason message
-- attached. The parameters are the file name and line number in each
-- case. The names are defined by Exp_Ch11.Get_RT_Exception_Name.
procedure Rcheck_CE_Access_Check
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Null_Access_Parameter
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Discriminant_Check
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Divide_By_Zero
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Explicit_Raise
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Index_Check
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Invalid_Data
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Length_Check
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Null_Exception_Id
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Null_Not_Allowed
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Overflow_Check
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Partition_Check
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Range_Check
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Tag_Check
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Access_Before_Elaboration
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Accessibility_Check
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Address_Of_Intrinsic
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Aliased_Parameters
(File : System.Address; Line : Integer);
procedure Rcheck_PE_All_Guards_Closed
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Bad_Predicated_Generic_Type
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Build_In_Place_Mismatch
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Current_Task_In_Entry_Body
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Duplicated_Entry_Address
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Explicit_Raise
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Implicit_Return
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Misaligned_Address_Value
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Missing_Return
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Non_Transportable_Actual
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Overlaid_Controlled_Object
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Potentially_Blocking_Operation
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Stubbed_Subprogram_Called
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Unchecked_Union_Restriction
(File : System.Address; Line : Integer);
procedure Rcheck_SE_Empty_Storage_Pool
(File : System.Address; Line : Integer);
procedure Rcheck_SE_Explicit_Raise
(File : System.Address; Line : Integer);
procedure Rcheck_SE_Infinite_Recursion
(File : System.Address; Line : Integer);
procedure Rcheck_SE_Object_Too_Large
(File : System.Address; Line : Integer);
procedure Rcheck_PE_Stream_Operation_Not_Allowed
(File : System.Address; Line : Integer);
procedure Rcheck_CE_Access_Check_Ext
(File : System.Address; Line, Column : Integer);
procedure Rcheck_CE_Index_Check_Ext
(File : System.Address; Line, Column, Index, First, Last : Integer);
procedure Rcheck_CE_Invalid_Data_Ext
(File : System.Address; Line, Column, Index, First, Last : Integer);
procedure Rcheck_CE_Range_Check_Ext
(File : System.Address; Line, Column, Index, First, Last : Integer);
procedure Rcheck_PE_Finalize_Raised_Exception
(File : System.Address; Line : Integer);
-- This routine is separated out because it has quite different behavior
-- from the others. This is the "finalize/adjust raised exception". This
-- subprogram is always called with abort deferred, unlike all other
-- Rcheck_* subprograms, it needs to call Raise_Exception_No_Defer.
pragma Export (C, Rcheck_CE_Access_Check,
"__gnat_rcheck_CE_Access_Check");
pragma Export (C, Rcheck_CE_Null_Access_Parameter,
"__gnat_rcheck_CE_Null_Access_Parameter");
pragma Export (C, Rcheck_CE_Discriminant_Check,
"__gnat_rcheck_CE_Discriminant_Check");
pragma Export (C, Rcheck_CE_Divide_By_Zero,
"__gnat_rcheck_CE_Divide_By_Zero");
pragma Export (C, Rcheck_CE_Explicit_Raise,
"__gnat_rcheck_CE_Explicit_Raise");
pragma Export (C, Rcheck_CE_Index_Check,
"__gnat_rcheck_CE_Index_Check");
pragma Export (C, Rcheck_CE_Invalid_Data,
"__gnat_rcheck_CE_Invalid_Data");
pragma Export (C, Rcheck_CE_Length_Check,
"__gnat_rcheck_CE_Length_Check");
pragma Export (C, Rcheck_CE_Null_Exception_Id,
"__gnat_rcheck_CE_Null_Exception_Id");
pragma Export (C, Rcheck_CE_Null_Not_Allowed,
"__gnat_rcheck_CE_Null_Not_Allowed");
pragma Export (C, Rcheck_CE_Overflow_Check,
"__gnat_rcheck_CE_Overflow_Check");
pragma Export (C, Rcheck_CE_Partition_Check,
"__gnat_rcheck_CE_Partition_Check");
pragma Export (C, Rcheck_CE_Range_Check,
"__gnat_rcheck_CE_Range_Check");
pragma Export (C, Rcheck_CE_Tag_Check,
"__gnat_rcheck_CE_Tag_Check");
pragma Export (C, Rcheck_PE_Access_Before_Elaboration,
"__gnat_rcheck_PE_Access_Before_Elaboration");
pragma Export (C, Rcheck_PE_Accessibility_Check,
"__gnat_rcheck_PE_Accessibility_Check");
pragma Export (C, Rcheck_PE_Address_Of_Intrinsic,
"__gnat_rcheck_PE_Address_Of_Intrinsic");
pragma Export (C, Rcheck_PE_Aliased_Parameters,
"__gnat_rcheck_PE_Aliased_Parameters");
pragma Export (C, Rcheck_PE_All_Guards_Closed,
"__gnat_rcheck_PE_All_Guards_Closed");
pragma Export (C, Rcheck_PE_Bad_Predicated_Generic_Type,
"__gnat_rcheck_PE_Bad_Predicated_Generic_Type");
pragma Export (C, Rcheck_PE_Build_In_Place_Mismatch,
"__gnat_rcheck_PE_Build_In_Place_Mismatch");
pragma Export (C, Rcheck_PE_Current_Task_In_Entry_Body,
"__gnat_rcheck_PE_Current_Task_In_Entry_Body");
pragma Export (C, Rcheck_PE_Duplicated_Entry_Address,
"__gnat_rcheck_PE_Duplicated_Entry_Address");
pragma Export (C, Rcheck_PE_Explicit_Raise,
"__gnat_rcheck_PE_Explicit_Raise");
pragma Export (C, Rcheck_PE_Finalize_Raised_Exception,
"__gnat_rcheck_PE_Finalize_Raised_Exception");
pragma Export (C, Rcheck_PE_Implicit_Return,
"__gnat_rcheck_PE_Implicit_Return");
pragma Export (C, Rcheck_PE_Misaligned_Address_Value,
"__gnat_rcheck_PE_Misaligned_Address_Value");
pragma Export (C, Rcheck_PE_Missing_Return,
"__gnat_rcheck_PE_Missing_Return");
pragma Export (C, Rcheck_PE_Non_Transportable_Actual,
"__gnat_rcheck_PE_Non_Transportable_Actual");
pragma Export (C, Rcheck_PE_Overlaid_Controlled_Object,
"__gnat_rcheck_PE_Overlaid_Controlled_Object");
pragma Export (C, Rcheck_PE_Potentially_Blocking_Operation,
"__gnat_rcheck_PE_Potentially_Blocking_Operation");
pragma Export (C, Rcheck_PE_Stream_Operation_Not_Allowed,
"__gnat_rcheck_PE_Stream_Operation_Not_Allowed");
pragma Export (C, Rcheck_PE_Stubbed_Subprogram_Called,
"__gnat_rcheck_PE_Stubbed_Subprogram_Called");
pragma Export (C, Rcheck_PE_Unchecked_Union_Restriction,
"__gnat_rcheck_PE_Unchecked_Union_Restriction");
pragma Export (C, Rcheck_SE_Empty_Storage_Pool,
"__gnat_rcheck_SE_Empty_Storage_Pool");
pragma Export (C, Rcheck_SE_Explicit_Raise,
"__gnat_rcheck_SE_Explicit_Raise");
pragma Export (C, Rcheck_SE_Infinite_Recursion,
"__gnat_rcheck_SE_Infinite_Recursion");
pragma Export (C, Rcheck_SE_Object_Too_Large,
"__gnat_rcheck_SE_Object_Too_Large");
pragma Export (C, Rcheck_CE_Access_Check_Ext,
"__gnat_rcheck_CE_Access_Check_ext");
pragma Export (C, Rcheck_CE_Index_Check_Ext,
"__gnat_rcheck_CE_Index_Check_ext");
pragma Export (C, Rcheck_CE_Invalid_Data_Ext,
"__gnat_rcheck_CE_Invalid_Data_ext");
pragma Export (C, Rcheck_CE_Range_Check_Ext,
"__gnat_rcheck_CE_Range_Check_ext");
-- None of these procedures ever returns (they raise an exception). By
-- using pragma No_Return, we ensure that any junk code after the call,
-- such as normal return epilogue stuff, can be eliminated).
pragma No_Return (Rcheck_CE_Access_Check);
pragma No_Return (Rcheck_CE_Null_Access_Parameter);
pragma No_Return (Rcheck_CE_Discriminant_Check);
pragma No_Return (Rcheck_CE_Divide_By_Zero);
pragma No_Return (Rcheck_CE_Explicit_Raise);
pragma No_Return (Rcheck_CE_Index_Check);
pragma No_Return (Rcheck_CE_Invalid_Data);
pragma No_Return (Rcheck_CE_Length_Check);
pragma No_Return (Rcheck_CE_Null_Exception_Id);
pragma No_Return (Rcheck_CE_Null_Not_Allowed);
pragma No_Return (Rcheck_CE_Overflow_Check);
pragma No_Return (Rcheck_CE_Partition_Check);
pragma No_Return (Rcheck_CE_Range_Check);
pragma No_Return (Rcheck_CE_Tag_Check);
pragma No_Return (Rcheck_PE_Access_Before_Elaboration);
pragma No_Return (Rcheck_PE_Accessibility_Check);
pragma No_Return (Rcheck_PE_Address_Of_Intrinsic);
pragma No_Return (Rcheck_PE_Aliased_Parameters);
pragma No_Return (Rcheck_PE_All_Guards_Closed);
pragma No_Return (Rcheck_PE_Bad_Predicated_Generic_Type);
pragma No_Return (Rcheck_PE_Build_In_Place_Mismatch);
pragma No_Return (Rcheck_PE_Current_Task_In_Entry_Body);
pragma No_Return (Rcheck_PE_Duplicated_Entry_Address);
pragma No_Return (Rcheck_PE_Explicit_Raise);
pragma No_Return (Rcheck_PE_Implicit_Return);
pragma No_Return (Rcheck_PE_Misaligned_Address_Value);
pragma No_Return (Rcheck_PE_Missing_Return);
pragma No_Return (Rcheck_PE_Non_Transportable_Actual);
pragma No_Return (Rcheck_PE_Overlaid_Controlled_Object);
pragma No_Return (Rcheck_PE_Potentially_Blocking_Operation);
pragma No_Return (Rcheck_PE_Stream_Operation_Not_Allowed);
pragma No_Return (Rcheck_PE_Stubbed_Subprogram_Called);
pragma No_Return (Rcheck_PE_Unchecked_Union_Restriction);
pragma No_Return (Rcheck_PE_Finalize_Raised_Exception);
pragma No_Return (Rcheck_SE_Empty_Storage_Pool);
pragma No_Return (Rcheck_SE_Explicit_Raise);
pragma No_Return (Rcheck_SE_Infinite_Recursion);
pragma No_Return (Rcheck_SE_Object_Too_Large);
pragma No_Return (Rcheck_CE_Access_Check_Ext);
pragma No_Return (Rcheck_CE_Index_Check_Ext);
pragma No_Return (Rcheck_CE_Invalid_Data_Ext);
pragma No_Return (Rcheck_CE_Range_Check_Ext);
---------------------------------------------
-- Reason Strings for Run-Time Check Calls --
---------------------------------------------
-- These strings are null-terminated and are used by Rcheck_nn. The
-- strings correspond to the definitions for Types.RT_Exception_Code.
use ASCII;
Rmsg_00 : constant String := "access check failed" & NUL;
Rmsg_01 : constant String := "access parameter is null" & NUL;
Rmsg_02 : constant String := "discriminant check failed" & NUL;
Rmsg_03 : constant String := "divide by zero" & NUL;
Rmsg_04 : constant String := "explicit raise" & NUL;
Rmsg_05 : constant String := "index check failed" & NUL;
Rmsg_06 : constant String := "invalid data" & NUL;
Rmsg_07 : constant String := "length check failed" & NUL;
Rmsg_08 : constant String := "null Exception_Id" & NUL;
Rmsg_09 : constant String := "null-exclusion check failed" & NUL;
Rmsg_10 : constant String := "overflow check failed" & NUL;
Rmsg_11 : constant String := "partition check failed" & NUL;
Rmsg_12 : constant String := "range check failed" & NUL;
Rmsg_13 : constant String := "tag check failed" & NUL;
Rmsg_14 : constant String := "access before elaboration" & NUL;
Rmsg_15 : constant String := "accessibility check failed" & NUL;
Rmsg_16 : constant String := "attempt to take address of" &
" intrinsic subprogram" & NUL;
Rmsg_17 : constant String := "aliased parameters" & NUL;
Rmsg_18 : constant String := "all guards closed" & NUL;
Rmsg_19 : constant String := "improper use of generic subtype" &
" with predicate" & NUL;
Rmsg_20 : constant String := "Current_Task referenced in entry" &
" body" & NUL;
Rmsg_21 : constant String := "duplicated entry address" & NUL;
Rmsg_22 : constant String := "explicit raise" & NUL;
Rmsg_23 : constant String := "finalize/adjust raised exception" & NUL;
Rmsg_24 : constant String := "implicit return with No_Return" & NUL;
Rmsg_25 : constant String := "misaligned address value" & NUL;
Rmsg_26 : constant String := "missing return" & NUL;
Rmsg_27 : constant String := "overlaid controlled object" & NUL;
Rmsg_28 : constant String := "potentially blocking operation" & NUL;
Rmsg_29 : constant String := "stubbed subprogram called" & NUL;
Rmsg_30 : constant String := "unchecked union restriction" & NUL;
Rmsg_31 : constant String := "actual/returned class-wide" &
" value not transportable" & NUL;
Rmsg_32 : constant String := "empty storage pool" & NUL;
Rmsg_33 : constant String := "explicit raise" & NUL;
Rmsg_34 : constant String := "infinite recursion" & NUL;
Rmsg_35 : constant String := "object too large" & NUL;
Rmsg_36 : constant String := "stream operation not allowed" & NUL;
Rmsg_37 : constant String := "build-in-place mismatch" & NUL;
-----------------------
-- Polling Interface --
-----------------------
type Unsigned is mod 2 ** 32;
Counter : Unsigned := 0;
pragma Warnings (Off, Counter);
-- This counter is provided for convenience. It can be used in Poll to
-- perform periodic but not systematic operations.
procedure Poll is separate;
-- The actual polling routine is separate, so that it can easily be
-- replaced with a target dependent version.
--------------------------
-- Code_Address_For_AAA --
--------------------------
-- This function gives us the start of the PC range for addresses within
-- the exception unit itself. We hope that gigi/gcc keep all the procedures
-- in their original order.
function Code_Address_For_AAA return System.Address is
begin
-- We are using a label instead of Code_Address_For_AAA'Address because
-- on some platforms the latter does not yield the address we want, but
-- the address of a stub or of a descriptor instead. This is the case at
-- least on PA-HPUX.
<<Start_Of_AAA>>
return Start_Of_AAA'Address;
end Code_Address_For_AAA;
----------------
-- Call_Chain --
----------------
procedure Call_Chain (Excep : EOA) is separate;
-- The actual Call_Chain routine is separate, so that it can easily
-- be dummied out when no exception traceback information is needed.
-------------------
-- EId_To_String --
-------------------
function EId_To_String (X : Exception_Id) return String
renames Stream_Attributes.EId_To_String;
------------------
-- EO_To_String --
------------------
-- We use the null string to represent the null occurrence, otherwise we
-- output the Untailored_Exception_Information string for the occurrence.
function EO_To_String (X : Exception_Occurrence) return String
renames Stream_Attributes.EO_To_String;
------------------------
-- Exception_Identity --
------------------------
function Exception_Identity
(X : Exception_Occurrence) return Exception_Id
is
begin
-- Note that the following test used to be here for the original
-- Ada 95 semantics, but these were modified by AI-241 to require
-- returning Null_Id instead of raising Constraint_Error.
-- if X.Id = Null_Id then
-- raise Constraint_Error;
-- end if;
return X.Id;
end Exception_Identity;
---------------------------
-- Exception_Information --
---------------------------
function Exception_Information (X : Exception_Occurrence) return String is
begin
if X.Id = Null_Id then
raise Constraint_Error;
else
return Exception_Data.Exception_Information (X);
end if;
end Exception_Information;
-----------------------
-- Exception_Message --
-----------------------
function Exception_Message (X : Exception_Occurrence) return String is
begin
if X.Id = Null_Id then
raise Constraint_Error;
else
return X.Msg (1 .. X.Msg_Length);
end if;
end Exception_Message;
--------------------
-- Exception_Name --
--------------------
function Exception_Name (Id : Exception_Id) return String is
begin
if Id = null then
raise Constraint_Error;
else
return To_Ptr (Id.Full_Name) (1 .. Id.Name_Length - 1);
end if;
end Exception_Name;
function Exception_Name (X : Exception_Occurrence) return String is
begin
return Exception_Name (X.Id);
end Exception_Name;
---------------------------
-- Exception_Name_Simple --
---------------------------
function Exception_Name_Simple (X : Exception_Occurrence) return String is
Name : constant String := Exception_Name (X);
P : Natural;
begin
P := Name'Length;
while P > 1 loop
exit when Name (P - 1) = '.';
P := P - 1;
end loop;
-- Return result making sure lower bound is 1
declare
subtype Rname is String (1 .. Name'Length - P + 1);
begin
return Rname (Name (P .. Name'Length));
end;
end Exception_Name_Simple;
--------------------
-- Exception_Data --
--------------------
package body Exception_Data is separate;
-- This package can be easily dummied out if we do not want the basic
-- support for exception messages (such as in Ada 83).
---------------------------
-- Exception_Propagation --
---------------------------
package body Exception_Propagation is separate;
-- Depending on the actual exception mechanism used (front-end or
-- back-end based), the implementation will differ, which is why this
-- package is separated.
----------------------
-- Exception_Traces --
----------------------
package body Exception_Traces is separate;
-- Depending on the underlying support for IO the implementation will
-- differ. Moreover we would like to dummy out this package in case we
-- do not want any exception tracing support. This is why this package
-- is separated.
--------------------------------------
-- Get_Exception_Machine_Occurrence --
--------------------------------------
function Get_Exception_Machine_Occurrence
(X : Exception_Occurrence) return System.Address
is
begin
return X.Machine_Occurrence;
end Get_Exception_Machine_Occurrence;
-----------
-- Image --
-----------
function Image (Index : Integer) return String is
Result : constant String := Integer'Image (Index);
begin
if Result (1) = ' ' then
return Result (2 .. Result'Last);
else
return Result;
end if;
end Image;
-----------------------
-- Stream Attributes --
-----------------------
package body Stream_Attributes is separate;
-- This package can be easily dummied out if we do not want the
-- support for streaming Exception_Ids and Exception_Occurrences.
----------------------------
-- Raise_Constraint_Error --
----------------------------
procedure Raise_Constraint_Error (File : System.Address; Line : Integer) is
begin
Raise_With_Location_And_Msg (Constraint_Error_Def'Access, File, Line);
end Raise_Constraint_Error;
--------------------------------
-- Raise_Constraint_Error_Msg --
--------------------------------
procedure Raise_Constraint_Error_Msg
(File : System.Address;
Line : Integer;
Column : Integer;
Msg : System.Address)
is
begin
Raise_With_Location_And_Msg
(Constraint_Error_Def'Access, File, Line, Column, Msg);
end Raise_Constraint_Error_Msg;
-------------------------
-- Complete_Occurrence --
-------------------------
procedure Complete_Occurrence (X : EOA) is
begin
-- Compute the backtrace for this occurrence if the corresponding
-- binder option has been set. Call_Chain takes care of the reraise
-- case.
-- ??? Using Call_Chain here means we are going to walk up the stack
-- once only for backtracing purposes before doing it again for the
-- propagation per se.
-- The first inspection is much lighter, though, as it only requires
-- partial unwinding of each frame. Additionally, although we could use
-- the personality routine to record the addresses while propagating,
-- this method has two drawbacks:
-- 1) the trace is incomplete if the exception is handled since we
-- don't walk past the frame with the handler,
-- and
-- 2) we would miss the frames for which our personality routine is not
-- called, e.g. if C or C++ calls are on the way.
Call_Chain (X);
-- Notify the debugger
Debug_Raise_Exception
(E => SSL.Exception_Data_Ptr (X.Id),
Message => X.Msg (1 .. X.Msg_Length));
end Complete_Occurrence;
---------------------------------------
-- Complete_And_Propagate_Occurrence --
---------------------------------------
procedure Complete_And_Propagate_Occurrence (X : EOA) is
begin
Complete_Occurrence (X);
Exception_Propagation.Propagate_Exception (X.all);
end Complete_And_Propagate_Occurrence;
---------------------
-- Raise_Exception --
---------------------
procedure Raise_Exception
(E : Exception_Id;
Message : String := "")
is
EF : Exception_Id := E;
begin
-- Raise CE if E = Null_ID (AI-446)
if E = null then
EF := Constraint_Error'Identity;
end if;
-- Go ahead and raise appropriate exception
Raise_Exception_Always (EF, Message);
end Raise_Exception;
----------------------------
-- Raise_Exception_Always --
----------------------------
procedure Raise_Exception_Always
(E : Exception_Id;
Message : String := "")
is
X : constant EOA := Exception_Propagation.Allocate_Occurrence;
begin
Exception_Data.Set_Exception_Msg (X, E, Message);
if not ZCX_By_Default then
Abort_Defer.all;
end if;
Complete_And_Propagate_Occurrence (X);
end Raise_Exception_Always;
------------------------------
-- Raise_Exception_No_Defer --
------------------------------
procedure Raise_Exception_No_Defer
(E : Exception_Id;
Message : String := "")
is
X : constant EOA := Exception_Propagation.Allocate_Occurrence;
begin
Exception_Data.Set_Exception_Msg (X, E, Message);
-- Do not call Abort_Defer.all, as specified by the spec
Complete_And_Propagate_Occurrence (X);
end Raise_Exception_No_Defer;
-------------------------------------
-- Raise_From_Controlled_Operation --
-------------------------------------
procedure Raise_From_Controlled_Operation
(X : Ada.Exceptions.Exception_Occurrence)
is
Prefix : constant String := "adjust/finalize raised ";
Orig_Msg : constant String := Exception_Message (X);
Orig_Prefix_Length : constant Natural :=
Integer'Min (Prefix'Length, Orig_Msg'Length);
Orig_Prefix : String renames
Orig_Msg (Orig_Msg'First .. Orig_Msg'First + Orig_Prefix_Length - 1);
begin
-- Message already has the proper prefix, just re-raise
if Orig_Prefix = Prefix then
Raise_Exception_No_Defer
(E => Program_Error'Identity,
Message => Orig_Msg);
else
declare
New_Msg : constant String := Prefix & Exception_Name (X);
begin
-- No message present, just provide our own
if Orig_Msg = "" then
Raise_Exception_No_Defer
(E => Program_Error'Identity,
Message => New_Msg);
-- Message present, add informational prefix
else
Raise_Exception_No_Defer
(E => Program_Error'Identity,
Message => New_Msg & ": " & Orig_Msg);
end if;
end;
end if;
end Raise_From_Controlled_Operation;
-------------------------------------------
-- Create_Occurrence_From_Signal_Handler --
-------------------------------------------
function Create_Occurrence_From_Signal_Handler
(E : Exception_Id;
M : System.Address) return EOA
is
X : constant EOA := Exception_Propagation.Allocate_Occurrence;
begin
Exception_Data.Set_Exception_C_Msg (X, E, M);
if not ZCX_By_Default then
Abort_Defer.all;
end if;
Complete_Occurrence (X);
return X;
end Create_Occurrence_From_Signal_Handler;
---------------------------------------------------
-- Create_Machine_Occurrence_From_Signal_Handler --
---------------------------------------------------
function Create_Machine_Occurrence_From_Signal_Handler
(E : Exception_Id;
M : System.Address) return System.Address
is
begin
return Create_Occurrence_From_Signal_Handler (E, M).Machine_Occurrence;
end Create_Machine_Occurrence_From_Signal_Handler;
-------------------------------
-- Raise_From_Signal_Handler --
-------------------------------
procedure Raise_From_Signal_Handler
(E : Exception_Id;
M : System.Address)
is
begin
Exception_Propagation.Propagate_Exception
(Create_Occurrence_From_Signal_Handler (E, M).all);
end Raise_From_Signal_Handler;
-------------------------
-- Raise_Program_Error --
-------------------------
procedure Raise_Program_Error
(File : System.Address;
Line : Integer)
is
begin
Raise_With_Location_And_Msg (Program_Error_Def'Access, File, Line);
end Raise_Program_Error;
-----------------------------
-- Raise_Program_Error_Msg --
-----------------------------
procedure Raise_Program_Error_Msg
(File : System.Address;
Line : Integer;
Msg : System.Address)
is
begin
Raise_With_Location_And_Msg
(Program_Error_Def'Access, File, Line, M => Msg);
end Raise_Program_Error_Msg;
-------------------------
-- Raise_Storage_Error --
-------------------------
procedure Raise_Storage_Error
(File : System.Address;
Line : Integer)
is
begin
Raise_With_Location_And_Msg (Storage_Error_Def'Access, File, Line);
end Raise_Storage_Error;
-----------------------------
-- Raise_Storage_Error_Msg --
-----------------------------
procedure Raise_Storage_Error_Msg
(File : System.Address;
Line : Integer;
Msg : System.Address)
is
begin
Raise_With_Location_And_Msg
(Storage_Error_Def'Access, File, Line, M => Msg);
end Raise_Storage_Error_Msg;
---------------------------------
-- Raise_With_Location_And_Msg --
---------------------------------
procedure Raise_With_Location_And_Msg
(E : Exception_Id;
F : System.Address;
L : Integer;
C : Integer := 0;
M : System.Address := System.Null_Address)
is
X : constant EOA := Exception_Propagation.Allocate_Occurrence;
begin
Exception_Data.Set_Exception_C_Msg (X, E, F, L, C, M);
if not ZCX_By_Default then
Abort_Defer.all;
end if;
Complete_And_Propagate_Occurrence (X);
end Raise_With_Location_And_Msg;
--------------------
-- Raise_With_Msg --
--------------------
procedure Raise_With_Msg (E : Exception_Id) is
Excep : constant EOA := Exception_Propagation.Allocate_Occurrence;
Ex : constant Exception_Occurrence_Access := Get_Current_Excep.all;
begin
Excep.Exception_Raised := False;
Excep.Id := E;
Excep.Num_Tracebacks := 0;
Excep.Pid := Local_Partition_ID;
-- Copy the message from the current exception
-- Change the interface to be called with an occurrence ???
Excep.Msg_Length := Ex.Msg_Length;
Excep.Msg (1 .. Excep.Msg_Length) := Ex.Msg (1 .. Ex.Msg_Length);
-- The following is a common pattern, should be abstracted
-- into a procedure call ???
if not ZCX_By_Default then
Abort_Defer.all;
end if;
Complete_And_Propagate_Occurrence (Excep);
end Raise_With_Msg;
-----------------------------------------
-- Calls to Run-Time Check Subprograms --
-----------------------------------------
procedure Rcheck_CE_Access_Check
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_00'Address);
end Rcheck_CE_Access_Check;
procedure Rcheck_CE_Null_Access_Parameter
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_01'Address);
end Rcheck_CE_Null_Access_Parameter;
procedure Rcheck_CE_Discriminant_Check
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_02'Address);
end Rcheck_CE_Discriminant_Check;
procedure Rcheck_CE_Divide_By_Zero
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_03'Address);
end Rcheck_CE_Divide_By_Zero;
procedure Rcheck_CE_Explicit_Raise
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_04'Address);
end Rcheck_CE_Explicit_Raise;
procedure Rcheck_CE_Index_Check
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_05'Address);
end Rcheck_CE_Index_Check;
procedure Rcheck_CE_Invalid_Data
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_06'Address);
end Rcheck_CE_Invalid_Data;
procedure Rcheck_CE_Length_Check
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_07'Address);
end Rcheck_CE_Length_Check;
procedure Rcheck_CE_Null_Exception_Id
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_08'Address);
end Rcheck_CE_Null_Exception_Id;
procedure Rcheck_CE_Null_Not_Allowed
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_09'Address);
end Rcheck_CE_Null_Not_Allowed;
procedure Rcheck_CE_Overflow_Check
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_10'Address);
end Rcheck_CE_Overflow_Check;
procedure Rcheck_CE_Partition_Check
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_11'Address);
end Rcheck_CE_Partition_Check;
procedure Rcheck_CE_Range_Check
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_12'Address);
end Rcheck_CE_Range_Check;
procedure Rcheck_CE_Tag_Check
(File : System.Address; Line : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, 0, Rmsg_13'Address);
end Rcheck_CE_Tag_Check;
procedure Rcheck_PE_Access_Before_Elaboration
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_14'Address);
end Rcheck_PE_Access_Before_Elaboration;
procedure Rcheck_PE_Accessibility_Check
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_15'Address);
end Rcheck_PE_Accessibility_Check;
procedure Rcheck_PE_Address_Of_Intrinsic
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_16'Address);
end Rcheck_PE_Address_Of_Intrinsic;
procedure Rcheck_PE_Aliased_Parameters
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_17'Address);
end Rcheck_PE_Aliased_Parameters;
procedure Rcheck_PE_All_Guards_Closed
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_18'Address);
end Rcheck_PE_All_Guards_Closed;
procedure Rcheck_PE_Bad_Predicated_Generic_Type
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_19'Address);
end Rcheck_PE_Bad_Predicated_Generic_Type;
procedure Rcheck_PE_Build_In_Place_Mismatch
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_37'Address);
end Rcheck_PE_Build_In_Place_Mismatch;
procedure Rcheck_PE_Current_Task_In_Entry_Body
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_20'Address);
end Rcheck_PE_Current_Task_In_Entry_Body;
procedure Rcheck_PE_Duplicated_Entry_Address
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_21'Address);
end Rcheck_PE_Duplicated_Entry_Address;
procedure Rcheck_PE_Explicit_Raise
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_22'Address);
end Rcheck_PE_Explicit_Raise;
procedure Rcheck_PE_Implicit_Return
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_24'Address);
end Rcheck_PE_Implicit_Return;
procedure Rcheck_PE_Misaligned_Address_Value
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_25'Address);
end Rcheck_PE_Misaligned_Address_Value;
procedure Rcheck_PE_Missing_Return
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_26'Address);
end Rcheck_PE_Missing_Return;
procedure Rcheck_PE_Non_Transportable_Actual
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_31'Address);
end Rcheck_PE_Non_Transportable_Actual;
procedure Rcheck_PE_Overlaid_Controlled_Object
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_27'Address);
end Rcheck_PE_Overlaid_Controlled_Object;
procedure Rcheck_PE_Potentially_Blocking_Operation
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_28'Address);
end Rcheck_PE_Potentially_Blocking_Operation;
procedure Rcheck_PE_Stream_Operation_Not_Allowed
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_36'Address);
end Rcheck_PE_Stream_Operation_Not_Allowed;
procedure Rcheck_PE_Stubbed_Subprogram_Called
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_29'Address);
end Rcheck_PE_Stubbed_Subprogram_Called;
procedure Rcheck_PE_Unchecked_Union_Restriction
(File : System.Address; Line : Integer)
is
begin
Raise_Program_Error_Msg (File, Line, Rmsg_30'Address);
end Rcheck_PE_Unchecked_Union_Restriction;
procedure Rcheck_SE_Empty_Storage_Pool
(File : System.Address; Line : Integer)
is
begin
Raise_Storage_Error_Msg (File, Line, Rmsg_32'Address);
end Rcheck_SE_Empty_Storage_Pool;
procedure Rcheck_SE_Explicit_Raise
(File : System.Address; Line : Integer)
is
begin
Raise_Storage_Error_Msg (File, Line, Rmsg_33'Address);
end Rcheck_SE_Explicit_Raise;
procedure Rcheck_SE_Infinite_Recursion
(File : System.Address; Line : Integer)
is
begin
Raise_Storage_Error_Msg (File, Line, Rmsg_34'Address);
end Rcheck_SE_Infinite_Recursion;
procedure Rcheck_SE_Object_Too_Large
(File : System.Address; Line : Integer)
is
begin
Raise_Storage_Error_Msg (File, Line, Rmsg_35'Address);
end Rcheck_SE_Object_Too_Large;
procedure Rcheck_CE_Access_Check_Ext
(File : System.Address; Line, Column : Integer)
is
begin
Raise_Constraint_Error_Msg (File, Line, Column, Rmsg_00'Address);
end Rcheck_CE_Access_Check_Ext;
procedure Rcheck_CE_Index_Check_Ext
(File : System.Address; Line, Column, Index, First, Last : Integer)
is
Msg : constant String :=
Rmsg_05 (Rmsg_05'First .. Rmsg_05'Last - 1) & ASCII.LF
& "index " & Image (Index) & " not in " & Image (First)
& ".." & Image (Last) & ASCII.NUL;
begin
Raise_Constraint_Error_Msg (File, Line, Column, Msg'Address);
end Rcheck_CE_Index_Check_Ext;
procedure Rcheck_CE_Invalid_Data_Ext
(File : System.Address; Line, Column, Index, First, Last : Integer)
is
Msg : constant String :=
Rmsg_06 (Rmsg_06'First .. Rmsg_06'Last - 1) & ASCII.LF
& "value " & Image (Index) & " not in " & Image (First)
& ".." & Image (Last) & ASCII.NUL;
begin
Raise_Constraint_Error_Msg (File, Line, Column, Msg'Address);
end Rcheck_CE_Invalid_Data_Ext;
procedure Rcheck_CE_Range_Check_Ext
(File : System.Address; Line, Column, Index, First, Last : Integer)
is
Msg : constant String :=
Rmsg_12 (Rmsg_12'First .. Rmsg_12'Last - 1) & ASCII.LF
& "value " & Image (Index) & " not in " & Image (First)
& ".." & Image (Last) & ASCII.NUL;
begin
Raise_Constraint_Error_Msg (File, Line, Column, Msg'Address);
end Rcheck_CE_Range_Check_Ext;
procedure Rcheck_PE_Finalize_Raised_Exception
(File : System.Address; Line : Integer)
is
X : constant EOA := Exception_Propagation.Allocate_Occurrence;
begin
-- This is "finalize/adjust raised exception". This subprogram is always
-- called with abort deferred, unlike all other Rcheck_* subprograms, it
-- needs to call Raise_Exception_No_Defer.
-- This is consistent with Raise_From_Controlled_Operation
Exception_Data.Set_Exception_C_Msg
(X, Program_Error_Def'Access, File, Line, 0, Rmsg_23'Address);
Complete_And_Propagate_Occurrence (X);
end Rcheck_PE_Finalize_Raised_Exception;
-------------
-- Reraise --
-------------
procedure Reraise is
Excep : constant EOA := Exception_Propagation.Allocate_Occurrence;
Saved_MO : constant System.Address := Excep.Machine_Occurrence;
begin
if not ZCX_By_Default then
Abort_Defer.all;
end if;
Save_Occurrence (Excep.all, Get_Current_Excep.all.all);
Excep.Machine_Occurrence := Saved_MO;
Complete_And_Propagate_Occurrence (Excep);
end Reraise;
--------------------------------------
-- Reraise_Library_Exception_If_Any --
--------------------------------------
procedure Reraise_Library_Exception_If_Any is
LE : Exception_Occurrence;
begin
if Library_Exception_Set then
LE := Library_Exception;
if LE.Id = Null_Id then
Raise_Exception_No_Defer
(E => Program_Error'Identity,
Message => "finalize/adjust raised exception");
else
Raise_From_Controlled_Operation (LE);
end if;
end if;
end Reraise_Library_Exception_If_Any;
------------------------
-- Reraise_Occurrence --
------------------------
procedure Reraise_Occurrence (X : Exception_Occurrence) is
begin
if X.Id = null then
return;
else
Reraise_Occurrence_Always (X);
end if;
end Reraise_Occurrence;
-------------------------------
-- Reraise_Occurrence_Always --
-------------------------------
procedure Reraise_Occurrence_Always (X : Exception_Occurrence) is
begin
if not ZCX_By_Default then
Abort_Defer.all;
end if;
Reraise_Occurrence_No_Defer (X);
end Reraise_Occurrence_Always;
---------------------------------
-- Reraise_Occurrence_No_Defer --
---------------------------------
procedure Reraise_Occurrence_No_Defer (X : Exception_Occurrence) is
begin
-- If we have a Machine_Occurrence at hand already, e.g. when we are
-- reraising a foreign exception, just repropagate. Otherwise, e.g.
-- when reraising a GNAT exception or an occurrence read back from a
-- stream, set up a new occurrence with its own Machine block first.
if X.Machine_Occurrence /= System.Null_Address then
Exception_Propagation.Propagate_Exception (X);
else
declare
Excep : constant EOA
:= Exception_Propagation.Allocate_Occurrence;
Saved_MO : constant System.Address := Excep.Machine_Occurrence;
begin
Save_Occurrence (Excep.all, X);
Excep.Machine_Occurrence := Saved_MO;
Complete_And_Propagate_Occurrence (Excep);
end;
end if;
end Reraise_Occurrence_No_Defer;
---------------------
-- Save_Occurrence --
---------------------
procedure Save_Occurrence
(Target : out Exception_Occurrence;
Source : Exception_Occurrence)
is
begin
-- As the machine occurrence might be a data that must be finalized
-- (outside any Ada mechanism), do not copy it
Target.Id := Source.Id;
Target.Machine_Occurrence := System.Null_Address;
Target.Msg_Length := Source.Msg_Length;
Target.Num_Tracebacks := Source.Num_Tracebacks;
Target.Pid := Source.Pid;
Target.Msg (1 .. Target.Msg_Length) :=
Source.Msg (1 .. Target.Msg_Length);
Target.Tracebacks (1 .. Target.Num_Tracebacks) :=
Source.Tracebacks (1 .. Target.Num_Tracebacks);
end Save_Occurrence;
function Save_Occurrence (Source : Exception_Occurrence) return EOA is
Target : constant EOA := new Exception_Occurrence;
begin
Save_Occurrence (Target.all, Source);
return Target;
end Save_Occurrence;
-------------------
-- String_To_EId --
-------------------
function String_To_EId (S : String) return Exception_Id
renames Stream_Attributes.String_To_EId;
------------------
-- String_To_EO --
------------------
function String_To_EO (S : String) return Exception_Occurrence
renames Stream_Attributes.String_To_EO;
---------------
-- To_Stderr --
---------------
procedure To_Stderr (C : Character) is
procedure Put_Char_Stderr (C : Character);
pragma Import (C, Put_Char_Stderr, "put_char_stderr");
begin
Put_Char_Stderr (C);
end To_Stderr;
procedure To_Stderr (S : String) is
begin
for J in S'Range loop
if S (J) /= ASCII.CR then
To_Stderr (S (J));
end if;
end loop;
end To_Stderr;
-------------------------
-- Transfer_Occurrence --
-------------------------
procedure Transfer_Occurrence
(Target : Exception_Occurrence_Access;
Source : Exception_Occurrence)
is
begin
Save_Occurrence (Target.all, Source);
end Transfer_Occurrence;
------------------------
-- Triggered_By_Abort --
------------------------
function Triggered_By_Abort return Boolean is
Ex : constant Exception_Occurrence_Access := Get_Current_Excep.all;
begin
return Ex /= null
and then Exception_Identity (Ex.all) = Standard'Abort_Signal'Identity;
end Triggered_By_Abort;
-------------------------
-- Wide_Exception_Name --
-------------------------
WC_Encoding : Character;
pragma Import (C, WC_Encoding, "__gl_wc_encoding");
-- Encoding method for source, as exported by binder
function Wide_Exception_Name
(Id : Exception_Id) return Wide_String
is
S : constant String := Exception_Name (Id);
W : Wide_String (1 .. S'Length);
L : Natural;
begin
String_To_Wide_String
(S, W, L, Get_WC_Encoding_Method (WC_Encoding));
return W (1 .. L);
end Wide_Exception_Name;
function Wide_Exception_Name
(X : Exception_Occurrence) return Wide_String
is
S : constant String := Exception_Name (X);
W : Wide_String (1 .. S'Length);
L : Natural;
begin
String_To_Wide_String
(S, W, L, Get_WC_Encoding_Method (WC_Encoding));
return W (1 .. L);
end Wide_Exception_Name;
----------------------------
-- Wide_Wide_Exception_Name --
-----------------------------
function Wide_Wide_Exception_Name
(Id : Exception_Id) return Wide_Wide_String
is
S : constant String := Exception_Name (Id);
W : Wide_Wide_String (1 .. S'Length);
L : Natural;
begin
String_To_Wide_Wide_String
(S, W, L, Get_WC_Encoding_Method (WC_Encoding));
return W (1 .. L);
end Wide_Wide_Exception_Name;
function Wide_Wide_Exception_Name
(X : Exception_Occurrence) return Wide_Wide_String
is
S : constant String := Exception_Name (X);
W : Wide_Wide_String (1 .. S'Length);
L : Natural;
begin
String_To_Wide_Wide_String
(S, W, L, Get_WC_Encoding_Method (WC_Encoding));
return W (1 .. L);
end Wide_Wide_Exception_Name;
--------------------------
-- Code_Address_For_ZZZ --
--------------------------
-- This function gives us the end of the PC range for addresses
-- within the exception unit itself. We hope that gigi/gcc keeps all the
-- procedures in their original order.
function Code_Address_For_ZZZ return System.Address is
begin
<<Start_Of_ZZZ>>
return Start_Of_ZZZ'Address;
end Code_Address_For_ZZZ;
end Ada.Exceptions;
|
-- Copyright 2012-2019 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 IO is
procedure Put_Line (S : String) is
begin
null;
end Put_Line;
end IO;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Menu_Demo.Handler --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright 2020 Thomas E. Dickey --
-- Copyright 1998-2004,2009 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions : --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control
-- $Revision: 1.17 $
-- $Date: 2020/02/02 23:34:34 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Sample.Menu_Demo.Aux;
with Sample.Manifest; use Sample.Manifest;
with Terminal_Interface.Curses.Mouse; use Terminal_Interface.Curses.Mouse;
package body Sample.Menu_Demo.Handler is
package Aux renames Sample.Menu_Demo.Aux;
procedure Drive_Me (M : Menu;
Title : String := "")
is
L : Line_Count;
C : Column_Count;
Y : Line_Position;
X : Column_Position;
begin
Aux.Geometry (M, L, C, Y, X);
Drive_Me (M, Y, X, Title);
end Drive_Me;
procedure Drive_Me (M : Menu;
Lin : Line_Position;
Col : Column_Position;
Title : String := "")
is
Mask : Event_Mask := No_Events;
Old : Event_Mask;
Pan : Panel := Aux.Create (M, Title, Lin, Col);
V : Cursor_Visibility := Invisible;
begin
-- We are only interested in Clicks with the left button
Register_Reportable_Events (Left, All_Clicks, Mask);
Old := Start_Mouse (Mask);
Set_Cursor_Visibility (V);
loop
declare
K : Key_Code := Aux.Get_Request (M, Pan);
R : constant Driver_Result := Driver (M, K);
begin
case R is
when Menu_Ok => null;
when Unknown_Request =>
declare
I : constant Item := Current (M);
O : Item_Option_Set;
begin
if K = Key_Mouse then
K := SELECT_ITEM;
end if;
Get_Options (I, O);
if K = SELECT_ITEM and then not O.Selectable then
Beep;
else
if My_Driver (M, K, Pan) then
exit;
end if;
end if;
end;
when others => Beep;
end case;
end;
end loop;
End_Mouse (Old);
Aux.Destroy (M, Pan);
end Drive_Me;
end Sample.Menu_Demo.Handler;
|
-- Copyright 2014-2019 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 Time_T is record
Secs : Integer;
end record;
procedure Do_Nothing (A : System.Address);
end Pck;
|
pragma Ada_2005;
pragma Style_Checks (Off);
pragma Warnings (Off);
with Interfaces.C; use Interfaces.C;
with glib;
package GStreamer.GST_Low_Level.gstreamer_0_10_gst_basecamerabinsrc_gstcamerabin_enum_h is
DEFAULT_WIDTH : constant := 640; -- gst/basecamerabinsrc/gstcamerabin-enum.h:33
DEFAULT_HEIGHT : constant := 480; -- gst/basecamerabinsrc/gstcamerabin-enum.h:34
DEFAULT_CAPTURE_WIDTH : constant := 800; -- gst/basecamerabinsrc/gstcamerabin-enum.h:35
DEFAULT_CAPTURE_HEIGHT : constant := 600; -- gst/basecamerabinsrc/gstcamerabin-enum.h:36
DEFAULT_FPS_N : constant := 0; -- gst/basecamerabinsrc/gstcamerabin-enum.h:37
DEFAULT_FPS_D : constant := 1; -- gst/basecamerabinsrc/gstcamerabin-enum.h:38
-- unsupported macro: DEFAULT_ZOOM MIN_ZOOM
-- unsupported macro: GST_TYPE_CAMERABIN_MODE (gst_camerabin_mode_get_type ())
-- * GStreamer
-- * Copyright (C) 2009 Nokia Corporation <multimedia@maemo.org>
-- *
-- * This library is free software; you can redistribute it and/or
-- * modify it under the terms of the GNU Library General Public
-- * License as published by the Free Software Foundation; either
-- * version 2 of the License, or (at your option) any later version.
-- *
-- * This library is distributed in the hope that it will be useful,
-- * but WITHOUT ANY WARRANTY; without even the implied warranty of
-- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- * Library General Public License for more details.
-- *
-- * You should have received a copy of the GNU Library General Public
-- * License along with this library; if not, write to the
-- * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-- * Boston, MA 02111-1307, USA.
--
--*
-- * GstCameraBinMode:
-- * @MODE_IMAGE: image capture
-- * @MODE_VIDEO: video capture
-- *
-- * Capture mode to use.
--
-- * GStreamer
-- * Copyright (C) 2009 Nokia Corporation <multimedia@maemo.org>
-- *
-- * This library is free software; you can redistribute it and/or
-- * modify it under the terms of the GNU Library General Public
-- * License as published by the Free Software Foundation; either
-- * version 2 of the License, or (at your option) any later version.
-- *
-- * This library is distributed in the hope that it will be useful,
-- * but WITHOUT ANY WARRANTY; without even the implied warranty of
-- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- * Library General Public License for more details.
-- *
-- * You should have received a copy of the GNU Library General Public
-- * License along with this library; if not, write to the
-- * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-- * Boston, MA 02111-1307, USA.
--
subtype GstCameraBinMode is unsigned;
MODE_IMAGE : constant GstCameraBinMode := 1;
MODE_VIDEO : constant GstCameraBinMode := 2; -- gst/basecamerabinsrc/gstcamerabin-enum.h:54
function gst_camerabin_mode_get_type return GLIB.GType; -- gst/basecamerabinsrc/gstcamerabin-enum.h:58
pragma Import (C, gst_camerabin_mode_get_type, "gst_camerabin_mode_get_type");
end GStreamer.GST_Low_Level.gstreamer_0_10_gst_basecamerabinsrc_gstcamerabin_enum_h;
|
package Natools.Static_Maps.Web.Fallback_Render.Commands is
pragma Pure;
function Hash (S : String) return Natural;
end Natools.Static_Maps.Web.Fallback_Render.Commands;
|
-- Copyright 2019 Simon Symeonidis (psyomn)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
package Transaction_Handlers is
function Handle_Request (R : String; Context : String) return String;
end Transaction_Handlers;
|
------------------------------------------------------------------------------
-- --
-- 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.
------------------------------------------------------------------------------
-- A read structural feature action is a structural feature action that
-- retrieves the values of a structural feature.
------------------------------------------------------------------------------
limited with AMF.UML.Output_Pins;
with AMF.UML.Structural_Feature_Actions;
package AMF.UML.Read_Structural_Feature_Actions is
pragma Preelaborate;
type UML_Read_Structural_Feature_Action is limited interface
and AMF.UML.Structural_Feature_Actions.UML_Structural_Feature_Action;
type UML_Read_Structural_Feature_Action_Access is
access all UML_Read_Structural_Feature_Action'Class;
for UML_Read_Structural_Feature_Action_Access'Storage_Size use 0;
not overriding function Get_Result
(Self : not null access constant UML_Read_Structural_Feature_Action)
return AMF.UML.Output_Pins.UML_Output_Pin_Access is abstract;
-- Getter of ReadStructuralFeatureAction::result.
--
-- Gives the output pin on which the result is put.
not overriding procedure Set_Result
(Self : not null access UML_Read_Structural_Feature_Action;
To : AMF.UML.Output_Pins.UML_Output_Pin_Access) is abstract;
-- Setter of ReadStructuralFeatureAction::result.
--
-- Gives the output pin on which the result is put.
end AMF.UML.Read_Structural_Feature_Actions;
|
------------------------------------------------------------------------------
-- --
-- GNAT SYSTEM UTILITIES --
-- --
-- G N A T P S T A --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1997-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. --
-- --
------------------------------------------------------------------------------
-- Program to print out listing of Standard package for the target (not
-- the host) with all constants appearing explicitly. This is not really
-- valid Ada, since one cannot really define new base types, but it is a
-- helpful listing from a documentation point of view.
-- Note that special care has been taken to use the host parameters for
-- integer and floating point sizes.
with Ada.Text_IO; use Ada.Text_IO;
with Gnatvsn;
with Ttypef; use Ttypef;
with Ttypes; use Ttypes;
with Types; use Types;
procedure GnatPsta is
pragma Ident (Gnatvsn.Gnat_Version_String);
procedure P (Item : String) renames Ada.Text_IO.Put_Line;
procedure P_Int_Range (Size : Pos; Put_First : Boolean := True);
-- Prints the range of an integer based on its Size. If Put_First is
-- False, then skip the first bound.
procedure P_Float_Range (Nb_Digits : Pos);
-- Prints the maximum range of a Float whose 'Digits is given by Nb_Digits
-------------------
-- P_Float_Range --
-------------------
procedure P_Float_Range (Nb_Digits : Pos) is
begin
-- This routine assumes only IEEE floats.
-- ??? Should the following be adapted for OpenVMS ?
case Nb_Digits is
when IEEES_Digits =>
P (" range " & IEEES_First'Universal_Literal_String & " .. " &
IEEES_Last'Universal_Literal_String & ";");
when IEEEL_Digits =>
P (" range " & IEEEL_First'Universal_Literal_String & " .. " &
IEEEL_Last'Universal_Literal_String & ";");
when IEEEX_Digits =>
P (" range " & IEEEX_First'Universal_Literal_String & " .. " &
IEEEX_Last'Universal_Literal_String & ";");
when others =>
P (";");
end case;
-- If one of the floating point types of the host computer has the
-- same digits as the target float we are processing, then print out
-- the float range using the host computer float type.
if Nb_Digits = Short_Float'Digits then
P (" -- " &
Short_Float'First'Img & " .. " & Short_Float'Last'Img);
elsif Nb_Digits = Float'Digits then
P (" -- " &
Float'First'Img & " .. " & Float'Last'Img);
elsif Nb_Digits = Long_Float'Digits then
P (" -- " &
Long_Float'First'Img & " .. " & Long_Float'Last'Img);
elsif Nb_Digits = Long_Long_Float'Digits then
P (" -- " &
Long_Long_Float'First'Img & " .. " & Long_Long_Float'Last'Img);
end if;
New_Line;
end P_Float_Range;
-----------------
-- P_Int_Range --
-----------------
procedure P_Int_Range (Size : Pos; Put_First : Boolean := True) is
begin
if Put_First then
Put (" is range -(2 **" & Pos'Image (Size - 1) & ")");
end if;
P (" .. +(2 **" & Pos'Image (Size - 1) & " - 1);");
end P_Int_Range;
-- Start of processing for GnatPsta
begin
P ("package Standard is");
P ("pragma Pure(Standard);");
New_Line;
P (" type Boolean is (False, True);");
New_Line;
-- Integer types
Put (" type Integer");
P_Int_Range (Standard_Integer_Size);
New_Line;
Put (" subtype Natural is Integer range 0");
P_Int_Range (Standard_Integer_Size, Put_First => False);
Put (" subtype Positive is Integer range 1");
P_Int_Range (Standard_Integer_Size, Put_First => False);
New_Line;
Put (" type Short_Short_Integer");
P_Int_Range (Standard_Short_Short_Integer_Size);
Put (" type Short_Integer ");
P_Int_Range (Standard_Short_Integer_Size);
Put (" type Long_Integer ");
P_Int_Range (Standard_Long_Integer_Size);
Put (" type Long_Long_Integer ");
P_Int_Range (Standard_Long_Long_Integer_Size);
New_Line;
-- Floating point types
P (" type Short_Float is digits"
& Standard_Short_Float_Digits'Img);
P_Float_Range (Standard_Short_Float_Digits);
P (" type Float is digits"
& Standard_Float_Digits'Img);
P_Float_Range (Standard_Float_Digits);
P (" type Long_Float is digits"
& Standard_Long_Float_Digits'Img);
P_Float_Range (Standard_Long_Float_Digits);
P (" type Long_Long_Float is digits"
& Standard_Long_Long_Float_Digits'Img);
P_Float_Range (Standard_Long_Long_Float_Digits);
P (" -- function ""*"" (Left : root_integer; Right : root_real)");
P (" -- return root_real;");
New_Line;
P (" -- function ""*"" (Left : root_real; Right : root_integer)");
P (" -- return root_real;");
New_Line;
P (" -- function ""/"" (Left : root_real; Right : root_integer)");
P (" -- return root_real;");
New_Line;
P (" -- function ""*"" (Left : universal_fixed; " &
"Right : universal_fixed)");
P (" -- return universal_fixed;");
New_Line;
P (" -- function ""/"" (Left : universal_fixed; " &
"Right : universal_fixed)");
P (" -- return universal_fixed;");
New_Line;
P (" -- The declaration of type Character is based on the standard");
P (" -- ISO 8859-1 character set.");
New_Line;
P (" -- There are no character literals corresponding to the positions");
P (" -- for control characters. They are indicated by lower case");
P (" -- identifiers in the following list.");
New_Line;
P (" -- Note: this type cannot be represented accurately in Ada");
New_Line;
P (" -- type Character is");
New_Line;
P (" -- (nul, soh, stx, etx, eot, enq, ack, bel,");
P (" -- bs, ht, lf, vt, ff, cr, so, si,");
New_Line;
P (" -- dle, dc1, dc2, dc3, dc4, nak, syn, etb,");
P (" -- can, em, sub, esc, fs, gs, rs, us,");
New_Line;
P (" -- ' ', '!', '""', '#', '$', '%', '&', ''',");
P (" -- '(', ')', '*', '+', ',', '-', '.', '/',");
New_Line;
P (" -- '0', '1', '2', '3', '4', '5', '6', '7',");
P (" -- '8', '9', ':', ';', '<', '=', '>', '?',");
New_Line;
P (" -- '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G',");
P (" -- 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O',");
New_Line;
P (" -- 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W',");
P (" -- 'X', 'Y', 'Z', '[', '\', ']', '^', '_',");
New_Line;
P (" -- '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g',");
P (" -- 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',");
New_Line;
P (" -- 'p', 'q', 'r', 's', 't', 'u', 'v', 'w',");
P (" -- 'x', 'y', 'z', '{', '|', '}', '~', del,");
New_Line;
P (" -- reserved_128, reserved_129, bph, nbh,");
P (" -- reserved_132, nel, ssa, esa,");
New_Line;
P (" -- hts, htj, vts, pld, plu, ri, ss2, ss3,");
New_Line;
P (" -- dcs, pu1, pu2, sts, cch, mw, spa, epa,");
New_Line;
P (" -- sos, reserved_153, sci, csi,");
P (" -- st, osc, pm, apc,");
New_Line;
P (" -- ... );");
New_Line;
P (" -- The declaration of type Wide_Character is based " &
"on the standard");
P (" -- ISO 10646 BMP character set.");
New_Line;
P (" -- Note: this type cannot be represented accurately in Ada");
New_Line;
P (" -- The first 256 positions have the same contents as " &
"type Character");
New_Line;
P (" -- type Wide_Character is (nul, soh ... FFFE, FFFF);");
New_Line;
P (" package ASCII is");
New_Line;
P (" -- Control characters:");
New_Line;
P (" NUL : constant Character := Character'Val (16#00#);");
P (" SOH : constant Character := Character'Val (16#01#);");
P (" STX : constant Character := Character'Val (16#02#);");
P (" ETX : constant Character := Character'Val (16#03#);");
P (" EOT : constant Character := Character'Val (16#04#);");
P (" ENQ : constant Character := Character'Val (16#05#);");
P (" ACK : constant Character := Character'Val (16#06#);");
P (" BEL : constant Character := Character'Val (16#07#);");
P (" BS : constant Character := Character'Val (16#08#);");
P (" HT : constant Character := Character'Val (16#09#);");
P (" LF : constant Character := Character'Val (16#0A#);");
P (" VT : constant Character := Character'Val (16#0B#);");
P (" FF : constant Character := Character'Val (16#0C#);");
P (" CR : constant Character := Character'Val (16#0D#);");
P (" SO : constant Character := Character'Val (16#0E#);");
P (" SI : constant Character := Character'Val (16#0F#);");
P (" DLE : constant Character := Character'Val (16#10#);");
P (" DC1 : constant Character := Character'Val (16#11#);");
P (" DC2 : constant Character := Character'Val (16#12#);");
P (" DC3 : constant Character := Character'Val (16#13#);");
P (" DC4 : constant Character := Character'Val (16#14#);");
P (" NAK : constant Character := Character'Val (16#15#);");
P (" SYN : constant Character := Character'Val (16#16#);");
P (" ETB : constant Character := Character'Val (16#17#);");
P (" CAN : constant Character := Character'Val (16#18#);");
P (" EM : constant Character := Character'Val (16#19#);");
P (" SUB : constant Character := Character'Val (16#1A#);");
P (" ESC : constant Character := Character'Val (16#1B#);");
P (" FS : constant Character := Character'Val (16#1C#);");
P (" GS : constant Character := Character'Val (16#1D#);");
P (" RS : constant Character := Character'Val (16#1E#);");
P (" US : constant Character := Character'Val (16#1F#);");
P (" DEL : constant Character := Character'Val (16#7F#);");
New_Line;
P (" -- Other characters:");
New_Line;
P (" Exclam : constant Character := '!';");
P (" Quotation : constant Character := '""';");
P (" Sharp : constant Character := '#';");
P (" Dollar : constant Character := '$';");
P (" Percent : constant Character := '%';");
P (" Ampersand : constant Character := '&';");
P (" Colon : constant Character := ':';");
P (" Semicolon : constant Character := ';';");
P (" Query : constant Character := '?';");
P (" At_Sign : constant Character := '@';");
P (" L_Bracket : constant Character := '[';");
P (" Back_Slash : constant Character := '\';");
P (" R_Bracket : constant Character := ']';");
P (" Circumflex : constant Character := '^';");
P (" Underline : constant Character := '_';");
P (" Grave : constant Character := '`';");
P (" L_Brace : constant Character := '{';");
P (" Bar : constant Character := '|';");
P (" R_Brace : constant Character := '}';");
P (" Tilde : constant Character := '~';");
New_Line;
P (" -- Lower case letters:");
New_Line;
for C in Character range 'a' .. 'z' loop
P (" LC_" & Character'Val (Character'Pos (C) - 32) &
" : constant Character := '" & C & "';");
end loop;
New_Line;
P (" end ASCII;");
New_Line;
P (" type String is array (Positive range <>) of Character;");
P (" pragma Pack (String);");
New_Line;
P (" type Wide_String is array (Positive range <>) of Wide_Character;");
P (" pragma Pack (Wide_String);");
New_Line;
-- Here it's OK to use the Duration type of the host compiler since
-- the implementation of Duration in GNAT is target independent.
P (" type Duration is delta" &
Duration'Image (Duration'Delta));
P (" range -((2 **" & Natural'Image (Duration'Size - 1) &
" - 1) *" & Duration'Image (Duration'Delta) & ") ..");
P (" +((2 **" & Natural'Image (Duration'Size - 1) &
" - 1) *" & Duration'Image (Duration'Delta) & ");");
P (" for Duration'Small use" & Duration'Image (Duration'Small) & ";");
New_Line;
P (" Constraint_Error : exception;");
P (" Program_Error : exception;");
P (" Storage_Error : exception;");
P (" Tasking_Error : exception;");
New_Line;
P ("end Standard;");
end GnatPsta;
|
--*************************************************************************************
--* UNCLASSIFIED
--* IN STRICT CONFIDENCE *
--* *
--*************************************************************************************
--* This is an unpublished work created on the date(s) shown, any copyright in *
--* which vests in BAE SYSTEMS. All rights reserved. *
--* *
--* The information contained in this document/record is proprietary to *
--* BAE SYSTEMS unless stated otherwise and is made available in confidence; it *
--* must not be used or disclosed without our express written permission. This *
--* document/record may not be copied in whole or in part in any form without *
--* the express written consent of BAE SYSTEMS, which may be given by contract. *
--* This drawing is a design document for the purposes of the Copyright, *
--* Designs and Patents Act 1988. *
--* *
--* Public Access: Freedom Of Information Act 2000, etc. *
--* *
--* This document contains commercially-sensitive trade secrets as of the date *
--* provided to the original recipient by BAE SYSTEMS and is provided in *
--* confidence. Following a request for this information public authorities *
--* should consult with BAE SYSTEMS regarding the current releasability of the *
--* information prior to the decision to release all or part of this document, *
--* and in any event are to notify BAE SYSTEMS prior to any release. Release of *
--* this information by a public authority may constitute an actionable breach *
--* of confidence. *
--* *
--*************************************************************************************
--* *
--* Prepared by BAE SYSTEMS under Contract Number TORPC/01119 dated April 2010. *
--* Restrictions on reproduction and use are subject to the terms of DEFCON 91 *
--* (Edn. 11/06) as applicable, and other terms under the Contract. *
--* *
--*************************************************************************************
--* *
--* File Name: log.ads
--* Drawing Number: Refer to release documentation *
--* Version: As detailed by ClearCase *
--* Version Date: As detailed by ClearCase *
--* Creation Date: As detailed by ClearCase *
--* Author: Tactical Software Team *
--* Maintained by: Tactical Software Team *
--* Division: Torpedoes Business Stream *
--* Project: SFU (Spearfish Upgrade) *
--* ClearCase VOB: Refer to release documentation *
--* Section/Unit: Refer to release documentation *
--* Description:
--* Log package specification for debugging purposes
--* Comments: Header written by header.macro *
--*
--* *
--*************************************************************************************
--* SUPPLEMENTAL INFORMATION *
--* ------------------------ *
--* OVERVIEW *
--* -------- *
--* Target specific exception handling
--*
--* ERROR HANDLING *
--* -------------- *
--* *
--* SAFETY : None *
--* ------ *
--* *
--* BUILD INFORMATION *
--* ----------------- *
--* *
--* Build Target : Dos
--* Clock Type : INTERNAL
--* Debugging is : Off
--* Trace is : Off
--* *
--*
--*
--*
--*
--*
--*************************************************************************************
--* COMPONENTS CONTAINED WITHIN THIS FILE *
--*
--*************************************************************************************
-- MODIFICATION RECORD
-- --------------------
-- NAME DATE ECR No MODIFICATION
--
-- DB 28-03-02 - Added this file to allow log to be generated
-- for single domain builds also.
-- ANF 04/07/06 001798 9SR056 Archetype language reformatted
--
-- **************************************************************************************
package Log is
procedure Initialise(File_Name: in string);
pragma inline (Initialise);
procedure Put_Line (Dump_String: in string);
pragma inline (Put_Line);
procedure Put (Dump_String: in string);
pragma inline (Put);
procedure Put_Line (Dump_Integer: in integer);
pragma inline (Put_Line);
procedure Put (Dump_Integer: in integer);
pragma inline (Put);
procedure Put_Line (Dump_Float: in float);
pragma inline (Put_Line);
procedure Put (Dump_Float: in float);
pragma inline (Put);
procedure Put (Dump_Boolean: in boolean);
pragma inline (Put);
procedure Put (Dump_Duration: in duration);
pragma inline (Put);
procedure New_Line;
pragma inline (New_Line);
procedure Close;
pragma inline (Close);
end Log;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ L L U --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2000 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routines for supporting the Image attribute for
-- unsigned (modular) integer types larger than Size Unsigned'Size, and also
-- for conversion operations required in Text_IO.Modular_IO for such types.
with System.Unsigned_Types;
package System.Img_LLU is
pragma Pure (Img_LLU);
function Image_Long_Long_Unsigned
(V : System.Unsigned_Types.Long_Long_Unsigned)
return String;
-- Computes Long_Long_Unsigned'Image (V) and returns the result.
procedure Set_Image_Long_Long_Unsigned
(V : System.Unsigned_Types.Long_Long_Unsigned;
S : out String;
P : in out Natural);
-- Sets the image of V starting at S (P + 1) with no leading spaces (i.e.
-- Text_IO format where Width = 0), starting at S (P + 1), updating P
-- to point to the last character stored. The caller promises that the
-- buffer is large enough and no check is made for this (Constraint_Error
-- will not be necessarily raised if this is violated since it is perfectly
-- valid to compile this unit with checks off).
end System.Img_LLU;
|
procedure My_Package is
generic
type Unsigned_Type is range <>;
package Generic_Integer_Images is
function Digit_To_Character (X : Unsigned_Type) return Character;
end Generic_Integer_Images;
package body Generic_Integer_Images is
function Digit_To_Character (X : Unsigned_Type) return Character is
(Character'Val (0));
end Generic_Integer_Images;
type Signed_Address is range
-2**(Standard'Address_Size - 1) .. 2**(Standard'Address_Size - 1) - 1;
begin
null;
end My_Package;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . S C A L A R _ V A L U E S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2003-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
package body System.Scalar_Values is
use Interfaces;
----------------
-- Initialize --
----------------
procedure Initialize (Mode1 : Character; Mode2 : Character) is
C1 : Character := Mode1;
C2 : Character := Mode2;
procedure Get_Env_Value_Ptr (Name, Length, Ptr : Address);
pragma Import (C, Get_Env_Value_Ptr, "__gnat_getenv");
subtype String2 is String (1 .. 2);
type String2_Ptr is access all String2;
Env_Value_Ptr : aliased String2_Ptr;
Env_Value_Length : aliased Integer;
EV_Val : aliased constant String :=
"GNAT_INIT_SCALARS" & ASCII.NUL;
B : Byte1;
EFloat : constant Boolean := Long_Long_Float'Size > Long_Float'Size;
-- Set True if we are on an x86 with 96-bit floats for extended
type ByteLF is array (0 .. 7) of Byte1;
for ByteLF'Component_Size use 8;
-- Type used to hold Long_Float values on all targets. On most targets
-- the type is 8 bytes, and type Byte8 is used for values that are then
-- converted to ByteLF.
function To_ByteLF is new Ada.Unchecked_Conversion (Byte8, ByteLF);
type ByteLLF is array (0 .. 7 + 4 * Boolean'Pos (EFloat)) of Byte1;
for ByteLLF'Component_Size use 8;
-- Type used to initialize Long_Long_Float values used on x86 and
-- any other target with the same 80-bit floating-point values that
-- GCC always stores in 96-bits. Note that we are assuming Intel
-- format little-endian addressing for this type. On non-Intel
-- architectures, this is the same length as Byte8 and holds
-- a Long_Float value.
-- The following variables are used to initialize the float values
-- by overlay. We can't assign directly to the float values, since
-- we may be assigning signalling Nan's that will cause a trap if
-- loaded into a floating-point register.
IV_Isf : aliased Byte4; -- Initialize short float
IV_Ifl : aliased Byte4; -- Initialize float
IV_Ilf : aliased ByteLF; -- Initialize long float
IV_Ill : aliased ByteLLF; -- Initialize long long float
for IV_Isf'Address use IS_Isf'Address;
for IV_Ifl'Address use IS_Ifl'Address;
for IV_Ilf'Address use IS_Ilf'Address;
for IV_Ill'Address use IS_Ill'Address;
-- The following pragmas are used to suppress initialization
pragma Import (Ada, IV_Isf);
pragma Import (Ada, IV_Ifl);
pragma Import (Ada, IV_Ilf);
pragma Import (Ada, IV_Ill);
begin
-- Acquire environment variable value if necessary
if C1 = 'E' and then C2 = 'V' then
Get_Env_Value_Ptr
(EV_Val'Address, Env_Value_Length'Address, Env_Value_Ptr'Address);
-- Ignore if length is not 2
if Env_Value_Length /= 2 then
C1 := 'I';
C2 := 'N';
-- Length is 2, see if it is a valid value
else
-- Acquire two characters and fold to upper case
C1 := Env_Value_Ptr (1);
C2 := Env_Value_Ptr (2);
if C1 in 'a' .. 'z' then
C1 := Character'Val (Character'Pos (C1) - 32);
end if;
if C2 in 'a' .. 'z' then
C2 := Character'Val (Character'Pos (C2) - 32);
end if;
-- IN/LO/HI are ok values
if (C1 = 'I' and then C2 = 'N')
or else
(C1 = 'L' and then C2 = 'O')
or else
(C1 = 'H' and then C2 = 'I')
then
null;
-- Try for valid hex digits
elsif (C1 in '0' .. '9' or else C1 in 'A' .. 'Z')
or else
(C2 in '0' .. '9' or else C2 in 'A' .. 'Z')
then
null;
-- Otherwise environment value is bad, ignore and use IN (invalid)
else
C1 := 'I';
C2 := 'N';
end if;
end if;
end if;
-- IN (invalid value)
if C1 = 'I' and then C2 = 'N' then
IS_Is1 := 16#80#;
IS_Is2 := 16#8000#;
IS_Is4 := 16#8000_0000#;
IS_Is8 := 16#8000_0000_0000_0000#;
IS_Iu1 := 16#FF#;
IS_Iu2 := 16#FFFF#;
IS_Iu4 := 16#FFFF_FFFF#;
IS_Iu8 := 16#FFFF_FFFF_FFFF_FFFF#;
IS_Iz1 := 16#00#;
IS_Iz2 := 16#0000#;
IS_Iz4 := 16#0000_0000#;
IS_Iz8 := 16#0000_0000_0000_0000#;
IV_Isf := IS_Iu4;
IV_Ifl := IS_Iu4;
IV_Ilf := To_ByteLF (IS_Iu8);
if EFloat then
IV_Ill := (0, 0, 0, 0, 0, 0, 0, 16#C0#, 16#FF#, 16#FF#, 0, 0);
end if;
-- LO (Low values)
elsif C1 = 'L' and then C2 = 'O' then
IS_Is1 := 16#80#;
IS_Is2 := 16#8000#;
IS_Is4 := 16#8000_0000#;
IS_Is8 := 16#8000_0000_0000_0000#;
IS_Iu1 := 16#00#;
IS_Iu2 := 16#0000#;
IS_Iu4 := 16#0000_0000#;
IS_Iu8 := 16#0000_0000_0000_0000#;
IS_Iz1 := 16#00#;
IS_Iz2 := 16#0000#;
IS_Iz4 := 16#0000_0000#;
IS_Iz8 := 16#0000_0000_0000_0000#;
IV_Isf := 16#FF80_0000#;
IV_Ifl := 16#FF80_0000#;
IV_Ilf := To_ByteLF (16#FFF0_0000_0000_0000#);
if EFloat then
IV_Ill := (0, 0, 0, 0, 0, 0, 0, 16#80#, 16#FF#, 16#FF#, 0, 0);
end if;
-- HI (High values)
elsif C1 = 'H' and then C2 = 'I' then
IS_Is1 := 16#7F#;
IS_Is2 := 16#7FFF#;
IS_Is4 := 16#7FFF_FFFF#;
IS_Is8 := 16#7FFF_FFFF_FFFF_FFFF#;
IS_Iu1 := 16#FF#;
IS_Iu2 := 16#FFFF#;
IS_Iu4 := 16#FFFF_FFFF#;
IS_Iu8 := 16#FFFF_FFFF_FFFF_FFFF#;
IS_Iz1 := 16#FF#;
IS_Iz2 := 16#FFFF#;
IS_Iz4 := 16#FFFF_FFFF#;
IS_Iz8 := 16#FFFF_FFFF_FFFF_FFFF#;
IV_Isf := 16#7F80_0000#;
IV_Ifl := 16#7F80_0000#;
IV_Ilf := To_ByteLF (16#7FF0_0000_0000_0000#);
if EFloat then
IV_Ill := (0, 0, 0, 0, 0, 0, 0, 16#80#, 16#FF#, 16#7F#, 0, 0);
end if;
-- -Shh (hex byte)
else
-- Convert the two hex digits (we know they are valid here)
B := 16 * (Character'Pos (C1)
- (if C1 in '0' .. '9'
then Character'Pos ('0')
else Character'Pos ('A') - 10))
+ (Character'Pos (C2)
- (if C2 in '0' .. '9'
then Character'Pos ('0')
else Character'Pos ('A') - 10));
-- Initialize data values from the hex value
IS_Is1 := B;
IS_Is2 := 2**8 * Byte2 (IS_Is1) + Byte2 (IS_Is1);
IS_Is4 := 2**16 * Byte4 (IS_Is2) + Byte4 (IS_Is2);
IS_Is8 := 2**32 * Byte8 (IS_Is4) + Byte8 (IS_Is4);
IS_Iu1 := IS_Is1;
IS_Iu2 := IS_Is2;
IS_Iu4 := IS_Is4;
IS_Iu8 := IS_Is8;
IS_Iz1 := IS_Is1;
IS_Iz2 := IS_Is2;
IS_Iz4 := IS_Is4;
IS_Iz8 := IS_Is8;
IV_Isf := IS_Is4;
IV_Ifl := IS_Is4;
IV_Ilf := To_ByteLF (IS_Is8);
if EFloat then
IV_Ill := (B, B, B, B, B, B, B, B, B, B, B, B);
end if;
end if;
-- If no separate Long_Long_Float, then use Long_Float value as
-- Long_Long_Float initial value.
if not EFloat then
declare
pragma Warnings (Off); -- because sizes don't match
function To_ByteLLF is
new Ada.Unchecked_Conversion (ByteLF, ByteLLF);
pragma Warnings (On);
begin
IV_Ill := To_ByteLLF (IV_Ilf);
end;
end if;
end Initialize;
end System.Scalar_Values;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Interfaces;
package Bitmap is
pragma Pure;
type Bit is mod 2**1
with Size => 1;
type UInt8 is new Interfaces.Unsigned_8;
type UInt16 is new Interfaces.Unsigned_16;
type UInt24 is new Interfaces.Unsigned_24;
type UInt32 is new Interfaces.Unsigned_32;
type UInt65 is new Interfaces.Unsigned_32;
type UInt8_Array is array (Natural range <>) of UInt8;
type UInt16_Array is array (Natural range <>) of UInt16;
type UInt24_Array is array (Natural range <>) of UInt24;
type UInt32_Array is array (Natural range <>) of UInt32;
type Orientation_Mode is
(Default,
Portrait,
Landscape);
subtype Actual_Orientation is Orientation_Mode range Portrait .. Landscape;
type Bitmap_Color_Mode is
(ARGB_8888,
RGB_888,
RGB_565,
ARGB_1555,
ARGB_4444,
L_8,
AL_44,
AL_88,
L_4,
A_8,
A_4,
M_1 -- Monochrome
) with Size => 4;
function Bits_Per_Pixel (Mode : Bitmap_Color_Mode) return Positive is
(case Mode is
when ARGB_8888 => 32,
when RGB_888 => 24,
when RGB_565 | ARGB_1555 | ARGB_4444 | AL_88 => 16,
when L_8 | AL_44 | A_8 => 8,
when L_4 | A_4 => 4,
when M_1 => 1);
type Point is record
X : Natural;
Y : Natural;
end record;
function "+" (P1, P2 : Point) return Point
is ((P1.X + P2.X, P1.Y + P2.Y));
function "-" (P1, P2 : Point) return Point
is ((P1.X - P2.X, P1.Y - P2.Y));
type Rect is record
Position : Point;
Width : Natural;
Height : Natural;
end record;
type Bitmap_Color is record
Alpha : UInt8;
Red : UInt8;
Green : UInt8;
Blue : UInt8;
end record with Size => 32;
for Bitmap_Color use record
Blue at 0 range 0 .. 7;
Green at 1 range 0 .. 7;
Red at 2 range 0 .. 7;
Alpha at 3 range 0 .. 7;
end record;
Transparent : constant Bitmap_Color := (000, 000, 000, 000);
Dark_Red : constant Bitmap_Color := (255, 139, 000, 000);
Brown : constant Bitmap_Color := (255, 165, 042, 042);
Firebrick : constant Bitmap_Color := (255, 178, 034, 034);
Crimson : constant Bitmap_Color := (255, 220, 020, 060);
Red : constant Bitmap_Color := (255, 255, 000, 000);
Tomato : constant Bitmap_Color := (255, 255, 099, 071);
Coral : constant Bitmap_Color := (255, 255, 127, 080);
Indian_Red : constant Bitmap_Color := (255, 205, 092, 092);
Light_Coral : constant Bitmap_Color := (255, 240, 128, 128);
Dark_Salmon : constant Bitmap_Color := (255, 233, 150, 122);
Salmon : constant Bitmap_Color := (255, 250, 128, 114);
Light_Salmon : constant Bitmap_Color := (255, 255, 160, 122);
Dark_Orange : constant Bitmap_Color := (255, 255, 140, 000);
Orange : constant Bitmap_Color := (255, 255, 165, 000);
Light_Orange : constant Bitmap_Color := (255, 255, 069, 000);
Gold : constant Bitmap_Color := (255, 255, 215, 000);
Dark_Golden_Rod : constant Bitmap_Color := (255, 184, 134, 011);
Golden_Rod : constant Bitmap_Color := (255, 218, 165, 032);
Pale_Golden_Rod : constant Bitmap_Color := (255, 238, 232, 170);
Dark_Khaki : constant Bitmap_Color := (255, 189, 183, 107);
Khaki : constant Bitmap_Color := (255, 240, 230, 140);
Olive : constant Bitmap_Color := (255, 128, 128, 000);
Yellow : constant Bitmap_Color := (255, 255, 255, 000);
Yellow_Green : constant Bitmap_Color := (255, 154, 205, 050);
Dark_Olive_Green : constant Bitmap_Color := (255, 085, 107, 047);
Olive_Drab : constant Bitmap_Color := (255, 107, 142, 035);
Lawn_Green : constant Bitmap_Color := (255, 124, 252, 000);
Chart_Reuse : constant Bitmap_Color := (255, 127, 255, 000);
Green_Yellow : constant Bitmap_Color := (255, 173, 255, 047);
Dark_Green : constant Bitmap_Color := (255, 000, 100, 000);
Green : constant Bitmap_Color := (255, 000, 255, 000);
Maroon : constant Bitmap_Color := (255, 128, 000, 000);
Forest_Green : constant Bitmap_Color := (255, 034, 139, 034);
Lime : constant Bitmap_Color := (255, 000, 255, 000);
Lime_Green : constant Bitmap_Color := (255, 050, 205, 050);
Light_Green : constant Bitmap_Color := (255, 144, 238, 144);
Pale_Green : constant Bitmap_Color := (255, 152, 251, 152);
Dark_Sea_Green : constant Bitmap_Color := (255, 143, 188, 143);
Medium_Spring_Green : constant Bitmap_Color := (255, 000, 250, 154);
Spring_Green : constant Bitmap_Color := (255, 000, 255, 127);
Sea_Green : constant Bitmap_Color := (255, 046, 139, 087);
Medium_Aqua_Marine : constant Bitmap_Color := (255, 102, 205, 170);
Medium_Sea_Green : constant Bitmap_Color := (255, 060, 179, 113);
Light_Sea_Green : constant Bitmap_Color := (255, 032, 178, 170);
Dark_Slate_Gray : constant Bitmap_Color := (255, 047, 079, 079);
Teal : constant Bitmap_Color := (255, 000, 128, 128);
Dark_Cyan : constant Bitmap_Color := (255, 000, 139, 139);
Aqua : constant Bitmap_Color := (255, 000, 255, 255);
Cyan : constant Bitmap_Color := (255, 000, 255, 255);
Light_Cyan : constant Bitmap_Color := (255, 224, 255, 255);
Dark_Turquoise : constant Bitmap_Color := (255, 000, 206, 209);
Turquoise : constant Bitmap_Color := (255, 064, 224, 208);
Medium_Turquoise : constant Bitmap_Color := (255, 072, 209, 204);
Pale_Turquoise : constant Bitmap_Color := (255, 175, 238, 238);
Aqua_Marine : constant Bitmap_Color := (255, 127, 255, 212);
Powder_Blue : constant Bitmap_Color := (255, 176, 224, 230);
Cadet_Blue : constant Bitmap_Color := (255, 095, 158, 160);
Steel_Blue : constant Bitmap_Color := (255, 070, 130, 180);
Corn_Flower_Blue : constant Bitmap_Color := (255, 100, 149, 237);
Deep_Sky_Blue : constant Bitmap_Color := (255, 000, 191, 255);
Dodger_Blue : constant Bitmap_Color := (255, 030, 144, 255);
Light_Blue : constant Bitmap_Color := (255, 173, 216, 230);
Sky_Blue : constant Bitmap_Color := (255, 135, 206, 235);
Light_Sky_Blue : constant Bitmap_Color := (255, 135, 206, 250);
Midnight_Blue : constant Bitmap_Color := (255, 025, 025, 112);
Navy : constant Bitmap_Color := (255, 000, 000, 128);
Dark_Blue : constant Bitmap_Color := (255, 000, 000, 139);
Medium_Blue : constant Bitmap_Color := (255, 000, 000, 205);
Blue : constant Bitmap_Color := (255, 000, 000, 255);
Royal_Blue : constant Bitmap_Color := (255, 065, 105, 225);
Blue_Violet : constant Bitmap_Color := (255, 138, 043, 226);
Indigo : constant Bitmap_Color := (255, 075, 000, 130);
Dark_Slate_Blue : constant Bitmap_Color := (255, 072, 061, 139);
Slate_Blue : constant Bitmap_Color := (255, 106, 090, 205);
Medium_Slate_Blue : constant Bitmap_Color := (255, 123, 104, 238);
Medium_Purple : constant Bitmap_Color := (255, 147, 112, 219);
Dark_Magenta : constant Bitmap_Color := (255, 139, 000, 139);
Dark_Violet : constant Bitmap_Color := (255, 148, 000, 211);
Dark_Orchid : constant Bitmap_Color := (255, 153, 050, 204);
Medium_Orchid : constant Bitmap_Color := (255, 186, 085, 211);
Purple : constant Bitmap_Color := (255, 128, 000, 128);
Thistle : constant Bitmap_Color := (255, 216, 191, 216);
Plum : constant Bitmap_Color := (255, 221, 160, 221);
Violet : constant Bitmap_Color := (255, 238, 130, 238);
Magenta : constant Bitmap_Color := (255, 255, 000, 255);
Orchid : constant Bitmap_Color := (255, 218, 112, 214);
Medium_Violet_Red : constant Bitmap_Color := (255, 199, 021, 133);
Pale_Violet_Red : constant Bitmap_Color := (255, 219, 112, 147);
Deep_Pink : constant Bitmap_Color := (255, 255, 020, 147);
Hot_Pink : constant Bitmap_Color := (255, 255, 105, 180);
Light_Pink : constant Bitmap_Color := (255, 255, 182, 193);
Pink : constant Bitmap_Color := (255, 255, 192, 203);
Antique_White : constant Bitmap_Color := (255, 250, 235, 215);
Beige : constant Bitmap_Color := (255, 245, 245, 220);
Bisque : constant Bitmap_Color := (255, 255, 228, 196);
Blanched_Almond : constant Bitmap_Color := (255, 255, 235, 205);
Wheat : constant Bitmap_Color := (255, 245, 222, 179);
Corn_Silk : constant Bitmap_Color := (255, 255, 248, 220);
Lemon_Chiffon : constant Bitmap_Color := (255, 255, 250, 205);
Light_Yellow : constant Bitmap_Color := (255, 255, 255, 224);
Saddle_Brown : constant Bitmap_Color := (255, 139, 069, 019);
Sienna : constant Bitmap_Color := (255, 160, 082, 045);
Chocolate : constant Bitmap_Color := (255, 210, 105, 030);
Peru : constant Bitmap_Color := (255, 205, 133, 063);
Sandy_Brown : constant Bitmap_Color := (255, 244, 164, 096);
Burly_Wood : constant Bitmap_Color := (255, 222, 184, 135);
Tan : constant Bitmap_Color := (255, 210, 180, 140);
Rosy_Brown : constant Bitmap_Color := (255, 188, 143, 143);
Moccasin : constant Bitmap_Color := (255, 255, 228, 181);
Navajo_White : constant Bitmap_Color := (255, 255, 222, 173);
Peach_Puff : constant Bitmap_Color := (255, 255, 218, 185);
Misty_Rose : constant Bitmap_Color := (255, 255, 228, 225);
Lavender_Blush : constant Bitmap_Color := (255, 255, 240, 245);
Linen : constant Bitmap_Color := (255, 250, 240, 230);
Old_Lace : constant Bitmap_Color := (255, 253, 245, 230);
Papaya_Whip : constant Bitmap_Color := (255, 255, 239, 213);
Sea_Shell : constant Bitmap_Color := (255, 255, 245, 238);
Mint_Cream : constant Bitmap_Color := (255, 245, 255, 250);
Slate_Gray : constant Bitmap_Color := (255, 112, 128, 144);
Light_Slate_Gray : constant Bitmap_Color := (255, 119, 136, 153);
Light_Steel_Blue : constant Bitmap_Color := (255, 176, 196, 222);
Lavender : constant Bitmap_Color := (255, 230, 230, 250);
Floral_White : constant Bitmap_Color := (255, 255, 250, 240);
Alice_Blue : constant Bitmap_Color := (255, 240, 248, 255);
Ghost_White : constant Bitmap_Color := (255, 248, 248, 255);
Honeydew : constant Bitmap_Color := (255, 240, 255, 240);
Ivory : constant Bitmap_Color := (255, 255, 255, 240);
Azure : constant Bitmap_Color := (255, 240, 255, 255);
Snow : constant Bitmap_Color := (255, 255, 250, 250);
Black : constant Bitmap_Color := (255, 000, 000, 000);
Dim_Grey : constant Bitmap_Color := (255, 105, 105, 105);
Grey : constant Bitmap_Color := (255, 128, 128, 128);
Gray : constant Bitmap_Color := (255, 190, 190, 190);
Dark_Grey : constant Bitmap_Color := (255, 169, 169, 169);
Silver : constant Bitmap_Color := (255, 192, 192, 192);
Light_Grey : constant Bitmap_Color := (255, 211, 211, 211);
Gainsboro : constant Bitmap_Color := (255, 220, 220, 220);
White_Smoke : constant Bitmap_Color := (255, 245, 245, 245);
White : constant Bitmap_Color := (255, 255, 255, 255);
end Bitmap;
|
------------------------------------------------------------------------------
-- Copyright (c) 2013, 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. --
------------------------------------------------------------------------------
procedure Natools.Chunked_Strings.Tests.Memory
(Report : in out Natools.Tests.Reporter'Class)
is
function Allocated_Size (Source : in Chunked_String) return Natural;
-- Return the number of allocated characters in Source
function Allocated_Size (Source : in Chunked_String) return Natural is
begin
if Source.Data = null or else Source.Data'Last < 1 then
return 0;
end if;
return (Source.Data'Last - 1) * Source.Chunk_Size
+ Source.Data (Source.Data'Last)'Last;
end Allocated_Size;
package NT renames Natools.Tests;
begin
NT.Section (Report, "Extra tests for memory usage");
declare
Name : constant String := "Procedure Preallocate";
CS : Chunked_String;
Memory_Ref : Natural;
Repeats : constant Positive := 50;
begin
Preallocate (CS, Repeats * Name'Length);
Memory_Ref := Allocated_Size (CS);
for I in 1 .. Repeats loop
Append (CS, Name);
end loop;
if Memory_Ref /= Allocated_Size (CS) then
NT.Item (Report, Name, NT.Fail);
NT.Info (Report, "Memory after preallocation:"
& Natural'Image (Memory_Ref));
NT.Info (Report, "Memory after insertions:"
& Natural'Image (Allocated_Size (CS)));
else
NT.Item (Report, Name, NT.Success);
end if;
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "Procedure Free_Extra_Memory";
CS : Chunked_String;
Memory_Ref : Natural;
Repeats : constant Positive := 50;
begin
Preallocate (CS, Repeats * Name'Length);
Append (CS, Name);
Memory_Ref := Allocated_Size (CS);
Free_Extra_Memory (CS);
if Memory_Ref <= Allocated_Size (CS) then
NT.Item (Report, Name, NT.Fail);
NT.Info (Report, "Memory before:"
& Natural'Image (Memory_Ref));
NT.Info (Report, "Memory after:"
& Natural'Image (Allocated_Size (CS)));
else
NT.Item (Report, Name, NT.Success);
end if;
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
declare
Name : constant String := "Procedure Free_Extra_Memory (empty)";
CS : Chunked_String;
Memory_Ref : Natural;
Repeats : constant Positive := 50;
begin
Preallocate (CS, Repeats * Name'Length);
Memory_Ref := Allocated_Size (CS);
Free_Extra_Memory (CS);
if Memory_Ref <= Allocated_Size (CS) then
NT.Item (Report, Name, NT.Fail);
NT.Info (Report, "Memory before:"
& Natural'Image (Memory_Ref));
NT.Info (Report, "Memory after:"
& Natural'Image (Allocated_Size (CS)));
else
NT.Item (Report, Name, NT.Success);
end if;
exception
when Error : others => NT.Report_Exception (Report, Name, Error);
end;
Natools.Tests.End_Section (Report);
end Natools.Chunked_Strings.Tests.Memory;
|
with
openGL.Geometry,
openGL.Texture;
package openGL.Model.hexagon_Column.lit_textured_rounded
--
-- Models a lit, colored and textured column with six rounded sides.
--
-- The shaft of the column appears rounded, whereas the top and bottom appear as hexagons.
--
is
type Item is new Model.hexagon_Column.item with private;
type View is access all Item'Class;
---------
--- Faces
--
type hex_Face is
record
Texture : asset_Name := null_Asset; -- The texture to be applied to the face.
end record;
type shaft_Face is
record
Texture : asset_Name := openGL.null_Asset; -- The texture to be applied to the shaft.
end record;
---------
--- Forge
--
function new_hexagon_Column (Radius : in Real;
Height : in Real;
Upper,
Lower : in hex_Face;
Shaft : in shaft_Face) return View;
--------------
--- Attributes
--
overriding
function to_GL_Geometries (Self : access Item; Textures : access Texture.name_Map_of_texture'Class;
Fonts : in Font.font_id_Map_of_font) return Geometry.views;
private
type Item is new Model.hexagon_Column.item with
record
upper_Face,
lower_Face : hex_Face;
Shaft : shaft_Face;
end record;
end openGL.Model.hexagon_Column.lit_textured_rounded;
|
with
openGL.Palette,
openGL.Model.Box.lit_colored_textured,
openGL.Visual,
openGL.Demo;
procedure launch_many_Boxes_Demo
--
-- Exercise the culler with many boxes.
--
is
use openGL,
openGL.Model,
openGL.Model.box,
openGL.Palette,
openGL.Math,
openGL.linear_Algebra_3d;
begin
Demo.print_Usage;
Demo.define ("openGL 'many Boxes' Demo");
-- Setup the camera.
--
Demo.Camera.Position_is ((0.0, 0.0, 5.0),
y_Rotation_from (to_Radians (0.0)));
declare
Face : constant asset_Name := to_Asset ("assets/Face1.bmp");
the_box_Model : constant Box.lit_colored_textured.view
:= Box.lit_colored_textured.new_Box
(size => (0.5, 0.5, 0.5),
faces => (front => (colors => (others => (White, Opaque)), texture_name => Face),
rear => (colors => (others => (Blue, Opaque)), texture_name => Face),
upper => (colors => (others => (Green, Opaque)), texture_name => Face),
lower => (colors => (others => (Green, Opaque)), texture_name => Face),
left => (colors => (others => (Dark_Red, Opaque)), texture_name => Face),
right => (colors => (others => (Red, Opaque)), texture_name => Face)));
Size : constant Integer := 70;
x : openGL.Real := -openGL.Real (Size) / 2.0;
z : openGL.Real := 0.0;
Sprites : constant Visual.views (1 .. Size * Size) := (others => Visual.Forge.new_Visual (Model.view (the_box_Model)));
begin
for i in Sprites'Range
loop
x := x + 1.0;
if i mod Size = 0
then
z := z - 1.0;
x := -openGL.Real (Size) / 2.0;
end if;
Sprites (i).Site_is ((x, 0.0, z));
end loop;
-- Main loop.
--
while not Demo.Done
loop
Demo.Dolly.evolve;
Demo.Done := Demo.Dolly.quit_Requested;
Demo.Camera.render (Sprites);
while not Demo.Camera.cull_Completed
loop
delay Duration'Small;
end loop;
Demo.Renderer.render;
Demo.FPS_Counter.increment; -- Frames per second display.
end loop;
end;
Demo.destroy;
end launch_many_Boxes_Demo;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.INDEFINITE_HASHED_SETS --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Ada.Containers.Hash_Tables.Generic_Operations;
pragma Elaborate_All (Ada.Containers.Hash_Tables.Generic_Operations);
with Ada.Containers.Hash_Tables.Generic_Keys;
pragma Elaborate_All (Ada.Containers.Hash_Tables.Generic_Keys);
with Ada.Containers.Helpers; use Ada.Containers.Helpers;
with Ada.Containers.Prime_Numbers;
with System; use type System.Address;
with System.Put_Images;
package body Ada.Containers.Indefinite_Hashed_Sets with
SPARK_Mode => Off
is
pragma Warnings (Off, "variable ""Busy*"" is not referenced");
pragma Warnings (Off, "variable ""Lock*"" is not referenced");
-- See comment in Ada.Containers.Helpers
-----------------------
-- Local Subprograms --
-----------------------
procedure Assign (Node : Node_Access; Item : Element_Type);
pragma Inline (Assign);
function Copy_Node (Source : Node_Access) return Node_Access;
pragma Inline (Copy_Node);
function Equivalent_Keys
(Key : Element_Type;
Node : Node_Access) return Boolean;
pragma Inline (Equivalent_Keys);
function Find_Equal_Key
(R_HT : Hash_Table_Type;
L_Node : Node_Access) return Boolean;
function Find_Equivalent_Key
(R_HT : Hash_Table_Type;
L_Node : Node_Access) return Boolean;
procedure Free (X : in out Node_Access);
function Hash_Node (Node : Node_Access) return Hash_Type;
pragma Inline (Hash_Node);
procedure Insert
(HT : in out Hash_Table_Type;
New_Item : Element_Type;
Node : out Node_Access;
Inserted : out Boolean);
function Is_In
(HT : aliased in out Hash_Table_Type;
Key : Node_Access) return Boolean;
pragma Inline (Is_In);
function Next (Node : Node_Access) return Node_Access;
pragma Inline (Next);
function Read_Node (Stream : not null access Root_Stream_Type'Class)
return Node_Access;
pragma Inline (Read_Node);
procedure Set_Next (Node : Node_Access; Next : Node_Access);
pragma Inline (Set_Next);
function Vet (Position : Cursor) return Boolean;
procedure Write_Node
(Stream : not null access Root_Stream_Type'Class;
Node : Node_Access);
pragma Inline (Write_Node);
--------------------------
-- Local Instantiations --
--------------------------
procedure Free_Element is
new Ada.Unchecked_Deallocation (Element_Type, Element_Access);
package HT_Ops is new Hash_Tables.Generic_Operations
(HT_Types => HT_Types,
Hash_Node => Hash_Node,
Next => Next,
Set_Next => Set_Next,
Copy_Node => Copy_Node,
Free => Free);
package Element_Keys is new Hash_Tables.Generic_Keys
(HT_Types => HT_Types,
Next => Next,
Set_Next => Set_Next,
Key_Type => Element_Type,
Hash => Hash,
Equivalent_Keys => Equivalent_Keys);
function Is_Equal is
new HT_Ops.Generic_Equal (Find_Equal_Key);
function Is_Equivalent is
new HT_Ops.Generic_Equal (Find_Equivalent_Key);
procedure Read_Nodes is
new HT_Ops.Generic_Read (Read_Node);
procedure Replace_Element is
new Element_Keys.Generic_Replace_Element (Hash_Node, Assign);
procedure Write_Nodes is
new HT_Ops.Generic_Write (Write_Node);
---------
-- "=" --
---------
function "=" (Left, Right : Set) return Boolean is
begin
return Is_Equal (Left.HT, Right.HT);
end "=";
------------
-- Adjust --
------------
procedure Adjust (Container : in out Set) is
begin
HT_Ops.Adjust (Container.HT);
end Adjust;
------------
-- Assign --
------------
procedure Assign (Node : Node_Access; Item : Element_Type) is
X : Element_Access := Node.Element;
-- The element allocator may need an accessibility check in the case the
-- actual type is class-wide or has access discriminants (RM 4.8(10.1)
-- and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
Node.Element := new Element_Type'(Item);
Free_Element (X);
end Assign;
procedure Assign (Target : in out Set; Source : Set) is
begin
if Target'Address = Source'Address then
return;
else
Target.Clear;
Target.Union (Source);
end if;
end Assign;
--------------
-- Capacity --
--------------
function Capacity (Container : Set) return Count_Type is
begin
return HT_Ops.Capacity (Container.HT);
end Capacity;
-----------
-- Clear --
-----------
procedure Clear (Container : in out Set) is
begin
HT_Ops.Clear (Container.HT);
end Clear;
------------------------
-- Constant_Reference --
------------------------
function Constant_Reference
(Container : aliased Set;
Position : Cursor) return Constant_Reference_Type
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong container";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with "Node has no element";
end if;
pragma Assert (Vet (Position), "bad cursor in Constant_Reference");
declare
HT : Hash_Table_Type renames Position.Container.all.HT;
TC : constant Tamper_Counts_Access :=
HT.TC'Unrestricted_Access;
begin
return R : constant Constant_Reference_Type :=
(Element => Position.Node.Element.all'Access,
Control => (Controlled with TC))
do
Busy (TC.all);
end return;
end;
end Constant_Reference;
--------------
-- Contains --
--------------
function Contains (Container : Set; Item : Element_Type) return Boolean is
begin
return Find (Container, Item) /= No_Element;
end Contains;
----------
-- Copy --
----------
function Copy
(Source : Set;
Capacity : Count_Type := 0) return Set
is
C : Count_Type;
begin
if Capacity < Source.Length then
if Checks and then Capacity /= 0 then
raise Capacity_Error
with "Requested capacity is less than Source length";
end if;
C := Source.Length;
else
C := Capacity;
end if;
return Target : Set do
Target.Reserve_Capacity (C);
Target.Assign (Source);
end return;
end Copy;
---------------
-- Copy_Node --
---------------
function Copy_Node (Source : Node_Access) return Node_Access is
E : Element_Access := new Element_Type'(Source.Element.all);
begin
return new Node_Type'(Element => E, Next => null);
exception
when others =>
Free_Element (E);
raise;
end Copy_Node;
------------
-- Delete --
------------
procedure Delete
(Container : in out Set;
Item : Element_Type)
is
X : Node_Access;
begin
Element_Keys.Delete_Key_Sans_Free (Container.HT, Item, X);
if Checks and then X = null then
raise Constraint_Error with "attempt to delete element not in set";
end if;
Free (X);
end Delete;
procedure Delete
(Container : in out Set;
Position : in out Cursor)
is
begin
TC_Check (Container.HT.TC);
if Checks and then Position.Node = null then
raise Constraint_Error with "Position cursor equals No_Element";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with "Position cursor is bad";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with "Position cursor designates wrong set";
end if;
pragma Assert (Vet (Position), "Position cursor is bad");
HT_Ops.Delete_Node_Sans_Free (Container.HT, Position.Node);
Free (Position.Node);
Position.Container := null;
end Delete;
----------------
-- Difference --
----------------
procedure Difference
(Target : in out Set;
Source : Set)
is
Src_HT : Hash_Table_Type renames Source'Unrestricted_Access.HT;
Tgt_Node : Node_Access;
begin
if Target'Address = Source'Address then
Clear (Target);
return;
end if;
if Src_HT.Length = 0 then
return;
end if;
TC_Check (Target.HT.TC);
if Src_HT.Length < Target.HT.Length then
declare
Src_Node : Node_Access;
begin
Src_Node := HT_Ops.First (Src_HT);
while Src_Node /= null loop
Tgt_Node := Element_Keys.Find (Target.HT, Src_Node.Element.all);
if Tgt_Node /= null then
HT_Ops.Delete_Node_Sans_Free (Target.HT, Tgt_Node);
Free (Tgt_Node);
end if;
Src_Node := HT_Ops.Next (Src_HT, Src_Node);
end loop;
end;
else
Tgt_Node := HT_Ops.First (Target.HT);
while Tgt_Node /= null loop
if Is_In (Src_HT, Tgt_Node) then
declare
X : Node_Access := Tgt_Node;
begin
Tgt_Node := HT_Ops.Next (Target.HT, Tgt_Node);
HT_Ops.Delete_Node_Sans_Free (Target.HT, X);
Free (X);
end;
else
Tgt_Node := HT_Ops.Next (Target.HT, Tgt_Node);
end if;
end loop;
end if;
end Difference;
function Difference (Left, Right : Set) return Set is
Left_HT : Hash_Table_Type renames Left'Unrestricted_Access.HT;
Right_HT : Hash_Table_Type renames Right'Unrestricted_Access.HT;
Buckets : HT_Types.Buckets_Access;
Length : Count_Type;
begin
if Left'Address = Right'Address then
return Empty_Set;
end if;
if Left.Length = 0 then
return Empty_Set;
end if;
if Right.Length = 0 then
return Left;
end if;
declare
Size : constant Hash_Type := Prime_Numbers.To_Prime (Left.Length);
begin
Buckets := HT_Ops.New_Buckets (Length => Size);
end;
Length := 0;
Iterate_Left : declare
procedure Process (L_Node : Node_Access);
procedure Iterate is
new HT_Ops.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (L_Node : Node_Access) is
begin
if not Is_In (Right_HT, L_Node) then
declare
-- Per AI05-0022, the container implementation is required
-- to detect element tampering by a generic actual
-- subprogram, hence the use of Checked_Index instead of a
-- simple invocation of generic formal Hash.
Indx : constant Hash_Type :=
HT_Ops.Checked_Index (Left_HT, Buckets.all, L_Node);
Bucket : Node_Access renames Buckets (Indx);
Src : Element_Type renames L_Node.Element.all;
Tgt : Element_Access := new Element_Type'(Src);
begin
Bucket := new Node_Type'(Tgt, Bucket);
exception
when others =>
Free_Element (Tgt);
raise;
end;
Length := Length + 1;
end if;
end Process;
-- Start of processing for Iterate_Left
begin
Iterate (Left.HT);
exception
when others =>
HT_Ops.Free_Hash_Table (Buckets);
raise;
end Iterate_Left;
return (Controlled with HT => (Buckets, Length, (Busy => 0, Lock => 0)));
end Difference;
-------------
-- Element --
-------------
function Element (Position : Cursor) return Element_Type is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with "Position cursor of equals No_Element";
end if;
if Checks and then Position.Node.Element = null then
-- handle dangling reference
raise Program_Error with "Position cursor is bad";
end if;
pragma Assert (Vet (Position), "bad cursor in function Element");
return Position.Node.Element.all;
end Element;
-----------
-- Empty --
-----------
function Empty (Capacity : Count_Type := 1000) return Set is
begin
return Result : Set do
Reserve_Capacity (Result, Capacity);
end return;
end Empty;
---------------------
-- Equivalent_Sets --
---------------------
function Equivalent_Sets (Left, Right : Set) return Boolean is
begin
return Is_Equivalent (Left.HT, Right.HT);
end Equivalent_Sets;
-------------------------
-- Equivalent_Elements --
-------------------------
function Equivalent_Elements (Left, Right : Cursor) return Boolean is
begin
if Checks and then Left.Node = null then
raise Constraint_Error with
"Left cursor of Equivalent_Elements equals No_Element";
end if;
if Checks and then Right.Node = null then
raise Constraint_Error with
"Right cursor of Equivalent_Elements equals No_Element";
end if;
if Checks and then Left.Node.Element = null then
raise Program_Error with
"Left cursor of Equivalent_Elements is bad";
end if;
if Checks and then Right.Node.Element = null then
raise Program_Error with
"Right cursor of Equivalent_Elements is bad";
end if;
pragma Assert (Vet (Left), "bad Left cursor in Equivalent_Elements");
pragma Assert (Vet (Right), "bad Right cursor in Equivalent_Elements");
-- AI05-0022 requires that a container implementation detect element
-- tampering by a generic actual subprogram. However, the following case
-- falls outside the scope of that AI. Randy Brukardt explained on the
-- ARG list on 2013/02/07 that:
-- (Begin Quote):
-- But for an operation like "<" [the ordered set analog of
-- Equivalent_Elements], there is no need to "dereference" a cursor
-- after the call to the generic formal parameter function, so nothing
-- bad could happen if tampering is undetected. And the operation can
-- safely return a result without a problem even if an element is
-- deleted from the container.
-- (End Quote).
return Equivalent_Elements
(Left.Node.Element.all,
Right.Node.Element.all);
end Equivalent_Elements;
function Equivalent_Elements
(Left : Cursor;
Right : Element_Type) return Boolean
is
begin
if Checks and then Left.Node = null then
raise Constraint_Error with
"Left cursor of Equivalent_Elements equals No_Element";
end if;
if Checks and then Left.Node.Element = null then
raise Program_Error with
"Left cursor of Equivalent_Elements is bad";
end if;
pragma Assert (Vet (Left), "bad Left cursor in Equivalent_Elements");
return Equivalent_Elements (Left.Node.Element.all, Right);
end Equivalent_Elements;
function Equivalent_Elements
(Left : Element_Type;
Right : Cursor) return Boolean
is
begin
if Checks and then Right.Node = null then
raise Constraint_Error with
"Right cursor of Equivalent_Elements equals No_Element";
end if;
if Checks and then Right.Node.Element = null then
raise Program_Error with
"Right cursor of Equivalent_Elements is bad";
end if;
pragma Assert (Vet (Right), "bad Right cursor in Equivalent_Elements");
return Equivalent_Elements (Left, Right.Node.Element.all);
end Equivalent_Elements;
---------------------
-- Equivalent_Keys --
---------------------
function Equivalent_Keys
(Key : Element_Type;
Node : Node_Access) return Boolean
is
begin
return Equivalent_Elements (Key, Node.Element.all);
end Equivalent_Keys;
-------------
-- Exclude --
-------------
procedure Exclude
(Container : in out Set;
Item : Element_Type)
is
X : Node_Access;
begin
Element_Keys.Delete_Key_Sans_Free (Container.HT, Item, X);
Free (X);
end Exclude;
--------------
-- Finalize --
--------------
procedure Finalize (Container : in out Set) is
begin
HT_Ops.Finalize (Container.HT);
end Finalize;
procedure Finalize (Object : in out Iterator) is
begin
if Object.Container /= null then
Unbusy (Object.Container.HT.TC);
end if;
end Finalize;
----------
-- Find --
----------
function Find
(Container : Set;
Item : Element_Type) return Cursor
is
HT : Hash_Table_Type renames Container'Unrestricted_Access.HT;
Node : constant Node_Access := Element_Keys.Find (HT, Item);
begin
return (if Node = null then No_Element
else Cursor'(Container'Unrestricted_Access, Node));
end Find;
--------------------
-- Find_Equal_Key --
--------------------
function Find_Equal_Key
(R_HT : Hash_Table_Type;
L_Node : Node_Access) return Boolean
is
R_Index : constant Hash_Type :=
Element_Keys.Index (R_HT, L_Node.Element.all);
R_Node : Node_Access := R_HT.Buckets (R_Index);
begin
loop
if R_Node = null then
return False;
end if;
if L_Node.Element.all = R_Node.Element.all then
return True;
end if;
R_Node := Next (R_Node);
end loop;
end Find_Equal_Key;
-------------------------
-- Find_Equivalent_Key --
-------------------------
function Find_Equivalent_Key
(R_HT : Hash_Table_Type;
L_Node : Node_Access) return Boolean
is
R_Index : constant Hash_Type :=
Element_Keys.Index (R_HT, L_Node.Element.all);
R_Node : Node_Access := R_HT.Buckets (R_Index);
begin
loop
if R_Node = null then
return False;
end if;
if Equivalent_Elements (L_Node.Element.all, R_Node.Element.all) then
return True;
end if;
R_Node := Next (R_Node);
end loop;
end Find_Equivalent_Key;
-----------
-- First --
-----------
function First (Container : Set) return Cursor is
Node : constant Node_Access := HT_Ops.First (Container.HT);
begin
return (if Node = null then No_Element
else Cursor'(Container'Unrestricted_Access, Node));
end First;
function First (Object : Iterator) return Cursor is
begin
return Object.Container.First;
end First;
----------
-- Free --
----------
procedure Free (X : in out Node_Access) is
procedure Deallocate is
new Ada.Unchecked_Deallocation (Node_Type, Node_Access);
begin
if X = null then
return;
end if;
X.Next := X; -- detect mischief (in Vet)
begin
Free_Element (X.Element);
exception
when others =>
X.Element := null;
Deallocate (X);
raise;
end;
Deallocate (X);
end Free;
------------------------
-- Get_Element_Access --
------------------------
function Get_Element_Access
(Position : Cursor) return not null Element_Access is
begin
return Position.Node.Element;
end Get_Element_Access;
-----------------
-- Has_Element --
-----------------
function Has_Element (Position : Cursor) return Boolean is
begin
pragma Assert (Vet (Position), "bad cursor in Has_Element");
return Position.Node /= null;
end Has_Element;
---------------
-- Hash_Node --
---------------
function Hash_Node (Node : Node_Access) return Hash_Type is
begin
return Hash (Node.Element.all);
end Hash_Node;
-------------
-- Include --
-------------
procedure Include
(Container : in out Set;
New_Item : Element_Type)
is
Position : Cursor;
Inserted : Boolean;
X : Element_Access;
begin
Insert (Container, New_Item, Position, Inserted);
if not Inserted then
TE_Check (Container.HT.TC);
X := Position.Node.Element;
declare
-- The element allocator may need an accessibility check in the
-- case the actual type is class-wide or has access discriminants
-- (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
Position.Node.Element := new Element_Type'(New_Item);
end;
Free_Element (X);
end if;
end Include;
------------
-- Insert --
------------
procedure Insert
(Container : in out Set;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean)
is
begin
Insert (Container.HT, New_Item, Position.Node, Inserted);
Position.Container := Container'Unchecked_Access;
end Insert;
procedure Insert
(Container : in out Set;
New_Item : Element_Type)
is
Position : Cursor;
pragma Unreferenced (Position);
Inserted : Boolean;
begin
Insert (Container, New_Item, Position, Inserted);
if Checks and then not Inserted then
raise Constraint_Error with
"attempt to insert element already in set";
end if;
end Insert;
procedure Insert
(HT : in out Hash_Table_Type;
New_Item : Element_Type;
Node : out Node_Access;
Inserted : out Boolean)
is
function New_Node (Next : Node_Access) return Node_Access;
pragma Inline (New_Node);
procedure Local_Insert is
new Element_Keys.Generic_Conditional_Insert (New_Node);
--------------
-- New_Node --
--------------
function New_Node (Next : Node_Access) return Node_Access is
-- The element allocator may need an accessibility check in the case
-- the actual type is class-wide or has access discriminants (see
-- RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
Element : Element_Access := new Element_Type'(New_Item);
begin
return new Node_Type'(Element, Next);
exception
when others =>
Free_Element (Element);
raise;
end New_Node;
-- Start of processing for Insert
begin
if HT_Ops.Capacity (HT) = 0 then
HT_Ops.Reserve_Capacity (HT, 1);
end if;
Local_Insert (HT, New_Item, Node, Inserted);
if Inserted and then HT.Length > HT_Ops.Capacity (HT) then
HT_Ops.Reserve_Capacity (HT, HT.Length);
end if;
end Insert;
------------------
-- Intersection --
------------------
procedure Intersection
(Target : in out Set;
Source : Set)
is
Src_HT : Hash_Table_Type renames Source'Unrestricted_Access.HT;
Tgt_Node : Node_Access;
begin
if Target'Address = Source'Address then
return;
end if;
if Source.Length = 0 then
Clear (Target);
return;
end if;
TC_Check (Target.HT.TC);
Tgt_Node := HT_Ops.First (Target.HT);
while Tgt_Node /= null loop
if Is_In (Src_HT, Tgt_Node) then
Tgt_Node := HT_Ops.Next (Target.HT, Tgt_Node);
else
declare
X : Node_Access := Tgt_Node;
begin
Tgt_Node := HT_Ops.Next (Target.HT, Tgt_Node);
HT_Ops.Delete_Node_Sans_Free (Target.HT, X);
Free (X);
end;
end if;
end loop;
end Intersection;
function Intersection (Left, Right : Set) return Set is
Left_HT : Hash_Table_Type renames Left'Unrestricted_Access.HT;
Right_HT : Hash_Table_Type renames Right'Unrestricted_Access.HT;
Buckets : HT_Types.Buckets_Access;
Length : Count_Type;
begin
if Left'Address = Right'Address then
return Left;
end if;
Length := Count_Type'Min (Left.Length, Right.Length);
if Length = 0 then
return Empty_Set;
end if;
declare
Size : constant Hash_Type := Prime_Numbers.To_Prime (Length);
begin
Buckets := HT_Ops.New_Buckets (Length => Size);
end;
Length := 0;
Iterate_Left : declare
procedure Process (L_Node : Node_Access);
procedure Iterate is
new HT_Ops.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (L_Node : Node_Access) is
begin
if Is_In (Right_HT, L_Node) then
declare
-- Per AI05-0022, the container implementation is required
-- to detect element tampering by a generic actual
-- subprogram, hence the use of Checked_Index instead of a
-- simple invocation of generic formal Hash.
Indx : constant Hash_Type :=
HT_Ops.Checked_Index (Left_HT, Buckets.all, L_Node);
Bucket : Node_Access renames Buckets (Indx);
Src : Element_Type renames L_Node.Element.all;
Tgt : Element_Access := new Element_Type'(Src);
begin
Bucket := new Node_Type'(Tgt, Bucket);
exception
when others =>
Free_Element (Tgt);
raise;
end;
Length := Length + 1;
end if;
end Process;
-- Start of processing for Iterate_Left
begin
Iterate (Left.HT);
exception
when others =>
HT_Ops.Free_Hash_Table (Buckets);
raise;
end Iterate_Left;
return (Controlled with HT => (Buckets, Length, (Busy => 0, Lock => 0)));
end Intersection;
--------------
-- Is_Empty --
--------------
function Is_Empty (Container : Set) return Boolean is
begin
return Container.HT.Length = 0;
end Is_Empty;
-----------
-- Is_In --
-----------
function Is_In
(HT : aliased in out Hash_Table_Type;
Key : Node_Access) return Boolean
is
begin
return Element_Keys.Find (HT, Key.Element.all) /= null;
end Is_In;
---------------
-- Is_Subset --
---------------
function Is_Subset
(Subset : Set;
Of_Set : Set) return Boolean
is
Subset_HT : Hash_Table_Type renames Subset'Unrestricted_Access.HT;
Of_Set_HT : Hash_Table_Type renames Of_Set'Unrestricted_Access.HT;
Subset_Node : Node_Access;
begin
if Subset'Address = Of_Set'Address then
return True;
end if;
if Subset.Length > Of_Set.Length then
return False;
end if;
Subset_Node := HT_Ops.First (Subset_HT);
while Subset_Node /= null loop
if not Is_In (Of_Set_HT, Subset_Node) then
return False;
end if;
Subset_Node := HT_Ops.Next (Subset_HT, Subset_Node);
end loop;
return True;
end Is_Subset;
-------------
-- Iterate --
-------------
procedure Iterate
(Container : Set;
Process : not null access procedure (Position : Cursor))
is
procedure Process_Node (Node : Node_Access);
pragma Inline (Process_Node);
procedure Iterate is
new HT_Ops.Generic_Iteration (Process_Node);
------------------
-- Process_Node --
------------------
procedure Process_Node (Node : Node_Access) is
begin
Process (Cursor'(Container'Unrestricted_Access, Node));
end Process_Node;
Busy : With_Busy (Container.HT.TC'Unrestricted_Access);
-- Start of processing for Iterate
begin
Iterate (Container.HT);
end Iterate;
function Iterate (Container : Set)
return Set_Iterator_Interfaces.Forward_Iterator'Class
is
begin
return It : constant Iterator :=
Iterator'(Limited_Controlled with
Container => Container'Unrestricted_Access)
do
Busy (Container.HT.TC'Unrestricted_Access.all);
end return;
end Iterate;
------------
-- Length --
------------
function Length (Container : Set) return Count_Type is
begin
return Container.HT.Length;
end Length;
----------
-- Move --
----------
procedure Move (Target : in out Set; Source : in out Set) is
begin
HT_Ops.Move (Target => Target.HT, Source => Source.HT);
end Move;
----------
-- Next --
----------
function Next (Node : Node_Access) return Node_Access is
begin
return Node.Next;
end Next;
function Next (Position : Cursor) return Cursor is
begin
if Position.Node = null then
return No_Element;
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with "bad cursor in Next";
end if;
pragma Assert (Vet (Position), "bad cursor in Next");
declare
HT : Hash_Table_Type renames Position.Container.HT;
Node : constant Node_Access := HT_Ops.Next (HT, Position.Node);
begin
return (if Node = null then No_Element
else Cursor'(Position.Container, Node));
end;
end Next;
procedure Next (Position : in out Cursor) is
begin
Position := Next (Position);
end Next;
function Next
(Object : Iterator;
Position : Cursor) return Cursor
is
begin
if Position.Container = null then
return No_Element;
end if;
if Checks and then Position.Container /= Object.Container then
raise Program_Error with
"Position cursor of Next designates wrong set";
end if;
return Next (Position);
end Next;
-------------
-- Overlap --
-------------
function Overlap (Left, Right : Set) return Boolean is
Left_HT : Hash_Table_Type renames Left'Unrestricted_Access.HT;
Right_HT : Hash_Table_Type renames Right'Unrestricted_Access.HT;
Left_Node : Node_Access;
begin
if Right.Length = 0 then
return False;
end if;
if Left'Address = Right'Address then
return True;
end if;
Left_Node := HT_Ops.First (Left_HT);
while Left_Node /= null loop
if Is_In (Right_HT, Left_Node) then
return True;
end if;
Left_Node := HT_Ops.Next (Left_HT, Left_Node);
end loop;
return False;
end Overlap;
----------------------
-- Pseudo_Reference --
----------------------
function Pseudo_Reference
(Container : aliased Set'Class) return Reference_Control_Type
is
TC : constant Tamper_Counts_Access :=
Container.HT.TC'Unrestricted_Access;
begin
return R : constant Reference_Control_Type := (Controlled with TC) do
Busy (TC.all);
end return;
end Pseudo_Reference;
-------------------
-- Query_Element --
-------------------
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type))
is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of Query_Element equals No_Element";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with "bad cursor in Query_Element";
end if;
pragma Assert (Vet (Position), "bad cursor in Query_Element");
declare
HT : Hash_Table_Type renames
Position.Container'Unrestricted_Access.all.HT;
Lock : With_Lock (HT.TC'Unrestricted_Access);
begin
Process (Position.Node.Element.all);
end;
end Query_Element;
---------------
-- Put_Image --
---------------
procedure Put_Image
(S : in out Ada.Strings.Text_Output.Sink'Class; V : Set)
is
First_Time : Boolean := True;
use System.Put_Images;
begin
Array_Before (S);
for X of V loop
if First_Time then
First_Time := False;
else
Simple_Array_Between (S);
end if;
Element_Type'Put_Image (S, X);
end loop;
Array_After (S);
end Put_Image;
----------
-- Read --
----------
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Set)
is
begin
Read_Nodes (Stream, Container.HT);
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Cursor)
is
begin
raise Program_Error with "attempt to stream set cursor";
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
---------------
-- Read_Node --
---------------
function Read_Node
(Stream : not null access Root_Stream_Type'Class) return Node_Access
is
X : Element_Access := new Element_Type'(Element_Type'Input (Stream));
begin
return new Node_Type'(X, null);
exception
when others =>
Free_Element (X);
raise;
end Read_Node;
-------------
-- Replace --
-------------
procedure Replace
(Container : in out Set;
New_Item : Element_Type)
is
Node : constant Node_Access :=
Element_Keys.Find (Container.HT, New_Item);
X : Element_Access;
pragma Warnings (Off, X);
begin
TE_Check (Container.HT.TC);
if Checks and then Node = null then
raise Constraint_Error with
"attempt to replace element not in set";
end if;
X := Node.Element;
declare
-- The element allocator may need an accessibility check in the case
-- the actual type is class-wide or has access discriminants (see
-- RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
Node.Element := new Element_Type'(New_Item);
end;
Free_Element (X);
end Replace;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Container : in out Set;
Position : Cursor;
New_Item : Element_Type)
is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with "Position cursor equals No_Element";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with "bad cursor in Replace_Element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong set";
end if;
pragma Assert (Vet (Position), "bad cursor in Replace_Element");
Replace_Element (Container.HT, Position.Node, New_Item);
end Replace_Element;
----------------------
-- Reserve_Capacity --
----------------------
procedure Reserve_Capacity
(Container : in out Set;
Capacity : Count_Type)
is
begin
HT_Ops.Reserve_Capacity (Container.HT, Capacity);
end Reserve_Capacity;
--------------
-- Set_Next --
--------------
procedure Set_Next (Node : Node_Access; Next : Node_Access) is
begin
Node.Next := Next;
end Set_Next;
--------------------------
-- Symmetric_Difference --
--------------------------
procedure Symmetric_Difference
(Target : in out Set;
Source : Set)
is
Tgt_HT : Hash_Table_Type renames Target.HT;
Src_HT : Hash_Table_Type renames Source.HT'Unrestricted_Access.all;
begin
if Target'Address = Source'Address then
Clear (Target);
return;
end if;
TC_Check (Tgt_HT.TC);
declare
N : constant Count_Type := Target.Length + Source.Length;
begin
if N > HT_Ops.Capacity (Tgt_HT) then
HT_Ops.Reserve_Capacity (Tgt_HT, N);
end if;
end;
if Target.Length = 0 then
Iterate_Source_When_Empty_Target : declare
procedure Process (Src_Node : Node_Access);
procedure Iterate is new HT_Ops.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (Src_Node : Node_Access) is
E : Element_Type renames Src_Node.Element.all;
B : Buckets_Type renames Tgt_HT.Buckets.all;
J : constant Hash_Type := Hash (E) mod B'Length;
N : Count_Type renames Tgt_HT.Length;
begin
declare
X : Element_Access := new Element_Type'(E);
begin
B (J) := new Node_Type'(X, B (J));
exception
when others =>
Free_Element (X);
raise;
end;
N := N + 1;
end Process;
-- Per AI05-0022, the container implementation is required to
-- detect element tampering by a generic actual subprogram.
Lock_Tgt : With_Lock (Tgt_HT.TC'Unrestricted_Access);
Lock_Src : With_Lock (Src_HT.TC'Unrestricted_Access);
-- Start of processing for Iterate_Source_When_Empty_Target
begin
Iterate (Src_HT);
end Iterate_Source_When_Empty_Target;
else
Iterate_Source : declare
procedure Process (Src_Node : Node_Access);
procedure Iterate is
new HT_Ops.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (Src_Node : Node_Access) is
E : Element_Type renames Src_Node.Element.all;
B : Buckets_Type renames Tgt_HT.Buckets.all;
J : constant Hash_Type := Hash (E) mod B'Length;
N : Count_Type renames Tgt_HT.Length;
begin
if B (J) = null then
declare
X : Element_Access := new Element_Type'(E);
begin
B (J) := new Node_Type'(X, null);
exception
when others =>
Free_Element (X);
raise;
end;
N := N + 1;
elsif Equivalent_Elements (E, B (J).Element.all) then
declare
X : Node_Access := B (J);
begin
B (J) := B (J).Next;
N := N - 1;
Free (X);
end;
else
declare
Prev : Node_Access := B (J);
Curr : Node_Access := Prev.Next;
begin
while Curr /= null loop
if Equivalent_Elements (E, Curr.Element.all) then
Prev.Next := Curr.Next;
N := N - 1;
Free (Curr);
return;
end if;
Prev := Curr;
Curr := Prev.Next;
end loop;
declare
X : Element_Access := new Element_Type'(E);
begin
B (J) := new Node_Type'(X, B (J));
exception
when others =>
Free_Element (X);
raise;
end;
N := N + 1;
end;
end if;
end Process;
-- Per AI05-0022, the container implementation is required to
-- detect element tampering by a generic actual subprogram.
Lock_Tgt : With_Lock (Tgt_HT.TC'Unrestricted_Access);
Lock_Src : With_Lock (Src_HT.TC'Unrestricted_Access);
-- Start of processing for Iterate_Source
begin
Iterate (Src_HT);
end Iterate_Source;
end if;
end Symmetric_Difference;
function Symmetric_Difference (Left, Right : Set) return Set is
Left_HT : Hash_Table_Type renames Left'Unrestricted_Access.HT;
Right_HT : Hash_Table_Type renames Right'Unrestricted_Access.HT;
Buckets : HT_Types.Buckets_Access;
Length : Count_Type;
begin
if Left'Address = Right'Address then
return Empty_Set;
end if;
if Right.Length = 0 then
return Left;
end if;
if Left.Length = 0 then
return Right;
end if;
declare
Size : constant Hash_Type :=
Prime_Numbers.To_Prime (Left.Length + Right.Length);
begin
Buckets := HT_Ops.New_Buckets (Length => Size);
end;
Length := 0;
Iterate_Left : declare
procedure Process (L_Node : Node_Access);
procedure Iterate is
new HT_Ops.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (L_Node : Node_Access) is
begin
if not Is_In (Right_HT, L_Node) then
declare
E : Element_Type renames L_Node.Element.all;
-- Per AI05-0022, the container implementation is required
-- to detect element tampering by a generic actual
-- subprogram, hence the use of Checked_Index instead of a
-- simple invocation of generic formal Hash.
J : constant Hash_Type :=
HT_Ops.Checked_Index (Left_HT, Buckets.all, L_Node);
begin
declare
X : Element_Access := new Element_Type'(E);
begin
Buckets (J) := new Node_Type'(X, Buckets (J));
exception
when others =>
Free_Element (X);
raise;
end;
Length := Length + 1;
end;
end if;
end Process;
-- Start of processing for Iterate_Left
begin
Iterate (Left_HT);
exception
when others =>
HT_Ops.Free_Hash_Table (Buckets);
raise;
end Iterate_Left;
Iterate_Right : declare
procedure Process (R_Node : Node_Access);
procedure Iterate is
new HT_Ops.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (R_Node : Node_Access) is
begin
if not Is_In (Left_HT, R_Node) then
declare
E : Element_Type renames R_Node.Element.all;
-- Per AI05-0022, the container implementation is required
-- to detect element tampering by a generic actual
-- subprogram, hence the use of Checked_Index instead of a
-- simple invocation of generic formal Hash.
J : constant Hash_Type :=
HT_Ops.Checked_Index (Right_HT, Buckets.all, R_Node);
begin
declare
X : Element_Access := new Element_Type'(E);
begin
Buckets (J) := new Node_Type'(X, Buckets (J));
exception
when others =>
Free_Element (X);
raise;
end;
Length := Length + 1;
end;
end if;
end Process;
-- Start of processing for Iterate_Right
begin
Iterate (Right_HT);
exception
when others =>
HT_Ops.Free_Hash_Table (Buckets);
raise;
end Iterate_Right;
return (Controlled with HT => (Buckets, Length, (Busy => 0, Lock => 0)));
end Symmetric_Difference;
------------
-- To_Set --
------------
function To_Set (New_Item : Element_Type) return Set is
HT : Hash_Table_Type;
Node : Node_Access;
Inserted : Boolean;
pragma Unreferenced (Node, Inserted);
begin
Insert (HT, New_Item, Node, Inserted);
return Set'(Controlled with HT);
end To_Set;
-----------
-- Union --
-----------
procedure Union
(Target : in out Set;
Source : Set)
is
procedure Process (Src_Node : Node_Access);
procedure Iterate is
new HT_Ops.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (Src_Node : Node_Access) is
Src : Element_Type renames Src_Node.Element.all;
function New_Node (Next : Node_Access) return Node_Access;
pragma Inline (New_Node);
procedure Insert is
new Element_Keys.Generic_Conditional_Insert (New_Node);
--------------
-- New_Node --
--------------
function New_Node (Next : Node_Access) return Node_Access is
Tgt : Element_Access := new Element_Type'(Src);
begin
return new Node_Type'(Tgt, Next);
exception
when others =>
Free_Element (Tgt);
raise;
end New_Node;
Tgt_Node : Node_Access;
Success : Boolean;
pragma Unreferenced (Tgt_Node, Success);
-- Start of processing for Process
begin
Insert (Target.HT, Src, Tgt_Node, Success);
end Process;
-- Start of processing for Union
begin
if Target'Address = Source'Address then
return;
end if;
TC_Check (Target.HT.TC);
declare
N : constant Count_Type := Target.Length + Source.Length;
begin
if N > HT_Ops.Capacity (Target.HT) then
HT_Ops.Reserve_Capacity (Target.HT, N);
end if;
end;
Iterate (Source.HT);
end Union;
function Union (Left, Right : Set) return Set is
Left_HT : Hash_Table_Type renames Left.HT'Unrestricted_Access.all;
Right_HT : Hash_Table_Type renames Right.HT'Unrestricted_Access.all;
Buckets : HT_Types.Buckets_Access;
Length : Count_Type;
begin
if Left'Address = Right'Address then
return Left;
end if;
if Right.Length = 0 then
return Left;
end if;
if Left.Length = 0 then
return Right;
end if;
declare
Size : constant Hash_Type :=
Prime_Numbers.To_Prime (Left.Length + Right.Length);
begin
Buckets := HT_Ops.New_Buckets (Length => Size);
end;
Iterate_Left : declare
procedure Process (L_Node : Node_Access);
procedure Iterate is
new HT_Ops.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (L_Node : Node_Access) is
Src : Element_Type renames L_Node.Element.all;
J : constant Hash_Type := Hash (Src) mod Buckets'Length;
Bucket : Node_Access renames Buckets (J);
Tgt : Element_Access := new Element_Type'(Src);
begin
Bucket := new Node_Type'(Tgt, Bucket);
exception
when others =>
Free_Element (Tgt);
raise;
end Process;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram, hence the use of
-- Checked_Index instead of a simple invocation of generic formal
-- Hash.
Lock_Left : With_Lock (Left_HT.TC'Unrestricted_Access);
-- Start of processing for Iterate_Left
begin
Iterate (Left_HT);
exception
when others =>
HT_Ops.Free_Hash_Table (Buckets);
raise;
end Iterate_Left;
Length := Left.Length;
Iterate_Right : declare
procedure Process (Src_Node : Node_Access);
procedure Iterate is
new HT_Ops.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (Src_Node : Node_Access) is
Src : Element_Type renames Src_Node.Element.all;
Idx : constant Hash_Type := Hash (Src) mod Buckets'Length;
Tgt_Node : Node_Access := Buckets (Idx);
begin
while Tgt_Node /= null loop
if Equivalent_Elements (Src, Tgt_Node.Element.all) then
return;
end if;
Tgt_Node := Next (Tgt_Node);
end loop;
declare
Tgt : Element_Access := new Element_Type'(Src);
begin
Buckets (Idx) := new Node_Type'(Tgt, Buckets (Idx));
exception
when others =>
Free_Element (Tgt);
raise;
end;
Length := Length + 1;
end Process;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram, hence the use of
-- Checked_Index instead of a simple invocation of generic formal
-- Hash.
Lock_Left : With_Lock (Left_HT.TC'Unrestricted_Access);
Lock_Right : With_Lock (Right_HT.TC'Unrestricted_Access);
-- Start of processing for Iterate_Right
begin
Iterate (Right.HT);
exception
when others =>
HT_Ops.Free_Hash_Table (Buckets);
raise;
end Iterate_Right;
return (Controlled with HT => (Buckets, Length, (Busy => 0, Lock => 0)));
end Union;
---------
-- Vet --
---------
function Vet (Position : Cursor) return Boolean is
begin
if Position.Node = null then
return Position.Container = null;
end if;
if Position.Container = null then
return False;
end if;
if Position.Node.Next = Position.Node then
return False;
end if;
if Position.Node.Element = null then
return False;
end if;
declare
HT : Hash_Table_Type renames Position.Container.HT;
X : Node_Access;
begin
if HT.Length = 0 then
return False;
end if;
if HT.Buckets = null
or else HT.Buckets'Length = 0
then
return False;
end if;
X := HT.Buckets (Element_Keys.Checked_Index
(HT,
Position.Node.Element.all));
for J in 1 .. HT.Length loop
if X = Position.Node then
return True;
end if;
if X = null then
return False;
end if;
if X = X.Next then -- to prevent unnecessary looping
return False;
end if;
X := X.Next;
end loop;
return False;
end;
end Vet;
-----------
-- Write --
-----------
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Set)
is
begin
Write_Nodes (Stream, Container.HT);
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Cursor)
is
begin
raise Program_Error with "attempt to stream set cursor";
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
----------------
-- Write_Node --
----------------
procedure Write_Node
(Stream : not null access Root_Stream_Type'Class;
Node : Node_Access)
is
begin
Element_Type'Output (Stream, Node.Element.all);
end Write_Node;
package body Generic_Keys is
-----------------------
-- Local Subprograms --
-----------------------
function Equivalent_Key_Node
(Key : Key_Type;
Node : Node_Access) return Boolean;
pragma Inline (Equivalent_Key_Node);
--------------------------
-- Local Instantiations --
--------------------------
package Key_Keys is
new Hash_Tables.Generic_Keys
(HT_Types => HT_Types,
Next => Next,
Set_Next => Set_Next,
Key_Type => Key_Type,
Hash => Hash,
Equivalent_Keys => Equivalent_Key_Node);
------------------------
-- Constant_Reference --
------------------------
function Constant_Reference
(Container : aliased Set;
Key : Key_Type) return Constant_Reference_Type
is
HT : Hash_Table_Type renames Container'Unrestricted_Access.HT;
Node : constant Node_Access := Key_Keys.Find (HT, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with "Key not in set";
end if;
if Checks and then Node.Element = null then
raise Program_Error with "Node has no element";
end if;
declare
TC : constant Tamper_Counts_Access :=
HT.TC'Unrestricted_Access;
begin
return R : constant Constant_Reference_Type :=
(Element => Node.Element.all'Access,
Control => (Controlled with TC))
do
Busy (TC.all);
end return;
end;
end Constant_Reference;
--------------
-- Contains --
--------------
function Contains
(Container : Set;
Key : Key_Type) return Boolean
is
begin
return Find (Container, Key) /= No_Element;
end Contains;
------------
-- Delete --
------------
procedure Delete
(Container : in out Set;
Key : Key_Type)
is
X : Node_Access;
begin
Key_Keys.Delete_Key_Sans_Free (Container.HT, Key, X);
if Checks and then X = null then
raise Constraint_Error with "key not in set";
end if;
Free (X);
end Delete;
-------------
-- Element --
-------------
function Element
(Container : Set;
Key : Key_Type) return Element_Type
is
HT : Hash_Table_Type renames Container'Unrestricted_Access.HT;
Node : constant Node_Access := Key_Keys.Find (HT, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with "key not in set";
end if;
return Node.Element.all;
end Element;
-------------------------
-- Equivalent_Key_Node --
-------------------------
function Equivalent_Key_Node
(Key : Key_Type;
Node : Node_Access) return Boolean is
begin
return Equivalent_Keys (Key, Generic_Keys.Key (Node.Element.all));
end Equivalent_Key_Node;
-------------
-- Exclude --
-------------
procedure Exclude
(Container : in out Set;
Key : Key_Type)
is
X : Node_Access;
begin
Key_Keys.Delete_Key_Sans_Free (Container.HT, Key, X);
Free (X);
end Exclude;
--------------
-- Finalize --
--------------
procedure Finalize (Control : in out Reference_Control_Type) is
begin
if Control.Container /= null then
Impl.Reference_Control_Type (Control).Finalize;
if Checks and then Hash (Key (Control.Old_Pos)) /= Control.Old_Hash
then
HT_Ops.Delete_Node_At_Index
(Control.Container.HT, Control.Index, Control.Old_Pos.Node);
raise Program_Error;
end if;
Control.Container := null;
end if;
end Finalize;
----------
-- Find --
----------
function Find
(Container : Set;
Key : Key_Type) return Cursor
is
HT : Hash_Table_Type renames Container'Unrestricted_Access.HT;
Node : constant Node_Access := Key_Keys.Find (HT, Key);
begin
return (if Node = null then No_Element
else Cursor'(Container'Unrestricted_Access, Node));
end Find;
---------
-- Key --
---------
function Key (Position : Cursor) return Key_Type is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor equals No_Element";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with "Position cursor is bad";
end if;
pragma Assert (Vet (Position), "bad cursor in function Key");
return Key (Position.Node.Element.all);
end Key;
----------
-- Read --
----------
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
------------------------------
-- Reference_Preserving_Key --
------------------------------
function Reference_Preserving_Key
(Container : aliased in out Set;
Position : Cursor) return Reference_Type
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong container";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with "Node has no element";
end if;
pragma Assert
(Vet (Position),
"bad cursor in function Reference_Preserving_Key");
declare
HT : Hash_Table_Type renames Container.HT;
begin
return R : constant Reference_Type :=
(Element => Position.Node.Element.all'Access,
Control =>
(Controlled with
HT.TC'Unrestricted_Access,
Container => Container'Unchecked_Access,
Index => HT_Ops.Index (HT, Position.Node),
Old_Pos => Position,
Old_Hash => Hash (Key (Position))))
do
Busy (HT.TC);
end return;
end;
end Reference_Preserving_Key;
function Reference_Preserving_Key
(Container : aliased in out Set;
Key : Key_Type) return Reference_Type
is
Node : constant Node_Access := Key_Keys.Find (Container.HT, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with "Key not in set";
end if;
if Checks and then Node.Element = null then
raise Program_Error with "Node has no element";
end if;
declare
HT : Hash_Table_Type renames Container.HT;
P : constant Cursor := Find (Container, Key);
begin
return R : constant Reference_Type :=
(Element => Node.Element.all'Access,
Control =>
(Controlled with
HT.TC'Unrestricted_Access,
Container => Container'Unchecked_Access,
Index => HT_Ops.Index (HT, P.Node),
Old_Pos => P,
Old_Hash => Hash (Key)))
do
Busy (HT.TC);
end return;
end;
end Reference_Preserving_Key;
-------------
-- Replace --
-------------
procedure Replace
(Container : in out Set;
Key : Key_Type;
New_Item : Element_Type)
is
Node : constant Node_Access := Key_Keys.Find (Container.HT, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with
"attempt to replace key not in set";
end if;
Replace_Element (Container.HT, Node, New_Item);
end Replace;
-----------------------------------
-- Update_Element_Preserving_Key --
-----------------------------------
procedure Update_Element_Preserving_Key
(Container : in out Set;
Position : Cursor;
Process : not null access
procedure (Element : in out Element_Type))
is
HT : Hash_Table_Type renames Container.HT;
Indx : Hash_Type;
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor equals No_Element";
end if;
if Checks and then
(Position.Node.Element = null
or else Position.Node.Next = Position.Node)
then
raise Program_Error with "Position cursor is bad";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong set";
end if;
if Checks and then
(HT.Buckets = null
or else HT.Buckets'Length = 0
or else HT.Length = 0)
then
raise Program_Error with "Position cursor is bad (set is empty)";
end if;
pragma Assert
(Vet (Position),
"bad cursor in Update_Element_Preserving_Key");
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
E : Element_Type renames Position.Node.Element.all;
K : constant Key_Type := Key (E);
Lock : With_Lock (HT.TC'Unrestricted_Access);
begin
Indx := HT_Ops.Index (HT, Position.Node);
Process (E);
if Equivalent_Keys (K, Key (E)) then
return;
end if;
end;
if HT.Buckets (Indx) = Position.Node then
HT.Buckets (Indx) := Position.Node.Next;
else
declare
Prev : Node_Access := HT.Buckets (Indx);
begin
while Prev.Next /= Position.Node loop
Prev := Prev.Next;
if Checks and then Prev = null then
raise Program_Error with
"Position cursor is bad (node not found)";
end if;
end loop;
Prev.Next := Position.Node.Next;
end;
end if;
HT.Length := HT.Length - 1;
declare
X : Node_Access := Position.Node;
begin
Free (X);
end;
raise Program_Error with "key was modified";
end Update_Element_Preserving_Key;
-----------
-- Write --
-----------
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
end Generic_Keys;
end Ada.Containers.Indefinite_Hashed_Sets;
|
-- This spec has been automatically generated from STM32WL5x_CM4.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.USART is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR1_enabled_DEDT_Field is HAL.UInt5;
subtype CR1_enabled_DEAT_Field is HAL.UInt5;
-- Control register 1
type CR1_enabled_Register is record
-- USART enable
UE : Boolean := False;
-- USART enable in Stop mode
UESM : Boolean := False;
-- Receiver enable
RE : Boolean := False;
-- Transmitter enable
TE : Boolean := False;
-- IDLE interrupt enable
IDLEIE : Boolean := False;
-- RXNE interrupt enable
RXNEIE : Boolean := False;
-- Transmission complete interrupt enable
TCIE : Boolean := False;
-- interrupt enable
TXFNFIE : Boolean := False;
-- PE interrupt enable
PEIE : Boolean := False;
-- Parity selection
PS : Boolean := False;
-- Parity control enable
PCE : Boolean := False;
-- Receiver wakeup method
WAKE : Boolean := False;
-- Word length
M0 : Boolean := False;
-- Mute mode enable
MME : Boolean := False;
-- Character match interrupt enable
CMIE : Boolean := False;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- DEDT
DEDT : CR1_enabled_DEDT_Field := 16#0#;
-- DEAT
DEAT : CR1_enabled_DEAT_Field := 16#0#;
-- unspecified
Reserved_26_27 : HAL.UInt2 := 16#0#;
-- Word length
M1 : Boolean := False;
-- FIFO mode enable
FIFOEN : Boolean := False;
-- TXFIFO empty interrupt enable
TXFEIE : Boolean := False;
-- RXFIFO Full interrupt enable
RXFFIE : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_enabled_Register use record
UE at 0 range 0 .. 0;
UESM at 0 range 1 .. 1;
RE at 0 range 2 .. 2;
TE at 0 range 3 .. 3;
IDLEIE at 0 range 4 .. 4;
RXNEIE at 0 range 5 .. 5;
TCIE at 0 range 6 .. 6;
TXFNFIE at 0 range 7 .. 7;
PEIE at 0 range 8 .. 8;
PS at 0 range 9 .. 9;
PCE at 0 range 10 .. 10;
WAKE at 0 range 11 .. 11;
M0 at 0 range 12 .. 12;
MME at 0 range 13 .. 13;
CMIE at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
DEDT at 0 range 16 .. 20;
DEAT at 0 range 21 .. 25;
Reserved_26_27 at 0 range 26 .. 27;
M1 at 0 range 28 .. 28;
FIFOEN at 0 range 29 .. 29;
TXFEIE at 0 range 30 .. 30;
RXFFIE at 0 range 31 .. 31;
end record;
subtype CR1_disabled_DEDT_Field is HAL.UInt5;
subtype CR1_disabled_DEAT_Field is HAL.UInt5;
-- Control register 1
type CR1_disabled_Register is record
-- USART enable
UE : Boolean := False;
-- USART enable in Stop mode
UESM : Boolean := False;
-- Receiver enable
RE : Boolean := False;
-- Transmitter enable
TE : Boolean := False;
-- IDLE interrupt enable
IDLEIE : Boolean := False;
-- RXFIFO not empty interrupt enable
RXFNEIE : Boolean := False;
-- Transmission complete interrupt enable
TCIE : Boolean := False;
-- Transmit data register empty
TXEIE : Boolean := False;
-- PE interrupt enable
PEIE : Boolean := False;
-- Parity selection
PS : Boolean := False;
-- Parity control enable
PCE : Boolean := False;
-- Receiver wakeup method
WAKE : Boolean := False;
-- Word length
M0 : Boolean := False;
-- Mute mode enable
MME : Boolean := False;
-- Character match interrupt enable
CMIE : Boolean := False;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- DEDT
DEDT : CR1_disabled_DEDT_Field := 16#0#;
-- DEAT
DEAT : CR1_disabled_DEAT_Field := 16#0#;
-- unspecified
Reserved_26_27 : HAL.UInt2 := 16#0#;
-- Word length
M1 : Boolean := False;
-- FIFOEN
FIFOEN : Boolean := False;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_disabled_Register use record
UE at 0 range 0 .. 0;
UESM at 0 range 1 .. 1;
RE at 0 range 2 .. 2;
TE at 0 range 3 .. 3;
IDLEIE at 0 range 4 .. 4;
RXFNEIE at 0 range 5 .. 5;
TCIE at 0 range 6 .. 6;
TXEIE at 0 range 7 .. 7;
PEIE at 0 range 8 .. 8;
PS at 0 range 9 .. 9;
PCE at 0 range 10 .. 10;
WAKE at 0 range 11 .. 11;
M0 at 0 range 12 .. 12;
MME at 0 range 13 .. 13;
CMIE at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
DEDT at 0 range 16 .. 20;
DEAT at 0 range 21 .. 25;
Reserved_26_27 at 0 range 26 .. 27;
M1 at 0 range 28 .. 28;
FIFOEN at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
subtype CR2_STOP_Field is HAL.UInt2;
subtype CR2_ADD_Field is HAL.UInt8;
-- Control register 2
type CR2_Register is record
-- unspecified
Reserved_0_3 : HAL.UInt4 := 16#0#;
-- 7-bit Address Detection/4-bit Address Detection
ADDM7 : Boolean := False;
-- unspecified
Reserved_5_11 : HAL.UInt7 := 16#0#;
-- STOP bits
STOP : CR2_STOP_Field := 16#0#;
-- unspecified
Reserved_14_14 : HAL.Bit := 16#0#;
-- Swap TX/RX pins
SWAP : Boolean := False;
-- RX pin active level inversion
RXINV : Boolean := False;
-- TX pin active level inversion
TXINV : Boolean := False;
-- Binary data inversion
DATAINV : Boolean := False;
-- Most significant bit first
MSBFIRST : Boolean := False;
-- unspecified
Reserved_20_23 : HAL.UInt4 := 16#0#;
-- Address of the LPUART node
ADD : CR2_ADD_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register use record
Reserved_0_3 at 0 range 0 .. 3;
ADDM7 at 0 range 4 .. 4;
Reserved_5_11 at 0 range 5 .. 11;
STOP at 0 range 12 .. 13;
Reserved_14_14 at 0 range 14 .. 14;
SWAP at 0 range 15 .. 15;
RXINV at 0 range 16 .. 16;
TXINV at 0 range 17 .. 17;
DATAINV at 0 range 18 .. 18;
MSBFIRST at 0 range 19 .. 19;
Reserved_20_23 at 0 range 20 .. 23;
ADD at 0 range 24 .. 31;
end record;
subtype CR3_WUS_Field is HAL.UInt2;
subtype CR3_RXFTCFG_Field is HAL.UInt3;
subtype CR3_TXFTCFG_Field is HAL.UInt3;
-- Control register 3
type CR3_Register is record
-- Error interrupt enable
EIE : Boolean := False;
-- unspecified
Reserved_1_2 : HAL.UInt2 := 16#0#;
-- Half-duplex selection
HDSEL : Boolean := False;
-- unspecified
Reserved_4_5 : HAL.UInt2 := 16#0#;
-- DMA enable receiver
DMAR : Boolean := False;
-- DMA enable transmitter
DMAT : Boolean := False;
-- RTS enable
RTSE : Boolean := False;
-- CTS enable
CTSE : Boolean := False;
-- CTS interrupt enable
CTSIE : Boolean := False;
-- unspecified
Reserved_11_11 : HAL.Bit := 16#0#;
-- Overrun Disable
OVRDIS : Boolean := False;
-- DMA Disable on Reception Error
DDRE : Boolean := False;
-- Driver enable mode
DEM : Boolean := False;
-- Driver enable polarity selection
DEP : Boolean := False;
-- unspecified
Reserved_16_19 : HAL.UInt4 := 16#0#;
-- Wakeup from Stop mode interrupt flag selection
WUS : CR3_WUS_Field := 16#0#;
-- Wakeup from Stop mode interrupt enable
WUFIE : Boolean := False;
-- threshold interrupt enable
TXFTIE : Boolean := False;
-- unspecified
Reserved_24_24 : HAL.Bit := 16#0#;
-- Receive FIFO threshold configuration
RXFTCFG : CR3_RXFTCFG_Field := 16#0#;
-- RXFIFO threshold interrupt enable
RXFTIE : Boolean := False;
-- TXFIFO threshold configuration
TXFTCFG : CR3_TXFTCFG_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR3_Register use record
EIE at 0 range 0 .. 0;
Reserved_1_2 at 0 range 1 .. 2;
HDSEL at 0 range 3 .. 3;
Reserved_4_5 at 0 range 4 .. 5;
DMAR at 0 range 6 .. 6;
DMAT at 0 range 7 .. 7;
RTSE at 0 range 8 .. 8;
CTSE at 0 range 9 .. 9;
CTSIE at 0 range 10 .. 10;
Reserved_11_11 at 0 range 11 .. 11;
OVRDIS at 0 range 12 .. 12;
DDRE at 0 range 13 .. 13;
DEM at 0 range 14 .. 14;
DEP at 0 range 15 .. 15;
Reserved_16_19 at 0 range 16 .. 19;
WUS at 0 range 20 .. 21;
WUFIE at 0 range 22 .. 22;
TXFTIE at 0 range 23 .. 23;
Reserved_24_24 at 0 range 24 .. 24;
RXFTCFG at 0 range 25 .. 27;
RXFTIE at 0 range 28 .. 28;
TXFTCFG at 0 range 29 .. 31;
end record;
subtype BRR_BRR_Field is HAL.UInt20;
-- Baud rate register
type BRR_Register is record
-- BRR
BRR : BRR_BRR_Field := 16#0#;
-- unspecified
Reserved_20_31 : HAL.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BRR_Register use record
BRR at 0 range 0 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
-- Request register
type RQR_Register is record
-- unspecified
Reserved_0_0 : HAL.Bit := 16#0#;
-- Write-only. Send break request
SBKRQ : Boolean := False;
-- Write-only. Mute mode request
MMRQ : Boolean := False;
-- Write-only. Receive data flush request
RXFRQ : Boolean := False;
-- Write-only. Transmit data flush request
TXFRQ : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for RQR_Register use record
Reserved_0_0 at 0 range 0 .. 0;
SBKRQ at 0 range 1 .. 1;
MMRQ at 0 range 2 .. 2;
RXFRQ at 0 range 3 .. 3;
TXFRQ at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
-- Interrupt and status register
type ISR_enabled_Register is record
-- Read-only. PE
PE : Boolean;
-- Read-only. FE
FE : Boolean;
-- Read-only. NE
NE : Boolean;
-- Read-only. ORE
ORE : Boolean;
-- Read-only. IDLE
IDLE : Boolean;
-- Read-only. RXFNE
RXFNE : Boolean;
-- Read-only. TC
TC : Boolean;
-- Read-only. TXFNF
TXFNF : Boolean;
-- unspecified
Reserved_8_8 : HAL.Bit;
-- Read-only. CTSIF
CTSIF : Boolean;
-- Read-only. CTS
CTS : Boolean;
-- unspecified
Reserved_11_15 : HAL.UInt5;
-- Read-only. BUSY
BUSY : Boolean;
-- Read-only. CMF
CMF : Boolean;
-- Read-only. SBKF
SBKF : Boolean;
-- Read-only. RWU
RWU : Boolean;
-- Read-only. WUF
WUF : Boolean;
-- Read-only. TEACK
TEACK : Boolean;
-- Read-only. REACK
REACK : Boolean;
-- Read-only. TXFIFO Empty
TXFE : Boolean;
-- Read-only. RXFIFO Full
RXFF : Boolean;
-- unspecified
Reserved_25_25 : HAL.Bit;
-- Read-only. RXFIFO threshold flag
RXFT : Boolean;
-- Read-only. TXFIFO threshold flag
TXFT : Boolean;
-- unspecified
Reserved_28_31 : HAL.UInt4;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_enabled_Register use record
PE at 0 range 0 .. 0;
FE at 0 range 1 .. 1;
NE at 0 range 2 .. 2;
ORE at 0 range 3 .. 3;
IDLE at 0 range 4 .. 4;
RXFNE at 0 range 5 .. 5;
TC at 0 range 6 .. 6;
TXFNF at 0 range 7 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
CTSIF at 0 range 9 .. 9;
CTS at 0 range 10 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
BUSY at 0 range 16 .. 16;
CMF at 0 range 17 .. 17;
SBKF at 0 range 18 .. 18;
RWU at 0 range 19 .. 19;
WUF at 0 range 20 .. 20;
TEACK at 0 range 21 .. 21;
REACK at 0 range 22 .. 22;
TXFE at 0 range 23 .. 23;
RXFF at 0 range 24 .. 24;
Reserved_25_25 at 0 range 25 .. 25;
RXFT at 0 range 26 .. 26;
TXFT at 0 range 27 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
-- Interrupt and status register
type ISR_disabled_Register is record
-- Read-only. PE
PE : Boolean;
-- Read-only. FE
FE : Boolean;
-- Read-only. NE
NE : Boolean;
-- Read-only. ORE
ORE : Boolean;
-- Read-only. IDLE
IDLE : Boolean;
-- Read-only. RXFNE
RXFNE : Boolean;
-- Read-only. TC
TC : Boolean;
-- Read-only. TXE
TXE : Boolean;
-- unspecified
Reserved_8_8 : HAL.Bit;
-- Read-only. CTSIF
CTSIF : Boolean;
-- Read-only. CTS
CTS : Boolean;
-- unspecified
Reserved_11_15 : HAL.UInt5;
-- Read-only. BUSY
BUSY : Boolean;
-- Read-only. CMF
CMF : Boolean;
-- Read-only. SBKF
SBKF : Boolean;
-- Read-only. RWU
RWU : Boolean;
-- Read-only. WUF
WUF : Boolean;
-- Read-only. TEACK
TEACK : Boolean;
-- Read-only. REACK
REACK : Boolean;
-- unspecified
Reserved_23_31 : HAL.UInt9;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_disabled_Register use record
PE at 0 range 0 .. 0;
FE at 0 range 1 .. 1;
NE at 0 range 2 .. 2;
ORE at 0 range 3 .. 3;
IDLE at 0 range 4 .. 4;
RXFNE at 0 range 5 .. 5;
TC at 0 range 6 .. 6;
TXE at 0 range 7 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
CTSIF at 0 range 9 .. 9;
CTS at 0 range 10 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
BUSY at 0 range 16 .. 16;
CMF at 0 range 17 .. 17;
SBKF at 0 range 18 .. 18;
RWU at 0 range 19 .. 19;
WUF at 0 range 20 .. 20;
TEACK at 0 range 21 .. 21;
REACK at 0 range 22 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- Interrupt flag clear register
type ICR_Register is record
-- Write-only. Parity error clear flag
PECF : Boolean := False;
-- Write-only. Framing error clear flag
FECF : Boolean := False;
-- Write-only. Noise detected clear flag
NECF : Boolean := False;
-- Write-only. Overrun error clear flag
ORECF : Boolean := False;
-- Write-only. Idle line detected clear flag
IDLECF : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Write-only. Transmission complete clear flag
TCCF : Boolean := False;
-- unspecified
Reserved_7_8 : HAL.UInt2 := 16#0#;
-- Write-only. CTS clear flag
CTSCF : Boolean := False;
-- unspecified
Reserved_10_16 : HAL.UInt7 := 16#0#;
-- Write-only. Character match clear flag
CMCF : Boolean := False;
-- unspecified
Reserved_18_19 : HAL.UInt2 := 16#0#;
-- Write-only. Wakeup from Stop mode clear flag
WUCF : Boolean := False;
-- unspecified
Reserved_21_31 : HAL.UInt11 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ICR_Register use record
PECF at 0 range 0 .. 0;
FECF at 0 range 1 .. 1;
NECF at 0 range 2 .. 2;
ORECF at 0 range 3 .. 3;
IDLECF at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TCCF at 0 range 6 .. 6;
Reserved_7_8 at 0 range 7 .. 8;
CTSCF at 0 range 9 .. 9;
Reserved_10_16 at 0 range 10 .. 16;
CMCF at 0 range 17 .. 17;
Reserved_18_19 at 0 range 18 .. 19;
WUCF at 0 range 20 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
subtype RDR_RDR_Field is HAL.UInt9;
-- Receive data register
type RDR_Register is record
-- Read-only. Receive data value
RDR : RDR_RDR_Field;
-- unspecified
Reserved_9_31 : HAL.UInt23;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for RDR_Register use record
RDR at 0 range 0 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
subtype TDR_TDR_Field is HAL.UInt9;
-- Transmit data register
type TDR_Register is record
-- Transmit data value
TDR : TDR_TDR_Field := 16#0#;
-- unspecified
Reserved_9_31 : HAL.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TDR_Register use record
TDR at 0 range 0 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
subtype PRESC_PRESCALER_Field is HAL.UInt4;
-- Prescaler register
type PRESC_Register is record
-- Clock prescaler
PRESCALER : PRESC_PRESCALER_Field := 16#0#;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for PRESC_Register use record
PRESCALER at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- CR1_DEDT array
type CR1_DEDT_Field_Array is array (0 .. 4) of Boolean
with Component_Size => 1, Size => 5;
-- Type definition for CR1_DEDT
type CR1_DEDT_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- DEDT as a value
Val : HAL.UInt5;
when True =>
-- DEDT as an array
Arr : CR1_DEDT_Field_Array;
end case;
end record
with Unchecked_Union, Size => 5;
for CR1_DEDT_Field use record
Val at 0 range 0 .. 4;
Arr at 0 range 0 .. 4;
end record;
-- CR1_DEAT array
type CR1_DEAT_Field_Array is array (0 .. 4) of Boolean
with Component_Size => 1, Size => 5;
-- Type definition for CR1_DEAT
type CR1_DEAT_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- DEAT as a value
Val : HAL.UInt5;
when True =>
-- DEAT as an array
Arr : CR1_DEAT_Field_Array;
end case;
end record
with Unchecked_Union, Size => 5;
for CR1_DEAT_Field use record
Val at 0 range 0 .. 4;
Arr at 0 range 0 .. 4;
end record;
-- control register 1
type CR1_Register is record
-- USART enable
UE : Boolean := False;
-- USART enable in low-power mode
UESM : Boolean := False;
-- Receiver enable
RE : Boolean := False;
-- Transmitter enable
TE : Boolean := False;
-- IDLE interrupt enable
IDLEIE : Boolean := False;
-- Receive data register not empty/RXFIFO not empty interrupt enable
RXNEIE : Boolean := False;
-- Transmission complete interrupt enable
TCIE : Boolean := False;
-- Transmit data register empty/TXFIFO not full interrupt enable
TXEIE : Boolean := False;
-- PE interrupt enable
PEIE : Boolean := False;
-- Parity selection
PS : Boolean := False;
-- Parity control enable
PCE : Boolean := False;
-- Receiver wakeup method
WAKE : Boolean := False;
-- Word length
M : Boolean := False;
-- Mute mode enable
MME : Boolean := False;
-- Character match interrupt enable
CMIE : Boolean := False;
-- Oversampling mode
OVER8 : Boolean := False;
-- DEDT0
DEDT : CR1_DEDT_Field := (As_Array => False, Val => 16#0#);
-- DEAT0
DEAT : CR1_DEAT_Field := (As_Array => False, Val => 16#0#);
-- Receiver timeout interrupt enable
RTOIE : Boolean := False;
-- End of Block interrupt enable
EOBIE : Boolean := False;
-- Word length
M1 : Boolean := False;
-- FIFO mode enable
FIFOEN : Boolean := False;
-- TXFIFO empty interrupt enable
TXFEIE : Boolean := False;
-- RXFIFO Full interrupt enable
RXFFIE : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register use record
UE at 0 range 0 .. 0;
UESM at 0 range 1 .. 1;
RE at 0 range 2 .. 2;
TE at 0 range 3 .. 3;
IDLEIE at 0 range 4 .. 4;
RXNEIE at 0 range 5 .. 5;
TCIE at 0 range 6 .. 6;
TXEIE at 0 range 7 .. 7;
PEIE at 0 range 8 .. 8;
PS at 0 range 9 .. 9;
PCE at 0 range 10 .. 10;
WAKE at 0 range 11 .. 11;
M at 0 range 12 .. 12;
MME at 0 range 13 .. 13;
CMIE at 0 range 14 .. 14;
OVER8 at 0 range 15 .. 15;
DEDT at 0 range 16 .. 20;
DEAT at 0 range 21 .. 25;
RTOIE at 0 range 26 .. 26;
EOBIE at 0 range 27 .. 27;
M1 at 0 range 28 .. 28;
FIFOEN at 0 range 29 .. 29;
TXFEIE at 0 range 30 .. 30;
RXFFIE at 0 range 31 .. 31;
end record;
-- CR2_ABRMOD array
type CR2_ABRMOD_Field_Array is array (0 .. 1) of Boolean
with Component_Size => 1, Size => 2;
-- Type definition for CR2_ABRMOD
type CR2_ABRMOD_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- ABRMOD as a value
Val : HAL.UInt2;
when True =>
-- ABRMOD as an array
Arr : CR2_ABRMOD_Field_Array;
end case;
end record
with Unchecked_Union, Size => 2;
for CR2_ABRMOD_Field use record
Val at 0 range 0 .. 1;
Arr at 0 range 0 .. 1;
end record;
subtype CR2_ADD3_0_Field is HAL.UInt4;
subtype CR2_ADD7_4_Field is HAL.UInt4;
-- control register 2
type CR2_Register_1 is record
-- Synchronous Slave mode enable
SLVEN : Boolean := False;
-- unspecified
Reserved_1_2 : HAL.UInt2 := 16#0#;
-- DIS_NSS
DIS_NSS : Boolean := False;
-- 7-bit Address Detection/4-bit Address Detection
ADDM7 : Boolean := False;
-- LIN break detection length
LBDL : Boolean := False;
-- LIN break detection interrupt enable
LBDIE : Boolean := False;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#0#;
-- Last bit clock pulse
LBCL : Boolean := False;
-- Clock phase
CPHA : Boolean := False;
-- Clock polarity
CPOL : Boolean := False;
-- Clock enable
CLKEN : Boolean := False;
-- stop bits
STOP : CR2_STOP_Field := 16#0#;
-- LIN mode enable
LINEN : Boolean := False;
-- Swap TX/RX pins
SWAP : Boolean := False;
-- RX pin active level inversion
RXINV : Boolean := False;
-- TX pin active level inversion
TXINV : Boolean := False;
-- Binary data inversion
DATAINV : Boolean := False;
-- Most significant bit first
MSBFIRST : Boolean := False;
-- Auto baud rate enable
ABREN : Boolean := False;
-- ABRMOD0
ABRMOD : CR2_ABRMOD_Field := (As_Array => False, Val => 16#0#);
-- Receiver timeout enable
RTOEN : Boolean := False;
-- Address of the USART node
ADD3_0 : CR2_ADD3_0_Field := 16#0#;
-- Address of the USART node
ADD7_4 : CR2_ADD7_4_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register_1 use record
SLVEN at 0 range 0 .. 0;
Reserved_1_2 at 0 range 1 .. 2;
DIS_NSS at 0 range 3 .. 3;
ADDM7 at 0 range 4 .. 4;
LBDL at 0 range 5 .. 5;
LBDIE at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
LBCL at 0 range 8 .. 8;
CPHA at 0 range 9 .. 9;
CPOL at 0 range 10 .. 10;
CLKEN at 0 range 11 .. 11;
STOP at 0 range 12 .. 13;
LINEN at 0 range 14 .. 14;
SWAP at 0 range 15 .. 15;
RXINV at 0 range 16 .. 16;
TXINV at 0 range 17 .. 17;
DATAINV at 0 range 18 .. 18;
MSBFIRST at 0 range 19 .. 19;
ABREN at 0 range 20 .. 20;
ABRMOD at 0 range 21 .. 22;
RTOEN at 0 range 23 .. 23;
ADD3_0 at 0 range 24 .. 27;
ADD7_4 at 0 range 28 .. 31;
end record;
subtype CR3_SCARCNT2_0_Field is HAL.UInt3;
-- control register 3
type CR3_Register_1 is record
-- Error interrupt enable
EIE : Boolean := False;
-- IrDA mode enable
IREN : Boolean := False;
-- IrDA low-power
IRLP : Boolean := False;
-- Half-duplex selection
HDSEL : Boolean := False;
-- Smartcard NACK enable
NACK : Boolean := False;
-- Smartcard mode enable
SCEN : Boolean := False;
-- DMA enable receiver
DMAR : Boolean := False;
-- DMA enable transmitter
DMAT : Boolean := False;
-- RTS enable
RTSE : Boolean := False;
-- CTS enable
CTSE : Boolean := False;
-- CTS interrupt enable
CTSIE : Boolean := False;
-- One sample bit method enable
ONEBIT : Boolean := False;
-- OVRDIS: Overrun Disable
OVRDIS : Boolean := False;
-- DMA Disable on Reception Error
DDRE : Boolean := False;
-- Driver enable mode
DEM : Boolean := False;
-- Driver enable polarity selection
DEP : Boolean := False;
-- unspecified
Reserved_16_16 : HAL.Bit := 16#0#;
-- Smartcard auto-retry count
SCARCNT2_0 : CR3_SCARCNT2_0_Field := 16#0#;
-- Wakeup from low-power mode interrupt flag selection
WUS : CR3_WUS_Field := 16#0#;
-- Wakeup from low-power mode interrupt enable
WUFIE : Boolean := False;
-- TXFIFO threshold interrupt enable
TXFTIE : Boolean := False;
-- Transmission Complete before guard time, interrupt enable
TCBGTIE : Boolean := False;
-- Receive FIFO threshold configuration
RXFTCFG : CR3_RXFTCFG_Field := 16#0#;
-- RXFIFO threshold interrupt enable
RXFTIE : Boolean := False;
-- TXFIFO threshold configuration
TXFTCFG : CR3_TXFTCFG_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR3_Register_1 use record
EIE at 0 range 0 .. 0;
IREN at 0 range 1 .. 1;
IRLP at 0 range 2 .. 2;
HDSEL at 0 range 3 .. 3;
NACK at 0 range 4 .. 4;
SCEN at 0 range 5 .. 5;
DMAR at 0 range 6 .. 6;
DMAT at 0 range 7 .. 7;
RTSE at 0 range 8 .. 8;
CTSE at 0 range 9 .. 9;
CTSIE at 0 range 10 .. 10;
ONEBIT at 0 range 11 .. 11;
OVRDIS at 0 range 12 .. 12;
DDRE at 0 range 13 .. 13;
DEM at 0 range 14 .. 14;
DEP at 0 range 15 .. 15;
Reserved_16_16 at 0 range 16 .. 16;
SCARCNT2_0 at 0 range 17 .. 19;
WUS at 0 range 20 .. 21;
WUFIE at 0 range 22 .. 22;
TXFTIE at 0 range 23 .. 23;
TCBGTIE at 0 range 24 .. 24;
RXFTCFG at 0 range 25 .. 27;
RXFTIE at 0 range 28 .. 28;
TXFTCFG at 0 range 29 .. 31;
end record;
subtype BRR_BRR_Field_1 is HAL.UInt16;
-- baud rate register
type BRR_Register_1 is record
-- BRR
BRR : BRR_BRR_Field_1 := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BRR_Register_1 use record
BRR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype GTPR_PSC_Field is HAL.UInt8;
subtype GTPR_GT_Field is HAL.UInt8;
-- guard time and prescaler register
type GTPR_Register is record
-- Prescaler value
PSC : GTPR_PSC_Field := 16#0#;
-- Guard time value
GT : GTPR_GT_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for GTPR_Register use record
PSC at 0 range 0 .. 7;
GT at 0 range 8 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype RTOR_RTO_Field is HAL.UInt24;
subtype RTOR_BLEN_Field is HAL.UInt8;
-- receiver timeout register
type RTOR_Register is record
-- Receiver timeout value
RTO : RTOR_RTO_Field := 16#0#;
-- Block Length
BLEN : RTOR_BLEN_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for RTOR_Register use record
RTO at 0 range 0 .. 23;
BLEN at 0 range 24 .. 31;
end record;
-- request register
type RQR_Register_1 is record
-- Auto baud rate request
ABRRQ : Boolean := False;
-- Send break request
SBKRQ : Boolean := False;
-- Mute mode request
MMRQ : Boolean := False;
-- Receive data flush request
RXFRQ : Boolean := False;
-- Transmit data flush request
TXFRQ : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for RQR_Register_1 use record
ABRRQ at 0 range 0 .. 0;
SBKRQ at 0 range 1 .. 1;
MMRQ at 0 range 2 .. 2;
RXFRQ at 0 range 3 .. 3;
TXFRQ at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
-- interrupt and status register
type ISR_Register is record
-- Read-only. PE
PE : Boolean;
-- Read-only. FE
FE : Boolean;
-- Read-only. NE
NE : Boolean;
-- Read-only. ORE
ORE : Boolean;
-- Read-only. IDLE
IDLE : Boolean;
-- Read-only. RXNE
RXNE : Boolean;
-- Read-only. TC
TC : Boolean;
-- Read-only. TXE
TXE : Boolean;
-- Read-only. LBDF
LBDF : Boolean;
-- Read-only. CTSIF
CTSIF : Boolean;
-- Read-only. CTS
CTS : Boolean;
-- Read-only. RTOF
RTOF : Boolean;
-- Read-only. EOBF
EOBF : Boolean;
-- Read-only. UDR
UDR : Boolean;
-- Read-only. ABRE
ABRE : Boolean;
-- Read-only. ABRF
ABRF : Boolean;
-- Read-only. BUSY
BUSY : Boolean;
-- Read-only. CMF
CMF : Boolean;
-- Read-only. SBKF
SBKF : Boolean;
-- Read-only. RWU
RWU : Boolean;
-- Read-only. WUF
WUF : Boolean;
-- Read-only. TEACK
TEACK : Boolean;
-- Read-only. REACK
REACK : Boolean;
-- Read-only. TXFE
TXFE : Boolean;
-- Read-only. RXFF
RXFF : Boolean;
-- Read-only. TCBGT
TCBGT : Boolean;
-- Read-only. RXFT
RXFT : Boolean;
-- Read-only. TXFT
TXFT : Boolean;
-- unspecified
Reserved_28_31 : HAL.UInt4;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
PE at 0 range 0 .. 0;
FE at 0 range 1 .. 1;
NE at 0 range 2 .. 2;
ORE at 0 range 3 .. 3;
IDLE at 0 range 4 .. 4;
RXNE at 0 range 5 .. 5;
TC at 0 range 6 .. 6;
TXE at 0 range 7 .. 7;
LBDF at 0 range 8 .. 8;
CTSIF at 0 range 9 .. 9;
CTS at 0 range 10 .. 10;
RTOF at 0 range 11 .. 11;
EOBF at 0 range 12 .. 12;
UDR at 0 range 13 .. 13;
ABRE at 0 range 14 .. 14;
ABRF at 0 range 15 .. 15;
BUSY at 0 range 16 .. 16;
CMF at 0 range 17 .. 17;
SBKF at 0 range 18 .. 18;
RWU at 0 range 19 .. 19;
WUF at 0 range 20 .. 20;
TEACK at 0 range 21 .. 21;
REACK at 0 range 22 .. 22;
TXFE at 0 range 23 .. 23;
RXFF at 0 range 24 .. 24;
TCBGT at 0 range 25 .. 25;
RXFT at 0 range 26 .. 26;
TXFT at 0 range 27 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
-- interrupt flag clear register
type ICR_Register_1 is record
-- Write-only. Parity error clear flag
PECF : Boolean := False;
-- Write-only. Framing error clear flag
FECF : Boolean := False;
-- Write-only. Noise detected clear flag
NECF : Boolean := False;
-- Write-only. Overrun error clear flag
ORECF : Boolean := False;
-- Write-only. Idle line detected clear flag
IDLECF : Boolean := False;
-- Write-only. TXFIFO empty clear flag
TXFECF : Boolean := False;
-- Write-only. Transmission complete clear flag
TCCF : Boolean := False;
-- Write-only. Transmission complete before Guard time clear flag
TCBGTCF : Boolean := False;
-- Write-only. LIN break detection clear flag
LBDCF : Boolean := False;
-- Write-only. CTS clear flag
CTSCF : Boolean := False;
-- unspecified
Reserved_10_10 : HAL.Bit := 16#0#;
-- Write-only. Receiver timeout clear flag
RTOCF : Boolean := False;
-- Write-only. End of block clear flag
EOBCF : Boolean := False;
-- Write-only. SPI slave underrun clear flag
UDRCF : Boolean := False;
-- unspecified
Reserved_14_16 : HAL.UInt3 := 16#0#;
-- Write-only. Character match clear flag
CMCF : Boolean := False;
-- unspecified
Reserved_18_19 : HAL.UInt2 := 16#0#;
-- Write-only. Wakeup from low-power mode clear flag
WUCF : Boolean := False;
-- unspecified
Reserved_21_31 : HAL.UInt11 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ICR_Register_1 use record
PECF at 0 range 0 .. 0;
FECF at 0 range 1 .. 1;
NECF at 0 range 2 .. 2;
ORECF at 0 range 3 .. 3;
IDLECF at 0 range 4 .. 4;
TXFECF at 0 range 5 .. 5;
TCCF at 0 range 6 .. 6;
TCBGTCF at 0 range 7 .. 7;
LBDCF at 0 range 8 .. 8;
CTSCF at 0 range 9 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
RTOCF at 0 range 11 .. 11;
EOBCF at 0 range 12 .. 12;
UDRCF at 0 range 13 .. 13;
Reserved_14_16 at 0 range 14 .. 16;
CMCF at 0 range 17 .. 17;
Reserved_18_19 at 0 range 18 .. 19;
WUCF at 0 range 20 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
type LPUART_Disc is
(ENABLED,
DISABLED);
-- Universal synchronous asynchronous receiver transmitter
type LPUART_Peripheral
(Discriminent : LPUART_Disc := ENABLED)
is record
-- Control register 2
CR2 : aliased CR2_Register;
-- Control register 3
CR3 : aliased CR3_Register;
-- Baud rate register
BRR : aliased BRR_Register;
-- Request register
RQR : aliased RQR_Register;
-- Interrupt flag clear register
ICR : aliased ICR_Register;
-- Receive data register
RDR : aliased RDR_Register;
-- Transmit data register
TDR : aliased TDR_Register;
-- Prescaler register
PRESC : aliased PRESC_Register;
case Discriminent is
when ENABLED =>
-- Control register 1
CR1_enabled : aliased CR1_enabled_Register;
-- Interrupt and status register
ISR_enabled : aliased ISR_enabled_Register;
when DISABLED =>
-- Control register 1
CR1_disabled : aliased CR1_disabled_Register;
-- Interrupt and status register
ISR_disabled : aliased ISR_disabled_Register;
end case;
end record
with Unchecked_Union, Volatile;
for LPUART_Peripheral use record
CR2 at 16#4# range 0 .. 31;
CR3 at 16#8# range 0 .. 31;
BRR at 16#C# range 0 .. 31;
RQR at 16#18# range 0 .. 31;
ICR at 16#20# range 0 .. 31;
RDR at 16#24# range 0 .. 31;
TDR at 16#28# range 0 .. 31;
PRESC at 16#2C# range 0 .. 31;
CR1_enabled at 16#0# range 0 .. 31;
ISR_enabled at 16#1C# range 0 .. 31;
CR1_disabled at 16#0# range 0 .. 31;
ISR_disabled at 16#1C# range 0 .. 31;
end record;
-- Universal synchronous asynchronous receiver transmitter
LPUART_Periph : aliased LPUART_Peripheral
with Import, Address => LPUART_Base;
-- Universal synchronous asynchronous receiver transmitter
type USART_Peripheral is record
-- control register 1
CR1 : aliased CR1_Register;
-- control register 2
CR2 : aliased CR2_Register_1;
-- control register 3
CR3 : aliased CR3_Register_1;
-- baud rate register
BRR : aliased BRR_Register_1;
-- guard time and prescaler register
GTPR : aliased GTPR_Register;
-- receiver timeout register
RTOR : aliased RTOR_Register;
-- request register
RQR : aliased RQR_Register_1;
-- interrupt and status register
ISR : aliased ISR_Register;
-- interrupt flag clear register
ICR : aliased ICR_Register_1;
-- receive data register
RDR : aliased RDR_Register;
-- transmit data register
TDR : aliased TDR_Register;
-- prescaler register
PRESC : aliased PRESC_Register;
end record
with Volatile;
for USART_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
CR3 at 16#8# range 0 .. 31;
BRR at 16#C# range 0 .. 31;
GTPR at 16#10# range 0 .. 31;
RTOR at 16#14# range 0 .. 31;
RQR at 16#18# range 0 .. 31;
ISR at 16#1C# range 0 .. 31;
ICR at 16#20# range 0 .. 31;
RDR at 16#24# range 0 .. 31;
TDR at 16#28# range 0 .. 31;
PRESC at 16#2C# range 0 .. 31;
end record;
-- Universal synchronous asynchronous receiver transmitter
USART1_Periph : aliased USART_Peripheral
with Import, Address => USART1_Base;
-- Universal synchronous asynchronous receiver transmitter
USART2_Periph : aliased USART_Peripheral
with Import, Address => USART2_Base;
end STM32_SVD.USART;
|
with Ada.Strings.Equal_Case_Insensitive;
with Ada.Text_IO; use Ada.Text_IO;
with GNAT.Source_Info; use GNAT.Source_Info;
with Langkit_Support.Text; use Langkit_Support.Text;
with Libadalang.Analysis; use Libadalang.Analysis;
with Libadalang.Common; use Libadalang.Common;
with Rejuvenation.Simple_Factory; use Rejuvenation.Simple_Factory;
package body Test_Exercises_Intro is
procedure Test_LibAdaLang_AST (T : in out Test_Case'Class);
procedure Test_LibAdaLang_AST (T : in out Test_Case'Class) is
pragma Unreferenced (T);
Unit : constant Analysis_Unit := Analyze_File ("src/mismatch.ads");
begin
Put_Line ("Begin - " & Enclosing_Entity);
Unit.Print;
Put_Line ("Done - " & Enclosing_Entity);
end Test_LibAdaLang_AST;
procedure Test_LibAdaLang_Subprograms (T : in out Test_Case'Class);
procedure Test_LibAdaLang_Subprograms (T : in out Test_Case'Class) is
pragma Unreferenced (T);
function Process_Node (Node : Ada_Node'Class) return Visit_Status;
function Process_Node (Node : Ada_Node'Class) return Visit_Status is
begin
if Node.Kind = Ada_Subp_Body then
declare
SB : constant Subp_Body := Node.As_Subp_Body;
begin
Put_Line ("Found " & Image (SB.F_Subp_Spec.F_Subp_Name.Text));
end;
end if;
return Into;
end Process_Node;
Unit : constant Analysis_Unit :=
Analyze_File ("tests/" & GNAT.Source_Info.File);
begin
Put_Line ("Begin - " & Enclosing_Entity);
Unit.Root.Traverse (Process_Node'Access);
Put_Line ("Done - " & Enclosing_Entity);
end Test_LibAdaLang_Subprograms;
procedure Test_LibAdaLang_CallFunction (T : in out Test_Case'Class);
procedure Test_LibAdaLang_CallFunction (T : in out Test_Case'Class) is
pragma Unreferenced (T);
Function_Name : constant String := "Analyze_File";
function Process_Node (Node : Ada_Node'Class) return Visit_Status;
function Process_Node (Node : Ada_Node'Class) return Visit_Status is
begin
if Node.Kind = Ada_Call_Expr then
declare
CE : constant Call_Expr := Node.As_Call_Expr;
begin
if Ada.Strings.Equal_Case_Insensitive
(Image (CE.F_Name.Text), Function_Name)
then
Put_Line
(Image (CE.Full_Sloc_Image) & "Call to '" & Function_Name &
"'");
end if;
end;
end if;
return Into;
end Process_Node;
Project_Filename : constant String := "test_driver.gpr";
Units : constant Analysis_Units.Vector :=
Analyze_Project (Project_Filename);
begin
Put_Line ("Begin - " & Enclosing_Entity);
for Unit of Units loop
Unit.Root.Traverse (Process_Node'Access);
end loop;
Put_Line ("Done - " & Enclosing_Entity);
end Test_LibAdaLang_CallFunction;
-- Test plumbing
overriding function Name
(T : Exercise_Intro_Test_Case) return AUnit.Message_String
is
pragma Unreferenced (T);
begin
return AUnit.Format ("Exercises Introduction");
end Name;
overriding procedure Register_Tests (T : in out Exercise_Intro_Test_Case) is
begin
Registration.Register_Routine
(T, Test_LibAdaLang_AST'Access, "Use LibAdaLang to print AST of file");
Registration.Register_Routine
(T, Test_LibAdaLang_Subprograms'Access,
"Use LibAdaLang to print subprograms in file");
Registration.Register_Routine
(T, Test_LibAdaLang_CallFunction'Access,
"Use LibAdaLang to find all calls " &
"to a particular function in project");
end Register_Tests;
end Test_Exercises_Intro;
|
package body problem_20 is
function Solution_1 return Integer is
Num : array( Natural range 0 .. 50 ) of Natural := (
0 => 1, others => 0);
Sum : Integer := 0;
Carry : Integer := 1;
Temp : Integer;
begin
for I in 2 .. 100 loop
Carry := 0;
for J in Num'Range loop
Temp := (Num(J) * I) + Carry;
Num(J) := Temp mod 10_000_000;
Carry := Temp / 10_000_000;
end loop;
end loop;
for I in Num'Range loop
While Num(I) > 0 loop
Sum := Sum + (Num(I) mod 10);
Num(I) := Num(I) / 10;
end loop;
end loop;
return Sum;
end Solution_1;
procedure Test_Solution_1 is
Solution : constant Integer := 648;
begin
Assert( Solution = Solution_1 );
end Test_Solution_1;
function Get_Solutions return Solution_Case is
Ret : Solution_Case;
begin
Set_Name( Ret, "problem 20" );
Add_Test( Ret, Test_Solution_1'Access );
return Ret;
end Get_Solutions;
end problem_20;
|
<?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>Stream2Mem_64u_8u_s</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>4</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_V_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.V.V</originalName>
<rtlName></rtlName>
<coreName>FSL</coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>out_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>1</direction>
<if_type>4</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_V3</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>61</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="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>tmp_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<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>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>tmp_3_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>24</item>
<item>25</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>out_V3_read</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>61</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>27</item>
<item>28</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>tmp_3_cast_cast</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>62</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>out_V3_cast</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>62</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>sum</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>62</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>31</item>
<item>32</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>sum_cast</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>out_V_addr</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>34</item>
<item>35</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>tmp_V</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName>
<fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory>
<lineNumber>155</lineNumber>
<contextFuncName>Stream2Mem&lt;64, 8&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first>
<second>Stream2Mem&lt;64, 8&gt;</second>
</first>
<second>155</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>38</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>out_V_addr_req</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName>
<fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory>
<lineNumber>156</lineNumber>
<contextFuncName>Stream2Mem&lt;64, 8&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first>
<second>Stream2Mem&lt;64, 8&gt;</second>
</first>
<second>156</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>40</item>
<item>41</item>
<item>43</item>
</oprand_edges>
<opcode>writereq</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name></name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName>
<fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory>
<lineNumber>156</lineNumber>
<contextFuncName>Stream2Mem&lt;64, 8&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first>
<second>Stream2Mem&lt;64, 8&gt;</second>
</first>
<second>156</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>45</item>
<item>46</item>
<item>47</item>
<item>49</item>
<item>114</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>out_V_addr_resp</name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName>
<fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory>
<lineNumber>156</lineNumber>
<contextFuncName>Stream2Mem&lt;64, 8&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first>
<second>Stream2Mem&lt;64, 8&gt;</second>
</first>
<second>156</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>51</item>
<item>52</item>
<item>113</item>
</oprand_edges>
<opcode>writeresp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name></name>
<fileName>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</fileName>
<fileDirectory>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>Stream2Mem&lt;64, 8&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/jf2715/BNN-PYNQ/bnn/src/network/output/hls-syn</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/jf2715/BNN-PYNQ/bnn/src//library/finn-hlslib/dma.h</first>
<second>Stream2Mem&lt;64, 8&gt;</second>
</first>
<second>158</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>2</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_17">
<Value>
<Obj>
<type>2</type>
<id>42</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_18">
<Value>
<Obj>
<type>2</type>
<id>48</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>255</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="_19">
<Obj>
<type>3</type>
<id>22</id>
<name>Stream2Mem<64u, 8u></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<item>5</item>
<item>6</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>21</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>18</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_20">
<id>25</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_21">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_22">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_23">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_24">
<id>31</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_25">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_26">
<id>33</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_27">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_28">
<id>35</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_29">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_30">
<id>41</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_31">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_32">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_33">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_34">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_35">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_36">
<id>113</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_37">
<id>114</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</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="_38">
<mId>1</mId>
<mTag>Stream2Mem<64u, 8u></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>22</item>
</basic_blocks>
<mII>1</mII>
<mDepth>8</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>7</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_39">
<states class_id="25" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_40">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_41">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_42">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_43">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_44">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_45">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_46">
<id>2</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_47">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_48">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_49">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_50">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_51">
<id>3</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_52">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_53">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_54">
<id>19</id>
<stage>5</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_55">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_56">
<id>19</id>
<stage>4</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_57">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_58">
<id>19</id>
<stage>3</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_59">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_60">
<id>19</id>
<stage>2</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_61">
<id>8</id>
<operations>
<count>7</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_62">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_63">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_64">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_65">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_66">
<id>19</id>
<stage>1</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_67">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_68">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_69">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>7</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_70">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>8</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_71">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>9</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_72">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>10</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_73">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>11</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_74">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>12</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_75">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>13</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="35" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>5</first>
<second class_id="37" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="38" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>22</first>
<second class_id="40" tracking_level="0" version="0">
<first>0</first>
<second>7</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="41" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="1" version="0" object_id="_76">
<region_name>Stream2Mem<64u, 8u></region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>22</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>8</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="43" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>54</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>60</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>66</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>72</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>17</item>
<item>18</item>
<item>19</item>
<item>19</item>
<item>19</item>
<item>19</item>
<item>19</item>
</second>
</item>
<item>
<first>83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>87</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="46" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>out_V3_cast_fu_87</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>out_V_addr_fu_100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>sum_cast_fu_97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>sum_fu_91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>tmp_3_cast_cast_fu_83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>4</count>
<item_version>0</item_version>
<item>
<first>grp_writeresp_fu_72</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>17</item>
<item>18</item>
<item>19</item>
<item>19</item>
<item>19</item>
<item>19</item>
<item>19</item>
</second>
</item>
<item>
<first>out_V3_read_read_fu_60</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>tmp_3_read_read_fu_54</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>tmp_V_read_fu_66</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="48" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>3</count>
<item_version>0</item_version>
<item>
<first>107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>117</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>3</count>
<item_version>0</item_version>
<item>
<first>out_V_addr_reg_112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>sum_reg_107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>tmp_V_reg_117</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</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="49" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="0" version="0">
<first>in_V_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</second>
</item>
<item>
<first>out_V</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>out_V3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
</second>
</item>
<item>
<first>tmp_3</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="51" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>1</first>
<second>FSL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
-- Copyright 2014-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Increment (I : in out Integer) is
begin
I := I + 1;
end Increment;
end Pck;
|
-- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with GL.Enums.Textures;
with GL.Helpers;
with GL.API;
package body GL.Fixed.Textures is
procedure Set_Tex_Function (Func : Texture_Function) is
begin
API.Tex_Env_Tex_Func (Enums.Textures.Texture_Env, Enums.Textures.Env_Mode,
Func);
Raise_Exception_On_OpenGL_Error;
end Set_Tex_Function;
function Tex_Function return Texture_Function is
Ret : Texture_Function := Texture_Function'Val (0);
begin
API.Get_Tex_Env_Tex_Func (Enums.Textures.Texture_Env, Enums.Textures.Env_Mode,
Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Tex_Function;
procedure Set_RGB_Combine (Func : Combine_Function) is
begin
API.Tex_Env_Combine_Func (Enums.Textures.Texture_Env, Enums.Textures.Combine_RGB,
Func);
Raise_Exception_On_OpenGL_Error;
end Set_RGB_Combine;
function RGB_Combine return Combine_Function is
Ret : Combine_Function := Combine_Function'Val (0);
begin
API.Get_Tex_Env_Combine_Func (Enums.Textures.Texture_Env,
Enums.Textures.Combine_RGB, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end RGB_Combine;
procedure Set_Alpha_Combine (Func : Alpha_Combine_Function) is
begin
API.Tex_Env_Combine_Func (Enums.Textures.Texture_Env,
Enums.Textures.Combine_Alpha, Func);
Raise_Exception_On_OpenGL_Error;
end Set_Alpha_Combine;
function Alpha_Combine return Alpha_Combine_Function is
Ret : Combine_Function := Combine_Function'Val (0);
begin
API.Get_Tex_Env_Combine_Func (Enums.Textures.Texture_Env,
Enums.Textures.Combine_Alpha, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Alpha_Combine;
procedure Set_RGB_Source (Source : Source_Kind; Index : Source_Index) is
Param : Enums.Textures.Env_Parameter;
begin
case Index is
when 0 => Param := Enums.Textures.Src0_RGB;
when 1 => Param := Enums.Textures.Src1_RGB;
when 2 => Param := Enums.Textures.Src2_RGB;
end case;
API.Tex_Env_Source (Enums.Textures.Texture_Env, Param, Source);
Raise_Exception_On_OpenGL_Error;
end Set_RGB_Source;
function RGB_Source (Index : Source_Index) return Source_Kind is
Param : Enums.Textures.Env_Parameter;
Ret : Source_Kind := Source_Kind'Val (0);
begin
case Index is
when 0 => Param := Enums.Textures.Src0_RGB;
when 1 => Param := Enums.Textures.Src1_RGB;
when 2 => Param := Enums.Textures.Src2_RGB;
end case;
API.Get_Tex_Env_Source (Enums.Textures.Texture_Env, Param, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end RGB_Source;
procedure Set_Alpha_Source (Source : Source_Kind; Index : Source_Index) is
Param : Enums.Textures.Env_Parameter;
begin
case Index is
when 0 => Param := Enums.Textures.Src0_Alpha;
when 1 => Param := Enums.Textures.Src1_Alpha;
when 2 => Param := Enums.Textures.Src2_Alpha;
end case;
API.Tex_Env_Source (Enums.Textures.Texture_Env, Param, Source);
Raise_Exception_On_OpenGL_Error;
end Set_Alpha_Source;
function Alpha_Source (Index : Source_Index) return Source_Kind is
Param : Enums.Textures.Env_Parameter;
Ret : Source_Kind := Source_Kind'Val (0);
begin
case Index is
when 0 => Param := Enums.Textures.Src0_Alpha;
when 1 => Param := Enums.Textures.Src1_Alpha;
when 2 => Param := Enums.Textures.Src2_Alpha;
end case;
API.Get_Tex_Env_Source (Enums.Textures.Texture_Env, Param, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Alpha_Source;
procedure Set_RGB_Scale (Value : Scaling_Factor) is
begin
API.Tex_Env_Float (Enums.Textures.Texture_Env,
Enums.Textures.RGB_Scale, Single (Value));
Raise_Exception_On_OpenGL_Error;
end Set_RGB_Scale;
function RGB_Scale return Scaling_Factor is
Ret : Single := 0.0;
begin
API.Get_Tex_Env_Float (Enums.Textures.Texture_Env,
Enums.Textures.RGB_Scale, Ret);
Raise_Exception_On_OpenGL_Error;
return Double (Ret);
end RGB_Scale;
procedure Set_Alpha_Scale (Value : Scaling_Factor) is
begin
API.Tex_Env_Float (Enums.Textures.Texture_Env,
Enums.Textures.Alpha_Scale, Single (Value));
Raise_Exception_On_OpenGL_Error;
end Set_Alpha_Scale;
function Alpha_Scale return Scaling_Factor is
Ret : Single := 0.0;
begin
API.Get_Tex_Env_Float (Enums.Textures.Texture_Env,
Enums.Textures.Alpha_Scale, Ret);
Raise_Exception_On_OpenGL_Error;
return Double (Ret);
end Alpha_Scale;
procedure Set_LoD_Bias (Value : Double) is
begin
API.Tex_Env_Float (Enums.Textures.Filter_Control,
Enums.Textures.LoD_Bias, Single (Value));
Raise_Exception_On_OpenGL_Error;
end Set_LoD_Bias;
function LoD_Bias return Double is
Ret : Single := 0.0;
begin
API.Get_Tex_Env_Float (Enums.Textures.Filter_Control,
Enums.Textures.LoD_Bias, Ret);
Raise_Exception_On_OpenGL_Error;
return Double (Ret);
end LoD_Bias;
procedure Set_Env_Color (Value : Colors.Color) is
Float_Colors : constant Single_Array
:= Helpers.Float_Array (Value);
begin
API.Tex_Env_Arr (Enums.Textures.Texture_Env,
Enums.Textures.Env_Color, Float_Colors);
Raise_Exception_On_OpenGL_Error;
end Set_Env_Color;
function Env_Color return Colors.Color is
Ret : Single_Array (1 .. 4);
begin
API.Get_Tex_Env_Arr (Enums.Textures.Texture_Env,
Enums.Textures.Env_Color, Ret);
Raise_Exception_On_OpenGL_Error;
return Helpers.Color (Ret);
end Env_Color;
procedure Toggle_Point_Sprite_Coord_Replace (Enabled : Boolean) is
begin
API.Tex_Env_Bool (Enums.Textures.Point_Sprite,
Enums.Textures.Coord_Replace, Low_Level.Bool (Enabled));
Raise_Exception_On_OpenGL_Error;
end Toggle_Point_Sprite_Coord_Replace;
function Point_Sprite_Coord_Replace return Boolean is
Ret : Low_Level.Bool := Low_Level.False;
begin
API.Get_Tex_Env_Bool (Enums.Textures.Point_Sprite,
Enums.Textures.Coord_Replace, Ret);
Raise_Exception_On_OpenGL_Error;
return Boolean (Ret);
end Point_Sprite_Coord_Replace;
end GL.Fixed.Textures;
|
-- Copyright (c) 2017 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with LSP.Types;
with LSP.Messages;
package LSP_Documents is
type Document is tagged private;
not overriding procedure Initalize
(Self : out Document;
Uri : LSP.Types.LSP_String;
Text : LSP.Types.LSP_String;
Version : LSP.Types.Version_Id);
not overriding function Get_Line
(Self : Document;
Line : LSP.Types.Line_Number) return LSP.Types.LSP_String;
not overriding function Version
(Self : Document) return LSP.Types.Version_Id;
type Lookup_Result_Kinds is
(None,
Attribute_Designator,
Pragma_Name,
Identifier);
type Lookup_Result (Kind : Lookup_Result_Kinds := None) is record
case Kind is
when Attribute_Designator | Identifier =>
Value : LSP.Types.LSP_String;
when Pragma_Name =>
Name : LSP.Types.LSP_String;
Parameter : Natural := 0; -- Active parameter
when None =>
null;
end case;
end record;
not overriding function Lookup
(Self : Document;
Where : LSP.Messages.Position) return Lookup_Result;
not overriding function All_Symbols
(Self : Document;
Query : LSP.Types.LSP_String)
return LSP.Messages.SymbolInformation_Vector;
private
type Document is tagged record
Uri : LSP.Types.LSP_String;
Lines : LSP.Types.LSP_String_Vector;
Version : LSP.Types.Version_Id;
end record;
end LSP_Documents;
|
-- Copyright (C) 2015-2016 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Update_Signed_Small (S : in out Signed_Small) is
begin
null;
end Update_Signed_Small;
end Pck;
|
------------------------------------------------------------------------------
-- --
-- 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.Internals.Factories.OCL_Factories;
with AMF.Internals.Factories.OCL_Module_Factory;
with AMF.Internals.Tables.OCL_Element_Table;
with AMF.Internals.Tables.OCL_Metamodel.Links;
with AMF.Internals.Tables.OCL_Metamodel.Objects;
with AMF.Internals.Tables.OCL_Metamodel.Properties;
with AMF.Internals.Modules.UML_Module;
pragma Unreferenced (AMF.Internals.Modules.UML_Module);
pragma Elaborate_All (AMF.Internals.Modules.UML_Module);
-- UML nodule package and all its dependencies must be elaborated before
-- elaboration of this package.
package body AMF.Internals.Modules.OCL_Module is
-- Global object of factory for supported metamodel.
OCL_Module_Factory : aliased
AMF.Internals.Factories.OCL_Module_Factory.OCL_Module_Factory;
Module : AMF_Metamodel;
begin
-- Register module's factory.
AMF.Internals.Factories.Register (OCL_Module_Factory'Access, Module);
-- Initialize metamodels.
AMF.Internals.Tables.OCL_Metamodel.Objects.Initialize;
AMF.Internals.Tables.OCL_Metamodel.Properties.Initialize;
AMF.Internals.Tables.OCL_Metamodel.Links.Initialize;
-- Initialize element table of OCL metamodel.
AMF.Internals.Tables.OCL_Element_Table.Initialize (Module);
-- Register factories.
AMF.Internals.Factories.Register
(AMF.Internals.Factories.OCL_Factories.Get_Package,
AMF.Internals.Factories.OCL_Factories.Constructor'Access);
end AMF.Internals.Modules.OCL_Module;
|
-- C49020A.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 ENUMERATION LITERALS (INCLUDING CHARACTER LITERALS) CAN BE
-- USED IN STATIC EXPRESSIONS TOGETHER WITH RELATIONAL AND EQUALITY
-- OPERATORS.
-- L.BROWN 09/30/86
WITH REPORT; USE REPORT;
PROCEDURE C49020A IS
CAS_BOL : BOOLEAN := TRUE;
OBJ1 : INTEGER := 4;
TYPE ENUM IS (RED,GREEN,BLUE,OFF,ON,'A','B');
BEGIN
TEST("C49020A","ENUMERATION LITERALS (INCLUDING CHARACTER "&
"LITERALS) TOGETHER WITH RELATIONAL OPERATORS "&
"CAN BE USED IN STATIC EXPRESSION");
CASE CAS_BOL IS
WHEN (RED <= BLUE) =>
OBJ1 := 5;
WHEN (BLUE = GREEN) =>
FAILED("INCORRECT VALUE RETURNED BY ENUMERATION "&
"EXPRESSION 1");
END CASE;
CAS_BOL := TRUE;
CASE CAS_BOL IS
WHEN (GREEN >= ON) =>
FAILED("INCORRECT VALUE RETURNED BY ENUMERATION "&
"EXPRESSION 2");
WHEN (ENUM'('A') < ENUM'('B')) =>
OBJ1 := 6;
END CASE;
CAS_BOL := TRUE;
CASE CAS_BOL IS
WHEN (BLUE > 'B') =>
FAILED("INCORRECT VALUE RETURNED BY ENUMERATION "&
"EXPRESSION 3");
WHEN (OFF /= 'A') =>
OBJ1 := 7;
END CASE;
RESULT;
END C49020A;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2021 The progress_indicators authors
--
-- 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 ANSI;
with Ada.Strings.Fixed;
package body Progress_Indicators.Bars is
function Get_Bar (Value : Percentage; Width : Natural := 100) return String is
use Ada.Strings.Fixed;
use ANSI;
Used : constant Natural := Natural (Float (Width) / 100.0 * Float (Value));
Remaining : constant Natural := Width - Used;
Text : constant String := Tail (Value'Image & "%", 5);
begin
return
Foreground (Light_Green) & Used * "█" & Foreground (Default) & Remaining * "░" & Text &
ANSI.Back (Cells => Width + Text'Length);
end Get_Bar;
end Progress_Indicators.Bars;
|
------------------------------------------------------------------------------
-- --
-- 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.
------------------------------------------------------------------------------
-- A deployed artifact is an artifact or artifact instance that has been
-- deployed to a deployment target.
------------------------------------------------------------------------------
with AMF.UML.Named_Elements;
package AMF.UML.Deployed_Artifacts is
pragma Preelaborate;
type UML_Deployed_Artifact is limited interface
and AMF.UML.Named_Elements.UML_Named_Element;
type UML_Deployed_Artifact_Access is
access all UML_Deployed_Artifact'Class;
for UML_Deployed_Artifact_Access'Storage_Size use 0;
end AMF.UML.Deployed_Artifacts;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P A R . L O A D --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. 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. --
-- --
------------------------------------------------------------------------------
-- The Par.Load procedure loads all units that are definitely required before
-- it makes any sense at all to proceed with semantic analysis, including
-- with'ed units, corresponding specs for bodies, parents of child specs,
-- and parents of subunits. All these units are loaded and pointers installed
-- in the tree as described in the spec of package Lib.
with Fname.UF; use Fname.UF;
with Lib.Load; use Lib.Load;
with Namet.Sp; use Namet.Sp;
with Uname; use Uname;
with Osint; use Osint;
with Sinput.L; use Sinput.L;
with Stylesw; use Stylesw;
with Validsw; use Validsw;
with GNAT.Spelling_Checker; use GNAT.Spelling_Checker;
separate (Par)
procedure Load is
File_Name : File_Name_Type;
-- Name of file for current unit, derived from unit name
Cur_Unum : constant Unit_Number_Type := Current_Source_Unit;
-- Unit number of unit that we just finished parsing. Note that we need
-- to capture this, because Source_Unit will change as we parse new
-- source files in the multiple main source file case.
Curunit : constant Node_Id := Cunit (Cur_Unum);
-- Compilation unit node for current compilation unit
Loc : Source_Ptr := Sloc (Curunit);
-- Source location for compilation unit node
Save_Style_Check : Boolean;
Save_Style_Checks : Style_Check_Options;
-- Save style check so it can be restored later
Save_Validity_Check : Boolean;
Save_Validity_Checks : Validity_Check_Options;
-- Save validity check so it can be restored later
With_Cunit : Node_Id;
-- Compilation unit node for withed unit
Context_Node : Node_Id;
-- Next node in context items list
With_Node : Node_Id;
-- N_With_Clause node
Spec_Name : Unit_Name_Type;
-- Unit name of required spec
Body_Name : Unit_Name_Type;
-- Unit name of corresponding body
Unum : Unit_Number_Type;
-- Unit number of loaded unit
Limited_With_Found : Boolean := False;
-- We load the context items in two rounds: the first round handles normal
-- withed units and the second round handles Ada 2005 limited-withed units.
-- This is required to allow the low-level circuitry that detects circular
-- dependencies of units the correct notification of errors (see comment
-- bellow). This variable is used to indicate that the second round is
-- required.
function Same_File_Name_Except_For_Case
(Expected_File_Name : File_Name_Type;
Actual_File_Name : File_Name_Type) return Boolean;
-- Given an actual file name and an expected file name (the latter being
-- derived from the unit name), determine if they are the same except for
-- possibly different casing of letters.
------------------------------------
-- Same_File_Name_Except_For_Case --
------------------------------------
function Same_File_Name_Except_For_Case
(Expected_File_Name : File_Name_Type;
Actual_File_Name : File_Name_Type) return Boolean
is
begin
Get_Name_String (Actual_File_Name);
Canonical_Case_File_Name (Name_Buffer (1 .. Name_Len));
declare
Lower_Case_Actual_File_Name : String (1 .. Name_Len);
begin
Lower_Case_Actual_File_Name := Name_Buffer (1 .. Name_Len);
Get_Name_String (Expected_File_Name);
Canonical_Case_File_Name (Name_Buffer (1 .. Name_Len));
return Lower_Case_Actual_File_Name = Name_Buffer (1 .. Name_Len);
end;
end Same_File_Name_Except_For_Case;
-- Start of processing for Load
begin
-- Don't do any loads if we already had a fatal error
if Fatal_Error (Cur_Unum) = Error_Detected then
return;
end if;
Save_Style_Check_Options (Save_Style_Checks);
Save_Style_Check := Opt.Style_Check;
Save_Validity_Check_Options (Save_Validity_Checks);
Save_Validity_Check := Opt.Validity_Checks_On;
-- If main unit, set Main_Unit_Entity (this will get overwritten if
-- the main unit has a separate spec, that happens later on in Load)
if Cur_Unum = Main_Unit then
Main_Unit_Entity := Cunit_Entity (Main_Unit);
end if;
-- If we have no unit name, things are seriously messed up by previous
-- errors, and we should not try to continue compilation.
if Unit_Name (Cur_Unum) = No_Unit_Name then
raise Unrecoverable_Error;
end if;
-- Next step, make sure that the unit name matches the file name
-- and issue a warning message if not. We only output this for the
-- main unit, since for other units it is more serious and is
-- caught in a separate test below. We also inhibit the message in
-- multiple unit per file mode, because in this case the relation
-- between file name and unit name is broken.
File_Name :=
Get_File_Name
(Unit_Name (Cur_Unum),
Subunit => Nkind (Unit (Cunit (Cur_Unum))) = N_Subunit);
if Cur_Unum = Main_Unit
and then Multiple_Unit_Index = 0
and then File_Name /= Unit_File_Name (Cur_Unum)
and then (File_Names_Case_Sensitive
or not Same_File_Name_Except_For_Case
(File_Name, Unit_File_Name (Cur_Unum)))
then
Error_Msg_File_1 := File_Name;
Error_Msg
("??file name does not match unit name, should be{", Sloc (Curunit));
end if;
-- For units other than the main unit, the expected unit name is set and
-- must be the same as the actual unit name, or we are in big trouble, and
-- abandon the compilation since there are situations where this really
-- gets us into bad trouble (e.g. some subunit situations).
if Cur_Unum /= Main_Unit
and then Expected_Unit (Cur_Unum) /= Unit_Name (Cur_Unum)
then
Loc := Error_Location (Cur_Unum);
Error_Msg_File_1 := Unit_File_Name (Cur_Unum);
Get_Name_String (Error_Msg_File_1);
-- Check for predefined file case
if Name_Len > 1
and then Name_Buffer (2) = '-'
and then (Name_Buffer (1) = 'a'
or else
Name_Buffer (1) = 's'
or else
Name_Buffer (1) = 'i'
or else
Name_Buffer (1) = 'g')
then
declare
Expect_Name : constant Unit_Name_Type := Expected_Unit (Cur_Unum);
Actual_Name : constant Unit_Name_Type := Unit_Name (Cur_Unum);
begin
Error_Msg_Unit_1 := Expect_Name;
Error_Msg -- CODEFIX
("$$ is not a predefined library unit!", Loc);
-- In the predefined file case, we know the user did not
-- construct their own package, but we got the wrong one.
-- This means that the name supplied by the user crunched
-- to something we recognized, but then the file did not
-- contain the unit expected. Most likely this is due to
-- a misspelling, e.g.
-- with Ada.Calender;
-- This crunches to a-calend, which indeed contains the unit
-- Ada.Calendar, and we can diagnose the misspelling. This
-- is a simple heuristic, but it catches many common cases
-- of misspelling of predefined unit names without needing
-- a full list of them.
-- Before actually issuing the message, we will check that the
-- unit name is indeed a plausible misspelling of the one we got.
if Is_Bad_Spelling_Of
(Name_Id (Expect_Name), Name_Id (Actual_Name))
then
Error_Msg_Unit_1 := Actual_Name;
Error_Msg -- CODEFIX
("possible misspelling of $$!", Loc);
end if;
end;
-- Non-predefined file name case. In this case we generate a message
-- and then we quit, because we are in big trouble, and if we try
-- to continue compilation, we get into some nasty situations
-- (for example in some subunit cases).
else
Error_Msg ("file { does not contain expected unit!", Loc);
Error_Msg_Unit_1 := Expected_Unit (Cur_Unum);
Error_Msg ("\\expected unit $!", Loc);
Error_Msg_Unit_1 := Unit_Name (Cur_Unum);
Error_Msg ("\\found unit $!", Loc);
end if;
-- In both cases, remove the unit if it is the last unit (which it
-- normally (always?) will be) so that it is out of the way later.
Remove_Unit (Cur_Unum);
end if;
-- If current unit is a body, load its corresponding spec
if Nkind (Unit (Curunit)) = N_Package_Body
or else Nkind (Unit (Curunit)) = N_Subprogram_Body
then
Spec_Name := Get_Spec_Name (Unit_Name (Cur_Unum));
Unum :=
Load_Unit
(Load_Name => Spec_Name,
Required => False,
Subunit => False,
Error_Node => Curunit,
Corr_Body => Cur_Unum,
PMES => (Cur_Unum = Main_Unit));
-- If we successfully load the unit, then set the spec/body pointers.
-- Once again note that if the loaded unit has a fatal error, Load will
-- have set our Fatal_Error flag to propagate this condition.
if Unum /= No_Unit then
Set_Library_Unit (Curunit, Cunit (Unum));
Set_Library_Unit (Cunit (Unum), Curunit);
-- If this is a separate spec for the main unit, then we reset
-- Main_Unit_Entity to point to the entity for this separate spec
-- and this is also where we generate the SCO's for this spec.
if Cur_Unum = Main_Unit then
Main_Unit_Entity := Cunit_Entity (Unum);
if Generate_SCO then
SCO_Record_Raw (Unum);
end if;
end if;
-- If we don't find the spec, then if we have a subprogram body, we
-- are still OK, we just have a case of a body acting as its own spec
elsif Nkind (Unit (Curunit)) = N_Subprogram_Body then
Set_Acts_As_Spec (Curunit, True);
Set_Library_Unit (Curunit, Curunit);
-- Otherwise we do have an error, repeat the load request for the spec
-- with Required set True to generate an appropriate error message.
else
Unum :=
Load_Unit
(Load_Name => Spec_Name,
Required => True,
Subunit => False,
Error_Node => Curunit);
return;
end if;
-- If current unit is a child unit spec, load its parent. If the child unit
-- is loaded through a limited with, the parent must be as well.
elsif Nkind (Unit (Curunit)) = N_Package_Declaration
or else Nkind (Unit (Curunit)) = N_Subprogram_Declaration
or else Nkind (Unit (Curunit)) in N_Generic_Declaration
or else Nkind (Unit (Curunit)) in N_Generic_Instantiation
or else Nkind (Unit (Curunit)) in N_Renaming_Declaration
then
-- Turn style and validity checks off for parent unit
if not GNAT_Mode then
Reset_Style_Check_Options;
Reset_Validity_Check_Options;
end if;
Spec_Name := Get_Parent_Spec_Name (Unit_Name (Cur_Unum));
if Spec_Name /= No_Unit_Name then
Unum :=
Load_Unit
(Load_Name => Spec_Name,
Required => True,
Subunit => False,
Error_Node => Curunit);
if Unum /= No_Unit then
Set_Parent_Spec (Unit (Curunit), Cunit (Unum));
end if;
end if;
-- If current unit is a subunit, then load its parent body
elsif Nkind (Unit (Curunit)) = N_Subunit then
Body_Name := Get_Parent_Body_Name (Unit_Name (Cur_Unum));
Unum :=
Load_Unit
(Load_Name => Body_Name,
Required => True,
Subunit => False,
Error_Node => Name (Unit (Curunit)));
if Unum /= No_Unit then
Set_Library_Unit (Curunit, Cunit (Unum));
end if;
end if;
-- Now we load with'ed units, with style/validity checks turned off
if not GNAT_Mode then
Reset_Style_Check_Options;
Reset_Validity_Check_Options;
end if;
-- Load the context items in two rounds: the first round handles normal
-- withed units and the second round handles Ada 2005 limited-withed units.
-- This is required to allow the low-level circuitry that detects circular
-- dependencies of units the correct notification of the following error:
-- limited with D;
-- with D; with C;
-- package C is ... package D is ...
for Round in 1 .. 2 loop
Context_Node := First (Context_Items (Curunit));
while Present (Context_Node) loop
-- During the first round we check if there is some limited-with
-- context clause; otherwise the second round will be skipped
if Nkind (Context_Node) = N_With_Clause
and then Round = 1
and then Limited_Present (Context_Node)
then
Limited_With_Found := True;
end if;
if Nkind (Context_Node) = N_With_Clause
and then ((Round = 1 and then not Limited_Present (Context_Node))
or else
(Round = 2 and then Limited_Present (Context_Node)))
then
With_Node := Context_Node;
Spec_Name := Get_Unit_Name (With_Node);
Unum :=
Load_Unit
(Load_Name => Spec_Name,
Required => False,
Subunit => False,
Error_Node => With_Node,
Renamings => True,
With_Node => Context_Node);
-- If we find the unit, then set spec pointer in the N_With_Clause
-- to point to the compilation unit for the spec. Remember that
-- the Load routine itself sets our Fatal_Error flag if the loaded
-- unit gets a fatal error, so we don't need to worry about that.
if Unum /= No_Unit then
Set_Library_Unit (With_Node, Cunit (Unum));
-- If the spec isn't found, then try finding the corresponding
-- body, since it is possible that we have a subprogram body
-- that is acting as a spec (since no spec is present).
else
Body_Name := Get_Body_Name (Spec_Name);
Unum :=
Load_Unit
(Load_Name => Body_Name,
Required => False,
Subunit => False,
Error_Node => With_Node,
Renamings => True);
-- If we got a subprogram body, then mark that we are using
-- the body as a spec in the file table, and set the spec
-- pointer in the N_With_Clause to point to the body entity.
if Unum /= No_Unit
and then Nkind (Unit (Cunit (Unum))) = N_Subprogram_Body
then
With_Cunit := Cunit (Unum);
Set_Library_Unit (With_Node, With_Cunit);
Set_Acts_As_Spec (With_Cunit, True);
Set_Library_Unit (With_Cunit, With_Cunit);
-- If we couldn't find the body, or if it wasn't a body spec
-- then we are in trouble. We make one more call to Load to
-- require the spec. We know it will fail of course, the
-- purpose is to generate the required error message (we prefer
-- that this message refer to the missing spec, not the body)
else
Unum :=
Load_Unit
(Load_Name => Spec_Name,
Required => True,
Subunit => False,
Error_Node => With_Node,
Renamings => True);
-- Here we create a dummy package unit for the missing unit
Unum := Create_Dummy_Package_Unit (With_Node, Spec_Name);
Set_Library_Unit (With_Node, Cunit (Unum));
end if;
end if;
end if;
Next (Context_Node);
end loop;
exit when not Limited_With_Found;
end loop;
-- Restore style/validity check mode for main unit
Set_Style_Check_Options (Save_Style_Checks);
Opt.Style_Check := Save_Style_Check;
Set_Validity_Check_Options (Save_Validity_Checks);
Opt.Validity_Checks_On := Save_Validity_Check;
end Load;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2013, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.OCL.Primitive_Literal_Exps;
with League.Strings;
package AMF.OCL.String_Literal_Exps is
pragma Preelaborate;
type OCL_String_Literal_Exp is limited interface
and AMF.OCL.Primitive_Literal_Exps.OCL_Primitive_Literal_Exp;
type OCL_String_Literal_Exp_Access is
access all OCL_String_Literal_Exp'Class;
for OCL_String_Literal_Exp_Access'Storage_Size use 0;
not overriding function Get_String_Symbol
(Self : not null access constant OCL_String_Literal_Exp)
return League.Strings.Universal_String is abstract;
-- Getter of StringLiteralExp::stringSymbol.
--
not overriding procedure Set_String_Symbol
(Self : not null access OCL_String_Literal_Exp;
To : League.Strings.Universal_String) is abstract;
-- Setter of StringLiteralExp::stringSymbol.
--
end AMF.OCL.String_Literal_Exps;
|
-- CE3403F.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT SKIP_LINE RAISES END_ERROR IF AN ATTEMPT IS
-- MADE TO SKIP A FILE TERMINATOR.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH
-- SUPPORT TEXT FILES.
-- HISTORY:
-- ABW 08/26/82
-- SPS 11/11/82
-- SPS 12/14/82
-- TBN 11/04/86 REVISED TEST TO OUTPUT A NON_APPLICABLE
-- RESULT WHEN FILES ARE NOT SUPPORTED.
-- DWC 09/09/87 REVISED TEST TO USE A FILE NAME, REMOVED
-- DEPENDENCE ON RESET, AND ADDED ATTEMPT TO
-- DELETE THE FILE.
WITH REPORT;
USE REPORT;
WITH TEXT_IO;
USE TEXT_IO;
PROCEDURE CE3403F IS
INCOMPLETE : EXCEPTION;
FILE : FILE_TYPE;
CHAR : CHARACTER := ('C');
ONE : POSITIVE_COUNT := POSITIVE_COUNT(IDENT_INT (1));
TWO : POSITIVE_COUNT := POSITIVE_COUNT(IDENT_INT (2));
BEGIN
TEST ("CE3403F" , "CHECK THAT SKIP_LINE RAISES END_ERROR " &
"IF AN ATTEMPT IS MADE TO SKIP A FILE " &
"TERMINATOR");
BEGIN
CREATE (FILE, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED; TEXT CREATE " &
"WITH OUT_FILE MODE");
RAISE INCOMPLETE;
WHEN NAME_ERROR =>
NOT_APPLICABLE ("NAME_ERROR RAISED; TEXT CREATE " &
"WITH OUT_FILE MODE");
RAISE INCOMPLETE;
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED; TEXT CREATE");
RAISE INCOMPLETE;
END;
FOR I IN 1..3
LOOP
PUT (FILE,CHAR);
END LOOP;
CLOSE (FILE);
BEGIN
OPEN (FILE, IN_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED; TEXT OPEN " &
"FOR IN_FILE MODE");
RAISE INCOMPLETE;
END;
BEGIN
GET (FILE, CHAR);
IF CHAR /= 'C' THEN
FAILED ("INCORRECT VALUE READ");
END IF;
SKIP_LINE (FILE);
SKIP_LINE (FILE);
FAILED ("END_ERROR NOT RAISED - 1");
EXCEPTION
WHEN END_ERROR =>
IF COL (FILE) /= ONE THEN
FAILED ("COL NOT RESET CORRECTLY");
END IF;
IF NOT END_OF_FILE (FILE) THEN
FAILED ("NOT POSITIONED AT END OF FILE");
END IF;
IF PAGE (FILE) /= TWO THEN
FAILED ("PAGE NOT INCREMENTED");
END IF;
IF LINE (FILE) /= ONE THEN
FAILED ("LINE NOT RESET CORRECTLY");
END IF;
IF NOT END_OF_LINE (FILE) THEN
FAILED ("EOL FALSE AT FILE TERMINATOR");
END IF;
IF NOT END_OF_PAGE (FILE) THEN
FAILED ("EOP FALSE AT FILE TERMINATOR");
END IF;
BEGIN
SKIP_LINE (FILE);
FAILED ("END_ERROR NOT RAISED - 2");
EXCEPTION
WHEN END_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED - 1");
END;
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED - 2");
END;
BEGIN
DELETE (FILE);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
RESULT;
EXCEPTION
WHEN INCOMPLETE =>
RESULT;
END CE3403F;
|
with Ada.Text_IO;
use Ada.Text_IO;
with Ada.Unchecked_Deallocation;
package body Arbre_Binaire is
procedure Free is
new Ada.Unchecked_Deallocation (T_Cellule, T_Pointeur_Binaire);
procedure Initialiser(Arbre: out T_Pointeur_Binaire; Cle : in T_Cle) is
Cellule : T_Pointeur_Binaire;
begin
Cellule := new T_Cellule;
Cellule.all.Cle := Cle;
Cellule.all.Fils_Droit := null;
Cellule.all.Fils_Gauche:= null;
Arbre := Cellule;
end Initialiser;
function Est_Vide (Arbre : in T_Pointeur_Binaire) return Boolean is
begin
if Arbre = null then
return True;
elsif Arbre.all.Fils_Droit /= null then
return False;
elsif Arbre.all.Fils_Gauche /= null then
return False;
else
return True;
end if;
end Est_Vide;
function Est_Vide_Fils_Droit (Arbre : in T_Pointeur_Binaire) return Boolean is
begin
return Arbre.all.Fils_Droit = null;
end Est_Vide_Fils_Droit;
function Est_Vide_Fils_Gauche (Arbre : in T_Pointeur_Binaire) return Boolean is
begin
return Arbre.Fils_Gauche = null;
end Est_Vide_Fils_Gauche;
function Retourner_Fils_Gauche (Arbre : in T_Pointeur_Binaire) return T_Pointeur_Binaire is
begin
return Arbre.all.Fils_Gauche;
end Retourner_Fils_Gauche;
function Retourner_Cle (Arbre : in T_Pointeur_Binaire) return T_Cle is
begin
return Arbre.all.Cle;
end Retourner_Cle;
function Retourner_Fils_Droit (Arbre : in T_Pointeur_Binaire) return T_Pointeur_Binaire is
begin
return Arbre.all.Fils_Droit;
end Retourner_Fils_Droit;
function Nombre_Fils (Arbre : in T_Pointeur_Binaire; Cle : in T_Cle) return Integer is
Pointeur : T_Pointeur_Binaire;
begin
Rechercher_Position (Arbre , Cle, Pointeur);
return Nombre_Fils_Recu(Pointeur);
end Nombre_Fils;
function Est_Present(Arbre : in T_Pointeur_Binaire; Cle : in T_Cle) return Boolean is
begin
if Arbre = null then
return False;
elsif Arbre.all.Cle = Cle then
return True;
else
return Est_Present(Arbre.all.Fils_Droit,Cle) or Est_Present(Arbre.all.Fils_Gauche,Cle);
end if;
end Est_Present;
-- Fonction qui renvoie le nombre le nombre de fils à partir d'un noeud donné.
-- Paramètres :
-- Arbre le pointeur qui pointe vers le noeud à partir duquel on veut compter.
-- But : Ne pas effectuer plusieurs fois Rechercher_Poisition.
function Nombre_Fils_Recu (Arbre : in T_Pointeur_Binaire) return Integer is
begin
if Arbre = null then
return 0;
else
return Nombre_Fils_Recu(Arbre.all.Fils_Droit) + Nombre_Fils_Recu(Arbre.all.Fils_Gauche) + 1;
end if;
end Nombre_Fils_Recu;
-- Procédure qui trouve le pointeur qui pointe vers la cellule dans laquelle se trouve la clé que l'on recherche.
-- Paramètres:
-- Arbre l'arbre dans lequel on recherche la clé.
-- Cle La clé que l'on recherche.
-- Position Le pointeur qui pointe vers la clé
-- But: Pouvoir lever une exception dans Rechecher_Position si la clé recherchée est absente de l'arbre.
procedure Trouver_Position (Arbre : in T_Pointeur_Binaire; Cle : in T_Cle; Position : in out T_Pointeur_Binaire) is
begin
if Arbre = null then
null;
elsif Arbre.all.Cle /= Cle and Position = null then
Trouver_Position (Arbre.all.Fils_Droit, Cle, Position);
-- Cas possible seulement si Cle = Cle du 1er individu de l'arbre
elsif Arbre.all.Cle = Cle then
Position := Arbre;
else
null;
end if;
if Arbre = null then
null;
elsif Arbre.all.Cle /= Cle and Position = null then
Trouver_Position (Arbre.all.Fils_Gauche, Cle, Position);
elsif Arbre.all.Cle = Cle then
Position := Arbre;
else
null;
end if;
end Trouver_Position;
procedure Rechercher_Position (Arbre : in T_Pointeur_Binaire; Cle : in T_Cle; Pointeur : out T_Pointeur_Binaire) is
begin
Pointeur := null;
Trouver_Position (Arbre, Cle, Pointeur);
if Pointeur = null then
raise Cle_Absente_Exception_Bin;
else
null;
end if;
end Rechercher_Position;
procedure Ajouter_Fils_Droit (Arbre : in out T_Pointeur_Binaire; Cle_Parent : in T_Cle; Cle_Fils : in T_Cle) is
Pointeur : T_Pointeur_Binaire;
begin
if Est_Present(Arbre,Cle_Fils) then
raise Cle_Presente_Exception_Bin;
else
Rechercher_Position (Arbre, Cle_Parent, Pointeur);
if Pointeur.all.Fils_Droit /= null then
raise Emplacement_Reserve_Exception_Bin;
else
Ajouter (Pointeur.all.Fils_Droit, Cle_Fils);
end if;
end if;
end Ajouter_Fils_Droit;
procedure Ajouter_Fils_Gauche (Arbre : in out T_Pointeur_Binaire; Cle_Parent : in T_Cle; Cle_Fils : in T_Cle) is
Pointeur : T_Pointeur_Binaire;
begin
if Est_Present(Arbre,Cle_Fils) then
raise Cle_Presente_Exception_Bin;
else
Rechercher_Position (Arbre, Cle_Parent, Pointeur);
if Pointeur.all.Fils_Gauche /= null then
raise Emplacement_Reserve_Exception_Bin;
else
Ajouter (Pointeur.all.Fils_Gauche, Cle_Fils);
end if;
end if;
end Ajouter_Fils_Gauche;
-- Procédure qui ajoute un noeud au bout d'un pointeur.
-- Paramètre:
-- Arbre Le pointeur qui va pointer vers le noeud que l'on souhaite créer.
-- Cle La clé du noeud que l'on ajoute.
procedure Ajouter (Arbre : in out T_Pointeur_Binaire; Cle : in T_Cle) is
Cellule : T_Pointeur_Binaire;
begin
Cellule := new T_Cellule;
Cellule.all.Cle := Cle;
Cellule.all.Fils_Droit := null;
Cellule.all.Fils_Gauche:= null;
Arbre := Cellule;
end Ajouter;
-- Procédure qui trouve le pointeur qui pointe vers la cellule dans laquelle se trouve le père de la clé que l'on recherche.
-- Paramètres:
-- Arbre l'arbre dans lequel on recherche la clé.
-- Cle La clé que l'on recherche.
-- Position Le pointeur qui pointe vers le père de la clé.
-- Exception : Cle_Absente_Exception_Bin si Clé n'est pas utilisée dans l'arbre.
-- But : Besoin pour utiliser vider dans la procedure supprimer.
procedure Trouver_grand_pere (Arbre : in T_Pointeur_Binaire; Cle : in T_Cle; Position : in out T_Pointeur_Binaire) is
begin
if Arbre = null then
null;
elsif Arbre.all.Cle = Cle then
Position := Arbre;
elsif Arbre.all.Fils_Droit = null and Arbre.all.Fils_Gauche = null then
null;
elsif Arbre.all.Fils_Droit = null then
if Position = null then
Trouver_grand_pere(Arbre.all.Fils_Gauche, Cle, Position);
else
null;
end if;
elsif Arbre.all.Fils_Gauche = null then
if Position = null then
Trouver_grand_pere(Arbre.all.Fils_Droit, Cle, Position);
else
null;
end if;
elsif Arbre.all.Fils_Droit.all.Cle /= Cle and Arbre.all.Fils_Gauche.all.Cle /= Cle and Position = null then
Trouver_grand_pere (Arbre.all.Fils_Droit, Cle, Position);
Trouver_grand_pere(Arbre.all.Fils_Gauche, Cle, Position);
elsif Arbre.all.Fils_Droit.all.Cle = Cle or Arbre.all.Fils_Gauche.all.Cle = Cle then
Position := Arbre;
else
null;
end if;
end Trouver_grand_pere;
procedure Supprimer (Arbre : in out T_Pointeur_Binaire ; Cle : in T_Cle) is
Pointeur : T_Pointeur_Binaire;
begin
Pointeur := null;
Trouver_grand_pere (Arbre, Cle, Pointeur);
if Pointeur = null then
raise Cle_Absente_Exception_Bin;
elsif Pointeur.all.Cle = Cle then
Vider(Arbre);
else
if Pointeur.all.Fils_Gauche.all.Cle = Cle then
Vider(Pointeur.all.Fils_Gauche);
else
Vider(Pointeur.all.Fils_Droit);
end if;
end if;
end Supprimer;
procedure Vider (Arbre : in out T_Pointeur_Binaire) is
begin
if Arbre = null then
null;
else
Vider(Arbre.all.Fils_Droit);
Vider(Arbre.all.Fils_Gauche);
Free(Arbre);
end if;
end Vider;
procedure Afficher_Arbre_Binaire (Arbre : in T_Pointeur_Binaire) is
procedure Indenter(Decalage : in Integer) is
begin
for I in 1..Decalage loop
Put (' ');
end loop;
end Indenter;
-- Afficher un arbre à la profondeur Profondeur et qui à du côté
-- indiqué (< pour Gauche et > pour droit, - pour la racine).
procedure Afficher_Profondeur (Arbre: in T_Pointeur_Binaire ; Profondeur : in Integer ; Cote : in Character) is
begin
if Arbre = Null then
Null;
else
Indenter (Profondeur * 4);
Put (Cote & ' ');
Afficher_Cle (Arbre.all.Cle);
New_Line;
Afficher_Profondeur (Arbre.all.Fils_Gauche, Profondeur + 1, '<');
Afficher_Profondeur (Arbre.all.Fils_Droit, Profondeur + 1, '>');
end if;
end Afficher_Profondeur;
begin
Afficher_Profondeur (Arbre, 0, '-');
end Afficher_Arbre_Binaire;
procedure Afficher_Cle_Binaire (Arbre : in T_Pointeur_Binaire) is
begin
Afficher_Cle(Arbre.all.Cle);
end Afficher_Cle_Binaire;
end Arbre_Binaire;
|
-- A83009B.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT A DERIVED TYPE DECLARATION IN A GENERIC
-- UNIT MAY DERIVE TWO OR MORE SUBPROGRAM HOMOGRAPHS.
-- CHECK THE CASES WHERE:
-- 1) THE DERIVED SUBPROGRAMS BECOME HOMOGRAPHS BECAUSE OF THE
-- SUBSTITUTION OF THE DERIVED TYPE FOR THE PARENT TYPE IN
-- THE IMPLICIT SUBPROGRAM SPECIFICATIONS.
-- 2) THE PARENT TYPE IS DECLARED IN A GENERIC INSTANCE AND
-- THE INSTANCE INCLUDES TWO OR MORE DERIVABLE SUBPROGRAMS
-- THAT ARE HOMOGRAPHS AS A RESULT OF THE ARGUMENTS GIVEN
-- FOR THE GENERIC FORMAL-TYPE PARAMETERS.
-- TEST CASES WHERE THE DERIVED TYPE DECLARATIONS ARE GIVEN IN:
-- . THE VISIBLE PART OF A GENERIC PACKAGE SPECIFICATION,
-- . THE PRIVATE PART OF A GENERIC PACKAGE SPECIFICATION,
-- . A GENERIC PACKAGE BODY,
-- . A GENERIC SUBPROGRAM BODY.
--
-- HISTORY:
-- DHH 09/20/88 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
PROCEDURE A83009B IS
TYPE ENUM IS (E1, E2, E3);
GENERIC
TYPE T1 IS (<>);
TYPE T2 IS (<>);
PACKAGE G_PACK IS
TYPE PARENT IS (E1, E2, E3);
PROCEDURE HP (P1 : PARENT; P2 : T1);
PROCEDURE HP (P3 : PARENT; P4 : T2);
FUNCTION HF (P1 : T1) RETURN PARENT;
FUNCTION HF (P2 : T2) RETURN PARENT;
END G_PACK;
PACKAGE BODY G_PACK IS
PROCEDURE HP (P1 : PARENT; P2 : T1) IS
BEGIN
NULL;
END HP;
PROCEDURE HP (P3 : PARENT; P4 : T2) IS
BEGIN
NULL;
END HP;
FUNCTION HF (P1 : T1) RETURN PARENT IS
BEGIN
RETURN E1;
END HF;
FUNCTION HF (P2 : T2) RETURN PARENT IS
BEGIN
RETURN E2;
END HF;
END G_PACK;
BEGIN
TEST ("A83009B", "A DERIVED TYPE DECLARATION IN A GENERIC " &
"UNIT MAY DERIVE TWO OR MORE SUBPROGRAM " &
"HOMOGRAPHS");
DECLARE
-- SUBPROGRAMS BECOME HOMOGRAPHS BECAUSE OF SUBSTITUTION.
GENERIC
PACKAGE PACK2 IS
TYPE CHILD1 IS PRIVATE;
PACKAGE IN_PACK2 IS
TYPE PARENT IS (E1, E2, E3);
PROCEDURE HP (P1 : PARENT; P2 : CHILD1);
PROCEDURE HP (P3 : CHILD1; P4 : PARENT);
FUNCTION HF (P1 : CHILD1; P2 : PARENT)
RETURN PARENT;
FUNCTION HF (P3 : PARENT; P4 : CHILD1)
RETURN PARENT;
END IN_PACK2;
USE IN_PACK2;
PRIVATE
TYPE CHILD1 IS NEW IN_PACK2.PARENT; -- PRIVATE PART
END PACK2; -- OF SPEC.
PACKAGE BODY PACK2 IS
TYPE CHILD2 IS NEW CHILD1; -- VISIBLE PART OF BODY.
GENERIC
PACKAGE IN_BODY IS
TYPE CHILD3 IS NEW CHILD1; -- VISIBLE PART OF SPEC.
END IN_BODY;
GENERIC
PROCEDURE P;
PROCEDURE P IS
TYPE CHILD4 IS NEW CHILD1; -- SUBPROGRAM BODY.
BEGIN
NULL;
END;
PACKAGE BODY IN_PACK2 IS
PROCEDURE HP (P1 : PARENT; P2 : CHILD1) IS
BEGIN
NULL;
END HP;
PROCEDURE HP (P3 : CHILD1; P4 : PARENT) IS
BEGIN
NULL;
END HP;
FUNCTION HF (P1 : CHILD1; P2 : PARENT)
RETURN PARENT IS
BEGIN
RETURN E1;
END HF;
FUNCTION HF (P3 : PARENT; P4 : CHILD1)
RETURN PARENT IS
BEGIN
RETURN E2;
END HF;
END IN_PACK2;
BEGIN
NULL;
END PACK2;
BEGIN
NULL;
END;
DECLARE
-- PARENT TYPE IN GENERIC INSTANCE HAS DERIVABLE HOMOGRAPHS.
GENERIC
PACKAGE PACK1 IS
PACKAGE INSTANCE2 IS
NEW G_PACK (CHARACTER, CHARACTER);
TYPE CHILD2 IS NEW INSTANCE2.PARENT;
TYPE CHILD3 IS PRIVATE;
PRIVATE
PACKAGE INSTANCE3 IS
NEW G_PACK (ENUM, ENUM);
TYPE CHILD3 IS NEW INSTANCE3.PARENT;
END PACK1;
GENERIC
PROCEDURE P1;
PROCEDURE P1 IS
PACKAGE INSTANCE4 IS
NEW G_PACK (BOOLEAN, BOOLEAN);
TYPE CHILD4 IS NEW INSTANCE4.PARENT;
BEGIN
NULL;
END P1;
PACKAGE BODY PACK1 IS
PACKAGE INSTANCE5 IS
NEW G_PACK (ENUM, ENUM);
TYPE CHILD5 IS NEW INSTANCE5.PARENT;
END PACK1;
BEGIN
NULL;
END;
RESULT;
END A83009B;
|
------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A 4 G . C O N T T . U T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2011, 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 Ada.Characters.Handling;
with Asis.Errors; use Asis.Errors;
with Asis.Exceptions; use Asis.Exceptions;
with Asis.Set_Get; use Asis.Set_Get;
with A4G.A_Debug; use A4G.A_Debug;
with A4G.Contt.Dp; use A4G.Contt.Dp;
with A4G.Contt.TT; use A4G.Contt.TT;
with A4G.Vcheck; use A4G.Vcheck;
with Atree; use Atree;
with Einfo; use Einfo;
with Lib;
with Namet; use Namet;
with Output; use Output;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Snames; use Snames;
with Table;
package body A4G.Contt.UT is
-----------------------------------------
-- Local Subprograms (general-purpose) --
-----------------------------------------
function Allocate_New_Entry (C : Context_Id) return Unit_Id;
-- allocates and returns a new entry in the Context Unit table
-- No setting or any other changes are done
procedure Set_Nil_Unit_Names (U : Unit_Id);
-- Sets all the fields related to Unit Name Table as indicating empty
-- strings
-- The body is in "Unit Name Table Data and Subprograms" section
procedure Set_Nil_Unit_Attributes (C : Context_Id; U : Unit_Id);
-- Sets all the attributes, dependency lists and tree lists of U as
-- if U is an ASIS Nil_Compilation_Unit.
-- The body is in "Black-Box Unit Attributes Routines" section
procedure Set_No_Source_File (U : Unit_Id);
-- Makes settings corresponding to the absence of the source file
-- name
function Same_Names return Boolean;
-- Compares the contents of the ASIS and GNAT Name Buffers.
procedure Make_Unit_Name;
-- Supposing that A_Name_Buffer contains the normalized name of a
-- nonexistent unit (with a suffix ending with 'n', this procedure
-- sets the content of A_Name_Buffer as equal to the Ada name of
-- this nonexistent unit
function Is_Spec (U : Unit_Id) return Boolean;
-- Checks if U denotes a unit that is a library_unit_declaration
function Get_Unit_Id_List (List : Elist_Id) return Unit_Id_List;
-- Transforms the unit list into one-dimensional array of unit Ids.
-- Returns Nil_Unit_Id_List for No_Elist
function Absolute_Full_File_Name return Boolean;
-- Checks that a source file name currently contained in the GNAT Name
-- Table contains directory information in an absolute form
procedure Store_Tree_For_Unit
(C : Context_Id;
U : Unit_Id;
N_U : Unit_Number_Type);
-- Provided that N_U is the unit number in the current tree that
-- corresponds to U, stores the currently accessed tree in the list of full
-- or limited view trees for the given unit.
type Top_Node_Rec is record
Tree : Tree_Id;
Top_Node : Node_Id;
end record;
package Top_Node_Cache is new Table.Table (
Table_Component_Type => Top_Node_Rec,
Table_Index_Type => Unit_Id,
Table_Low_Bound => First_Unit_Id,
Table_Initial => 1000,
Table_Increment => 100,
Table_Name => "Top Node Cache");
-- Used to cache the already computed results of the Top function
-----------------------------
-- Absolute_Full_File_Name --
-----------------------------
function Absolute_Full_File_Name return Boolean is
Result : Boolean := False;
begin
if Namet.Name_Buffer (1) /= '.' then
for I in 1 .. Namet.Name_Len loop
if Namet.Name_Buffer (I) = '/'
or else
Namet.Name_Buffer (I) = '\'
then
Result := True;
exit;
end if;
end loop;
end if;
return Result;
end Absolute_Full_File_Name;
------------------------
-- Allocate_New_Entry --
------------------------
function Allocate_New_Entry (C : Context_Id) return Unit_Id is
Hash_Index : Hash_Index_Type;
-- Computed hash index
Curr_Id : Unit_Id;
-- Id of entries in hash chain, if any
New_Last : Unit_Id;
-- the Id of the new entry being allocated in the Unit Table
begin
Hash_Index := Hash;
Curr_Id := Contexts.Table (C).Hash_Table (Hash_Index);
Unit_Table.Increment_Last;
New_Last := Unit_Table.Last;
-- correcting the hash chain, if any
if Curr_Id = No_Unit_Id then
Contexts.Table (C).Hash_Table (Hash_Index) := New_Last;
-- no hash chain to correct
else
while Unit_Table.Table (Curr_Id).Hash_Link /= No_Unit_Id
loop
Curr_Id := Unit_Table.Table (Curr_Id).Hash_Link;
end loop;
-- now Curr_Id is the last entry in the hash chain
Unit_Table.Table (Curr_Id).Hash_Link := New_Last;
end if;
return New_Last;
end Allocate_New_Entry;
-------------------------------------
-- Allocate_Nonexistent_Unit_Entry --
-------------------------------------
function Allocate_Nonexistent_Unit_Entry (C : Context_Id) return Unit_Id
is
New_Unit_Id : Unit_Id;
begin
-- first we should modify the normalized unit name to make it the
-- name of a nonexistent unit:
A_Name_Len := A_Name_Len + 1;
A_Name_Buffer (A_Name_Len) := 'n';
if Debug_Flag_O or else
Debug_Lib_Model or else
Debug_Mode
then
Write_Str ("Allocating new nonexistent unit: ");
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Write_Eol;
end if;
-- DO WE REALLY NEED A SPECIAL SUFFIX FOR THE NAMES OF NONEXISTENT
-- UNITS ???
New_Unit_Id := Allocate_New_Entry (C);
Set_Nil_Unit_Names (New_Unit_Id);
Set_Nil_Unit_Attributes (C, New_Unit_Id);
Set_Norm_Ada_Name (New_Unit_Id);
if A_Name_Buffer (A_Name_Len - 1) = 'b' then
Set_Kind (C, New_Unit_Id, A_Nonexistent_Body);
else
Set_Kind (C, New_Unit_Id, A_Nonexistent_Declaration);
end if;
Make_Unit_Name;
Set_Ada_Name (New_Unit_Id);
return New_Unit_Id;
end Allocate_Nonexistent_Unit_Entry;
-------------------------
-- Allocate_Unit_Entry --
-------------------------
function Allocate_Unit_Entry (C : Context_Id) return Unit_Id is
New_Unit_Id : Unit_Id;
begin
New_Unit_Id := Allocate_New_Entry (C);
Set_Nil_Unit_Names (New_Unit_Id);
Set_Nil_Unit_Attributes (C, New_Unit_Id);
Set_Norm_Ada_Name (New_Unit_Id);
if A_Name_Buffer (A_Name_Len) = 's' then
Contexts.Table (C).Specs := Contexts.Table (C).Specs + 1;
elsif A_Name_Buffer (A_Name_Len) = 'b' then
Contexts.Table (C).Bodies := Contexts.Table (C).Bodies + 1;
end if;
if Debug_Mode then
Write_Str ("Allocate_Unit_Entry: in context ");
Write_Int (Int (C));
Write_Str (" unit ");
Write_Int (Int (New_Unit_Id));
Write_Str (" is allocated...");
Write_Eol;
end if;
return New_Unit_Id;
end Allocate_Unit_Entry;
-----------------------
-- Already_Processed --
-----------------------
function Already_Processed (C : Context_Id; U : Unit_Id) return Boolean is
begin
return Kind (C, U) /= Not_A_Unit;
end Already_Processed;
-----------------------
-- Check_Consistency --
-----------------------
procedure Check_Consistency
(C : Context_Id;
U_Id : Unit_Id;
U_Num : Unit_Number_Type)
is
Old_Stamp : Time_Stamp_Type;
New_Stamp : Time_Stamp_Type;
C_Tree_Mode : constant Tree_Mode := Tree_Processing_Mode (C);
Tmp : Elmt_Id;
Unit_Is_Older : Boolean;
begin
Old_Stamp := Time_Stamp (C, U_Id);
New_Stamp := Sinput.Time_Stamp (Lib.Source_Index (U_Num));
if not (Old_Stamp = New_Stamp) then
-- note, this is "=" explicitly defied in Types
Unit_Is_Older := New_Stamp > Old_Stamp;
if C_Tree_Mode = Incremental then
raise Inconsistent_Incremental_Context;
else
-- There is a special case that requires a specific diagnostic
-- message - (re)compilation of another version of System
-- (See D617-017)
Get_Name_String (U_Id, Norm_Ada_Name);
if A_Name_Buffer (1 .. A_Name_Len) = "system%s" then
Raise_ASIS_Failed
(Diagnosis => "Asis.Ada_Environments.Open - " &
"System is recompiled",
Stat => Use_Error);
else
-- Generate the full details about detected inconsistency.
Set_Standard_Error;
Write_Str ("Different versions of unit ");
Get_Name_String (U_Id, Ada_Name);
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Write_Str ("(source file ");
Get_Name_String (U_Id, Ref_File_Name);
Write_Str (A_Name_Buffer (1 .. A_Name_Len) & ")");
Write_Eol;
Write_Str ("used to create the following tree files:");
Write_Eol;
if Unit_Is_Older then
Write_Str ("Older version used for:");
Write_Eol;
else
Write_Str ("Newer version used for:");
Write_Eol;
end if;
Write_Str ("Full view trees:");
Tmp := First_Elmt (Unit_Table.Table (U_Id).Full_View_Trees);
if Present (Tmp) then
Write_Eol;
while Present (Tmp) loop
A4G.Contt.TT.Get_Name_String (C, Tree_Id (Unit (Tmp)));
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Tmp := Next_Elmt (Tmp);
end loop;
else
Write_Str (" no");
Write_Eol;
end if;
Write_Str ("Limited view trees:");
Tmp := First_Elmt (Unit_Table.Table (U_Id).Limited_View_Trees);
if Present (Tmp) then
Write_Eol;
while Present (Tmp) loop
A4G.Contt.TT.Get_Name_String (C, Tree_Id (Unit (Tmp)));
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Tmp := Next_Elmt (Tmp);
end loop;
else
Write_Str (" no");
Write_Eol;
end if;
if Unit_Is_Older then
Write_Str ("Newer version used for:");
Write_Eol;
else
Write_Str ("Older version used for:");
Write_Eol;
end if;
A4G.Contt.TT.Get_Name_String (C, Current_Tree);
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Set_Standard_Output;
Raise_ASIS_Failed
(Diagnosis => "Asis.Ada_Environments.Open - " &
"a set of tree files is inconsistent",
Stat => Use_Error);
end if;
end if;
end if;
end Check_Consistency;
------------------------------
-- Check_Source_Consistency --
------------------------------
procedure Check_Source_Consistency
(C : Context_Id;
U_Id : Unit_Id)
is
Tree_Stamp : Time_Stamp_Type;
Source_Stamp : Time_Stamp_Type;
C_Source_Mode : constant Source_Mode := Source_Processing_Mode (C);
C_Tree_Mode : constant Tree_Mode := Tree_Processing_Mode (C);
Source_Status : Source_File_Statuses := No_File_Status;
begin
Get_Name_String (U_Id, Source_File_Name);
A_Name_Len := A_Name_Len + 1;
A_Name_Buffer (A_Name_Len) := ASCII.NUL;
if Is_Regular_File (A_Name_Buffer) then
Source_Stamp := TS_From_OS_Time (File_Time_Stamp (A_Name_Buffer));
Tree_Stamp := Time_Stamp (C, U_Id);
if Source_Stamp > Tree_Stamp then
Source_Status := Newer;
elsif Source_Stamp < Tree_Stamp then
Source_Status := Older;
else
Source_Status := Up_To_Date;
end if;
else
Source_Status := Absent;
end if;
Set_Source_Status (C, U_Id, Source_Status);
if C_Source_Mode = All_Sources and then
Source_Status = Absent
then
if C_Tree_Mode = Incremental then
raise Inconsistent_Incremental_Context;
else
Set_Error_Status
(Status => Asis.Errors.Use_Error,
Diagnosis => "Asis.Ada_Environments.Open - source file "
& A_Name_Buffer (1 .. A_Name_Len - 1)
& " does not exist");
raise ASIS_Failed;
end if;
end if;
if (C_Source_Mode = All_Sources or else C_Source_Mode = Existing_Sources)
and then
(Source_Status = Newer or else Source_Status = Older)
then
if C_Tree_Mode = Incremental then
raise Inconsistent_Incremental_Context;
else
Set_Error_Status
(Status => Asis.Errors.Use_Error,
Diagnosis => "Asis.Ada_Environments.Open - source file "
& A_Name_Buffer (1 .. A_Name_Len - 1)
& " is inconsistent with a tree file "
& Get_Tree_Name (C, Current_Tree));
raise ASIS_Failed;
end if;
end if;
end Check_Source_Consistency;
--------------------
-- Enclosing_Unit --
--------------------
function Enclosing_Unit
(Cont : Context_Id;
Node : Node_Id)
return Asis.Compilation_Unit
is
Current_Node : Node_Id := Node;
Result_Unit_Id : Unit_Id := Nil_Unit;
Success : Boolean := False;
begin
-- First, correct Current_Node in case if itreresents the defining
-- operator of implicitly declared "/=" (as a consequence of explicit
-- "=" definition
if Nkind (Current_Node) = N_Defining_Operator_Symbol
and then
not Comes_From_Source (Current_Node)
and then
Chars (Current_Node) = Name_Op_Ne
and then
Present (Corresponding_Equality (Current_Node))
then
Current_Node := Corresponding_Equality (Current_Node);
end if;
-- Then, checking if we are or are not in the package Standard:
if Sloc (Node) <= Standard_Location then
Result_Unit_Id := Standard_Id;
else
-- we are not in the package Standard here, therefore we have to
-- find the top node of the enclosing subtree:
while not (Nkind (Current_Node) = N_Compilation_Unit) loop
pragma Assert (Present (Parent (Current_Node)));
Current_Node := Parent (Current_Node);
end loop;
if Is_Rewrite_Substitution (Unit (Current_Node))
and then
Is_Rewrite_Substitution (Original_Node (Unit (Current_Node)))
and then
Nkind (Original_Node (Unit (Current_Node))) = N_Package_Body
then
-- This corresponds to the situation when a library-level
-- instantiation is a supporter of a main unit, and the expanded
-- body of this instantiation is required according to Lib (h).
-- (See 7523-A19, 7624-A06 9418-015 and 9416-A01). In this case we
-- Have to go to the compilation unit created for the
-- instantiation
Current_Node := Library_Unit (Current_Node);
end if;
-- now - getting the normalized unit name
Namet.Get_Decoded_Name_String (Lib.Unit_Name (
Lib.Get_Cunit_Unit_Number (Current_Node)));
Set_Norm_Ada_Name_String_With_Check
(Lib.Get_Cunit_Unit_Number (Current_Node), Success);
if not Success then
-- This means, that we most probably are in the unit created for
-- expanded package spec in case of library-level package
-- instantiation, ASIS skips such units and processes only
-- units rooted by expanded bodies, so let's try this
Current_Node := Unit (Current_Node);
pragma Assert
(Nkind (Current_Node) = N_Package_Declaration and then
not Comes_From_Source (Current_Node));
Current_Node := Corresponding_Body (Current_Node);
if Nkind (Parent (Current_Node)) =
N_Defining_Program_Unit_Name
then
Current_Node := Parent (Current_Node);
end if;
Current_Node := Parent (Parent (Current_Node));
Set_Norm_Ada_Name_String_With_Check
(Lib.Get_Cunit_Unit_Number (Current_Node), Success);
end if;
if Success then
Result_Unit_Id := Name_Find (Cont);
end if;
end if;
if No (Result_Unit_Id) then
raise Internal_Implementation_Error;
else
return Get_Comp_Unit (Result_Unit_Id, Cont);
end if;
end Enclosing_Unit;
----------------------
-- Form_Parent_Name --
----------------------
procedure Form_Parent_Name is
New_Len : Integer := 0;
begin
for I in reverse 1 .. A_Name_Len loop
if A_Name_Buffer (I) = '.' then
New_Len := I;
exit;
end if;
end loop;
A_Name_Len := New_Len;
if A_Name_Len = 0 then
return;
end if;
A_Name_Buffer (A_Name_Len) := '%';
A_Name_Len := A_Name_Len + 1;
A_Name_Buffer (A_Name_Len) := 's';
end Form_Parent_Name;
---------------------
-- Get_Name_String --
---------------------
procedure Get_Name_String (Id : Unit_Id; Col : Column) is
S : Int;
L : Short;
begin
case Col is
when Ada_Name =>
S := Unit_Table.Table (Id).Ada_Name_Chars_Index;
L := Unit_Table.Table (Id).Ada_Name_Len;
when Norm_Ada_Name =>
S := Unit_Table.Table (Id).Norm_Ada_Name_Chars_Index;
L := Unit_Table.Table (Id).Norm_Ada_Name_Len;
when Source_File_Name =>
S := Unit_Table.Table (Id).File_Name_Chars_Index;
L := Unit_Table.Table (Id).File_Name_Len;
when Ref_File_Name =>
S := Unit_Table.Table (Id).Ref_Name_Chars_Index;
L := Unit_Table.Table (Id).Ref_Name_Len;
end case;
A_Name_Len := Natural (L);
for I in 1 .. A_Name_Len loop
A_Name_Buffer (I) := A_Name_Chars.Table (S + Int (I));
end loop;
end Get_Name_String;
-----------------
-- Get_Subunit --
-----------------
function Get_Subunit
(Parent_Body : Asis.Compilation_Unit;
Stub_Node : Node_Id)
return Asis.Compilation_Unit
is
Def_S_Name : Node_Id;
Arg_Unit_Id : constant Unit_Id := Get_Unit_Id (Parent_Body);
Result_Unit_Id : Unit_Id;
Result_Cont_Id : constant Context_Id := Encl_Cont_Id (Parent_Body);
begin
Get_Name_String (Arg_Unit_Id, Norm_Ada_Name);
if Nkind (Stub_Node) = N_Subprogram_Body_Stub then
Def_S_Name := Defining_Unit_Name (Specification (Stub_Node));
else
Def_S_Name := Defining_Identifier (Stub_Node);
end if;
Append_Subunit_Name (Def_S_Name);
-- Now we have a name of a subunit in A_Name_Buffer. Let's try
-- to find this subunit out:
Result_Unit_Id := Name_Find (Result_Cont_Id);
return Get_Comp_Unit (Result_Unit_Id, Result_Cont_Id);
end Get_Subunit;
----------------------
-- Get_Unit_Id_List --
----------------------
function Get_Unit_Id_List (List : Elist_Id) return Unit_Id_List is
Res_Len : Natural;
Next_Element : Elmt_Id;
begin
if No (List) then
return Nil_Unit_Id_List;
end if;
Res_Len := List_Length (List);
declare
Result : Unit_Id_List (1 .. Res_Len);
begin
Next_Element := First_Elmt (List);
for I in 1 .. Res_Len loop
Result (I) := Unit (Next_Element);
Next_Element := Next_Elmt (Next_Element);
end loop;
return Result;
end;
end Get_Unit_Id_List;
-----------------------------------
-- GNAT_Compilation_Dependencies --
-----------------------------------
function GNAT_Compilation_Dependencies (U : Unit_Id) return Unit_Id_List is
begin
return Get_Unit_Id_List (Unit_Table.Table (U).Compilation_Dependencies);
end GNAT_Compilation_Dependencies;
-------------
-- Is_Spec --
-------------
function Is_Spec (U : Unit_Id) return Boolean is
begin
Get_Name_String (U, Norm_Ada_Name);
-- The second condition is needed to filter out
-- A_Configuration_Compiation unit having the name
-- "__configuration_compilation%s"
return A_Name_Buffer (A_Name_Len) = 's'
and then A_Name_Buffer (1) /= '_';
end Is_Spec;
--------------------
-- Length_Of_Name --
--------------------
function Length_Of_Name (Id : Unit_Id; Col : Column) return Nat is
L : Short;
begin
case Col is
when Ada_Name =>
L := Unit_Table.Table (Id).Ada_Name_Len;
when Norm_Ada_Name =>
L := Unit_Table.Table (Id).Norm_Ada_Name_Len;
when Source_File_Name =>
L := Unit_Table.Table (Id).File_Name_Len;
when Ref_File_Name =>
L := Unit_Table.Table (Id).Ref_Name_Len;
end case;
return Nat (L);
end Length_Of_Name;
--------------------
-- Make_Unit_Name --
--------------------
procedure Make_Unit_Name is
begin
-- getting rid of the suffix:
A_Name_Len := A_Name_Len - 3;
A_Name_Buffer (1) := Ada.Characters.Handling.To_Upper
(A_Name_Buffer (1));
-- "normalizing" the name:
for I in 1 .. A_Name_Len - 1 loop
if A_Name_Buffer (I) = '.' or else
A_Name_Buffer (I) = '_'
then
A_Name_Buffer (I + 1) :=
Ada.Characters.Handling.To_Upper (A_Name_Buffer (I + 1));
end if;
end loop;
end Make_Unit_Name;
---------------
-- Name_Find --
---------------
-- The code has been borrowed from the GNAT Namet package. The quick
-- search for one character names was removed and allocating of a new
-- entry in case when no name has been found is changed to returning
-- Nil_Unit
function Name_Find (C : Context_Id) return Unit_Id is
New_Id : Unit_Id;
-- Id of entry in hash search, and value to be returned
S : Int;
-- Pointer into string table
Hash_Index : Hash_Index_Type;
-- Computed hash index
begin
Hash_Index := Hash;
New_Id := Contexts.Table (C).Hash_Table (Hash_Index);
if New_Id = No_Unit_Id then
return Nil_Unit;
else
Search : loop
if A_Name_Len /=
Integer (Unit_Table.Table (New_Id).Norm_Ada_Name_Len)
then
goto No_Match;
end if;
S := Unit_Table.Table (New_Id).Norm_Ada_Name_Chars_Index;
for I in 1 .. A_Name_Len loop
if A_Name_Chars.Table (S + Int (I)) /=
A_Name_Buffer (I) then
goto No_Match;
end if;
end loop;
return New_Id;
-- Current entry in hash chain does not match
<<No_Match>>
if Unit_Table.Table (New_Id).Hash_Link /=
No_Unit_Id
then
New_Id := Unit_Table.Table (New_Id).Hash_Link;
else
exit Search;
end if;
end loop Search;
end if;
-- We fall through here only if a matching entry was not found in the
-- hash table.
-- In the GNAT Name Table a new entry in the names table is created,
-- but we simply return Nil_Unit. Remember, we will have to
-- maintain the consistency of hash links when we will allocate
-- the new entry for the newly successfully compiled ASIS Compilation
-- Unit.
return Nil_Unit;
end Name_Find;
-----------------
-- Reset_Cache --
-----------------
procedure Reset_Cache is
begin
for U in First_Unit_Id .. Top_Node_Cache.Last loop
Top_Node_Cache.Table (U).Tree := Nil_Tree;
end loop;
end Reset_Cache;
------------------
-- Set_Ada_Name --
------------------
procedure Set_Ada_Name (Id : Unit_Id) is
begin
-- Set the values of Ada_Name_Chars_Index and Ada_Name_Len
Unit_Table.Table (Id).Ada_Name_Chars_Index :=
A_Name_Chars.Last;
Unit_Table.Table (Id).Ada_Name_Len := Short (A_Name_Len);
-- Set corresponding string entry in the Name_Chars table
for I in 1 .. A_Name_Len loop
A_Name_Chars.Increment_Last;
A_Name_Chars.
Table (A_Name_Chars.Last) := A_Name_Buffer (I);
end loop;
A_Name_Chars.Increment_Last;
A_Name_Chars.Table (A_Name_Chars.Last) :=
ASCII.NUL;
end Set_Ada_Name;
------------------------
-- Set_Nil_Unit_Names --
------------------------
procedure Set_Nil_Unit_Names (U : Unit_Id) is
Unit : constant Unit_Id := U;
begin
Unit_Table.Table (Unit).Ada_Name_Chars_Index := 0;
Unit_Table.Table (Unit).Norm_Ada_Name_Chars_Index := 0;
Unit_Table.Table (Unit).File_Name_Chars_Index := 0;
Unit_Table.Table (Unit).Ada_Name_Len := 0;
Unit_Table.Table (Unit).Norm_Ada_Name_Len := 0;
Unit_Table.Table (Unit).File_Name_Len := 0;
Unit_Table.Table (Unit).Ref_Name_Len := 0;
Unit_Table.Table (Unit).Hash_Link := No_Unit_Id;
end Set_Nil_Unit_Names;
-----------------------
-- Set_Norm_Ada_Name --
-----------------------
procedure Set_Norm_Ada_Name (Id : Unit_Id) is
begin
-- Set the values of Norm_Ada_Name_Chars_Index and Norm_Ada_Name_Len
Unit_Table.Table (Id).Norm_Ada_Name_Chars_Index :=
A_Name_Chars.Last;
Unit_Table.Table (Id).Norm_Ada_Name_Len := Short (A_Name_Len);
-- Set corresponding string entry in the Name_Chars table
for I in 1 .. A_Name_Len loop
A_Name_Chars.Increment_Last;
A_Name_Chars.
Table (A_Name_Chars.Last) := A_Name_Buffer (I);
end loop;
A_Name_Chars.Increment_Last;
A_Name_Chars.
Table (A_Name_Chars.Last) := ASCII.NUL;
end Set_Norm_Ada_Name;
------------------------------
-- Set_Norm_Ada_Name_String --
------------------------------
procedure Set_Norm_Ada_Name_String is
begin
A_Name_Len := Namet.Name_Len;
A_Name_Buffer (1 .. A_Name_Len) :=
Namet.Name_Buffer (1 .. Namet.Name_Len);
-- ??? The commented code caused problems for 7717-010
-- ??? We will keep it for a while in case of possible
-- ??? regressions (18.05.2000)
-- A_Name_Buffer (1 .. A_Name_Len) := Ada.Characters.Handling.To_Lower
-- (Namet.Name_Buffer (1 .. Namet.Name_Len));
end Set_Norm_Ada_Name_String;
-----------------------------------------
-- Set_Norm_Ada_Name_String_With_Check --
-----------------------------------------
procedure Set_Norm_Ada_Name_String_With_Check
(Unit : Unit_Number_Type;
Success : out Boolean)
is
Unit_Node : Node_Id;
Unit_Node_Kind : Node_Kind;
begin
Set_Norm_Ada_Name_String;
Success := True;
Unit_Node := Sinfo.Unit (Lib.Cunit (Unit));
Unit_Node_Kind := Nkind (Unit_Node);
if (Unit_Node_Kind = N_Package_Body or else
Unit_Node_Kind = N_Package_Declaration)
and then
Nkind (Original_Node (Unit_Node)) in N_Generic_Instantiation
then
-- Unit created for library-level package or procedure instantiation
-- It is a spec, but the compiler sets for it in the unit
-- table suffix '%b'
A_Name_Buffer (A_Name_Len) := 's';
elsif not Comes_From_Source (Unit_Node) then
-- Unit created for expanded package spec in case of
-- library-level package instantiation, we do not need it
Success := False;
end if;
end Set_Norm_Ada_Name_String_With_Check;
------------------------
-- Set_No_Source_File --
------------------------
procedure Set_No_Source_File (U : Unit_Id) is
begin
Unit_Table.Table (U).File_Name_Len := 0;
Unit_Table.Table (U).Ref_Name_Len := 0;
end Set_No_Source_File;
--------------------------
-- Set_Source_File_Name --
--------------------------
procedure Set_Source_File_Name (Id : Unit_Id; Ref : Boolean := False) is
begin
-- Set the values of File_Name_Chars_Index and File_Name_Len
if Ref then
Unit_Table.Table (Id).Ref_Name_Chars_Index :=
A_Name_Chars.Last;
Unit_Table.Table (Id).Ref_Name_Len := Short (A_Name_Len);
else
Unit_Table.Table (Id).File_Name_Chars_Index :=
A_Name_Chars.Last;
Unit_Table.Table (Id).File_Name_Len := Short (A_Name_Len);
end if;
-- Set corresponding string entry in the Name_Chars table
for I in 1 .. A_Name_Len loop
A_Name_Chars.Increment_Last;
A_Name_Chars.
Table (A_Name_Chars.Last) := A_Name_Buffer (I);
end loop;
A_Name_Chars.Increment_Last;
A_Name_Chars.
Table (A_Name_Chars.Last) := ASCII.NUL;
end Set_Source_File_Name;
---------------------------------
-- Set_Ref_File_As_Source_File --
---------------------------------
procedure Set_Ref_File_As_Source_File (U : Unit_Id) is
begin
Unit_Table.Table (U).Ref_Name_Chars_Index :=
Unit_Table.Table (U).File_Name_Chars_Index;
Unit_Table.Table (U).Ref_Name_Len :=
Unit_Table.Table (U).File_Name_Len;
end Set_Ref_File_As_Source_File;
------------------------------
-- Set_Ref_File_Name_String --
------------------------------
procedure Set_Ref_File_Name_String (U : Unit_Id) is
Last_Dir_Separator : Natural := 0;
begin
if not Absolute_Full_File_Name then
Get_Name_String (U, Source_File_Name);
for I in reverse 1 .. A_Name_Len loop
if A_Name_Buffer (I) = Directory_Separator then
Last_Dir_Separator := I;
exit;
end if;
end loop;
end if;
if Last_Dir_Separator > 0 and then
not (Last_Dir_Separator = 2 and then A_Name_Buffer (1) = '.')
then
A_Name_Len := Last_Dir_Separator;
else
A_Name_Len := 0;
end if;
A_Name_Buffer (A_Name_Len + 1 .. A_Name_Len + Namet.Name_Len) :=
Namet.Name_Buffer (1 .. Namet.Name_Len);
A_Name_Len := A_Name_Len + Namet.Name_Len;
end Set_Ref_File_Name_String;
--------------
-- Set_Unit --
--------------
function Set_Unit (C : Context_Id; U : Unit_Number_Type) return Unit_Id is
New_Unit : Unit_Id;
begin
New_Unit := Allocate_Unit_Entry (C);
Set_Time_Stamp (C, New_Unit, Sinput.Time_Stamp (Lib.Source_Index (U)));
return New_Unit;
end Set_Unit;
----------------------------------------------
-- Black-Box Unit Attributes Routines --
----------------------------------------------
-----------------------
-- Local Subprograms --
-----------------------
------------------------------------------------
-- Unit Attributes Access and Update Routines --
------------------------------------------------
function Top (U : Unit_Id) return Node_Id is
Old_Last_Cache : Unit_Id;
begin
-- First, try to get the result from the cache
if U <= Top_Node_Cache.Last
and then
Top_Node_Cache.Table (U).Tree = Get_Current_Tree
then
return Top_Node_Cache.Table (U).Top_Node;
end if;
-- we have to compute the top node of the unit on the base of the
-- currently accessed tree. We are guaranteed here, that the currently
-- accessed tree contains the subtree for a given Unit
Get_Name_String (U, Norm_Ada_Name);
-- and now we will compare it with the names of the units contained
-- in the currently accessed tree
for Current_Unit in Main_Unit .. Lib.Last_Unit loop
Namet.Get_Decoded_Name_String (Lib.Unit_Name (Current_Unit));
-- Here we have to take into account, that in case of library
-- level package instantiations, in the tree created for such
-- an instantiation the main unit (corresponding to this
-- instantiation) has suffix '%b', whereas in ASIS the corresponding
-- normalized unit name has suffix '%s'
if Current_Unit = Main_Unit and then
Nkind (Original_Node (Sinfo.Unit (Lib.Cunit (Current_Unit)))) in
N_Generic_Instantiation
then
Namet.Name_Buffer (Namet.Name_Len) := 's';
end if;
if Same_Names then
Old_Last_Cache := Top_Node_Cache.Last;
if U > Old_Last_Cache then
Top_Node_Cache.Set_Last (U);
for J in Old_Last_Cache + 1 .. U - 1 loop
Top_Node_Cache.Table (J).Tree := Nil_Tree;
end loop;
end if;
Top_Node_Cache.Table (U).Top_Node := Lib.Cunit (Current_Unit);
Top_Node_Cache.Table (U).Tree := Get_Current_Tree;
return Lib.Cunit (Current_Unit);
end if;
end loop;
-- we cannot be here! But if we are, the only cause may be some bug
-- in ASIS implementation. So:
raise Internal_Implementation_Error;
end Top;
function Kind (C : Context_Id; U : Unit_Id) return Unit_Kinds is
begin
Reset_Context (C);
return Unit_Table.Table (U).Kind;
end Kind;
function Class (C : Context_Id; U : Unit_Id) return Unit_Classes is
begin
Reset_Context (C);
return Unit_Table.Table (U).Class;
end Class;
function Origin (C : Context_Id; U : Unit_Id) return Unit_Origins is
begin
Reset_Context (C);
return Unit_Table.Table (U).Origin;
end Origin;
function Is_Main_Unit (C : Context_Id; U : Unit_Id) return Boolean is
begin
Reset_Context (C);
return Unit_Table.Table (U).Main_Unit;
end Is_Main_Unit;
function Is_Body_Required (C : Context_Id; U : Unit_Id) return Boolean is
begin
Reset_Context (C);
return Unit_Table.Table (U).Is_Body_Required;
end Is_Body_Required;
function Time_Stamp (C : Context_Id; U : Unit_Id) return Time_Stamp_Type is
begin
Reset_Context (C);
return Unit_Table.Table (U).Time_Stamp;
end Time_Stamp;
function Is_Consistent (C : Context_Id; U : Unit_Id) return Boolean is
begin
Reset_Context (C);
return Unit_Table.Table (U).Is_Consistent;
end Is_Consistent;
function Source_Status (C : Context_Id; U : Unit_Id)
return Source_File_Statuses
is
begin
Reset_Context (C);
return Unit_Table.Table (U).Source_File_Status;
end Source_Status;
function Main_Tree (C : Context_Id; U : Unit_Id) return Tree_Id is
begin
Reset_Context (C);
return Unit_Table.Table (U).Main_Tree;
end Main_Tree;
function Has_Limited_View_Only
(C : Context_Id;
U : Unit_Id)
return Boolean
is
begin
Reset_Context (C);
return No (Unit_Table.Table (U).Full_View_Trees)
or else
No (First_Elmt (Unit_Table.Table (U).Full_View_Trees));
end Has_Limited_View_Only;
--------
procedure Set_Top (C : Context_Id; U : Unit_Id; N : Node_Id) is
begin
Reset_Context (C);
Unit_Table.Table (U).Top := N;
end Set_Top;
procedure Set_Kind (C : Context_Id; U : Unit_Id; K : Unit_Kinds) is
begin
Reset_Context (C);
Unit_Table.Table (U).Kind := K;
end Set_Kind;
procedure Set_Class (C : Context_Id; U : Unit_Id; Cl : Unit_Classes) is
begin
Reset_Context (C);
Unit_Table.Table (U).Class := Cl;
end Set_Class;
procedure Set_Origin (C : Context_Id; U : Unit_Id; O : Unit_Origins) is
begin
Reset_Context (C);
Unit_Table.Table (U).Origin := O;
end Set_Origin;
procedure Set_Is_Main_Unit (C : Context_Id; U : Unit_Id; M : Boolean) is
begin
Reset_Context (C);
Unit_Table.Table (U).Main_Unit := M;
end Set_Is_Main_Unit;
procedure Set_Is_Body_Required (C : Context_Id; U : Unit_Id; B : Boolean) is
begin
Reset_Context (C);
Unit_Table.Table (U).Is_Body_Required := B;
end Set_Is_Body_Required;
procedure Set_Time_Stamp (C : Context_Id; U : Unit_Id; T : Time_Stamp_Type)
is
begin
Reset_Context (C);
Unit_Table.Table (U).Time_Stamp := T;
end Set_Time_Stamp;
procedure Set_Is_Consistent (C : Context_Id; U : Unit_Id; B : Boolean) is
begin
Reset_Context (C);
Unit_Table.Table (U).Is_Consistent := B;
end Set_Is_Consistent;
procedure Set_Source_Status
(C : Context_Id;
U : Unit_Id;
S : Source_File_Statuses)
is
begin
Reset_Context (C);
Unit_Table.Table (U).Source_File_Status := S;
end Set_Source_Status;
----------------
-- Same_Names --
----------------
function Same_Names return Boolean is
begin
if Contt.A_Name_Len /= Namet.Name_Len then
return False;
end if;
-- a small optimization for comparing the Unit names:
-- we start from comparing the spec/body sign :-)
if Contt.A_Name_Buffer (A_Name_Len) /=
Namet.Name_Buffer (A_Name_Len)
then
return False;
end if;
for I in 1 .. Contt.A_Name_Len - 1 loop
if Contt.A_Name_Buffer (I) /= Namet.Name_Buffer (I) then
return False;
end if;
end loop;
return True;
end Same_Names;
-----------------------------
-- Set_Nil_Unit_Attributes --
-----------------------------
procedure Set_Nil_Unit_Attributes (C : Context_Id; U : Unit_Id) is
begin
Set_Top (C, U, Empty);
Set_Kind (C, U, Not_A_Unit);
Set_Class (C, U, Not_A_Class);
Set_Origin (C, U, Not_An_Origin);
Set_Is_Main_Unit (C, U, False);
Set_Is_Body_Required (C, U, False);
Set_No_Source_File (U);
Set_Time_Stamp (C, U, (others => '0'));
Set_Is_Consistent (C, U, True);
Set_Source_Status (C, U, No_File_Status);
-- setting the empty dependencies lists:
Unit_Table.Table (U).Ancestors := New_Elmt_List;
Unit_Table.Table (U).Descendants := New_Elmt_List;
Unit_Table.Table (U).Direct_Supporters := New_Elmt_List;
Unit_Table.Table (U).Supporters := New_Elmt_List;
Unit_Table.Table (U).Implicit_Supporters := New_Elmt_List;
Unit_Table.Table (U).Direct_Dependents := New_Elmt_List;
Unit_Table.Table (U).Dependents := New_Elmt_List;
Unit_Table.Table (U).Subunits_Or_Childs := New_Elmt_List;
Unit_Table.Table (U).Subunits_Computed := False;
Unit_Table.Table (U).Compilation_Dependencies := New_Elmt_List;
Unit_Table.Table (U).Full_View_Trees := New_Elmt_List;
Unit_Table.Table (U).Limited_View_Trees := New_Elmt_List;
Unit_Table.Table (U).Main_Tree := Nil_Tree;
end Set_Nil_Unit_Attributes;
-------------------------
-- Store_Tree_For_Unit --
-------------------------
procedure Store_Tree_For_Unit
(C : Context_Id;
U : Unit_Id;
N_U : Unit_Number_Type)
is
begin
if Analyzed (Lib.Cunit (N_U)) then
Append_Full_View_Tree_To_Unit (C, U);
else
Append_Limited_View_Tree_To_Unit (C, U);
end if;
end Store_Tree_For_Unit;
---------------------
-- TS_From_OS_Time --
---------------------
function TS_From_OS_Time (T : OS_Time) return Time_Stamp_Type is
Y : Year_Type;
Mon : Month_Type;
D : Day_Type;
H : Hour_Type;
Min : Minute_Type;
S : Second_Type;
Res : Time_Stamp_Type;
begin
GM_Split (T, Y, Mon, D, H, Min, S);
Make_Time_Stamp
(Nat (Y), Nat (Mon), Nat (D), Nat (H), Nat (Min), Nat (S), Res);
return Res;
end TS_From_OS_Time;
----------------------------------------------------------
-- Subprograms for Semantic Dependencies Handling --
----------------------------------------------------------
--------------
-- Children --
--------------
function Children (U : Unit_Id) return Unit_Id_List is
begin
return Get_Unit_Id_List (Unit_Table.Table (U).Subunits_Or_Childs);
end Children;
--------------------------
-- Get_Nonexistent_Unit --
--------------------------
function Get_Nonexistent_Unit (C : Context_Id) return Unit_Id is
Result_Id : Unit_Id;
begin
-- A_Name_Buffer contains the normalized unit name ending with "%s"
A_Name_Len := A_Name_Len + 1;
A_Name_Buffer (A_Name_Len) := 'n';
Result_Id := Name_Find (C);
if No (Result_Id) then
-- coming back to the correct initial situation for
-- Allocate_Nonexistent_Unit_Entry:
A_Name_Len := A_Name_Len - 1;
Result_Id := Allocate_Nonexistent_Unit_Entry (C);
end if;
return Result_Id;
end Get_Nonexistent_Unit;
---------------------
-- Get_Parent_Unit --
---------------------
function Get_Parent_Unit (C : Context_Id; U : Unit_Id) return Unit_Id is
begin
if U = Standard_Id then
return Nil_Unit;
end if;
Get_Name_String (U, Norm_Ada_Name);
Form_Parent_Name;
if A_Name_Len = 0 then
return Standard_Id;
else
return Name_Find (C);
end if;
end Get_Parent_Unit;
--------------
-- Get_Body --
--------------
function Get_Body (C : Context_Id; U : Unit_Id) return Unit_Id is
begin
Get_Name_String (U, Norm_Ada_Name);
A_Name_Buffer (A_Name_Len) := 'b';
return Name_Find (C);
end Get_Body;
---------------------
-- Get_Declaration --
---------------------
function Get_Declaration (C : Context_Id; U : Unit_Id) return Unit_Id is
begin
Get_Name_String (U, Norm_Ada_Name);
A_Name_Buffer (A_Name_Len) := 's';
return Name_Find (C);
end Get_Declaration;
-------------------
-- Get_Same_Unit --
-------------------
function Get_Same_Unit
(Arg_C : Context_Id;
Arg_U : Unit_Id;
Targ_C : Context_Id)
return Unit_Id
is
Result : Unit_Id;
begin
if Arg_C = Targ_C or else Arg_U = Nil_Unit then
return Arg_U;
end if;
Reset_Context (Arg_C);
Get_Name_String (Arg_U, Norm_Ada_Name);
Reset_Context (Targ_C);
Result := Name_Find (Targ_C);
if Present (Result) and then
Time_Stamp (Arg_C, Arg_U) = Time_Stamp (Targ_C, Result)
then
return Result;
else
return Nil_Unit;
end if;
end Get_Same_Unit;
-----------------------------
-- Get_Subunit_Parent_Body --
-----------------------------
function Get_Subunit_Parent_Body
(C : Context_Id;
U : Unit_Id)
return Unit_Id
is
begin
Get_Name_String (U, Norm_Ada_Name);
Form_Parent_Name;
A_Name_Buffer (A_Name_Len) := 'b';
-- for subunits Form_Parent_Name cannot set A_Name_Len as 0, and it
-- sets A_Name_Buffer (A_Name_Len) as 's'
return Name_Find (C);
end Get_Subunit_Parent_Body;
--------------
-- Not_Root --
--------------
function Not_Root return Boolean is
begin
for I in 1 .. A_Name_Len loop
if A_Name_Buffer (I) = '.' then
return True;
end if;
end loop;
return False;
end Not_Root;
--------------
-- Subunits --
--------------
function Subunits (C : Context_Id; U : Unit_Id) return Unit_Id_List is
begin
if not Unit_Table.Table (U).Subunits_Computed then
if not Unit_In_Current_Tree (C, U) then
Reset_Tree_For_Unit (C, U);
end if;
Set_Subunits (C, U, Top (U));
end if;
return Get_Unit_Id_List (Unit_Table.Table (U).Subunits_Or_Childs);
end Subunits;
--------------------------------------------------
-- General-Purpose Unit Table Subprograms --
--------------------------------------------------
----------------------
-- Comp_Unit_Bodies --
----------------------
function Comp_Unit_Bodies (C : Context_Id) return Natural is
begin
return Contexts.Table (C).Bodies;
end Comp_Unit_Bodies;
--------------
-- Finalize --
--------------
procedure Finalize (C : Context_Id) is
begin
if not Debug_Lib_Model then
return;
end if;
for U in First_Unit_Id .. Last_Unit loop
Output_Unit (C, U);
end loop;
end Finalize;
----------------
-- First_Body --
----------------
function First_Body return Unit_Id is
Result : Unit_Id := Nil_Unit;
begin
-- Note that we start iterating after Config_Comp_Id not to count
-- A_Configuration_Compilation unit as a body
for U in Config_Comp_Id + 1 .. Last_Unit loop
if not Is_Spec (U) then
Result := U;
exit;
end if;
end loop;
return Result;
end First_Body;
---------------
-- Last_Unit --
---------------
function Last_Unit return Unit_Id is
begin
return Unit_Table.Last;
end Last_Unit;
--------------------
-- Lib_Unit_Decls --
--------------------
function Lib_Unit_Decls (C : Context_Id) return Natural is
begin
return Contexts.Table (C).Specs;
end Lib_Unit_Decls;
---------------
-- Next_Body --
---------------
function Next_Body (B : Unit_Id) return Unit_Id is
Result : Unit_Id := Nil_Unit;
begin
for U in B + 1 .. Last_Unit loop
if not Is_Spec (U) then
Result := U;
exit;
end if;
end loop;
return Result;
end Next_Body;
---------------
-- Next_Decl --
---------------
function Next_Decl (D : Unit_Id) return Unit_Id is
Result : Unit_Id := Nil_Unit;
begin
for U in D + 1 .. Last_Unit loop
if Is_Spec (U) then
Result := U;
exit;
end if;
end loop;
return Result;
end Next_Decl;
--------
-- No --
--------
function No (Unit : Unit_Id) return Boolean is
begin
return Unit = Nil_Unit;
end No;
-------------
-- Present --
-------------
function Present (Unit : Unit_Id) return Boolean is
begin
return Unit /= Nil_Unit;
end Present;
-----------------
-- Output_Unit --
-----------------
procedure Output_Unit (C : Context_Id; Unit : Unit_Id) is
begin
Write_Str ("Debug output for Unit Id ");
Write_Int (Int (Unit));
Write_Eol;
Write_Str ("----------------------------");
Write_Eol;
if Unit = Nil_Unit then
Write_Str ("This is a Nil Unit");
Write_Eol;
return;
end if;
Write_Str ("Ada Unit Name: ");
Get_Name_String (Unit, Ada_Name);
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Write_Str ("Normalized Ada Unit Name: ");
Get_Name_String (Unit, Norm_Ada_Name);
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Write_Str ("Source File Name: ");
Get_Name_String (Unit, Source_File_Name);
if A_Name_Len = 0 then
Write_Str ("no source file available");
else
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
end if;
Write_Eol;
Write_Str ("Reference File Name: ");
Get_Name_String (Unit, Ref_File_Name);
if A_Name_Len = 0 then
Write_Str ("no reference file available");
else
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
end if;
Write_Eol;
Write_Str ("Unit Kind: ");
Write_Str (Unit_Kinds'Image (Kind (C, Unit)));
Write_Eol;
Write_Str ("Unit Class: ");
Write_Str (Unit_Classes'Image (Class (C, Unit)));
Write_Eol;
Write_Str ("Unit Origin: ");
Write_Str (Unit_Origins'Image (Origin (C, Unit)));
Write_Eol;
Write_Str ("Can be a main unit: ");
Write_Str (Boolean'Image (Is_Main_Unit (C, Unit)));
Write_Eol;
Write_Str ("Is body required: ");
Write_Str (Boolean'Image (Is_Body_Required (C, Unit)));
Write_Eol;
Write_Str ("Time stamp: ");
Write_Str (String (Time_Stamp (C, Unit)));
Write_Eol;
Write_Str ("Is consistent: ");
Write_Str (Boolean'Image (Is_Consistent (C, Unit)));
Write_Eol;
Write_Str ("Source file status: ");
Write_Str (Source_File_Statuses'Image (Source_Status (C, Unit)));
Write_Eol;
Write_Str ("Full view tree set:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Full_View_Trees);
Write_Str ("Limited view tree set:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Limited_View_Trees);
Write_Str ("Main_Tree: ");
Write_Int (Int (Unit_Table.Table (Unit).Main_Tree));
Write_Eol;
Write_Str ("Dependencies:");
Write_Eol;
Write_Str ("=============");
Write_Eol;
Write_Str ("Ancestors:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Ancestors);
Write_Str ("Descendents:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Descendants);
Write_Str ("Direct_Supporters:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Direct_Supporters);
Write_Str ("Supporters:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Supporters);
Write_Str ("Implicit Supporters:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Implicit_Supporters);
Write_Str ("Direct_Dependents:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Direct_Dependents);
Write_Str ("Dependents:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Dependents);
Write_Str ("Subunits_Or_Childs:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Subunits_Or_Childs);
Write_Str ("Compilation_Dependencies:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Compilation_Dependencies);
Write_Str ("==============================================");
Write_Eol;
end Output_Unit;
-----------------
-- Print_Units --
-----------------
procedure Print_Units (C : Context_Id) is
begin
Write_Str ("Unit Table for Context number: ");
Write_Int (Int (C));
Write_Eol;
if C = Non_Associated then
Write_Str (" Nil Context, it can never contain any unit");
Write_Eol;
return;
end if;
if Is_Opened (C) then
Write_Str ("The number of the unit entries being allocated is ");
Write_Int (Int (Last_Unit - First_Unit_Id + 1));
Write_Eol;
Write_Str ("The number of existing specs is ");
Write_Int (Int (Contexts.Table (C).Specs));
Write_Eol;
Write_Str ("The number of existing bodies is ");
Write_Int (Int (Contexts.Table (C).Bodies));
Write_Eol;
Write_Str ("The number of nonexisting units is ");
Write_Int (Int (Last_Unit - First_Unit_Id + 1) -
Int (Contexts.Table (C).Specs) -
Int (Contexts.Table (C).Bodies));
Write_Eol;
for U in First_Unit_Id .. Last_Unit loop
Output_Unit (C, U);
end loop;
Write_Eol;
else
Write_Str ("This Context is closed");
Write_Eol;
end if;
end Print_Units;
--------------------
-- Register_Units --
--------------------
procedure Register_Units (Set_First_New_Unit : Boolean := False) is
Cont : constant Context_Id := Get_Current_Cont;
Current_Unit : Unit_Id;
Include_Unit : Boolean := False;
Store_First_Unit : Boolean := Set_First_New_Unit;
begin
First_New_Unit := Nil_Unit;
for N_Unit in Main_Unit .. Lib.Last_Unit loop
if Present (Lib.Cunit (N_Unit)) then
Namet.Get_Decoded_Name_String (Lib.Unit_Name (N_Unit));
Set_Norm_Ada_Name_String_With_Check (N_Unit, Include_Unit);
if Include_Unit then
Current_Unit := Name_Find (Cont);
if No (Current_Unit) then
Current_Unit := Set_Unit (Cont, N_Unit);
if Store_First_Unit then
First_New_Unit := Last_Unit;
Store_First_Unit := False;
end if;
end if;
Store_Tree_For_Unit (Cont, Current_Unit, N_Unit);
end if;
end if;
end loop;
end Register_Units;
begin
-- Initializing the top node cache
Reset_Cache;
end A4G.Contt.UT;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Form_Demo --
-- --
-- S P E C --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998,2003 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control
-- $Revision: 1.10 $
-- Binding Version 01.00
------------------------------------------------------------------------------
package Sample.Form_Demo is
procedure Demo;
end Sample.Form_Demo;
|
with Ada.Unchecked_Deallocation;
with PB_Support.IO;
with PB_Support.Internal;
package body Conformance.Conformance is
package Jspb_Encoding_Config_IO is
new PB_Support.IO.Message_IO
(Conformance.Jspb_Encoding_Config,
Conformance.Jspb_Encoding_Config_Vector, Conformance.Append);
type Integer_Test_Category is range 0 .. 5
with Size => Conformance.Test_Category'Size;
package Test_Category_IO is
new PB_Support.IO.Enum_IO
(Conformance.Test_Category, Integer_Test_Category,
Conformance.Test_Category_Vectors);
type Integer_Wire_Format is range 0 .. 4
with Size => Conformance.Wire_Format'Size;
package Wire_Format_IO is
new PB_Support.IO.Enum_IO
(Conformance.Wire_Format, Integer_Wire_Format,
Conformance.Wire_Format_Vectors);
function Length (Self : Failure_Set_Vector) return Natural is
begin
return Self.Length;
end Length;
procedure Clear (Self : in out Failure_Set_Vector) is
begin
Self.Length := 0;
end Clear;
procedure Free is new Ada.Unchecked_Deallocation
(Failure_Set_Array, Failure_Set_Array_Access);
procedure Append (Self : in out Failure_Set_Vector; V : Failure_Set) is
Init_Length : constant Positive :=
Positive'Max (1, 256 / Failure_Set'Size);
begin
if Self.Length = 0 then
Self.Data := new Failure_Set_Array (1 .. Init_Length);
elsif Self.Length = Self.Data'Last then
Self.Data :=
new Failure_Set_Array'
(Self.Data.all & Failure_Set_Array'(1 .. Self.Length => <>));
end if;
Self.Length := Self.Length + 1;
Self.Data (Self.Length) := V;
end Append;
overriding procedure Adjust (Self : in out Failure_Set_Vector) is
begin
if Self.Length > 0 then
Self.Data := new Failure_Set_Array'(Self.Data (1 .. Self.Length));
end if;
end Adjust;
overriding procedure Finalize (Self : in out Failure_Set_Vector) is
begin
if Self.Data /= null then
Free (Self.Data);
end if;
end Finalize;
not overriding function Get_Failure_Set_Variable_Reference
(Self : aliased in out Failure_Set_Vector;
Index : Positive)
return Failure_Set_Variable_Reference is
begin
return (Element => Self.Data (Index)'Access);
end Get_Failure_Set_Variable_Reference;
not overriding function Get_Failure_Set_Constant_Reference
(Self : aliased Failure_Set_Vector;
Index : Positive)
return Failure_Set_Constant_Reference is
begin
return (Element => Self.Data (Index)'Access);
end Get_Failure_Set_Constant_Reference;
procedure Read_Failure_Set
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : out Failure_Set) is
Key : aliased PB_Support.IO.Key;
begin
while PB_Support.IO.Read_Key (Stream, Key'Access) loop
case Key.Field is
when 1 =>
PB_Support.IO.Read_Vector (Stream, Key.Encoding, V.Failure);
when others =>
PB_Support.IO.Unknown_Field (Stream, Key.Encoding);
end case;
end loop;
end Read_Failure_Set;
procedure Write_Failure_Set
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : Failure_Set) is
begin
if Stream.all not in PB_Support.Internal.Stream then
declare
WS : aliased PB_Support.Internal.Stream (Stream);
begin
Write_Failure_Set (WS'Access, V);
return;
end;
end if;
declare
WS : PB_Support.Internal.Stream renames
PB_Support.Internal.Stream (Stream.all);
begin
WS.Start_Message;
WS.Write (1, V.Failure);
if WS.End_Message then
Write_Failure_Set (WS'Access, V);
end if;
end;
end Write_Failure_Set;
function Length (Self : Conformance_Request_Vector) return Natural is
begin
return Self.Length;
end Length;
procedure Clear (Self : in out Conformance_Request_Vector) is
begin
Self.Length := 0;
end Clear;
procedure Free is new Ada.Unchecked_Deallocation
(Conformance_Request_Array, Conformance_Request_Array_Access);
procedure Append
(Self : in out Conformance_Request_Vector;
V : Conformance_Request) is
Init_Length : constant Positive :=
Positive'Max (1, 256 / Conformance_Request'Size);
begin
if Self.Length = 0 then
Self.Data := new Conformance_Request_Array (1 .. Init_Length);
elsif Self.Length = Self.Data'Last then
Self.Data :=
new Conformance_Request_Array'
(Self.Data.all
& Conformance_Request_Array'(1 .. Self.Length => <>));
end if;
Self.Length := Self.Length + 1;
Self.Data (Self.Length) := V;
end Append;
overriding procedure Adjust (Self : in out Conformance_Request_Vector) is
begin
if Self.Length > 0 then
Self.Data :=
new Conformance_Request_Array'(Self.Data (1 .. Self.Length));
end if;
end Adjust;
overriding procedure Finalize (Self : in out Conformance_Request_Vector) is
begin
if Self.Data /= null then
Free (Self.Data);
end if;
end Finalize;
not overriding function Get_Conformance_Request_Variable_Reference
(Self : aliased in out Conformance_Request_Vector;
Index : Positive)
return Conformance_Request_Variable_Reference is
begin
return (Element => Self.Data (Index)'Access);
end Get_Conformance_Request_Variable_Reference;
not overriding function Get_Conformance_Request_Constant_Reference
(Self : aliased Conformance_Request_Vector;
Index : Positive)
return Conformance_Request_Constant_Reference is
begin
return (Element => Self.Data (Index)'Access);
end Get_Conformance_Request_Constant_Reference;
procedure Read_Conformance_Request
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : out Conformance_Request) is
Key : aliased PB_Support.IO.Key;
begin
while PB_Support.IO.Read_Key (Stream, Key'Access) loop
case Key.Field is
when 1 =>
if V.Variant.Payload /= Protobuf_Payload_Kind then
V.Variant := (Protobuf_Payload_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Protobuf_Payload);
when 2 =>
if V.Variant.Payload /= Json_Payload_Kind then
V.Variant := (Json_Payload_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Json_Payload);
when 7 =>
if V.Variant.Payload /= Jspb_Payload_Kind then
V.Variant := (Jspb_Payload_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Jspb_Payload);
when 8 =>
if V.Variant.Payload /= Text_Payload_Kind then
V.Variant := (Text_Payload_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Text_Payload);
when 3 =>
Wire_Format_IO.Read
(Stream, Key.Encoding, V.Requested_Output_Format);
when 4 =>
PB_Support.IO.Read (Stream, Key.Encoding, V.Message_Type);
when 5 =>
Test_Category_IO.Read (Stream, Key.Encoding, V.Test_Category);
when 6 =>
if not V.Jspb_Encoding_Options.Is_Set then
V.Jspb_Encoding_Options := (True, others => <>);
end if;
Jspb_Encoding_Config_IO.Read
(Stream, Key.Encoding, V.Jspb_Encoding_Options.Value);
when 9 =>
PB_Support.IO.Read
(Stream, Key.Encoding, V.Print_Unknown_Fields);
when others =>
PB_Support.IO.Unknown_Field (Stream, Key.Encoding);
end case;
end loop;
end Read_Conformance_Request;
procedure Write_Conformance_Request
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : Conformance_Request) is
begin
if Stream.all not in PB_Support.Internal.Stream then
declare
WS : aliased PB_Support.Internal.Stream (Stream);
begin
Write_Conformance_Request (WS'Access, V);
return;
end;
end if;
declare
WS : PB_Support.Internal.Stream renames
PB_Support.Internal.Stream (Stream.all);
begin
WS.Start_Message;
Wire_Format_IO.Write_Option
(WS, 3, V.Requested_Output_Format, Conformance.UNSPECIFIED);
WS.Write_Option (4, V.Message_Type);
Test_Category_IO.Write_Option
(WS, 5, V.Test_Category, Conformance.UNSPECIFIED_TEST);
if V.Jspb_Encoding_Options.Is_Set then
WS.Write_Key ((6, PB_Support.Length_Delimited));
Conformance.Jspb_Encoding_Config'Write
(Stream, V.Jspb_Encoding_Options.Value);
end if;
WS.Write_Option (9, V.Print_Unknown_Fields, False);
case V.Variant.Payload is
when Protobuf_Payload_Kind =>
WS.Write (1, V.Variant.Protobuf_Payload);
when Json_Payload_Kind =>
WS.Write (2, V.Variant.Json_Payload);
when Jspb_Payload_Kind =>
WS.Write (7, V.Variant.Jspb_Payload);
when Text_Payload_Kind =>
WS.Write (8, V.Variant.Text_Payload);
when Payload_Not_Set =>
null;
end case;
if WS.End_Message then
Write_Conformance_Request (WS'Access, V);
end if;
end;
end Write_Conformance_Request;
function Length (Self : Conformance_Response_Vector) return Natural is
begin
return Self.Length;
end Length;
procedure Clear (Self : in out Conformance_Response_Vector) is
begin
Self.Length := 0;
end Clear;
procedure Free is new Ada.Unchecked_Deallocation
(Conformance_Response_Array, Conformance_Response_Array_Access);
procedure Append
(Self : in out Conformance_Response_Vector;
V : Conformance_Response) is
Init_Length : constant Positive :=
Positive'Max (1, 256 / Conformance_Response'Size);
begin
if Self.Length = 0 then
Self.Data := new Conformance_Response_Array (1 .. Init_Length);
elsif Self.Length = Self.Data'Last then
Self.Data :=
new Conformance_Response_Array'
(Self.Data.all
& Conformance_Response_Array'(1 .. Self.Length => <>));
end if;
Self.Length := Self.Length + 1;
Self.Data (Self.Length) := V;
end Append;
overriding procedure Adjust (Self : in out Conformance_Response_Vector) is
begin
if Self.Length > 0 then
Self.Data :=
new Conformance_Response_Array'(Self.Data (1 .. Self.Length));
end if;
end Adjust;
overriding procedure Finalize (Self : in out Conformance_Response_Vector) is
begin
if Self.Data /= null then
Free (Self.Data);
end if;
end Finalize;
not overriding function Get_Conformance_Response_Variable_Reference
(Self : aliased in out Conformance_Response_Vector;
Index : Positive)
return Conformance_Response_Variable_Reference is
begin
return (Element => Self.Data (Index)'Access);
end Get_Conformance_Response_Variable_Reference;
not overriding function Get_Conformance_Response_Constant_Reference
(Self : aliased Conformance_Response_Vector;
Index : Positive)
return Conformance_Response_Constant_Reference is
begin
return (Element => Self.Data (Index)'Access);
end Get_Conformance_Response_Constant_Reference;
procedure Read_Conformance_Response
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : out Conformance_Response) is
Key : aliased PB_Support.IO.Key;
begin
while PB_Support.IO.Read_Key (Stream, Key'Access) loop
case Key.Field is
when 1 =>
if V.Variant.Result /= Parse_Error_Kind then
V.Variant := (Parse_Error_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Parse_Error);
when 6 =>
if V.Variant.Result /= Serialize_Error_Kind then
V.Variant := (Serialize_Error_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Serialize_Error);
when 2 =>
if V.Variant.Result /= Runtime_Error_Kind then
V.Variant := (Runtime_Error_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Runtime_Error);
when 3 =>
if V.Variant.Result /= Protobuf_Payload_Kind then
V.Variant := (Protobuf_Payload_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Protobuf_Payload);
when 4 =>
if V.Variant.Result /= Json_Payload_Kind then
V.Variant := (Json_Payload_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Json_Payload);
when 5 =>
if V.Variant.Result /= Skipped_Kind then
V.Variant := (Skipped_Kind, others => <>);
end if;
PB_Support.IO.Read (Stream, Key.Encoding, V.Variant.Skipped);
when 7 =>
if V.Variant.Result /= Jspb_Payload_Kind then
V.Variant := (Jspb_Payload_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Jspb_Payload);
when 8 =>
if V.Variant.Result /= Text_Payload_Kind then
V.Variant := (Text_Payload_Kind, others => <>);
end if;
PB_Support.IO.Read
(Stream, Key.Encoding, V.Variant.Text_Payload);
when others =>
PB_Support.IO.Unknown_Field (Stream, Key.Encoding);
end case;
end loop;
end Read_Conformance_Response;
procedure Write_Conformance_Response
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : Conformance_Response) is
begin
if Stream.all not in PB_Support.Internal.Stream then
declare
WS : aliased PB_Support.Internal.Stream (Stream);
begin
Write_Conformance_Response (WS'Access, V);
return;
end;
end if;
declare
WS : PB_Support.Internal.Stream renames
PB_Support.Internal.Stream (Stream.all);
begin
WS.Start_Message;
case V.Variant.Result is
when Parse_Error_Kind =>
WS.Write (1, V.Variant.Parse_Error);
when Serialize_Error_Kind =>
WS.Write (6, V.Variant.Serialize_Error);
when Runtime_Error_Kind =>
WS.Write (2, V.Variant.Runtime_Error);
when Protobuf_Payload_Kind =>
WS.Write (3, V.Variant.Protobuf_Payload);
when Json_Payload_Kind =>
WS.Write (4, V.Variant.Json_Payload);
when Skipped_Kind =>
WS.Write (5, V.Variant.Skipped);
when Jspb_Payload_Kind =>
WS.Write (7, V.Variant.Jspb_Payload);
when Text_Payload_Kind =>
WS.Write (8, V.Variant.Text_Payload);
when Result_Not_Set =>
null;
end case;
if WS.End_Message then
Write_Conformance_Response (WS'Access, V);
end if;
end;
end Write_Conformance_Response;
function Length (Self : Jspb_Encoding_Config_Vector) return Natural is
begin
return Self.Length;
end Length;
procedure Clear (Self : in out Jspb_Encoding_Config_Vector) is
begin
Self.Length := 0;
end Clear;
procedure Free is new Ada.Unchecked_Deallocation
(Jspb_Encoding_Config_Array, Jspb_Encoding_Config_Array_Access);
procedure Append
(Self : in out Jspb_Encoding_Config_Vector;
V : Jspb_Encoding_Config) is
Init_Length : constant Positive :=
Positive'Max (1, 256 / Jspb_Encoding_Config'Size);
begin
if Self.Length = 0 then
Self.Data := new Jspb_Encoding_Config_Array (1 .. Init_Length);
elsif Self.Length = Self.Data'Last then
Self.Data :=
new Jspb_Encoding_Config_Array'
(Self.Data.all
& Jspb_Encoding_Config_Array'(1 .. Self.Length => <>));
end if;
Self.Length := Self.Length + 1;
Self.Data (Self.Length) := V;
end Append;
overriding procedure Adjust (Self : in out Jspb_Encoding_Config_Vector) is
begin
if Self.Length > 0 then
Self.Data :=
new Jspb_Encoding_Config_Array'(Self.Data (1 .. Self.Length));
end if;
end Adjust;
overriding procedure Finalize (Self : in out Jspb_Encoding_Config_Vector) is
begin
if Self.Data /= null then
Free (Self.Data);
end if;
end Finalize;
not overriding function Get_Jspb_Encoding_Config_Variable_Reference
(Self : aliased in out Jspb_Encoding_Config_Vector;
Index : Positive)
return Jspb_Encoding_Config_Variable_Reference is
begin
return (Element => Self.Data (Index)'Access);
end Get_Jspb_Encoding_Config_Variable_Reference;
not overriding function Get_Jspb_Encoding_Config_Constant_Reference
(Self : aliased Jspb_Encoding_Config_Vector;
Index : Positive)
return Jspb_Encoding_Config_Constant_Reference is
begin
return (Element => Self.Data (Index)'Access);
end Get_Jspb_Encoding_Config_Constant_Reference;
procedure Read_Jspb_Encoding_Config
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : out Jspb_Encoding_Config) is
Key : aliased PB_Support.IO.Key;
begin
while PB_Support.IO.Read_Key (Stream, Key'Access) loop
case Key.Field is
when 1 =>
PB_Support.IO.Read
(Stream, Key.Encoding, V.Use_Jspb_Array_Any_Format);
when others =>
PB_Support.IO.Unknown_Field (Stream, Key.Encoding);
end case;
end loop;
end Read_Jspb_Encoding_Config;
procedure Write_Jspb_Encoding_Config
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : Jspb_Encoding_Config) is
begin
if Stream.all not in PB_Support.Internal.Stream then
declare
WS : aliased PB_Support.Internal.Stream (Stream);
begin
Write_Jspb_Encoding_Config (WS'Access, V);
return;
end;
end if;
declare
WS : PB_Support.Internal.Stream renames
PB_Support.Internal.Stream (Stream.all);
begin
WS.Start_Message;
WS.Write_Option (1, V.Use_Jspb_Array_Any_Format, False);
if WS.End_Message then
Write_Jspb_Encoding_Config (WS'Access, V);
end if;
end;
end Write_Jspb_Encoding_Config;
end Conformance.Conformance; |
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . B O U N D E D --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Preconditions in this unit are meant for analysis only, not for run-time
-- checking, so that the expected exceptions are raised. This is enforced by
-- setting the corresponding assertion policy to Ignore.
pragma Assertion_Policy (Pre => Ignore);
with Ada.Strings.Maps;
with Ada.Strings.Superbounded;
package Ada.Strings.Bounded is
pragma Preelaborate;
generic
Max : Positive;
-- Maximum length of a Bounded_String
package Generic_Bounded_Length with
Initial_Condition => Length (Null_Bounded_String) = 0
is
Max_Length : constant Positive := Max;
type Bounded_String is private;
pragma Preelaborable_Initialization (Bounded_String);
Null_Bounded_String : constant Bounded_String;
subtype Length_Range is Natural range 0 .. Max_Length;
function Length (Source : Bounded_String) return Length_Range with
Global => null;
--------------------------------------------------------
-- Conversion, Concatenation, and Selection Functions --
--------------------------------------------------------
function To_Bounded_String
(Source : String;
Drop : Truncation := Error) return Bounded_String
with
Pre => (if Source'Length > Max_Length then Drop /= Error),
Post =>
Length (To_Bounded_String'Result)
= Natural'Min (Max_Length, Source'Length),
Global => null;
function To_String (Source : Bounded_String) return String with
Post => To_String'Result'Length = Length (Source),
Global => null;
procedure Set_Bounded_String
(Target : out Bounded_String;
Source : String;
Drop : Truncation := Error)
with
Pre => (if Source'Length > Max_Length then Drop /= Error),
Post => Length (Target) = Natural'Min (Max_Length, Source'Length),
Global => null;
pragma Ada_05 (Set_Bounded_String);
function Append
(Left : Bounded_String;
Right : Bounded_String;
Drop : Truncation := Error) return Bounded_String
with
Pre =>
(if Length (Left) > Max_Length - Length (Right)
then Drop /= Error),
Post =>
Length (Append'Result)
= Natural'Min (Max_Length, Length (Left) + Length (Right)),
Global => null;
function Append
(Left : Bounded_String;
Right : String;
Drop : Truncation := Error) return Bounded_String
with
Pre =>
(if Right'Length > Max_Length - Length (Left)
then Drop /= Error),
Post =>
Length (Append'Result)
= Natural'Min (Max_Length, Length (Left) + Right'Length),
Global => null;
function Append
(Left : String;
Right : Bounded_String;
Drop : Truncation := Error) return Bounded_String
with
Pre =>
(if Left'Length > Max_Length - Length (Right)
then Drop /= Error),
Post =>
Length (Append'Result)
= Natural'Min (Max_Length, Left'Length + Length (Right)),
Global => null;
function Append
(Left : Bounded_String;
Right : Character;
Drop : Truncation := Error) return Bounded_String
with
Pre => (if Length (Left) = Max_Length then Drop /= Error),
Post =>
Length (Append'Result)
= Natural'Min (Max_Length, Length (Left) + 1),
Global => null;
function Append
(Left : Character;
Right : Bounded_String;
Drop : Truncation := Error) return Bounded_String
with
Pre => (if Length (Right) = Max_Length then Drop /= Error),
Post =>
Length (Append'Result)
= Natural'Min (Max_Length, 1 + Length (Right)),
Global => null;
procedure Append
(Source : in out Bounded_String;
New_Item : Bounded_String;
Drop : Truncation := Error)
with
Pre =>
(if Length (Source) > Max_Length - Length (New_Item)
then Drop /= Error),
Post =>
Length (Source)
= Natural'Min (Max_Length, Length (Source)'Old + Length (New_Item)),
Global => null;
procedure Append
(Source : in out Bounded_String;
New_Item : String;
Drop : Truncation := Error)
with
Pre =>
(if New_Item'Length > Max_Length - Length (Source)
then Drop /= Error),
Post =>
Length (Source)
= Natural'Min (Max_Length, Length (Source)'Old + New_Item'Length),
Global => null;
procedure Append
(Source : in out Bounded_String;
New_Item : Character;
Drop : Truncation := Error)
with
Pre => (if Length (Source) = Max_Length then Drop /= Error),
Post =>
Length (Source)
= Natural'Min (Max_Length, Length (Source)'Old + 1),
Global => null;
function "&"
(Left : Bounded_String;
Right : Bounded_String) return Bounded_String
with
Pre => Length (Left) <= Max_Length - Length (Right),
Post => Length ("&"'Result) = Length (Left) + Length (Right),
Global => null;
function "&"
(Left : Bounded_String;
Right : String) return Bounded_String
with
Pre => Right'Length <= Max_Length - Length (Left),
Post => Length ("&"'Result) = Length (Left) + Right'Length,
Global => null;
function "&"
(Left : String;
Right : Bounded_String) return Bounded_String
with
Pre => Left'Length <= Max_Length - Length (Right),
Post => Length ("&"'Result) = Left'Length + Length (Right),
Global => null;
function "&"
(Left : Bounded_String;
Right : Character) return Bounded_String
with
Pre => Length (Left) < Max_Length,
Post => Length ("&"'Result) = Length (Left) + 1,
Global => null;
function "&"
(Left : Character;
Right : Bounded_String) return Bounded_String
with
Pre => Length (Right) < Max_Length,
Post => Length ("&"'Result) = 1 + Length (Right),
Global => null;
function Element
(Source : Bounded_String;
Index : Positive) return Character
with
Pre => Index <= Length (Source),
Global => null;
procedure Replace_Element
(Source : in out Bounded_String;
Index : Positive;
By : Character)
with
Pre => Index <= Length (Source),
Post => Length (Source) = Length (Source)'Old,
Global => null;
function Slice
(Source : Bounded_String;
Low : Positive;
High : Natural) return String
with
Pre => Low - 1 <= Length (Source) and then High <= Length (Source),
Post => Slice'Result'Length = Natural'Max (0, High - Low + 1),
Global => null;
function Bounded_Slice
(Source : Bounded_String;
Low : Positive;
High : Natural) return Bounded_String
with
Pre => Low - 1 <= Length (Source) and then High <= Length (Source),
Post =>
Length (Bounded_Slice'Result) = Natural'Max (0, High - Low + 1),
Global => null;
pragma Ada_05 (Bounded_Slice);
procedure Bounded_Slice
(Source : Bounded_String;
Target : out Bounded_String;
Low : Positive;
High : Natural)
with
Pre => Low - 1 <= Length (Source) and then High <= Length (Source),
Post => Length (Target) = Natural'Max (0, High - Low + 1),
Global => null;
pragma Ada_05 (Bounded_Slice);
function "="
(Left : Bounded_String;
Right : Bounded_String) return Boolean
with
Global => null;
function "="
(Left : Bounded_String;
Right : String) return Boolean
with
Global => null;
function "="
(Left : String;
Right : Bounded_String) return Boolean
with
Global => null;
function "<"
(Left : Bounded_String;
Right : Bounded_String) return Boolean
with
Global => null;
function "<"
(Left : Bounded_String;
Right : String) return Boolean
with
Global => null;
function "<"
(Left : String;
Right : Bounded_String) return Boolean
with
Global => null;
function "<="
(Left : Bounded_String;
Right : Bounded_String) return Boolean
with
Global => null;
function "<="
(Left : Bounded_String;
Right : String) return Boolean
with
Global => null;
function "<="
(Left : String;
Right : Bounded_String) return Boolean
with
Global => null;
function ">"
(Left : Bounded_String;
Right : Bounded_String) return Boolean
with
Global => null;
function ">"
(Left : Bounded_String;
Right : String) return Boolean
with
Global => null;
function ">"
(Left : String;
Right : Bounded_String) return Boolean
with
Global => null;
function ">="
(Left : Bounded_String;
Right : Bounded_String) return Boolean
with
Global => null;
function ">="
(Left : Bounded_String;
Right : String) return Boolean
with
Global => null;
function ">="
(Left : String;
Right : Bounded_String) return Boolean
with
Global => null;
----------------------
-- Search Functions --
----------------------
function Index
(Source : Bounded_String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
with
Pre => Pattern'Length /= 0,
Global => null;
function Index
(Source : Bounded_String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural
with
Pre => Pattern'Length /= 0,
Global => null;
function Index
(Source : Bounded_String;
Set : Maps.Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
with
Global => null;
function Index
(Source : Bounded_String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
with
Pre =>
(if Length (Source) /= 0
then From <= Length (Source))
and then Pattern'Length /= 0,
Global => null;
pragma Ada_05 (Index);
function Index
(Source : Bounded_String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural
with
Pre =>
(if Length (Source) /= 0
then From <= Length (Source))
and then Pattern'Length /= 0,
Global => null;
pragma Ada_05 (Index);
function Index
(Source : Bounded_String;
Set : Maps.Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
with
Pre => (if Length (Source) /= 0 then From <= Length (Source)),
Global => null;
pragma Ada_05 (Index);
function Index_Non_Blank
(Source : Bounded_String;
Going : Direction := Forward) return Natural
with
Global => null;
function Index_Non_Blank
(Source : Bounded_String;
From : Positive;
Going : Direction := Forward) return Natural
with
Pre => (if Length (Source) /= 0 then From <= Length (Source)),
Global => null;
pragma Ada_05 (Index_Non_Blank);
function Count
(Source : Bounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
with
Pre => Pattern'Length /= 0,
Global => null;
function Count
(Source : Bounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping_Function) return Natural
with
Pre => Pattern'Length /= 0,
Global => null;
function Count
(Source : Bounded_String;
Set : Maps.Character_Set) return Natural
with
Global => null;
procedure Find_Token
(Source : Bounded_String;
Set : Maps.Character_Set;
From : Positive;
Test : Membership;
First : out Positive;
Last : out Natural)
with
Pre => (if Length (Source) /= 0 then From <= Length (Source)),
Global => null;
pragma Ada_2012 (Find_Token);
procedure Find_Token
(Source : Bounded_String;
Set : Maps.Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural)
with
Global => null;
------------------------------------
-- String Translation Subprograms --
------------------------------------
function Translate
(Source : Bounded_String;
Mapping : Maps.Character_Mapping) return Bounded_String
with
Post => Length (Translate'Result) = Length (Source),
Global => null;
procedure Translate
(Source : in out Bounded_String;
Mapping : Maps.Character_Mapping)
with
Post => Length (Source) = Length (Source)'Old,
Global => null;
function Translate
(Source : Bounded_String;
Mapping : Maps.Character_Mapping_Function) return Bounded_String
with
Post => Length (Translate'Result) = Length (Source),
Global => null;
procedure Translate
(Source : in out Bounded_String;
Mapping : Maps.Character_Mapping_Function)
with
Post => Length (Source) = Length (Source)'Old,
Global => null;
---------------------------------------
-- String Transformation Subprograms --
---------------------------------------
function Replace_Slice
(Source : Bounded_String;
Low : Positive;
High : Natural;
By : String;
Drop : Truncation := Error) return Bounded_String
with
Pre =>
Low - 1 <= Length (Source)
and then
(if Drop = Error
then (if High >= Low
then Low - 1
<= Max_Length - By'Length
- Natural'Max (Length (Source) - High, 0)
else Length (Source) <= Max_Length - By'Length)),
Contract_Cases =>
(High >= Low =>
Length (Replace_Slice'Result)
= Natural'Min
(Max_Length,
Low - 1 + By'Length + Natural'Max (Length (Source) - High,
0)),
others =>
Length (Replace_Slice'Result)
= Natural'Min (Max_Length, Length (Source) + By'Length)),
Global => null;
procedure Replace_Slice
(Source : in out Bounded_String;
Low : Positive;
High : Natural;
By : String;
Drop : Truncation := Error)
with
Pre =>
Low - 1 <= Length (Source)
and then
(if Drop = Error
then (if High >= Low
then Low - 1
<= Max_Length - By'Length
- Natural'Max (Length (Source) - High, 0)
else Length (Source) <= Max_Length - By'Length)),
Contract_Cases =>
(High >= Low =>
Length (Source)
= Natural'Min
(Max_Length,
Low - 1 + By'Length + Natural'Max (Length (Source)'Old - High,
0)),
others =>
Length (Source)
= Natural'Min (Max_Length, Length (Source)'Old + By'Length)),
Global => null;
function Insert
(Source : Bounded_String;
Before : Positive;
New_Item : String;
Drop : Truncation := Error) return Bounded_String
with
Pre =>
Before - 1 <= Length (Source)
and then (if New_Item'Length > Max_Length - Length (Source)
then Drop /= Error),
Post =>
Length (Insert'Result)
= Natural'Min (Max_Length, Length (Source) + New_Item'Length),
Global => null;
procedure Insert
(Source : in out Bounded_String;
Before : Positive;
New_Item : String;
Drop : Truncation := Error)
with
Pre =>
Before - 1 <= Length (Source)
and then (if New_Item'Length > Max_Length - Length (Source)
then Drop /= Error),
Post =>
Length (Source)
= Natural'Min (Max_Length, Length (Source)'Old + New_Item'Length),
Global => null;
function Overwrite
(Source : Bounded_String;
Position : Positive;
New_Item : String;
Drop : Truncation := Error) return Bounded_String
with
Pre =>
Position - 1 <= Length (Source)
and then (if New_Item'Length > Max_Length - (Position - 1)
then Drop /= Error),
Post =>
Length (Overwrite'Result)
= Natural'Max
(Length (Source),
Natural'Min (Max_Length, Position - 1 + New_Item'Length)),
Global => null;
procedure Overwrite
(Source : in out Bounded_String;
Position : Positive;
New_Item : String;
Drop : Truncation := Error)
with
Pre =>
Position - 1 <= Length (Source)
and then (if New_Item'Length > Max_Length - (Position - 1)
then Drop /= Error),
Post =>
Length (Source)
= Natural'Max
(Length (Source)'Old,
Natural'Min (Max_Length, Position - 1 + New_Item'Length)),
Global => null;
function Delete
(Source : Bounded_String;
From : Positive;
Through : Natural) return Bounded_String
with
Pre =>
(if Through <= From then From - 1 <= Length (Source)),
Contract_Cases =>
(Through >= From =>
Length (Delete'Result) = Length (Source) - (Through - From + 1),
others =>
Length (Delete'Result) = Length (Source)),
Global => null;
procedure Delete
(Source : in out Bounded_String;
From : Positive;
Through : Natural)
with
Pre =>
(if Through <= From then From - 1 <= Length (Source)),
Contract_Cases =>
(Through >= From =>
Length (Source) = Length (Source)'Old - (Through - From + 1),
others =>
Length (Source) = Length (Source)'Old),
Global => null;
---------------------------------
-- String Selector Subprograms --
---------------------------------
function Trim
(Source : Bounded_String;
Side : Trim_End) return Bounded_String
with
Post => Length (Trim'Result) <= Length (Source),
Global => null;
procedure Trim
(Source : in out Bounded_String;
Side : Trim_End)
with
Post => Length (Source) <= Length (Source)'Old,
Global => null;
function Trim
(Source : Bounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set) return Bounded_String
with
Post => Length (Trim'Result) <= Length (Source),
Global => null;
procedure Trim
(Source : in out Bounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set)
with
Post => Length (Source) <= Length (Source)'Old,
Global => null;
function Head
(Source : Bounded_String;
Count : Natural;
Pad : Character := Space;
Drop : Truncation := Error) return Bounded_String
with
Pre => (if Count > Max_Length then Drop /= Error),
Post => Length (Head'Result) = Natural'Min (Max_Length, Count),
Global => null;
procedure Head
(Source : in out Bounded_String;
Count : Natural;
Pad : Character := Space;
Drop : Truncation := Error)
with
Pre => (if Count > Max_Length then Drop /= Error),
Post => Length (Source) = Natural'Min (Max_Length, Count),
Global => null;
function Tail
(Source : Bounded_String;
Count : Natural;
Pad : Character := Space;
Drop : Truncation := Error) return Bounded_String
with
Pre => (if Count > Max_Length then Drop /= Error),
Post => Length (Tail'Result) = Natural'Min (Max_Length, Count),
Global => null;
procedure Tail
(Source : in out Bounded_String;
Count : Natural;
Pad : Character := Space;
Drop : Truncation := Error)
with
Pre => (if Count > Max_Length then Drop /= Error),
Post => Length (Source) = Natural'Min (Max_Length, Count),
Global => null;
------------------------------------
-- String Constructor Subprograms --
------------------------------------
function "*"
(Left : Natural;
Right : Character) return Bounded_String
with
Pre => Left <= Max_Length,
Post => Length ("*"'Result) = Left,
Global => null;
function "*"
(Left : Natural;
Right : String) return Bounded_String
with
Pre => (if Left /= 0 then Right'Length <= Max_Length / Left),
Post => Length ("*"'Result) = Left * Right'Length,
Global => null;
function "*"
(Left : Natural;
Right : Bounded_String) return Bounded_String
with
Pre => (if Left /= 0 then Length (Right) <= Max_Length / Left),
Post => Length ("*"'Result) = Left * Length (Right),
Global => null;
function Replicate
(Count : Natural;
Item : Character;
Drop : Truncation := Error) return Bounded_String
with
Pre => (if Count > Max_Length then Drop /= Error),
Post =>
Length (Replicate'Result)
= Natural'Min (Max_Length, Count),
Global => null;
function Replicate
(Count : Natural;
Item : String;
Drop : Truncation := Error) return Bounded_String
with
Pre =>
(if Item'Length /= 0
and then Count > Max_Length / Item'Length
then Drop /= Error),
Post =>
Length (Replicate'Result)
= Natural'Min (Max_Length, Count * Item'Length),
Global => null;
function Replicate
(Count : Natural;
Item : Bounded_String;
Drop : Truncation := Error) return Bounded_String
with
Pre =>
(if Length (Item) /= 0
and then Count > Max_Length / Length (Item)
then Drop /= Error),
Post =>
Length (Replicate'Result)
= Natural'Min (Max_Length, Count * Length (Item)),
Global => null;
private
-- Most of the implementation is in the separate non generic package
-- Ada.Strings.Superbounded. Type Bounded_String is derived from type
-- Superbounded.Super_String with the maximum length constraint. In
-- almost all cases, the routines in Superbounded can be called with
-- no requirement to pass the maximum length explicitly, since there
-- is at least one Bounded_String argument from which the maximum
-- length can be obtained. For all such routines, the implementation
-- in this private part is simply a renaming of the corresponding
-- routine in the superbounded 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_String is new Superbounded.Super_String (Max_Length);
-- Deriving Bounded_String from Superbounded.Super_String is the
-- real trick, it ensures that the type Bounded_String declared in
-- the generic instantiation is compatible with the Super_String
-- type declared in the Superbounded package.
function From_String (Source : String) return Bounded_String;
-- Private routine used only by Stream_Convert
pragma Stream_Convert (Bounded_String, From_String, To_String);
-- Provide stream routines without dragging in Ada.Streams
Null_Bounded_String : constant Bounded_String :=
(Max_Length => Max_Length,
Current_Length => 0,
Data =>
(1 .. Max_Length => ASCII.NUL));
pragma Inline (To_Bounded_String);
procedure Set_Bounded_String
(Target : out Bounded_String;
Source : String;
Drop : Truncation := Error)
renames Set_Super_String;
function Length
(Source : Bounded_String) return Length_Range
renames Super_Length;
function To_String
(Source : Bounded_String) return String
renames Super_To_String;
function Append
(Left : Bounded_String;
Right : Bounded_String;
Drop : Truncation := Error) return Bounded_String
renames Super_Append;
function Append
(Left : Bounded_String;
Right : String;
Drop : Truncation := Error) return Bounded_String
renames Super_Append;
function Append
(Left : String;
Right : Bounded_String;
Drop : Truncation := Error) return Bounded_String
renames Super_Append;
function Append
(Left : Bounded_String;
Right : Character;
Drop : Truncation := Error) return Bounded_String
renames Super_Append;
function Append
(Left : Character;
Right : Bounded_String;
Drop : Truncation := Error) return Bounded_String
renames Super_Append;
procedure Append
(Source : in out Bounded_String;
New_Item : Bounded_String;
Drop : Truncation := Error)
renames Super_Append;
procedure Append
(Source : in out Bounded_String;
New_Item : String;
Drop : Truncation := Error)
renames Super_Append;
procedure Append
(Source : in out Bounded_String;
New_Item : Character;
Drop : Truncation := Error)
renames Super_Append;
function "&"
(Left : Bounded_String;
Right : Bounded_String) return Bounded_String
renames Concat;
function "&"
(Left : Bounded_String;
Right : String) return Bounded_String
renames Concat;
function "&"
(Left : String;
Right : Bounded_String) return Bounded_String
renames Concat;
function "&"
(Left : Bounded_String;
Right : Character) return Bounded_String
renames Concat;
function "&"
(Left : Character;
Right : Bounded_String) return Bounded_String
renames Concat;
function Element
(Source : Bounded_String;
Index : Positive) return Character
renames Super_Element;
procedure Replace_Element
(Source : in out Bounded_String;
Index : Positive;
By : Character)
renames Super_Replace_Element;
function Slice
(Source : Bounded_String;
Low : Positive;
High : Natural) return String
renames Super_Slice;
function Bounded_Slice
(Source : Bounded_String;
Low : Positive;
High : Natural) return Bounded_String
renames Super_Slice;
procedure Bounded_Slice
(Source : Bounded_String;
Target : out Bounded_String;
Low : Positive;
High : Natural)
renames Super_Slice;
overriding function "="
(Left : Bounded_String;
Right : Bounded_String) return Boolean
renames Equal;
function "="
(Left : Bounded_String;
Right : String) return Boolean
renames Equal;
function "="
(Left : String;
Right : Bounded_String) return Boolean
renames Equal;
function "<"
(Left : Bounded_String;
Right : Bounded_String) return Boolean
renames Less;
function "<"
(Left : Bounded_String;
Right : String) return Boolean
renames Less;
function "<"
(Left : String;
Right : Bounded_String) return Boolean
renames Less;
function "<="
(Left : Bounded_String;
Right : Bounded_String) return Boolean
renames Less_Or_Equal;
function "<="
(Left : Bounded_String;
Right : String) return Boolean
renames Less_Or_Equal;
function "<="
(Left : String;
Right : Bounded_String) return Boolean
renames Less_Or_Equal;
function ">"
(Left : Bounded_String;
Right : Bounded_String) return Boolean
renames Greater;
function ">"
(Left : Bounded_String;
Right : String) return Boolean
renames Greater;
function ">"
(Left : String;
Right : Bounded_String) return Boolean
renames Greater;
function ">="
(Left : Bounded_String;
Right : Bounded_String) return Boolean
renames Greater_Or_Equal;
function ">="
(Left : Bounded_String;
Right : String) return Boolean
renames Greater_Or_Equal;
function ">="
(Left : String;
Right : Bounded_String) return Boolean
renames Greater_Or_Equal;
function Index
(Source : Bounded_String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
renames Super_Index;
function Index
(Source : Bounded_String;
Pattern : String;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural
renames Super_Index;
function Index
(Source : Bounded_String;
Set : Maps.Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
renames Super_Index;
function Index
(Source : Bounded_String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
renames Super_Index;
function Index
(Source : Bounded_String;
Pattern : String;
From : Positive;
Going : Direction := Forward;
Mapping : Maps.Character_Mapping_Function) return Natural
renames Super_Index;
function Index
(Source : Bounded_String;
Set : Maps.Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
renames Super_Index;
function Index_Non_Blank
(Source : Bounded_String;
Going : Direction := Forward) return Natural
renames Super_Index_Non_Blank;
function Index_Non_Blank
(Source : Bounded_String;
From : Positive;
Going : Direction := Forward) return Natural
renames Super_Index_Non_Blank;
function Count
(Source : Bounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping := Maps.Identity) return Natural
renames Super_Count;
function Count
(Source : Bounded_String;
Pattern : String;
Mapping : Maps.Character_Mapping_Function) return Natural
renames Super_Count;
function Count
(Source : Bounded_String;
Set : Maps.Character_Set) return Natural
renames Super_Count;
procedure Find_Token
(Source : Bounded_String;
Set : Maps.Character_Set;
From : Positive;
Test : Membership;
First : out Positive;
Last : out Natural)
renames Super_Find_Token;
procedure Find_Token
(Source : Bounded_String;
Set : Maps.Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural)
renames Super_Find_Token;
function Translate
(Source : Bounded_String;
Mapping : Maps.Character_Mapping) return Bounded_String
renames Super_Translate;
procedure Translate
(Source : in out Bounded_String;
Mapping : Maps.Character_Mapping)
renames Super_Translate;
function Translate
(Source : Bounded_String;
Mapping : Maps.Character_Mapping_Function) return Bounded_String
renames Super_Translate;
procedure Translate
(Source : in out Bounded_String;
Mapping : Maps.Character_Mapping_Function)
renames Super_Translate;
function Replace_Slice
(Source : Bounded_String;
Low : Positive;
High : Natural;
By : String;
Drop : Truncation := Error) return Bounded_String
renames Super_Replace_Slice;
procedure Replace_Slice
(Source : in out Bounded_String;
Low : Positive;
High : Natural;
By : String;
Drop : Truncation := Error)
renames Super_Replace_Slice;
function Insert
(Source : Bounded_String;
Before : Positive;
New_Item : String;
Drop : Truncation := Error) return Bounded_String
renames Super_Insert;
procedure Insert
(Source : in out Bounded_String;
Before : Positive;
New_Item : String;
Drop : Truncation := Error)
renames Super_Insert;
function Overwrite
(Source : Bounded_String;
Position : Positive;
New_Item : String;
Drop : Truncation := Error) return Bounded_String
renames Super_Overwrite;
procedure Overwrite
(Source : in out Bounded_String;
Position : Positive;
New_Item : String;
Drop : Truncation := Error)
renames Super_Overwrite;
function Delete
(Source : Bounded_String;
From : Positive;
Through : Natural) return Bounded_String
renames Super_Delete;
procedure Delete
(Source : in out Bounded_String;
From : Positive;
Through : Natural)
renames Super_Delete;
function Trim
(Source : Bounded_String;
Side : Trim_End) return Bounded_String
renames Super_Trim;
procedure Trim
(Source : in out Bounded_String;
Side : Trim_End)
renames Super_Trim;
function Trim
(Source : Bounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set) return Bounded_String
renames Super_Trim;
procedure Trim
(Source : in out Bounded_String;
Left : Maps.Character_Set;
Right : Maps.Character_Set)
renames Super_Trim;
function Head
(Source : Bounded_String;
Count : Natural;
Pad : Character := Space;
Drop : Truncation := Error) return Bounded_String
renames Super_Head;
procedure Head
(Source : in out Bounded_String;
Count : Natural;
Pad : Character := Space;
Drop : Truncation := Error)
renames Super_Head;
function Tail
(Source : Bounded_String;
Count : Natural;
Pad : Character := Space;
Drop : Truncation := Error) return Bounded_String
renames Super_Tail;
procedure Tail
(Source : in out Bounded_String;
Count : Natural;
Pad : Character := Space;
Drop : Truncation := Error)
renames Super_Tail;
function "*"
(Left : Natural;
Right : Bounded_String) return Bounded_String
renames Times;
function Replicate
(Count : Natural;
Item : Bounded_String;
Drop : Truncation := Error) return Bounded_String
renames Super_Replicate;
end Generic_Bounded_Length;
end Ada.Strings.Bounded;
|
with Ada.Numerics.Discrete_Random;
with STM32.Board; use STM32.Board;
with Gfx; use Gfx;
with Stack; use Stack;
package body Instruction is
function Fetch (Cpu : Chip8) return Opcode is
Op : Opcode;
begin
Op := Word(Cpu.Mem(Cpu.PC));
Op := Shift_Left(Op, 8);
Op := Op + Word(Cpu.Mem(Cpu.PC + 1));
return Op;
end Fetch;
procedure Execute (Cpu : in out Chip8; Op : Opcode) is
I : Integer;
begin
I := Integer(Shift_Right(Op, 12));
Instr_Handlers(I)(Cpu, Op);
if Cpu.Delay_Timer /= 0 then
Cpu.Delay_Timer := Cpu.Delay_Timer - 1;
end if;
if Cpu.Sound_Timer /= 0 then
Cpu.Sound_Timer := Cpu.Sound_Timer - 1;
end if;
end Execute;
procedure Handler_0 (Cpu : in out Chip8; Op : Opcode) is
N : constant Address := Op mod 16#1000#;
begin
case Op is
when 16#00E0# =>
-- clear the screen
Cpu.Screen := (others => (others => False));
Clear_Layer(2);
Display.Update_Layer(2, True);
when 16#00EE# =>
Cpu.PC := Pop_Stack(Cpu.Stack);
when others =>
Cpu.PC := N;
return;
end case;
Cpu.PC := Cpu.PC + 2;
end Handler_0;
procedure Handler_1 (Cpu : in out Chip8; Op : Opcode) is
N : constant Address := Op mod 16#1000#;
begin
Cpu.PC := N;
end Handler_1;
procedure Handler_2 (Cpu : in out Chip8; Op : Opcode) is
N : constant Address := Op mod 16#1000#;
begin
Push_Stack(Cpu.Stack, Cpu.PC);
Cpu.PC := N;
end Handler_2;
procedure Handler_3 (Cpu : in out Chip8; Op : Opcode) is
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
N : constant Byte := Byte(Op mod 16#100#);
begin
if Cpu.Regs(X) = N then
Cpu.PC := Cpu.PC + 2;
end if;
Cpu.PC := Cpu.PC + 2;
end Handler_3;
procedure Handler_4 (Cpu : in out Chip8; Op : Opcode) is
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
N : constant Byte := Byte(Op mod 16#100#);
begin
if Cpu.Regs(X) /= N then
Cpu.PC := Cpu.PC + 2;
end if;
Cpu.PC := Cpu.PC + 2;
end Handler_4;
procedure Handler_5 (Cpu : in out Chip8; Op : Opcode) is
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
Y : constant Integer := Integer(Shift_Right(Op, 4) and 16#F#);
begin
if Cpu.Regs(X) = Cpu.Regs(Y) then
Cpu.PC := Cpu.PC + 2;
end if;
Cpu.PC := Cpu.PC + 2;
end Handler_5;
procedure Handler_6 (Cpu : in out Chip8; Op : Opcode) is
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
N : constant Byte := Byte(Op mod 16#100#);
begin
Cpu.Regs(X) := N;
Cpu.PC := Cpu.PC + 2;
end Handler_6;
procedure Handler_7 (Cpu : in out Chip8; Op : Opcode) is
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
N : constant Byte := Byte(Op mod 16#100#);
begin
Cpu.Regs(X) := Cpu.Regs(X) + N;
Cpu.PC := Cpu.PC + 2;
end Handler_7;
procedure Handler_8 (Cpu : in out Chip8; Op : Opcode) is
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
Y : constant Integer := Integer(Shift_Right(Op, 4) and 16#F#);
begin
case Op mod 16#10# is
when 0 =>
Cpu.Regs(X) := Cpu.Regs(Y);
when 1 =>
Cpu.Regs(X) := Cpu.Regs(X) or Cpu.Regs(Y);
when 2 =>
Cpu.Regs(X) := Cpu.Regs(X) and Cpu.Regs(Y);
when 3 =>
Cpu.Regs(X) := Cpu.Regs(X) xor Cpu.Regs(Y);
when 4 =>
if Cpu.Regs(X) > Byte'Last - Cpu.Regs(Y) then
Cpu.Regs(16#F#) := 1;
else
Cpu.Regs(16#F#) := 0;
end if;
Cpu.Regs(X) := Cpu.Regs(X) + Cpu.Regs(Y);
when 5 =>
if Cpu.Regs(X) < Cpu.Regs(Y) then
Cpu.Regs(16#F#) := 1;
else
Cpu.Regs(16#F#) := 0;
end if;
Cpu.Regs(X) := Cpu.Regs(X) - Cpu.Regs(Y);
when 6 =>
Cpu.Regs(16#F#) := Cpu.Regs(X) and 1;
Cpu.Regs(X) := Shift_Right(Cpu.Regs(X), 1);
when 7 =>
if Cpu.Regs(Y) < Cpu.Regs(X) then
Cpu.Regs(16#F#) := 1;
else
Cpu.Regs(16#F#) := 0;
end if;
Cpu.Regs(X) := Cpu.Regs(Y) - Cpu.Regs(X);
when 16#E# =>
Cpu.Regs(16#F#) := Cpu.Regs(X) and 16#80#;
Cpu.Regs(X) := Shift_Left(Cpu.Regs(X), 1);
when others =>
-- checked by the contract
null;
end case;
Cpu.PC := Cpu.PC + 2;
end Handler_8;
procedure Handler_9 (Cpu : in out Chip8; Op : Opcode) is
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
Y : constant Integer := Integer(Shift_Right(Op, 4) and 16#F#);
begin
if Cpu.Regs(X) /= Cpu.Regs(Y) then
Cpu.PC := Cpu.PC + 2;
end if;
Cpu.PC := Cpu.PC + 2;
end Handler_9;
procedure Handler_A (Cpu : in out Chip8; Op : Opcode) is
N : constant Address := Op mod 16#1000#;
begin
Cpu.I := N;
Cpu.PC := Cpu.PC + 2;
end Handler_A;
procedure Handler_B (Cpu : in out Chip8; Op : Opcode) is
N : constant Address := Op mod 16#1000#;
begin
Cpu.PC := N + Word(Cpu.Regs(0));
end Handler_B;
procedure Handler_C (Cpu : in out Chip8; Op : Opcode) is
package Random_Byte is new Ada.Numerics.Discrete_Random (Byte);
use Random_Byte;
G : Generator;
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
N : constant Byte := Byte(Op mod 16#100#);
begin
Reset(G);
Cpu.Regs(X) := Random(G) and N;
Cpu.PC := Cpu.PC + 2;
end Handler_C;
procedure Handler_D (Cpu : in out Chip8; Op : Opcode) is
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
Y : constant Integer := Integer(Shift_Right(Op, 4) and 16#F#);
Height : constant Integer := Integer(Op mod 16#10#);
Pixel : Byte;
begin
-- Reset VF
Cpu.Regs(16#F#) := 0;
for Y_Line in 0 .. Height - 1 loop
Pixel := Cpu.Mem(Cpu.I + Word(Y_Line));
for X_Line in 0 .. 7 loop
if (Pixel and Shift_Right(16#80#, X_Line)) /= 0 then
declare
X_Reg : constant Integer := Integer(Cpu.Regs(X));
Y_Reg : constant Integer := Integer(Cpu.Regs(Y));
Pos_X : constant Integer := (X_Reg + X_Line) mod 64;
Pos_Y : constant Integer := (Y_Reg + Y_Line) mod 32;
Tmp : constant Boolean := Cpu.Screen(Pos_Y, Pos_X);
begin
if Tmp then
Cpu.Regs(16#F#) := 1;
end if;
Cpu.Screen(Pos_Y, Pos_X) := Tmp xor True;
Draw_Pixel(Pos_X, Pos_Y, Cpu.Screen(Pos_Y, Pos_X));
end;
end if;
end loop;
end loop;
Cpu.PC := Cpu.PC + 2;
Display.Update_Layer(2, True);
end Handler_D;
procedure Handler_E (Cpu : in out Chip8; Op : Opcode) is
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
I : constant Integer := Integer(Cpu.Regs(X));
begin
case Op mod 16#100# is
when 16#9E# =>
if Cpu.Keys(I) then
Cpu.PC := Cpu.PC + 2;
end if;
when 16#A1# =>
if not Cpu.Keys(I) then
Cpu.PC := Cpu.PC + 2;
end if;
when others =>
-- checked by the contract
null;
end case;
Cpu.Keys(I) := False;
Cpu.PC := Cpu.PC + 2;
end Handler_E;
procedure Handler_F (Cpu : in out Chip8; Op : Opcode) is
X : constant Integer := Integer(Shift_Right(Op, 8) and 16#F#);
begin
case Op mod 16#100# is
when 16#07# =>
Cpu.Regs(X) := Cpu.Delay_Timer;
when 16#0A# =>
for I in Cpu.Keys'Range loop
if Cpu.Keys(I) then
Cpu.Regs(X) := Byte(I);
Cpu.Keys(I) := False;
Cpu.PC := Cpu.PC + 2;
return;
end if;
end loop;
return;
when 16#15# =>
Cpu.Delay_Timer := Cpu.Regs(X);
when 16#18# =>
Cpu.Sound_Timer := Cpu.Regs(X);
when 16#1E# =>
Cpu.I := Cpu.I + Word(Cpu.Regs(X));
when 16#29# =>
Cpu.I := Word(Cpu.Regs(X)) * 5;
when 16#33# =>
Cpu.Mem(Cpu.I) := Cpu.Regs(X) / 100;
Cpu.Mem(Cpu.I + 1) := Cpu.Regs(X) / 10 mod 10;
Cpu.Mem(Cpu.I + 2) := Cpu.Regs(X) mod 10;
when 16#55# =>
for I in Cpu.Regs'First .. X loop
Cpu.Mem(Cpu.I + Word(I)) := Cpu.Regs(I);
pragma Loop_Invariant (I in Cpu.Regs'Range);
pragma Loop_Invariant (for all J in Cpu.Regs'First .. I =>
Cpu.Mem(Cpu.I + Word(J)) =
Cpu.Regs'Loop_Entry(J));
end loop;
when 16#65# =>
for I in Cpu.Regs'First .. X loop
Cpu.Regs(I) := Cpu.Mem(Cpu.I + Word(I));
pragma Loop_Invariant (I in Cpu.Regs'Range);
pragma Loop_Invariant (for all J in Cpu.Regs'First .. I =>
Cpu.Regs(J) =
Cpu.Mem'Loop_Entry(Cpu.I + Word(J)));
end loop;
when others =>
-- check by the contract
null;
end case;
Cpu.PC := Cpu.PC + 2;
end Handler_F;
end Instruction;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces.C;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_get_tex_genfv_cookie_t is
-- Item
--
type Item is record
sequence : aliased Interfaces.C.unsigned;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_tex_genfv_cookie_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_tex_genfv_cookie_t.Item,
Element_Array => xcb.xcb_glx_get_tex_genfv_cookie_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_tex_genfv_cookie_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_tex_genfv_cookie_t.Pointer,
Element_Array => xcb.xcb_glx_get_tex_genfv_cookie_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_tex_genfv_cookie_t;
|
-- C54A42G.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT A CASE_STATEMENT CORRECTLY HANDLES SEVERAL NON-CONTIGUOUS
-- RANGES OF INTEGERS COVERED BY A SINGLE 'OTHERS' ALTERNATIVE.
-- (OPTIMIZATION TEST.)
-- RM 03/30/81
WITH REPORT;
PROCEDURE C54A42G IS
USE REPORT ;
BEGIN
TEST( "C54A42G" , "TEST THAT A CASE_STATEMENT CORRECTLY HANDLES" &
" SEVERAL NON-CONTIGUOUS RANGES OF INTEGERS" &
" COVERED BY A SINGLE 'OTHERS' ALTERNATIVE" );
DECLARE
NUMBER : CONSTANT := 2000 ;
LITEXPR : CONSTANT := NUMBER + 2000 ;
STATCON : CONSTANT INTEGER := 2002 ;
DYNVAR : INTEGER := IDENT_INT( 0 );
DYNCON : CONSTANT INTEGER := IDENT_INT( 1 );
BEGIN
CASE INTEGER'(-4000) IS
WHEN 100..1999 => FAILED("WRONG ALTERNATIVE F1");
WHEN INTEGER'FIRST..0=> NULL ;
WHEN 2001 => FAILED("WRONG ALTERNATIVE F3");
WHEN 2100..INTEGER'LAST=>FAILED("WRONG ALTERNATIVE F4");
WHEN OTHERS => FAILED("WRONG ALTERNATIVE F5");
END CASE;
CASE IDENT_INT(NUMBER) IS
WHEN 100..1999 => FAILED("WRONG ALTERNATIVE G1");
WHEN INTEGER'FIRST..0=> FAILED("WRONG ALTERNATIVE G2");
WHEN 2001 => FAILED("WRONG ALTERNATIVE G3");
WHEN 2100..INTEGER'LAST=>FAILED("WRONG ALTERNATIVE G4");
WHEN OTHERS => NULL ;
END CASE;
CASE IDENT_INT(LITEXPR) IS
WHEN 100..1999 => FAILED("WRONG ALTERNATIVE H1");
WHEN INTEGER'FIRST..0=> FAILED("WRONG ALTERNATIVE H2");
WHEN 2001 => FAILED("WRONG ALTERNATIVE H3");
WHEN 2100..INTEGER'LAST=>NULL ;
WHEN OTHERS => FAILED("WRONG ALTERNATIVE H5");
END CASE;
CASE IDENT_INT(STATCON) IS
WHEN 100..1999 => FAILED("WRONG ALTERNATIVE I1");
WHEN INTEGER'FIRST..0=> FAILED("WRONG ALTERNATIVE I2");
WHEN 2001 => FAILED("WRONG ALTERNATIVE I3");
WHEN 2100..INTEGER'LAST=>FAILED("WRONG ALTERNATIVE I4");
WHEN OTHERS => NULL ;
END CASE;
CASE DYNVAR IS
WHEN 100..1999 => FAILED("WRONG ALTERNATIVE J1");
WHEN INTEGER'FIRST..0=> NULL ;
WHEN 2001 => FAILED("WRONG ALTERNATIVE J3");
WHEN 2100..INTEGER'LAST=>FAILED("WRONG ALTERNATIVE J4");
WHEN OTHERS => FAILED("WRONG ALTERNATIVE J5");
END CASE;
CASE DYNCON IS
WHEN 100..1999 => FAILED("WRONG ALTERNATIVE K1");
WHEN INTEGER'FIRST..0=> FAILED("WRONG ALTERNATIVE K2");
WHEN 2001 => FAILED("WRONG ALTERNATIVE K3");
WHEN 2100..INTEGER'LAST=>FAILED("WRONG ALTERNATIVE K4");
WHEN OTHERS => NULL ;
END CASE;
CASE IDENT_INT( -3900 ) IS
WHEN -3000..1999 => FAILED("WRONG ALTERNATIVE X1");
WHEN INTEGER'FIRST..
-4000 => FAILED("WRONG ALTERNATIVE X2");
WHEN 2001 => FAILED("WRONG ALTERNATIVE X3");
WHEN 2100..INTEGER'LAST=>FAILED("WRONG ALTERNATIVE X4");
WHEN OTHERS => NULL ;
END CASE;
END ;
RESULT ;
END C54A42G ;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K _ P R I M I T I V E S . O P E R A T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2006, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is a POSIX-like version of this package
-- This package contains all the GNULL primitives that interface directly
-- with the underlying OS.
-- Note: this file can only be used for POSIX compliant systems that
-- implement SCHED_FIFO and Ceiling Locking correctly.
-- For configurations where SCHED_FIFO and priority ceiling are not a
-- requirement, this file can also be used (e.g AiX threads)
pragma Polling (Off);
-- Turn off polling, we do not want ATC polling to take place during
-- tasking operations. It causes infinite loops and other problems.
with System.Tasking.Debug;
-- used for Known_Tasks
with System.Interrupt_Management;
-- used for Keep_Unmasked
-- Abort_Task_Interrupt
-- Interrupt_ID
with System.OS_Primitives;
-- used for Delay_Modes
with System.Task_Info;
-- used for Task_Info_Type
with Interfaces.C;
-- used for int
-- size_t
with System.Soft_Links;
-- used for Abort_Defer/Undefer
-- We use System.Soft_Links instead of System.Tasking.Initialization
-- because the later is a higher level package that we shouldn't depend on.
-- For example when using the restricted run time, it is replaced by
-- System.Tasking.Restricted.Stages.
with Unchecked_Conversion;
with Unchecked_Deallocation;
package body System.Task_Primitives.Operations is
package SSL renames System.Soft_Links;
use System.Tasking.Debug;
use System.Tasking;
use Interfaces.C;
use System.OS_Interface;
use System.Parameters;
use System.OS_Primitives;
----------------
-- Local Data --
----------------
-- The followings are logically constants, but need to be initialized
-- at run time.
Single_RTS_Lock : aliased RTS_Lock;
-- This is a lock to allow only one thread of control in the RTS at
-- a time; it is used to execute in mutual exclusion from all other tasks.
-- Used mainly in Single_Lock mode, but also to protect All_Tasks_List
ATCB_Key : aliased pthread_key_t;
-- Key used to find the Ada Task_Id associated with a thread
Environment_Task_Id : Task_Id;
-- A variable to hold Task_Id for the environment task.
Locking_Policy : Character;
pragma Import (C, Locking_Policy, "__gl_locking_policy");
-- Value of the pragma Locking_Policy:
-- 'C' for Ceiling_Locking
-- 'I' for Inherit_Locking
-- ' ' for none.
Unblocked_Signal_Mask : aliased sigset_t;
-- The set of signals that should unblocked in all tasks
-- The followings are internal configuration constants needed.
Next_Serial_Number : Task_Serial_Number := 100;
-- We start at 100, to reserve some special values for
-- using in error checking.
Time_Slice_Val : Integer;
pragma Import (C, Time_Slice_Val, "__gl_time_slice_val");
Dispatching_Policy : Character;
pragma Import (C, Dispatching_Policy, "__gl_task_dispatching_policy");
Foreign_Task_Elaborated : aliased Boolean := True;
-- Used to identified fake tasks (i.e., non-Ada Threads).
--------------------
-- Local Packages --
--------------------
package Specific is
procedure Initialize (Environment_Task : Task_Id);
pragma Inline (Initialize);
-- Initialize various data needed by this package.
function Is_Valid_Task return Boolean;
pragma Inline (Is_Valid_Task);
-- Does executing thread have a TCB?
procedure Set (Self_Id : Task_Id);
pragma Inline (Set);
-- Set the self id for the current task.
function Self return Task_Id;
pragma Inline (Self);
-- Return a pointer to the Ada Task Control Block of the calling task.
end Specific;
package body Specific is separate;
-- The body of this package is target specific.
---------------------------------
-- Support for foreign threads --
---------------------------------
function Register_Foreign_Thread (Thread : Thread_Id) return Task_Id;
-- Allocate and Initialize a new ATCB for the current Thread.
function Register_Foreign_Thread
(Thread : Thread_Id) return Task_Id is separate;
-----------------------
-- Local Subprograms --
-----------------------
procedure Abort_Handler (Sig : Signal);
-- Signal handler used to implement asynchronous abort.
-- See also comment before body, below.
function To_Address is new Unchecked_Conversion (Task_Id, System.Address);
-------------------
-- Abort_Handler --
-------------------
-- Target-dependent binding of inter-thread Abort signal to
-- the raising of the Abort_Signal exception.
-- The technical issues and alternatives here are essentially
-- the same as for raising exceptions in response to other
-- signals (e.g. Storage_Error). See code and comments in
-- the package body System.Interrupt_Management.
-- Some implementations may not allow an exception to be propagated
-- out of a handler, and others might leave the signal or
-- interrupt that invoked this handler masked after the exceptional
-- return to the application code.
-- GNAT exceptions are originally implemented using setjmp()/longjmp().
-- On most UNIX systems, this will allow transfer out of a signal handler,
-- which is usually the only mechanism available for implementing
-- asynchronous handlers of this kind. However, some
-- systems do not restore the signal mask on longjmp(), leaving the
-- abort signal masked.
procedure Abort_Handler (Sig : Signal) is
pragma Warnings (Off, Sig);
T : constant Task_Id := Self;
Result : Interfaces.C.int;
Old_Set : aliased sigset_t;
begin
-- It is not safe to raise an exception when using ZCX and the GCC
-- exception handling mechanism.
if ZCX_By_Default and then GCC_ZCX_Support then
return;
end if;
if T.Deferral_Level = 0
and then T.Pending_ATC_Level < T.ATC_Nesting_Level and then
not T.Aborting
then
T.Aborting := True;
-- Make sure signals used for RTS internal purpose are unmasked
Result := pthread_sigmask (SIG_UNBLOCK,
Unblocked_Signal_Mask'Unchecked_Access, Old_Set'Unchecked_Access);
pragma Assert (Result = 0);
raise Standard'Abort_Signal;
end if;
end Abort_Handler;
-----------------
-- Stack_Guard --
-----------------
procedure Stack_Guard (T : ST.Task_Id; On : Boolean) is
Stack_Base : constant Address := Get_Stack_Base (T.Common.LL.Thread);
Guard_Page_Address : Address;
Res : Interfaces.C.int;
begin
if Stack_Base_Available then
-- Compute the guard page address
Guard_Page_Address :=
Stack_Base - (Stack_Base mod Get_Page_Size) + Get_Page_Size;
if On then
Res := mprotect (Guard_Page_Address, Get_Page_Size, PROT_ON);
else
Res := mprotect (Guard_Page_Address, Get_Page_Size, PROT_OFF);
end if;
pragma Assert (Res = 0);
end if;
end Stack_Guard;
--------------------
-- Get_Thread_Id --
--------------------
function Get_Thread_Id (T : ST.Task_Id) return OSI.Thread_Id is
begin
return T.Common.LL.Thread;
end Get_Thread_Id;
----------
-- Self --
----------
function Self return Task_Id renames Specific.Self;
---------------------
-- Initialize_Lock --
---------------------
-- Note: mutexes and cond_variables needed per-task basis are
-- initialized in Intialize_TCB and the Storage_Error is
-- handled. Other mutexes (such as RTS_Lock, Memory_Lock...)
-- used in RTS is initialized before any status change of RTS.
-- Therefore rasing Storage_Error in the following routines
-- should be able to be handled safely.
procedure Initialize_Lock
(Prio : System.Any_Priority;
L : access Lock)
is
Attributes : aliased pthread_mutexattr_t;
Result : Interfaces.C.int;
begin
Result := pthread_mutexattr_init (Attributes'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = ENOMEM then
raise Storage_Error;
end if;
if Locking_Policy = 'C' then
Result := pthread_mutexattr_setprotocol
(Attributes'Access, PTHREAD_PRIO_PROTECT);
pragma Assert (Result = 0);
Result := pthread_mutexattr_setprioceiling
(Attributes'Access, Interfaces.C.int (Prio));
pragma Assert (Result = 0);
elsif Locking_Policy = 'I' then
Result := pthread_mutexattr_setprotocol
(Attributes'Access, PTHREAD_PRIO_INHERIT);
pragma Assert (Result = 0);
end if;
Result := pthread_mutex_init (L, Attributes'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = ENOMEM then
Result := pthread_mutexattr_destroy (Attributes'Access);
raise Storage_Error;
end if;
Result := pthread_mutexattr_destroy (Attributes'Access);
pragma Assert (Result = 0);
end Initialize_Lock;
procedure Initialize_Lock (L : access RTS_Lock; Level : Lock_Level) is
pragma Warnings (Off, Level);
Attributes : aliased pthread_mutexattr_t;
Result : Interfaces.C.int;
begin
Result := pthread_mutexattr_init (Attributes'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = ENOMEM then
raise Storage_Error;
end if;
if Locking_Policy = 'C' then
Result := pthread_mutexattr_setprotocol
(Attributes'Access, PTHREAD_PRIO_PROTECT);
pragma Assert (Result = 0);
Result := pthread_mutexattr_setprioceiling
(Attributes'Access, Interfaces.C.int (System.Any_Priority'Last));
pragma Assert (Result = 0);
elsif Locking_Policy = 'I' then
Result := pthread_mutexattr_setprotocol
(Attributes'Access, PTHREAD_PRIO_INHERIT);
pragma Assert (Result = 0);
end if;
Result := pthread_mutex_init (L, Attributes'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = ENOMEM then
Result := pthread_mutexattr_destroy (Attributes'Access);
raise Storage_Error;
end if;
Result := pthread_mutexattr_destroy (Attributes'Access);
pragma Assert (Result = 0);
end Initialize_Lock;
-------------------
-- Finalize_Lock --
-------------------
procedure Finalize_Lock (L : access Lock) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_destroy (L);
pragma Assert (Result = 0);
end Finalize_Lock;
procedure Finalize_Lock (L : access RTS_Lock) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_destroy (L);
pragma Assert (Result = 0);
end Finalize_Lock;
----------------
-- Write_Lock --
----------------
procedure Write_Lock (L : access Lock; Ceiling_Violation : out Boolean) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_lock (L);
-- Assume that the cause of EINVAL is a priority ceiling violation
Ceiling_Violation := (Result = EINVAL);
pragma Assert (Result = 0 or else Result = EINVAL);
end Write_Lock;
procedure Write_Lock
(L : access RTS_Lock;
Global_Lock : Boolean := False)
is
Result : Interfaces.C.int;
begin
if not Single_Lock or else Global_Lock then
Result := pthread_mutex_lock (L);
pragma Assert (Result = 0);
end if;
end Write_Lock;
procedure Write_Lock (T : Task_Id) is
Result : Interfaces.C.int;
begin
if not Single_Lock then
Result := pthread_mutex_lock (T.Common.LL.L'Access);
pragma Assert (Result = 0);
end if;
end Write_Lock;
---------------
-- Read_Lock --
---------------
procedure Read_Lock (L : access Lock; Ceiling_Violation : out Boolean) is
begin
Write_Lock (L, Ceiling_Violation);
end Read_Lock;
------------
-- Unlock --
------------
procedure Unlock (L : access Lock) is
Result : Interfaces.C.int;
begin
Result := pthread_mutex_unlock (L);
pragma Assert (Result = 0);
end Unlock;
procedure Unlock (L : access RTS_Lock; Global_Lock : Boolean := False) is
Result : Interfaces.C.int;
begin
if not Single_Lock or else Global_Lock then
Result := pthread_mutex_unlock (L);
pragma Assert (Result = 0);
end if;
end Unlock;
procedure Unlock (T : Task_Id) is
Result : Interfaces.C.int;
begin
if not Single_Lock then
Result := pthread_mutex_unlock (T.Common.LL.L'Access);
pragma Assert (Result = 0);
end if;
end Unlock;
-----------
-- Sleep --
-----------
procedure Sleep
(Self_ID : Task_Id;
Reason : System.Tasking.Task_States)
is
pragma Warnings (Off, Reason);
Result : Interfaces.C.int;
begin
if Single_Lock then
Result := pthread_cond_wait
(Self_ID.Common.LL.CV'Access, Single_RTS_Lock'Access);
else
Result := pthread_cond_wait
(Self_ID.Common.LL.CV'Access, Self_ID.Common.LL.L'Access);
end if;
-- EINTR is not considered a failure.
pragma Assert (Result = 0 or else Result = EINTR);
end Sleep;
-----------------
-- Timed_Sleep --
-----------------
-- This is for use within the run-time system, so abort is
-- assumed to be already deferred, and the caller should be
-- holding its own ATCB lock.
procedure Timed_Sleep
(Self_ID : Task_Id;
Time : Duration;
Mode : ST.Delay_Modes;
Reason : Task_States;
Timedout : out Boolean;
Yielded : out Boolean)
is
pragma Warnings (Off, Reason);
Check_Time : constant Duration := Monotonic_Clock;
Rel_Time : Duration;
Abs_Time : Duration;
Request : aliased timespec;
Result : Interfaces.C.int;
begin
Timedout := True;
Yielded := False;
if Mode = Relative then
Abs_Time := Duration'Min (Time, Max_Sensible_Delay) + Check_Time;
if Relative_Timed_Wait then
Rel_Time := Duration'Min (Max_Sensible_Delay, Time);
end if;
else
Abs_Time := Duration'Min (Check_Time + Max_Sensible_Delay, Time);
if Relative_Timed_Wait then
Rel_Time := Duration'Min (Max_Sensible_Delay, Time - Check_Time);
end if;
end if;
if Abs_Time > Check_Time then
if Relative_Timed_Wait then
Request := To_Timespec (Rel_Time);
else
Request := To_Timespec (Abs_Time);
end if;
loop
exit when Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level
or else Self_ID.Pending_Priority_Change;
if Single_Lock then
Result := pthread_cond_timedwait
(Self_ID.Common.LL.CV'Access, Single_RTS_Lock'Access,
Request'Access);
else
Result := pthread_cond_timedwait
(Self_ID.Common.LL.CV'Access, Self_ID.Common.LL.L'Access,
Request'Access);
end if;
exit when Abs_Time <= Monotonic_Clock;
if Result = 0 or Result = EINTR then
-- Somebody may have called Wakeup for us
Timedout := False;
exit;
end if;
pragma Assert (Result = ETIMEDOUT);
end loop;
end if;
end Timed_Sleep;
-----------------
-- Timed_Delay --
-----------------
-- This is for use in implementing delay statements, so
-- we assume the caller is abort-deferred but is holding
-- no locks.
procedure Timed_Delay
(Self_ID : Task_Id;
Time : Duration;
Mode : ST.Delay_Modes)
is
Check_Time : constant Duration := Monotonic_Clock;
Abs_Time : Duration;
Rel_Time : Duration;
Request : aliased timespec;
Result : Interfaces.C.int;
begin
if Single_Lock then
Lock_RTS;
end if;
Write_Lock (Self_ID);
if Mode = Relative then
Abs_Time := Duration'Min (Time, Max_Sensible_Delay) + Check_Time;
if Relative_Timed_Wait then
Rel_Time := Duration'Min (Max_Sensible_Delay, Time);
end if;
else
Abs_Time := Duration'Min (Check_Time + Max_Sensible_Delay, Time);
if Relative_Timed_Wait then
Rel_Time := Duration'Min (Max_Sensible_Delay, Time - Check_Time);
end if;
end if;
if Abs_Time > Check_Time then
if Relative_Timed_Wait then
Request := To_Timespec (Rel_Time);
else
Request := To_Timespec (Abs_Time);
end if;
Self_ID.Common.State := Delay_Sleep;
loop
if Self_ID.Pending_Priority_Change then
Self_ID.Pending_Priority_Change := False;
Self_ID.Common.Base_Priority := Self_ID.New_Base_Priority;
Set_Priority (Self_ID, Self_ID.Common.Base_Priority);
end if;
exit when Self_ID.Pending_ATC_Level < Self_ID.ATC_Nesting_Level;
if Single_Lock then
Result := pthread_cond_timedwait (Self_ID.Common.LL.CV'Access,
Single_RTS_Lock'Access, Request'Access);
else
Result := pthread_cond_timedwait (Self_ID.Common.LL.CV'Access,
Self_ID.Common.LL.L'Access, Request'Access);
end if;
exit when Abs_Time <= Monotonic_Clock;
pragma Assert (Result = 0
or else Result = ETIMEDOUT
or else Result = EINTR);
end loop;
Self_ID.Common.State := Runnable;
end if;
Unlock (Self_ID);
if Single_Lock then
Unlock_RTS;
end if;
Result := sched_yield;
end Timed_Delay;
---------------------
-- Monotonic_Clock --
---------------------
function Monotonic_Clock return Duration is
TS : aliased timespec;
Result : Interfaces.C.int;
begin
Result := clock_gettime
(clock_id => CLOCK_REALTIME, tp => TS'Unchecked_Access);
pragma Assert (Result = 0);
return To_Duration (TS);
end Monotonic_Clock;
-------------------
-- RT_Resolution --
-------------------
function RT_Resolution return Duration is
begin
return 10#1.0#E-6;
end RT_Resolution;
------------
-- Wakeup --
------------
procedure Wakeup (T : Task_Id; Reason : System.Tasking.Task_States) is
pragma Warnings (Off, Reason);
Result : Interfaces.C.int;
begin
Result := pthread_cond_signal (T.Common.LL.CV'Access);
pragma Assert (Result = 0);
end Wakeup;
-----------
-- Yield --
-----------
procedure Yield (Do_Yield : Boolean := True) is
Result : Interfaces.C.int;
pragma Unreferenced (Result);
begin
if Do_Yield then
Result := sched_yield;
end if;
end Yield;
------------------
-- Set_Priority --
------------------
procedure Set_Priority
(T : Task_Id;
Prio : System.Any_Priority;
Loss_Of_Inheritance : Boolean := False)
is
pragma Warnings (Off, Loss_Of_Inheritance);
Result : Interfaces.C.int;
Param : aliased struct_sched_param;
begin
T.Common.Current_Priority := Prio;
Param.sched_priority := Interfaces.C.int (Prio);
if Time_Slice_Supported and then Time_Slice_Val > 0 then
Result := pthread_setschedparam
(T.Common.LL.Thread, SCHED_RR, Param'Access);
elsif Dispatching_Policy = 'F' or else Time_Slice_Val = 0 then
Result := pthread_setschedparam
(T.Common.LL.Thread, SCHED_FIFO, Param'Access);
else
Result := pthread_setschedparam
(T.Common.LL.Thread, SCHED_OTHER, Param'Access);
end if;
pragma Assert (Result = 0);
end Set_Priority;
------------------
-- Get_Priority --
------------------
function Get_Priority (T : Task_Id) return System.Any_Priority is
begin
return T.Common.Current_Priority;
end Get_Priority;
----------------
-- Enter_Task --
----------------
procedure Enter_Task (Self_ID : Task_Id) is
begin
Self_ID.Common.LL.Thread := pthread_self;
Self_ID.Common.LL.LWP := lwp_self;
Specific.Set (Self_ID);
Lock_RTS;
for J in Known_Tasks'Range loop
if Known_Tasks (J) = null then
Known_Tasks (J) := Self_ID;
Self_ID.Known_Tasks_Index := J;
exit;
end if;
end loop;
Unlock_RTS;
end Enter_Task;
--------------
-- New_ATCB --
--------------
function New_ATCB (Entry_Num : Task_Entry_Index) return Task_Id is
begin
return new Ada_Task_Control_Block (Entry_Num);
end New_ATCB;
-------------------
-- Is_Valid_Task --
-------------------
function Is_Valid_Task return Boolean renames Specific.Is_Valid_Task;
-----------------------------
-- Register_Foreign_Thread --
-----------------------------
function Register_Foreign_Thread return Task_Id is
begin
if Is_Valid_Task then
return Self;
else
return Register_Foreign_Thread (pthread_self);
end if;
end Register_Foreign_Thread;
--------------------
-- Initialize_TCB --
--------------------
procedure Initialize_TCB (Self_ID : Task_Id; Succeeded : out Boolean) is
Mutex_Attr : aliased pthread_mutexattr_t;
Result : Interfaces.C.int;
Cond_Attr : aliased pthread_condattr_t;
begin
-- Give the task a unique serial number.
Self_ID.Serial_Number := Next_Serial_Number;
Next_Serial_Number := Next_Serial_Number + 1;
pragma Assert (Next_Serial_Number /= 0);
if not Single_Lock then
Result := pthread_mutexattr_init (Mutex_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = 0 then
if Locking_Policy = 'C' then
Result := pthread_mutexattr_setprotocol
(Mutex_Attr'Access, PTHREAD_PRIO_PROTECT);
pragma Assert (Result = 0);
Result := pthread_mutexattr_setprioceiling
(Mutex_Attr'Access,
Interfaces.C.int (System.Any_Priority'Last));
pragma Assert (Result = 0);
elsif Locking_Policy = 'I' then
Result := pthread_mutexattr_setprotocol
(Mutex_Attr'Access, PTHREAD_PRIO_INHERIT);
pragma Assert (Result = 0);
end if;
Result := pthread_mutex_init (Self_ID.Common.LL.L'Access,
Mutex_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
end if;
if Result /= 0 then
Succeeded := False;
return;
end if;
Result := pthread_mutexattr_destroy (Mutex_Attr'Access);
pragma Assert (Result = 0);
end if;
Result := pthread_condattr_init (Cond_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = 0 then
Result := pthread_cond_init (Self_ID.Common.LL.CV'Access,
Cond_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
end if;
if Result = 0 then
Succeeded := True;
else
if not Single_Lock then
Result := pthread_mutex_destroy (Self_ID.Common.LL.L'Access);
pragma Assert (Result = 0);
end if;
Succeeded := False;
end if;
Result := pthread_condattr_destroy (Cond_Attr'Access);
pragma Assert (Result = 0);
end Initialize_TCB;
-----------------
-- Create_Task --
-----------------
procedure Create_Task
(T : Task_Id;
Wrapper : System.Address;
Stack_Size : System.Parameters.Size_Type;
Priority : System.Any_Priority;
Succeeded : out Boolean)
is
Attributes : aliased pthread_attr_t;
Adjusted_Stack_Size : Interfaces.C.size_t;
Result : Interfaces.C.int;
function Thread_Body_Access is new
Unchecked_Conversion (System.Address, Thread_Body);
use System.Task_Info;
begin
Adjusted_Stack_Size := Interfaces.C.size_t (Stack_Size);
if Stack_Base_Available then
-- If Stack Checking is supported then allocate 2 additional pages:
--
-- In the worst case, stack is allocated at something like
-- N * Get_Page_Size - epsilon, we need to add the size for 2 pages
-- to be sure the effective stack size is greater than what
-- has been asked.
Adjusted_Stack_Size := Adjusted_Stack_Size + 2 * Get_Page_Size;
end if;
Result := pthread_attr_init (Attributes'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result /= 0 then
Succeeded := False;
return;
end if;
Result := pthread_attr_setdetachstate
(Attributes'Access, PTHREAD_CREATE_DETACHED);
pragma Assert (Result = 0);
Result := pthread_attr_setstacksize
(Attributes'Access, Adjusted_Stack_Size);
pragma Assert (Result = 0);
if T.Common.Task_Info /= Default_Scope then
-- We are assuming that Scope_Type has the same values than the
-- corresponding C macros
Result := pthread_attr_setscope
(Attributes'Access, Task_Info_Type'Pos (T.Common.Task_Info));
pragma Assert (Result = 0);
end if;
-- Since the initial signal mask of a thread is inherited from the
-- creator, and the Environment task has all its signals masked, we
-- do not need to manipulate caller's signal mask at this point.
-- All tasks in RTS will have All_Tasks_Mask initially.
Result := pthread_create
(T.Common.LL.Thread'Access,
Attributes'Access,
Thread_Body_Access (Wrapper),
To_Address (T));
pragma Assert (Result = 0 or else Result = EAGAIN);
Succeeded := Result = 0;
Result := pthread_attr_destroy (Attributes'Access);
pragma Assert (Result = 0);
Set_Priority (T, Priority);
end Create_Task;
------------------
-- Finalize_TCB --
------------------
procedure Finalize_TCB (T : Task_Id) is
Result : Interfaces.C.int;
Tmp : Task_Id := T;
Is_Self : constant Boolean := T = Self;
procedure Free is new
Unchecked_Deallocation (Ada_Task_Control_Block, Task_Id);
begin
if not Single_Lock then
Result := pthread_mutex_destroy (T.Common.LL.L'Access);
pragma Assert (Result = 0);
end if;
Result := pthread_cond_destroy (T.Common.LL.CV'Access);
pragma Assert (Result = 0);
if T.Known_Tasks_Index /= -1 then
Known_Tasks (T.Known_Tasks_Index) := null;
end if;
Free (Tmp);
if Is_Self then
Specific.Set (null);
end if;
end Finalize_TCB;
---------------
-- Exit_Task --
---------------
procedure Exit_Task is
begin
-- Mark this task as unknown, so that if Self is called, it won't
-- return a dangling pointer.
Specific.Set (null);
end Exit_Task;
----------------
-- Abort_Task --
----------------
procedure Abort_Task (T : Task_Id) is
Result : Interfaces.C.int;
begin
Result := pthread_kill (T.Common.LL.Thread,
Signal (System.Interrupt_Management.Abort_Task_Interrupt));
pragma Assert (Result = 0);
end Abort_Task;
----------------
-- Initialize --
----------------
procedure Initialize (S : in out Suspension_Object) is
Mutex_Attr : aliased pthread_mutexattr_t;
Cond_Attr : aliased pthread_condattr_t;
Result : Interfaces.C.int;
begin
-- Initialize internal state. It is always initialized to False (ARM
-- D.10 par. 6).
S.State := False;
S.Waiting := False;
-- Initialize internal mutex
Result := pthread_mutexattr_init (Mutex_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = ENOMEM then
raise Storage_Error;
end if;
Result := pthread_mutex_init (S.L'Access, Mutex_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result = ENOMEM then
Result := pthread_mutexattr_destroy (Mutex_Attr'Access);
pragma Assert (Result = 0);
raise Storage_Error;
end if;
Result := pthread_mutexattr_destroy (Mutex_Attr'Access);
pragma Assert (Result = 0);
-- Initialize internal condition variable
Result := pthread_condattr_init (Cond_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result /= 0 then
Result := pthread_mutex_destroy (S.L'Access);
pragma Assert (Result = 0);
if Result = ENOMEM then
raise Storage_Error;
end if;
end if;
Result := pthread_cond_init (S.CV'Access, Cond_Attr'Access);
pragma Assert (Result = 0 or else Result = ENOMEM);
if Result /= 0 then
Result := pthread_mutex_destroy (S.L'Access);
pragma Assert (Result = 0);
if Result = ENOMEM then
Result := pthread_condattr_destroy (Cond_Attr'Access);
pragma Assert (Result = 0);
raise Storage_Error;
end if;
end if;
Result := pthread_condattr_destroy (Cond_Attr'Access);
pragma Assert (Result = 0);
end Initialize;
--------------
-- Finalize --
--------------
procedure Finalize (S : in out Suspension_Object) is
Result : Interfaces.C.int;
begin
-- Destroy internal mutex
Result := pthread_mutex_destroy (S.L'Access);
pragma Assert (Result = 0);
-- Destroy internal condition variable
Result := pthread_cond_destroy (S.CV'Access);
pragma Assert (Result = 0);
end Finalize;
-------------------
-- Current_State --
-------------------
function Current_State (S : Suspension_Object) return Boolean is
begin
-- We do not want to use lock on this read operation. State is marked
-- as Atomic so that we ensure that the value retrieved is correct.
return S.State;
end Current_State;
---------------
-- Set_False --
---------------
procedure Set_False (S : in out Suspension_Object) is
Result : Interfaces.C.int;
begin
SSL.Abort_Defer.all;
Result := pthread_mutex_lock (S.L'Access);
pragma Assert (Result = 0);
S.State := False;
Result := pthread_mutex_unlock (S.L'Access);
pragma Assert (Result = 0);
SSL.Abort_Undefer.all;
end Set_False;
--------------
-- Set_True --
--------------
procedure Set_True (S : in out Suspension_Object) is
Result : Interfaces.C.int;
begin
SSL.Abort_Defer.all;
Result := pthread_mutex_lock (S.L'Access);
pragma Assert (Result = 0);
-- If there is already a task waiting on this suspension object then
-- we resume it, leaving the state of the suspension object to False,
-- as it is specified in ARM D.10 par. 9. Otherwise, it just leaves
-- the state to True.
if S.Waiting then
S.Waiting := False;
S.State := False;
Result := pthread_cond_signal (S.CV'Access);
pragma Assert (Result = 0);
else
S.State := True;
end if;
Result := pthread_mutex_unlock (S.L'Access);
pragma Assert (Result = 0);
SSL.Abort_Undefer.all;
end Set_True;
------------------------
-- Suspend_Until_True --
------------------------
procedure Suspend_Until_True (S : in out Suspension_Object) is
Result : Interfaces.C.int;
begin
SSL.Abort_Defer.all;
Result := pthread_mutex_lock (S.L'Access);
pragma Assert (Result = 0);
if S.Waiting then
-- Program_Error must be raised upon calling Suspend_Until_True
-- if another task is already waiting on that suspension object
-- (ARM D.10 par. 10).
Result := pthread_mutex_unlock (S.L'Access);
pragma Assert (Result = 0);
SSL.Abort_Undefer.all;
raise Program_Error;
else
-- Suspend the task if the state is False. Otherwise, the task
-- continues its execution, and the state of the suspension object
-- is set to False (ARM D.10 par. 9).
if S.State then
S.State := False;
else
S.Waiting := True;
Result := pthread_cond_wait (S.CV'Access, S.L'Access);
end if;
Result := pthread_mutex_unlock (S.L'Access);
pragma Assert (Result = 0);
SSL.Abort_Undefer.all;
end if;
end Suspend_Until_True;
----------------
-- Check_Exit --
----------------
-- Dummy version
function Check_Exit (Self_ID : ST.Task_Id) return Boolean is
pragma Warnings (Off, Self_ID);
begin
return True;
end Check_Exit;
--------------------
-- Check_No_Locks --
--------------------
function Check_No_Locks (Self_ID : ST.Task_Id) return Boolean is
pragma Warnings (Off, Self_ID);
begin
return True;
end Check_No_Locks;
----------------------
-- Environment_Task --
----------------------
function Environment_Task return Task_Id is
begin
return Environment_Task_Id;
end Environment_Task;
--------------
-- Lock_RTS --
--------------
procedure Lock_RTS is
begin
Write_Lock (Single_RTS_Lock'Access, Global_Lock => True);
end Lock_RTS;
----------------
-- Unlock_RTS --
----------------
procedure Unlock_RTS is
begin
Unlock (Single_RTS_Lock'Access, Global_Lock => True);
end Unlock_RTS;
------------------
-- Suspend_Task --
------------------
function Suspend_Task
(T : ST.Task_Id;
Thread_Self : Thread_Id) return Boolean
is
pragma Warnings (Off, T);
pragma Warnings (Off, Thread_Self);
begin
return False;
end Suspend_Task;
-----------------
-- Resume_Task --
-----------------
function Resume_Task
(T : ST.Task_Id;
Thread_Self : Thread_Id) return Boolean
is
pragma Warnings (Off, T);
pragma Warnings (Off, Thread_Self);
begin
return False;
end Resume_Task;
----------------
-- Initialize --
----------------
procedure Initialize (Environment_Task : Task_Id) is
act : aliased struct_sigaction;
old_act : aliased struct_sigaction;
Tmp_Set : aliased sigset_t;
Result : Interfaces.C.int;
function State
(Int : System.Interrupt_Management.Interrupt_ID) return Character;
pragma Import (C, State, "__gnat_get_interrupt_state");
-- Get interrupt state. Defined in a-init.c
-- The input argument is the interrupt number,
-- and the result is one of the following:
Default : constant Character := 's';
-- 'n' this interrupt not set by any Interrupt_State pragma
-- 'u' Interrupt_State pragma set state to User
-- 'r' Interrupt_State pragma set state to Runtime
-- 's' Interrupt_State pragma set state to System (use "default"
-- system handler)
begin
Environment_Task_Id := Environment_Task;
Interrupt_Management.Initialize;
-- Prepare the set of signals that should unblocked in all tasks
Result := sigemptyset (Unblocked_Signal_Mask'Access);
pragma Assert (Result = 0);
for J in Interrupt_Management.Interrupt_ID loop
if System.Interrupt_Management.Keep_Unmasked (J) then
Result := sigaddset (Unblocked_Signal_Mask'Access, Signal (J));
pragma Assert (Result = 0);
end if;
end loop;
-- Initialize the lock used to synchronize chain of all ATCBs.
Initialize_Lock (Single_RTS_Lock'Access, RTS_Lock_Level);
Specific.Initialize (Environment_Task);
Enter_Task (Environment_Task);
-- Install the abort-signal handler
if State (System.Interrupt_Management.Abort_Task_Interrupt)
/= Default
then
act.sa_flags := 0;
act.sa_handler := Abort_Handler'Address;
Result := sigemptyset (Tmp_Set'Access);
pragma Assert (Result = 0);
act.sa_mask := Tmp_Set;
Result :=
sigaction
(Signal (System.Interrupt_Management.Abort_Task_Interrupt),
act'Unchecked_Access,
old_act'Unchecked_Access);
pragma Assert (Result = 0);
end if;
end Initialize;
end System.Task_Primitives.Operations;
|
--Alvaro Fernandez Velazquez (a_fernandez@usal.es)
--Francisco Blazquez Matias (fran_blm@usal.es)
with Ada.Real_Time;
with Ada.Real_Time.Timing_Events;
use Ada.Real_Time;
package Monitor is
protected type Reactor is
procedure leer(temp : out Integer);
procedure incrementar(incremento:Integer);
procedure decrementar(decremento:Integer);
procedure abrirPuerta;
procedure cerrarPuerta;
procedure Timer(event: in out Ada.Real_Time.Timing_Events.Timing_Event);
private
temperatura:Integer := 1450;
bajarJitterControl:Ada.Real_Time.Timing_Events.Timing_Event;
bajarPeriodo:Ada.Real_Time.Time_Span:= Ada.Real_Time.Seconds(1);
nextTime:Ada.Real_Time.Time;
end Reactor;
end Monitor;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T B I N D --
-- --
-- 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 ALI; use ALI;
with ALI.Util; use ALI.Util;
with Bcheck; use Bcheck;
with Binde; use Binde;
with Binderr; use Binderr;
with Bindgen; use Bindgen;
with Bindusg;
with Casing; use Casing;
with Csets;
with Debug; use Debug;
with Fmap;
with Namet; use Namet;
with Opt; use Opt;
with Osint; use Osint;
with Osint.B; use Osint.B;
with Output; use Output;
with Rident; use Rident;
with Snames;
with Switch; use Switch;
with Switch.B; use Switch.B;
with Targparm; use Targparm;
with Types; use Types;
with System.Case_Util; use System.Case_Util;
with System.OS_Lib; use System.OS_Lib;
with Ada.Command_Line.Response_File; use Ada.Command_Line;
procedure Gnatbind is
Total_Errors : Nat := 0;
-- Counts total errors in all files
Total_Warnings : Nat := 0;
-- Total warnings in all files
Main_Lib_File : File_Name_Type;
-- Current main library file
First_Main_Lib_File : File_Name_Type := No_File;
-- The first library file, that should be a main subprogram if neither -n
-- nor -z are used.
Text : Text_Buffer_Ptr;
Output_File_Name_Seen : Boolean := False;
Output_File_Name : String_Ptr := new String'("");
Mapping_File : String_Ptr := null;
procedure Add_Artificial_ALI_File (Name : String);
-- Artificially add ALI file Name in the closure
function Gnatbind_Supports_Auto_Init return Boolean;
-- Indicates if automatic initialization of elaboration procedure through
-- the constructor mechanism is possible on the platform.
function Is_Cross_Compiler return Boolean;
-- Returns True iff this is a cross-compiler
procedure List_Applicable_Restrictions;
-- List restrictions that apply to this partition if option taken
procedure Scan_Bind_Arg (Argv : String);
-- Scan and process binder specific arguments. Argv is a single argument.
-- All the one character arguments are still handled by Switch. This
-- routine handles -aO -aI and -I-. The lower bound of Argv must be 1.
generic
with procedure Action (Argv : String);
procedure Generic_Scan_Bind_Args;
-- Iterate through the args calling Action on each one, taking care of
-- response files.
procedure Write_Arg (S : String);
-- Passed to Generic_Scan_Bind_Args to print args
-----------------------------
-- Add_Artificial_ALI_File --
-----------------------------
procedure Add_Artificial_ALI_File (Name : String) is
Id : ALI_Id;
pragma Warnings (Off, Id);
Std_Lib_File : File_Name_Type;
-- Standard library
begin
Name_Len := Name'Length;
Name_Buffer (1 .. Name_Len) := Name;
Std_Lib_File := Name_Find;
Text := Read_Library_Info (Std_Lib_File, True);
Id :=
Scan_ALI
(F => Std_Lib_File,
T => Text,
Ignore_ED => False,
Err => False,
Ignore_Errors => Debug_Flag_I);
Free (Text);
end Add_Artificial_ALI_File;
---------------------------------
-- Gnatbind_Supports_Auto_Init --
---------------------------------
function Gnatbind_Supports_Auto_Init return Boolean is
function gnat_binder_supports_auto_init return Integer;
pragma Import (C, gnat_binder_supports_auto_init,
"__gnat_binder_supports_auto_init");
begin
return gnat_binder_supports_auto_init /= 0;
end Gnatbind_Supports_Auto_Init;
-----------------------
-- Is_Cross_Compiler --
-----------------------
function Is_Cross_Compiler return Boolean is
Cross_Compiler : Integer;
pragma Import (C, Cross_Compiler, "__gnat_is_cross_compiler");
begin
return Cross_Compiler = 1;
end Is_Cross_Compiler;
----------------------------------
-- List_Applicable_Restrictions --
----------------------------------
procedure List_Applicable_Restrictions is
-- Define those restrictions that should be output if the gnatbind
-- -r switch is used. Not all restrictions are output for the reasons
-- given below in the list, and this array is used to test whether
-- the corresponding pragma should be listed. True means that it
-- should not be listed.
No_Restriction_List : constant array (All_Restrictions) of Boolean :=
(No_Standard_Allocators_After_Elaboration => True,
-- This involves run-time conditions not checkable at compile time
No_Anonymous_Allocators => True,
-- Premature, since we have not implemented this yet
No_Exception_Propagation => True,
-- Modifies code resulting in different exception semantics
No_Exceptions => True,
-- Has unexpected Suppress (All_Checks) effect
No_Implicit_Conditionals => True,
-- This could modify and pessimize generated code
No_Implicit_Dynamic_Code => True,
-- This could modify and pessimize generated code
No_Implicit_Loops => True,
-- This could modify and pessimize generated code
No_Recursion => True,
-- Not checkable at compile time
No_Reentrancy => True,
-- Not checkable at compile time
Max_Entry_Queue_Length => True,
-- Not checkable at compile time
Max_Storage_At_Blocking => True,
-- Not checkable at compile time
-- The following three should not be partition-wide, so the
-- following tests are junk to be removed eventually ???
No_Specification_Of_Aspect => True,
-- Requires a parameter value, not a count
No_Use_Of_Attribute => True,
-- Requires a parameter value, not a count
No_Use_Of_Pragma => True,
-- Requires a parameter value, not a count
others => False);
Additional_Restrictions_Listed : Boolean := False;
-- Set True if we have listed header for restrictions
function Restriction_Could_Be_Set (R : Restriction_Id) return Boolean;
-- Returns True if the given restriction can be listed as an additional
-- restriction that could be set.
------------------------------
-- Restriction_Could_Be_Set --
------------------------------
function Restriction_Could_Be_Set (R : Restriction_Id) return Boolean is
CR : Restrictions_Info renames Cumulative_Restrictions;
begin
case R is
-- Boolean restriction
when All_Boolean_Restrictions =>
-- The condition for listing a boolean restriction as an
-- additional restriction that could be set is that it is
-- not violated by any unit, and not already set.
return CR.Violated (R) = False and then CR.Set (R) = False;
-- Parameter restriction
when All_Parameter_Restrictions =>
-- If the restriction is violated and the level of violation is
-- unknown, the restriction can definitely not be listed.
if CR.Violated (R) and then CR.Unknown (R) then
return False;
-- We can list the restriction if it is not set
elsif not CR.Set (R) then
return True;
-- We can list the restriction if is set to a greater value
-- than the maximum value known for the violation.
else
return CR.Value (R) > CR.Count (R);
end if;
-- No other values for R possible
when others =>
raise Program_Error;
end case;
end Restriction_Could_Be_Set;
-- Start of processing for List_Applicable_Restrictions
begin
-- Loop through restrictions
for R in All_Restrictions loop
if not No_Restriction_List (R)
and then Restriction_Could_Be_Set (R)
then
if not Additional_Restrictions_Listed then
Write_Eol;
Write_Line
("The following additional restrictions may be applied to "
& "this partition:");
Additional_Restrictions_Listed := True;
end if;
Write_Str ("pragma Restrictions (");
declare
S : constant String := Restriction_Id'Image (R);
begin
Name_Len := S'Length;
Name_Buffer (1 .. Name_Len) := S;
end;
Set_Casing (Mixed_Case);
Write_Str (Name_Buffer (1 .. Name_Len));
if R in All_Parameter_Restrictions then
Write_Str (" => ");
Write_Int (Int (Cumulative_Restrictions.Count (R)));
end if;
Write_Str (");");
Write_Eol;
end if;
end loop;
end List_Applicable_Restrictions;
-------------------
-- Scan_Bind_Arg --
-------------------
procedure Scan_Bind_Arg (Argv : String) is
pragma Assert (Argv'First = 1);
begin
-- Now scan arguments that are specific to the binder and are not
-- handled by the common circuitry in Switch.
if Opt.Output_File_Name_Present
and then not Output_File_Name_Seen
then
Output_File_Name_Seen := True;
if Argv'Length = 0
or else (Argv'Length >= 1 and then Argv (1) = '-')
then
Fail ("output File_Name missing after -o");
else
Output_File_Name := new String'(Argv);
end if;
elsif Argv'Length >= 2 and then Argv (1) = '-' then
-- -I-
if Argv (2 .. Argv'Last) = "I-" then
Opt.Look_In_Primary_Dir := False;
-- -Idir
elsif Argv (2) = 'I' then
Add_Src_Search_Dir (Argv (3 .. Argv'Last));
Add_Lib_Search_Dir (Argv (3 .. Argv'Last));
-- -Ldir
elsif Argv (2) = 'L' then
if Argv'Length >= 3 then
Opt.Bind_For_Library := True;
Opt.Ada_Init_Name :=
new String'(Argv (3 .. Argv'Last) & Opt.Ada_Init_Suffix);
Opt.Ada_Final_Name :=
new String'(Argv (3 .. Argv'Last) & Opt.Ada_Final_Suffix);
Opt.Ada_Main_Name :=
new String'(Argv (3 .. Argv'Last) & Opt.Ada_Main_Name_Suffix);
-- This option (-Lxxx) implies -n
Opt.Bind_Main_Program := False;
else
Fail
("Prefix of initialization and finalization procedure names "
& "missing in -L");
end if;
-- -Sin -Slo -Shi -Sxx -Sev
elsif Argv'Length = 4
and then Argv (2) = 'S'
then
declare
C1 : Character := Argv (3);
C2 : Character := Argv (4);
begin
-- Fold to upper case
if C1 in 'a' .. 'z' then
C1 := Character'Val (Character'Pos (C1) - 32);
end if;
if C2 in 'a' .. 'z' then
C2 := Character'Val (Character'Pos (C2) - 32);
end if;
-- Test valid option and set mode accordingly
if C1 = 'E' and then C2 = 'V' then
null;
elsif C1 = 'I' and then C2 = 'N' then
null;
elsif C1 = 'L' and then C2 = 'O' then
null;
elsif C1 = 'H' and then C2 = 'I' then
null;
elsif (C1 in '0' .. '9' or else C1 in 'A' .. 'F')
and then
(C2 in '0' .. '9' or else C2 in 'A' .. 'F')
then
null;
-- Invalid -S switch, let Switch give error, set default of IN
else
Scan_Binder_Switches (Argv);
C1 := 'I';
C2 := 'N';
end if;
Initialize_Scalars_Mode1 := C1;
Initialize_Scalars_Mode2 := C2;
end;
-- -aIdir
elsif Argv'Length >= 3
and then Argv (2 .. 3) = "aI"
then
Add_Src_Search_Dir (Argv (4 .. Argv'Last));
-- -aOdir
elsif Argv'Length >= 3
and then Argv (2 .. 3) = "aO"
then
Add_Lib_Search_Dir (Argv (4 .. Argv'Last));
-- -nostdlib
elsif Argv (2 .. Argv'Last) = "nostdlib" then
Opt.No_Stdlib := True;
-- -nostdinc
elsif Argv (2 .. Argv'Last) = "nostdinc" then
Opt.No_Stdinc := True;
-- -static
elsif Argv (2 .. Argv'Last) = "static" then
Opt.Shared_Libgnat := False;
-- -shared
elsif Argv (2 .. Argv'Last) = "shared" then
Opt.Shared_Libgnat := True;
-- -F=mapping_file
elsif Argv'Length >= 4 and then Argv (2 .. 3) = "F=" then
if Mapping_File /= null then
Fail ("cannot specify several mapping files");
end if;
Mapping_File := new String'(Argv (4 .. Argv'Last));
-- -Mname
elsif Argv'Length >= 3 and then Argv (2) = 'M' then
if not Is_Cross_Compiler then
Write_Line
("gnatbind: -M not expected to be used on native platforms");
end if;
Opt.Bind_Alternate_Main_Name := True;
Opt.Alternate_Main_Name := new String'(Argv (3 .. Argv'Last));
-- All other options are single character and are handled by
-- Scan_Binder_Switches.
else
Scan_Binder_Switches (Argv);
end if;
-- Not a switch, so must be a file name (if non-empty)
elsif Argv'Length /= 0 then
if Argv'Length > 4
and then Argv (Argv'Last - 3 .. Argv'Last) = ".ali"
then
Add_File (Argv);
else
Add_File (Argv & ".ali");
end if;
end if;
end Scan_Bind_Arg;
----------------------------
-- Generic_Scan_Bind_Args --
----------------------------
procedure Generic_Scan_Bind_Args is
Next_Arg : Positive := 1;
begin
-- Use low level argument routines to avoid dragging in secondary stack
while Next_Arg < Arg_Count loop
declare
Next_Argv : String (1 .. Len_Arg (Next_Arg));
begin
Fill_Arg (Next_Argv'Address, Next_Arg);
if Next_Argv'Length > 0 then
if Next_Argv (1) = '@' then
if Next_Argv'Length > 1 then
declare
Arguments : constant Argument_List :=
Response_File.Arguments_From
(Response_File_Name =>
Next_Argv (2 .. Next_Argv'Last),
Recursive => True,
Ignore_Non_Existing_Files => True);
begin
for J in Arguments'Range loop
Action (Arguments (J).all);
end loop;
end;
end if;
else
Action (Next_Argv);
end if;
end if;
end;
Next_Arg := Next_Arg + 1;
end loop;
end Generic_Scan_Bind_Args;
---------------
-- Write_Arg --
---------------
procedure Write_Arg (S : String) is
begin
Write_Str (" " & S);
end Write_Arg;
procedure Check_Version_And_Help is
new Check_Version_And_Help_G (Bindusg.Display);
procedure Put_Bind_Args is new Generic_Scan_Bind_Args (Write_Arg);
procedure Scan_Bind_Args is new Generic_Scan_Bind_Args (Scan_Bind_Arg);
-- Start of processing for Gnatbind
begin
-- Set default for Shared_Libgnat option
declare
Shared_Libgnat_Default : Character;
pragma Import
(C, Shared_Libgnat_Default, "__gnat_shared_libgnat_default");
SHARED : constant Character := 'H';
STATIC : constant Character := 'T';
begin
pragma Assert
(Shared_Libgnat_Default = SHARED
or else
Shared_Libgnat_Default = STATIC);
Shared_Libgnat := (Shared_Libgnat_Default = SHARED);
end;
-- Carry out package initializations. These are initializations which
-- might logically be performed at elaboration time, and we decide to be
-- consistent. Like elaboration, the order in which these calls are made
-- is in some cases important.
Csets.Initialize;
Snames.Initialize;
-- Scan the switches and arguments. Note that Snames must already be
-- initialized (for processing of the -V switch).
-- First, scan to detect --version and/or --help
Check_Version_And_Help ("GNATBIND", "1992");
-- We need to Scan_Bind_Args first, to set Verbose_Mode, so we know whether
-- to Put_Bind_Args.
Scan_Bind_Args;
if Verbose_Mode then
Write_Str (Command_Name);
Put_Bind_Args;
Write_Eol;
end if;
if Use_Pragma_Linker_Constructor then
if Bind_Main_Program then
Fail ("switch -a must be used in conjunction with -n or -Lxxx");
elsif not Gnatbind_Supports_Auto_Init then
Fail ("automatic initialisation of elaboration not supported on this "
& "platform");
end if;
end if;
-- Test for trailing -o switch
if Opt.Output_File_Name_Present and then not Output_File_Name_Seen then
Fail ("output file name missing after -o");
end if;
-- Output usage if requested
if Usage_Requested then
Bindusg.Display;
end if;
-- Check that the binder file specified has extension .adb
if Opt.Output_File_Name_Present and then Output_File_Name_Seen then
Check_Extensions : declare
Length : constant Natural := Output_File_Name'Length;
Last : constant Natural := Output_File_Name'Last;
begin
if Length <= 4
or else Output_File_Name (Last - 3 .. Last) /= ".adb"
then
Fail ("output file name should have .adb extension");
end if;
end Check_Extensions;
end if;
Osint.Add_Default_Search_Dirs;
-- Acquire target parameters
Targparm.Get_Target_Parameters;
-- Initialize Cumulative_Restrictions with the restrictions on the target
-- scanned from the system.ads file. Then as we read ALI files, we will
-- accumulate additional restrictions specified in other files.
Cumulative_Restrictions := Targparm.Restrictions_On_Target;
-- Acquire configurable run-time mode
if Configurable_Run_Time_On_Target then
Configurable_Run_Time_Mode := True;
end if;
-- Output copyright notice if in verbose mode
if Verbose_Mode then
Write_Eol;
Display_Version ("GNATBIND", "1995");
end if;
-- Output usage information if no arguments
if not More_Lib_Files then
if Argument_Count = 0 then
Bindusg.Display;
else
Write_Line ("try ""gnatbind --help"" for more information.");
end if;
Exit_Program (E_Fatal);
end if;
-- If a mapping file was specified, initialize the file mapping
if Mapping_File /= null then
Fmap.Initialize (Mapping_File.all);
end if;
-- The block here is to catch the Unrecoverable_Error exception in the
-- case where we exceed the maximum number of permissible errors or some
-- other unrecoverable error occurs.
begin
-- Initialize binder packages
Initialize_Binderr;
Initialize_ALI;
Initialize_ALI_Source;
if Verbose_Mode then
Write_Eol;
end if;
-- Input ALI files
while More_Lib_Files loop
Main_Lib_File := Next_Main_Lib_File;
if First_Main_Lib_File = No_File then
First_Main_Lib_File := Main_Lib_File;
end if;
if Verbose_Mode then
if Check_Only then
Write_Str ("Checking: ");
else
Write_Str ("Binding: ");
end if;
Write_Name (Main_Lib_File);
Write_Eol;
end if;
Text := Read_Library_Info (Main_Lib_File, True);
declare
Id : ALI_Id;
pragma Warnings (Off, Id);
begin
Id := Scan_ALI
(F => Main_Lib_File,
T => Text,
Ignore_ED => False,
Err => False,
Ignore_Errors => Debug_Flag_I,
Directly_Scanned => True);
end;
Free (Text);
end loop;
-- No_Run_Time mode
if No_Run_Time_Mode then
-- Set standard configuration parameters
Suppress_Standard_Library_On_Target := True;
Configurable_Run_Time_Mode := True;
end if;
-- For main ALI files, even if they are interfaces, we get their
-- dependencies. To be sure, we reset the Interface flag for all main
-- ALI files.
for Index in ALIs.First .. ALIs.Last loop
ALIs.Table (Index).SAL_Interface := False;
end loop;
-- Add System.Standard_Library to list to ensure that these files are
-- included in the bind, even if not directly referenced from Ada code
-- This is suppressed if the appropriate targparm switch is set. Be sure
-- in any case that System is in the closure, as it may contain linker
-- options. Note that it will be automatically added if s-stalib is
-- added.
if not Suppress_Standard_Library_On_Target then
Add_Artificial_ALI_File ("s-stalib.ali");
else
Add_Artificial_ALI_File ("system.ali");
end if;
-- Load ALIs for all dependent units
for Index in ALIs.First .. ALIs.Last loop
Read_Withed_ALIs (Index);
end loop;
-- Quit if some file needs compiling
if No_Object_Specified then
raise Unrecoverable_Error;
end if;
-- Quit with message if we had a GNATprove file
if GNATprove_Mode_Specified then
Error_Msg ("one or more files compiled in GNATprove mode");
raise Unrecoverable_Error;
end if;
-- Output list of ALI files in closure
if Output_ALI_List then
if ALI_List_Filename /= null then
Set_List_File (ALI_List_Filename.all);
end if;
for Index in ALIs.First .. ALIs.Last loop
declare
Full_Afile : constant File_Name_Type :=
Find_File (ALIs.Table (Index).Afile, Library);
begin
Write_Name (Full_Afile);
Write_Eol;
end;
end loop;
if ALI_List_Filename /= null then
Close_List_File;
end if;
end if;
-- Build source file table from the ALI files we have read in
Set_Source_Table;
-- If there is main program to bind, set Main_Lib_File to the first
-- library file, and the name from which to derive the binder generate
-- file to the first ALI file.
if Bind_Main_Program then
Main_Lib_File := First_Main_Lib_File;
Set_Current_File_Name_Index (To => 1);
end if;
-- Check that main library file is a suitable main program
if Bind_Main_Program
and then ALIs.Table (ALIs.First).Main_Program = None
and then not No_Main_Subprogram
then
Get_Name_String
(Units.Table (ALIs.Table (ALIs.First).First_Unit).Uname);
declare
Unit_Name : String := Name_Buffer (1 .. Name_Len - 2);
begin
To_Mixed (Unit_Name);
Get_Name_String (ALIs.Table (ALIs.First).Sfile);
Add_Str_To_Name_Buffer (":1: ");
Add_Str_To_Name_Buffer (Unit_Name);
Add_Str_To_Name_Buffer (" cannot be used as a main program");
Write_Line (Name_Buffer (1 .. Name_Len));
Errors_Detected := Errors_Detected + 1;
end;
end if;
-- Perform consistency and correctness checks. Disable these in CodePeer
-- mode where we want to be more flexible.
if not CodePeer_Mode then
Check_Duplicated_Subunits;
Check_Versions;
Check_Consistency;
Check_Configuration_Consistency;
end if;
-- List restrictions that could be applied to this partition
if List_Restrictions then
List_Applicable_Restrictions;
end if;
-- Complete bind if no errors
if Errors_Detected = 0 then
declare
Elab_Order : Unit_Id_Table;
use Unit_Id_Tables;
begin
Find_Elab_Order (Elab_Order, First_Main_Lib_File);
if Errors_Detected = 0 and then not Check_Only then
Gen_Output_File
(Output_File_Name.all,
Elab_Order => Elab_Order.Table (First .. Last (Elab_Order)));
end if;
end;
end if;
Total_Errors := Total_Errors + Errors_Detected;
Total_Warnings := Total_Warnings + Warnings_Detected;
exception
when Unrecoverable_Error =>
Total_Errors := Total_Errors + Errors_Detected;
Total_Warnings := Total_Warnings + Warnings_Detected;
end;
-- All done. Set the proper exit status.
Finalize_Binderr;
Namet.Finalize;
if Total_Errors > 0 then
Exit_Program (E_Errors);
elsif Total_Warnings > 0 then
Exit_Program (E_Warnings);
else
-- Do not call Exit_Program (E_Success), so that finalization occurs
-- normally.
null;
end if;
end Gnatbind;
|
pragma Ada_2012;
pragma Style_Checks (Off);
pragma Warnings ("U");
with Interfaces.C; use Interfaces.C;
with arm_math_types_h;
with sys_ustdint_h;
package basic_math_functions_h is
procedure arm_mult_q7
(pSrcA : access arm_math_types_h.q7_t;
pSrcB : access arm_math_types_h.q7_t;
pDst : access arm_math_types_h.q7_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:53
with Import => True,
Convention => C,
External_Name => "arm_mult_q7";
procedure arm_mult_q15
(pSrcA : access arm_math_types_h.q15_t;
pSrcB : access arm_math_types_h.q15_t;
pDst : access arm_math_types_h.q15_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:67
with Import => True,
Convention => C,
External_Name => "arm_mult_q15";
procedure arm_mult_q31
(pSrcA : access arm_math_types_h.q31_t;
pSrcB : access arm_math_types_h.q31_t;
pDst : access arm_math_types_h.q31_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:81
with Import => True,
Convention => C,
External_Name => "arm_mult_q31";
procedure arm_mult_f32
(pSrcA : access arm_math_types_h.float32_t;
pSrcB : access arm_math_types_h.float32_t;
pDst : access arm_math_types_h.float32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:95
with Import => True,
Convention => C,
External_Name => "arm_mult_f32";
procedure arm_mult_f64
(pSrcA : access arm_math_types_h.float64_t;
pSrcB : access arm_math_types_h.float64_t;
pDst : access arm_math_types_h.float64_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:110
with Import => True,
Convention => C,
External_Name => "arm_mult_f64";
procedure arm_add_f32
(pSrcA : access arm_math_types_h.float32_t;
pSrcB : access arm_math_types_h.float32_t;
pDst : access arm_math_types_h.float32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:125
with Import => True,
Convention => C,
External_Name => "arm_add_f32";
procedure arm_add_f64
(pSrcA : access arm_math_types_h.float64_t;
pSrcB : access arm_math_types_h.float64_t;
pDst : access arm_math_types_h.float64_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:140
with Import => True,
Convention => C,
External_Name => "arm_add_f64";
procedure arm_add_q7
(pSrcA : access arm_math_types_h.q7_t;
pSrcB : access arm_math_types_h.q7_t;
pDst : access arm_math_types_h.q7_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:155
with Import => True,
Convention => C,
External_Name => "arm_add_q7";
procedure arm_add_q15
(pSrcA : access arm_math_types_h.q15_t;
pSrcB : access arm_math_types_h.q15_t;
pDst : access arm_math_types_h.q15_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:169
with Import => True,
Convention => C,
External_Name => "arm_add_q15";
procedure arm_add_q31
(pSrcA : access arm_math_types_h.q31_t;
pSrcB : access arm_math_types_h.q31_t;
pDst : access arm_math_types_h.q31_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:183
with Import => True,
Convention => C,
External_Name => "arm_add_q31";
procedure arm_sub_f32
(pSrcA : access arm_math_types_h.float32_t;
pSrcB : access arm_math_types_h.float32_t;
pDst : access arm_math_types_h.float32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:197
with Import => True,
Convention => C,
External_Name => "arm_sub_f32";
procedure arm_sub_f64
(pSrcA : access arm_math_types_h.float64_t;
pSrcB : access arm_math_types_h.float64_t;
pDst : access arm_math_types_h.float64_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:212
with Import => True,
Convention => C,
External_Name => "arm_sub_f64";
procedure arm_sub_q7
(pSrcA : access arm_math_types_h.q7_t;
pSrcB : access arm_math_types_h.q7_t;
pDst : access arm_math_types_h.q7_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:227
with Import => True,
Convention => C,
External_Name => "arm_sub_q7";
procedure arm_sub_q15
(pSrcA : access arm_math_types_h.q15_t;
pSrcB : access arm_math_types_h.q15_t;
pDst : access arm_math_types_h.q15_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:241
with Import => True,
Convention => C,
External_Name => "arm_sub_q15";
procedure arm_sub_q31
(pSrcA : access arm_math_types_h.q31_t;
pSrcB : access arm_math_types_h.q31_t;
pDst : access arm_math_types_h.q31_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:255
with Import => True,
Convention => C,
External_Name => "arm_sub_q31";
procedure arm_scale_f32
(pSrc : access arm_math_types_h.float32_t;
scale : arm_math_types_h.float32_t;
pDst : access arm_math_types_h.float32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:269
with Import => True,
Convention => C,
External_Name => "arm_scale_f32";
procedure arm_scale_f64
(pSrc : access arm_math_types_h.float64_t;
scale : arm_math_types_h.float64_t;
pDst : access arm_math_types_h.float64_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:284
with Import => True,
Convention => C,
External_Name => "arm_scale_f64";
procedure arm_scale_q7
(pSrc : access arm_math_types_h.q7_t;
scaleFract : arm_math_types_h.q7_t;
shift : sys_ustdint_h.int8_t;
pDst : access arm_math_types_h.q7_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:300
with Import => True,
Convention => C,
External_Name => "arm_scale_q7";
procedure arm_scale_q15
(pSrc : access arm_math_types_h.q15_t;
scaleFract : arm_math_types_h.q15_t;
shift : sys_ustdint_h.int8_t;
pDst : access arm_math_types_h.q15_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:316
with Import => True,
Convention => C,
External_Name => "arm_scale_q15";
procedure arm_scale_q31
(pSrc : access arm_math_types_h.q31_t;
scaleFract : arm_math_types_h.q31_t;
shift : sys_ustdint_h.int8_t;
pDst : access arm_math_types_h.q31_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:332
with Import => True,
Convention => C,
External_Name => "arm_scale_q31";
procedure arm_abs_q7
(pSrc : access arm_math_types_h.q7_t;
pDst : access arm_math_types_h.q7_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:346
with Import => True,
Convention => C,
External_Name => "arm_abs_q7";
procedure arm_abs_f32
(pSrc : access arm_math_types_h.float32_t;
pDst : access arm_math_types_h.float32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:358
with Import => True,
Convention => C,
External_Name => "arm_abs_f32";
procedure arm_abs_f64
(pSrc : access arm_math_types_h.float64_t;
pDst : access arm_math_types_h.float64_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:371
with Import => True,
Convention => C,
External_Name => "arm_abs_f64";
procedure arm_abs_q15
(pSrc : access arm_math_types_h.q15_t;
pDst : access arm_math_types_h.q15_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:384
with Import => True,
Convention => C,
External_Name => "arm_abs_q15";
procedure arm_abs_q31
(pSrc : access arm_math_types_h.q31_t;
pDst : access arm_math_types_h.q31_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:396
with Import => True,
Convention => C,
External_Name => "arm_abs_q31";
procedure arm_dot_prod_f32
(pSrcA : access arm_math_types_h.float32_t;
pSrcB : access arm_math_types_h.float32_t;
blockSize : sys_ustdint_h.uint32_t;
result : access arm_math_types_h.float32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:409
with Import => True,
Convention => C,
External_Name => "arm_dot_prod_f32";
procedure arm_dot_prod_f64
(pSrcA : access arm_math_types_h.float64_t;
pSrcB : access arm_math_types_h.float64_t;
blockSize : sys_ustdint_h.uint32_t;
result : access arm_math_types_h.float64_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:424
with Import => True,
Convention => C,
External_Name => "arm_dot_prod_f64";
procedure arm_dot_prod_q7
(pSrcA : access arm_math_types_h.q7_t;
pSrcB : access arm_math_types_h.q7_t;
blockSize : sys_ustdint_h.uint32_t;
result : access arm_math_types_h.q31_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:439
with Import => True,
Convention => C,
External_Name => "arm_dot_prod_q7";
procedure arm_dot_prod_q15
(pSrcA : access arm_math_types_h.q15_t;
pSrcB : access arm_math_types_h.q15_t;
blockSize : sys_ustdint_h.uint32_t;
result : access arm_math_types_h.q63_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:453
with Import => True,
Convention => C,
External_Name => "arm_dot_prod_q15";
procedure arm_dot_prod_q31
(pSrcA : access arm_math_types_h.q31_t;
pSrcB : access arm_math_types_h.q31_t;
blockSize : sys_ustdint_h.uint32_t;
result : access arm_math_types_h.q63_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:467
with Import => True,
Convention => C,
External_Name => "arm_dot_prod_q31";
procedure arm_shift_q7
(pSrc : access arm_math_types_h.q7_t;
shiftBits : sys_ustdint_h.int8_t;
pDst : access arm_math_types_h.q7_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:481
with Import => True,
Convention => C,
External_Name => "arm_shift_q7";
procedure arm_shift_q15
(pSrc : access arm_math_types_h.q15_t;
shiftBits : sys_ustdint_h.int8_t;
pDst : access arm_math_types_h.q15_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:495
with Import => True,
Convention => C,
External_Name => "arm_shift_q15";
procedure arm_shift_q31
(pSrc : access arm_math_types_h.q31_t;
shiftBits : sys_ustdint_h.int8_t;
pDst : access arm_math_types_h.q31_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:509
with Import => True,
Convention => C,
External_Name => "arm_shift_q31";
procedure arm_offset_f64
(pSrc : access arm_math_types_h.float64_t;
offset : arm_math_types_h.float64_t;
pDst : access arm_math_types_h.float64_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:523
with Import => True,
Convention => C,
External_Name => "arm_offset_f64";
procedure arm_offset_f32
(pSrc : access arm_math_types_h.float32_t;
offset : arm_math_types_h.float32_t;
pDst : access arm_math_types_h.float32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:538
with Import => True,
Convention => C,
External_Name => "arm_offset_f32";
procedure arm_offset_q7
(pSrc : access arm_math_types_h.q7_t;
offset : arm_math_types_h.q7_t;
pDst : access arm_math_types_h.q7_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:553
with Import => True,
Convention => C,
External_Name => "arm_offset_q7";
procedure arm_offset_q15
(pSrc : access arm_math_types_h.q15_t;
offset : arm_math_types_h.q15_t;
pDst : access arm_math_types_h.q15_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:567
with Import => True,
Convention => C,
External_Name => "arm_offset_q15";
procedure arm_offset_q31
(pSrc : access arm_math_types_h.q31_t;
offset : arm_math_types_h.q31_t;
pDst : access arm_math_types_h.q31_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:581
with Import => True,
Convention => C,
External_Name => "arm_offset_q31";
procedure arm_negate_f32
(pSrc : access arm_math_types_h.float32_t;
pDst : access arm_math_types_h.float32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:594
with Import => True,
Convention => C,
External_Name => "arm_negate_f32";
procedure arm_negate_f64
(pSrc : access arm_math_types_h.float64_t;
pDst : access arm_math_types_h.float64_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:607
with Import => True,
Convention => C,
External_Name => "arm_negate_f64";
procedure arm_negate_q7
(pSrc : access arm_math_types_h.q7_t;
pDst : access arm_math_types_h.q7_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:620
with Import => True,
Convention => C,
External_Name => "arm_negate_q7";
procedure arm_negate_q15
(pSrc : access arm_math_types_h.q15_t;
pDst : access arm_math_types_h.q15_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:632
with Import => True,
Convention => C,
External_Name => "arm_negate_q15";
procedure arm_negate_q31
(pSrc : access arm_math_types_h.q31_t;
pDst : access arm_math_types_h.q31_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:644
with Import => True,
Convention => C,
External_Name => "arm_negate_q31";
procedure arm_and_u16
(pSrcA : access sys_ustdint_h.uint16_t;
pSrcB : access sys_ustdint_h.uint16_t;
pDst : access sys_ustdint_h.uint16_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:657
with Import => True,
Convention => C,
External_Name => "arm_and_u16";
procedure arm_and_u32
(pSrcA : access sys_ustdint_h.uint32_t;
pSrcB : access sys_ustdint_h.uint32_t;
pDst : access sys_ustdint_h.uint32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:671
with Import => True,
Convention => C,
External_Name => "arm_and_u32";
procedure arm_and_u8
(pSrcA : access sys_ustdint_h.uint8_t;
pSrcB : access sys_ustdint_h.uint8_t;
pDst : access sys_ustdint_h.uint8_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:685
with Import => True,
Convention => C,
External_Name => "arm_and_u8";
procedure arm_or_u16
(pSrcA : access sys_ustdint_h.uint16_t;
pSrcB : access sys_ustdint_h.uint16_t;
pDst : access sys_ustdint_h.uint16_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:699
with Import => True,
Convention => C,
External_Name => "arm_or_u16";
procedure arm_or_u32
(pSrcA : access sys_ustdint_h.uint32_t;
pSrcB : access sys_ustdint_h.uint32_t;
pDst : access sys_ustdint_h.uint32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:713
with Import => True,
Convention => C,
External_Name => "arm_or_u32";
procedure arm_or_u8
(pSrcA : access sys_ustdint_h.uint8_t;
pSrcB : access sys_ustdint_h.uint8_t;
pDst : access sys_ustdint_h.uint8_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:727
with Import => True,
Convention => C,
External_Name => "arm_or_u8";
procedure arm_not_u16
(pSrc : access sys_ustdint_h.uint16_t;
pDst : access sys_ustdint_h.uint16_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:740
with Import => True,
Convention => C,
External_Name => "arm_not_u16";
procedure arm_not_u32
(pSrc : access sys_ustdint_h.uint32_t;
pDst : access sys_ustdint_h.uint32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:752
with Import => True,
Convention => C,
External_Name => "arm_not_u32";
procedure arm_not_u8
(pSrc : access sys_ustdint_h.uint8_t;
pDst : access sys_ustdint_h.uint8_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:764
with Import => True,
Convention => C,
External_Name => "arm_not_u8";
procedure arm_xor_u16
(pSrcA : access sys_ustdint_h.uint16_t;
pSrcB : access sys_ustdint_h.uint16_t;
pDst : access sys_ustdint_h.uint16_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:777
with Import => True,
Convention => C,
External_Name => "arm_xor_u16";
procedure arm_xor_u32
(pSrcA : access sys_ustdint_h.uint32_t;
pSrcB : access sys_ustdint_h.uint32_t;
pDst : access sys_ustdint_h.uint32_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:791
with Import => True,
Convention => C,
External_Name => "arm_xor_u32";
procedure arm_xor_u8
(pSrcA : access sys_ustdint_h.uint8_t;
pSrcB : access sys_ustdint_h.uint8_t;
pDst : access sys_ustdint_h.uint8_t;
blockSize : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:805
with Import => True,
Convention => C,
External_Name => "arm_xor_u8";
procedure arm_clip_f32
(pSrc : access arm_math_types_h.float32_t;
pDst : access arm_math_types_h.float32_t;
low : arm_math_types_h.float32_t;
high : arm_math_types_h.float32_t;
numSamples : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:821
with Import => True,
Convention => C,
External_Name => "arm_clip_f32";
procedure arm_clip_q31
(pSrc : access arm_math_types_h.q31_t;
pDst : access arm_math_types_h.q31_t;
low : arm_math_types_h.q31_t;
high : arm_math_types_h.q31_t;
numSamples : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:837
with Import => True,
Convention => C,
External_Name => "arm_clip_q31";
procedure arm_clip_q15
(pSrc : access arm_math_types_h.q15_t;
pDst : access arm_math_types_h.q15_t;
low : arm_math_types_h.q15_t;
high : arm_math_types_h.q15_t;
numSamples : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:853
with Import => True,
Convention => C,
External_Name => "arm_clip_q15";
procedure arm_clip_q7
(pSrc : access arm_math_types_h.q7_t;
pDst : access arm_math_types_h.q7_t;
low : arm_math_types_h.q7_t;
high : arm_math_types_h.q7_t;
numSamples : sys_ustdint_h.uint32_t) -- ../CMSIS_5/CMSIS/DSP/Include/dsp/basic_math_functions.h:869
with Import => True,
Convention => C,
External_Name => "arm_clip_q7";
end basic_math_functions_h;
|
<?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>Loop_3_proc</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>p_p2_mul1_stencil_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></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>hw_output_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned int, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</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>hw_output_V_last_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned int, 1, 1, 1, 1&gt; &gt;.V.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</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>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>23</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>indvar_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>p_hw_output_y_scan_1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>213</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>213</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>p_hw_output_x_scan_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_hw_output_x___scan_dim_0</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>93</item>
<item>94</item>
<item>95</item>
<item>96</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>exitcond_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>97</item>
<item>99</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>indvar_flatten_next</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>100</item>
<item>102</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>103</item>
<item>104</item>
<item>105</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>exitcond7</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>213</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>213</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>38</item>
<item>40</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>p_hw_output_x_scan_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>213</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>213</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>41</item>
<item>43</item>
<item>44</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>p_hw_output_y_scan_2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>211</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>45</item>
<item>47</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>tmp_7_mid1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>48</item>
<item>50</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>tmp_1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>51</item>
<item>52</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>tmp_7_mid2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>53</item>
<item>54</item>
<item>55</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>p_hw_output_y_scan_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>213</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>213</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>56</item>
<item>57</item>
<item>58</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>tmp_value_V_5</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>219</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>219</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>60</item>
<item>61</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>tmp_3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>29</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>63</item>
<item>64</item>
<item>66</item>
<item>68</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>p_405</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_405</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>tmp_2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>70</item>
<item>72</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>tmp_last_V</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>229</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>73</item>
<item>74</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>234</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>234</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>76</item>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>p_hw_output_x_scan_1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>213</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>213</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_hw_output_x___scan_dim_0</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>81</item>
<item>82</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>213</lineNumber>
<contextFuncName>hls_target</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>213</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_27">
<Value>
<Obj>
<type>2</type>
<id>39</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1917</content>
</item>
<item class_id_reference="16" object_id="_28">
<Value>
<Obj>
<type>2</type>
<id>42</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_29">
<Value>
<Obj>
<type>2</type>
<id>46</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_30">
<Value>
<Obj>
<type>2</type>
<id>49</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1076</content>
</item>
<item class_id_reference="16" object_id="_31">
<Value>
<Obj>
<type>2</type>
<id>65</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_32">
<Value>
<Obj>
<type>2</type>
<id>67</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>31</content>
</item>
<item class_id_reference="16" object_id="_33">
<Value>
<Obj>
<type>2</type>
<id>71</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1916</content>
</item>
<item class_id_reference="16" object_id="_34">
<Value>
<Obj>
<type>2</type>
<id>84</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>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_35">
<Value>
<Obj>
<type>2</type>
<id>98</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>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>2064609</content>
</item>
<item class_id_reference="16" object_id="_36">
<Value>
<Obj>
<type>2</type>
<id>101</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>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_37">
<Obj>
<type>3</type>
<id>7</id>
<name>newFuncRoot</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_38">
<Obj>
<type>3</type>
<id>14</id>
<name>.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_39">
<Obj>
<type>3</type>
<id>34</id>
<name>.preheader37</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>15</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>32</item>
<item>33</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_40">
<Obj>
<type>3</type>
<id>36</id>
<name>.exitStub</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>57</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_41">
<id>37</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_42">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_43">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_44">
<id>41</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_45">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>48</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>83</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>86</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>88</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>90</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>92</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>94</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>96</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>104</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>105</id>
<edge_type>2</edge_type>
<source_obj>36</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>165</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>166</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>167</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>168</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>14</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_98">
<mId>1</mId>
<mTag>Loop_3_proc</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2064613</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_99">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_100">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>34</item>
</basic_blocks>
<mII>1</mII>
<mDepth>4</mDepth>
<mMinTripCount>2064609</mMinTripCount>
<mMaxTripCount>2064609</mMaxTripCount>
<mMinLatency>2064611</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_101">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>23</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>6</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>35</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>4</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>7</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>1</first>
<second>4</second>
</second>
</item>
<item>
<first>36</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="_102">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>34</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>4</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
------------------------------------------------------------------------------
-- EMAIL: <darkestkhan@gmail.com> --
-- License: ISC --
-- --
-- Copyright © 2015 - 2016 darkestkhan --
------------------------------------------------------------------------------
-- Permission to use, copy, modify, and/or distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- The software is provided "as is" and the author disclaims all warranties --
-- with regard to this software including all implied warranties of --
-- merchantability and fitness. In no event shall the author be liable for --
-- any special, direct, indirect, or consequential damages or any damages --
-- whatsoever resulting from loss of use, data or profits, whether in an --
-- action of contract, negligence or other tortious action, arising out of --
-- or in connection with the use or performance of this software. --
------------------------------------------------------------------------------
with System;
with Imago.Binary;
use Imago;
package Imago.IL is
--------------------------------------------------------------------------
---------------
-- T Y P E S --
---------------
--------------------------------------------------------------------------
-- New names for old types.
subtype Bitfield is Binary.Word;
subtype Bool is Binary.Byte;
subtype Byte is Binary.S_Byte;
subtype ClampD is Long_Float range 0.0 .. 1.0;
subtype ClampF is Float range 0.0 .. 1.0;
subtype ClampH is Short_Float range 0.0 .. 1.0;
subtype Double is Long_Float;
subtype Int is Integer;
subtype Short is Short_Integer;
subtype SizeI is Integer;
subtype UByte is Binary.Byte;
subtype UShort is Binary.Short;
subtype UInt is Binary.Word;
subtype Pointer is System.Address;
--------------------------------------------------------------------------
-- Try to bring some touch of order to the ILenum mess.
subtype Enum is Binary.Word;
--------------------------------------------------------------------------
-----------------------
-- C O N S T A N T S --
-----------------------
--------------------------------------------------------------------------
-- Useful values.
Null_Pointer: constant Pointer := System.Null_Address;
--------------------------------------------------------------------------
-- "Enumeration" constants.
IL_FALSE : constant Bool := 16#0#;
IL_TRUE : constant Bool := 16#1#;
-- Data formats.
IL_COLOUR_INDEX : constant Enum := 16#1900#;
IL_COLOR_INDEX : constant Enum := 16#1900#;
IL_ALPHA : constant Enum := 16#1906#;
IL_RGB : constant Enum := 16#1907#;
IL_RGBA : constant Enum := 16#1908#;
IL_BGR : constant Enum := 16#80E0#;
IL_BGRA : constant Enum := 16#80E1#;
IL_LUMINANCE : constant Enum := 16#1909#;
IL_LUMINANCE_ALPHA : constant Enum := 16#190A#;
-- Types of data.
IL_BYTE : constant Enum := 16#1400#;
IL_UNSIGNED_BYTE : constant Enum := 16#1401#;
IL_SHORT : constant Enum := 16#1402#;
IL_UNSIGNED_SHORT : constant Enum := 16#1403#;
IL_INT : constant Enum := 16#1404#;
IL_UNSIGNED_INT : constant Enum := 16#1405#;
IL_FLOAT : constant Enum := 16#1406#;
IL_DOUBLE : constant Enum := 16#140A#;
IL_HALF : constant Enum := 16#140B#;
-- IL specific defines.
IL_VENDOR : constant Enum := 16#1F00#;
IL_LOAD_EXT : constant Enum := 16#1F01#;
IL_SAVE_EXT : constant Enum := 16#1F02#;
IL_VERSION_1_7_8 : constant Enum := 16#1#;
IL_VERSION : constant Enum := 178;
-- Attribute bits.
IL_ORIGIN_BIT : constant Bitfield := 16#0000_0001#;
IL_FILE_BIT : constant Bitfield := 16#0000_0002#;
IL_PAL_BIT : constant Bitfield := 16#0000_0004#;
IL_FORMAT_BIT : constant Bitfield := 16#0000_0008#;
IL_TYPE_BIT : constant Bitfield := 16#0000_0010#;
IL_COMPRESS_BIT : constant Bitfield := 16#0000_0020#;
IL_LOADFAIL_BIT : constant Bitfield := 16#0000_0040#;
IL_FORMAT_SPECIFIC_BIT : constant Bitfield := 16#0000_0080#;
IL_ALL_ATTRIB_BITS : constant Bitfield := 16#000F_FFFF#;
-- Types of palettes.
IL_PAL_NONE : constant Enum := 16#0400#;
IL_PAL_RGB24 : constant Enum := 16#0401#;
IL_PAL_RGB32 : constant Enum := 16#0402#;
IL_PAL_RGBA32 : constant Enum := 16#0403#;
IL_PAL_BGR24 : constant Enum := 16#0404#;
IL_PAL_BGR32 : constant Enum := 16#0405#;
IL_PAL_BGRA32 : constant Enum := 16#0406#;
-- Types of images.
IL_TYPE_UNKNOWN : constant Enum := 16#0000#;
IL_BMP : constant Enum := 16#0420#;
IL_CUT : constant Enum := 16#0421#;
IL_DOOM : constant Enum := 16#0422#;
IL_DOOM_FLAT : constant Enum := 16#0423#;
IL_ICO : constant Enum := 16#0424#;
IL_JPG : constant Enum := 16#0425#;
IL_JFIF : constant Enum := 16#0425#;
IL_ILBM : constant Enum := 16#0426#;
IL_PCD : constant Enum := 16#0427#;
IL_PCX : constant Enum := 16#0428#;
IL_PIC : constant Enum := 16#0429#;
IL_PNG : constant Enum := 16#042A#;
IL_PNM : constant Enum := 16#042B#;
IL_SGI : constant Enum := 16#042C#;
IL_TGA : constant Enum := 16#042D#;
IL_TIF : constant Enum := 16#042E#;
IL_CHEAD : constant Enum := 16#042F#;
IL_RAW : constant Enum := 16#0430#;
IL_MDL : constant Enum := 16#0431#;
IL_WAL : constant Enum := 16#0432#;
IL_LIF : constant Enum := 16#0434#;
IL_MNG : constant Enum := 16#0435#;
IL_JNG : constant Enum := 16#0435#;
IL_GIF : constant Enum := 16#0436#;
IL_DDS : constant Enum := 16#0437#;
IL_DCX : constant Enum := 16#0438#;
IL_PSD : constant Enum := 16#0439#;
IL_EXIF : constant Enum := 16#043A#;
IL_PSP : constant Enum := 16#043B#;
IL_PIX : constant Enum := 16#043C#;
IL_PXR : constant Enum := 16#043D#;
IL_XPM : constant Enum := 16#043E#;
IL_HDR : constant Enum := 16#043F#;
IL_ICNS : constant Enum := 16#0440#;
IL_JP2 : constant Enum := 16#0441#;
IL_EXR : constant Enum := 16#0442#;
IL_WDP : constant Enum := 16#0443#;
IL_VTF : constant Enum := 16#0444#;
IL_WBMP : constant Enum := 16#0445#;
IL_SUN : constant Enum := 16#0446#;
IL_IFF : constant Enum := 16#0447#;
IL_TPL : constant Enum := 16#0448#;
IL_FITS : constant Enum := 16#0449#;
IL_DICOM : constant Enum := 16#044A#;
IL_IWI : constant Enum := 16#044B#;
IL_BLP : constant Enum := 16#044C#;
IL_FTX : constant Enum := 16#044D#;
IL_ROT : constant Enum := 16#044E#;
IL_TEXTURE : constant Enum := 16#044F#;
IL_DPX : constant Enum := 16#0450#;
IL_UTX : constant Enum := 16#0451#;
IL_MP3 : constant Enum := 16#0452#;
IL_JASC_PAL : constant Enum := 16#0475#;
-- Types of errors.
IL_NO_ERROR : constant Enum := 16#0000#;
IL_INVALID_ENUM : constant Enum := 16#0501#;
IL_OUT_OF_MEMORY : constant Enum := 16#0502#;
IL_FORMAT_NOT_SUPPORTED : constant Enum := 16#0503#;
IL_INTERNAL_ERROR : constant Enum := 16#0504#;
IL_INVALID_VALUE : constant Enum := 16#0505#;
IL_ILLEGAL_OPERATION : constant Enum := 16#0506#;
IL_ILLEGAL_FILE_VALUE : constant Enum := 16#0507#;
IL_INVALID_FILE_HEADER : constant Enum := 16#0508#;
IL_INVALID_PARAM : constant Enum := 16#0509#;
IL_COULD_NOT_OPEN_FILE : constant Enum := 16#050A#;
IL_INVALID_EXTENSION : constant Enum := 16#050B#;
IL_FILE_ALREADY_EXISTS : constant Enum := 16#050C#;
IL_OUT_FORMAT_SAME : constant Enum := 16#050D#;
IL_STACK_OVERFLOW : constant Enum := 16#050E#;
IL_STACK_UNDERFLOW : constant Enum := 16#050F#;
IL_INVALID_CONVERSION : constant Enum := 16#0510#;
IL_BAD_DIMENSIONS : constant Enum := 16#0511#;
IL_FILE_READ_ERROR : constant Enum := 16#0512#;
IL_FILE_WRITE_ERROR : constant Enum := 16#0513#;
IL_LIB_GIF_ERROR : constant Enum := 16#05E1#;
IL_LIB_JPEG_ERROR : constant Enum := 16#05E2#;
IL_LIB_PNG_ERROR : constant Enum := 16#05E3#;
IL_LIB_TIFF_ERROR : constant Enum := 16#05E4#;
IL_LIB_MNG_ERROR : constant Enum := 16#05E5#;
IL_LIB_JP2_ERROR : constant Enum := 16#05E6#;
IL_LIB_EXR_ERROR : constant Enum := 16#05E7#;
IL_UNKNOWN_ERROR : constant Enum := 16#05FF#;
-- Origin definitions.
IL_ORIGIN_SET : constant Enum := 16#0600#;
IL_ORIGIN_LOWER_LEFT : constant Enum := 16#0601#;
IL_ORIGIN_UPPER_LEFT : constant Enum := 16#0602#;
IL_ORIGIN_MODE : constant Enum := 16#0603#;
-- Format and type mode definitions.
IL_FORMAT_SET : constant Enum := 16#0610#;
IL_FORMAT_MODE : constant Enum := 16#0611#;
IL_TYPE_SET : constant Enum := 16#0612#;
IL_TYPE_MODE : constant Enum := 16#0613#;
-- File definitions.
IL_FILE_OVERWRITE : constant Enum := 16#0620#;
IL_FILE_MODE : constant Enum := 16#0621#;
-- Palette difinitions.
IL_CONV_PAL : constant Enum := 16#0630#;
-- Load fail definitions.
IL_DEFAULT_ON_FAIL : constant Enum := 16#0632#;
-- Key colour and alpha definitions.
IL_USE_KEY_COLOUR : constant Enum := 16#0635#;
IL_USE_KEY_COLOR : constant Enum := 16#0635#;
IL_BLIT_BLEND : constant Enum := 16#0636#;
-- Interlace definitions.
IL_SAVE_INTERLACED : constant Enum := 16#0639#;
IL_INTERLACE_MODE : constant Enum := 16#063A#;
-- Quantization definitions.
IL_QUANTIZATION_MODE : constant Enum := 16#0640#;
IL_WU_QUANT : constant Enum := 16#0641#;
IL_NEU_QUANT : constant Enum := 16#0642#;
IL_NEU_QUANT_SAMPLE : constant Enum := 16#0643#;
IL_MAX_QUANT_INDEXS : constant Enum := 16#0644#;
IL_MAX_QUANT_INDICES : constant Enum := 16#0644#;
-- Hints.
IL_FASTEST : constant Enum := 16#0660#;
IL_LESS_MEM : constant Enum := 16#0661#;
IL_DONT_CARE : constant Enum := 16#0662#;
IL_MEM_SPEED_HINT : constant Enum := 16#0665#;
IL_USE_COMPRESSION : constant Enum := 16#0666#;
IL_NO_COMPRESSION : constant Enum := 16#0667#;
IL_COMPRESSION_HINT : constant Enum := 16#0668#;
-- Compression.
IL_NVIDIA_COMPRESS : constant Enum := 16#0670#;
IL_SQUISH_COMPRESS : constant Enum := 16#0671#;
-- Subimage types.
IL_SUB_NEXT : constant Enum := 16#0680#;
IL_SUB_MIPMAP : constant Enum := 16#0681#;
IL_SUB_LAYER : constant Enum := 16#0682#;
-- Compression definitions.
IL_COMPRESS_MODE : constant Enum := 16#0700#;
IL_COMPRESS_NONE : constant Enum := 16#0701#;
IL_COMPRESS_RLE : constant Enum := 16#0702#;
IL_COMPRESS_LZO : constant Enum := 16#0703#;
IL_COMPRESS_ZLIB : constant Enum := 16#0704#;
-- File format specific values.
IL_TGA_CREATE_STAMP : constant Enum := 16#0710#;
IL_JPG_QUALITY : constant Enum := 16#0711#;
IL_PNG_INTERLACE : constant Enum := 16#0712#;
IL_TGA_RLE : constant Enum := 16#0713#;
IL_BMP_RLE : constant Enum := 16#0714#;
IL_SGI_RLE : constant Enum := 16#0715#;
IL_TGA_ID_STRING : constant Enum := 16#0717#;
IL_TGA_AUTHNAME_STRING : constant Enum := 16#0718#;
IL_TGA_AUTHCOMMENT_STRING : constant Enum := 16#0719#;
IL_PNG_AUTHNAME_STRING : constant Enum := 16#071A#;
IL_PNG_TITLE_STRING : constant Enum := 16#071B#;
IL_PNG_DESCRIPTION_STRING : constant Enum := 16#071C#;
IL_TIF_DESCRIPTION_STRING : constant Enum := 16#071D#;
IL_TIF_HOSTCOMPUTER_STRING : constant Enum := 16#071E#;
IL_TIF_DOCUMENTNAME_STRING : constant Enum := 16#071F#;
IL_TIF_AUTHNAME_STRING : constant Enum := 16#0720#;
IL_JPG_SAVE_FORMAT : constant Enum := 16#0721#;
IL_CHEAD_HEADER_STRING : constant Enum := 16#0722#;
IL_PCD_PICNUM : constant Enum := 16#0723#;
IL_PNG_ALPHA_INDEX : constant Enum := 16#0724#;
IL_JPG_PROGRESSIVE : constant Enum := 16#0725#;
IL_VTF_COMP : constant Enum := 16#0726#;
-- DXTC definitions.
IL_DXTC_FORMAT : constant Enum := 16#0705#;
IL_DXT1 : constant Enum := 16#0706#;
IL_DXT2 : constant Enum := 16#0707#;
IL_DXT3 : constant Enum := 16#0708#;
IL_DXT4 : constant Enum := 16#0709#;
IL_DXT5 : constant Enum := 16#070A#;
IL_DXT_NO_COMP : constant Enum := 16#070B#;
IL_KEEP_DXTC_DATA : constant Enum := 16#070C#;
IL_DXTC_DATA_FORMAT : constant Enum := 16#070D#;
IL_3DC : constant Enum := 16#070E#;
IL_RXGB : constant Enum := 16#070F#;
IL_ATI1N : constant Enum := 16#0710#;
IL_DXT1A : constant Enum := 16#0711#;
-- Environment map definitions.
IL_CUBEMAP_POSITIVEX : constant Bitfield := 16#00000400#;
IL_CUBEMAP_NEGATIVEX : constant Bitfield := 16#00000800#;
IL_CUBEMAP_POSITIVEY : constant Bitfield := 16#00001000#;
IL_CUBEMAP_NEGATIVEY : constant Bitfield := 16#00002000#;
IL_CUBEMAP_POSITIVEZ : constant Bitfield := 16#00004000#;
IL_CUBEMAP_NEGATIVEZ : constant Bitfield := 16#00008000#;
IL_SPHEREMAP : constant Bitfield := 16#00010000#;
-- Values.
IL_VERSION_NUM : constant Enum := 16#0DE2#;
IL_IMAGE_WIDTH : constant Enum := 16#0DE4#;
IL_IMAGE_HEIGHT : constant Enum := 16#0DE5#;
IL_IMAGE_DEPTH : constant Enum := 16#0DE6#;
IL_IMAGE_SIZE_OF_DATA : constant Enum := 16#0DE7#;
IL_IMAGE_BPP : constant Enum := 16#0DE8#;
IL_IMAGE_BYTES_PER_PIXEL : constant Enum := 16#0DE8#;
IL_IMAGE_BITS_PER_PIXEL : constant Enum := 16#0DE9#;
IL_IMAGE_FORMAT : constant Enum := 16#0DEA#;
IL_IMAGE_TYPE : constant Enum := 16#0DEB#;
IL_PALETTE_TYPE : constant Enum := 16#0DEC#;
IL_PALETTE_SIZE : constant Enum := 16#0DED#;
IL_PALETTE_BPP : constant Enum := 16#0DEE#;
IL_PALETTE_NUM_COLS : constant Enum := 16#0DEF#;
IL_PALETTE_BASE_TYPE : constant Enum := 16#0DF0#;
IL_NUM_FACES : constant Enum := 16#0DE1#;
IL_NUM_IMAGES : constant Enum := 16#0DF1#;
IL_NUM_MIPMAPS : constant Enum := 16#0DF2#;
IL_NUM_LAYERS : constant Enum := 16#0DF3#;
IL_ACTIVE_IMAGE : constant Enum := 16#0DF4#;
IL_ACTIVE_MIPMAP : constant Enum := 16#0DF5#;
IL_ACTIVE_LAYER : constant Enum := 16#0DF6#;
IL_ACTIVE_FACE : constant Enum := 16#0E00#;
IL_CUR_IMAGE : constant Enum := 16#0DF7#;
IL_IMAGE_DURATION : constant Enum := 16#0DF8#;
IL_IMAGE_PLANESIZE : constant Enum := 16#0DF9#;
IL_IMAGE_BPC : constant Enum := 16#0DFA#;
IL_IMAGE_OFFX : constant Enum := 16#0DFB#;
IL_IMAGE_OFFY : constant Enum := 16#0DFC#;
IL_IMAGE_CUBEFLAGS : constant Enum := 16#0DFD#;
IL_IMAGE_ORIGIN : constant Enum := 16#0DFE#;
IL_IMAGE_CHANNELS : constant Enum := 16#0DFF#;
IL_SEEK_SET : constant Int := 0;
IL_SEEK_CUR : constant Int := 1;
IL_SEEK_END : constant Int := 2;
IL_EOF : constant Int := -1;
--------------------------------------------------------------------------
---------------------------
-- S U B P R O G R A M S --
---------------------------
--------------------------------------------------------------------------
function Active_Face (Number: in UInt) return Bool
with Import => True, Convention => StdCall, External_Name => "ilActiveFace";
function Active_Image (Number: in UInt) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilActiveImage";
function Active_Layer (Number: in UInt) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilActiveLayer";
function Active_Mipmap (Number: in UInt) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilActiveMipmap";
function Apply_Pal (File_Name: in String) return Bool
with Inline => True;
-- NOTE: Is this correct way to bind to this function?
-- Probably not, but will try fixing it once something breaks over this.
function Apply_Profile
( In_Profile: in String; Out_Profile: in String
) return Bool
with Inline => True;
procedure Bind_Image (Image: in UInt)
with Import => True, Convention => StdCall, External_Name => "ilBindImage";
function Blit
( Source: in UInt; DestX: in Int; DestY: in Int; DestZ: in Int;
SrcX: in UInt; SrcY: in UInt; SrcZ: in UInt;
Width: in UInt; Height: in UInt; Depth: in UInt
) return Bool
with Import => True, Convention => StdCall, External_Name => "ilBlit";
function Clamp_NTSC return Bool
with Import => True, Convention => StdCall, External_Name => "ilClampNTSC";
procedure Clear_Color
( Red: in ClampF; Green: in ClampF; Blue: in ClampF; Alpha: in ClampF )
with Import => True, Convention => StdCall,
External_Name => "ilClearColour";
procedure Clear_Colour
( Red: in ClampF; Green: in ClampF; Blue: in ClampF; Alpha: in ClampF )
with Import => True, Convention => StdCall,
External_Name => "ilClearColour";
function Clear_Image return Bool
with Import => True, Convention => StdCall, External_Name => "ilClearImage";
function Clone_Cur_Image return UInt
with Import => True, Convention => StdCall,
External_Name => "ilCloneCurImage";
function Compress_DXT
( Data: in Pointer; Width: in UInt; Height: in UInt;
Depth: in UInt; DXTC_Format: in Enum; DXTC_Size: in Pointer
) return Pointer
with Import => True, Convention => StdCall,
External_Name => "ilCompressDXT";
function Compress_Func (Mode: in Enum) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilCompressFunc";
function Convert_Image (Dest_Format: in Enum; Dest_Type: in Enum) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilConvertImage";
function Convert_Pal (Dest_Format: in Enum) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilConvertPal";
function Copy_Image (Src: in UInt) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilCopyImage";
function Copy_Pixels
( XOff: in UInt; YOff: in UInt; ZOff: in UInt;
Width: in UInt; Height: in UInt; Depth: in UInt;
Format: in Enum; Type_Of: in Enum; Data: in Pointer
) return UInt
with Import => True, Convention => StdCall,
External_Name => "ilCopyPixels";
function Create_Sub_Image (Type_Of: in Enum; Num: in UInt) return UInt
with Import => True, Convention => StdCall,
External_Name => "ilCreateSubImage";
function Default_Image return Bool
with Import => True, Convention => StdCall,
External_Name => "ilDefaultImage";
procedure Delete_Image (Num: in UInt)
with Import => True, Convention => StdCall,
External_Name => "ilDeleteImage";
procedure Delete_Images (Num: in SizeI; Images: in Pointer)
with Import => True, Convention => StdCall,
External_Name => "ilDeleteImages";
function Determine_Type (File_Name: in String) return Enum
with Inline => True;
function Determine_Type (Lump: in Pointer; Size: in UInt) return Enum
with Import => True, Convention => StdCall,
External_Name => "ilDetermineTypeL";
function Disable (Mode: in Enum) return Bool
with Import => True, Convention => StdCall, External_Name => "ilDisable";
function DXTC_Data_To_Image return Bool
with Import => True, Convention => StdCall,
External_Name => "ilDxtcDataToImage";
function DXTC_Data_To_Surface return Bool
with Import => True, Convention => StdCall,
External_Name => "ilDxtcDataToSurface";
function Enable (Mode: in Enum) return Bool
with Import => True, Convention => StdCall, External_Name => "ilEnable";
procedure Flip_Surface_DXTC_Data
with Import => True, Convention => StdCall,
External_Name => "ilFlipSurfaceDxtcData";
function Format_Func (Mode: in Enum) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilFormatFunc";
function Get_Alpha (Type_Of: in Enum) return Pointer
with Import => True, Convention => StdCall, External_Name => "ilGetAlpha";
function Gen_Image return UInt
with Import => True, Convention => StdCall, External_Name => "ilGenImage";
procedure Gen_Images (Num: in SizeI; Images: in Pointer)
with Import => True, Convention => StdCall, External_Name => "ilGenImages";
function Get_Boolean (Mode: in Enum) return Bool
with Import => True, Convention => StdCall, External_Name => "ilGetBoolean";
procedure Get_Boolean (Mode: in Enum; Param: in Pointer)
with Import => True, Convention => StdCall,
External_Name => "ilGetBooleanv";
function Get_Data return Pointer
with Import => True, Convention => StdCall, External_Name => "ilGetData";
function Get_DXTC_Data
( Buffer: in Pointer; Buffer_Size: in UInt; DXTC_Format: in Enum
) return UInt
with Import => True, Convention => StdCall,
External_Name => "ilGetDXTCData";
function Get_Error return Enum
with Import => True, Convention => StdCall, External_Name => "ilGetError";
function Get_Integer (Mode: in Enum) return Int
with Import => True, Convention => StdCall, External_Name => "ilGetInteger";
procedure Get_Integer (Mode: in Enum; Param: in Pointer)
with Import => True, Convention => StdCall,
External_Name => "ilGetIntegerv";
function Get_Lump_Pos return UInt
with Import => True, Convention => StdCall, External_Name => "ilGetLumpPos";
function Get_Palette return Pointer
with Import => True, Convention => StdCall, External_Name => "ilGetPalette";
function Get_String (String_Name: in Enum) return String
with Inline => True;
procedure Hint (Target: in Enum; Mode: in Enum)
with Import => True, Convention => StdCall, External_Name => "ilHint";
function Invert_Surface_DXTC_Data_Alpha return Bool
with Import => True, Convention => StdCall,
External_Name => "ilInvertSurfaceDxtcDataAlpha";
procedure Init
with Import => True, Convention => StdCall, External_Name => "ilInit";
function Image_To_DXTC_Data (Format: in Enum) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilImageToDxtcData";
function Is_Disabled (Mode: in Enum) return Bool
with Import => True, Convention => StdCall, External_Name => "ilIsDisabled";
function Is_Enabled (Mode: in Enum) return Bool
with Import => True, Convention => StdCall, External_Name => "ilIsEnabled";
function Is_Image (Image: in UInt) return Bool
with Import => True, Convention => StdCall, External_Name => "ilIsImage";
function Is_Valid (Type_Of: in Enum; File_Name: in String) return Bool
with Inline => True;
function Is_Valid
( Type_Of: in Enum; Lump: in Pointer; Size: in UInt
) return Bool
with Import => True, Convention => StdCall, External_Name => "ilIsValidL";
procedure Key_Color
( Red: in ClampF; Green: in ClampF; Blue: in ClampF; Alpha: in ClampF )
with Import => True, Convention => StdCall, External_Name => "ilKeyColour";
procedure Key_Colour
( Red: in ClampF; Green: in ClampF; Blue: in ClampF; Alpha: in ClampF )
with Import => True, Convention => StdCall, External_Name => "ilKeyColour";
function Load (Type_Of: in Enum; File_Name: in String) return Bool
with Inline => True;
function Load
( Type_Of: in Enum; Lump: in Pointer; Size: in UInt
) return Bool
with Import => True, Convention => StdCall, External_Name => "ilLoadL";
function Load_Data
( File_Name: in String;
Width: in UInt; Height: in UInt;
Depth: in UInt; BPP: in UByte
) return Bool
with Inline => True;
function Load_Data
( Lump: in Pointer; Size: in UInt;
Width: in UInt; Height: in UInt;
Depth: in UInt; BPP: in UByte
) return Bool
with Import => True, Convention => StdCall, External_Name => "ilLoadDataL";
function Load_Image (File_Name: in String) return Bool
with Inline => True;
function Load_Pal (File_Name: in String) return Bool
with Inline => True;
procedure Mod_Alpha (Alpha_Value: in Double)
with Import => True, Convention => StdCall, External_Name => "ilModAlpha";
function Original_Func (Mode: in Enum) return Bool
with Import => True, Convention => StdCall, External_Name => "ilOriginFunc";
function Overlay_Image
( Source: in UInt; XCoord: in Int;
YCoord: in Int; ZCoord: in Int
) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilOverlayImage";
procedure Pop_Attrib
with Import => True, Convention => StdCall, External_Name => "ilPopAttrib";
-- NOTE: Type of Bits may need to be changed from UInt to Bitfield
procedure Push_Attrib (Bits: in UInt)
with Import => True, Convention => StdCall, External_Name => "ilPushAttrib";
procedure Register_Format (Format: in Enum)
with Import => True, Convention => StdCall,
External_Name => "ilRegisterFormat";
function Register_Mip_Num (Num: in UInt) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilRegisterMipNum";
function Register_Num_Faces (Num: in UInt) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilRegisterNumFaces";
function Register_Num_Images (Num: in UInt) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilRegisterNumImages";
procedure Register_Origin (Origin: in Enum)
with Import => True, Convention => StdCall,
External_Name => "ilRegisterOrigin";
procedure Register_Pal (Pal: in Pointer; Size: in UInt; Type_Of: in Enum)
with Import => True, Convention => StdCall,
External_Name => "ilRegisterPal";
procedure Register_Type (Type_Of: in Enum)
with Import => True, Convention => StdCall,
External_Name => "ilRegisterType";
function Remove_Load (Ext: in String) return Bool
with Inline => True;
function Remove_Save (Ext: in String) return Bool
with Inline => True;
procedure Reset_Memory
with Import => True, Convention => StdCall,
External_Name => "ilResetMemory";
procedure Reset_Read
with Import => True, Convention => StdCall, External_Name => "ilResetRead";
procedure Reset_Write
with Import => True, Convention => StdCall,
External_Name => "ilResetMemory";
function Save (Type_Of: in Enum; File_Name: in String) return Bool
with Inline => True;
function Save
( Type_Of: in Enum; Lump: in Pointer; Size: in UInt
) return UInt
with Import => True, Convention => StdCall, External_Name => "ilSaveL";
function Save_Data (File_Name: in String) return Bool
with Inline => True;
function Save_Image (File_Name: in String) return Bool
with Inline => True;
function Save_Pal (File_Name: in String) return Bool
with Inline => True;
function Set_Alpha (Alpha_Value: in Double) return Bool
with Import => True, Convention => StdCall, External_Name => "ilSetAlpha";
function Set_Data (Data: in Pointer) return Bool
with Import => True, Convention => StdCall, External_Name => "ilSetData";
function Set_Duration (Duration: in UInt) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilSetDuration";
procedure Set_Integer (Mode: in Enum; Param: in Int)
with Import => True, Convention => StdCall, External_Name => "ilSetInteger";
procedure Set_Pixels
( XOff: in Int; YOff: in Int; ZOff: in Int;
Width: in UInt; Height: in UInt; Depth: in UInt;
Format: in Enum; Type_Of: in Enum; Data: in Pointer
)
with Import => True, Convention => StdCall, External_Name => "ilSetPixels";
procedure Set_String (Mode: in Enum; Value: in String)
with Inline => True;
procedure Shut_Down
with Import => True, Convention => StdCall, External_Name => "ilShutDown";
function Surface_To_DXTC_Data (Format: in Enum) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilSurfaceToDxtcData";
function Tex_Image
( Width: in UInt; Height: in UInt; Depth: in UInt;
Num_Channels: in UByte; Format: in Enum; Type_Of: in Enum;
Data: in Pointer
) return Bool
with Import => True, Convention => StdCall, External_Name => "ilTexImage";
function Tex_Image_DXTC
( W: in Int; H: in Int; D: in Int; DXT_Format: in Enum; Data: in Pointer
) return Bool
with Import => True, Convention => StdCall,
External_Name => "ilTexImageDxtc";
function Type_From_Ext (File_Name: in String) return Enum
with Inline => True;
function Type_Func (Mode: in Enum) return Bool
with Import => True, Convention => StdCall, External_Name => "ilTypeFunc";
--------------------------------------------------------------------------
end Imago.IL;
|
-----------------------------------------------------------------------
-- components-holders -- Value holder interfaces
-- Copyright (C) 2009, 2010, 2011, 2013, 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.
-----------------------------------------------------------------------
-- The <bASF.Components.Holders</b> defines the value holder interfaces
-- which allow to plug a converter and one or several validators.
-- These interfaces must be implemented by UIOutput component and UIInput
-- component to participate in the JSF/ASF lifecycle (validation phase).
with EL.Objects;
with ASF.Converters;
with ASF.Validators;
package ASF.Components.Holders is
-- ------------------------------
-- Value Holder
-- ------------------------------
type Value_Holder is limited interface;
-- Get the local value of the component without evaluating
-- the associated Value_Expression.
function Get_Local_Value (Holder : in Value_Holder) return EL.Objects.Object is abstract;
-- Get the value of the component. If the component has a local
-- value which is not null, returns it. Otherwise, if we have a Value_Expression
-- evaluate and returns the value.
function Get_Value (Holder : in Value_Holder) return EL.Objects.Object is abstract;
-- Set the value of the component.
procedure Set_Value (Holder : in out Value_Holder;
Value : in EL.Objects.Object) is abstract;
-- Get the converter that is registered on the component.
function Get_Converter (Holder : in Value_Holder)
return ASF.Converters.Converter_Access is abstract;
-- Set the converter to be used on the component.
procedure Set_Converter (Holder : in out Value_Holder;
Converter : in ASF.Converters.Converter_Access;
Release : in Boolean := False) is abstract;
-- ------------------------------
-- Editable Value Holder
-- ------------------------------
-- The <b>Editable_Value_Holder</b> extends the <b>Value_Holder</b> to provide
-- operations used when a value can be modified.
type Editable_Value_Holder is limited interface and Value_Holder;
-- Add the validator to be used on the component. The ASF implementation limits
-- to 5 the number of validators that can be set on a component (See UIInput).
-- The validator instance will be freed when the editable value holder is deleted
-- unless <b>Shared</b> is true.
procedure Add_Validator (Holder : in out Editable_Value_Holder;
Validator : in ASF.Validators.Validator_Access;
Shared : in Boolean := False) is abstract;
-- ------------------------------
-- List Holder
-- ------------------------------
-- The <b>List_Holder</b> is an interface used by the data scroller to get some information
-- about how a list is displayed.
type List_Holder is limited interface;
type List_Holder_Access is access all List_Holder'Class;
-- Get the number of rows in the list.
function Get_Row_Count (List : in List_Holder) return Natural is abstract;
-- Get the number of rows per page.
function Get_Row_Per_Page (List : in List_Holder) return Positive is abstract;
-- Get the current page.
function Get_Current_Page (List : in List_Holder) return Positive is abstract;
-- Set the current page number.
procedure Set_Current_Page (List : in out List_Holder;
Page : in Positive) is abstract;
end ASF.Components.Holders;
|
pragma Ada_2012;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with bits_types_h;
with bits_types_struct_timespec_h;
package bits_struct_stat_h is
-- unsupported macro: st_atime st_atim.tv_sec
-- unsupported macro: st_mtime st_mtim.tv_sec
-- unsupported macro: st_ctime st_ctim.tv_sec
-- Definition for struct stat.
-- Copyright (C) 2020-2021 Free Software Foundation, Inc.
-- This file is part of the GNU C Library.
-- The GNU C Library is free software; you can redistribute it and/or
-- modify it under the terms of the GNU Lesser General Public
-- License as published by the Free Software Foundation; either
-- version 2.1 of the License, or (at your option) any later version.
-- The GNU C Library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- Lesser General Public License for more details.
-- You should have received a copy of the GNU Lesser General Public
-- License along with the GNU C Library. If not, see
-- <https://www.gnu.org/licenses/>.
-- Device.
type stat_array1037 is array (0 .. 2) of aliased bits_types_h.uu_syscall_slong_t;
type stat is record
st_dev : aliased bits_types_h.uu_dev_t; -- /usr/include/bits/struct_stat.h:28
st_ino : aliased bits_types_h.uu_ino_t; -- /usr/include/bits/struct_stat.h:33
st_nlink : aliased bits_types_h.uu_nlink_t; -- /usr/include/bits/struct_stat.h:41
st_mode : aliased bits_types_h.uu_mode_t; -- /usr/include/bits/struct_stat.h:42
st_uid : aliased bits_types_h.uu_uid_t; -- /usr/include/bits/struct_stat.h:44
st_gid : aliased bits_types_h.uu_gid_t; -- /usr/include/bits/struct_stat.h:45
uu_pad0 : aliased int; -- /usr/include/bits/struct_stat.h:47
st_rdev : aliased bits_types_h.uu_dev_t; -- /usr/include/bits/struct_stat.h:49
st_size : aliased bits_types_h.uu_off_t; -- /usr/include/bits/struct_stat.h:54
st_blksize : aliased bits_types_h.uu_blksize_t; -- /usr/include/bits/struct_stat.h:58
st_blocks : aliased bits_types_h.uu_blkcnt_t; -- /usr/include/bits/struct_stat.h:60
st_atim : aliased bits_types_struct_timespec_h.timespec; -- /usr/include/bits/struct_stat.h:71
st_mtim : aliased bits_types_struct_timespec_h.timespec; -- /usr/include/bits/struct_stat.h:72
st_ctim : aliased bits_types_struct_timespec_h.timespec; -- /usr/include/bits/struct_stat.h:73
uu_glibc_reserved : aliased stat_array1037; -- /usr/include/bits/struct_stat.h:86
end record
with Convention => C_Pass_By_Copy; -- /usr/include/bits/struct_stat.h:26
-- File serial number.
-- 32bit file serial number.
-- File mode.
-- Link count.
-- Link count.
-- File mode.
-- User ID of the file's owner.
-- Group ID of the file's group.
-- Device number, if device.
-- Size of file, in bytes.
-- Size of file, in bytes.
-- Optimal block size for I/O.
-- Number 512-byte blocks allocated.
-- Number 512-byte blocks allocated.
-- Nanosecond resolution timestamps are stored in a format
-- equivalent to 'struct timespec'. This is the type used
-- whenever possible but the Unix namespace rules do not allow the
-- identifier 'timespec' to appear in the <sys/stat.h> header.
-- Therefore we have to handle the use of this header in strictly
-- standard-compliant sources special.
-- Time of last access.
-- Time of last modification.
-- Time of last status change.
-- Time of last access.
-- Nscecs of last access.
-- Time of last modification.
-- Nsecs of last modification.
-- Time of last status change.
-- Nsecs of last status change.
-- File serial number.
-- Note stat64 has the same shape as stat for x86-64.
-- Device.
type stat64_array1037 is array (0 .. 2) of aliased bits_types_h.uu_syscall_slong_t;
type stat64 is record
st_dev : aliased bits_types_h.uu_dev_t; -- /usr/include/bits/struct_stat.h:101
st_ino : aliased bits_types_h.uu_ino64_t; -- /usr/include/bits/struct_stat.h:103
st_nlink : aliased bits_types_h.uu_nlink_t; -- /usr/include/bits/struct_stat.h:104
st_mode : aliased bits_types_h.uu_mode_t; -- /usr/include/bits/struct_stat.h:105
st_uid : aliased bits_types_h.uu_uid_t; -- /usr/include/bits/struct_stat.h:112
st_gid : aliased bits_types_h.uu_gid_t; -- /usr/include/bits/struct_stat.h:113
uu_pad0 : aliased int; -- /usr/include/bits/struct_stat.h:115
st_rdev : aliased bits_types_h.uu_dev_t; -- /usr/include/bits/struct_stat.h:116
st_size : aliased bits_types_h.uu_off_t; -- /usr/include/bits/struct_stat.h:117
st_blksize : aliased bits_types_h.uu_blksize_t; -- /usr/include/bits/struct_stat.h:123
st_blocks : aliased bits_types_h.uu_blkcnt64_t; -- /usr/include/bits/struct_stat.h:124
st_atim : aliased bits_types_struct_timespec_h.timespec; -- /usr/include/bits/struct_stat.h:132
st_mtim : aliased bits_types_struct_timespec_h.timespec; -- /usr/include/bits/struct_stat.h:133
st_ctim : aliased bits_types_struct_timespec_h.timespec; -- /usr/include/bits/struct_stat.h:134
uu_glibc_reserved : aliased stat64_array1037; -- /usr/include/bits/struct_stat.h:144
end record
with Convention => C_Pass_By_Copy; -- /usr/include/bits/struct_stat.h:99
-- File serial number.
-- Link count.
-- File mode.
-- 32bit file serial number.
-- File mode.
-- Link count.
-- User ID of the file's owner.
-- Group ID of the file's group.
-- Device number, if device.
-- Size of file, in bytes.
-- Device number, if device.
-- Size of file, in bytes.
-- Optimal block size for I/O.
-- Nr. 512-byte blocks allocated.
-- Nanosecond resolution timestamps are stored in a format
-- equivalent to 'struct timespec'. This is the type used
-- whenever possible but the Unix namespace rules do not allow the
-- identifier 'timespec' to appear in the <sys/stat.h> header.
-- Therefore we have to handle the use of this header in strictly
-- standard-compliant sources special.
-- Time of last access.
-- Time of last modification.
-- Time of last status change.
-- Time of last access.
-- Nscecs of last access.
-- Time of last modification.
-- Nsecs of last modification.
-- Time of last status change.
-- Nsecs of last status change.
-- File serial number.
-- Tell code we have these members.
-- Nanosecond resolution time values are supported.
end bits_struct_stat_h;
|
-- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
with Tk.Image.Image_Options_Test_Data.Image_Options_Tests;
with GNATtest_Generated;
package Tk.Image.Photo.Photo_Options_Test_Data is
-- begin read only
type Test_Photo_Options is new GNATtest_Generated.GNATtest_Standard.Tk.Image
.Image_Options_Test_Data
.Image_Options_Tests
.Test_Image_Options
-- end read only
with
null record;
procedure Set_Up(Gnattest_T: in out Test_Photo_Options);
procedure Tear_Down(Gnattest_T: in out Test_Photo_Options);
end Tk.Image.Photo.Photo_Options_Test_Data;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.CMOF.Structural_Features.Hash is
new AMF.Elements.Generic_Hash (CMOF_Structural_Feature, CMOF_Structural_Feature_Access);
|
with ARM_Output,
ARM_Contents;
--private -- Ada 2005
with ARM_Input,
ARM_Database,
ARM_Subindex;
package ARM_Format is
--
-- Ada reference manual formatter (ARM_Form).
--
-- This package contains the routines to parse the input files, and
-- determine what to output.
--
-- ---------------------------------------
-- Copyright 2000, 2002, 2004, 2005, 2006, 2007, 2010, 2011, 2012, 2016
-- AXE Consultants. All rights reserved.
-- P.O. Box 1512, Madison WI 53701
-- E-Mail: randy@rrsoftware.com
--
-- ARM_Form is free software: you can redistribute it and/or modify
-- it under the terms of the GNU General Public License version 3
-- as published by the Free Software Foundation.
--
-- AXE CONSULTANTS MAKES THIS TOOL AND SOURCE CODE AVAILABLE ON AN "AS IS"
-- BASIS AND MAKES NO WARRANTY, EXPRESS OR IMPLIED, AS TO THE ACCURACY,
-- CAPABILITY, EFFICIENCY, MERCHANTABILITY, OR FUNCTIONING OF THIS TOOL.
-- IN NO EVENT WILL AXE CONSULTANTS BE LIABLE FOR ANY GENERAL,
-- CONSEQUENTIAL, INDIRECT, INCIDENTAL, EXEMPLARY, OR SPECIAL DAMAGES,
-- EVEN IF AXE CONSULTANTS HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
-- DAMAGES.
--
-- A copy of the GNU General Public License is available in the file
-- gpl-3-0.txt in the standard distribution of the ARM_Form tool.
-- Otherwise, see <http://www.gnu.org/licenses/>.
--
-- If the GPLv3 license is not satisfactory for your needs, a commercial
-- use license is available for this tool. Contact Randy at AXE Consultants
-- for more information.
--
-- ---------------------------------------
--
-- Edit History:
--
-- 4/14/00 - RLB - Created base package.
-- 4/18/00 - RLB - Added additional information to Object;
-- added Scan.
-- 4/24/00 - RLB - Added Change_Kind and Display_Index_Entries.
-- - RLB - Added Change format.
-- 4/25/00 - RLB - Added Size.
-- 4/26/00 - RLB - Added paragraph formats.
-- 5/10/00 - RLB - Added additional paragraph kinds.
-- 5/11/00 - RLB - Added numbers for enumerated paragraphs.
-- 5/12/00 - RLB - Added attribute prefix text.
-- 5/15/00 - RLB - Split input from parsing/formatting.
-- 5/16/00 - RLB - Added database objects and Destroy.
-- 5/23/00 - RLB - Added tab stops.
-- 5/24/00 - RLB - Implemented subscript/superscript commands.
-- 5/28/00 - RLB - Implemented index operations.
-- 6/ 2/00 - RLB - Added Unit.
-- 8/ 2/00 - RLB - Added Leading and Syntax_Leading styles.
-- 8/ 4/00 - RLB - Added more new styles.
-- 8/ 7/00 - RLB - Added Leading flag, removed Leading styles.
-- 8/ 8/00 - RLB - Added Attr_Leading flag.
-- 8/16/00 - RLB - Added No_Para_Num flag, removed No_Pnum formats.
-- 8/17/00 - RLB - Changed Leading flag to Space_After.
-- 8/28/00 - RLB - Added flags for ChgAttribute and ChgImpldef commands.
-- 8/31/00 - RLB - Added the New_Changes change kind.
-- 9/26/00 - RLB - Added Syntax_Display format.
-- 6/17/02 - RLB - Added Ada95 changes sections.
-- 7/18/02 - RLB - Moved document type here.
-- - RLB - Added Changes_Only and versioning for individual changes.
-- 9/10/04 - RLB - Added support for nested changes.
-- 9/14/04 - RLB - Moved Change_Version_Type to ARM_Contents.
-- 11/03/04 - RLB - Added Nested_X2_Bulleted.
-- 11/16/04 - RLB - Added Attr_Prefix_Text_Change_Kind.
-- 12/06/04 - RLB - Added reference chain for Format_Type.
-- 12/11/04 - RLB - Increased Syntax_NT length.
-- 10/17/05 - RLB - Added Glossary change items.
-- 10/28/05 - RLB - Added Language-Define subindexes.
-- 1/12/06 - RLB - Replaced "Document" with a number of new more general
-- properties.
-- 1/16/06 - RLB - Added "Unnumbered_Section" counter, so we can assign
-- names without special cases.
-- 1/18/06 - RLB - Added "Example_Font".
-- 9/22/06 - RLB - Added "Use_ISO_2004_Note_Format".
-- - RLB - Revised to use Clause_Number_Type.
-- 9/25/06 - RLB - Added "Use_ISO_2004_Contents_Format".
-- 10/04/06 - RLB - Added "Use_ISO_2004_List_Format".
-- 2/ 5/07 - RLB - Added Usage_Note for ASIS, and renamed Wide paragraph
-- kinds.
-- 2/13/07 - RLB - Redid output formating to use an explict indent;
-- added ChildExample.
-- 2/16/07 - RLB - Added Indent.
-- 2/19/07 - RLB - Added Title format.
-- 4/23/10 - RLB - Added Ada 2005 header.
-- 8/ 8/11 - RLB - Added Aspect DB.
-- 10/18/11 - RLB - Changed to GPLv3 license.
-- 3/12/12 - RLB - Lengthened unit name so
-- "Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Equal_Case_Insensitive"
-- would fit (have we lost our minds??).
-- 8/31/12 - RLB - Put glossary components into a subrecord to prevent
-- inappropriate usage.
-- 10/18/12 - RLB - Put impdef components into a subrecord to prevent
-- inappropriate usage.
-- - RLB - Added more specific hanging_indent formats, along with
-- small.
-- 11/26/12 - RLB - Added subdivision names.
-- 12/17/12 - RLB - Added Ada 2012 AARM sections.
-- 3/17/16 - RLB - Removed Changes_Only, added Base_Change_Version.
type Format_Type is tagged limited private;
type Change_Kind is (Old_Only, New_Only, Show_Changes, New_Changes);
-- Which changes to show?
-- If Old_Only, we will get the original Ada Reference Manual or AARM.
-- If New_Only, we will get the reference documents with the updates
-- up to the Change_Version specified included.
-- If Show_Changes, we will get the reference documents with the
-- updates up to the Base_Change_Version specified included; and
-- insertions and deletions will be shown for versions
-- Base_Change_Version .. Change_Version.
-- If New_Changes, original RM text removed, but new RM text will be
-- shown as inserted, up to and including the Change_Version specified.
-- In all cases, changes with versions newer than Change_Version are
-- ignored. Thus Change_Version = '0' is the same as Old_Only no
-- matter what command is given.
--
-- Note: Previous versions of this tool had Changes_Only as well;
-- that is the same as Show_Changes with Base_Change_Version =
-- Change_Version. (The previous version's Show_Changes is
-- equivalent to this version's Show_Changes with
-- Base_Change_Version = 1.)
procedure Create (Format_Object : in out Format_Type;
Changes : in ARM_Format.Change_Kind;
Change_Version : in ARM_Contents.Change_Version_Type;
Base_Change_Version : in ARM_Contents.Change_Version_Type;
Display_Index_Entries : in Boolean;
Include_Annotations : in Boolean;
Include_ISO : in Boolean;
Link_Non_Terminals : in Boolean;
Number_Paragraphs : in Boolean;
Examples_Font : in ARM_Output.Font_Family_Type;
Use_ISO_2004_Note_Format : in Boolean;
Use_ISO_2004_Contents_Format : in Boolean;
Use_ISO_2004_List_Format : in Boolean;
Top_Level_Subdivision_Name : in ARM_Output.Top_Level_Subdivision_Name_Kind);
-- Initialize an input object. Changes, Change_Version, and
-- Base_Change_Version determine
-- which changes should be displayed. If Display_Index_Entries is True,
-- index entries will be printed in the document; otherwise, they
-- will not generate any visible text (although they might generate
-- a link anchor). If Include_Annotations is True, annotations (AARM
-- text) will be included in the output; otherwise it will not be.
-- If Include_ISO is True, ISOOnly text will be included in the output
-- (and NotISO text will not); otherwise the reverse is true.
-- If Link_Non_Terminals is True, links will be generated for
-- each Non_Terminal, linking it to its definition.
-- If Number_Paragraphs is true, paragraphs will be numbered (per
-- subclause); otherwise they will not be.
-- Example_Font specifies the font that examples will be set in.
-- If Use_ISO_2004_Note_Format is true, that format will be used;
-- else the Ada95 standard's format will be used for notes.
-- If Use_ISO_2004_Contents_Format is true, that format will be used;
-- else the Ada95 standard's format will be used for the table of contents.
-- If Use_ISO_2004_List_Format is true, then lists will be lettered;
-- else the Ada95 standard's numbering format will be used for
-- enumerated lists.
-- The top-level (and other) subdivision names are as specified
-- in Top_Level_Subdivision_Name.
procedure Destroy (Format_Object : in out Format_Type);
-- Destroy a format object, releasing any resources.
procedure Scan (Format_Object : in out Format_Type;
File_Name : in String;
Section_Number : in ARM_Contents.Section_Number_Type;
Starts_New_Section : in Boolean);
-- Scans the contents for File_Name, determining the table of contents
-- for the section. The results are written to the contents package.
-- Starts_New_Section is True if the file starts a new section.
-- Section_Number is the number (or letter) of the section.
-- Note: We need this scanning pass so we can process @SeeSec,
-- @SeeSecNum, and similar commands. For that, we need the full names
-- of the sections and clauses.
procedure Write_Table_of_Contents (
Format_Object : in out Format_Type;
Output_Object : in out ARM_Output.Output_Type'Class);
-- Writes the table of contents for the document. (It will have
-- a section name of "TOC").
procedure Process (Format_Object : in out Format_Type;
File_Name : in String;
Output_Object : in out ARM_Output.Output_Type'Class;
Section_Name : in String;
Section_Number : in ARM_Contents.Section_Number_Type;
Starts_New_Section : in Boolean);
-- Process the contents for File_Name, writing the results to
-- Output_Object. (Output_Object uses dispatching calls to provide
-- the correct formatting). Section_Name is the name of the section
-- for this file. Starts_New_Section is True if the file starts
-- a new section. Section_Number is the number (or letter) of the
-- section. Values > 20 represent annex letters (21 => A, 22 => B, etc.)
procedure Format (Format_Object : in out Format_Type;
Text : in String;
Output_Object : in out ARM_Output.Output_Type'Class;
Text_Name : in String;
No_Annotations : in Boolean);
-- Format the contents of Text, writing the results to
-- Output_Object. (Output_Object uses dispatching calls to provide
-- the correct formatting). Text is assumed to be a component of
-- a larger section. Text_Name is an identifying name for error messages.
-- If No_Annotations is true, we don't want any annotations even if we
-- are generating a document with annotations.
private
type Paragraph_Type is (Plain, Introduction,
Language_Design, -- AARM-only.
Syntax, Resolution, Legality,
Static_Semantics, Link_Time, Run_Time, Bounded_Errors,
Erroneous, Requirements, Documentation, Metrics, Permissions, Advice,
Notes, Single_Note, Examples,
Ada83_Inconsistencies, Ada83_Incompatibilities, -- AARM-only.
Ada83_Extensions, Ada83_Wording, -- AARM-only.
Ada95_Inconsistencies, Ada95_Incompatibilities, -- AARM-only.
Ada95_Extensions, Ada95_Wording, -- AARM-only.
Ada2005_Inconsistencies, Ada2005_Incompatibilities, -- AARM-only.
Ada2005_Extensions, Ada2005_Wording, -- AARM-only.
Ada2012_Inconsistencies, Ada2012_Incompatibilities, -- AARM-only.
Ada2012_Extensions, Ada2012_Wording, -- AARM-only.
Element_Ref, Child_Ref, Usage_Note, -- For ASIS (AASIS-only).
-- AARM annotations (no headers)
Reason, Ramification, Proof, Imp_Note, Corr_Change, Discussion,
Honest, Glossary_Marker, Bare_Annotation,
-- Format only:
Wide_Above, Example_Text, Child_Example_Text,
Indented_Example_Text, Code_Indented, Indent, Bulleted, Nested_Bulleted,
Nested_X2_Bulleted,
Display, Syntax_Display, Syntax_Indented, Syntax_Production,
Enumerated, Nested_Enumerated,
Hanging_Indented_1, Hanging_Indented_2, Hanging_Indented_3,
Hanging_Indented_4, Small, Title, In_Table);
type Reference;
type Reference_Ptr is access Reference;
type Reference is record
Ref_Name : ARM_Input.Command_Name_Type;
Ref_Len : Natural; -- Length of the reference.
Is_DR_Ref : Boolean; -- True for a DR reference; False for an AI reference.
Next : Reference_Ptr;
end record;
type Glossary_Info_Type (Active : Boolean := False;
Change_Kind : ARM_Database.Paragraph_Change_Kind_Type := ARM_Database.None) is record
-- The Change_Kind of ToGlossary.
case Active is
when False => null; -- No glossary entry in use.
when True =>
-- Glossary actively being processed; used only when
-- processing [Chg]ToGlossary[Also] commands.
Term : String (1..50); -- Glossary term.
Term_Len : Natural := 0;
Add_to_Glossary : Boolean;
-- Add this item to the Glossary. (Not the same
-- as "Active"; when generating older versions
-- of a document, this would be False for a
-- new glossary entry.)
Displayed : Boolean;
-- The text was displayed in the document.
case Change_Kind is
when ARM_Database.None => null;
when others =>
Version : ARM_Contents.Change_Version_Type;
-- The version number of the changed paragraph.
end case;
end case;
end record;
type Impdef_Command_Type is (None, Aspect, Impdef, Docreq, ImplAdv);
type Impdef_Info_Type (Command : Impdef_Command_Type := None) is record
case Command is
when None => null; -- No impdef, docreq, impladv, aspectdesc in use.
when others =>
-- Impdef, Docreq, Impladv, Aspectdesc actively being processed;
-- used only when processing ImplDef, ChgImplDef,
-- ChgDocReq, ChgImplAdv, and ChgAspectDesc.
Change_Kind : ARM_Database.Paragraph_Change_Kind_Type := ARM_Database.None;
-- The Change_Kind of the command.
Version : ARM_Contents.Change_Version_Type;
-- If the kind is not "None", this is the version
-- number of the changed paragraph.
Initial_Version : ARM_Contents.Change_Version_Type;
-- This is the version number of the original paragraph.
Paragraph_String : String (1 .. 10); -- Paragraph number.
Paragraph_Len : Natural;
Add_to_DB : Boolean;
-- Add this item to the appropriate DB. (Not the same
-- as "Active"; when generating older versions
-- of a document, this would be False for a
-- new impdef, docreq, etc. entry.)
case Command is
when Aspect =>
Aspect_Name : String (1..30); -- Aspect name text
Aspect_Name_Len : Natural := 0;
when others => null;
end case;
end case;
end record;
type Format_Type is tagged limited record
-- Document information:
Changes : ARM_Format.Change_Kind; -- No Both here.
Change_Version : ARM_Contents.Change_Version_Type;
Base_Change_Version : ARM_Contents.Change_Version_Type;
Display_Index_Entries : Boolean;
Include_Annotations : Boolean;
Include_ISO : Boolean;
Link_Non_Terminals : Boolean;
Number_Paragraphs : Boolean;
Examples_Font : ARM_Output.Font_Family_Type;
Use_ISO_2004_Note_Format : Boolean;
Use_ISO_2004_Contents_Format : Boolean;
Use_ISO_2004_List_Format : Boolean;
Top_Level_Subdivision_Name : ARM_Output.Top_Level_Subdivision_Name_Kind;
-- Clause numbers:
Clause_Number : ARM_Contents.Clause_Number_Type;
-- The current clause number (Section, clause, subclause, subsubclause).
Unnumbered_Section : Natural; -- The current (if any) clause number
-- for unnumbered sections.
-- Paragraph format info:
Next_Paragraph_Change_Kind : ARM_Database.Paragraph_Change_Kind_Type;
-- The change kind of the next paragraph. This is
-- reset to none after each paragraph.
Next_Paragraph_Version : ARM_Contents.Change_Version_Type;
-- If the kind is not "None", this is the version
-- number of the changed paragraph.
Last_Paragraph_Subhead_Type : Paragraph_Type;
-- The last paragraph subhead generated.
Next_Paragraph_Subhead_Type : Paragraph_Type;
-- The next paragraph subhead to generate (not
-- necessarily the same as Next_Paragraph_Format_Type).
-- This indicates the current paragraph type.
Next_Paragraph_Format_Type : Paragraph_Type;
-- The format type of the next paragraph to
-- generate. We keep this separately so that the
-- first paragraph of a grouping can be in a
-- different format than the standard one, and
-- still generate a subheading.
Paragraph_Tab_Stops : ARM_Output.Tab_Info := ARM_Output.NO_TABS;
-- The tab stops for the next paragraph.
In_Bundle : Boolean := False;
-- Are we in a bundle?
References : Reference_Ptr := null;
-- Any references to generate at the start of the
-- next paragraph.
-- Paragraph numbering info:
Next_Note : Natural; -- The number of the next note. These are
-- per-section, not per-clause (unless ISO 2004 is set).
Next_Paragraph : Positive; -- The number of the next paragraph. These
-- are per-(sub)clause.
Next_Insert_Para : Positive; -- The subnumber of the next inserted
-- paragraph.
Next_AARM_Sub : Character; -- The letter of the next AARM subclause.
-- These are reset when the paragraph number
-- changes.
Next_AARM_Insert_Para : Positive; -- The subnumber of the next inserted
-- AARM paragraph.
Next_Enumerated_Num : Positive;
-- If the format is enumerated, this is the
-- number of the next paragraph.
Enumerated_Level : Natural;
-- Number of enumerated formats that we're in.
Current_Paragraph_String : String (1 .. 10);
-- The current paragraph number string (only
-- valid if In_Paragraph is True).
Current_Paragraph_Len : Natural;
-- Text format info:
Text_Format : ARM_Output.Format_Type; -- Holds the current text format.
Style : ARM_Output.Paragraph_Style_Type; -- What is the current paragraph style?
Indent : ARM_Output.Paragraph_Indent_Type; -- What is the current paragraph indent?
In_Paragraph : Boolean; -- Are we currently in a paragraph?
No_Start_Paragraph : Boolean; -- Did we suppress "Start_Paragraph"?
No_Prefix : Boolean; -- Should we suppress any prefix on the next paragraph?
No_Para_Num : Boolean; -- Should we suppress the paragraph number on the next paragraph?
Keep_with_Next : Boolean; -- Should we force this paragraph to bind to the next
-- (disallowing a page break between)?
Space_After : ARM_Output.Space_After_Type; -- Space following this
-- paragraph.
No_Breaks : Boolean; -- Should we allow page breaks in this paragraph?
In_Change : Boolean; -- Are we in a change region?
Last_Non_Space : Boolean; -- Is the last character written into the
-- paragraph a non-space? (If nothing has been
-- written into the paragraph, then this is False).
-- Indexing:
Unit : String (1..72); -- Unit for predefined definitions. Used only
-- by a handful of indexing commands.
Unit_Len : Natural := 0;
-- Syntax:
Syntax_NT : String (1..80); -- Syntax non-terminal; used only during the
-- processing of the Syn command.
Syntax_NT_Len : Natural := 0;
Syntax_Tab : String (1..40); -- Syntax tab string; used only during the
-- processing of the Syn command.
Syntax_Tab_Len : Natural := 0;
-- Attributes:
Prefix_Text : String (1..200) := "@b{NONE!}" & (10..200 => ' ');
-- This text is used as part of the attribute list text.
-- It is shared between multiple attributes, which is why it is
-- handled this way.
Prefix_Text_Len : Natural := 9;
Attr_Prefix : String (1..10); -- Attribute prefix text
Attr_Prefix_Len : Natural := 0;
Attr_Prefix_Change_Kind : ARM_Database.Paragraph_Change_Kind_Type;
Attr_Prefix_Version : ARM_Contents.Change_Version_Type;
Attr_Name : String (1..30); -- Attribute name text
Attr_Name_Len : Natural := 0;
Attr_Leading : Boolean := False; -- Attribute leading flag
Attr_Change_Kind : ARM_Database.Paragraph_Change_Kind_Type;
Attr_Prefix_Text_Change_Kind : ARM_Database.Paragraph_Change_Kind_Type;
Attr_Version : ARM_Contents.Change_Version_Type;
Attr_Initial_Version : ARM_Contents.Change_Version_Type;
-- The above ten items are used only when processing Attribute
-- and Attribute_Leading commands.
Attr_DB : ARM_Database.Database_Type;
-- Pragmas:
Pragma_DB : ARM_Database.Database_Type;
-- Glossary:
Glossary_Info : Glossary_Info_Type;
Glossary_DB : ARM_Database.Database_Type;
-- Aspects:
Aspect_DB : ARM_Database.Database_Type;
-- Also see Impdef_Info, below.
-- Implementation advice:
Impladv_DB : ARM_Database.Database_Type;
-- Also see Impdef_Info, below.
-- Documentation requirements:
Docreq_DB : ARM_Database.Database_Type;
-- Also see Impdef_Info, below.
-- Implementation-defined:
Impdef_DB : ARM_Database.Database_Type;
-- Also see Impdef_Info, below.
-- For all of the above four:
Impdef_Info : Impdef_Info_Type;
-- Used only during processing of ImplDef, ChgImplDef,
-- ChgDocReq, ChgImplAdv, and ChgAspectDesc.
-- Language-Defined entity subindexes:
Package_Index : ARM_Subindex.Subindex_Type;
Type_Index : ARM_Subindex.Subindex_Type;
Subprogram_Index : ARM_Subindex.Subindex_Type;
Exception_Index : ARM_Subindex.Subindex_Type;
Object_Index : ARM_Subindex.Subindex_Type;
end record;
end ARM_Format;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- C S E T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package Csets is
pragma Elaborate_Body;
-- This package contains character tables for the various character
-- sets that are supported for source representation. Character and
-- string literals are not affected, only identifiers. For each set,
-- the table in this package gives the mapping of letters to their
-- upper case equivalent. Each table thus provides the information
-- for building the table used to fold lower case to upper case, and
-- also the table of flags showing which characters are allowed in
-- identifiers.
type Translate_Table is array (Character) of Character;
-- Type used to describe translate tables
type Char_Array_Flags is array (Character) of Boolean;
-- Type used for character attribute arrays. Note that we deliberately
-- do NOT pack this table, since we don't want the extra overhead of
-- accessing a packed bit string.
----------------------------------------------
-- Character Tables For Current Compilation --
----------------------------------------------
procedure Initialize;
-- Routine to initialize following character tables, whose content depends
-- on the character code being used to represent the source program. In
-- particular, the use of the upper half of the 8-bit code set varies.
-- The character set in use is specified by the value stored in
-- Opt.Identifier_Character_Set, which has the following settings:
-- '1' Latin-1 (ISO-8859-1)
-- '2' Latin-2 (ISO-8859-2)
-- '3' Latin-3 (ISO-8859-3)
-- '4' Latin-4 (ISO-8859-4)
-- '5' Latin-5 (ISO-8859-5, Cyrillic)
-- 'p' IBM PC (code page 437)
-- '8' IBM PC (code page 850)
-- '9' Latin-9 (ISO-9959-9)
-- 'f' Full upper set (all distinct)
-- 'n' No upper characters (Ada/83 rules)
-- 'w' Latin-1 plus wide characters also allowed
function Is_Upper_Case_Letter (C : Character) return Boolean;
pragma Inline (Is_Upper_Case_Letter);
-- Determine if character is upper case letter
function Is_Lower_Case_Letter (C : Character) return Boolean;
pragma Inline (Is_Lower_Case_Letter);
-- Determine if character is lower case letter
Fold_Upper : Translate_Table;
-- Table to fold lower case identifier letters to upper case
Fold_Lower : Translate_Table;
-- Table to fold upper case identifier letters to lower case
Identifier_Char : Char_Array_Flags;
-- This table has True entries for all characters that can legally appear
-- in identifiers, including digits, the underline character, all letters
-- including upper and lower case and extended letters (as controlled by
-- the setting of Opt.Identifier_Character_Set, left bracket for brackets
-- notation wide characters and also ESC if wide characters are permitted
-- in identifiers using escape sequences starting with ESC.
end Csets;
|
<?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>Loop_3_proc</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>p_hw_input_stencil_stream_to_mul_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></originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>72</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>p_mul_stencil_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>32</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>47</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>195</lineNumber>
<contextFuncName>hls_target</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/paper_apps_8_shifts/sharpen</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>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>195</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>indvar_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
<item>177</item>
<item>178</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>exitcond_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>179</item>
<item>181</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>indvar_flatten_next</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>182</item>
<item>184</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>185</item>
<item>186</item>
<item>187</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>tmp_value_V</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>72</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>p_363</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_363</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>p_368_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>215</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>p_379</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_379</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>72</item>
<item>74</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>p_384_cast_cast</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>p_411</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_411</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
<item>79</item>
<item>81</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>p_416_cast_cast</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>p_427</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_427</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>83</item>
<item>84</item>
<item>86</item>
<item>88</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>p_432_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>287</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>287</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>tmp_7</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>94</item>
<item>96</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>p_375</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>223</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>223</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_375</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>98</item>
<item>99</item>
<item>101</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>p_376_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>224</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>p_377</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_377</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>103</item>
<item>104</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>p_377_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_8</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>106</item>
<item>107</item>
<item>109</item>
<item>111</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>p_391</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>241</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>241</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_391</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>112</item>
<item>113</item>
<item>114</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>p_392_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>tmp</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>116</item>
<item>117</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>p_393</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_393</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>119</item>
<item>120</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>p_393_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp_9</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>123</item>
<item>124</item>
<item>126</item>
<item>128</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>p_399</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>250</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>250</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_399</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>130</item>
<item>131</item>
<item>133</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>p_400_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>251</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>251</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>135</item>
<item>136</item>
<item>138</item>
<item>140</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>p_407</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>259</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>259</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_407</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>141</item>
<item>142</item>
<item>143</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>p_408_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>259</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>259</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>tmp_3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>145</item>
<item>146</item>
<item>148</item>
<item>150</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>p_423</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_423</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>151</item>
<item>152</item>
<item>153</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>p_424_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>tmp1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>155</item>
<item>156</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>tmp3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>157</item>
<item>158</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>tmp3_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>tmp2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>160</item>
<item>161</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>tmp2_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>p_425</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_425</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>163</item>
<item>164</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>p_425_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>p_433</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>288</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>288</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_433</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>166</item>
<item>167</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp_value_V_7</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>288</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>288</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>168</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>290</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>170</item>
<item>171</item>
<item>172</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>197</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>197</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>173</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>21</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_50">
<Value>
<Obj>
<type>2</type>
<id>71</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_51">
<Value>
<Obj>
<type>2</type>
<id>73</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>23</content>
</item>
<item class_id_reference="16" object_id="_52">
<Value>
<Obj>
<type>2</type>
<id>78</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>48</content>
</item>
<item class_id_reference="16" object_id="_53">
<Value>
<Obj>
<type>2</type>
<id>80</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>55</content>
</item>
<item class_id_reference="16" object_id="_54">
<Value>
<Obj>
<type>2</type>
<id>85</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_55">
<Value>
<Obj>
<type>2</type>
<id>87</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>71</content>
</item>
<item class_id_reference="16" object_id="_56">
<Value>
<Obj>
<type>2</type>
<id>93</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_57">
<Value>
<Obj>
<type>2</type>
<id>95</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>14</content>
</item>
<item class_id_reference="16" object_id="_58">
<Value>
<Obj>
<type>2</type>
<id>100</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_59">
<Value>
<Obj>
<type>2</type>
<id>108</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>24</content>
</item>
<item class_id_reference="16" object_id="_60">
<Value>
<Obj>
<type>2</type>
<id>110</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>30</content>
</item>
<item class_id_reference="16" object_id="_61">
<Value>
<Obj>
<type>2</type>
<id>125</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_62">
<Value>
<Obj>
<type>2</type>
<id>127</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>37</content>
</item>
<item class_id_reference="16" object_id="_63">
<Value>
<Obj>
<type>2</type>
<id>132</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_64">
<Value>
<Obj>
<type>2</type>
<id>137</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>40</content>
</item>
<item class_id_reference="16" object_id="_65">
<Value>
<Obj>
<type>2</type>
<id>139</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>46</content>
</item>
<item class_id_reference="16" object_id="_66">
<Value>
<Obj>
<type>2</type>
<id>147</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>56</content>
</item>
<item class_id_reference="16" object_id="_67">
<Value>
<Obj>
<type>2</type>
<id>149</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>62</content>
</item>
<item class_id_reference="16" object_id="_68">
<Value>
<Obj>
<type>2</type>
<id>174</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_69">
<Value>
<Obj>
<type>2</type>
<id>180</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_70">
<Value>
<Obj>
<type>2</type>
<id>183</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_71">
<Obj>
<type>3</type>
<id>8</id>
<name>newFuncRoot</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_72">
<Obj>
<type>3</type>
<id>13</id>
<name>.preheader57</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_73">
<Obj>
<type>3</type>
<id>59</id>
<name>.preheader57.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>41</count>
<item_version>0</item_version>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>58</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_74">
<Obj>
<type>3</type>
<id>61</id>
<name>.preheader56.exitStub</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>87</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_75">
<id>62</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>173</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>174</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>176</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>178</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>180</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>186</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>187</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>274</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>275</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>276</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>277</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>13</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_162">
<mId>1</mId>
<mTag>Loop_3_proc</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>9</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_163">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_164">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>13</item>
<item>59</item>
</basic_blocks>
<mII>1</mII>
<mDepth>5</mDepth>
<mMinTripCount>4</mMinTripCount>
<mMaxTripCount>4</mMaxTripCount>
<mMinLatency>7</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_165">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_166">
<states class_id="25" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_167">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_168">
<id>3</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_169">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_170">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_171">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_172">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_173">
<id>2</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_174">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_175">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_176">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_177">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_178">
<id>3</id>
<operations>
<count>22</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_179">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_180">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_181">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_182">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_183">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_184">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_185">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_186">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_187">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_188">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_189">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_190">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_191">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_192">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_193">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_194">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_195">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_196">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_197">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_198">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_199">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_200">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_201">
<id>4</id>
<operations>
<count>7</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_202">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_203">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_204">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_205">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_206">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_207">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_208">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_209">
<id>5</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_210">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_211">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_212">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_213">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_214">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_215">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_216">
<id>6</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_217">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_218">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_219">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_220">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_221">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_222">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_223">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_224">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_225">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_226">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_227">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_228">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_229">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>12</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_230">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>22</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_231">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>23</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_232">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>24</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_233">
<inState>6</inState>
<outState>2</outState>
<condition>
<id>25</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_234">
<inState>2</inState>
<outState>7</outState>
<condition>
<id>21</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>10</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_235">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>26</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>10</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>47</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>7</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>8</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>2</first>
<second>5</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="1" version="0" object_id="_236">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>13</item>
<item>59</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>5</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="45" tracking_level="0" version="0">
<count>43</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>126</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>172</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>228</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>238</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>308</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>311</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>318</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>331</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>337</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>349</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="48" tracking_level="0" version="0">
<count>41</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>exitcond_flatten_fu_114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>p_363_fu_126</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>p_368_cast_fu_130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>p_375_fu_182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>p_376_cast_fu_190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>p_377_cast_fu_276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>p_377_fu_194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>p_379_fu_134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>p_384_cast_cast_fu_144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>p_391_fu_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>p_392_cast_cast_fu_218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>p_393_cast_fu_308</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_393_fu_282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_399_fu_311</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>p_400_cast_fu_318</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>p_407_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>p_408_cast_cast_fu_295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>p_411_fu_148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>p_416_cast_cast_fu_158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>p_423_fu_258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>p_424_cast_cast_fu_266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>p_425_cast_fu_340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>p_425_fu_331</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>p_427_fu_162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>p_432_cast_fu_337</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>p_433_fu_343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp1_fu_322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>tmp2_cast_fu_328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>tmp2_fu_302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp3_cast_fu_299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp3_fu_270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>tmp_3_fu_248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>tmp_7_fu_172</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>tmp_8_fu_200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_9_fu_228</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>tmp_cast_fu_279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>tmp_fu_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_s_fu_238</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>tmp_value_V_7_fu_349</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>StgValue_59_write_fu_96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp_value_V_read_fu_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="50" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>12</count>
<item_version>0</item_version>
<item>
<first>103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>363</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>368</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>373</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>383</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>388</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>393</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>403</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>12</count>
<item_version>0</item_version>
<item>
<first>exitcond_flatten_reg_354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>p_377_reg_368</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>p_393_reg_393</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_425_reg_403</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>p_427_reg_363</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp2_reg_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp3_reg_388</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>tmp_9_reg_378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>tmp_reg_373</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_s_reg_383</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>indvar_flatten_reg_103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="51" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>p_hw_input_stencil_stream_to_mul_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</second>
</item>
<item>
<first>p_mul_stencil_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="53" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>1</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>2</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Interfaces;
function TOML.Generic_Parse
(Stream : in out Input_Stream) return TOML.Read_Result
is
----------------------------
-- Lexical analysis state --
----------------------------
WW_Backspace : constant Wide_Wide_Character :=
Wide_Wide_Character'Val (Character'Pos (ASCII.BS));
WW_Linefeed : constant Wide_Wide_Character :=
Wide_Wide_Character'Val (Character'Pos (ASCII.LF));
WW_Form_Feed : constant Wide_Wide_Character :=
Wide_Wide_Character'Val (Character'Pos (ASCII.FF));
WW_Carriage_Return : constant Wide_Wide_Character :=
Wide_Wide_Character'Val (Character'Pos (ASCII.CR));
WW_Tab : constant Wide_Wide_Character :=
Wide_Wide_Character'Val (Character'Pos (ASCII.HT));
subtype WW_Control_Characters is Wide_Wide_Character
with Static_Predicate => WW_Control_Characters in
Wide_Wide_Character'Val (16#00#)
.. Wide_Wide_Character'Val (16#1F#)
| Wide_Wide_Character'Val (16#7F#);
subtype WW_Non_ASCII is Wide_Wide_Character
range Wide_Wide_Character'Val (16#80#) .. Wide_Wide_Character'Last;
subtype WW_Surrogates is Wide_Wide_Character
range Wide_Wide_Character'Val (16#D800#)
.. Wide_Wide_Character'Val (16#DFFF#);
type Codepoint_Buffer_Type (EOF : Boolean := False) is record
To_Reemit : Boolean;
-- If true, the next call to Read_Codepoint should do nothing, except
-- resetting this to component to false.
Location : Source_Location;
case EOF is
when True => null;
when False =>
Codepoint : Wide_Wide_Character;
end case;
end record;
Codepoint_Buffer : Codepoint_Buffer_Type :=
(EOF => False,
To_Reemit => False,
Location => No_Location,
Codepoint => <>);
-- Buffer used to temporarily store information read from Stream
type Any_String_Format is
(Bare_Key,
Basic_String,
Multiline_Basic_String,
Literal_String,
Multiline_Literal_String);
subtype Valid_Key_Format is Any_String_Format with Static_Predicate =>
Valid_Key_Format in Bare_Key | Basic_String | Literal_String;
type Token_Kind is
(Newline, Equal, Dot, Comma,
Curly_Bracket_Open, Curly_Bracket_Close,
Square_Bracket_Open, Square_Bracket_Close,
Double_Square_Bracket_Open, Double_Square_Bracket_Close,
Boolean_Literal, Integer_Literal, Float_Literal, String_Literal,
Offset_Datetime_Literal, Local_Datetime_Literal,
Local_Date_Literal, Local_Time_Literal);
subtype No_Text_Token is Token_Kind range
Newline .. Double_Square_Bracket_Close;
-- Tokens whose text does not matter: the kind itself holds enough
-- information to describe the token.
type Any_Token (Kind : Token_Kind := Token_Kind'First) is record
case Kind is
when No_Text_Token => null;
when Boolean_Literal => Boolean_Value : Boolean;
when Integer_Literal => Integer_Value : Any_Integer;
when Float_Literal => Float_Value : Any_Float;
when String_Literal =>
String_Value : Unbounded_UTF8_String;
String_Format : Any_String_Format;
when Offset_Datetime_Literal =>
Offset_Datetime_Value : Any_Offset_Datetime;
when Local_Datetime_Literal =>
Local_Datetime_Value : Any_Local_Datetime;
when Local_Date_Literal => Local_Date_Value : Any_Local_Date;
when Local_Time_Literal => Local_Time_Value : Any_Local_Time;
end case;
end record;
True_Keyword : constant Any_Token :=
(Kind => Boolean_Literal, Boolean_Value => True);
False_Keyword : constant Any_Token :=
(Kind => Boolean_Literal, Boolean_Value => False);
type Token_Buffer_Type (EOF : Boolean := False) is record
To_Reemit : Boolean;
-- If true, the next call to Read_Token should do nothing, except
-- resetting this to component to false.
case EOF is
when True => null;
when False =>
Token : Any_Token;
Location : Source_Location;
end case;
end record;
Token_Buffer : Token_Buffer_Type :=
(EOF => False, To_Reemit => False, Location => No_Location, Token => <>);
------------------------------
-- Syntactic analysis state --
------------------------------
Root_Table : constant TOML_Value := Create_Table;
Result : Read_Result := (Success => True, Value => Root_Table);
Current_Table : TOML_Value := Root_Table;
-- Table that the next key/value pair node will update
function Create_Error
(Message : String;
Location : Source_Location := No_Location) return Boolean
with Post => not Create_Error'Result;
-- Put in Result an unsuccessful Read_Result value with the provided error
-- information. If no source location is passed, use
-- Codepoint_Buffer.Location.
--
-- This is a function that always return False for convenience in parsing
-- helpers, which are all functions that return False on error.
function Create_Lexing_Error
(Message : String := "invalid token") return Boolean
with Post => not Create_Lexing_Error'Result;
-- Like Create_Error, but use Token_Buffer.Location as the source location
-- for the error.
function Create_Syntax_Error
(Message : String := "invalid syntax") return Boolean
with Post => not Create_Syntax_Error'Result;
-- Like Create_Error, but use Token_Buffer.Location as the source location
-- for the error.
-----------------------
-- Codepoint reading --
-----------------------
function Read_Codepoint return Boolean
with Pre => not Codepoint_Buffer.EOF or else Codepoint_Buffer.To_Reemit;
-- Read a UTF-8 codepoint from Stream. If EOF is reached or a codepoint
-- could be read, return True and update Codepoint_Buffer accordingly
-- (location included). Otherwise, return False and put an error in Result.
--
-- Note that this automatically discards carriage returns codepoints when
-- they are immediately followed by a linefeed. When they are not followed
-- by a linefeed, this creates an error.
procedure Reemit_Codepoint
with Pre => not Codepoint_Buffer.To_Reemit;
-- Re-emit the same codepoint the next time that Read_Codepoint is called
--------------------
-- Token decoding --
--------------------
function Read_Token (Key_Expected : Boolean) return Boolean
with Pre => not Token_Buffer.EOF or else Token_Buffer.To_Reemit;
-- Read a token from Stream. If EOF is reached or a token could be read,
-- return True and update Token_Buffer accordingly (location included).
-- Otherwise, return False and put an error in Result.
--
-- If Key_Expected is true:
--
-- * parse tokens that could be integer literals as string literals;
-- * parse "[["/"]]" as double square bracket tokens instead of two
-- consecutive square bracket tokens.
procedure Reemit_Token
with Pre => not Token_Buffer.To_Reemit;
-- Re-emit the same token the next time that Read_Token is called
procedure Append_As_UTF8 (Codepoint : Wide_Wide_Character)
with Pre => not Token_Buffer.EOF
and then Token_Buffer.Token.Kind = String_Literal;
-- Append the given codepoint to Token_Buffer.Token.String_Value (a UTF-8
-- encoded string).
function Digit_Value
(Codepoint : Wide_Wide_Character) return Interfaces.Unsigned_64
with Pre => Codepoint in '0' .. '9' | 'a' .. 'f' | 'A' .. 'F';
-- Assuming that Codepoint is a valid hexadecimal digit, return the
-- corresponding number value.
function Read_Unicode_Escape_Sequence
(Location : Source_Location) return Boolean;
-- Helper for Read_Quoted_String. Assuming that string parsing just read a
-- "\u" or "\U" prefix, parse the rest of the Unicode escape sequence and
-- append the denoted codepoint using Append_As_UTF8. If successful, return
-- True, otherwise put an error in Result and return False.
function Read_Quoted_String return Boolean;
-- Helper for Read_Token. Read a string literal, whose first quote is in
-- Codepoint_Buffer. Return whether successful, updating Token_Buffer
-- accordingly.
function Read_Number_Like return Boolean;
-- Helper for Read_Token. Read an integer literal or a local date, whose
-- first digit (or sign) is in Codepoint_Buffer. Return whether successful,
-- updating Token_Buffer accordingly.
function Read_Datetime_Field
(What : String;
Digit_Count : Positive;
Base_Value : Interfaces.Unsigned_64;
Base_Digits : Natural;
Value : out Interfaces.Unsigned_64) return Boolean;
-- Helper to read dates and times. Read a specific date/time field: What is
-- the name of the field to read. Considering that we already read
-- Base_Digits number of digits and that the decoded value so far is
-- Base_Value, continue consuming digits until we have a total of
-- Digit_Count digits. Put the decoded value in Value and return True if
-- successful. Create a lexing error and return False otherwise.
function Read_Date
(Base_Value : Interfaces.Unsigned_64; Base_Digits : Natural)
return Boolean;
-- Helper for Read_Number_Like. Read a local date, local datetime or an
-- offset datetime, considering that we already consumed Base_Digits
-- digits, whose value is Base_Value. Return whether successful, updating
-- Token_Buffer accordingly.
function Read_Local_Time
(Base_Value : Interfaces.Unsigned_64;
Base_Digits : Natural;
Read_Timezone : Boolean) return Boolean;
-- Helper for Read_Number_Like and Read_Date. Read a local time,
-- considering that we already consumed Base_Digits digits, whose value
-- is Base_Value. Return whether successful, updating Token_Buffer
-- accordingly (Local_Time_Literal).
--
-- If Read_Timezone is true, attempt to read the timezone information. In
-- this mode, assume that Token_Buffer already contains a date
-- (Local_Date_Literal) and update it to contain either an
-- Offset_Datetime_Literal variant (if there is a timezone) or a
-- Local_Datetime_Literal variant.
function Read_Float
(Positive : Boolean;
Integer_Value : Interfaces.Unsigned_64) return Boolean;
-- Helper for Read_Number_Like. Read a floating point number considering
-- that we already consumed its sign (Positive) and its integer part
-- (Integer_Part): the codepoint buffer must contain one of '.' | 'e' |
-- 'E'. Return whether successful, updating Token_Buffer accordingly.
function Read_Special_Float
(Name : Wide_Wide_String;
Kind : Special_Float_Kind;
Positive : Boolean) return Boolean;
-- Helper for Read_Number_Like. Read the name of a special floating point
-- number. Return whether successful, updating Token_Buffer accordingly.
function Read_Bare_Key return Boolean;
-- Helper for Read_Token. Read a bare key, whose first character is in
-- Codepoint_Buffer. Return whether successful, updating Token_Buffer
-- accordingly.
function Read_Keyword
(Text : Wide_Wide_String; Token : Any_Token) return Boolean;
-- Helper for Read_Token. Try to read the given Text, whose first character
-- is in Codepoint_Buffer. Return whether successful, updating Token_Buffer
-- accordingly.
--------------------
-- Syntax parsing --
--------------------
function Parse_Line return Boolean;
-- Read and parse the next line in Stream. Update Result accordingly.
------------------------
-- Table construction --
------------------------
function Get_Table
(Key : Unbounded_UTF8_String;
Table : in out TOML_Value;
Traverse_Arrays : Boolean := False) return Boolean;
-- Look for a sub-table in Table correspondig to Key. On success, store it
-- in Table and return True. Otherwise, return False and put an error in
-- Result.
--
-- If there is no Key entry in Table, create one and register it.
--
-- If this entry is an array, then assuming all the following hold:
--
-- * Traverse_Arrays is true;
-- * Table contains a Key entry that is an array of tables;
-- * this array contains at least one element.
--
-- then this gets the last table that was added to this array. Otherwise,
-- this fails.
function Parse_Section (Array_Of_Table : Boolean) return Boolean;
-- Parse the name of a section ([my.table]) and update Current_Table
-- accordingly. This assumes that the opening bracket is already in
-- Token_Buffer. When this returns, the Newline token (or EOF) is in
-- Token_Buffer.
--
-- If Array_Of_Table is false, expect the section name to designate a
-- table. Otherwise, expect it to designate an array of tables.
--
-- Return whether parsing and interpretation was successful.
function Parse_Dotted_Keys
(Table : in out TOML_Value;
Key : out Unbounded_UTF8_String;
Traverse_Arrays : Boolean := False) return Boolean;
-- Parse a sequence of dotted keys and interpret it as a reference into
-- Table. Put the last key in Key, and update Table to the referenced table
-- (i.e. the one in which Key will reference/create an entry).
--
-- This assumes that the first token that constitutes the dotted keys is in
-- Token_Buffer. When this returns, the token just passed the dotted keys
-- will be in Token_Buffer.
--
-- Return whether parsing and interpretation was successful.
function Parse_Value (Value : out TOML_Value) return Boolean;
-- Parse an inline value (boolean/integer literal, inline table, inline
-- array, ...) and put it in Value.
--
-- The first token that constitutes the value is expected to be read during
-- the call. When this returns, Token_Buffer contains the last token that
-- was used to parse the value.
function Parse_Array (Value : out TOML_Value) return Boolean;
-- Parse an inline array and put it in Value.
--
-- This assumes that the first token that constitutes the array (i.e. '[')
-- is in Token_Buffer. When this returns, Token_Buffer contains the last
-- token that was used to parse the value (i.e. ']').
function Parse_Table (Value : out TOML_Value) return Boolean;
-- Parse an inline table and put it in Value.
--
-- This assumes that the first token that constitutes the table (i.e. '{')
-- is in Token_Buffer. When this returns, Token_Buffer contains the last
-- token that was used to parse the value (i.e. '}').
------------------
-- Create_Error --
------------------
function Create_Error
(Message : String;
Location : Source_Location := No_Location) return Boolean is
begin
Result :=
(Success => False,
Message => To_Unbounded_String (Message),
Location => (if Location = No_Location
then Codepoint_Buffer.Location
else Location));
return False;
end Create_Error;
-------------------------
-- Create_Lexing_Error --
-------------------------
function Create_Lexing_Error
(Message : String := "invalid token") return Boolean is
begin
return Create_Error (Message, Token_Buffer.Location);
end Create_Lexing_Error;
-------------------------
-- Create_Syntax_Error --
-------------------------
function Create_Syntax_Error
(Message : String := "invalid syntax") return Boolean is
begin
return Create_Error (Message, Token_Buffer.Location);
end Create_Syntax_Error;
--------------------
-- Read_Codepoint --
--------------------
function Read_Codepoint return Boolean is
use type Interfaces.Unsigned_32;
Error_Message : constant String := "invalid UTF-8 encoding";
EOF : Boolean;
Char : Character;
-- Holders for Get OUT formals
Bytes_Count : Positive;
-- Number of bytes that encode the codepoint to read
Min_Codepoint : constant array (1 .. 4) of Interfaces.Unsigned_32 :=
(1 => 16#00#,
2 => 16#80#,
3 => 16#80_00#,
4 => 16#1_00_00#);
-- For each Bytes_Count, smallest codepoint that is allowed
Byte : Interfaces.Unsigned_32;
-- Numeric view for Char
Result : Interfaces.Unsigned_32 := 0;
-- Numeric view for the Result
begin
-- If we are supposed to re-emit the previously read codepoint, do
-- nothing more.
if Codepoint_Buffer.To_Reemit then
Codepoint_Buffer.To_Reemit := False;
return True;
end if;
-- Try to read the first byte
Get (Stream, EOF, Char);
if EOF then
Codepoint_Buffer :=
(EOF => True,
To_Reemit => False,
Location => (Codepoint_Buffer.Location.Line,
Codepoint_Buffer.Location.Column + 1));
return True;
else
Byte := Character'Pos (Char);
end if;
-- ASCII characters are always one byte long, so we can handle them
-- right now: process ASCII's control characters.
case Char is
when ASCII.NUL .. ASCII.BS
| ASCII.VT
| ASCII.FF
| ASCII.SO .. ASCII.US
| ASCII.DEL =>
return Create_Error ("invalid ASCII control character");
when ASCII.CR =>
-- If this is a carriage return, discarding after checking that it is
-- followed by a linefeed.
Get (Stream, EOF, Char);
if EOF or else Char /= ASCII.LF then
return Create_Error ("invalid stray carriage return");
end if;
Byte := Character'Pos (Char);
when others =>
null;
end case;
-- Special handling of source location update occurs only with pure
-- ASCII characters, so we can handle it here, too.
if Codepoint_Buffer.Location = No_Location then
Codepoint_Buffer.Location := (1, 1);
else
case Char is
when ASCII.LF =>
Codepoint_Buffer.Location :=
(Codepoint_Buffer.Location.Line + 1, 1);
when ASCII.HT =>
declare
Column : Natural := Codepoint_Buffer.Location.Column;
Column_Mod : constant Natural := Column mod Tab_Stop;
begin
if Column_Mod = 0 then
Column := Column + Tab_Stop;
else
Column := Column + Tab_Stop - Column_Mod;
end if;
Codepoint_Buffer.Location.Column := Column;
end;
when others =>
Codepoint_Buffer.Location.Column :=
Codepoint_Buffer.Location.Column + 1;
end case;
end if;
-- Its leading bits tell us how many bytes are to be expected
if (Byte and 2#1000_0000#) = 0 then
Bytes_Count := 1;
Result := Byte and 2#0111_1111#;
elsif (Byte and 2#1110_0000#) = 2#1100_0000# then
Bytes_Count := 2;
Result := Byte and 2#0001_1111#;
elsif (Byte and 2#1111_0000#) = 2#1110_0000# then
Bytes_Count := 3;
Result := Byte and 2#0000_1111#;
elsif (Byte and 2#1111_1000#) = 2#1111_0000# then
Bytes_Count := 4;
Result := Byte and 2#0000_0111#;
else
return Create_Error (Error_Message);
end if;
-- Read the remaining bytes. We know how many we must read, so if we
-- reach EOF in the process, we know it's an error.
for I in 2 .. Bytes_Count loop
Get (Stream, EOF, Char);
Byte := Character'Pos (Char);
if EOF or else (Byte and 2#1100_0000#) /= 2#1000_0000# then
return Create_Error (Error_Message);
end if;
Result := 64 * Result + (Byte and 2#0011_1111#);
end loop;
-- Check that the codepoint is as big as the number of bytes allows
if Result < Min_Codepoint (Bytes_Count) then
return Create_Error (Error_Message);
end if;
Codepoint_Buffer.Codepoint := Wide_Wide_Character'Val (Result);
-- Reject surrogate codepoints
if Codepoint_Buffer.Codepoint in WW_Surrogates then
return Create_Error ("surrogate codepoints are invalid");
end if;
return True;
end Read_Codepoint;
----------------------
-- Reemit_Codepoint --
----------------------
procedure Reemit_Codepoint is
begin
Codepoint_Buffer.To_Reemit := True;
end Reemit_Codepoint;
----------------
-- Read_Token --
----------------
function Read_Token (Key_Expected : Boolean) return Boolean is
begin
-- If we are supposed to re-emit the previously read token, do nothing
-- more.
if Token_Buffer.To_Reemit then
Token_Buffer.To_Reemit := False;
return True;
end if;
loop
-- The location for this token is the location of the codepoint
-- cursor before reading it. Special case for the first token:
-- codepoint location is not initialized yet, so use the actual first
-- location.
Token_Buffer.Location := Codepoint_Buffer.Location;
if Token_Buffer.Location = No_Location then
Token_Buffer.Location := (1, 1);
end if;
-- Try to read the first codepoint. If we reached the end of file,
-- communicate this fact to the caller and stop there.
if not Read_Codepoint then
return False;
end if;
if Codepoint_Buffer.EOF then
Token_Buffer := (EOF => True, To_Reemit => False);
return True;
end if;
-- Otherwise, see what we can do with this codepoint
case Codepoint_Buffer.Codepoint is
-- If this is a newline (either LF or CR-LF), return the
-- corresponding token.
when WW_Linefeed =>
Token_Buffer.Location := Codepoint_Buffer.Location;
Token_Buffer.Token := (Kind => Newline);
return True;
when WW_Carriage_Return =>
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Lexing_Error ("trailing CR");
elsif Codepoint_Buffer.Codepoint /= WW_Linefeed then
return Create_Lexing_Error ("stray CR");
end if;
Token_Buffer.Token := (Kind => Newline);
return True;
-- Skip whitespaces
when WW_Tab | ' ' =>
null;
-- Skip comments. Note that the end of file is allowed to occur in
-- a comment, i.e. without a newline at the end.
when '#' =>
Comment_Loop : loop
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
Token_Buffer := (EOF => True, To_Reemit => False);
return True;
elsif Codepoint_Buffer.Codepoint = WW_Linefeed then
-- Don't forget to re-emit the linefeed: it is not part
-- of the comment itself
Reemit_Codepoint;
exit Comment_Loop;
end if;
end loop Comment_Loop;
-- Parse no-text tokens that cannot be keys
when '=' =>
Token_Buffer.Token := (Kind => Equal);
return True;
when '.' =>
Token_Buffer.Token := (Kind => Dot);
return True;
when ',' =>
Token_Buffer.Token := (Kind => Comma);
return True;
when '{' =>
Token_Buffer.Token := (Kind => Curly_Bracket_Open);
return True;
when '}' =>
Token_Buffer.Token := (Kind => Curly_Bracket_Close);
return True;
when '[' =>
if not Read_Codepoint then
return False;
elsif Key_Expected
and then not Codepoint_Buffer.EOF
and then Codepoint_Buffer.Codepoint = '['
then
Token_Buffer.Token := (Kind => Double_Square_Bracket_Open);
else
Reemit_Codepoint;
Token_Buffer.Token := (Kind => Square_Bracket_Open);
end if;
return True;
when ']' =>
if not Read_Codepoint then
return False;
elsif Key_Expected
and then not Codepoint_Buffer.EOF
and then Codepoint_Buffer.Codepoint = ']'
then
Token_Buffer.Token := (Kind => Double_Square_Bracket_Close);
else
Reemit_Codepoint;
Token_Buffer.Token := (Kind => Square_Bracket_Close);
end if;
return True;
-- Parse string literals
when '"' | ''' =>
return Read_Quoted_String;
-- The rest is potential bare keys (bare keys, integer literals,
-- boolean literals, ...).
when '0' .. '9' =>
if Key_Expected then
return Read_Bare_Key;
else
return Read_Number_Like;
end if;
when 'A' .. 'Z' | 'a' .. 'z' | '_' =>
if Key_Expected then
return Read_Bare_Key;
end if;
-- Detect keywords: "false" or "true". TODO: handle "inf" and
-- "nan".
case Codepoint_Buffer.Codepoint is
when 'f' =>
return Read_Keyword ("false", False_Keyword);
when 't' =>
return Read_Keyword ("true", True_Keyword);
when 'n' =>
return Read_Special_Float ("nan", NaN, True);
when 'i' =>
return Read_Special_Float ("inf", Infinity, True);
when others =>
return Create_Lexing_Error;
end case;
when '+' =>
return Read_Number_Like;
when '-' =>
if Key_Expected then
return Read_Bare_Key;
else
return Read_Number_Like;
end if;
when others =>
return Create_Lexing_Error;
end case;
end loop;
end Read_Token;
------------------
-- Reemit_Token --
------------------
procedure Reemit_Token is
begin
Token_Buffer.To_Reemit := True;
end Reemit_Token;
--------------------
-- Append_As_UTF8 --
--------------------
procedure Append_As_UTF8 (Codepoint : Wide_Wide_Character) is
use Interfaces;
Ordinal : constant Unsigned_32 := Wide_Wide_Character'Pos (Codepoint);
function Bit_Slice (LSB, Width : Natural) return Unsigned_8;
-- Return the slice of bits in Codepoint/Ordinal starting at the given
-- 0-based index Least Significant Bit (LSB) and that contains Width
-- bits.
function Bit_Slice (LSB, Width : Natural) return Unsigned_8 is
Shifted : constant Unsigned_32 := Shift_Right (Ordinal, LSB);
Mask : constant Unsigned_32 := 2 ** Width - 1;
begin
return Unsigned_8 (Shifted and Mask);
end Bit_Slice;
Bytes : array (1 .. 4) of Unsigned_8;
Last_Byte : Positive;
begin
case Ordinal is
when 16#0000# .. 16#007F# =>
Bytes (1) := Bit_Slice (0, 7);
Last_Byte := 1;
when 16#0080# .. 16#07FF# =>
Bytes (1) := 2#1100_0000# or Bit_Slice (6, 5);
Bytes (2) := 2#1000_0000# or Bit_Slice (0, 6);
Last_Byte := 2;
when 16#0800# .. 16#FFFF# =>
Bytes (1) := 2#1110_0000# or Bit_Slice (12, 4);
Bytes (2) := 2#1000_0000# or Bit_Slice (6, 6);
Bytes (3) := 2#1000_0000# or Bit_Slice (0, 6);
Last_Byte := 3;
when 16#1_0000# .. 16#10_FFFF# =>
Bytes (1) := 2#1111_0000# or Bit_Slice (18, 3);
Bytes (2) := 2#1000_0000# or Bit_Slice (12, 6);
Bytes (3) := 2#1000_0000# or Bit_Slice (6, 6);
Bytes (4) := 2#1000_0000# or Bit_Slice (0, 6);
Last_Byte := 4;
when 16#11_0000# .. Unsigned_32'Last =>
-- Given that Codepoint comes from decoded UTF-8, this alternative
-- should be unreachable.
raise Program_Error;
end case;
declare
Str : String (1 .. Last_Byte) with Import, Address => Bytes'Address;
begin
Append (Token_Buffer.Token.String_Value, Str);
end;
end Append_As_UTF8;
-----------------
-- Digit_Value --
-----------------
function Digit_Value
(Codepoint : Wide_Wide_Character) return Interfaces.Unsigned_64
is
use Interfaces;
CP : constant Unsigned_64 :=
Wide_Wide_Character'Pos (Codepoint_Buffer.Codepoint);
begin
case Codepoint is
when '0' .. '9' =>
return CP - Wide_Wide_Character'Pos ('0');
when 'a' .. 'f' =>
return CP - Wide_Wide_Character'Pos ('a') + 10;
when 'A' .. 'F' =>
return CP - Wide_Wide_Character'Pos ('A') + 10;
when others =>
raise Program_Error;
end case;
end Digit_Value;
----------------------------------
-- Read_Unicode_Escape_Sequence --
----------------------------------
function Read_Unicode_Escape_Sequence
(Location : Source_Location) return Boolean
is
use Interfaces;
Size : constant Positive :=
(if Codepoint_Buffer.Codepoint = 'u' then 4 else 8);
-- Number of digits to read
CP : Unsigned_32;
-- Temporary buffer for the codepoint we just read
Result : Unsigned_32 := 0;
-- Denoted Unicode codepoint
begin
for I in 1 .. Size loop
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Error
("unterminated Unicode escape sequence", Location);
end if;
-- Turn the hexadecimal digit we just read into a number and add it
-- to Result, or raise an error if this is not a valid digit.
CP := Wide_Wide_Character'Pos (Codepoint_Buffer.Codepoint);
declare
Denoted_Digit : Unsigned_32;
begin
if Codepoint_Buffer.Codepoint in '0' .. '9' then
Denoted_Digit := CP - Wide_Wide_Character'Pos ('0');
elsif Codepoint_Buffer.Codepoint in 'a' .. 'f' then
Denoted_Digit := CP - Wide_Wide_Character'Pos ('a') + 10;
elsif Codepoint_Buffer.Codepoint in 'A' .. 'F' then
Denoted_Digit := CP - Wide_Wide_Character'Pos ('A') + 10;
else
return Create_Error
("invalid Unicode escape sequence", Location);
end if;
Result := 16 * Result + Denoted_Digit;
end;
end loop;
declare
Codepoint : constant Wide_Wide_Character :=
Wide_Wide_Character'Val (Result);
begin
-- Reject surrogate codepoints
if Codepoint in WW_Surrogates then
return Create_Error ("surrogate codepoints are invalid", Location);
end if;
Append_As_UTF8 (Codepoint);
return True;
end;
end Read_Unicode_Escape_Sequence;
------------------------
-- Read_Quoted_String --
------------------------
function Read_Quoted_String return Boolean is
Delimiter : constant Wide_Wide_Character :=
Codepoint_Buffer.Codepoint;
Is_Literal : constant Boolean := Delimiter = ''';
Is_Multiline : Boolean := False;
function Unterminated_String return Boolean is
(Create_Error ("unterminated string"));
function Skip_Line_Ending_Backslash return Boolean;
-- Assuming that, in a multiline string, we just processed a backslash
-- followed by a whitespace or a line feed (i.e. a line ending
-- backslash), skip all the following whitespaces/line feeds/backslashes
-- that should be ignored when processing the string. Return whether
-- successful (i.e. if there is no syntax error).
Location : Source_Location;
--------------------------------
-- Skip_Line_Ending_Backslash --
--------------------------------
function Skip_Line_Ending_Backslash return Boolean is
Line_Ended : Boolean := Codepoint_Buffer.Codepoint = WW_Linefeed;
-- Whether we processed a line feed after the last backslash. We keep
-- track of this to make sure that only whitespaces can follow line
-- ending backslashes.
begin
loop
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Unterminated_String;
elsif Codepoint_Buffer.Codepoint not in ' ' | WW_Tab | WW_Linefeed
then
-- We found something that must not be
-- discarded: re-emit it so that the next
-- loop iteration processes it.
Reemit_Codepoint;
exit;
elsif Line_Ended and then Codepoint_Buffer.Codepoint = '\' then
-- On a separate line, we found a new line ending backslash:
-- skip it and only expect whitespaces before the next new
-- line.
Line_Ended := False;
else
Line_Ended :=
Line_Ended or else Codepoint_Buffer.Codepoint in WW_Linefeed;
end if;
end loop;
-- There must be a line feed before the first non-whitespace
-- codepoint that follows a line ending backslash.
return (Line_Ended
or else Create_Error ("invalid escape sequence", Location));
end Skip_Line_Ending_Backslash;
begin
-- Read the potential first character of this string.
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Error ("unterminated string");
end if;
Token_Buffer.Token :=
(Kind => String_Literal,
String_Format =>
(if Is_Literal then Literal_String else Basic_String),
others => <>);
-- If we have a second delimiter, then check if this is a multi-line
-- string.
if Codepoint_Buffer.Codepoint = Delimiter then
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF
or else Codepoint_Buffer.Codepoint /= Delimiter
then
-- We found two delimiters not followed by a third one: this
-- designates an empty string.
Reemit_Codepoint;
return True;
else
-- We have three consecutive delimiters: this is a multiline
-- string.
Is_Multiline := True;
Token_Buffer.Token.String_Format :=
(if Is_Literal
then Multiline_Literal_String
else Multiline_Basic_String);
end if;
else
-- Never mind: no second delimiter, so put this codepoint back to be
-- read again in the scanning loop.
Reemit_Codepoint;
end if;
-- Now, go through all codepoints until we find the closing
-- delimiter(s).
loop
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Error ("unterminated string");
end if;
Location := Codepoint_Buffer.Location;
case Codepoint_Buffer.Codepoint is
when '"' | ''' =>
if Codepoint_Buffer.Codepoint /= Delimiter then
-- If this character is not the string delimiter, include it
-- as-is in the denoted string.
Append_As_UTF8 (Codepoint_Buffer.Codepoint);
elsif not Is_Multiline then
-- Otherwise, if the string is not multi-line, it's the end
-- of our string.
return True;
-- At this point, we know this string is multiline: look for
-- the two next characters: if they are all delimiters, this
-- is the end of our string. Otherwise, continue reading
-- them...
elsif not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Unterminated_String;
elsif Codepoint_Buffer.Codepoint /= Delimiter then
-- The second delimiter is missing: append the first one
-- and schedule to re-examine the current codepoint in
-- another loop iteration.
Append_As_UTF8 (Delimiter);
Reemit_Codepoint;
-- Read the third character...
elsif not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Unterminated_String;
elsif Codepoint_Buffer.Codepoint /= Delimiter then
-- The third delimiter is missing: append the first two ones
-- and schedule to re-examine the current codepoint in
-- another loop iteration.
Append_As_UTF8 (Delimiter);
Append_As_UTF8 (Delimiter);
Reemit_Codepoint;
-- We just got the third delimiter, but we can still have (a)
-- one or (b) two more delimiters: in that case the first (a)
-- one or (b) two are part of the string, and the last three
-- are closing the string. So try reading a fourth delimiter...
elsif not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF
or else Codepoint_Buffer.Codepoint /= Delimiter
then
-- No fourth delimiter: put back the EOF/codepoint and
-- return a successful multiline string parsing.
Reemit_Codepoint;
return True;
else
-- We got a fourth delimiter: append one to the denoted
-- string and try to read the fifth one...
Append_As_UTF8 (Delimiter);
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF
or else Codepoint_Buffer.Codepoint /= Delimiter
then
-- Just like above, if we could not get one, just put the
-- codepoint back and return success.
Reemit_Codepoint;
else
-- We got a fifth delimiter: append yet another delimiter
-- (the second one) to the denoted string and consider
-- the read done.
Append_As_UTF8 (Delimiter);
end if;
return True;
end if;
when '\' =>
-- If this is a literal string, we have a literal backslash.
if Is_Literal then
Append_As_UTF8 (Codepoint_Buffer.Codepoint);
-- This starts an escape sequence: read the next character to
-- find out which.
elsif not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Unterminated_String;
else
case Codepoint_Buffer.Codepoint is
when 'b' => Append_As_UTF8 (WW_Backspace);
when 't' => Append_As_UTF8 (WW_Tab);
when 'n' => Append_As_UTF8 (WW_Linefeed);
when 'f' => Append_As_UTF8 (WW_Form_Feed);
when 'r' => Append_As_UTF8 (WW_Carriage_Return);
when '"' => Append_As_UTF8 ('"');
when '\' => Append_As_UTF8 ('\');
when 'u' | 'U' =>
if not Read_Unicode_Escape_Sequence (Location) then
return False;
end if;
when ' ' | WW_Tab | WW_Linefeed =>
-- This is valid only for multi-line strings. If
-- literal, just append these codepoints. Otherwise we
-- we just found a "line ending backslash": discard
-- all the whitespace characters we find next.
if not Is_Multiline then
return Unterminated_String;
elsif Is_Literal then
Append_As_UTF8 (WW_Linefeed);
elsif not Skip_Line_Ending_Backslash then
return False;
end if;
when others =>
return Create_Error
("invalid escape sequence", Location);
end case;
end if;
when WW_Control_Characters =>
-- Linefeeds are allowed only for multi-line strings.
if Codepoint_Buffer.Codepoint = WW_Linefeed
and then Is_Multiline
then
-- When they are the first codepoint after the string
-- delimiter, they are discarded.
if Length (Token_Buffer.Token.String_Value) > 0 then
Append_As_UTF8 (WW_Linefeed);
end if;
elsif Codepoint_Buffer.Codepoint = WW_Tab then
-- Horizontal tabs are always allowed
Append_As_UTF8 (WW_Tab);
else
return Create_Error ("invalid string", Location);
end if;
when others =>
Append_As_UTF8 (Codepoint_Buffer.Codepoint);
end case;
end loop;
end Read_Quoted_String;
----------------------
-- Read_Number_Like --
----------------------
function Read_Number_Like return Boolean is
use Interfaces;
type Any_Format is (Decimal, Hexadecimal, Binary, Octal);
Format : Any_Format := Decimal;
-- Format for the integer to parse
Base : constant array (Any_Format) of Unsigned_64 :=
(Decimal => 10, Hexadecimal => 16, Binary => 2, Octal => 8);
type Any_Sign is (None, Positive, Negative);
Sign : Any_Sign := None;
Sign_Explicit : Boolean := False;
-- Sign for the integer to parse, and whether it was explicit
Abs_Value : Interfaces.Unsigned_64 := 0;
-- Absolute value for the integer that is parsed
Digit_Count : Natural := 0;
-- Number of digit codepoints consumed
Had_Underscore : Boolean := False;
-- Whether we found an underscore at all for this token
Leading_Zero : Boolean := False;
-- Whether this number starts with a zero
Just_Passed_Underscore : Boolean := False;
-- Whether the last codepoint processed was an underscore
function Reject_Leading_Zero return Boolean;
-- If Leading_Zero is true, create an error and return False. Return
-- true otherwise.
function Reject_Passed_Underscore return Boolean;
-- If Just_Passed_Underscore is true, create an error and return False.
-- Return true otherwise.
-------------------------
-- Reject_Leading_Zero --
-------------------------
function Reject_Leading_Zero return Boolean is
begin
if Leading_Zero then
return Create_Lexing_Error
("leading zeros are not allowed in decimals");
end if;
return True;
end Reject_Leading_Zero;
------------------------------
-- Reject_Passed_Underscore --
------------------------------
function Reject_Passed_Underscore return Boolean is
begin
if Just_Passed_Underscore then
return Create_Lexing_Error
("underscores must be surrounded by digits");
end if;
return True;
end Reject_Passed_Underscore;
function Too_Large_Error return Boolean is
(Create_Error ("too large integer", Token_Buffer.Location));
begin
Token_Buffer.Token := (Kind => Integer_Literal, Integer_Value => 0);
-- Decode the sign, if any
if Codepoint_Buffer.Codepoint in '+' | '-' then
Sign := (if Codepoint_Buffer.Codepoint = '+'
then Positive
else Negative);
Sign_Explicit := True;
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Lexing_Error;
end if;
end if;
-- If this token starts with 0, we have either:
--
-- * just 0, i.e. the next character cannot be a digit as leading zeros
-- are forbidden.
--
-- * 'b' (for binary literals), 'x' (for hexadecimal) or 'o' (for
-- octal).
if Codepoint_Buffer.Codepoint = '0' then
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
Reemit_Codepoint;
return True;
end if;
case Codepoint_Buffer.Codepoint is
when '_' | '0' .. '9' =>
Digit_Count := Digit_Count + 1;
Leading_Zero := True;
when 'b' =>
Format := Binary;
when 'o' =>
Format := Octal;
when 'x' =>
Format := Hexadecimal;
when '.' | 'e' | 'E' =>
return Read_Float (Sign /= Negative, Abs_Value);
when others =>
-- Consider all other codepoints as token separators
Reemit_Codepoint;
return True;
end case;
-- Explicit signs are valid only for numbers in decimal form
if Format /= Decimal and then Sign_Explicit then
return Create_Lexing_Error
("explicit sign not allowed but for decimals");
end if;
-- If we had a format specifier sequence, read the next codepoint,
-- which will be the first digit of the number to read.
if Format /= Decimal then
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
Reemit_Codepoint;
return True;
elsif Codepoint_Buffer.Codepoint = '_' then
return Create_Lexing_Error
("underscores must be surrounded by digits");
end if;
end if;
-- Check for special float values ("nan" and "inf")
elsif Codepoint_Buffer.Codepoint = 'n' then
return Read_Special_Float ("nan", NaN, Sign /= Negative);
elsif Codepoint_Buffer.Codepoint = 'i' then
return Read_Special_Float ("inf", Infinity, Sign /= Negative);
end if;
-- Now read and decode all digits for this token
loop
declare
Is_Digit : Boolean := False;
Digit : Unsigned_64;
begin
-- See if we have a digit
case Codepoint_Buffer.Codepoint is
when '0' .. '9' | 'a' .. 'f' | 'A' .. 'F' =>
if Format = Decimal
and then Codepoint_Buffer.Codepoint in 'e' | 'E'
then
return Reject_Leading_Zero and then
Reject_Passed_Underscore and then
Read_Float (Sign /= Negative, Abs_Value);
end if;
Is_Digit := True;
Digit := Digit_Value (Codepoint_Buffer.Codepoint);
when '_' =>
Had_Underscore := True;
if Just_Passed_Underscore then
return Reject_Passed_Underscore;
else
Just_Passed_Underscore := True;
end if;
when 'g' .. 'z' | 'G' .. 'Z' | WW_Non_ASCII =>
-- These codepoints cannot start a new token and yet they
-- are invalid elements for integer literals: this is an
-- error.
return Create_Lexing_Error;
when '-' | ':' =>
-- If we had no sign, no underscore and no base specifier,
-- we have a local date ('-') or local time (':').
if Sign /= None
or else Format /= Decimal
or else Had_Underscore
then
Reemit_Codepoint;
exit;
end if;
if Codepoint_Buffer.Codepoint = '-' then
return Read_Date (Abs_Value, Digit_Count);
else
return Read_Local_Time (Abs_Value, Digit_Count,
Read_Timezone => False);
end if;
when '.' =>
-- If we had no base specifier, we have a floating point
-- number.
--
-- Floating point numbers can only use decimal digits, and
-- there must be at least one digit before the dot.
if Format /= Decimal or Digit_Count = 0 then
return Create_Lexing_Error ("invalid float");
end if;
return Reject_Leading_Zero and then
Reject_Passed_Underscore and then
Read_Float (Sign /= Negative, Abs_Value);
when others =>
-- If we end up here, either we found the beginning of a new
-- token, or a token separator: stop reading the integer
-- right here.
Reemit_Codepoint;
exit;
end case;
-- Decode the digit (if we found one)
if Is_Digit then
Digit_Count := Digit_Count + 1;
if Digit >= Base (Format) then
return Create_Lexing_Error;
end if;
declare
Next_Value : Unsigned_64;
begin
begin
Next_Value := Base (Format) * Abs_Value + Digit;
exception
when Constraint_Error =>
return Too_Large_Error;
end;
Abs_Value := Next_Value;
end;
Just_Passed_Underscore := False;
end if;
-- Read the next digit. Consider this integer token done if we
-- reached the end of stream.
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
Reemit_Codepoint;
exit;
end if;
end;
end loop;
-- If we reach this point, we know that the token is an integer (it's
-- not a date or something else).
if not Reject_Leading_Zero or else not Reject_Passed_Underscore then
return False;
end if;
-- Apply the sign, making sure that there is no overflow in the process
declare
Rel_Value : Integer_64;
begin
if Sign = Negative then
if Abs_Value <= Unsigned_64 (Integer_64'Last) then
Rel_Value := -Integer_64 (Abs_Value);
elsif Abs_Value = Unsigned_64 (Integer_64'Last) + 1 then
Rel_Value := Integer_64'First;
else
return Too_Large_Error;
end if;
else
if Abs_Value <= Unsigned_64 (Integer_64'Last) then
Rel_Value := Integer_64 (Abs_Value);
else
return Too_Large_Error;
end if;
end if;
Token_Buffer.Token.Integer_Value := Any_Integer (Rel_Value);
return True;
end;
end Read_Number_Like;
-------------------------
-- Read_Datetime_Field --
-------------------------
function Read_Datetime_Field
(What : String;
Digit_Count : Positive;
Base_Value : Interfaces.Unsigned_64;
Base_Digits : Natural;
Value : out Interfaces.Unsigned_64) return Boolean
is
use Interfaces;
function Create_Error return Boolean is
(Create_Lexing_Error ("invalid " & What));
begin
if Base_Digits > Digit_Count then
return Create_Error;
end if;
Value := Base_value;
for DC in Base_Digits + 1 .. Digit_Count loop
-- Decode the current digit and add it to the decoded value
if Codepoint_Buffer.Codepoint not in '0' .. '9' then
return Create_Error;
end if;
Value := 10 * Value + Digit_Value (Codepoint_Buffer.Codepoint);
-- Read the next digit. We accept EOF only if we were able to read
-- as many digits as requested.
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
exit when DC = Digit_Count;
return Create_Error;
end if;
end loop;
-- This check is not necessary for correctness. It improves user
-- diagnostics: if a digit follows the last expected digit, we know
-- there is an error.
if not Codepoint_Buffer.EOF
and then Codepoint_Buffer.Codepoint in '0' .. '9'
then
return Create_Error;
end if;
-- If we came across a codepoint, re-emit it so that the lexing loop
-- can call Read_Token once more.
if Codepoint_Buffer.EOF then
Reemit_Codepoint;
end if;
return True;
end Read_Datetime_Field;
---------------
-- Read_Date --
---------------
function Read_Date
(Base_Value : Interfaces.Unsigned_64; Base_Digits : Natural)
return Boolean
is
use Interfaces;
subtype Year_Range is Unsigned_64 range
Unsigned_64 (Any_Year'First) .. Unsigned_64 (Any_Year'Last);
subtype Month_Range is Unsigned_64 range
Unsigned_64 (Any_Month'First) .. Unsigned_64 (Any_Month'Last);
subtype Day_Range is Unsigned_64 range
Unsigned_64 (Any_Day'First) .. Unsigned_64 (Any_Day'Last);
Year, Month, Day : Unsigned_64 := Base_Value;
Datetime : Any_Local_Datetime;
begin
-- Finish reading the year and consume the following dash
if not Read_Datetime_Field ("year", 4, Base_Value, Base_Digits, Year)
then
return False;
elsif Codepoint_Buffer.EOF or else Codepoint_Buffer.Codepoint /= '-' then
return Create_Lexing_Error ("invalid year");
end if;
-- Now read the month and consume the following dash
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Lexing_Error ("invalid month");
elsif not Read_Datetime_Field ("month", 2, 0, 0, Month) then
return False;
elsif Codepoint_Buffer.EOF or else Codepoint_Buffer.Codepoint /= '-' then
return Create_Lexing_Error ("invalid month");
end if;
-- Now read the day
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Lexing_Error ("invalid day");
elsif not Read_Datetime_Field ("day", 2, 0, 0, Day) then
return False;
end if;
-- Check that all fields are in range.
--
-- TODO: check that the date they represent is valid. This is not
-- trivial as TOML can handle all years between 0 and 9999 while
-- Ada.Calendar supports only 1901 through 2399.
if Year not in Year_Range then
return Create_Lexing_Error ("out of range year");
elsif Month not in Month_Range then
return Create_Lexing_Error ("out of range month");
elsif Day not in Day_Range then
return Create_Lexing_Error ("out of range day");
end if;
Datetime.Date := (Year => Any_Year (Year),
Month => Any_Month (Month),
Day => Any_Day (Day));
Token_Buffer.Token := (Kind => Local_Date_Literal,
Local_Date_Value => Datetime.Date);
-- Now try to read a local time: if there is one, we can create a local
-- datetime, otherwise it's just a local date.
if not Codepoint_Buffer.EOF
and then Codepoint_Buffer.Codepoint in 'T' | 't'
then
-- If the first codepoint after the date is 'T', then we know we have
-- a local time ahead.
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Lexing_Error ("truncated datetime");
end if;
elsif not Codepoint_Buffer.EOF and then Codepoint_Buffer.Codepoint = ' '
then
-- If the first codepoint after the date is ' ', then we know we have
-- a local time ahead iff a digit follows this space. Otherwise, just
-- consider it's the beginning of another token.
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF
or else Codepoint_Buffer.Codepoint not in '0' .. '9'
then
Reemit_Codepoint;
return True;
end if;
else
Reemit_Codepoint;
return True;
end if;
-- At this point, we know there is a local time ahead, so try to read it
return Read_Local_Time (0, 0, Read_Timezone => True);
end Read_Date;
---------------------
-- Read_Local_Time --
---------------------
function Read_Local_Time
(Base_Value : Interfaces.Unsigned_64;
Base_Digits : Natural;
Read_Timezone : Boolean) return Boolean
is
use Interfaces;
subtype Hour_Range is Unsigned_64 range
Unsigned_64 (Any_Hour'First) .. Unsigned_64 (Any_Hour'Last);
subtype Minute_Range is Unsigned_64 range
Unsigned_64 (Any_Minute'First) .. Unsigned_64 (Any_Minute'Last);
subtype Second_Range is Unsigned_64 range
Unsigned_64 (Any_Second'First) .. Unsigned_64 (Any_Second'Last);
subtype Millisecond_Range is Unsigned_64 range
Unsigned_64 (Any_Millisecond'First)
.. Unsigned_64 (Any_Millisecond'Last);
Hour, Minute, Second, Millisecond : Unsigned_64 := Base_Value;
Time : Any_Local_Time;
begin
-- Finish reading the hour and consume the following colon
if not Read_Datetime_Field ("hour", 2, Base_Value, Base_Digits, Hour)
then
return False;
elsif Codepoint_Buffer.EOF or else Codepoint_Buffer.Codepoint /= ':' then
return Create_Lexing_Error ("invalid hour");
end if;
-- Now read the minute and consume the following colon
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Lexing_Error ("invalid minute");
elsif not Read_Datetime_Field ("minute", 2, 0, 0, Minute) then
return False;
elsif Codepoint_Buffer.EOF or else Codepoint_Buffer.Codepoint /= ':' then
return Create_Lexing_Error ("invalid minute");
end if;
-- Now read the second
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Lexing_Error ("invalid second");
elsif not Read_Datetime_Field ("second", 2, 0, 0, Second) then
return False;
end if;
-- If present, read a dot, and then read the millisecond
Millisecond := 0;
if Codepoint_Buffer.EOF or else Codepoint_Buffer.Codepoint /= '.' then
Reemit_Codepoint;
elsif not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Lexing_Error ("truncated millisecond");
else
-- Read at least 1 digit and at most 3 digits, then discard other
-- digits.
declare
Digit_Count : Natural := 0;
begin
while not Codepoint_Buffer.EOF
and then Codepoint_Buffer.Codepoint in '0' .. '9'
loop
if Digit_Count < 3 then
Digit_Count := Digit_Count + 1;
Millisecond := (10 * Millisecond
+ Digit_Value (Codepoint_Buffer.Codepoint));
end if;
if not Read_Codepoint then
return False;
end if;
end loop;
-- Artificially append zeros so that what we really get is the
-- number of milliseconds (".1" should give 100 milliseconds, not
-- just 1).
while Digit_Count < 3 loop
Digit_Count := Digit_Count + 1;
Millisecond := 10 * Millisecond;
end loop;
Reemit_Codepoint;
end;
end if;
-- Check that all fields are in range
if Hour not in Hour_Range then
return Create_Lexing_Error ("out of range hour");
elsif Minute not in Minute_Range then
return Create_Lexing_Error ("out of range minute");
elsif Second not in Second_Range then
return Create_Lexing_Error ("out of range second");
end if;
-- The millisecond is read with 3 digits, and that's exactly what the
-- millisecond range allows so this should be always true.
pragma Assert (Millisecond in Millisecond_Range);
Time := (Hour => Any_Hour (Hour),
Minute => Any_Minute (Minute),
Second => Any_Second (Second),
Millisecond => Any_Millisecond (Millisecond));
if not Read_Timezone then
Token_Buffer.Token :=
(Kind => Local_Time_Literal,
Local_Time_Value => Time);
return True;
end if;
-- We were asked to read the timezone information: assume the token
-- buffer contains a date and complete it with the time, and the
-- timezone if present.
declare
Datetime : constant Any_Local_Datetime :=
(Date => Token_Buffer.Token.Local_Date_Value,
Time => Time);
-- Temporaries to build the local offset value that is read
Positive_Offset : Boolean;
-- Whether the offset is positive (starts with '+' or 'Z'). Note that
-- RFC 3339 states that a negative offset with zero minutes means
-- "unknown local offset".
Hour_Offset : Unsigned_64 := 0;
Minute_Offset : Unsigned_64 := 0;
-- Individual temporaries for the amount of ours and of minutes for
-- the local offset.
begin
Token_Buffer.Token :=
(Kind => Local_Datetime_Literal,
Local_Datetime_Value => Datetime);
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF
or else Codepoint_Buffer.Codepoint not in 'Z' | 'z' | '+' | '-'
then
Reemit_Codepoint;
return True;
end if;
if Codepoint_Buffer.Codepoint in 'Z' | 'z' then
Positive_Offset := True;
else
Positive_Offset := Codepoint_Buffer.Codepoint = '+';
-- Consume the hour offset and consume the colon
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Lexing_Error ("truncated hour offset");
elsif not Read_Datetime_Field ("hour offset", 2, 0, 0, Hour_Offset)
then
return False;
elsif Codepoint_Buffer.EOF
or else Codepoint_Buffer.Codepoint /= ':'
then
return Create_Lexing_Error ("invalid hour offset");
end if;
-- Now consume the minute offset
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Create_Lexing_Error ("truncated minute offset");
elsif not Read_Datetime_Field
("minute offset", 2, 0, 0, Minute_Offset)
then
return False;
end if;
-- Reemit the last codepoint as Read_Datetime_Field consumes the
-- one that appears right after the last codepoint that is part of
-- the datetime field.
Reemit_Codepoint;
end if;
-- Check ranges for hours/minutes
if Hour_Offset not in Hour_Range then
return Create_Lexing_Error ("out of range hour offset");
elsif Minute_Offset not in Minute_Range then
return Create_Lexing_Error ("out of range minute offset");
end if;
-- Gather all decoded data to format the result
declare
Absolute_Offset : constant Any_Local_Offset := Any_Local_Offset
(60 * Hour_Offset + Minute_Offset);
Offset : constant Any_Local_Offset :=
(if Positive_Offset
then Absolute_Offset
else -Absolute_Offset);
Offset_Datetime : constant Any_Offset_Datetime :=
(Datetime => Datetime,
Offset => Offset,
Unknown_Offset => Offset = 0 and then not Positive_Offset);
begin
Token_Buffer.Token :=
(Kind => Offset_Datetime_Literal,
Offset_Datetime_Value => Offset_Datetime);
return True;
end;
end;
end Read_Local_Time;
----------------
-- Read_Float --
----------------
function Read_Float
(Positive : Boolean;
Integer_Value : Interfaces.Unsigned_64) return Boolean
is
function Invalid_Float return Boolean is
(Create_Lexing_Error ("invalid float"));
function Too_Large return Boolean is
(Create_Lexing_Error ("too large float"));
function Read_Simple_Integer
(Value : out Interfaces.Unsigned_64) return Boolean
with Pre => not Codepoint_Buffer.EOF;
-- Helper to read a simple decimal integer, including underscores
-------------------------
-- Read_Simple_Integer --
-------------------------
function Read_Simple_Integer
(Value : out Interfaces.Unsigned_64) return Boolean
is
use type Interfaces.Unsigned_64;
Empty : Boolean := True;
-- Whether we read no digit so far
Previous_Is_Underscore : Boolean := True;
-- Given that it is forbidden to have a leading underscore, do as if
-- we just had an underscore at the beginning so that we need to
-- check only for consecutive underscores.
begin
Value := 0;
-- Read and decode all digits that follow in the stream
while not Codepoint_Buffer.EOF
and then Codepoint_Buffer.Codepoint in '0' .. '9' | '_'
loop
-- Discard underscores, yet do not allow consecutive ones
if Codepoint_Buffer.Codepoint = '_' then
if Previous_Is_Underscore then
return Invalid_Float;
else
Previous_Is_Underscore := True;
end if;
-- Decode digits to build Value as we go. Consider the number too
-- large as soon as it is bigger than half the largest possible
-- unsigned 64 value: bigger numbers are unlikely and this allows
-- us to negate values safely later on.
else
begin
Value :=
10 * Value + Digit_Value (Codepoint_Buffer.Codepoint);
if Value > Interfaces.Unsigned_64'Last / 2 then
return Too_Large;
end if;
exception
when Constraint_Error =>
return Too_Large;
end;
Empty := False;
Previous_Is_Underscore := False;
end if;
if not Read_Codepoint then
return Invalid_Float;
end if;
end loop;
-- We expect at least one digit, and the last codepoint must not be
-- an underscore.
if Empty or else Previous_Is_Underscore then
return Invalid_Float;
else
return True;
end if;
end Read_Simple_Integer;
Fractional_Value : Interfaces.Unsigned_64 := 0;
Exponent : Interfaces.Unsigned_64 := 0;
Exponent_Positive : Boolean := True;
Result : Any_Float := (Kind => Regular, Value => <>);
begin
-- Read the fractional part, if present
if Codepoint_Buffer.Codepoint = '.' then
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Invalid_Float;
elsif not Read_Simple_Integer (Fractional_Value) then
return False;
end if;
end if;
-- Read the exponent, if present
if not Codepoint_Buffer.EOF
and then Codepoint_Buffer.Codepoint in 'e' | 'E'
then
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Invalid_Float;
end if;
-- First read the sign
if Codepoint_Buffer.Codepoint in '+' | '-' then
Exponent_Positive := Codepoint_Buffer.Codepoint /= '-';
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF then
return Invalid_Float;
end if;
end if;
-- Then the exponent absolute value
if not Read_Simple_Integer (Exponent) then
return False;
end if;
end if;
-- Reemit the last codepoint: it is not part of the float token and the
-- next token reading iteration needs to read it.
Reemit_Codepoint;
-- Use all lexed parts to create a floating point value
declare
function Image
(Positive : Boolean; Value : Interfaces.Unsigned_64) return String;
-----------
-- Image --
-----------
function Image
(Positive : Boolean; Value : Interfaces.Unsigned_64) return String
is
Result : constant String := Value'Image;
Stripped : String renames Result (Result'First + 1 .. Result'Last);
pragma Assert (Result (Result'First) = ' ');
begin
return (if Positive
then Stripped
else "-" & Stripped);
end Image;
Value_Image : constant String :=
Image (Positive, Integer_Value)
& "." & Image (True, Fractional_Value)
& "e" & Image (Exponent_Positive, Exponent);
begin
Result.Value := Valid_Float'Value (Value_Image);
exception
when Constraint_Error =>
return Too_Large;
end;
if not Result.Value'Valid then
if Result.Value < Valid_Float'First then
Result := (Kind => Infinity, Positive => False);
elsif Result.Value > Valid_Float'Last then
Result := (Kind => Infinity, Positive => True);
else
Result := (Kind => NaN, Positive => True);
end if;
end if;
Token_Buffer.Token := (Kind => Float_Literal, Float_Value => Result);
return True;
end Read_Float;
------------------------
-- Read_Special_Float --
------------------------
function Read_Special_Float
(Name : Wide_Wide_String;
Kind : Special_Float_Kind;
Positive : Boolean) return Boolean
is
function Invalid_Float return Boolean is
(Create_Lexing_Error ("invalid float"));
begin
pragma Assert (Codepoint_Buffer.Codepoint = Name (Name'First));
for C of Name (Name'First + 1 .. Name'Last) loop
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF
or else Codepoint_Buffer.Codepoint /= C
then
return Invalid_Float;
end if;
end loop;
declare
Value : Any_Float (Kind);
begin
Value.Positive := Positive;
Token_Buffer.Token := (Kind => Float_Literal, Float_Value => Value);
end;
return True;
end Read_Special_Float;
-------------------
-- Read_Bare_Key --
-------------------
function Read_Bare_Key return Boolean is
begin
Token_Buffer.Token :=
(Kind => String_Literal,
String_Format => Bare_Key,
others => <>);
loop
-- Add the previously read character to the key token
Append_As_UTF8 (Codepoint_Buffer.Codepoint);
-- Then check the next character: exit the loop as soon as we either
-- reach the end of stream, or we find a non-key character.
if not Read_Codepoint then
return False;
end if;
exit when
Codepoint_Buffer.EOF
or else Codepoint_Buffer.Codepoint not in
'0' .. '9' | 'A' .. 'Z' | 'a' .. 'z' | '_' | '-';
end loop;
-- Be sure to schedule the re-emission of the read event that made us
-- stop reading characters so that callers can attempt to read one more
-- token.
Reemit_Codepoint;
return True;
end Read_Bare_Key;
------------------
-- Read_Keyword --
------------------
function Read_Keyword
(Text : Wide_Wide_String; Token : Any_Token) return Boolean is
begin
-- Read all codepoints that constitute the token (except the first one,
-- as per the Read_Keyword contract) and make sure they match the
-- expected text.
for I in Text'First + 1 .. Text'Last loop
if not Read_Codepoint then
return False;
elsif Codepoint_Buffer.EOF
or else Codepoint_Buffer.Codepoint /= Text (I)
then
return Create_Lexing_Error ("invalid token");
end if;
end loop;
Token_Buffer.Token := Token;
return True;
end Read_Keyword;
----------------
-- Parse_Line --
----------------
function Parse_Line return Boolean is
begin
if not Read_Token (Key_Expected => True) then
return False;
elsif Token_Buffer.EOF then
return True;
end if;
case Token_Buffer.Token.Kind is
when Newline =>
return True;
when Square_Bracket_Open =>
-- Parse a [section]
return Parse_Section (Array_Of_Table => False);
when Double_Square_Bracket_Open =>
-- Parse a [[section]]
return Parse_Section (Array_Of_Table => True);
when String_Literal =>
-- Parse a key/value pair
declare
Table : TOML_Value := Current_Table;
Key : Unbounded_UTF8_String;
Value : TOML_Value;
begin
-- Parse the dotted key that identify the table entry to
-- create. In particular, get the destination table (Table) and
-- the key to insert (Key) and make sure there is no existing
-- entry for Key.
if not Parse_Dotted_Keys (Table, Key, Traverse_Arrays => False)
then
return False;
elsif Table.Has (Key) then
return Create_Syntax_Error ("duplicate key");
end if;
if Token_Buffer.EOF or else Token_Buffer.Token.Kind /= Equal
then
return Create_Syntax_Error;
end if;
-- Now parse the value for the entry to insert. On success, do
-- the insertion.
if Parse_Value (Value) then
Table.Set (Key, Value);
else
return False;
end if;
-- Expect either a new line, or the end of the file
if not Read_Token (Key_Expected => True) then
return False;
elsif Token_Buffer.EOF then
return True;
elsif Token_Buffer.Token.Kind /= Newline then
return Create_Syntax_Error ("missing newline");
end if;
return True;
end;
when others =>
return Create_Syntax_Error;
end case;
end Parse_Line;
---------------
-- Get_Table --
---------------
function Get_Table
(Key : Unbounded_UTF8_String;
Table : in out TOML_Value;
Traverse_Arrays : Boolean := False) return Boolean
is
Next_Table : TOML_Value := Table.Get_Or_Null (Key);
begin
if Next_Table.Is_Null then
Next_Table := Create_Table;
Next_Table.Set_Implicitly_Created;
Table.Set (Key, Next_Table);
Table := Next_Table;
return True;
elsif Next_Table.Kind = TOML_Table then
Table := Next_Table;
return True;
elsif Traverse_Arrays
and then Next_Table.Kind = TOML_Array
and then Next_Table.Length > 0
then
Table := Next_Table.Item (Next_Table.Length);
return True;
else
return Create_Syntax_Error ("invalid table key");
end if;
end Get_Table;
-------------------
-- Parse_Section --
-------------------
function Parse_Section (Array_Of_Table : Boolean) return Boolean is
Opening_Bracket_Location : constant Source_Location :=
Token_Buffer.Location;
Closing_Bracket : constant Token_Kind :=
(if Array_Of_Table
then Double_Square_Bracket_Close
else Square_Bracket_Close);
Table : TOML_Value := Root_Table;
Key : Unbounded_UTF8_String;
begin
-- Get the first token for the section name, as per Parse_Dotted_Keys's
-- contract.
if not Read_Token (Key_Expected => True) then
return False;
elsif Token_Buffer.EOF then
return Create_Syntax_Error;
elsif not Parse_Dotted_Keys (Table, Key, Traverse_Arrays => True) then
return False;
-- At this point, Parse_Dotted_Keys left the first non-key token in
-- Token_Buffer: make sure we have the closing bracket.
elsif Token_Buffer.EOF or else Token_Buffer.Token.Kind /= Closing_Bracket
then
return Create_Syntax_Error;
-- And now, make sure that we have either EOF or a newline next
elsif not Read_Token (Key_Expected => False)
or else (not Token_Buffer.EOF
and then Token_Buffer.Token.Kind /= Newline)
then
return Create_Syntax_Error;
end if;
-- Finally, create the requested table
if Array_Of_Table then
-- Key is supposed to refer to an array of tables: if there is no
-- such entry in Table, create one, otherwise make sure it has the
-- expected item type.
declare
Arr : TOML_Value := Table.Get_Or_Null (Key);
begin
if Arr.Is_Null then
Arr := Create_Array;
Arr.Set_Implicitly_Created;
Table.Set (Key, Arr);
elsif Arr.Kind /= TOML_Array then
return Create_Error
("invalid array", Opening_Bracket_Location);
elsif not Arr.Implicitly_Created then
return Create_Error
("arrays of tables cannot complete inline arrays",
Opening_Bracket_Location);
end if;
-- Create a new table and append it to this array
Current_Table := Create_Table;
Arr.Append (Current_Table);
end;
else
-- If Key is already associated to a table, return it (it's an error
-- if it is not a table or if it was already created explicitly).
-- Create the destination table otherwise.
if Table.Has (Key) then
Current_Table := Table.Get (Key);
if Current_Table.Kind /= TOML_Table then
return Create_Error
("duplicate key", Opening_Bracket_Location);
elsif Current_Table.Implicitly_Created then
Current_Table.Set_Explicitly_Created;
else
return Create_Error
("cannot create tables twice", Opening_Bracket_Location);
end if;
else
Current_Table := Create_Table;
Table.Set (Key, Current_Table);
end if;
end if;
return True;
end Parse_Section;
-----------------------
-- Parse_Dotted_Keys --
-----------------------
function Parse_Dotted_Keys
(Table : in out TOML_Value;
Key : out Unbounded_UTF8_String;
Traverse_Arrays : Boolean := False) return Boolean
is
Has_Key : Boolean := False;
-- Whether we parsed at least one key
begin
loop
-- Process the current key, updating Table accordingly
if Token_Buffer.EOF
or else Token_Buffer.Token.Kind /= String_Literal
or else Token_Buffer.Token.String_Format not in Valid_Key_Format
then
return Create_Syntax_Error;
end if;
-- We are about to parse a key. If we already parsed one, we need to
-- fetch the corresponding table.
if Has_Key and then not Get_Table (Key, Table, Traverse_Arrays) then
return False;
end if;
Key := Token_Buffer.Token.String_Value;
Has_Key := True;
-- If the next token is a dot, expect another key. Otherwise, stop
-- parsing keys.
if not Read_Token (Key_Expected => True) then
return False;
elsif Token_Buffer.EOF or else Token_Buffer.Token.Kind /= Dot then
return True;
elsif not Read_Token (Key_Expected => True) then
return False;
end if;
end loop;
end Parse_Dotted_Keys;
-----------------
-- Parse_Value --
-----------------
function Parse_Value (Value : out TOML_Value) return Boolean is
begin
-- Fetch the first token that encodes the value to parse...
if not Read_Token (Key_Expected => False) then
return False;
elsif Token_Buffer.EOF then
return Create_Syntax_Error;
end if;
case Token_Buffer.Token.Kind is
when Boolean_Literal =>
Value := Create_Boolean (Token_Buffer.Token.Boolean_Value);
when Integer_Literal =>
Value := Create_Integer (Token_Buffer.Token.Integer_Value);
when Float_Literal =>
Value := Create_Float (Token_Buffer.Token.Float_Value);
when String_Literal =>
Value := Create_String (Token_Buffer.Token.String_Value);
when Offset_Datetime_Literal =>
Value := Create_Offset_Datetime
(Token_Buffer.Token.Offset_Datetime_Value);
when Local_Datetime_Literal =>
Value := Create_Local_Datetime
(Token_Buffer.Token.Local_Datetime_Value);
when Local_Date_Literal =>
Value := Create_Local_Date (Token_Buffer.Token.Local_Date_Value);
when Local_Time_Literal =>
Value := Create_Local_Time (Token_Buffer.Token.Local_Time_Value);
when Square_Bracket_Open =>
return Parse_Array (Value);
when Curly_Bracket_Open =>
return Parse_Table (Value);
when others =>
return Create_Syntax_Error
("invalid (or not supported yet) syntax");
end case;
return True;
end Parse_Value;
-----------------
-- Parse_Array --
-----------------
function Parse_Array (Value : out TOML_Value) return Boolean is
Comma_Allowed : Boolean := False;
begin
Value := Create_Array;
loop
-- Fetch the next token. We need one, so reaching end of stream is a
-- parsing error.
if not Read_Token (Key_Expected => False) then
return False;
elsif Token_Buffer.EOF then
return Create_Syntax_Error;
end if;
case Token_Buffer.Token.Kind is
when Square_Bracket_Close =>
return True;
when Newline =>
-- Newlines are allowed anywhere between surrounding brackets,
-- values and commas.
null;
when Comma =>
if Comma_Allowed then
Comma_Allowed := False;
else
return Create_Syntax_Error;
end if;
when others =>
-- We are expecting a comma right after parsing a value, so if
-- we have a potential value in this case, we know a comma is
-- missing.
if Comma_Allowed then
return Create_Syntax_Error;
end if;
-- We already read the first token for this value, but
-- Parse_Value expects it not to be read yet, so plan to
-- re-emit it.
Reemit_Token;
declare
Item : TOML_Value;
begin
-- Parse the item value and then append the item to the
-- result.
if not Parse_Value (Item) then
return False;
end if;
Value.Append (Item);
end;
Comma_Allowed := True;
end case;
end loop;
end Parse_Array;
-----------------
-- Parse_Table --
-----------------
function Parse_Table (Value : out TOML_Value) return Boolean is
Comma_Allowed : Boolean := False;
Last_Was_Comma : Boolean := False;
Key : Unbounded_UTF8_String;
Table : TOML_Value;
begin
Value := Create_Table;
loop
-- Fetch the next token (a potential key for the next table entry, or
-- a closing bracket). We need one, so reaching end of stream is a
-- parsing error.
if not Read_Token (Key_Expected => True) then
return False;
elsif Token_Buffer.EOF then
return Create_Syntax_Error;
end if;
case Token_Buffer.Token.Kind is
when Curly_Bracket_Close =>
if Last_Was_Comma then
return Create_Error ("invalid trailing comma");
end if;
return True;
when Newline =>
return Create_Error ("newlines not allowed in inlined tables");
when Comma =>
Last_Was_Comma := True;
if Comma_Allowed then
Comma_Allowed := False;
else
return Create_Syntax_Error;
end if;
when String_Literal =>
-- We are expecting a comma right after parsing a value, so if
-- we have a potential value in this case, we know a comma is
-- missing.
if Comma_Allowed then
return Create_Syntax_Error;
end if;
-- Dotted keys are allowed in inline tables, so attempt to
-- parse dotted keys (i.e. multiple tokens) and make sure it is
-- followed by an equal token.
Table := Value;
if not Parse_Dotted_Keys (Table, Key, Traverse_Arrays => False)
then
return False;
elsif Token_Buffer.EOF or else Token_Buffer.Token.Kind /= Equal
then
return Create_Syntax_Error;
end if;
-- Then try to create the table entry
if Table.Has (Key) then
return Create_Syntax_Error ("duplicate key");
end if;
-- Now read the value
declare
Item : TOML_Value;
begin
-- Parse the item value, reject heterogeneous arrays, and
-- then append the item to the result.
if not Parse_Value (Item) then
return False;
end if;
-- Finally register the table entry
Table.Set (Key, Item);
Comma_Allowed := True;
Last_Was_Comma := False;
end;
when others =>
return Create_Syntax_Error;
end case;
end loop;
end Parse_Table;
begin
while not Token_Buffer.EOF loop
if not Parse_Line then
return Result;
end if;
end loop;
return Result;
end TOML.Generic_Parse;
|
pragma Ada_2005;
pragma Style_Checks (Off);
pragma Warnings (Off);
with Interfaces.C; use Interfaces.C;
with System;
with GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstbuffer_h;
limited with GStreamer.GST_Low_Level.gstreamer_0_10_gst_video_gstsurfaceconverter_h;
with glib;
with glib.Values;
with System;
with glib;
package GStreamer.GST_Low_Level.gstreamer_0_10_gst_video_gstsurfacebuffer_h is
-- unsupported macro: GST_TYPE_SURFACE_BUFFER (gst_surface_buffer_get_type())
-- arg-macro: function GST_SURFACE_BUFFER (obj)
-- return G_TYPE_CHECK_INSTANCE_CAST((obj),GST_TYPE_SURFACE_BUFFER,GstSurfaceBuffer);
-- arg-macro: function GST_SURFACE_BUFFER_CLASS (klass)
-- return G_TYPE_CHECK_CLASS_CAST((klass),GST_TYPE_SURFACE_BUFFER,GstSurfaceBufferClass);
-- arg-macro: function GST_SURFACE_BUFFER_GET_CLASS (obj)
-- return G_TYPE_INSTANCE_GET_CLASS((obj),GST_TYPE_SURFACE_BUFFER,GstSurfaceBufferClass);
-- arg-macro: function GST_IS_SURFACE_BUFFER (obj)
-- return G_TYPE_CHECK_INSTANCE_TYPE((obj),GST_TYPE_SURFACE_BUFFER);
-- arg-macro: function GST_IS_SURFACE_BUFFER_CLASS (obj)
-- return G_TYPE_CHECK_CLASS_TYPE((klass),GST_TYPE_SURFACE_BUFFER);
GST_VIDEO_CAPS_SURFACE : aliased constant String := "video/x-surface" & ASCII.NUL; -- gst/video/gstsurfacebuffer.h:50
-- GStreamer
-- * Copyright (C) 2011 Collabora Ltd.
-- * Copyright (C) 2011 Intel
-- *
-- * Author: Nicolas Dufresne <nicolas.dufresne@collabora.com>
-- *
-- * This library is free software; you can redistribute it and/or
-- * modify it under the terms of the GNU Library General Public
-- * License as published by the Free Software Foundation; either
-- * version 2 of the License, or (at your option) any later version.
-- *
-- * This library is distributed in the hope that it will be useful,
-- * but WITHOUT ANY WARRANTY; without even the implied warranty of
-- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- * Library General Public License for more details.
-- *
-- * You should have received a copy of the GNU Library General Public
-- * License along with this library; if not, write to the
-- * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-- * Boston, MA 02111-1307, USA.
--
--*
-- * GST_VIDEO_CAPS_SURFACE:
-- *
-- * Base caps for GstSurfaceBuffer. Implementation specific type must be marked
-- * using the type attribute (e.g. type=vaapi). Available convertion shall be
-- * specified using boolean attributes (e.g. opengl=true).
--
type GstSurfaceBufferClass;
type u_GstSurfaceBufferClass_padding_array is array (0 .. 3) of System.Address;
--subtype GstSurfaceBufferClass is u_GstSurfaceBufferClass; -- gst/video/gstsurfacebuffer.h:52
--*
-- * GstSurfaceBuffer:
-- * @parent: parent object
--
type u_GstSurfaceBuffer_padding_array is array (0 .. 3) of System.Address;
type GstSurfaceBuffer is record
parent : aliased GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstbuffer_h.GstBuffer; -- gst/video/gstsurfacebuffer.h:60
padding : u_GstSurfaceBuffer_padding_array; -- gst/video/gstsurfacebuffer.h:63
end record;
pragma Convention (C_Pass_By_Copy, GstSurfaceBuffer); -- gst/video/gstsurfacebuffer.h:58
--< private >
--*
-- * GstSurfaceBufferClass:
-- * @parent_class: parent class type.
-- * @create_converter: vmethod to create a converter.
-- *
-- * #GstVideoContextInterface interface.
--
type GstSurfaceBufferClass is record
parent_class : aliased GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstbuffer_h.GstBufferClass; -- gst/video/gstsurfacebuffer.h:75
create_converter : access function
(arg1 : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_video_gstsurfaceconverter_h.GstSurfaceBuffer;
arg2 : access GLIB.gchar;
arg3 : access Glib.Values.GValue) return System.Address; -- gst/video/gstsurfacebuffer.h:79
padding : u_GstSurfaceBufferClass_padding_array; -- gst/video/gstsurfacebuffer.h:82
end record;
pragma Convention (C_Pass_By_Copy, GstSurfaceBufferClass); -- gst/video/gstsurfacebuffer.h:73
--< private >
function gst_surface_buffer_get_type return GLIB.GType; -- gst/video/gstsurfacebuffer.h:85
pragma Import (C, gst_surface_buffer_get_type, "gst_surface_buffer_get_type");
function gst_surface_buffer_create_converter
(buffer : access GStreamer.GST_Low_Level.gstreamer_0_10_gst_video_gstsurfaceconverter_h.GstSurfaceBuffer;
c_type : access GLIB.gchar;
dest : access Glib.Values.GValue) return System.Address; -- gst/video/gstsurfacebuffer.h:87
pragma Import (C, gst_surface_buffer_create_converter, "gst_surface_buffer_create_converter");
end GStreamer.GST_Low_Level.gstreamer_0_10_gst_video_gstsurfacebuffer_h;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T O R A G E _ I O --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Unchecked_Conversion;
package body Ada.Storage_IO is
type Buffer_Ptr is access all Buffer_Type;
type Elmt_Ptr is access all Element_Type;
function To_Buffer_Ptr is new Unchecked_Conversion (Elmt_Ptr, Buffer_Ptr);
----------
-- Read --
----------
procedure Read (Buffer : Buffer_Type; Item : out Element_Type) is
begin
To_Buffer_Ptr (Item'Unrestricted_Access).all := Buffer;
end Read;
-----------
-- Write --
-----------
procedure Write (Buffer : out Buffer_Type; Item : Element_Type) is
begin
Buffer := To_Buffer_Ptr (Item'Unrestricted_Access).all;
end Write;
end Ada.Storage_IO;
|
------------------------------------------------------------------------------
-- Copyright (c) 2016, 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.Smaz_Implementations is empty root packages for the various --
-- implementation-specific elements used for instantiating --
-- Natools.Smaz_Generic. --
------------------------------------------------------------------------------
package Natools.Smaz_Implementations is
pragma Pure;
end Natools.Smaz_Implementations;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.GENERIC_SORT --
-- --
-- S p e c --
-- --
-- Copyright (C) 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 unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
-- Allows an anonymous array (or array-like container) to be sorted. Generic
-- formal Before returns the result of comparing the elements designated by
-- the indexes, and generic formal Swap exchanges the designated elements.
generic
type Index_Type is (<>);
with function Before (Left, Right : Index_Type) return Boolean;
with procedure Swap (Left, Right : Index_Type);
procedure Ada.Containers.Generic_Sort (First, Last : Index_Type'Base);
pragma Pure (Ada.Containers.Generic_Sort);
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>exp_generic_double_s</name>
<ret_bitwidth>64</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>x</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>x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>164</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_2">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>x_read</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</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>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>172</item>
<item>173</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>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>p_Val2_s</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>475</lineNumber>
<contextFuncName>fp_struct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>188</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>fp_struct</second>
</first>
<second>475</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>val</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>174</item>
</oprand_edges>
<opcode>bitcast</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="_4">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>p_Result_26</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>475</lineNumber>
<contextFuncName>fp_struct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>188</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>fp_struct</second>
</first>
<second>475</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>176</item>
<item>177</item>
<item>179</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>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>tmp_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>477</lineNumber>
<contextFuncName>fp_struct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>188</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>fp_struct</second>
</first>
<second>477</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>181</item>
<item>182</item>
<item>184</item>
<item>186</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>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>tmp_V_3</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>478</lineNumber>
<contextFuncName>fp_struct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_isnan.h</first>
<second>generic_isnan&lt;double&gt;</second>
</first>
<second>16</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>208</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>fp_struct</second>
</first>
<second>478</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>52</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>187</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>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>tmp_i</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_isnan.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>17</lineNumber>
<contextFuncName>generic_isnan&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_isnan.h</first>
<second>generic_isnan&lt;double&gt;</second>
</first>
<second>17</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>208</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>188</item>
<item>190</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.88</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>tmp_i_60</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_isnan.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>17</lineNumber>
<contextFuncName>generic_isnan&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_isnan.h</first>
<second>generic_isnan&lt;double&gt;</second>
</first>
<second>17</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>208</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>191</item>
<item>193</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.89</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>not_demorgan</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>208</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>208</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>194</item>
<item>195</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>tmp_i1</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_isinf.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>17</lineNumber>
<contextFuncName>generic_isinf&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_isinf.h</first>
<second>generic_isinf&lt;double&gt;</second>
</first>
<second>17</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>209</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.89</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>tmp_2_i</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_isinf.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>17</lineNumber>
<contextFuncName>generic_isinf&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_isinf.h</first>
<second>generic_isinf&lt;double&gt;</second>
</first>
<second>17</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>209</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>198</item>
<item>199</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>not_Val2_i</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>210</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>210</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>200</item>
<item>202</item>
</oprand_edges>
<opcode>xor</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="_13">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>x_is_ninf</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>211</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>x_is_ninf</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>203</item>
<item>204</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>147</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp_i20_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>502</lineNumber>
<contextFuncName>expv</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>236</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>expv</second>
</first>
<second>502</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>205</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>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>m_exp</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>502</lineNumber>
<contextFuncName>expv</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>236</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>expv</second>
</first>
<second>502</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>m_exp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>207</item>
<item>208</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.63</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>p_Result_s</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>251</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>251</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>54</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>210</item>
<item>212</item>
<item>213</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>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>e_frac_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>252</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>252</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>e_frac.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>54</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>215</item>
<item>216</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.26</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>tmp_1</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>252</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>252</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>54</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>217</item>
<item>218</item>
<item>219</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.94</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>m_frac_l_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>255</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>255</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>m_frac_l.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>61</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>221</item>
<item>222</item>
<item>224</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>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>m_frac_l_V_2_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>255</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>255</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>71</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>225</item>
</oprand_edges>
<opcode>sext</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="_21">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>isNeg</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>isNeg</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>227</item>
<item>228</item>
<item>230</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>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>tmp_37</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>232</item>
<item>233</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.63</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>tmp_37_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>234</item>
</oprand_edges>
<opcode>sext</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="_24">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>m_exp_2</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>m_exp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>235</item>
<item>236</item>
<item>237</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.69</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>m_exp_1_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>238</item>
</oprand_edges>
<opcode>sext</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="_26">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp_38</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>71</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>239</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>24</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_38_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>61</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>240</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>25</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>r_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>61</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>241</item>
<item>242</item>
</oprand_edges>
<opcode>ashr</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>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>r_V_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>71</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>243</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>r_V_1</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>71</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>244</item>
<item>245</item>
</oprand_edges>
<opcode>shl</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>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>r_V_13</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>71</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>246</item>
<item>247</item>
<item>248</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>4.60</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>m_fix_l_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>m_fix_l.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>250</item>
<item>251</item>
<item>253</item>
<item>255</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>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>tmp_40</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>258</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>258</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>256</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>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>r_V_3</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>258</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>258</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>257</item>
<item>258</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>r_V_4</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>258</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>258</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>259</item>
<item>260</item>
</oprand_edges>
<opcode>ashr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>m_fix_hi_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>263</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>263</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>m_fix_hi.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>262</item>
<item>263</item>
<item>265</item>
<item>266</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>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>p_Result_27</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>268</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>268</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>268</item>
<item>269</item>
<item>270</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="_38">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>r_V_5</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>271</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>1</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>r_V_14</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>273</item>
<item>274</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.36</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>rhs_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>rhs.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>19</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>276</item>
<item>277</item>
<item>279</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>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>rhs_V_1_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>280</item>
</oprand_edges>
<opcode>sext</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="_42">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>ret_V_3</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>ret.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>281</item>
<item>282</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.02</m_delay>
<m_topoIndex>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>tmp_2</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>284</item>
<item>285</item>
<item>287</item>
<item>289</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>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>p_Result_19</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>291</item>
<item>292</item>
<item>293</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>43</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>tmp_49</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>18</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>294</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</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="_46">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>tmp_42</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>295</item>
<item>297</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.43</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>tmp_3</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>299</item>
<item>300</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.67</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>tmp_4</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>301</item>
<item>302</item>
<item>303</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>r_exp_V_3</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r_exp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>304</item>
<item>305</item>
<item>306</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.69</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>r_V_7</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>84</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>307</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>r_V_15</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>84</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>309</item>
<item>310</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>6.97</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>lhs_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>lhs.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>73</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>311</item>
</oprand_edges>
<opcode>sext</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="_53">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_5</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>71</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>313</item>
<item>314</item>
<item>316</item>
<item>318</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>54</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>rhs_V_1</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>rhs.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>72</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>320</item>
<item>321</item>
<item>323</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>56</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>rhs_V_3_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>73</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>324</item>
</oprand_edges>
<opcode>sext</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>57</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>ret_V_4</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>283</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>ret.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>73</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>325</item>
<item>326</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.74</m_delay>
<m_topoIndex>58</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>m_diff_hi_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>314</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>314</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>m_diff_hi.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>328</item>
<item>329</item>
<item>331</item>
<item>333</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>59</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>tmp_44</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>320</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>320</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>334</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>92</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>table_exp_Z1_array_1</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>320</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>320</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>335</item>
<item>337</item>
<item>338</item>
</oprand_edges>
<opcode>getelementptr</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="_60">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>exp_Z1_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>320</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>320</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>exp_Z1.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>58</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>3.25</m_delay>
<m_topoIndex>94</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>Z2_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>124</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>124</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>Z2.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>340</item>
<item>341</item>
<item>343</item>
<item>345</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>60</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>Z3_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>126</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>126</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>Z3.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>346</item>
<item>347</item>
<item>349</item>
<item>351</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>61</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>Z4_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>127</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>Z4.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>35</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>352</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>62</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>Z4_ind_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>141</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>141</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>Z4_ind.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>353</item>
<item>354</item>
<item>356</item>
<item>358</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_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="_65">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>tmp_19_i</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>142</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>359</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>64</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>table_f_Z3_array_V_s</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>142</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>360</item>
<item>361</item>
<item>362</item>
</oprand_edges>
<opcode>getelementptr</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>65</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>table_f_Z3_array_V_1</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>142</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>26</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>363</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>3.25</m_delay>
<m_topoIndex>66</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>f_Z4_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>142</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>f_Z4.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>365</item>
<item>366</item>
<item>368</item>
<item>370</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="_69">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>lhs_V_1</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>143</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>143</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>lhs.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>36</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>371</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>71</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>rhs_V_2</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>143</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>143</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>rhs.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>36</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>372</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>72</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>ret_V_5</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>143</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>143</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>ret.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>36</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>373</item>
<item>374</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>2.67</m_delay>
<m_topoIndex>73</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>tmp_20_i</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>147</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>147</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>375</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>67</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>table_f_Z3_array_V_2</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>147</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>147</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>376</item>
<item>377</item>
<item>378</item>
</oprand_edges>
<opcode>getelementptr</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="_74">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>p_Val2_21</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>147</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>147</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>26</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>379</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>3.25</m_delay>
<m_topoIndex>69</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>tmp_21_i</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>126</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>126</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>43</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>381</item>
<item>382</item>
<item>384</item>
<item>385</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>74</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>ret_V_6</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>148</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>148</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>ret.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>44</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>386</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>82</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>r_V_11_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>151</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>79</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>387</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>75</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>tmp_22_i_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>151</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>79</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>388</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>76</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>r_V_16</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>151</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>79</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>389</item>
<item>390</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.05</m_delay>
<m_topoIndex>77</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>tmp_6</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>151</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>151</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>392</item>
<item>393</item>
<item>395</item>
<item>397</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>78</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>tmp_25_i_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>158</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>36</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>398</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>83</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>tmp</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>158</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>36</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>399</item>
<item>400</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>2.71</m_delay>
<m_topoIndex>84</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>tmp_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>158</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>44</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>401</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="_84">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>exp_Z2P_m_1_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>158</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>exp_Z2P_m_1.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>44</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>402</item>
<item>403</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>2.96</m_delay>
<m_topoIndex>86</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>tmp_27_i</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>166</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>166</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>404</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>79</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>table_f_Z2_array_V_s</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>166</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>166</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>405</item>
<item>406</item>
<item>407</item>
</oprand_edges>
<opcode>getelementptr</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>80</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>p_Val2_28</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>166</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>166</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>42</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>408</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>3.25</m_delay>
<m_topoIndex>81</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>tmp_11</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>166</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>166</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>40</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>410</item>
<item>411</item>
<item>413</item>
<item>415</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>87</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>tmp_29_i</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>167</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>167</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>49</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>417</item>
<item>418</item>
<item>419</item>
<item>420</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="_90">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>r_V_13_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>170</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>170</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>93</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>421</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>89</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>tmp_30_i_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>170</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>170</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>93</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>422</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>90</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>r_V_17</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>170</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>170</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>93</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>423</item>
<item>424</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.62</m_delay>
<m_topoIndex>91</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>tmp_12</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>170</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>170</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>36</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>426</item>
<item>427</item>
<item>429</item>
<item>431</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="_94">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>lhs_V_2</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>173</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>lhs.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>51</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>433</item>
<item>434</item>
<item>435</item>
<item>436</item>
<item>438</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>96</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>lhs_V_7_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>173</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>52</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>439</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>97</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>tmp_32_i_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>173</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>44</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>440</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>98</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>tmp6</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>173</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>44</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>441</item>
<item>442</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>2.98</m_delay>
<m_topoIndex>99</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>tmp51_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>173</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>52</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>443</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>100</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>exp_Z1P_m_1_l_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>173</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>exp_Z1P_m_1_l.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>52</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>444</item>
<item>445</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>3.18</m_delay>
<m_topoIndex>101</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name>exp_Z1P_m_1_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>177</lineNumber>
<contextFuncName>exp_Z1P_m_1</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_Z1P_m_1</second>
</first>
<second>177</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>321</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>exp_Z1P_m_1.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>50</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>447</item>
<item>448</item>
<item>449</item>
<item>450</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="_101">
<Value>
<Obj>
<type>0</type>
<id>105</id>
<name>exp_Z1_hi_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>322</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>322</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>exp_Z1_hi.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>50</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>452</item>
<item>453</item>
<item>455</item>
<item>456</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>103</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name>lhs_V_3</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>lhs.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>59</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>457</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>107</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name>ret_V_7</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>ret.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>59</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>459</item>
<item>460</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>3.36</m_delay>
<m_topoIndex>108</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>108</id>
<name>r_V_11</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>100</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>461</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>104</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name>tmp_46</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>100</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>462</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>105</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_106">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>r_V_18</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>100</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>463</item>
<item>464</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.62</m_delay>
<m_topoIndex>106</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_107">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>lhs_V_4</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>lhs.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>108</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>466</item>
<item>467</item>
<item>469</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>111</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_108">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name>rhs_V_5_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>108</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>470</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>112</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_109">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name>tmp_7</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>107</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>471</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>113</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_110">
<Value>
<Obj>
<type>0</type>
<id>114</id>
<name>tmp_52</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>58</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>472</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="_111">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name>tmp_8</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>107</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>474</item>
<item>475</item>
<item>476</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="_112">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name>ret_V_8</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>ret.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>108</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>477</item>
<item>478</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>4.77</m_delay>
<m_topoIndex>115</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_113">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name>ret_V_20_cast</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>107</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>479</item>
<item>480</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>4.75</m_delay>
<m_topoIndex>116</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_114">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name>tmp_54</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>331</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>331</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>482</item>
<item>483</item>
<item>485</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>117</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_115">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name>r_exp_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>333</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>333</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r_exp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>487</item>
<item>488</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.67</m_delay>
<m_topoIndex>118</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_116">
<Value>
<Obj>
<type>0</type>
<id>120</id>
<name>r_exp_V_2</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>333</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>333</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r_exp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>489</item>
<item>490</item>
<item>491</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.69</m_delay>
<m_topoIndex>119</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_117">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name>tmp_51</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>492</item>
<item>494</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.99</m_delay>
<m_topoIndex>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_118">
<Value>
<Obj>
<type>0</type>
<id>122</id>
<name>tmp_14</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>258</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>258</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>495</item>
<item>496</item>
<item>497</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.00</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_119">
<Value>
<Obj>
<type>0</type>
<id>123</id>
<name>tmp_53</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>71</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>499</item>
<item>500</item>
<item>501</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>50</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_120">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name>tmp_55</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>502</item>
<item>503</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.59</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_121">
<Value>
<Obj>
<type>0</type>
<id>125</id>
<name>tmp_56</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>505</item>
<item>506</item>
<item>508</item>
<item>510</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>120</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_122">
<Value>
<Obj>
<type>0</type>
<id>126</id>
<name>icmp</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>511</item>
<item>513</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.13</m_delay>
<m_topoIndex>121</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_123">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name>or_cond</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>514</item>
<item>515</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>122</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_124">
<Value>
<Obj>
<type>0</type>
<id>128</id>
<name>tmp_58</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>338</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>338</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>517</item>
<item>518</item>
<item>520</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>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_125">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>rev</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>338</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>338</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>521</item>
<item>522</item>
</oprand_edges>
<opcode>xor</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>148</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_126">
<Value>
<Obj>
<type>0</type>
<id>130</id>
<name>tmp_57</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>354</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>354</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>523</item>
<item>525</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.09</m_delay>
<m_topoIndex>123</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_127">
<Value>
<Obj>
<type>0</type>
<id>131</id>
<name>tmp_9</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>363</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>363</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>52</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>527</item>
<item>528</item>
<item>530</item>
<item>532</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>124</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_128">
<Value>
<Obj>
<type>0</type>
<id>132</id>
<name>tmp_10</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>363</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>363</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>52</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>533</item>
<item>534</item>
<item>535</item>
<item>537</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>125</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_129">
<Value>
<Obj>
<type>0</type>
<id>133</id>
<name>tmp_V_4</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>332</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>332</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>52</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>538</item>
<item>539</item>
<item>540</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.00</m_delay>
<m_topoIndex>126</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_130">
<Value>
<Obj>
<type>0</type>
<id>134</id>
<name>tmp_59</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>364</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>364</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>541</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>127</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_131">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name>out_exp_V</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>364</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>364</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>out.exp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>542</item>
<item>543</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.63</m_delay>
<m_topoIndex>128</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_132">
<Value>
<Obj>
<type>0</type>
<id>136</id>
<name>p_Result_28</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>495</lineNumber>
<contextFuncName>data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>data</second>
</first>
<second>495</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>545</item>
<item>546</item>
<item>547</item>
<item>548</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>129</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_133">
<Value>
<Obj>
<type>0</type>
<id>137</id>
<name>sel_tmp1</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>208</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>208</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>549</item>
<item>550</item>
</oprand_edges>
<opcode>xor</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>130</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_134">
<Value>
<Obj>
<type>0</type>
<id>138</id>
<name>tmp12</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>210</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>210</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>551</item>
<item>552</item>
</oprand_edges>
<opcode>and</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>131</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_135">
<Value>
<Obj>
<type>0</type>
<id>139</id>
<name>sel_tmp2</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>210</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>210</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>553</item>
<item>554</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>132</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_136">
<Value>
<Obj>
<type>0</type>
<id>140</id>
<name>sel_tmp7</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>211</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>555</item>
<item>556</item>
</oprand_edges>
<opcode>and</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>149</m_topoIndex>
<m_clusterGroupNumber>7</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_137">
<Value>
<Obj>
<type>0</type>
<id>141</id>
<name>tmp_2_i_not</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>210</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>210</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>557</item>
<item>558</item>
</oprand_edges>
<opcode>xor</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>150</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_138">
<Value>
<Obj>
<type>0</type>
<id>142</id>
<name>sel_tmp</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>210</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>210</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>559</item>
<item>560</item>
</oprand_edges>
<opcode>or</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>151</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_139">
<Value>
<Obj>
<type>0</type>
<id>143</id>
<name>sel_tmp3</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>211</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>561</item>
<item>562</item>
</oprand_edges>
<opcode>xor</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>152</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_140">
<Value>
<Obj>
<type>0</type>
<id>144</id>
<name>tmp13</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>211</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>563</item>
<item>564</item>
</oprand_edges>
<opcode>and</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>153</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_141">
<Value>
<Obj>
<type>0</type>
<id>145</id>
<name>sel_tmp4</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>211</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>565</item>
<item>566</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>154</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_142">
<Value>
<Obj>
<type>0</type>
<id>146</id>
<name>sel_tmp5</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>567</item>
<item>568</item>
</oprand_edges>
<opcode>and</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>133</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_143">
<Value>
<Obj>
<type>0</type>
<id>147</id>
<name>sel_tmp6</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>569</item>
<item>570</item>
</oprand_edges>
<opcode>xor</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>134</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_144">
<Value>
<Obj>
<type>0</type>
<id>148</id>
<name>sel_tmp8</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>571</item>
<item>572</item>
</oprand_edges>
<opcode>and</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>135</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_145">
<Value>
<Obj>
<type>0</type>
<id>149</id>
<name>sel_tmp9</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>573</item>
<item>574</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>136</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_146">
<Value>
<Obj>
<type>0</type>
<id>150</id>
<name>tmp14</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>338</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>338</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>575</item>
<item>576</item>
</oprand_edges>
<opcode>and</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>155</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_147">
<Value>
<Obj>
<type>0</type>
<id>151</id>
<name>sel_tmp10</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>338</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>338</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>577</item>
<item>578</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>156</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_148">
<Value>
<Obj>
<type>0</type>
<id>152</id>
<name>tmp15</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>338</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>338</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>579</item>
<item>580</item>
</oprand_edges>
<opcode>and</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>157</m_topoIndex>
<m_clusterGroupNumber>10</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_149">
<Value>
<Obj>
<type>0</type>
<id>153</id>
<name>sel_tmp11</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>581</item>
<item>582</item>
</oprand_edges>
<opcode>xor</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>137</m_topoIndex>
<m_clusterGroupNumber>11</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_150">
<Value>
<Obj>
<type>0</type>
<id>154</id>
<name>sel_tmp12</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>583</item>
<item>584</item>
</oprand_edges>
<opcode>and</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>138</m_topoIndex>
<m_clusterGroupNumber>11</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_151">
<Value>
<Obj>
<type>0</type>
<id>155</id>
<name>sel_tmp44_demorgan</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>585</item>
<item>586</item>
</oprand_edges>
<opcode>or</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>139</m_topoIndex>
<m_clusterGroupNumber>11</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_152">
<Value>
<Obj>
<type>0</type>
<id>156</id>
<name>sel_tmp13</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>587</item>
<item>588</item>
</oprand_edges>
<opcode>xor</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>140</m_topoIndex>
<m_clusterGroupNumber>11</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_153">
<Value>
<Obj>
<type>0</type>
<id>157</id>
<name>sel_tmp14</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>337</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>337</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>589</item>
<item>590</item>
</oprand_edges>
<opcode>or</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>141</m_topoIndex>
<m_clusterGroupNumber>11</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_154">
<Value>
<Obj>
<type>0</type>
<id>158</id>
<name>tmp16</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>354</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>354</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>591</item>
<item>592</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.97</m_delay>
<m_topoIndex>142</m_topoIndex>
<m_clusterGroupNumber>11</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_155">
<Value>
<Obj>
<type>0</type>
<id>159</id>
<name>tmp_17</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>512</lineNumber>
<contextFuncName>to_double</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>593</item>
</oprand_edges>
<opcode>bitcast</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>143</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_156">
<Value>
<Obj>
<type>0</type>
<id>160</id>
<name>tmp_18</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>512</lineNumber>
<contextFuncName>to_double</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>594</item>
<item>596</item>
<item>598</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.00</m_delay>
<m_topoIndex>144</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_157">
<Value>
<Obj>
<type>0</type>
<id>161</id>
<name>tmp_19</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>512</lineNumber>
<contextFuncName>to_double</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>599</item>
<item>600</item>
</oprand_edges>
<opcode>or</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>145</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_158">
<Value>
<Obj>
<type>0</type>
<id>162</id>
<name>tmp_20</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>512</lineNumber>
<contextFuncName>to_double</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>601</item>
<item>602</item>
<item>603</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>1.48</m_delay>
<m_topoIndex>146</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_159">
<Value>
<Obj>
<type>0</type>
<id>163</id>
<name>tmp_21</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>512</lineNumber>
<contextFuncName>to_double</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>604</item>
<item>605</item>
<item>607</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.00</m_delay>
<m_topoIndex>158</m_topoIndex>
<m_clusterGroupNumber>7</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_160">
<Value>
<Obj>
<type>0</type>
<id>164</id>
<name>tmp_22</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>512</lineNumber>
<contextFuncName>to_double</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>608</item>
<item>609</item>
</oprand_edges>
<opcode>or</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>159</m_topoIndex>
<m_clusterGroupNumber>7</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_161">
<Value>
<Obj>
<type>0</type>
<id>165</id>
<name>tmp_23</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>512</lineNumber>
<contextFuncName>to_double</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>610</item>
<item>611</item>
<item>612</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>1.48</m_delay>
<m_topoIndex>160</m_topoIndex>
<m_clusterGroupNumber>7</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_162">
<Value>
<Obj>
<type>0</type>
<id>166</id>
<name>sel_tmp15</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>512</lineNumber>
<contextFuncName>to_double</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>613</item>
<item>614</item>
</oprand_edges>
<opcode>or</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>161</m_topoIndex>
<m_clusterGroupNumber>10</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_163">
<Value>
<Obj>
<type>0</type>
<id>167</id>
<name>tmp_24</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>512</lineNumber>
<contextFuncName>to_double</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>615</item>
<item>616</item>
</oprand_edges>
<opcode>and</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>162</m_topoIndex>
<m_clusterGroupNumber>10</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_164">
<Value>
<Obj>
<type>0</type>
<id>168</id>
<name>p_1</name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>512</lineNumber>
<contextFuncName>to_double</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>365</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_double</second>
</first>
<second>512</second>
</item>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first>
<second>to_ieee</second>
</first>
<second>526</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>617</item>
<item>618</item>
<item>619</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>1.48</m_delay>
<m_topoIndex>163</m_topoIndex>
<m_clusterGroupNumber>10</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_165">
<Value>
<Obj>
<type>0</type>
<id>169</id>
<name></name>
<fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</fileName>
<fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory>
<lineNumber>367</lineNumber>
<contextFuncName>exp_generic&lt;double&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_exp_.h</first>
<second>exp_generic&lt;double&gt;</second>
</first>
<second>367</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>620</item>
</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>164</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>61</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_166">
<Value>
<Obj>
<type>2</type>
<id>178</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>63</content>
</item>
<item class_id_reference="16" object_id="_167">
<Value>
<Obj>
<type>2</type>
<id>183</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>52</content>
</item>
<item class_id_reference="16" object_id="_168">
<Value>
<Obj>
<type>2</type>
<id>185</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>62</content>
</item>
<item class_id_reference="16" object_id="_169">
<Value>
<Obj>
<type>2</type>
<id>189</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>2047</content>
</item>
<item class_id_reference="16" object_id="_170">
<Value>
<Obj>
<type>2</type>
<id>192</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>52</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_171">
<Value>
<Obj>
<type>2</type>
<id>201</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_172">
<Value>
<Obj>
<type>2</type>
<id>206</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<const_type>0</const_type>
<content>3073</content>
</item>
<item class_id_reference="16" object_id="_173">
<Value>
<Obj>
<type>2</type>
<id>211</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_174">
<Value>
<Obj>
<type>2</type>
<id>214</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>54</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_175">
<Value>
<Obj>
<type>2</type>
<id>223</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>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_176">
<Value>
<Obj>
<type>2</type>
<id>229</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>11</content>
</item>
<item class_id_reference="16" object_id="_177">
<Value>
<Obj>
<type>2</type>
<id>231</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1023</content>
</item>
<item class_id_reference="16" object_id="_178">
<Value>
<Obj>
<type>2</type>
<id>252</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>7</content>
</item>
<item class_id_reference="16" object_id="_179">
<Value>
<Obj>
<type>2</type>
<id>254</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>70</content>
</item>
<item class_id_reference="16" object_id="_180">
<Value>
<Obj>
<type>2</type>
<id>264</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>55</content>
</item>
<item class_id_reference="16" object_id="_181">
<Value>
<Obj>
<type>2</type>
<id>272</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>31</bitwidth>
</Value>
<const_type>0</const_type>
<content>23637</content>
</item>
<item class_id_reference="16" object_id="_182">
<Value>
<Obj>
<type>2</type>
<id>278</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>18</bitwidth>
</Value>
<const_type>0</const_type>
<content>131072</content>
</item>
<item class_id_reference="16" object_id="_183">
<Value>
<Obj>
<type>2</type>
<id>286</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>18</content>
</item>
<item class_id_reference="16" object_id="_184">
<Value>
<Obj>
<type>2</type>
<id>288</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>30</content>
</item>
<item class_id_reference="16" object_id="_185">
<Value>
<Obj>
<type>2</type>
<id>296</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>18</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_186">
<Value>
<Obj>
<type>2</type>
<id>298</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>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_187">
<Value>
<Obj>
<type>2</type>
<id>308</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>84</bitwidth>
</Value>
<const_type>0</const_type>
<content>1636647506585939924452</content>
</item>
<item class_id_reference="16" object_id="_188">
<Value>
<Obj>
<type>2</type>
<id>315</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>13</content>
</item>
<item class_id_reference="16" object_id="_189">
<Value>
<Obj>
<type>2</type>
<id>317</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>83</content>
</item>
<item class_id_reference="16" object_id="_190">
<Value>
<Obj>
<type>2</type>
<id>322</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_191">
<Value>
<Obj>
<type>2</type>
<id>330</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>51</content>
</item>
<item class_id_reference="16" object_id="_192">
<Value>
<Obj>
<type>2</type>
<id>332</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>58</content>
</item>
<item class_id_reference="16" object_id="_193">
<Value>
<Obj>
<type>2</type>
<id>336</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_194">
<Value>
<Obj>
<type>2</type>
<id>342</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>43</content>
</item>
<item class_id_reference="16" object_id="_195">
<Value>
<Obj>
<type>2</type>
<id>344</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>50</content>
</item>
<item class_id_reference="16" object_id="_196">
<Value>
<Obj>
<type>2</type>
<id>348</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>35</content>
</item>
<item class_id_reference="16" object_id="_197">
<Value>
<Obj>
<type>2</type>
<id>350</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>42</content>
</item>
<item class_id_reference="16" object_id="_198">
<Value>
<Obj>
<type>2</type>
<id>355</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>27</content>
</item>
<item class_id_reference="16" object_id="_199">
<Value>
<Obj>
<type>2</type>
<id>357</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>34</content>
</item>
<item class_id_reference="16" object_id="_200">
<Value>
<Obj>
<type>2</type>
<id>367</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_201">
<Value>
<Obj>
<type>2</type>
<id>369</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>25</content>
</item>
<item class_id_reference="16" object_id="_202">
<Value>
<Obj>
<type>2</type>
<id>383</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_203">
<Value>
<Obj>
<type>2</type>
<id>394</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>59</content>
</item>
<item class_id_reference="16" object_id="_204">
<Value>
<Obj>
<type>2</type>
<id>396</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>78</content>
</item>
<item class_id_reference="16" object_id="_205">
<Value>
<Obj>
<type>2</type>
<id>412</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_206">
<Value>
<Obj>
<type>2</type>
<id>414</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>41</content>
</item>
<item class_id_reference="16" object_id="_207">
<Value>
<Obj>
<type>2</type>
<id>428</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>57</content>
</item>
<item class_id_reference="16" object_id="_208">
<Value>
<Obj>
<type>2</type>
<id>430</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>92</content>
</item>
<item class_id_reference="16" object_id="_209">
<Value>
<Obj>
<type>2</type>
<id>437</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_210">
<Value>
<Obj>
<type>2</type>
<id>454</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_211">
<Value>
<Obj>
<type>2</type>
<id>458</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>59</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_212">
<Value>
<Obj>
<type>2</type>
<id>468</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>49</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_213">
<Value>
<Obj>
<type>2</type>
<id>484</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>106</content>
</item>
<item class_id_reference="16" object_id="_214">
<Value>
<Obj>
<type>2</type>
<id>486</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>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>8191</content>
</item>
<item class_id_reference="16" object_id="_215">
<Value>
<Obj>
<type>2</type>
<id>493</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_216">
<Value>
<Obj>
<type>2</type>
<id>507</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>10</content>
</item>
<item class_id_reference="16" object_id="_217">
<Value>
<Obj>
<type>2</type>
<id>509</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>12</content>
</item>
<item class_id_reference="16" object_id="_218">
<Value>
<Obj>
<type>2</type>
<id>512</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_219">
<Value>
<Obj>
<type>2</type>
<id>519</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>53</content>
</item>
<item class_id_reference="16" object_id="_220">
<Value>
<Obj>
<type>2</type>
<id>524</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>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>7170</content>
</item>
<item class_id_reference="16" object_id="_221">
<Value>
<Obj>
<type>2</type>
<id>529</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>54</content>
</item>
<item class_id_reference="16" object_id="_222">
<Value>
<Obj>
<type>2</type>
<id>531</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>105</content>
</item>
<item class_id_reference="16" object_id="_223">
<Value>
<Obj>
<type>2</type>
<id>536</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>104</content>
</item>
<item class_id_reference="16" object_id="_224">
<Value>
<Obj>
<type>2</type>
<id>595</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>1</const_type>
<content>inf</content>
</item>
<item class_id_reference="16" object_id="_225">
<Value>
<Obj>
<type>2</type>
<id>597</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>1</const_type>
<content>nan</content>
</item>
<item class_id_reference="16" object_id="_226">
<Value>
<Obj>
<type>2</type>
<id>606</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>1</const_type>
<content>0</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="_227">
<Obj>
<type>3</type>
<id>170</id>
<name>exp_generic<double></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>164</count>
<item_version>0</item_version>
<item>5</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
<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>
<item>76</item>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>93</item>
<item>94</item>
<item>95</item>
<item>96</item>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</item>
<item>106</item>
<item>107</item>
<item>108</item>
<item>109</item>
<item>110</item>
<item>111</item>
<item>112</item>
<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>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
<item>134</item>
<item>135</item>
<item>136</item>
<item>137</item>
<item>138</item>
<item>139</item>
<item>140</item>
<item>141</item>
<item>142</item>
<item>143</item>
<item>144</item>
<item>145</item>
<item>146</item>
<item>147</item>
<item>148</item>
<item>149</item>
<item>150</item>
<item>151</item>
<item>152</item>
<item>153</item>
<item>154</item>
<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>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>321</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_228">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>178</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>185</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>189</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_247">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_251">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>206</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_252">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_253">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>211</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>214</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_258">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_259">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_262">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_263">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_264">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>229</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_265">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>231</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_266">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_267">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_268">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_269">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_270">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_271">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_272">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_273">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_274">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_275">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_276">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_277">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_278">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_279">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_280">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_281">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_282">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_283">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>252</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_284">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_285">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_286">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_287">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_288">
<id>259</id>
<edge_type>1</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="_289">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_290">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_291">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>264</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_292">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_293">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_294">
<id>270</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_295">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_296">
<id>273</id>
<edge_type>1</edge_type>
<source_obj>272</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_297">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_298">
<id>277</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_299">
<id>279</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_300">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_301">
<id>281</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_302">
<id>282</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_303">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_304">
<id>287</id>
<edge_type>1</edge_type>
<source_obj>286</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_305">
<id>289</id>
<edge_type>1</edge_type>
<source_obj>288</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_306">
<id>292</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_307">
<id>293</id>
<edge_type>1</edge_type>
<source_obj>288</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_308">
<id>294</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_309">
<id>295</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_310">
<id>297</id>
<edge_type>1</edge_type>
<source_obj>296</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_311">
<id>299</id>
<edge_type>1</edge_type>
<source_obj>298</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_312">
<id>300</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_313">
<id>301</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_314">
<id>302</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_315">
<id>303</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_316">
<id>304</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_317">
<id>305</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="_318">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_319">
<id>307</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="_320">
<id>309</id>
<edge_type>1</edge_type>
<source_obj>308</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_321">
<id>310</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_322">
<id>311</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_323">
<id>314</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_324">
<id>316</id>
<edge_type>1</edge_type>
<source_obj>315</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_325">
<id>318</id>
<edge_type>1</edge_type>
<source_obj>317</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_326">
<id>321</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_327">
<id>323</id>
<edge_type>1</edge_type>
<source_obj>322</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_328">
<id>324</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="_329">
<id>325</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_330">
<id>326</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_331">
<id>329</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_332">
<id>331</id>
<edge_type>1</edge_type>
<source_obj>330</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_333">
<id>333</id>
<edge_type>1</edge_type>
<source_obj>332</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_334">
<id>334</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="_335">
<id>335</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_336">
<id>337</id>
<edge_type>1</edge_type>
<source_obj>336</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_337">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_338">
<id>339</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_339">
<id>341</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_340">
<id>343</id>
<edge_type>1</edge_type>
<source_obj>342</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_341">
<id>345</id>
<edge_type>1</edge_type>
<source_obj>344</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_342">
<id>347</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_343">
<id>349</id>
<edge_type>1</edge_type>
<source_obj>348</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_344">
<id>351</id>
<edge_type>1</edge_type>
<source_obj>350</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_345">
<id>352</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_346">
<id>354</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_347">
<id>356</id>
<edge_type>1</edge_type>
<source_obj>355</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_348">
<id>358</id>
<edge_type>1</edge_type>
<source_obj>357</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_349">
<id>359</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_350">
<id>360</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_351">
<id>361</id>
<edge_type>1</edge_type>
<source_obj>336</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_352">
<id>362</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="_353">
<id>363</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="_354">
<id>366</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_355">
<id>368</id>
<edge_type>1</edge_type>
<source_obj>367</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_356">
<id>370</id>
<edge_type>1</edge_type>
<source_obj>369</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_357">
<id>371</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_358">
<id>372</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_359">
<id>373</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_360">
<id>374</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_361">
<id>375</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_362">
<id>376</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_363">
<id>377</id>
<edge_type>1</edge_type>
<source_obj>336</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_364">
<id>378</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_365">
<id>379</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="_366">
<id>382</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_367">
<id>384</id>
<edge_type>1</edge_type>
<source_obj>383</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_368">
<id>385</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_369">
<id>386</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_370">
<id>387</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_371">
<id>388</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_372">
<id>389</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_373">
<id>390</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_374">
<id>393</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_375">
<id>395</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_376">
<id>397</id>
<edge_type>1</edge_type>
<source_obj>396</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_377">
<id>398</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_378">
<id>399</id>
<edge_type>1</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="_379">
<id>400</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_380">
<id>401</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="_381">
<id>402</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_382">
<id>403</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_383">
<id>404</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_384">
<id>405</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_385">
<id>406</id>
<edge_type>1</edge_type>
<source_obj>336</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_386">
<id>407</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_387">
<id>408</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_388">
<id>411</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_389">
<id>413</id>
<edge_type>1</edge_type>
<source_obj>412</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_390">
<id>415</id>
<edge_type>1</edge_type>
<source_obj>414</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_391">
<id>418</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_392">
<id>419</id>
<edge_type>1</edge_type>
<source_obj>322</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_393">
<id>420</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="_394">
<id>421</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_395">
<id>422</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_396">
<id>423</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_397">
<id>424</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_398">
<id>427</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="_399">
<id>429</id>
<edge_type>1</edge_type>
<source_obj>428</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_400">
<id>431</id>
<edge_type>1</edge_type>
<source_obj>430</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_401">
<id>434</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_402">
<id>435</id>
<edge_type>1</edge_type>
<source_obj>322</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_403">
<id>436</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_404">
<id>438</id>
<edge_type>1</edge_type>
<source_obj>437</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_405">
<id>439</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_406">
<id>440</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_407">
<id>441</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_408">
<id>442</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_409">
<id>443</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_410">
<id>444</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="_411">
<id>445</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_412">
<id>448</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_413">
<id>449</id>
<edge_type>1</edge_type>
<source_obj>412</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_414">
<id>450</id>
<edge_type>1</edge_type>
<source_obj>330</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_415">
<id>453</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_416">
<id>455</id>
<edge_type>1</edge_type>
<source_obj>454</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_417">
<id>456</id>
<edge_type>1</edge_type>
<source_obj>428</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_418">
<id>457</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_419">
<id>459</id>
<edge_type>1</edge_type>
<source_obj>458</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_420">
<id>460</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_421">
<id>461</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_422">
<id>462</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_423">
<id>463</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_424">
<id>464</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_425">
<id>467</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_426">
<id>469</id>
<edge_type>1</edge_type>
<source_obj>468</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_427">
<id>470</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="_428">
<id>471</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_429">
<id>472</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_430">
<id>475</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_431">
<id>476</id>
<edge_type>1</edge_type>
<source_obj>468</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_432">
<id>477</id>
<edge_type>1</edge_type>
<source_obj>112</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_433">
<id>478</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_434">
<id>479</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_435">
<id>480</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_436">
<id>483</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_437">
<id>485</id>
<edge_type>1</edge_type>
<source_obj>484</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_438">
<id>487</id>
<edge_type>1</edge_type>
<source_obj>486</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_439">
<id>488</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_440">
<id>489</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="_441">
<id>490</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_442">
<id>491</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="_443">
<id>492</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_444">
<id>494</id>
<edge_type>1</edge_type>
<source_obj>493</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_445">
<id>495</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_446">
<id>496</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_447">
<id>497</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_448">
<id>500</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_449">
<id>501</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_450">
<id>502</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="_451">
<id>503</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_452">
<id>506</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_453">
<id>508</id>
<edge_type>1</edge_type>
<source_obj>507</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_454">
<id>510</id>
<edge_type>1</edge_type>
<source_obj>509</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_455">
<id>511</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_456">
<id>513</id>
<edge_type>1</edge_type>
<source_obj>512</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_457">
<id>514</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_458">
<id>515</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="_459">
<id>518</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_460">
<id>520</id>
<edge_type>1</edge_type>
<source_obj>519</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_461">
<id>521</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_462">
<id>522</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_463">
<id>523</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_464">
<id>525</id>
<edge_type>1</edge_type>
<source_obj>524</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_465">
<id>528</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_466">
<id>530</id>
<edge_type>1</edge_type>
<source_obj>529</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_467">
<id>532</id>
<edge_type>1</edge_type>
<source_obj>531</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_468">
<id>534</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_469">
<id>535</id>
<edge_type>1</edge_type>
<source_obj>519</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_470">
<id>537</id>
<edge_type>1</edge_type>
<source_obj>536</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_471">
<id>538</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_472">
<id>539</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_473">
<id>540</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_474">
<id>541</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_475">
<id>542</id>
<edge_type>1</edge_type>
<source_obj>231</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_476">
<id>543</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="_477">
<id>546</id>
<edge_type>1</edge_type>
<source_obj>322</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_478">
<id>547</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_479">
<id>548</id>
<edge_type>1</edge_type>
<source_obj>133</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_480">
<id>549</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_481">
<id>550</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_482">
<id>551</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_483">
<id>552</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_484">
<id>553</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_485">
<id>554</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_486">
<id>555</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_487">
<id>556</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_488">
<id>557</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_489">
<id>558</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_490">
<id>559</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_491">
<id>560</id>
<edge_type>1</edge_type>
<source_obj>141</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_492">
<id>561</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_493">
<id>562</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_494">
<id>563</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_495">
<id>564</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="_496">
<id>565</id>
<edge_type>1</edge_type>
<source_obj>144</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_497">
<id>566</id>
<edge_type>1</edge_type>
<source_obj>142</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_498">
<id>567</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_499">
<id>568</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_500">
<id>569</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_501">
<id>570</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_502">
<id>571</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_503">
<id>572</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_504">
<id>573</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_505">
<id>574</id>
<edge_type>1</edge_type>
<source_obj>148</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_506">
<id>575</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="_507">
<id>576</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_508">
<id>577</id>
<edge_type>1</edge_type>
<source_obj>150</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_509">
<id>578</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_510">
<id>579</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>152</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_511">
<id>580</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>152</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_512">
<id>581</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_513">
<id>582</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_514">
<id>583</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>154</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_515">
<id>584</id>
<edge_type>1</edge_type>
<source_obj>153</source_obj>
<sink_obj>154</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_516">
<id>585</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_517">
<id>586</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_518">
<id>587</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="_519">
<id>588</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>156</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_520">
<id>589</id>
<edge_type>1</edge_type>
<source_obj>154</source_obj>
<sink_obj>157</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_521">
<id>590</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="_522">
<id>591</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_523">
<id>592</id>
<edge_type>1</edge_type>
<source_obj>157</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_524">
<id>593</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_525">
<id>594</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_526">
<id>596</id>
<edge_type>1</edge_type>
<source_obj>595</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_527">
<id>598</id>
<edge_type>1</edge_type>
<source_obj>597</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_528">
<id>599</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_529">
<id>600</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_530">
<id>601</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_531">
<id>602</id>
<edge_type>1</edge_type>
<source_obj>160</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_532">
<id>603</id>
<edge_type>1</edge_type>
<source_obj>159</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_533">
<id>604</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_534">
<id>605</id>
<edge_type>1</edge_type>
<source_obj>595</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_535">
<id>607</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_536">
<id>608</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_537">
<id>609</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_538">
<id>610</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>165</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_539">
<id>611</id>
<edge_type>1</edge_type>
<source_obj>163</source_obj>
<sink_obj>165</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_540">
<id>612</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>165</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_541">
<id>613</id>
<edge_type>1</edge_type>
<source_obj>158</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_542">
<id>614</id>
<edge_type>1</edge_type>
<source_obj>152</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_543">
<id>615</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="_544">
<id>616</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>167</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_545">
<id>617</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_546">
<id>618</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_547">
<id>619</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="_548">
<id>620</id>
<edge_type>1</edge_type>
<source_obj>168</source_obj>
<sink_obj>169</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="_549">
<mId>1</mId>
<mTag>exp_generic<double></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>170</item>
</basic_blocks>
<mII>1</mII>
<mDepth>20</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>19</mMinLatency>
<mMaxLatency>19</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_550">
<states class_id="25" tracking_level="0" version="0">
<count>20</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_551">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_552">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_553">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_554">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_555">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_556">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_557">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_558">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_559">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_560">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_561">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_562">
<id>128</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_563">
<id>2</id>
<operations>
<count>22</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_564">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_565">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_566">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_567">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_568">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_569">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_570">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_571">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_572">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_573">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_574">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_575">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_576">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_577">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_578">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_579">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_580">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_581">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_582">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_583">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_584">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_585">
<id>121</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_586">
<id>3</id>
<operations>
<count>18</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_587">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_588">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_589">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_590">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_591">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_592">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_593">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_594">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_595">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_596">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_597">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_598">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_599">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_600">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_601">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_602">
<id>122</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_603">
<id>123</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_604">
<id>124</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_605">
<id>4</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_606">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_607">
<id>55</id>
<stage>5</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_608">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_609">
<id>55</id>
<stage>4</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_610">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_611">
<id>55</id>
<stage>3</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_612">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_613">
<id>55</id>
<stage>2</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_614">
<id>8</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_615">
<id>55</id>
<stage>1</stage>
<latency>5</latency>
</item>
<item class_id_reference="28" object_id="_616">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_617">
<id>9</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_618">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_619">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_620">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_621">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_622">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_623">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_624">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_625">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_626">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_627">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_628">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_629">
<id>71</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_630">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_631">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_632">
<id>78</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_633">
<id>10</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_634">
<id>71</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_635">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_636">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_637">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_638">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_639">
<id>78</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_640">
<id>11</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_641">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_642">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_643">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_644">
<id>83</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_645">
<id>12</id>
<operations>
<count>5</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_646">
<id>83</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_647">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_648">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_649">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_650">
<id>91</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_651">
<id>13</id>
<operations>
<count>7</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_652">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_653">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_654">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_655">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_656">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_657">
<id>91</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_658">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_659">
<id>14</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_660">
<id>93</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_661">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_662">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_663">
<id>96</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_664">
<id>15</id>
<operations>
<count>5</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_665">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_666">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_667">
<id>64</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_668">
<id>96</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_669">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_670">
<id>16</id>
<operations>
<count>9</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_671">
<id>64</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_672">
<id>98</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_673">
<id>99</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_674">
<id>100</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_675">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_676">
<id>102</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_677">
<id>103</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_678">
<id>104</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_679">
<id>105</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_680">
<id>17</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_681">
<id>108</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_682">
<id>109</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_683">
<id>110</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_684">
<id>18</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_685">
<id>106</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_686">
<id>107</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_687">
<id>110</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_688">
<id>114</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_689">
<id>19</id>
<operations>
<count>37</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_690">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_691">
<id>111</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_692">
<id>112</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_693">
<id>113</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_694">
<id>115</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_695">
<id>116</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_696">
<id>117</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_697">
<id>118</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_698">
<id>119</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_699">
<id>120</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_700">
<id>125</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_701">
<id>126</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_702">
<id>127</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_703">
<id>130</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_704">
<id>131</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_705">
<id>132</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_706">
<id>133</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_707">
<id>134</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_708">
<id>135</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_709">
<id>136</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_710">
<id>137</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_711">
<id>138</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_712">
<id>139</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_713">
<id>146</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_714">
<id>147</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_715">
<id>148</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_716">
<id>149</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_717">
<id>153</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_718">
<id>154</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_719">
<id>155</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_720">
<id>156</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_721">
<id>157</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_722">
<id>158</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_723">
<id>159</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_724">
<id>160</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_725">
<id>161</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_726">
<id>162</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_727">
<id>20</id>
<operations>
<count>19</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_728">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_729">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_730">
<id>129</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_731">
<id>140</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_732">
<id>141</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_733">
<id>142</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_734">
<id>143</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_735">
<id>144</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_736">
<id>145</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_737">
<id>150</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_738">
<id>151</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_739">
<id>152</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_740">
<id>163</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_741">
<id>164</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_742">
<id>165</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_743">
<id>166</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_744">
<id>167</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_745">
<id>168</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_746">
<id>169</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>19</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_747">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>-1</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_748">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_749">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_750">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_751">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_752">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_753">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_754">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_755">
<inState>9</inState>
<outState>10</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_756">
<inState>10</inState>
<outState>11</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_757">
<inState>11</inState>
<outState>12</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_758">
<inState>12</inState>
<outState>13</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_759">
<inState>13</inState>
<outState>14</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_760">
<inState>14</inState>
<outState>15</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_761">
<inState>15</inState>
<outState>16</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_762">
<inState>16</inState>
<outState>17</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_763">
<inState>17</inState>
<outState>18</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_764">
<inState>18</inState>
<outState>19</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_765">
<inState>19</inState>
<outState>20</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="35" tracking_level="0" version="0">
<count>164</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>5</first>
<second class_id="37" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>14</first>
<second>1</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>10</first>
<second>1</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>11</first>
<second>1</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>13</first>
<second>1</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>16</first>
<second>0</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>16</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>16</first>
<second>1</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>126</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>127</first>
<second>
<first>18</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>19</first>
<second>0</second>
</second>
</item>
<item>
<first>130</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>132</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>133</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>134</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>137</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>138</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>139</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>140</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>141</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>142</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>143</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>144</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>145</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>146</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>147</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>148</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>149</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>150</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>151</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>152</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>153</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>154</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>155</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>156</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>157</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>158</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>159</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>160</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>161</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>162</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>163</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>164</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>165</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>166</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>167</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>168</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>169</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="38" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>170</first>
<second class_id="40" tracking_level="0" version="0">
<first>0</first>
<second>19</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="41" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="1" version="0" object_id="_766">
<region_name>exp_generic<double></region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>170</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>20</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="43" tracking_level="0" version="0">
<count>161</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>217</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>71</item>
<item>71</item>
<item>78</item>
<item>78</item>
</second>
</item>
<item>
<first>223</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>235</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>242</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>91</item>
</second>
</item>
<item>
<first>248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>255</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>64</item>
</second>
</item>
<item>
<first>261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>265</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>273</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>293</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>307</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>313</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>321</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</second>
</item>
<item>
<first>329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>339</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>344</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>347</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>353</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>372</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>377</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>381</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>389</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>393</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>397</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>407</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>411</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>417</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>425</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>435</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>445</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>453</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</second>
</item>
<item>
<first>459</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>462</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>467</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>472</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>475</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>482</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>486</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>495</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>502</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>505</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>511</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>517</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>525</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>533</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>122</item>
</second>
</item>
<item>
<first>540</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>548</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>553</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>556</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>55</item>
<item>55</item>
<item>55</item>
<item>55</item>
<item>55</item>
</second>
</item>
<item>
<first>562</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>572</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>575</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>582</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>586</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>592</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>602</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>612</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>622</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>626</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>636</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>641</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>646</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>656</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>659</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>663</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>669</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>677</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>681</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>684</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>83</item>
<item>83</item>
</second>
</item>
<item>
<first>690</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>700</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>704</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>707</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>710</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>715</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>719</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>725</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>735</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>743</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>747</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>750</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>96</item>
<item>96</item>
</second>
</item>
<item>
<first>756</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>760</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</second>
</item>
<item>
<first>770</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</second>
</item>
<item>
<first>780</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>784</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>787</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>792</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
<item>
<first>796</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>802</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>812</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</second>
</item>
<item>
<first>822</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>825</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</second>
</item>
<item>
<first>828</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>110</item>
<item>110</item>
</second>
</item>
<item>
<first>834</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>837</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>843</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>847</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>852</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>859</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</second>
</item>
<item>
<first>862</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>865</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>872</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
<item>
<first>878</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</second>
</item>
<item>
<first>884</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</second>
</item>
<item>
<first>892</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>119</item>
</second>
</item>
<item>
<first>897</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>120</item>
</second>
</item>
<item>
<first>904</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>914</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>126</item>
</second>
</item>
<item>
<first>920</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</second>
</item>
<item>
<first>925</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</second>
</item>
<item>
<first>931</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
<item>
<first>941</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>951</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</second>
</item>
<item>
<first>959</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</second>
</item>
<item>
<first>963</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>969</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</second>
</item>
<item>
<first>979</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>137</item>
</second>
</item>
<item>
<first>984</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</second>
</item>
<item>
<first>990</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>139</item>
</second>
</item>
<item>
<first>995</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>146</item>
</second>
</item>
<item>
<first>1000</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>147</item>
</second>
</item>
<item>
<first>1005</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</second>
</item>
<item>
<first>1011</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>149</item>
</second>
</item>
<item>
<first>1017</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>153</item>
</second>
</item>
<item>
<first>1023</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</second>
</item>
<item>
<first>1028</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>155</item>
</second>
</item>
<item>
<first>1033</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>156</item>
</second>
</item>
<item>
<first>1039</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>157</item>
</second>
</item>
<item>
<first>1045</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>158</item>
</second>
</item>
<item>
<first>1051</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</second>
</item>
<item>
<first>1055</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>160</item>
</second>
</item>
<item>
<first>1063</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>161</item>
</second>
</item>
<item>
<first>1068</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</second>
</item>
<item>
<first>1076</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>1080</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>1085</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
<item>
<first>1090</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>141</item>
</second>
</item>
<item>
<first>1095</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>142</item>
</second>
</item>
<item>
<first>1100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>143</item>
</second>
</item>
<item>
<first>1106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>1111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>145</item>
</second>
</item>
<item>
<first>1117</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>150</item>
</second>
</item>
<item>
<first>1122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>151</item>
</second>
</item>
<item>
<first>1128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>152</item>
</second>
</item>
<item>
<first>1132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>163</item>
</second>
</item>
<item>
<first>1140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</second>
</item>
<item>
<first>1146</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</second>
</item>
<item>
<first>1153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>166</item>
</second>
</item>
<item>
<first>1158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>167</item>
</second>
</item>
<item>
<first>1164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>168</item>
</second>
</item>
<item>
<first>1172</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>46</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="46" tracking_level="0" version="0">
<count>153</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>Z2_V_fu_602</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>Z3_V_fu_612</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>Z4_V_fu_622</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>Z4_ind_V_fu_626</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>e_frac_V_fu_307</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>exp_Z1P_m_1_V_fu_802</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>exp_Z1P_m_1_l_V_fu_796</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>exp_Z1_hi_V_fu_812</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</second>
</item>
<item>
<first>exp_Z2P_m_1_V_fu_719</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>f_Z4_V_fu_646</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>grp_fu_1172</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>46</item>
</second>
</item>
<item>
<first>icmp_fu_914</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>126</item>
</second>
</item>
<item>
<first>isNeg_fu_364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>lhs_V_1_fu_656</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>lhs_V_2_fu_770</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</second>
</item>
<item>
<first>lhs_V_3_fu_834</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>lhs_V_4_fu_852</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>lhs_V_7_cast_fu_780</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>lhs_V_fu_572</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>m_diff_hi_V_fu_592</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>m_exp_1_cast_fu_389</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>m_exp_2_fu_381</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>m_exp_fu_347</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>m_fix_hi_V_fu_435</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>m_fix_l_V_fu_425</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>m_frac_l_V_2_cast_fu_360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>m_frac_l_V_fu_353</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>not_Val2_i_fu_847</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>not_demorgan_fu_334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>or_cond_fu_920</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</second>
</item>
<item>
<first>out_exp_V_fu_963</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>p_1_fu_1164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>168</item>
</second>
</item>
<item>
<first>p_Result_19_fu_495</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>p_Result_26_fu_265</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>p_Result_27_fu_445</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>p_Result_28_fu_969</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</second>
</item>
<item>
<first>p_Result_s_fu_299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>p_Val2_s_fu_261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>r_V_11_cast_fu_677</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>r_V_11_fu_822</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>r_V_13_cast_fu_743</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>r_V_13_fu_417</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>r_V_1_fu_411</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>r_V_3_fu_462</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>r_V_4_fu_467</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>r_V_5_fu_472</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>r_V_7_fu_553</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>r_V_cast_fu_407</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>r_V_fu_401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>r_exp_V_2_fu_897</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>120</item>
</second>
</item>
<item>
<first>r_exp_V_3_fu_525</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>r_exp_V_fu_892</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>119</item>
</second>
</item>
<item>
<first>ret_V_20_cast_fu_878</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</second>
</item>
<item>
<first>ret_V_4_fu_586</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>ret_V_5_fu_663</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>ret_V_6_fu_704</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>ret_V_7_fu_837</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>ret_V_8_fu_872</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
<item>
<first>rev_fu_1080</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>rhs_V_1_cast_fu_482</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>rhs_V_1_fu_575</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>rhs_V_2_fu_659</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>rhs_V_3_cast_fu_582</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>rhs_V_5_cast_fu_859</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</second>
</item>
<item>
<first>rhs_V_fu_475</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>sel_tmp10_fu_1122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>151</item>
</second>
</item>
<item>
<first>sel_tmp11_fu_1017</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>153</item>
</second>
</item>
<item>
<first>sel_tmp12_fu_1023</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</second>
</item>
<item>
<first>sel_tmp13_fu_1033</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>156</item>
</second>
</item>
<item>
<first>sel_tmp14_fu_1039</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>157</item>
</second>
</item>
<item>
<first>sel_tmp15_fu_1153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>166</item>
</second>
</item>
<item>
<first>sel_tmp1_fu_979</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>137</item>
</second>
</item>
<item>
<first>sel_tmp2_fu_990</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>139</item>
</second>
</item>
<item>
<first>sel_tmp3_fu_1100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>143</item>
</second>
</item>
<item>
<first>sel_tmp44_demorgan_fu_1028</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>155</item>
</second>
</item>
<item>
<first>sel_tmp4_fu_1111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>145</item>
</second>
</item>
<item>
<first>sel_tmp5_fu_995</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>146</item>
</second>
</item>
<item>
<first>sel_tmp6_fu_1000</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>147</item>
</second>
</item>
<item>
<first>sel_tmp7_fu_1085</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
<item>
<first>sel_tmp8_fu_1005</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</second>
</item>
<item>
<first>sel_tmp9_fu_1011</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>149</item>
</second>
</item>
<item>
<first>sel_tmp_fu_1095</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>142</item>
</second>
</item>
<item>
<first>table_exp_Z1_array_1_gep_fu_248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>table_f_Z2_array_V_s_gep_fu_235</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>table_f_Z3_array_V_2_gep_fu_223</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>table_f_Z3_array_V_s_gep_fu_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>tmp12_fu_984</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</second>
</item>
<item>
<first>tmp13_fu_1106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>tmp14_fu_1117</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>150</item>
</second>
</item>
<item>
<first>tmp15_fu_1128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>152</item>
</second>
</item>
<item>
<first>tmp16_fu_1045</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>158</item>
</second>
</item>
<item>
<first>tmp51_cast_fu_792</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
<item>
<first>tmp6_fu_787</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>tmp_10_fu_941</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>tmp_11_fu_725</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>tmp_12_fu_760</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</second>
</item>
<item>
<first>tmp_14_fu_533</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>122</item>
</second>
</item>
<item>
<first>tmp_17_fu_1051</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</second>
</item>
<item>
<first>tmp_18_fu_1055</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>160</item>
</second>
</item>
<item>
<first>tmp_19_fu_1063</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>161</item>
</second>
</item>
<item>
<first>tmp_19_i_fu_636</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>tmp_1_fu_313</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>tmp_20_fu_1068</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</second>
</item>
<item>
<first>tmp_20_i_fu_641</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>tmp_21_fu_1132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>163</item>
</second>
</item>
<item>
<first>tmp_21_i_fu_669</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>tmp_22_fu_1140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</second>
</item>
<item>
<first>tmp_22_i_cast_fu_681</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>tmp_23_fu_1146</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</second>
</item>
<item>
<first>tmp_24_fu_1158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>167</item>
</second>
</item>
<item>
<first>tmp_25_i_cast_fu_707</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>tmp_27_i_fu_700</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>tmp_29_i_fu_735</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>tmp_2_fu_486</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>tmp_2_i_fu_339</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>tmp_2_i_not_fu_1090</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>141</item>
</second>
</item>
<item>
<first>tmp_30_i_cast_fu_747</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>tmp_32_i_cast_fu_784</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>tmp_37_cast_fu_377</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>tmp_37_fu_372</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>tmp_38_cast_fu_397</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_38_fu_393</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>tmp_3_fu_511</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>tmp_40_fu_459</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>tmp_42_fu_505</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp_44_fu_756</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>tmp_46_fu_825</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</second>
</item>
<item>
<first>tmp_49_fu_502</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_4_fu_517</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>tmp_51_fu_453</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</second>
</item>
<item>
<first>tmp_52_fu_843</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>tmp_53_fu_540</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>tmp_54_fu_884</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</second>
</item>
<item>
<first>tmp_55_fu_548</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>tmp_56_fu_904</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>tmp_57_fu_925</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</second>
</item>
<item>
<first>tmp_58_fu_321</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</second>
</item>
<item>
<first>tmp_59_fu_959</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</second>
</item>
<item>
<first>tmp_5_fu_562</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp_6_fu_690</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>tmp_7_fu_862</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>tmp_8_fu_865</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>tmp_9_fu_931</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
<item>
<first>tmp_V_3_fu_283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>tmp_V_4_fu_951</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</second>
</item>
<item>
<first>tmp_V_fu_273</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>tmp_cast_fu_715</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>tmp_fu_710</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>tmp_i1_fu_293</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>tmp_i20_cast_fu_344</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_i_60_fu_287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>tmp_i_fu_329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>x_is_ninf_fu_1076</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>4</count>
<item_version>0</item_version>
<item>
<first>grp_fu_556</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>55</item>
<item>55</item>
<item>55</item>
<item>55</item>
<item>55</item>
</second>
</item>
<item>
<first>grp_fu_684</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>83</item>
<item>83</item>
</second>
</item>
<item>
<first>grp_fu_750</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>96</item>
<item>96</item>
</second>
</item>
<item>
<first>grp_fu_828</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>110</item>
<item>110</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>1</count>
<item_version>0</item_version>
<item>
<first>x_read_read_fu_204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="48" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first class_id="50" tracking_level="0" version="0">
<first>table_exp_Z1_array_s</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>64</item>
</second>
</item>
<item>
<first>
<first>table_f_Z2_array_V</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>91</item>
</second>
</item>
<item>
<first>
<first>table_f_Z3_array_V</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>71</item>
<item>71</item>
</second>
</item>
<item>
<first>
<first>table_f_Z3_array_V</first>
<second>1</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>78</item>
<item>78</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>51</count>
<item_version>0</item_version>
<item>
<first>1183</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>1190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>1197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>1202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>1207</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>1212</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</second>
</item>
<item>
<first>1218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>1224</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>1231</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>1236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>1241</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>1246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>1251</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>1257</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>1262</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>1267</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</second>
</item>
<item>
<first>1275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>1282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>1287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>1292</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>1297</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>1302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>1309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>1314</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>1319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>1324</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>1329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>1335</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>1340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>1345</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>1350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>1355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>1360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>1365</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>1371</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>1377</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>1382</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>1387</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>1392</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</second>
</item>
<item>
<first>1397</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>1402</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>1407</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</second>
</item>
<item>
<first>1412</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>1417</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</second>
</item>
<item>
<first>1422</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>1427</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>1433</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>1438</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>137</item>
</second>
</item>
<item>
<first>1444</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>149</item>
</second>
</item>
<item>
<first>1450</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>158</item>
</second>
</item>
<item>
<first>1455</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>51</count>
<item_version>0</item_version>
<item>
<first>Z2_V_reg_1302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>Z3_V_reg_1309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>Z4_V_reg_1314</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>exp_Z1P_m_1_V_reg_1402</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>exp_Z1_V_reg_1397</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>exp_Z1_hi_V_reg_1407</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</second>
</item>
<item>
<first>exp_Z2P_m_1_V_reg_1365</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>isNeg_reg_1236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>m_diff_hi_V_reg_1297</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>m_exp_1_cast_reg_1241</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>m_fix_hi_V_reg_1257</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>m_fix_l_V_reg_1251</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>m_frac_l_V_2_cast_reg_1231</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>not_demorgan_reg_1218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>p_Result_26_reg_1183</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>p_Result_27_reg_1262</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>p_Val2_21_reg_1335</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>r_V_11_cast_reg_1345</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>r_V_11_reg_1412</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>r_V_13_cast_reg_1377</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>r_V_13_reg_1246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>r_V_18_reg_1427</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>r_V_7_reg_1287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>r_exp_V_3_reg_1275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>ret_V_5_reg_1329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>ret_V_7_reg_1422</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>sel_tmp1_reg_1438</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>137</item>
</second>
</item>
<item>
<first>sel_tmp9_reg_1444</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>149</item>
</second>
</item>
<item>
<first>table_exp_Z1_array_1_reg_1387</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>table_f_Z2_array_V_s_reg_1360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>table_f_Z3_array_V_2_reg_1324</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>table_f_Z3_array_V_s_reg_1319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>tmp16_reg_1450</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>158</item>
</second>
</item>
<item>
<first>tmp_11_reg_1371</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>tmp_12_reg_1392</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</second>
</item>
<item>
<first>tmp_1_reg_1207</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>tmp_20_reg_1455</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</second>
</item>
<item>
<first>tmp_21_i_reg_1340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>tmp_22_i_cast_reg_1350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>tmp_2_i_reg_1224</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>tmp_30_i_cast_reg_1382</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>tmp_46_reg_1417</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</second>
</item>
<item>
<first>tmp_51_reg_1267</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</second>
</item>
<item>
<first>tmp_52_reg_1433</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>tmp_55_reg_1282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>tmp_58_reg_1212</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</second>
</item>
<item>
<first>tmp_5_reg_1292</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp_6_reg_1355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>tmp_V_reg_1190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>tmp_i1_reg_1202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>tmp_i_60_reg_1197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</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="51" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>x</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="53" 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>
|
with GNAT.Directory_Operations;
with GNATCOLL.Projects;
with GNATCOLL.VFS;
with Libadalang.Project_Provider;
with Generic_Logging;
with Lal_Adapter.Unit;
package body Lal_Adapter.Context is
-- Raises Internal_Error:
procedure Parse_Input_File
(This : in out Class;
Input_File_Name : in String)
is
Parent_Name : constant String := Module_Name;
Module_Name : constant String := Parent_Name & ".Parse_Input_File";
package Logging is new Generic_Logging (Module_Name); use Logging;
Auto : Logging.Auto_Logger; -- Logs BEGIN and END
begin
-- Parse the source file into an Analysis_Unit (tree):
This.Top_Unit := This.Lal_Context.Get_From_File (Input_File_Name);
-- Report parsing errors, if any
if This.Top_Unit.Has_Diagnostics then
Log ((1..50 => '*'));
Log ("Unit.Has_Diagnostics returned True.");
Log ("Diagnostics:");
for D of This.Top_Unit.Diagnostics loop
Log (This.Top_Unit.Format_GNU_Diagnostic (D));
end loop;
Log ("Raising External_Error");
Log ((1..50 => '*'));
raise External_Error with
"Parsing """ & Input_File_Name & """ failed.";
end if;
exception
when X : External_Error | Internal_Error | Usage_Error =>
raise;
when X: others =>
Log_Exception (X);
Log ("No handler for this exception. Raising Internal_Error");
raise Internal_Error;
end Parse_Input_File;
procedure Process_Top_Unit
(This : in out Class;
Outputs : in Output_Accesses_Record)
is
Parent_Name : constant String := Module_Name;
Module_Name : constant String := Parent_Name & ".Process_Top_Unit";
package Logging is new Generic_Logging (Module_Name); use Logging;
Auto : Logging.Auto_Logger; -- Logs BEGIN and END
begin
This.Top_Compilation_Unit :=
LAL.As_Compilation_Unit(This.Top_Unit.Root);
declare
Unit_Processor : Lal_Adapter.Unit.Class; -- Initialized
begin
Unit_Processor.Process (This.Top_Compilation_Unit, Outputs);
end;
end Process_Top_Unit;
procedure Process_Dependencies
(This : in out Class;
Outputs : in Output_Accesses_Record)
is
Parent_Name : constant String := Module_Name;
Module_Name : constant String := Parent_Name & ".Process_Dependencies";
package Logging is new Generic_Logging (Module_Name); use Logging;
Auto : Logging.Auto_Logger; -- Logs BEGIN and END
begin
declare
Dependencies : constant LAL.Compilation_Unit_Array :=
LAL.P_Unit_Dependencies (This.Top_Compilation_Unit);
begin
for Dependency of Dependencies Loop
declare
Unit_Processor : Lal_Adapter.Unit.Class; -- Initialized
begin
Unit_Processor.Process (Dependency, Outputs);
end;
end loop;
end;
end Process_Dependencies;
-- Load the project file:
procedure Load_Project_And_Setup_Context
(This : in out Class;
Project_File_Name : in String)
is
package GPR renames GNATCOLL.Projects;
package LAL_GPR renames Libadalang.Project_Provider;
use type GNATCOLL.VFS.Filesystem_String; -- For "+"
Env : GPR.Project_Environment_Access; -- Initialized
Project_File : constant GNATCOLL.VFS.Virtual_File :=
GNATCOLL.VFS.Create (+Project_File_Name);
Project : constant GPR.Project_Tree_Access := new GPR.Project_Tree;
Unit_Provider : LAL.Unit_Provider_Reference := LAL.No_Unit_Provider_Reference;
begin -- Load_Project_And_Setup_Context
GPR.Initialize (Env);
-- Use procedures in GNATCOLL.Projects to set scenario
-- variables (Change_Environment), to set the target
-- and the runtime (Set_Target_And_Runtime), etc.
Project.Load (Project_File, Env);
Unit_Provider := LAL_GPR.Create_Project_Unit_Provider
(Tree => Project,
Project => GPR.No_Project,
Env => Env);
This.Lal_Context := LAL.Create_Context
(Unit_Provider => Unit_Provider);
end Load_Project_And_Setup_Context;
------------
-- EXPORTED:
------------
procedure Process
(This : in out Class;
Input_File_Name : in String;
Project_File_Name : in String;
-- Unit_Options : in Unit.Options_Record;
Outputs : in Output_Accesses_Record)
is
Parent_Name : constant String := Module_Name;
Module_Name : constant String := Parent_Name & ".Process";
package Logging is new Generic_Logging (Module_Name); use Logging;
Auto : Logging.Auto_Logger; -- Logs BEGIN and END
begin -- Process
Log ("Project_File_Name => """ & Project_File_Name & """");
Log ("Input_File_Name => """ & Input_File_Name & """");
Outputs.Graph.Set_ID ("""" & Input_File_Name & """");
Outputs.A_Nodes.Set
(Context =>
(Name => To_Chars_Ptr (Project_File_Name),
Parameters => To_Chars_Ptr (String'("")),
Debug_Image => To_Chars_Ptr (String'(""))));
This.Load_Project_And_Setup_Context (Project_File_Name);
This.Parse_Input_File (Input_File_Name);
-- Process dependencies first, so that declarations come before
-- references? Actually, we don't know if the dependencies will be
-- traversed in dependency order themselves!
This.Process_Top_Unit (Outputs);
This.Process_Dependencies (Outputs);
exception
when X : External_Error | Internal_Error | Usage_Error =>
raise;
when X: others =>
Log_Exception (X);
Log ("No handler for this exception. Raising Internal_Error");
raise Internal_Error;
end Process;
end Lal_Adapter.Context;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2013, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.OCL.Invalid_Literal_Exps.Hash is
new AMF.Elements.Generic_Hash (OCL_Invalid_Literal_Exp, OCL_Invalid_Literal_Exp_Access);
|
with
AdaM.a_Type.enumeration_type,
gtk.Widget;
private
with
gtk.gEntry,
gtk.Box,
gtk.Label,
gtk.Button;
package aIDE.Editor.of_enumeration_type
is
type Item is new Editor.item with private;
type View is access all Item'Class;
package Forge
is
function to_Editor (the_Target : in AdaM.a_Type.enumeration_type.view) return View;
end Forge;
overriding
function top_Widget (Self : in Item) return gtk.Widget.Gtk_Widget;
private
use gtk.Button,
gtk.gEntry,
gtk.Label,
gtk.Box;
type Item is new Editor.item with
record
Target : AdaM.a_Type.enumeration_type.view;
top_Box : gtk_Box;
name_Entry : Gtk_Entry;
is_Label : Gtk_Label;
open_parenthesis_Label : Gtk_Label;
close_parenthesis_Label : Gtk_Label;
literals_Box : gtk_Box;
rid_Button : gtk_Button;
end record;
overriding
procedure freshen (Self : in out Item);
end aIDE.Editor.of_enumeration_type;
|
-- Tests LU decomposition on a real valued banded matrix.
--
-- Shows how interative refinement can clean up the mess when no
-- pivoting is used in LU decomposition. Also shows that iterative
-- refinement is ineffective if the problem is ill-conditioned.
-- (Pivoting doesn't solve the problem of ill-conditioning either.)
with Banded_LU;
With Text_IO; use Text_IO;
procedure banded_lu_demo_1 is
type Real is digits 15;
-- Create a data structure for making banded matrices.
No_Of_Off_Diagonals : constant Integer := 20; -- if 1, it's tri-diagonal
Max_Size_Of_Matrix : constant Integer := 150;
package lu is new Banded_LU (Real, Max_Size_Of_Matrix, No_Of_Off_Diagonals);
use lu;
package rio is new Float_IO(Real);
use rio;
package iio is new Integer_IO(Integer);
use iio;
type Matrix is array(Index) of Column; -- not type Banded_Matrix
Starting_Index : constant Index := Index'First + 10;
Max_Index : constant Index := Index'Last - 10;
C_band : Banded_Matrix := (others => (others => 0.0)); -- exported by LU
C_full : Matrix := (others => (others => 0.0));
C_Inverse : Matrix := (others => (others => 0.0));
No_Of_Iterations : Integer := 0;
Off_Factor : Real;
Sum, Del, Error_Off_Diag, Error_Diag, Max_Error : Real;
-----------
-- Pause --
-----------
procedure Pause (s1,s2,s3,s4,s5,s6,s7,s8,s9 : string := "") is
Continue : Character := ' ';
begin
new_line;
if S1 /= "" then put_line (S1); end if;
if S2 /= "" then put_line (S2); end if;
if S3 /= "" then put_line (S3); end if;
if S4 /= "" then put_line (S4); end if;
if S5 /= "" then put_line (S5); end if;
if S6 /= "" then put_line (S6); end if;
if S7 /= "" then put_line (S7); end if;
if S8 /= "" then put_line (S8); end if;
if S9 /= "" then put_line (S9); end if;
new_line(1);
begin
put ("Type a character to continue: ");
get_Immediate (Continue);
new_line(1);
exception
when others => null;
end;
end pause;
------------
-- Invert --
------------
-- Get Inverse of the Matrix:
procedure Invert
(M : in Banded_Matrix;
M_Inv : out Matrix;
Max_Index : in Index;
Starting_Index : in Index;
Max_Error : out Real;
No_Of_Iterations : in Integer)
is
Unit_Vector, Solution_Vector, Error, Diag_Inverse : Column;
Zero_Vector : constant Column := (others => 0.0);
M_LU : Banded_Matrix := M;
begin
Max_Error := 0.0;
LU_decompose (M_LU, Diag_Inverse, Max_Index, Starting_Index);
for I in Starting_Index..Max_Index loop
Unit_Vector := Zero_Vector;
Unit_Vector(I) := 1.0;
--Solve(Solution_Vector, Unit_Vector, M_LU, Diag_Inverse, M,
-- Max_Index, Starting_Index);
Refine_Solution
(Solution_Vector, Unit_Vector, M_LU, Diag_Inverse, M,
No_Of_Iterations, Max_Index, Starting_Index);
Error := Product (M, Solution_Vector, Max_Index, Starting_Index);
for J in Starting_Index .. Max_Index loop
Error (J) := Error(J) - Unit_Vector(J);
end loop;
for I in Starting_Index .. Max_Index loop
if Abs(Error(I)) > Max_Error then
Max_Error := Abs(Error(I));
end if;
end loop;
-- Solution vector is the I-th column of M_Inverse:
for J in Starting_Index .. Max_Index loop
M_Inv (J)(I) := Solution_Vector(J);
end loop;
end loop;
end Invert;
-------------------------------------
-- Test_Inversion_On_Banded_Matrix --
-------------------------------------
procedure Test_Inversion_On_Banded_Matrix
(Off_Factor : in Real;
No_Of_Iterations : in Integer)
is
begin
-- construct matrix.
C_band := (others => (others => 0.0));
C_full := (others => (others => 0.0));
for I in Index loop
C_band(I)(0) := 1.01010101010;
C_full(I)(I) := C_band(I)(0);
end loop;
for Diagonal in Diag_Index'First .. -1 loop
for Row in Index'First - Diagonal .. Index'Last loop
C_full(Row)(Diagonal + Row)
:= 0.033 * Real(Row) / Real(Index'Last)
+ Off_Factor / Abs Real(Diagonal);
C_band(Row)(Diagonal)
:= 0.033 * Real(Row) / Real(Index'Last)
+ Off_Factor / Abs Real(Diagonal);
end loop;
end loop;
for Diagonal in 1 .. Diag_Index'Last loop
for Row in Index'First .. Index'Last - Diagonal loop
C_full(Row)(Diagonal + Row)
:= 0.013 * Real(Row) / Real(Index'Last)
+ Off_Factor / Abs Real(Diagonal) + 0.3;
C_band(Row)(Diagonal)
:= 0.013 * Real(Row) / Real(Index'Last)
+ Off_Factor / Abs Real(Diagonal) + 0.3;
end loop;
end loop;
-- Test Matrix_Val procedure:
for Row in Index loop
for Col in Index loop
if Abs (C_full(Row)(Col) - Matrix_Val (C_band, Row, Col)) > 1.0e14 then
put_line("Some error in procedure Matrix_Val or ... ");
end if;
end loop;
end loop;
-- Construct inverse of C_band:
Invert (C_band, C_Inverse, Max_Index, Starting_Index, Max_Error, No_Of_Iterations);
pause("We just took the matrix inverse. Error estimate follows.");
new_line(2);
put ("Max Error according to Residual function is: "); put (Max_Error);
new_line;
-- Multiply Original C_band and C_Inverse as test. Get Max error:
Error_Off_Diag := 0.0;
Error_Diag := 0.0;
for I in Starting_Index..Max_Index loop
for J in Starting_Index..Max_Index loop
Sum := 0.0;
for K in Starting_Index..Max_Index loop
Sum := Sum + C_Inverse(I)(k) * C_full(k)(J);
end loop;
-- Product(I,J) := Sum;
-- The product should be the unit matrix. Calculate the error:
if I = J then
Del := Abs (Sum - 1.0);
if Del > Error_Diag then
Error_Diag := Del;
end if;
else
Del := Abs (Sum);
if Del > Error_Off_Diag then
Error_Off_Diag := Del;
end if;
end if;
end loop;
end loop;
pause
("We just took the product the inverse matrix with the original,",
"matrix and then calculated the difference between this product",
"and the unit matrix. The error is printed below.");
new_line;
put("Max error along diagonals of product: "); put(Error_Diag);
new_line;
put("Max error along off-diagonals of product: "); put(Error_Off_Diag);
new_line;
-- Multiply Original C and C_Inverse as test. Get Max error:
Error_Off_Diag := 0.0;
Error_Diag := 0.0;
for I in Starting_Index..Max_Index loop
for J in Starting_Index..Max_Index loop
Sum := 0.0;
for K in Starting_Index..Max_Index loop
Sum := Sum + C_full(I)(K) * C_Inverse(K)(J);
end loop;
-- Product(I,J) := Sum;
-- The product should be the unit matrix. Calculate the error:
if I = J then
Del := Abs (Sum - 1.0);
if Del > Error_Diag then
Error_Diag := Del;
end if;
ELSE
Del := Abs (Sum);
if Del > Error_Off_Diag then
Error_Off_Diag := Del;
end if;
end if;
end loop;
end loop;
pause
("We just took the product the original matrix with the inverse matrix,",
"and then calculated the difference between this product and",
"the unit matrix. The error is printed below.");
new_line;
put("Max error along diagonals of product: "); put(Error_Diag);
new_line;
put("Max error along off-diagonals of product: "); put(Error_Off_Diag);
new_line;
end Test_Inversion_On_Banded_Matrix;
begin
--put("Input Size Of Matrix To Invert (enter an Integer)"); new_line;
--get(IO_Max_Index);
--Max_Index := Index'First + Index (IO_Max_Index-1);
pause
("The first example demonstrates LU decomposition and inversion of",
"of a diagonally dominant matrix. The off-diagonals of the matrix",
"are all multiplied by 0.5 to make them fall off fast enough for",
"diagonal dominance (i.e. Off_Factor = 0.5). No iterative refinement",
"is done. (i.e. No_Of_Iterations = 0).");
Off_Factor := 0.5;
No_Of_Iterations := 0;
Test_Inversion_On_Banded_Matrix (Off_Factor, No_Of_Iterations);
pause
("The 2nd example demonstrates LU decomposition and inversion of",
"a non-diagonally dominant matrix. The off-diagonals of the matrix",
"are all multiplied by 10_000_000_000.0 to make them far greater in value",
"than the diagonal (i.e. Off_Factor = 1.0e10). No iterative refinement",
"is done. (i.e. No_Of_Iterations = 0). A large amount of error should",
"be evident.");
Off_Factor := 10_000_000_000.0;
No_Of_Iterations := 0;
Test_Inversion_On_Banded_Matrix (Off_Factor, No_Of_Iterations);
pause
("The 3rd example demonstrates LU decomposition and inversion of",
"a non-diagonally dominant matrix along with iterative refinement. The",
"off-diagonals of the matrix are again multiplied by 1.0e10 to make",
"them far greater in value than the diagonal.",
"Two iterations of the iterative refinement procedure are performed. ",
"(i.e. No_Of_Iterations = 2). Error should be greatly reduced.");
Off_Factor := 10_000_000_000.0;
No_Of_Iterations := 2;
Test_Inversion_On_Banded_Matrix (Off_Factor, No_Of_Iterations);
pause
("The 4rth example demonstrates LU decomposition and inversion of",
"of a non-diagonally dominant matrix which is mildly ill-conditioned.",
"The off-diagonals of the matrix are multiplied by 0.8.",
"No iterative refinement is performed. (i.e. No_Of_Iterations = 0).",
"Large error should be evident.");
Off_Factor := 0.8;
No_Of_Iterations := 0;
Test_Inversion_On_Banded_Matrix (Off_Factor, No_Of_Iterations);
pause
("The final example demonstrates LU decomposition and inversion of",
"of a mildly ill-conditioned matrix along with iterative refinement.",
"The off-diagonals of the matrix are again multiplied by 0.8.",
"Iterative refinement is performed. (i.e. No_Of_Iterations = 1).",
"No amount of iterative refinement helps much here.");
Off_Factor := 0.8;
No_Of_Iterations := 1;
Test_Inversion_On_Banded_Matrix (Off_Factor, No_Of_Iterations);
new_line(2);
put ("Choose your own values for Off_Factor and No_Of_Iterations.");
new_line(2);
put ("Input factor for scaling the off diagonals (e.g. 1.0e13):");
get(Off_Factor);
new_line;
put("Input number of iterative refinements of the solution (e.g. 4):");
get(No_Of_Iterations);
new_line;
Test_Inversion_On_Banded_Matrix (Off_Factor, No_Of_Iterations);
end;
|
-- Instantiate this package to create a sub-command parser/executor
with CLIC.Config;
generic
Main_Command_Name : String; -- Name of the main command or program
Version : String; -- Version of the program
with procedure Set_Global_Switches
(Config : in out CLIC.Subcommand.Switches_Configuration);
-- This procedure should define the global switches using the
-- Register_Switch procedures of the CLIC.Subcommand package.
with procedure Put (Str : String); -- Used to print help and usage
with procedure Put_Line (Str : String); -- Used to print help and usage
with procedure Put_Error (Str : String); -- Used to print errors
with procedure Error_Exit (Code : Integer);
-- Used to signal that the program should terminate with the give error
-- code. Typicaly use GNAT.OS_Lib.OS_Exit.
-- The procedures below are used to format the output such as usage and
-- help. Use CLIC.Subcommand.No_TTY if you don't want or need formating.
with function TTY_Chapter (Str : String) return String;
with function TTY_Description (Str : String) return String;
with function TTY_Version (Str : String) return String;
with function TTY_Underline (Str : String) return String;
with function TTY_Emph (Str : String) return String;
package CLIC.Subcommand.Instance is
procedure Register (Cmd : not null Command_Access);
-- Register a sub-command
procedure Register (Group : String; Cmd : not null Command_Access);
-- Register a sub-command in a group
procedure Register (Topic : not null Help_Topic_Access);
-- Register an help topic
procedure Set_Alias (Alias : Identifier; Replacement : AAA.Strings.Vector);
-- Define Alias such that "<Main_Command_Name> <Alias> <Extra_Args>" will
-- be replaced by "<Main_Command_Name> <Replacement> <Extra_Args>".
-- If Alias is already set, it will be silently replaced.
procedure Load_Aliases (Conf : CLIC.Config.Instance;
Root_Key : String := "alias");
-- Load aliases from the given configuration.
--
-- All the config keys in the format "<Root_Key>.<sub-key>" are
-- processed. If the value of a key is a (not null) String, <sub-key>
-- is registered as an alias for the value (parsed into a list with
-- GNAT.OS_Lib.Argument_String_To_List).
--
-- For instance when Root_Key := "alias" (default):
-- alias.test1 = "cmd arg1 arg2" # Valid: test1 -> ["cmd", "arg1", "arg2"]
-- alias.test2 = "cmd" # Valid: test2 -> ["cmd"]
-- alias.test3 = "" # Ignored
-- alias.test4.test = "cmd arg1" # Ignored
-- alias.test5 = 20 # Ignored
-- alias.test6 = ["cmd", "arg1"] # Ignored
procedure Execute
(Command_Line : AAA.Strings.Vector := AAA.Strings.Empty_Vector);
-- Parse the command line and execute a sub-command or display help/usage
-- depending on command line args.
--
-- If Command_Line is not empty it will be used instead of the actual
-- command line arguments from Ada.Command_Line.
procedure Parse_Global_Switches
(Command_Line : AAA.Strings.Vector := AAA.Strings.Empty_Vector);
-- Optional. Call this procedure before Execute to get only global switches
-- parsed. This can be useful to check the values of global switches before
-- running a sub-command or change the behavior of your program based on
-- these (e.g. verbosity, output color, etc.).
--
-- If Command_Line is not empty it will be used instead of the actual
-- command line arguments from Ada.Command_Line.
function What_Command return String;
procedure Display_Usage (Displayed_Error : Boolean := False);
procedure Display_Help (Keyword : String);
Error_No_Command : exception;
Command_Already_Defined : exception;
type Builtin_Help is new Command with private;
-- Use Register (new Builtin_Help); to provide a build-in help command
private
-- Built-in Help Command --
type Builtin_Help is new Command with null record;
overriding
function Name (This : Builtin_Help) return Identifier
is ("help");
overriding
function Switch_Parsing (This : Builtin_Help) return Switch_Parsing_Kind
is (Parse_All);
overriding
procedure Execute (This : in out Builtin_Help;
Args : AAA.Strings.Vector);
overriding
function Long_Description (This : Builtin_Help)
return AAA.Strings.Vector
is (AAA.Strings.Empty_Vector
.Append ("Shows information about commands and topics.")
.Append ("See available commands with '" &
Main_Command_Name & " help commands'")
.Append ("See available topics with '" &
Main_Command_Name & " help topics'."));
overriding
procedure Setup_Switches
(This : in out Builtin_Help;
Config : in out CLIC.Subcommand.Switches_Configuration)
is null;
overriding
function Short_Description (This : Builtin_Help) return String
is ("Shows help on the given command/topic");
overriding
function Usage_Custom_Parameters (This : Builtin_Help) return String
is ("[<command>|<topic>]");
end CLIC.Subcommand.Instance;
|
-----------------------------------------------------------------------
-- css-commands-analyze -- List command for CSS tools
-- Copyright (C) 2018, 2020 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with CSS.Analysis.Duplicates;
with CSS.Analysis.Rules.Main;
package body CSS.Commands.Analyze is
-- ------------------------------
-- Execute the command with the arguments.
-- ------------------------------
overriding
procedure Execute (Cmd : in out Command;
Name : in String;
Args : in Argument_List'Class;
Context : in out CSS.Commands.Context_Type) is
pragma Unreferenced (Cmd, Name);
begin
CSS.Commands.Load (Args, Context);
CSS.Analysis.Duplicates.Analyze (Context.Doc.Rules, Context.Err_Handler,
Context.Dup_Rules);
CSS.Analysis.Rules.Main.Analyze (Context.Doc, Context.Err_Handler);
-- Err_Handler.Iterate (Print_Message'Access);
CSS.Analysis.Classes.Analyze (Context.Doc, Context.Class_Map,
Context.Err_Handler);
end Execute;
-- ------------------------------
-- Write the help associated with the command.
-- ------------------------------
overriding
procedure Help (Cmd : in out Command;
Name : in String;
Context : in out CSS.Commands.Context_Type) is
pragma Unreferenced (Cmd, Name);
Console : constant CSS.Commands.Console_Access := Context.Console;
begin
Console.Notice (N_HELP, "analyze: analyze the CSS files");
end Help;
end CSS.Commands.Analyze;
|
-- { dg-do compile }
-- { dg-options "-fdump-tree-gimple" }
with VFA1_Pkg; use VFA1_Pkg;
procedure VFA1_4 is
Temp : Int8_t;
function F (I : Int8_t) return Int8_t is
begin
return I;
end;
function F2 return Int8_t is
begin
return Int8_t(Mixer1(1).R);
end;
procedure P3 (I : out Int8_t) is
begin
null;
end;
begin
Temp := Mixer1(1).R;
Mixer1(2).R := Temp;
Temp := Mixer2(1).R;
Mixer2(2).R := Temp;
Temp := Mixer1(1).R + Mixer2(2).R;
if Mixer1(1).R /= Mixer2(2).R then
raise Program_Error;
end if;
Temp := F(Mixer1(1).R);
Mixer2(2).R := F(Temp);
Temp := F(Mixer2(2).R);
Mixer1(1).R := F(Temp);
Temp := F2;
P3 (Mixer2(2).R);
end;
-- { dg-final { scan-tree-dump-times "atomic_load\[^\n\r\]*&vfa1_pkg__mixer1" 7 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_load\[^\n\r\]*&vfa1_pkg__mixer2" 7 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_load\[^\n\r\]*&temp" 0 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_store\[^\n\r\]*&vfa1_pkg__mixer1" 2 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_store\[^\n\r\]*&vfa1_pkg__mixer2" 3 "gimple"} }
-- { dg-final { scan-tree-dump-times "atomic_store\[^\n\r\]*&temp" 0 "gimple"} }
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . I M A G E _ U --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routines for supporting the Image attribute for
-- modular integer types, and also for conversion operations required in
-- Text_IO.Modular_IO for such types.
generic
type Uns is mod <>;
package System.Image_U is
pragma Pure;
procedure Image_Unsigned
(V : Uns;
S : in out String;
P : out Natural);
pragma Inline (Image_Unsigned);
-- Computes Uns'Image (V) and stores the result in S (1 .. P) setting
-- the resulting value of P. The caller guarantees that S is long enough to
-- hold the result, and that S'First is 1.
procedure Set_Image_Unsigned
(V : Uns;
S : in out String;
P : in out Natural);
-- Stores the image of V in S starting at S (P + 1), P is updated to point
-- to the last character stored. The value stored is identical to the value
-- of Uns'Image (V) except that no leading space is stored. The caller
-- guarantees that S is long enough to hold the result. S need not have a
-- lower bound of 1.
end System.Image_U;
|
-- with btboxShape;
with impact.d3.collision.Detector.discrete;
with impact.d3.collision.Detector.discrete.box_box;
with impact.d3.Shape.convex.internal.polyhedral.box;
package body impact.d3.collision.Algorithm.activating.box_box
is
USE_PERSISTENT_CONTACTS : constant Boolean := True;
--- Forge
--
package body Forge
is
function to_box_box_Algorithm (mf : access impact.d3.Manifold.Item;
ci : in AlgorithmConstructionInfo;
col0, col1 : access impact.d3.Object.item'Class) return Item
is
use impact.d3.collision.Algorithm.activating;
Self : Item; -- := (to_activating_Algorithm (ci, col0, col1) with others => <>);
begin
Self.define (ci, col0, col1);
if mf = null then
Self.m_manifoldPtr := Self.get_m_dispatcher.getNewManifold (col0, col1);
Self.m_ownManifold := True;
else
Self.m_manifoldPtr := mf;
Self.m_ownManifold := False;
end if;
return Self;
end to_box_box_Algorithm;
function to_box_box_Algorithm (ci : in AlgorithmConstructionInfo) return Item
is
use impact.d3.collision.Algorithm.activating;
Self : Item; -- := (to_activating_Algorithm (ci) with others => <>);
begin
Self.define (ci);
return Self;
end to_box_box_Algorithm;
end Forge;
overriding procedure destruct (Self : in out Item)
is
begin
if Self.m_ownManifold then
if Self.m_manifoldPtr /= null then
Self.get_m_dispatcher.releaseManifold (Self.m_manifoldPtr);
end if;
end if;
end destruct;
--- Attributes
--
overriding procedure processCollision (Self : in out Item; col0, col1 : access impact.d3.Object.item'Class;
dispatchInfo : in impact.d3.Dispatcher.DispatcherInfo;
resultOut : out impact.d3.collision.manifold_Result.item)
is
pragma Unreferenced (dispatchInfo);
use impact.d3.Shape.convex.internal.polyhedral,
impact.d3.collision.Detector.discrete.box_box, math.Vectors;
-- type BoxShape_view is access all impact.d3.Shape.convex.internal.polyhedral.box.Item'Class;
box0 : constant impact.d3.Shape.convex.internal.polyhedral.box.view := Box.view (col0.getCollisionShape);
box1 : constant impact.d3.Shape.convex.internal.polyhedral.box.view := Box.view (col1.getCollisionShape);
input : impact.d3.collision.Detector.discrete.ClosestPointInput;
detector : impact.d3.collision.Detector.discrete.box_box.item;
begin
if Self.m_manifoldPtr = null then
return;
end if;
-- Report a contact. internally this will be kept persistent, and contact reduction is done.
--
resultOut.setPersistentManifold (Self.m_manifoldPtr);
if not USE_PERSISTENT_CONTACTS then
Self.m_manifoldPtr.clearManifold;
end if;
input.m_maximumDistanceSquared := math.Real'Last;
input.m_transformA := col0.getWorldTransform.all;
input.m_transformB := col1.getWorldTransform.all;
detector := to_box_box_Detector (box0, box1);
detector.getClosestPoints (input, resultOut);
if USE_PERSISTENT_CONTACTS then -- refreshContactPoints is only necessary when using persistent contact points. otherwise all points are newly added
if Self.m_ownManifold then
resultOut.refreshContactPoints;
end if;
end if;
end processCollision;
overriding function calculateTimeOfImpact (Self : in Item; body0, body1 : access impact.d3.Object.item'Class;
dispatchInfo : in impact.d3.Dispatcher.DispatcherInfo;
resultOut : access impact.d3.collision.manifold_Result.item) return math.Real
is
pragma Unreferenced (Self, body0, body1, dispatchInfo, resultOut);
begin
return 1.0;
end calculateTimeOfImpact;
overriding procedure getAllContactManifolds (Self : in out Item; manifoldArray : out impact.d3.collision.Algorithm.btManifoldArray)
is
use impact.d3.collision.Algorithm;
begin
if Self.m_manifoldPtr /= null
and then Self.m_ownManifold
then
manifoldArray.append (Manifold_view (Self.m_manifoldPtr));
end if;
end getAllContactManifolds;
--- Create Functions
--
overriding function CreateCollisionAlgorithm (Self : in CreateFunc; info : in AlgorithmConstructionInfo;
body0, body1 : access impact.d3.Object.item'Class) return impact.d3.Dispatcher.Algorithm_view
is
pragma Unreferenced (Self);
new_Algorithm : constant impact.d3.collision.Algorithm.activating.box_box.view
:= new impact.d3.collision.Algorithm.activating.box_box.Item'(Forge.to_box_box_Algorithm (null, info, body0, body1));
begin
return dispatcher.Algorithm_view (new_Algorithm);
end CreateCollisionAlgorithm;
-- return new impact.d3.collision.Algorithm.activating.box_box.Item'Class' (to_box_box_Algorithm (null, info, body0, body1));
end impact.d3.collision.Algorithm.activating.box_box;
--
-- void impact.d3.collision.Algorithm.activating.box_box::processCollision (impact.d3.Object* body0,impact.d3.Object* body1,const impact.d3.DispatcherInfo& dispatchInfo,impact.d3.collision.manifold_Result* resultOut)
-- {
-- if (!m_manifoldPtr)
-- return;
--
-- impact.d3.Object* col0 = body0;
-- impact.d3.Object* col1 = body1;
-- impact.d3.Shape.convex.internal.polyhedral.box* box0 = (impact.d3.Shape.convex.internal.polyhedral.box*)col0->getCollisionShape();
-- impact.d3.Shape.convex.internal.polyhedral.box* box1 = (impact.d3.Shape.convex.internal.polyhedral.box*)col1->getCollisionShape();
--
--
--
-- /// report a contact. internally this will be kept persistent, and contact reduction is done
-- resultOut->setPersistentManifold(m_manifoldPtr);
-- #ifndef USE_PERSISTENT_CONTACTS
-- m_manifoldPtr->clearManifold();
-- #endif //USE_PERSISTENT_CONTACTS
--
-- impact.d3.collision.Detector.discrete::ClosestPointInput input;
-- input.m_maximumDistanceSquared = BT_LARGE_FLOAT;
-- input.m_transformA = body0->getWorldTransform();
-- input.m_transformB = body1->getWorldTransform();
--
-- impact.d3.collision.Detector.discrete.box_box detector(box0,box1);
-- detector.getClosestPoints(input,*resultOut,dispatchInfo.m_debugDraw);
--
-- #ifdef USE_PERSISTENT_CONTACTS
-- // refreshContactPoints is only necessary when using persistent contact points. otherwise all points are newly added
-- if (m_ownManifold)
-- {
-- resultOut->refreshContactPoints();
-- }
-- #endif //USE_PERSISTENT_CONTACTS
--
-- }
|
-- Ascon128av12
-- an instantiation of the Ascon-128a (v 1.2) variant of the Ascon Authenticated
-- Encryption Algorithm created by Christoph Dobraunig, Maria Eichlseder,
-- Florian Mendel and Martin Schläffer.
-- Copyright (c) 2018, James Humphry - see LICENSE file for details
pragma SPARK_Mode(On);
with Ascon;
package Ascon128av12 is new Ascon(a_rounds => 12,
b_rounds => 8,
b_round_constants_offset => 4,
rate => 128);
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ T E X T _ I O . F I X E D _ I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2006, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- In Ada 95, the package Ada.Wide_Text_IO.Fixed_IO is a subpackage of
-- Wide_Text_IO. In GNAT we make it a child package to avoid loading
-- the necessary code if Fixed_IO is not instantiated. See the routine
-- Rtsfind.Text_IO_Kludge for a description of how we patch up the
-- difference in semantics so that it is invisible to the Ada programmer.
private generic
type Num is delta <>;
package Ada.Wide_Text_IO.Fixed_IO is
Default_Fore : Field := Num'Fore;
Default_Aft : Field := Num'Aft;
Default_Exp : Field := 0;
procedure Get
(File : File_Type;
Item : out Num;
Width : Field := 0);
procedure Get
(Item : out Num;
Width : Field := 0);
procedure Put
(File : File_Type;
Item : Num;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp);
procedure Put
(Item : Num;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp);
procedure Get
(From : Wide_String;
Item : out Num;
Last : out Positive);
procedure Put
(To : out Wide_String;
Item : Num;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp);
end Ada.Wide_Text_IO.Fixed_IO;
|
with C.mpfr;
package MPFR.Root_FR.Inside is
pragma Preelaborate;
function Reference (X : in out MP_Float)
return not null access C.mpfr.mpfr_struct;
function Constant_Reference (X : MP_Float)
return not null access constant C.mpfr.mpfr_struct;
pragma Inline (Reference); -- renamed
pragma Inline (Constant_Reference); -- renamed
private
function Reference (X : in out MP_Float)
return not null access C.mpfr.mpfr_struct
renames Controlled.Reference;
function Constant_Reference (X : MP_Float)
return not null access constant C.mpfr.mpfr_struct
renames Controlled.Constant_Reference;
end MPFR.Root_FR.Inside;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . W I D _ C H A R --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body System.Wid_Char is
---------------------
-- Width_Character --
---------------------
function Width_Character (Lo, Hi : Character) return Natural is
W : Natural;
begin
W := 0;
for C in Lo .. Hi loop
declare
S : constant String := Character'Image (C);
begin
W := Natural'Max (W, S'Length);
end;
end loop;
return W;
end Width_Character;
end System.Wid_Char;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . I O . P U T --
-- --
-- B o d y --
-- --
-- Copyright (C) 2011-2021, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Implementation of Put (C : Character) based on System.Text_IO.
with System.Text_IO; use System.Text_IO;
separate (GNAT.IO)
procedure Put (C : Character) is
begin
if not Initialized then
Initialize;
end if;
-- GNAT.IO calls Put (ASCII.LF) for New_Line. Compensate.
if C = ASCII.LF and then Use_Cr_Lf_For_New_Line then
while not Is_Tx_Ready loop
null;
end loop;
System.Text_IO.Put (ASCII.CR);
end if;
while not Is_Tx_Ready loop
null;
end loop;
System.Text_IO.Put (C);
end Put;
|
-----------------------------------------------------------------------
-- awa -- Ada Web Application
-- Copyright (C) 2009, 2010, 2011, 2012, 2013, 2014 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.IO_Exceptions;
with ADO.Drivers;
with EL.Contexts.Default;
with Util.Files;
with Util.Log.Loggers;
with ASF.Server;
with ASF.Servlets;
with AWA.Services.Contexts;
with AWA.Components.Factory;
with AWA.Applications.Factory;
with AWA.Applications.Configs;
with AWA.Helpers.Selectors;
with AWA.Permissions.Services;
package body AWA.Applications is
use Util.Log;
Log : constant Loggers.Logger := Loggers.Create ("AWA.Applications");
-- ------------------------------
-- Initialize the application
-- ------------------------------
overriding
procedure Initialize (App : in out Application;
Conf : in ASF.Applications.Config;
Factory : in out ASF.Applications.Main.Application_Factory'Class) is
Ctx : AWA.Services.Contexts.Service_Context;
begin
Log.Info ("Initializing application");
Ctx.Set_Context (App'Unchecked_Access, null);
AWA.Applications.Factory.Set_Application (Factory, App'Unchecked_Access);
ASF.Applications.Main.Application (App).Initialize (Conf, Factory);
-- Load the application configuration before any module.
Application'Class (App).Load_Configuration (App.Get_Config (P_Config_File.P));
-- Register the application modules and load their configuration.
Application'Class (App).Initialize_Modules;
-- Load the plugin application configuration after the module are configured.
Application'Class (App).Load_Configuration (App.Get_Config (P_Plugin_Config_File.P));
end Initialize;
-- ------------------------------
-- Initialize the application configuration properties. Properties defined in <b>Conf</b>
-- are expanded by using the EL expression resolver.
-- ------------------------------
overriding
procedure Initialize_Config (App : in out Application;
Conf : in out ASF.Applications.Config) is
begin
Log.Info ("Initializing configuration");
if Conf.Get ("app.modules.dir", "") = "" then
Conf.Set ("app.modules.dir", "#{fn:composePath(app_search_dirs,'config')}");
end if;
if Conf.Get ("bundle.dir", "") = "" then
Conf.Set ("bundle.dir", "#{fn:composePath(app_search_dirs,'bundles')}");
end if;
if Conf.Get ("ado.queries.paths", "") = "" then
Conf.Set ("ado.queries.paths", "#{fn:composePath(app_search_dirs,'db')}");
end if;
ASF.Applications.Main.Application (App).Initialize_Config (Conf);
ADO.Drivers.Initialize (Conf);
App.DB_Factory.Create (Conf.Get ("database"));
App.Events.Initialize (App'Unchecked_Access);
AWA.Modules.Initialize (App.Modules, Conf);
App.Register_Class ("AWA.Helpers.Selectors.Select_List_Bean",
AWA.Helpers.Selectors.Create_Select_List_Bean'Access);
end Initialize_Config;
-- ------------------------------
-- Initialize the servlets provided by the application.
-- This procedure is called by <b>Initialize</b>.
-- It should register the application servlets.
-- ------------------------------
overriding
procedure Initialize_Servlets (App : in out Application) is
begin
Log.Info ("Initializing application servlets");
ASF.Applications.Main.Application (App).Initialize_Servlets;
end Initialize_Servlets;
-- ------------------------------
-- Initialize the filters provided by the application.
-- This procedure is called by <b>Initialize</b>.
-- It should register the application filters.
-- ------------------------------
overriding
procedure Initialize_Filters (App : in out Application) is
begin
Log.Info ("Initializing application filters");
ASF.Applications.Main.Application (App).Initialize_Filters;
end Initialize_Filters;
-- ------------------------------
-- Initialize the ASF components provided by the application.
-- This procedure is called by <b>Initialize</b>.
-- It should register the component factories used by the application.
-- ------------------------------
overriding
procedure Initialize_Components (App : in out Application) is
procedure Register_Functions is
new ASF.Applications.Main.Register_Functions (AWA.Permissions.Services.Set_Functions);
begin
Log.Info ("Initializing application components");
ASF.Applications.Main.Application (App).Initialize_Components;
App.Add_Components (AWA.Components.Factory.Definition);
Register_Functions (App);
end Initialize_Components;
-- ------------------------------
-- Read the application configuration file <b>awa.xml</b>. This is called after the servlets
-- and filters have been registered in the application but before the module registration.
-- ------------------------------
procedure Load_Configuration (App : in out Application;
Files : in String) is
procedure Load_Config (File : in String;
Done : out Boolean);
Paths : constant String := App.Get_Config (P_Module_Dir.P);
Ctx : aliased EL.Contexts.Default.Default_Context;
procedure Load_Config (File : in String;
Done : out Boolean) is
Path : constant String := Util.Files.Find_File_Path (File, Paths);
begin
Done := False;
AWA.Applications.Configs.Read_Configuration (App, Path, Ctx'Unchecked_Access);
exception
when Ada.IO_Exceptions.Name_Error =>
Log.Warn ("Application configuration file '{0}' does not exist", Path);
end Load_Config;
begin
Util.Files.Iterate_Path (Files, Load_Config'Access);
end Load_Configuration;
-- ------------------------------
-- Initialize the AWA modules provided by the application.
-- This procedure is called by <b>Initialize</b>.
-- It should register the modules used by the application.
-- ------------------------------
procedure Initialize_Modules (App : in out Application) is
begin
null;
end Initialize_Modules;
-- ------------------------------
-- Start the application. This is called by the server container when the server is started.
-- ------------------------------
overriding
procedure Start (App : in out Application) is
begin
-- Start the event service.
App.Events.Start;
-- Start the application.
ASF.Applications.Main.Application (App).Start;
end Start;
-- ------------------------------
-- Register the module in the application
-- ------------------------------
procedure Register (App : in Application_Access;
Module : access AWA.Modules.Module'Class;
Name : in String;
URI : in String := "") is
begin
App.Register (Module.all'Unchecked_Access, Name, URI);
end Register;
-- ------------------------------
-- Get the database connection for reading
-- ------------------------------
function Get_Session (App : Application)
return ADO.Sessions.Session is
begin
return App.DB_Factory.Get_Session;
end Get_Session;
-- ------------------------------
-- Get the database connection for writing
-- ------------------------------
function Get_Master_Session (App : Application)
return ADO.Sessions.Master_Session is
begin
return App.DB_Factory.Get_Master_Session;
end Get_Master_Session;
-- ------------------------------
-- Find the module with the given name
-- ------------------------------
function Find_Module (App : in Application;
Name : in String) return AWA.Modules.Module_Access is
begin
return AWA.Modules.Find_By_Name (App.Modules, Name);
end Find_Module;
-- ------------------------------
-- Register the module in the application
-- ------------------------------
procedure Register (App : in out Application;
Module : in AWA.Modules.Module_Access;
Name : in String;
URI : in String := "") is
begin
AWA.Modules.Register (App.Modules'Unchecked_Access, App'Unchecked_Access, Module, Name, URI);
end Register;
-- ------------------------------
-- Send the event in the application event queues.
-- ------------------------------
procedure Send_Event (App : in Application;
Event : in AWA.Events.Module_Event'Class) is
begin
App.Events.Send (Event);
end Send_Event;
-- ------------------------------
-- Execute the <tt>Process</tt> procedure with the event manager used by the application.
-- ------------------------------
procedure Do_Event_Manager (App : in out Application;
Process : access procedure
(Events : in out AWA.Events.Services.Event_Manager)) is
begin
Process (App.Events);
end Do_Event_Manager;
-- ------------------------------
-- Initialize the parser represented by <b>Parser</b> to recognize the configuration
-- that are specific to the plugins that have been registered so far.
-- ------------------------------
procedure Initialize_Parser (App : in out Application'Class;
Parser : in out Util.Serialize.IO.Parser'Class) is
procedure Process (Module : in out AWA.Modules.Module'Class);
procedure Process (Module : in out AWA.Modules.Module'Class) is
begin
Module.Initialize_Parser (Parser);
end Process;
begin
AWA.Modules.Iterate (App.Modules, Process'Access);
end Initialize_Parser;
-- ------------------------------
-- Get the current application from the servlet context or service context.
-- ------------------------------
function Current return Application_Access is
use type AWA.Services.Contexts.Service_Context_Access;
Ctx : constant AWA.Services.Contexts.Service_Context_Access := AWA.Services.Contexts.Current;
begin
if Ctx /= null then
return Ctx.Get_Application;
end if;
-- If there is no service context, look in the servlet current context.
declare
use type ASF.Servlets.Servlet_Registry_Access;
Ctx : constant ASF.Servlets.Servlet_Registry_Access := ASF.Server.Current;
begin
if Ctx = null then
Log.Warn ("There is no service context");
return null;
end if;
if not (Ctx.all in AWA.Applications.Application'Class) then
Log.Warn ("The servlet context is not an application");
return null;
end if;
return AWA.Applications.Application'Class (Ctx.all)'Access;
end;
end Current;
end AWA.Applications;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Formal_Type_Definitions;
package Program.Elements.Formal_Access_Types is
pragma Pure (Program.Elements.Formal_Access_Types);
type Formal_Access_Type is
limited interface
and Program.Elements.Formal_Type_Definitions.Formal_Type_Definition;
type Formal_Access_Type_Access is access all Formal_Access_Type'Class
with Storage_Size => 0;
end Program.Elements.Formal_Access_Types;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P P R I N T --
-- --
-- S p e c --
-- --
-- Copyright (C) 2008-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. 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. --
-- --
------------------------------------------------------------------------------
-- This package (pretty print) contains a routine for printing an expression
-- given its node in the syntax tree. Contrarily to the Sprint package, this
-- routine tries to obtain "pretty" output that can be used for e.g. error
-- messages.
with Types; use Types;
with Urealp; use Urealp;
package Pprint is
generic
-- ??? The generic parameters should be removed.
with function Real_Image (U : Ureal) return String;
with function String_Image (S : String_Id) return String;
with function Ident_Image (Expr : Node_Id;
Orig_Expr : Node_Id;
Expand_Type : Boolean) return String;
-- Will be called for printing N_Identifier and N_Defining_Identifier
-- nodes
-- ??? Expand_Type argument should be removed
Hide_Parameter_Blocks : Boolean := False;
-- If true, then "Parameter_Block.Field_Name.all" is
-- instead displayed as "Field_Name".
function Expression_Image
(Expr : Node_Id;
Default : String) return String;
-- Given a Node for an expression, return a String that is meaningful for
-- the programmer. If the expression comes from source, it is copied from
-- there.
-- Subexpressions outside of the maximum depth (3), the maximal number of
-- accepted nodes (24), and the maximal number of list elements (3), are
-- replaced by the default string.
end Pprint;
|
------------------------------------------------------------------------------
-- 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) $
procedure Automatons.Minimize (A : in out DFA) is
Last : constant State := Last_State (A);
Error_State : constant State := Last + 1;
Second_State : constant State := 2;
type Equive_Array is array (1 .. Error_State) of State;
Equive : Equive_Array := (others => 1);
Next_Equive : Equive_Array := (others => 1);
function Check_Equive_Class (X, Y : State) return Boolean is
use Symbols;
begin
for I in 1 .. Edges (A, X) loop
declare
Sym_X : Symbol_Set := Edge_Symbols (A, X, I);
Jump_X : constant State := Edge_Jump (A, X, I);
begin
for J in 1 .. Edges (A, Y) loop
declare
Sym_Y : Symbol_Set := Edge_Symbols (A, Y, J);
Jump_Y : constant State := Edge_Jump (A, Y, J);
begin
if Sym_X * Sym_Y then
if Equive (Jump_X) /= Equive (Jump_Y) then
return False;
else
Sym_X := Sym_X - Sym_Y;
end if;
end if;
end;
end loop;
if not Is_Empty (Sym_X)
and Equive (Jump_X) /= Equive (Error_State)
then
return False;
end if;
end;
end loop;
return True;
end Check_Equive_Class;
Current_Equive_Class : State;
Prev_Equive_Class : State := Second_State;
Eqv_State : State;
Result : DFA;
Found : Boolean;
Starting : Natural;
Max_Starting : Natural;
begin
Init_Equive_Classes :
for I in 1 .. Last loop
if Get_Token (A, I) /= Not_A_Token then
Equive (I) := Second_State;
end if;
end loop Init_Equive_Classes;
Try_Split_Equive_Classes :
loop
Current_Equive_Class := 0;
Set_Equive_Classes :
for I in 1 .. Last loop
Found := False;
Find_Existent_Class :
for J in 1 .. I - 1 loop
if Equive (I) = Equive (J)
and then Get_Token (A, I) = Get_Token (A, J)
then
Found := Check_Equive_Class (I, J)
and then Check_Equive_Class (J, I);
if Found then
Next_Equive (I) := Next_Equive (J);
exit Find_Existent_Class;
end if;
end if;
end loop Find_Existent_Class;
if not Found then
Current_Equive_Class := Current_Equive_Class + 1;
Next_Equive (I) := Current_Equive_Class;
end if;
end loop Set_Equive_Classes;
Current_Equive_Class := Current_Equive_Class + 1;
Next_Equive (Error_State) := Current_Equive_Class;
exit Try_Split_Equive_Classes
when Prev_Equive_Class = Current_Equive_Class;
Prev_Equive_Class := Current_Equive_Class;
Equive := Next_Equive;
end loop Try_Split_Equive_Classes;
-- Create_DFA
for I in 1 .. Current_Equive_Class - 1 loop
Max_Starting := 0;
for J in Equive'Range loop
if Equive (J) = I then
Starting := Get_Start (A, J);
if Max_Starting < Starting then
Max_Starting := Starting;
end if;
end if;
end loop;
Create_State (Result, Eqv_State, Start => Max_Starting);
end loop;
for I in 1 .. Last loop
for J in 1 .. Edges (A, I) loop
Add_Edge (Result,
From => Equive (I),
To => Equive (Edge_Jump (A, I, J)),
Set => Edge_Symbols (A, I, J));
end loop;
Set_Token (Result, Equive (I), Get_Token (A, I));
end loop;
Delete (A);
A := Result;
end Automatons.Minimize;
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Form_Demo.Aux --
-- --
-- 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, 1996
-- Version Control
-- $Revision: 1.9 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Terminal_Interface.Curses; use Terminal_Interface.Curses;
with Terminal_Interface.Curses.Panels; use Terminal_Interface.Curses.Panels;
with Terminal_Interface.Curses.Forms; use Terminal_Interface.Curses.Forms;
package Sample.Form_Demo.Aux is
procedure Geometry (F : in Form;
L : out Line_Count;
C : out Column_Count;
Y : out Line_Position;
X : out Column_Position);
-- Calculate the geometry for a panel beeing able to be used to display
-- the menu.
function Create (F : Form;
Title : String;
Lin : Line_Position;
Col : Column_Position) return Panel;
-- Create a panel decorated with a frame and the title at the specified
-- position. The dimension of the panel is derived from the menus layout.
procedure Destroy (F : in Form;
P : in out Panel);
-- Destroy all the windowing structures associated with this menu and
-- panel.
function Get_Request (F : Form;
P : Panel;
Handle_CRLF : Boolean := True) return Key_Code;
-- Centralized request driver for all menus in this sample. This
-- gives us a common key binding for all menus.
function Make (Top : Line_Position;
Left : Column_Position;
Text : String) return Field;
-- create a label
function Make (Height : Line_Count := 1;
Width : Column_Count;
Top : Line_Position;
Left : Column_Position;
Off_Screen : Natural := 0) return Field;
-- create a editable field
function Default_Driver (F : Form;
K : Key_Code;
P : Panel) return Boolean;
function Count_Active (F : Form) return Natural;
-- Count the number of active fields in the form
end Sample.Form_Demo.Aux;
|
-- Copyright (c) 1990 Regents of the University of California.
-- All rights reserved.
--
-- The primary authors of ayacc were David Taback and Deepak Tolani.
-- Enhancements were made by Ronald J. Schmalz.
--
-- Send requests for ayacc information to ayacc-info@ics.uci.edu
-- Send bug reports for ayacc to ayacc-bugs@ics.uci.edu
--
-- Redistribution and use in source and binary forms are permitted
-- provided that the above copyright notice and this paragraph are
-- duplicated in all such forms and that any documentation,
-- advertising materials, and other materials related to such
-- distribution and use acknowledge that the software was developed
-- by the University of California, Irvine. The name of the
-- University may not be used to endorse or promote products derived
-- from this software without specific prior written permission.
-- THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
-- IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
-- WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-- Module : parser_body.ada
-- Component of : ayacc
-- Version : 1.2
-- Date : 11/21/86 12:32:43
-- SCCS File : disk21~/rschm/hasee/sccs/ayacc/sccs/sxparser_body.ada
-- $Header: parser_body.a,v 0.1 86/04/01 15:10:24 ada Exp $
-- $Log: parser_body.a,v $
-- Revision 0.1 86/04/01 15:10:24 ada
-- This version fixes some minor bugs with empty grammars
-- and $$ expansion. It also uses vads5.1b enhancements
-- such as pragma inline.
--
--
-- Revision 0.0 86/02/19 18:40:31 ada
--
-- These files comprise the initial version of Ayacc
-- designed and implemented by David Taback and Deepak Tolani.
-- Ayacc has been compiled and tested under the Verdix Ada compiler
-- version 4.06 on a vax 11/750 running Unix 4.2BSD.
--
-- --
-- The body of the parser for the specification file --
-- --
with Text_IO; use Text_IO;
with Lexical_Analyzer; use Lexical_Analyzer;
-- with STR_Pack; use STR_Pack;
with Symbol_Table; use Symbol_Table;
with Rule_Table; use Rule_Table;
with Actions_File; use Actions_File;
with Tokens_File; use Tokens_File;
with String_Pkg;
package body Parser is
Found_Error : Boolean := False;
Start_Defined : Boolean := False;
procedure Nonfatal_Error(Message: in String) is
begin
Print_Context_Lines;
--RJS Put_Line("--- " & Message);
New_Line;
Put_Line ("Ayacc: " & Message);
Found_Error := True;
end Nonfatal_Error;
procedure Fatal_Error(Message: in String) is
begin
Print_Context_Lines;
--RJS Put_Line("--- " & Message);
New_Line;
Put_Line ("Ayacc: " & Message);
raise Syntax_Error;
end Fatal_Error;
procedure Augment_Grammar(Users_Start_Symbol : in Grammar_Symbol) is
-- Inserts S' -> S $end as a rule in the rule table.
Start_Sym : Grammar_Symbol;
Augmented_Rule : Rule;
begin
Start_Defined := True;
Augmented_Rule := Make_Rule(Start_Symbol);
Append_RHS(Augmented_Rule, Users_Start_Symbol);
Append_RHS(Augmented_Rule, End_Symbol);
end Augment_Grammar;
-- --
-- A recursive descent parser for the rules in the --
-- grammar. --
procedure Parse_Rules is
T : Ayacc_Token;
Current_Rule : Rule;
LHS : Grammar_Symbol;
-- --
-- Gets an action from the file and writes it to --
-- the actions file. --
-- --
-- --
-- Parses a sequence of Symbols --
-- --
procedure Symbols is
ID : Grammar_Symbol;
Got_Action : Boolean := False;
Precedence_Level : Precedence;
begin
loop
T := Get_Token;
exit when T = Vertical_Bar or T = Semicolon or T = Prec;
-- Do we have an action in the middle of a rule?
if Got_Action then
Got_Action := T = Left_Brace;
Handle_Nested_Rule(Current_Rule);
end if;
case T is
-- Update the current rule
when Character_Literal =>
ID := Insert_Terminal(Get_Lexeme_Text);
Append_RHS(Current_Rule, ID);
-- Update the current rule and add to symbol table
when Identifier =>
ID := Insert_Identifier(Get_Lexeme_Text);
Append_RHS(Current_Rule, ID);
-- Got an action
when Left_Brace =>
Handle_Action(Integer(Current_Rule),
Integer(Length_of(Current_Rule)));
Got_Action := True;
when others =>
Fatal_Error("Unexpected symbol");
end case;
end loop;
if T = Prec then
if Got_Action then
Fatal_Error("%prec cannot be preceded by an action");
raise Syntax_Error;
end if;
T := Get_Token;
if T /= Identifier and T /= Character_Literal then
Fatal_Error("Expecting a terminal after %prec");
end if;
ID := Insert_Identifier(Get_Lexeme_Text);
if Is_Nonterminal(ID) then
Fatal_Error("Expecting a terminal after %prec");
end if;
Precedence_Level := Get_Precedence(ID);
if Precedence_Level = 0 then
Fatal_Error("Terminal following %prec has no precedence");
else
Set_Rule_Precedence(Current_Rule, Precedence_Level);
end if;
T := Get_Token;
case T is
when Left_Brace =>
Handle_Action(Integer(Current_Rule),
Integer(Length_of(Current_Rule)));
T := Get_Token;
when Semicolon | Vertical_Bar =>
null;
when others =>
Fatal_Error("Illegal token following %prec");
end case;
end if;
end Symbols;
-- --
-- Parse an Ayacc grammar rule --
-- --
procedure Rule is
begin
T := Get_Token;
if T /= Colon then
Fatal_Error("Expecting a colon after the LHS of the rule");
else
Current_Rule := Make_Rule(LHS);
Symbols;
end if;
while (T = Vertical_Bar) loop
-- Make a new rule with the current LHS grammar symbol
Current_Rule := Make_Rule(LHS);
Symbols;
end loop;
if T /= Semicolon then
Fatal_Error("Expecting a semicolon");
end if;
end Rule;
-- --
-- Parse a sequence of grammar rules --
-- --
procedure Rules is
begin
T := Get_Token;
if T = Identifier then
-- Make the left hand side of the rule
LHS := Insert_Identifier(Get_Lexeme_Text);
if Is_Terminal(LHS) then
Fatal_Error("Terminals cannot be on the LHS of a rule");
end if;
if not Start_Defined then
Augment_Grammar(LHS);
end if;
Rule;
Rules;
elsif T /= Mark then
Fatal_Error("Expecting next section");
end if;
end Rules;
begin -- parse_rules
Actions_File.Initialize;
Rules;
Actions_File.Finish;
-- Check for empty grammars. If the grammar is empty then
-- create a rule S -> $end.
if not Start_Defined then
Append_RHS(Make_Rule(Start_Symbol), End_Symbol);
end if;
exception
when Illegal_Token =>
Fatal_Error("illegal token");
end Parse_Rules;
-- --
-- Parse the declarations section of the source --
-- --
procedure Parse_Declarations is
Precedence_Level : Precedence := 0;
Next_Token : Ayacc_Token;
ID : Grammar_Symbol;
procedure Parse_Start_Symbol is
Users_Start_Symbol : Grammar_Symbol;
begin
if Start_Defined then
Fatal_Error("The start symbol has been defined already.");
end if;
if Next_Token /= Identifier then
if Next_Token = Lexical_Analyzer.Eof_Token then
Fatal_Error("Unexpected end of file before first '%%'");
else
Fatal_Error("Expecting identifier");
end if;
end if;
Users_Start_Symbol := Insert_Identifier(Get_Lexeme_Text);
if Is_Nonterminal(Users_Start_Symbol) then
Augment_Grammar(Users_Start_Symbol);
else
Fatal_Error("Attempt to define terminal as start_symbol");
end if;
Next_Token := Get_Token;
end Parse_Start_Symbol;
procedure Parse_Token_List(Precedence_Value : in Precedence;
Associativity_Value : in Associativity) is
Temp_Sym : Grammar_Symbol;
begin
loop
if Next_Token /= Identifier and then
Next_Token /= Character_Literal then
if Next_Token = Lexical_Analyzer.Eof_Token then
Fatal_Error("Unexpected end of file before first '%%'");
else
Fatal_Error("Expecting token declaration");
end if;
end if;
Temp_Sym := Insert_Terminal(Get_Lexeme_Text,
Precedence_Value,
Associativity_Value);
Next_Token := Get_Token;
if Next_Token = Comma then
Next_Token := Get_Token;
elsif Next_Token = Semicolon then
Next_Token := Get_Token;
exit;
elsif Next_Token /= Identifier and then
Next_Token /= Character_Literal then
exit;
end if;
end loop;
exception
when Illegal_Entry =>
-- I think only trying to insert the "start symbol"
-- in a token list will cause this exception
Fatal_Error("Illegal symbol as token");
end Parse_Token_List;
procedure Parse_Package_Name_List(Context_Clause : in Ayacc_Token) is
use String_Pkg;
begin
if Tokens_Package_Header_Has_Been_Generated then
Fatal_Error ("Context Clause Specifications May Not " &
"Appear After Ada Declarations.");
else
case Context_Clause is
when With_Clause =>
Tokens_File.Write ("with ");
when Use_Clause =>
Tokens_File.Write ("use ");
when others =>
Fatal_Error ("Illegal Context Clause Specification");
end case;
loop
if Next_Token /= Identifier then
if Next_Token = Lexical_Analyzer.Eof_Token then
Fatal_Error("Unexpected end of file before first '%%'");
else
Fatal_Error("Expecting Package Name");
end if;
end if;
Tokens_File.Write (' ' & Value (Mixed (Get_Lexeme_Text)));
Next_Token := Get_Token;
if Next_Token = Comma then
Next_Token := Get_Token;
Tokens_File.Write (",");
elsif Next_Token = Semicolon then
Next_Token := Get_Token;
Tokens_File.Writeln (";");
exit;
elsif Next_Token /= Identifier then
Tokens_File.Writeln (";");
exit;
else
Tokens_File.Write (",");
end if;
end loop;
end if;
end Parse_Package_Name_List;
begin
Next_Token := Get_Token;
loop
case Next_Token is
when Start =>
Next_Token := Get_Token;
Parse_Start_Symbol;
if Next_Token = Semicolon then
Next_Token := Get_Token;
end if;
when Token =>
Next_Token := Get_Token;
Parse_Token_List(0, Undefined);
when Nonassoc =>
Next_Token := Get_Token;
Precedence_Level := Precedence_Level + 1;
Parse_Token_List(Precedence_Level, Nonassociative);
when Right =>
Next_Token := Get_Token;
Precedence_Level := Precedence_Level + 1;
Parse_Token_List(Precedence_Level, Right_Associative);
when Left =>
Next_Token := Get_Token;
Precedence_Level := Precedence_Level + 1;
Parse_Token_List(Precedence_Level, Left_Associative);
when Mark =>
exit;
when Lexical_Analyzer.Eof_Token =>
Fatal_Error("Unexpected end of file before first %%");
when Left_Brace =>
Start_Tokens_Package;
Dump_Declarations; -- to the TOKENS file.
Next_Token := Get_Token;
when With_Clause =>
Next_Token := Get_Token;
Parse_Package_Name_List (With_Clause);
when Use_Clause =>
Next_Token := Get_Token;
Parse_Package_Name_List (Use_Clause);
when others =>
Fatal_Error("Unexpected symbol");
end case;
end loop;
exception
when Illegal_Token =>
Fatal_Error("Bad symbol");
when Redefined_Precedence_Error =>
Fatal_Error("Attempt to redefine precedence");
end Parse_Declarations;
end Parser;
|
-------------------------------------------------------------------------------
-- Copyright (c) 2016 Daniel King
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to
-- deal in the Software without restriction, including without limitation the
-- rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
-- sell copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
-- IN THE SOFTWARE.
-------------------------------------------------------------------------------
-- Provides an API for controlling the four LEDs on the EVB1000 that are
-- available to the host processor (STM32F105).
--
-- The LEDs are numbered 1 .. 4 in this API, with LED 1 being the leftmost LED
-- and LED 4 being the rightmost LED.
--
-- LEDs 1 and 2 are yellow, and LEDs 3 and 4 are red in color.
package EVB1000.LED
with SPARK_Mode => On,
Abstract_State => (LEDs_State with External),
Initializes => LEDs_State
is
type LED_Number is range 1 .. 4;
type LED_Array is array (LED_Number) of Boolean;
procedure Set_LED(LED : in LED_Number;
On : in Boolean)
with Global => (In_Out => LEDs_State),
Depends => (LEDs_State => + (LED, On));
procedure Set_LEDs(LEDs : in LED_Array)
with Global => (Output => LEDs_State),
Depends => (LEDs_State => LEDs);
procedure Toggle_LED (LED : in LED_Number)
with Global => (In_Out => LEDs_State),
Depends => (LEDs_State => + LED);
end EVB1000.LED;
|
-- przykłady: pakiet, select w zasdaniu, access do zadania jako parametr wywołania
with Qsort;
with Ada.Text_Io;
use Qsort,Ada.Text_Io;
procedure Qsort_demo is
Arr1 : vector := (1,6,2,67,3);
Arr1_ptr : vector_ptr;
begin
Arr1_ptr := new vector(Arr1'range);
Put_Line(Integer'Image(Arr1'Length));
Put_Line(Integer'Image(Arr1'Length));
Put_Line(Integer'Image(Arr1_ptr'Length));
for i in Arr1'range loop
Arr1_ptr(i) := Arr1(i);
end loop;
Qsort.Sort(Arr1_ptr);
null;
end Qsort_demo;
|
package libhello is
procedure Hello_World;
end libhello;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Panels.User_Data --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control:
-- $Revision: 1.11 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Interfaces.C;
with Terminal_Interface.Curses.Aux;
use Terminal_Interface.Curses.Aux;
with Terminal_Interface.Curses.Panels;
use Terminal_Interface.Curses.Panels;
package body Terminal_Interface.Curses.Panels.User_Data is
use type Interfaces.C.int;
procedure Set_User_Data (Pan : in Panel;
Data : in User_Access)
is
function Set_Panel_Userptr (Pan : Panel;
Addr : User_Access) return C_Int;
pragma Import (C, Set_Panel_Userptr, "set_panel_userptr");
begin
if Set_Panel_Userptr (Pan, Data) = Curses_Err then
raise Panel_Exception;
end if;
end Set_User_Data;
function Get_User_Data (Pan : in Panel) return User_Access
is
function Panel_Userptr (Pan : Panel) return User_Access;
pragma Import (C, Panel_Userptr, "panel_userptr");
begin
return Panel_Userptr (Pan);
end Get_User_Data;
procedure Get_User_Data (Pan : in Panel;
Data : out User_Access)
is
begin
Data := Get_User_Data (Pan);
end Get_User_Data;
end Terminal_Interface.Curses.Panels.User_Data;
|
with
float_Math,
ada.Strings.unbounded;
package Collada
--
-- Provides a namespace and core types for the Collada package family.
--
is
-------
-- Text
--
subtype Text is ada.Strings.unbounded.unbounded_String;
function to_Text (From : in String) return Text
renames ada.Strings.unbounded.To_unbounded_String;
function to_String (From : in Text) return String
renames ada.Strings.unbounded.To_String;
type Text_array is array (Positive range <>) of Text;
-------
-- Math
--
-- Collada matrices use column vectors, so the translation vector is the 4th column.
package Math renames float_Math;
subtype Float_array is math.Vector;
subtype Int_array is math.Integers;
subtype Vector_3 is math.Vector_3;
subtype Vector_4 is math.Vector_4;
subtype Matrix_3x3 is math.Matrix_3x3;
subtype Matrix_4x4 is math.Matrix_4x4;
type Matrix_4x4_array is array (Positive range <>) of Matrix_4x4;
Identity_4x4 : constant math.Matrix_4x4;
function matrix_Count (From : in Float_array) return Natural;
function get_Matrix (From : in Float_array; Which : in Positive) return Matrix_4x4;
Error : exception;
private
Identity_4x4 : constant math.Matrix_4x4 := ((1.0, 0.0, 0.0, 0.0),
(0.0, 1.0, 0.0, 0.0),
(0.0, 0.0, 1.0, 0.0),
(0.0, 0.0, 0.0, 1.0));
end Collada;
|
-------------------------------------------------------------------------------
-- 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.
-------------------------------------------------------------------------------
with Interfaces;
with LSC.Internal.Byteorder64;
package body LSC.Internal.Pad64 is
procedure Block_Terminate
(Block : in out Types.Word64_Array_Type;
Length : in Types.Word64)
is
pragma Inline (Block_Terminate);
Temp : Types.Word64;
Index : Types.Index;
Offset : Natural;
begin
-- index of partial block
Index := Block'First + Types.Index (Length / 64);
-- bit offset within the partial block
Offset := Natural (63 - Length mod 64);
Temp := Byteorder64.Native_To_BE (Block (Index));
Temp := Temp and Interfaces.Shift_Left (not 0, Offset);
Temp := Temp or Interfaces.Shift_Left (1, Offset);
Block (Index) := Byteorder64.BE_To_Native (Temp);
if Index < Block'Last then
for I in Types.Index range (Index + 1) .. Block'Last
loop
Block (I) := 0;
pragma Loop_Invariant
((for all P in Types.Index range
Index + 1 .. I => (Block (P) = 0)) and
Index = Block'First + Types.Index (Length / 64));
end loop;
end if;
end Block_Terminate;
end LSC.Internal.Pad64;
|
-- Copyright 2016-2021 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pkg is
type Bits_Type is array (1 .. 10) of Boolean
with Pack => True;
procedure Flip (Bits : in out Bits_Type; I : Natural);
end Pkg;
|
-- Auto generated file. Don't edit
-- Read copyright and license at the end of this file
package Encodings.Maps.CP_855 is
function Decode (Char : Character) return Wide_Character;
pragma Inline (Decode);
procedure Encode
(Text : in Wide_String;
Text_Last : out Natural;
Result : out Raw_String;
Result_Last : out Natural;
Map : in Encoding := Encodings.CP_855);
procedure Decode
(Text : in Raw_String;
Text_Last : out Natural;
Result : out Wide_String;
Result_Last : out Natural;
Map : in Encoding := Encodings.CP_855);
end Encodings.Maps.CP_855;
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2017-2020, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision: 5761 $ $Date: 2017-05-20 11:06:31 +0300 (Sat, 20 May 2017) $
------------------------------------------------------------------------------
package body Web.UI.Widgets.Combo_Boxes is
------------------
-- Constructors --
------------------
package body Constructors is
-- type Combo_Box_Internal_Access is access all Abstract_Combo_Box'Class;
-- ------------
-- -- Create --
-- ------------
--
-- function Create
-- (Element :
-- not null WebAPI.HTML.Select_Elements.HTML_Select_Element_Access)
-- return not null Combo_Box_Access
-- is
-- Result : constant not null Combo_Box_Internal_Access
-- := new Combo_Box;
--
-- begin
-- Initialize (Result.all, Element);
--
-- return Combo_Box_Access (Result);
-- end Create;
--
-- ------------
-- -- Create --
-- ------------
--
-- function Create
-- (Id : League.Strings.Universal_String)
-- return not null Combo_Box_Access is
-- begin
-- return
-- Create
-- (WebAPI.HTML.Select_Elements.HTML_Select_Element_Access
-- (WebAPI.HTML.Globals.Window.Get_Document.Get_Element_By_Id
-- (Id)));
-- end Create;
----------------
-- Initialize --
----------------
procedure Initialize
(Self : in out Abstract_Combo_Box'Class;
Element : Web.HTML.Selects.HTML_Select_Element'Class) is
begin
Web.UI.Widgets.Constructors.Initialize (Self, Element);
end Initialize;
end Constructors;
------------------
-- Change_Event --
------------------
overriding procedure Change_Event (Self : in out Abstract_Combo_Box) is
begin
Self.Current_Index_Changed.Emit
(Integer (Self.Element.As_HTML_Select.Get_Selected_Index + 1));
end Change_Event;
-- -------------------
-- -- Current_Index --
-- -------------------
--
-- function Current_Index
-- (Self : in out Combo_Box'Class)
-- return League.Strings.Universal_String
-- is
-- Input : constant WebAPI.HTML.Select_Elements.HTML_Select_Element_Access
-- := WebAPI.HTML.Select_Elements.HTML_Select_Element_Access
-- (Self.Element);
--
-- begin
-- return Input.Get_Value;
-- end Current_Index;
----------------------------------
-- Current_Index_Changed_Signal --
----------------------------------
not overriding function Current_Index_Changed_Signal
(Self : in out Abstract_Combo_Box)
return not null access Web.UI.Integer_Slots.Signal'Class is
begin
return Self.Current_Index_Changed'Unchecked_Access;
end Current_Index_Changed_Signal;
-- -----------------
-- -- Input_Event --
-- -----------------
--
-- overriding procedure Input_Event (Self : in out Combo_Box) is
-- Input : constant WebAPI.HTML.Select_Elements.HTML_Select_Element_Access
-- := WebAPI.HTML.Select_Elements.HTML_Select_Element_Access
-- (Self.Element);
--
-- begin
-- Self.Current_Index_Changed.Emit (Input.Get_Value);
-- end Input_Event;
--
-- -----------------------
-- -- Set_Current_Index --
-- -----------------------
--
-- not overriding procedure Set_Current_Index
-- (Self : in out Combo_Box;
-- To : League.Strings.Universal_String)
-- is
-- use type League.Strings.Universal_String;
--
-- Input : constant WebAPI.HTML.Select_Elements.HTML_Select_Element_Access
-- := WebAPI.HTML.Select_Elements.HTML_Select_Element_Access
-- (Self.Element);
--
-- begin
-- if Input.Get_Value /= To then
-- Input.Set_Value (To);
-- Self.Current_Index_Changed.Emit (Input.Get_Value);
-- -- 'input' event is not send when value is updated programmatically.
-- end if;
-- end Set_Current_Index;
------------------
-- Set_Disabled --
------------------
overriding procedure Set_Disabled
(Self : in out Abstract_Combo_Box;
Disabled : Boolean := True)
is
Element : Web.HTML.Selects.HTML_Select_Element
:= Self.Element.As_HTML_Select;
begin
Element.Set_Disabled (Disabled);
end Set_Disabled;
end Web.UI.Widgets.Combo_Boxes;
|
-- Copyright 2017 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
local json = require("json")
name = "SecurityTrails"
type = "api"
function start()
setratelimit(1)
end
function check()
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c ~= nil and c.key ~= nil and c.key ~= "") then
return true
end
return false
end
function vertical(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == nil or c.key == "") then
return
end
local resp
local vurl = verturl(domain)
-- Check if the response data is in the graph database
if (cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(vurl, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request(ctx, {
url=vurl,
headers={
APIKEY=c.key,
['Content-Type']="application/json",
},
})
if (err ~= nil and err ~= "") then
return
end
if (cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(vurl, resp)
end
end
local j = json.decode(resp)
if (j == nil or #(j.subdomains) == 0) then
return
end
for i, sub in pairs(j.subdomains) do
sendnames(ctx, sub .. "." .. domain)
end
end
function verturl(domain)
return "https://api.securitytrails.com/v1/domain/" .. domain .. "/subdomains"
end
function sendnames(ctx, content)
local names = find(content, subdomainre)
if names == nil then
return
end
local found = {}
for i, v in pairs(names) do
if found[v] == nil then
newname(ctx, v)
found[v] = true
end
end
end
function horizontal(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == "") then
return
end
local resp
local hurl = horizonurl(domain)
-- Check if the response data is in the graph database
if (cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(hurl, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request(ctx, {
url=hurl,
headers={
APIKEY=c.key,
['Content-Type']="application/json",
},
})
if (err ~= nil and err ~= "") then
return
end
if (cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(hurl, resp)
end
end
local j = json.decode(resp)
if (j == nil or #(j.records) == 0) then
return
end
assoc = {}
for i, r in pairs(j.records) do
if r.hostname ~= "" then
table.insert(assoc, r.hostname)
end
end
for i, a in pairs(assoc) do
associated(ctx, domain, a)
end
end
function horizonurl(domain)
return "https://api.securitytrails.com/v1/domain/" .. domain .. "/associated"
end
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.