CombinedText
stringlengths 4
3.42M
|
|---|
with Ada.Unchecked_Conversion;
with Ada.Command_Line;
with Ada.Finalization;
package body GLUT is
-- finalization - free Argv strings
--
-- RK 23 - Oct - 2006, to remove the memory leak in question.
--
type Argvz is array (0 .. 500) of aliased Interfaces.C.Strings.chars_ptr;
type Arg_Type is new Ada.Finalization.Controlled with record
v : Argvz := (others => Interfaces.C.Strings.Null_Ptr);
v_Count : Natural := 0;
end record;
overriding procedure Finalize (Self : in out Arg_Type)
is
use Interfaces.C.Strings;
begin
if Self.v (0) /= Interfaces.C.Strings.Null_Ptr then
Free (Self.v (0));
end if;
for I in 1 .. Self.v_Count loop
Free (Self.v (I));
end loop;
end Finalize;
Arg : Arg_Type;
procedure Glutinit (Argcp : access Integer;
Argv : access Interfaces.C.Strings.chars_ptr);
-- pragma Import (C, Glutinit, "glutInit", "glutInit"); -- APEX
pragma Import (StdCall, Glutinit, "glutInit"); -- GNAT/OA
-- Pure Ada method, from IBM / Rational Apex support:
-- "This procedure may be a useful replacement when porting an
-- Ada program written for Gnat, which imports argc and argv like this:
-- argc : aliased integer;
-- pragma Import (C, argc, "gnat_argc");
--
-- argv : chars_ptr_ptr;
-- pragma Import (C, argv, "gnat_argv");
-- "
-- http://www - 1.ibm.com/support/docview.wss?uid=swg21125019
procedure Init is
use Ada.Command_Line;
use Interfaces.C.Strings;
Argc : aliased Integer := Argument_Count + 1;
begin
Arg.v_Count := Argument_Count;
Arg.v (0) := New_String (Command_Name);
for I in 1 .. Arg.v_Count loop
Arg.v (I) := New_String (Argument (I));
end loop;
Glutinit (Argc'Access, Arg.v (0)'Access);
end Init;
function CreateWindow (Title : String) return Integer is
Result : Integer;
C_Title : Interfaces.C.Strings.chars_ptr
:= Interfaces.C.Strings.New_String (Title);
begin
Result := CreateWindow (C_Title);
Interfaces.C.Strings.Free (C_Title);
return Result;
end CreateWindow;
procedure InitDisplayString (Name : String) is
C_Name : Interfaces.C.Strings.chars_ptr
:= Interfaces.C.Strings.New_String (Name);
begin
InitDisplayString (C_Name);
Interfaces.C.Strings.Free (C_Name);
pragma Unreferenced (C_Name);
end InitDisplayString;
procedure SetWindowTitle (Title : String) is
C_Title : Interfaces.C.Strings.chars_ptr
:= Interfaces.C.Strings.New_String (Title);
begin
SetWindowTitle (C_Title);
Interfaces.C.Strings.Free (C_Title);
pragma Unreferenced (C_Title);
end SetWindowTitle;
procedure SetIconTitle (Title : String) is
C_Title : Interfaces.C.Strings.chars_ptr
:= Interfaces.C.Strings.New_String (Title);
begin
SetIconTitle (C_Title);
Interfaces.C.Strings.Free (C_Title);
pragma Unreferenced (C_Title);
end SetIconTitle;
procedure AddMenuEntry (Label : String; Value : Integer) is
C_Label : Interfaces.C.Strings.chars_ptr
:= Interfaces.C.Strings.New_String (Label);
begin
AddMenuEntry (C_Label, Value);
Interfaces.C.Strings.Free (C_Label);
pragma Unreferenced (C_Label);
end AddMenuEntry;
procedure AddSubMenu (Label : String; Submenu : Integer) is
C_Label : Interfaces.C.Strings.chars_ptr
:= Interfaces.C.Strings.New_String (Label);
begin
AddSubMenu (C_Label, Submenu);
Interfaces.C.Strings.Free (C_Label);
pragma Unreferenced (C_Label);
end AddSubMenu;
procedure ChangeToMenuEntry
(Item : Integer;
Label : String;
Value : Integer)
is
C_Label : Interfaces.C.Strings.chars_ptr
:= Interfaces.C.Strings.New_String (Label);
begin
ChangeToMenuEntry (Item, C_Label, Value);
Interfaces.C.Strings.Free (C_Label);
pragma Unreferenced (C_Label);
end ChangeToMenuEntry;
procedure ChangeToSubMenu
(Item : Integer;
Label : String;
Submenu : Integer)
is
C_Label : Interfaces.C.Strings.chars_ptr
:= Interfaces.C.Strings.New_String (Label);
begin
ChangeToSubMenu (Item, C_Label, Submenu);
Interfaces.C.Strings.Free (C_Label);
pragma Unreferenced (C_Label);
end ChangeToSubMenu;
function ExtensionSupported (Name : String) return Integer is
Result : Integer;
C_Name : Interfaces.C.Strings.chars_ptr
:= Interfaces.C.Strings.New_String (Name);
begin
Result := ExtensionSupported (C_Name);
Interfaces.C.Strings.Free (C_Name);
return Result;
end ExtensionSupported;
-----------------------------------------------------
-- GdM 2005 : callbacks with the 'Address attribute --
-----------------------------------------------------
-- This method is functionally identical as GNAT's Unrestricted_Access
-- but has no type safety (cf GNAT Docs)
function CreateMenu (P1 : System.Address) return Integer is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_Proc_1);
begin
return CreateMenu (Cvt (P1));
end CreateMenu;
procedure DisplayFunc (P1 : System.Address) is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_Proc_2);
begin
DisplayFunc (Cvt (P1));
end DisplayFunc;
procedure ReshapeFunc (P1 : System.Address) is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_Proc_3);
begin
ReshapeFunc (Cvt (P1));
end ReshapeFunc;
procedure KeyboardFunc (P1 : System.Address) is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_Proc_4);
begin
KeyboardFunc (Cvt (P1));
end KeyboardFunc;
procedure KeyboardUpFunc (P1 : System.Address) is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_KeyUpFunc);
begin
KeyboardUpFunc (Cvt (P1));
end KeyboardUpFunc;
procedure MouseFunc (P1 : System.Address) is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_Proc_5);
begin
MouseFunc (Cvt (P1));
end MouseFunc;
procedure MotionFunc (P1 : System.Address) is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_Proc_6);
begin
MotionFunc (Cvt (P1));
end MotionFunc;
procedure PassiveMotionFunc (P1 : System.Address) is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_Proc_7);
begin
PassiveMotionFunc (Cvt (P1));
end PassiveMotionFunc;
procedure IdleFunc (P1 : System.Address) is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_Proc_10);
begin
IdleFunc (Cvt (P1));
end IdleFunc;
procedure SpecialFunc (P1 : System.Address) is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_Proc_13);
begin
SpecialFunc (Cvt (P1));
end SpecialFunc;
procedure SpecialUpFunc (Func : System.Address) is
function Cvt is new Ada.Unchecked_Conversion (System.Address, Glut_SpecialUp);
begin
SpecialUpFunc (Cvt (Func));
end SpecialUpFunc;
end GLUT;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.Standard_Profile_L2.Traces.Hash is
new AMF.Elements.Generic_Hash (Standard_Profile_L2_Trace, Standard_Profile_L2_Trace_Access);
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . F L O A T _ C O N T R O L --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-2011, 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. --
-- --
------------------------------------------------------------------------------
-- Control functions for floating-point unit
package System.Float_Control is
pragma Pure;
-- This is not fully correct, but this unit is with-ed by pure units
-- (eg s-imgrea).
procedure Reset;
pragma Inline (Reset);
-- Reset the floating-point processor to the default state needed to get
-- correct Ada semantics for the target. Some third party tools change
-- the settings for the floating-point processor. Reset can be called
-- to reset the floating-point processor into the mode required by GNAT
-- for correct operation. Use this call after a call to foreign code if
-- you suspect incorrect floating-point operation after the call.
--
-- For example under Windows NT some system DLL calls change the default
-- FPU arithmetic to 64 bit precision mode. However, since in Ada 95 it
-- is required to provide full access to the floating-point types of the
-- architecture, GNAT requires full 80-bit precision mode, and Reset makes
-- sure this mode is established.
--
-- Similarly on the PPC processor, it is important that overflow and
-- underflow exceptions be disabled.
--
-- The call to Reset simply has no effect if the target environment
-- does not give rise to such concerns.
end System.Float_Control;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . O S _ C O N S T A N T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-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 ("M32766");
-- Allow long lines
-- This package provides target dependent definitions of constant for use
-- by the GNAT runtime library. This package should not be directly with'd
-- by an application program.
-- This file is generated automatically, do not modify it by hand! Instead,
-- make changes to s-oscons-tmplt.c and rebuild the GNAT runtime library.
-- This is the version for i686-pc-mingw32
with Interfaces.C;
package System.OS_Constants is
pragma Pure;
---------------------------------
-- General platform parameters --
---------------------------------
type OS_Type is (Windows, Other_OS);
Target_OS : constant OS_Type := Windows;
pragma Warnings (Off, Target_OS);
-- Suppress warnings on Target_OS since it is in general tested for
-- equality with a constant value to implement conditional compilation,
-- which normally generates a constant condition warning.
Target_Name : constant String := "i686-pc-mingw32";
SIZEOF_unsigned_int : constant := 4; -- Size of unsigned int
-------------------
-- System limits --
-------------------
IOV_MAX : constant := 2147483647; -- Maximum writev iovcnt
NAME_MAX : constant := 260; -- Maximum file name length
---------------------
-- File open modes --
---------------------
O_RDWR : constant := 2; -- Read/write
O_NOCTTY : constant := -1; -- Don't change ctrl tty
O_NDELAY : constant := -1; -- Nonblocking
----------------------
-- Fcntl operations --
----------------------
F_GETFL : constant := -1; -- Get flags
F_SETFL : constant := -1; -- Set flags
-----------------
-- Fcntl flags --
-----------------
FNDELAY : constant := -1; -- Nonblocking
----------------------
-- Ioctl operations --
----------------------
subtype IOCTL_Req_T is Interfaces.C.int;
FIONBIO : constant := -2147195266; -- Set/clear non-blocking io
FIONREAD : constant := 1074030207; -- How many bytes to read
------------------
-- Errno values --
------------------
-- The following constants are defined from <errno.h>
EAGAIN : constant := 11; -- Try again
ENOENT : constant := 2; -- File not found
ENOMEM : constant := 12; -- Out of memory
-- The following constants are defined from <winsock2.h> (WSA*)
EACCES : constant := 13; -- Permission denied
EADDRINUSE : constant := 10048; -- Address already in use
EADDRNOTAVAIL : constant := 10049; -- Cannot assign address
EAFNOSUPPORT : constant := 10047; -- Addr family not supported
EALREADY : constant := 10037; -- Operation in progress
EBADF : constant := 9; -- Bad file descriptor
ECONNABORTED : constant := 10053; -- Connection aborted
ECONNREFUSED : constant := 10061; -- Connection refused
ECONNRESET : constant := 10054; -- Connection reset by peer
EDESTADDRREQ : constant := 10039; -- Destination addr required
EFAULT : constant := 14; -- Bad address
EHOSTDOWN : constant := 10064; -- Host is down
EHOSTUNREACH : constant := 10065; -- No route to host
EINPROGRESS : constant := 10036; -- Operation now in progress
EINTR : constant := 4; -- Interrupted system call
EINVAL : constant := 22; -- Invalid argument
EIO : constant := 5; -- Input output error
EISCONN : constant := 10056; -- Socket already connected
ELOOP : constant := 10062; -- Too many symbolic links
EMFILE : constant := 24; -- Too many open files
EMSGSIZE : constant := 10040; -- Message too long
ENAMETOOLONG : constant := 38; -- Name too long
ENETDOWN : constant := 10050; -- Network is down
ENETRESET : constant := 10052; -- Disconn. on network reset
ENETUNREACH : constant := 10051; -- Network is unreachable
ENOBUFS : constant := 10055; -- No buffer space available
ENOPROTOOPT : constant := 10042; -- Protocol not available
ENOTCONN : constant := 10057; -- Socket not connected
ENOTSOCK : constant := 10038; -- Operation on non socket
EOPNOTSUPP : constant := 10045; -- Operation not supported
EPIPE : constant := 32; -- Broken pipe
EPFNOSUPPORT : constant := 10046; -- Unknown protocol family
EPROTONOSUPPORT : constant := 10043; -- Unknown protocol
EPROTOTYPE : constant := 10041; -- Unknown protocol type
ERANGE : constant := 34; -- Result too large
ESHUTDOWN : constant := 10058; -- Cannot send once shutdown
ESOCKTNOSUPPORT : constant := 10044; -- Socket type not supported
ETIMEDOUT : constant := 10060; -- Connection timed out
ETOOMANYREFS : constant := 10059; -- Too many references
EWOULDBLOCK : constant := 10035; -- Operation would block
E2BIG : constant := 7; -- Argument list too long
EILSEQ : constant := 42; -- Illegal byte sequence
----------------------
-- Terminal control --
----------------------
DTR_CONTROL_ENABLE : constant := 1; -- Enable DTR flow ctrl
RTS_CONTROL_ENABLE : constant := 1; -- Enable RTS flow ctrl
-----------------------------
-- Pseudo terminal library --
-----------------------------
PTY_Library : constant String := ""; -- for g-exptty
--------------
-- Families --
--------------
AF_INET : constant := 2; -- IPv4 address family
AF_INET6 : constant := 23; -- IPv6 address family
AF_UNSPEC : constant := 0; -- Unspecified address family
-----------------------------
-- addrinfo fields offsets --
-----------------------------
AI_FLAGS_OFFSET : constant := 0; -- Offset of ai_flags in addrinfo
AI_FAMILY_OFFSET : constant := 4; -- Offset of ai_family in addrinfo
AI_SOCKTYPE_OFFSET : constant := 8; -- Offset of ai_socktype in addrinfo
AI_PROTOCOL_OFFSET : constant := 12; -- Offset of ai_protocol in addrinfo
AI_ADDRLEN_OFFSET : constant := 16; -- Offset of ai_addrlen in addrinfo
AI_ADDR_OFFSET : constant := 24; -- Offset of ai_addr in addrinfo
AI_CANONNAME_OFFSET : constant := 20; -- Offset of ai_canonname in addrinfo
AI_NEXT_OFFSET : constant := 28; -- Offset of ai_next in addrinfo
---------------------------------------
-- getaddrinfo getnameinfo constants --
---------------------------------------
AI_PASSIVE : constant := 1; -- NULL nodename for accepting
AI_CANONNAME : constant := 2; -- Get the host official name
AI_NUMERICSERV : constant := -1; -- Service is a numeric string
AI_NUMERICHOST : constant := 4; -- Node is a numeric IP address
AI_ADDRCONFIG : constant := -1; -- Returns addresses for only locally configured families
AI_V4MAPPED : constant := -1; -- Returns IPv4 mapped to IPv6
AI_ALL : constant := -1; -- Change AI_V4MAPPED behavior for unavailavle IPv6 addresses
NI_NAMEREQD : constant := 4; -- Error if the hostname cannot be determined
NI_DGRAM : constant := 16; -- Service is datagram
NI_NOFQDN : constant := 1; -- Return only the hostname part for local hosts
NI_NUMERICSERV : constant := 8; -- Numeric form of the service
NI_NUMERICHOST : constant := 2; -- Numeric form of the hostname
NI_MAXHOST : constant := 1025; -- Maximum size of hostname
NI_MAXSERV : constant := 32; -- Maximum size of service name
EAI_SYSTEM : constant := 10107; -- Check errno for details
------------------
-- Socket modes --
------------------
SOCK_STREAM : constant := 1; -- Stream socket
SOCK_DGRAM : constant := 2; -- Datagram socket
SOCK_RAW : constant := 3; -- Raw socket
-----------------
-- Host errors --
-----------------
HOST_NOT_FOUND : constant := 11001; -- Unknown host
TRY_AGAIN : constant := 11002; -- Host name lookup failure
NO_DATA : constant := 11004; -- No data record for name
NO_RECOVERY : constant := 11003; -- Non recoverable errors
--------------------
-- Shutdown modes --
--------------------
SHUT_RD : constant := 0; -- No more recv
SHUT_WR : constant := 1; -- No more send
SHUT_RDWR : constant := 2; -- No more recv/send
---------------------
-- Protocol levels --
---------------------
SOL_SOCKET : constant := 65535; -- Options for socket level
IPPROTO_IP : constant := 0; -- Dummy protocol for IP
IPPROTO_IPV6 : constant := 41; -- IPv6 socket option level
IPPROTO_UDP : constant := 17; -- UDP
IPPROTO_TCP : constant := 6; -- TCP
-------------------
-- Request flags --
-------------------
MSG_OOB : constant := 1; -- Process out-of-band data
MSG_PEEK : constant := 2; -- Peek at incoming data
MSG_EOR : constant := -1; -- Send end of record
MSG_WAITALL : constant := -1; -- Wait for full reception
MSG_NOSIGNAL : constant := -1; -- No SIGPIPE on send
MSG_Forced_Flags : constant := 0;
-- Flags set on all send(2) calls
--------------------
-- Socket options --
--------------------
TCP_NODELAY : constant := 1; -- Do not coalesce packets
SO_REUSEADDR : constant := 4; -- Bind reuse local address
SO_REUSEPORT : constant := -1; -- Bind reuse port number
SO_KEEPALIVE : constant := 8; -- Enable keep-alive msgs
SO_LINGER : constant := 128; -- Defer close to flush data
SO_BROADCAST : constant := 32; -- Can send broadcast msgs
SO_SNDBUF : constant := 4097; -- Set/get send buffer size
SO_RCVBUF : constant := 4098; -- Set/get recv buffer size
SO_SNDTIMEO : constant := 4101; -- Emission timeout
SO_RCVTIMEO : constant := 4102; -- Reception timeout
SO_ERROR : constant := 4103; -- Get/clear error status
SO_BUSY_POLL : constant := -1; -- Busy polling
IP_MULTICAST_IF : constant := 9; -- Set/get mcast interface
IP_MULTICAST_TTL : constant := 10; -- Set/get multicast TTL
IP_MULTICAST_LOOP : constant := 11; -- Set/get mcast loopback
IP_ADD_MEMBERSHIP : constant := 12; -- Join a multicast group
IP_DROP_MEMBERSHIP : constant := 13; -- Leave a multicast group
IP_PKTINFO : constant := 19; -- Get datagram info
IP_RECVERR : constant := -1; -- Extended reliable error message passing
IPV6_ADDRFORM : constant := -1; -- Turn IPv6 socket into different address family
IPV6_ADD_MEMBERSHIP : constant := 12; -- Join IPv6 multicast group
IPV6_DROP_MEMBERSHIP : constant := 13; -- Leave IPv6 multicast group
IPV6_MTU : constant := -1; -- Set/get MTU used for the socket
IPV6_MTU_DISCOVER : constant := -1; -- Control path-MTU discovery on the socket
IPV6_MULTICAST_HOPS : constant := 10; -- Set the multicast hop limit for the socket
IPV6_MULTICAST_IF : constant := 9; -- Set/get IPv6 mcast interface
IPV6_MULTICAST_LOOP : constant := 11; -- Set/get mcast loopback
IPV6_RECVPKTINFO : constant := -1; -- Set delivery of the IPV6_PKTINFO
IPV6_PKTINFO : constant := 19; -- Get IPv6datagram info
IPV6_RTHDR : constant := -1; -- Set the routing header delivery
IPV6_AUTHHDR : constant := -1; -- Set the authentication header delivery
IPV6_DSTOPTS : constant := -1; -- Set the destination options delivery
IPV6_HOPOPTS : constant := -1; -- Set the hop options delivery
IPV6_FLOWINFO : constant := -1; -- Set the flow ID delivery
IPV6_HOPLIMIT : constant := -1; -- Set the hop count of the packet delivery
IPV6_RECVERR : constant := -1; -- Extended reliable error message passing
IPV6_ROUTER_ALERT : constant := -1; -- Pass forwarded router alert hop-by-hop option
IPV6_UNICAST_HOPS : constant := 4; -- Set the unicast hop limit
IPV6_V6ONLY : constant := -1; -- Restricted to IPv6 communications only
----------------------
-- Type definitions --
----------------------
-- Sizes (in bytes) of the components of struct timeval
SIZEOF_tv_sec : constant := 4; -- tv_sec
SIZEOF_tv_usec : constant := 4; -- tv_usec
-- Maximum allowed value for tv_sec
MAX_tv_sec : constant := 2 ** (SIZEOF_tv_sec * 8 - 1) - 1;
-- Sizes of various data types
SIZEOF_sockaddr_in : constant := 16; -- struct sockaddr_in
SIZEOF_sockaddr_in6 : constant := 28; -- struct sockaddr_in6
SIZEOF_fd_set : constant := 4100; -- fd_set
FD_SETSIZE : constant := 1024; -- Max fd value
SIZEOF_struct_hostent : constant := 16; -- struct hostent
SIZEOF_struct_servent : constant := 16; -- struct servent
SIZEOF_socklen_t : constant := 4; -- Size of socklen_t
IF_NAMESIZE : constant := -1; -- Max size of interface name with 0 terminator
-- Fields of struct msghdr
subtype Msg_Iovlen_T is Interfaces.C.size_t;
----------------------------------------
-- Properties of supported interfaces --
----------------------------------------
Need_Netdb_Buffer : constant := 0; -- Need buffer for Netdb ops
Need_Netdb_Lock : constant := 0; -- Need lock for Netdb ops
Has_Sockaddr_Len : constant := 0; -- Sockaddr has sa_len field
Thread_Blocking_IO : constant Boolean := True;
-- Set False for contexts where socket i/o are process blocking
Inet_Pton_Linkname : constant String := "__gnat_inet_pton";
Inet_Ntop_Linkname : constant String := "__gnat_inet_ntop";
---------------------
-- Threads support --
---------------------
-- Clock identifier definitions
CLOCK_REALTIME : constant := 1; -- System realtime clock
CLOCK_MONOTONIC : constant := 3; -- System monotonic clock
CLOCK_THREAD_CPUTIME_ID : constant := -1; -- Thread CPU clock
CLOCK_RT_Ada : constant := CLOCK_REALTIME;
--------------------------------
-- File and directory support --
--------------------------------
SIZEOF_struct_file_attributes : constant := 24; -- struct file_attributes
SIZEOF_struct_dirent_alloc : constant := 273; -- struct dirent allocation
------------------------------
-- MinGW-specific constants --
------------------------------
-- These constants may be used only within the MinGW version of
-- GNAT.Sockets.Thin.
WSASYSNOTREADY : constant := 10091; -- System not ready
WSAVERNOTSUPPORTED : constant := 10092; -- Version not supported
WSANOTINITIALISED : constant := 10093; -- Winsock not initialized
WSAEDISCON : constant := 10101; -- Disconnected
end System.OS_Constants;
|
------------------------------------------------------------------------------
-- --
-- tiled-code-gen --
-- --
-- Copyright (C) 2018 Fabien Chouteau --
-- --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Directories; use Ada.Directories;
with GNAT.OS_Lib;
with DOM.Core; use DOM.Core;
with TCG.Utils; use TCG.Utils;
with TCG.Tile_Layers; use TCG.Tile_Layers;
with TCG.Object_Groups; use TCG.Object_Groups;
with Input_Sources.File; use Input_Sources.File;
with Sax.Readers; use Sax.Readers;
with DOM.Readers; use DOM.Readers;
with DOM.Core.Documents; use DOM.Core.Documents;
with DOM.Core.Nodes; use DOM.Core.Nodes;
package body TCG.Maps is
function Create (N : Node; Name : String) return Map;
function Load_Tileset (N : Node; Base_Dir : String) return Map_Tileset;
------------
-- Create --
------------
function Create (N : Node; Name : String) return Map is
Tile_Width : constant Natural := Item_As_Natural (N, "tilewidth");
Tile_Height : constant Natural := Item_As_Natural (N, "tileheight");
Width : constant Natural := Item_As_Natural (N, "width");
Height : constant Natural := Item_As_Natural (N, "height");
M : constant Map := new Map_Data;
begin
M.Width := Width;
M.Height := Height;
M.Tile_Width := Tile_Width;
M.Tile_Height := Tile_Height;
M.Name := new String'(Name);
return M;
end Create;
------------------
-- Load_Tileset --
------------------
function Load_Tileset (N : Node;
Base_Dir : String)
return Map_Tileset
is
Source : constant String :=
GNAT.OS_Lib.Normalize_Pathname (Item_As_String (N, "source"),
Base_Dir);
First_Tile : constant Natural := Item_As_Natural (N, "firstgid");
begin
return (Tilesets.Load (Source), Tilesets.Map_Tile_Id (First_Tile));
end Load_Tileset;
----------
-- Load --
----------
function Load (Path : String; Name : String) return Map is
Dir : constant String := Containing_Directory (Path);
Input : File_Input;
Reader : Tree_Reader;
Doc : Document;
List : Node_List;
N : Node;
M : Map;
begin
Set_Public_Id (Input, "Map file");
Open (Path, Input);
Set_Feature (Reader, Validation_Feature, False);
Set_Feature (Reader, Namespace_Feature, False);
Parse (Reader, Input);
Close (Input);
Doc := Get_Tree (Reader);
List := Get_Elements_By_Tag_Name (Doc, "map");
if Length (List) > 1 then
raise Program_Error with "Too many map elements";
end if;
M := Create (Item (List, 0), Name);
Free (List);
List := Get_Elements_By_Tag_Name (Doc, "objectgroup");
for Index in 1 .. Length (List) loop
N := Item (List, Index - 1);
M.Obj_Group_List.Append (Object_Groups.Load (N));
end loop;
Free (List);
List := Get_Elements_By_Tag_Name (Doc, "tileset");
for Index in 1 .. Length (List) loop
N := Item (List, Index - 1);
M.Tileset_List.Append (Load_Tileset (N, Dir));
end loop;
Free (List);
List := Get_Elements_By_Tag_Name (Doc, "layer");
for Index in 1 .. Length (List) loop
N := Item (List, Index - 1);
M.Layer_List.Append (Tile_Layers.Load (N));
end loop;
Free (List);
Free (Reader);
return M;
end Load;
----------
-- Name --
----------
function Name (This : Map) return String
is (This.Name.all);
-----------
-- Width --
-----------
function Width (This : Map) return Natural
is (This.Width);
------------
-- Height --
------------
function Height (This : Map) return Natural
is (This.Height);
----------------
-- Tile_Width --
----------------
function Tile_Width (This : Map) return Natural
is (This.Tile_Width);
-----------------
-- Tile_Height --
-----------------
function Tile_Height (This : Map) return Natural
is (This.Tile_Height);
---------
-- Put --
---------
procedure Put
(This : Map)
is
begin
Put_Line ("Map " & This.Name.all & ":");
for TS of This.Tileset_List loop
Put_Line ("Tileset " & Tilesets.Name (TS.Id));
end loop;
for L of This.Layer_List loop
Tile_Layers.Put (L);
end loop;
end Put;
----------------------
-- Number_Of_Layers --
----------------------
function Number_Of_Layers (This : Map) return Natural
is (Natural (Layer_Vect.Length (This.Layer_List)));
-----------------
-- First_Index --
-----------------
function First_Layer (This : Map) return Natural
is (Natural (Layer_Vect.First_Index (This.Layer_List)));
----------------
-- Last_Index --
----------------
function Last_Layer (This : Map) return Natural
is (Natural (Layer_Vect.Last_Index (This.Layer_List)));
-----------
-- Layer --
-----------
function Layer (This : Map; Index : Natural) return Tile_Layers.Tile_Layer
is (This.Layer_List.Element (Index));
-----------------
-- Master_Tile --
-----------------
function Master_Tile (M : Map;
Id : Tilesets.Map_Tile_Id)
return Tilesets.Master_Tile_Id
is
use Tilesets;
First_Id : Map_Tile_Id := 0;
TS_Id : Tileset_Id := Invalid_Tileset;
begin
if Id = 0 then
return No_Tile;
end if;
for TS of M.Tileset_List loop
if TS.First_Tile > Id then
exit;
else
TS_Id := TS.Id;
First_Id := TS.First_Tile;
end if;
end loop;
return Convert (TS_Id, Local_Tile_Id (Id - First_Id));
end Master_Tile;
------------------------
-- First_Object_Group --
------------------------
function First_Object_Group (This : Map) return Natural
is (This.Obj_Group_List.First_Index);
-----------------------
-- Last_Object_Group --
-----------------------
function Last_Object_Group (This : Map) return Natural
is (This.Obj_Group_List.Last_Index);
------------------
-- Object_Group --
------------------
function Object_Group (This : Map; Index : Natural)
return Object_Groups.Object_Group
is (This.Obj_Group_List.Element (Index));
---------------------------
-- Generate_GESTE_Source --
---------------------------
procedure Generate_GESTE_Source (M : Map;
Package_Name : String;
Filepath : String)
is
Output : File_Type;
Indent : Natural := 0;
procedure P (Str : String);
procedure PL (Str : String);
procedure NL;
procedure Put_Object (M : Map;
Obj : Object_Groups.Object);
-------
-- P --
-------
procedure P (Str : String) is
begin
Put (Output, Str);
end P;
--------
-- PL --
--------
procedure PL (Str : String) is
begin
for X in 1 .. Indent loop
Put (Output, " ");
end loop;
Put_Line (Output, Str);
end PL;
--------
-- NL --
--------
procedure NL is
begin
New_Line (Output);
end NL;
----------------
-- Put_Object --
----------------
procedure Put_Object (M : Map;
Obj : Object_Groups.Object)
is
begin
PL ("Kind => " & Obj.Kind'Img & ",");
PL ("Id => " & Obj.Id'Img & ",");
if Obj.Name /= null then
PL ("Name => new String'(""" & Obj.Name.all & """),");
else
PL ("Name => null,");
end if;
PL ("X => " & Obj.Pt.X'Img & ",");
PL ("Y => " & Obj.Pt.Y'Img & ",");
PL ("Width => " & Obj.Width'Img & ",");
PL ("Height => " & Obj.Height'Img & ",");
PL ("Flip_Vertical => " & Obj.Flip_Vertical'Img & ",");
PL ("Flip_Horizontal => " & Obj.Flip_Horizontal'Img & ",");
PL ("Tile_Id => " & Master_Tile (M, Obj.Tile_Id)'Img & ",");
if Obj.Str /= null then
PL ("Str => new String'(""" & Obj.Str.all & """)");
else
PL ("Str => null");
end if;
end Put_Object;
begin
Create (Output, Out_File, Filepath);
PL ("with GESTE;");
PL ("with GESTE.Grid;");
PL ("pragma Style_Checks (Off);");
PL ("package " & Package_Name & " is");
NL;
Indent := Indent + 3;
PL ("-- " & M.Name.all);
PL ("Width : constant :=" & M.Width'Img & ";");
PL ("Height : constant :=" & M.Height'Img & ";");
PL ("Tile_Width : constant :=" & M.Tile_Width'Img & ";");
PL ("Tile_Height : constant :=" & M.Tile_Height'Img & ";");
NL;
for L of M.Layer_List loop
declare
Layer_Ada_Id : constant String := To_Ada_Identifier (Name (L));
begin
PL ("-- " & Name (L));
PL ("package " & Layer_Ada_Id & " is");
Indent := Indent + 3;
PL ("Width : constant := " & Width (L)'Img & ";");
PL ("Height : constant := " & Width (L)'Img & ";");
PL ("Data : aliased GESTE.Grid.Grid_Data :=");
P (" (");
for X in 1 .. Width (L) loop
if X /= 1 then
P (" ");
end if;
P ("(");
for Y in 1 .. Height (L) loop
P (Master_Tile (M, Tile (L, X, Y))'Img);
if Y /= Height (L) then
P (",");
end if;
end loop;
P (")");
if X /= Width (L) then
P (",");
NL;
else
P (")");
end if;
end loop;
PL (";");
Indent := Indent - 3;
PL ("end " & Layer_Ada_Id & ";");
NL;
end;
end loop;
for G of M.Obj_Group_List loop
declare
Group_Ada_Id : constant String := To_Ada_Identifier (Name (G));
begin
PL ("package " & Group_Ada_Id & " is");
Indent := Indent + 3;
if Length (G) /= 0 then
-- Objects as array
PL ("Objects : Object_Array :=");
Indent := Indent + 2;
PL ("(");
Indent := Indent + 2;
for Index in First_Index (G) .. Last_Index (G) loop
declare
Obj : constant Object_Groups.Object :=
Get_Object (G, Index);
begin
PL (Index'Img & " => (");
Indent := Indent + 2;
Put_Object (M, Obj);
Indent := Indent - 2;
if Index = Last_Index (G) then
PL (")");
else
PL ("),");
end if;
end;
end loop;
Indent := Indent - 2;
PL (");");
Indent := Indent - 2;
end if;
if Length (G) /= 0 then
-- Object as indivial declaration
for Index in First_Index (G) .. Last_Index (G) loop
declare
Obj : constant Object_Groups.Object :=
Get_Object (G, Index);
begin
if Obj.Name /= null then
PL (TCG.Utils.To_Ada_Identifier (Obj.Name.all) &
" : aliased constant Object := (");
Indent := Indent + 2;
Put_Object (M, Obj);
PL (");");
Indent := Indent - 2;
end if;
end;
end loop;
end if;
Indent := Indent - 3;
PL ("end " & Group_Ada_Id & ";");
end;
end loop;
Indent := Indent - 3;
PL ("end " & Package_Name & ";");
Close (Output);
end Generate_GESTE_Source;
----------------------------
-- Generate_LibGBA_Source --
----------------------------
procedure Generate_LibGBA_Source (M : Map;
Package_Name : String;
Filepath : String)
is
Output : File_Type;
Indent : Natural := 0;
procedure P (Str : String);
procedure PL (Str : String);
procedure NL;
procedure Put_Object (M : Map;
Obj : Object_Groups.Object);
-------
-- P --
-------
procedure P (Str : String) is
begin
Put (Output, Str);
end P;
--------
-- PL --
--------
procedure PL (Str : String) is
begin
for X in 1 .. Indent loop
Put (Output, " ");
end loop;
Put_Line (Output, Str);
end PL;
--------
-- NL --
--------
procedure NL is
begin
New_Line (Output);
end NL;
----------------
-- Put_Object --
----------------
procedure Put_Object (M : Map;
Obj : Object_Groups.Object)
is
begin
PL ("Kind => " & Obj.Kind'Img & ",");
PL ("Id => " & Obj.Id'Img & ",");
if Obj.Name /= null then
-- PL ("Name => new String'(""" & Obj.Name.all & """),");
PL ("Name => null,");
else
PL ("Name => null,");
end if;
PL ("X => " & Obj.Pt.X'Img & ",");
PL ("Y => " & Obj.Pt.Y'Img & ",");
PL ("Width => " & Obj.Width'Img & ",");
PL ("Height => " & Obj.Height'Img & ",");
PL ("Flip_Vertical => " & Obj.Flip_Vertical'Img & ",");
PL ("Flip_Horizontal => " & Obj.Flip_Horizontal'Img & ",");
PL ("Tile_Id => " & Master_Tile (M, Obj.Tile_Id)'Img & ",");
if Obj.Str /= null then
-- PL ("Str => new String'(""" & Obj.Str.all & """)");
PL ("Str => null");
else
PL ("Str => null");
end if;
end Put_Object;
begin
pragma Style_Checks ("M200");
Create (Output, Out_File, Filepath);
PL ("with GBA.Graphics.Background.Viewport;");
PL ("pragma Style_Checks (Off);");
PL ("package " & Package_Name & " is");
NL;
Indent := Indent + 3;
PL ("-- " & M.Name.all);
PL ("Width : constant :=" & M.Width'Img & ";");
PL ("Height : constant :=" & M.Height'Img & ";");
PL ("Tile_Width : constant :=" & M.Tile_Width'Img & ";");
PL ("Tile_Height : constant :=" & M.Tile_Height'Img & ";");
NL;
for L of M.Layer_List loop
declare
Layer_Ada_Id : constant String := To_Ada_Identifier (Name (L));
begin
PL ("-- " & Name (L));
PL ("package " & Layer_Ada_Id & " is");
Indent := Indent + 3;
PL ("Width : constant := " & Width (L)'Img & ";");
PL ("Height : constant := " & Height (L)'Img & ";");
PL ("Data : aliased GBA.Graphics.Background.Viewport.Raw_Screenblock :=");
P (" (");
for Y in 1 .. Height (L) loop
if Y /= 1 then
P (" ");
end if;
for X in 1 .. Width (L) loop
P (Master_Tile (M, Tile (L, X, Y))'Img);
if X /= Width (L) then
P (",");
end if;
end loop;
if Y /= Height (L) then
P (",");
NL;
else
P (")");
end if;
end loop;
PL (";");
PL ("Info : constant GBA.Graphics.Background.Viewport.Map_Info := (Data'Access, Width, Height);");
Indent := Indent - 3;
PL ("end " & Layer_Ada_Id & ";");
NL;
end;
end loop;
for G of M.Obj_Group_List loop
declare
Group_Ada_Id : constant String := To_Ada_Identifier (Name (G));
begin
PL ("package " & Group_Ada_Id & " is");
Indent := Indent + 3;
if Length (G) /= 0 then
-- Objects as array
PL ("Objects : Object_Array :=");
Indent := Indent + 2;
PL ("(");
Indent := Indent + 2;
for Index in First_Index (G) .. Last_Index (G) loop
declare
Obj : constant Object_Groups.Object :=
Get_Object (G, Index);
begin
PL (Index'Img & " => (");
Indent := Indent + 2;
Put_Object (M, Obj);
Indent := Indent - 2;
if Index = Last_Index (G) then
PL (")");
else
PL ("),");
end if;
end;
end loop;
Indent := Indent - 2;
PL (");");
Indent := Indent - 2;
end if;
if Length (G) /= 0 then
-- Object as indivial declaration
for Index in First_Index (G) .. Last_Index (G) loop
declare
Obj : constant Object_Groups.Object :=
Get_Object (G, Index);
begin
if Obj.Name /= null then
PL (TCG.Utils.To_Ada_Identifier (Obj.Name.all) &
" : aliased constant Object := (");
Indent := Indent + 2;
Put_Object (M, Obj);
PL (");");
Indent := Indent - 2;
end if;
end;
end loop;
end if;
Indent := Indent - 3;
PL ("end " & Group_Ada_Id & ";");
end;
end loop;
Indent := Indent - 3;
PL ("end " & Package_Name & ";");
Close (Output);
end Generate_LibGBA_Source;
--------------------------
-- Generate_RSTE_Source --
--------------------------
procedure Generate_RSTE_Source (M : Map;
Filepath : String)
is
Output : File_Type;
Indent : Natural := 0;
procedure P (Str : String);
procedure PL (Str : String);
procedure NL;
procedure Put_Object (M : Map;
Obj : Object_Groups.Object);
function Rust_Boolean (B : Boolean) return String;
function Rust_Object_Kind (O : Object_Kind) return String;
------------------
-- Rust_Boolean --
------------------
function Rust_Boolean (B : Boolean) return String
is (if B then "true" else "false");
----------------------
-- Rust_Object_Kind --
----------------------
function Rust_Object_Kind (O : Object_Kind) return String
is (case O is
when Point_Obj => "super::super::ObjectKind::Point",
when Rectangle_Obj => "super::super::ObjectKind::Rectangle",
when Ellipse_Obj => "super::super::ObjectKind::Ellipse",
when Polygon_Obj => "super::super::ObjectKind::Polygon",
when Tile_Obj => "super::super::ObjectKind::Tile",
when Text_Obj => "super::super::ObjectKind::Text");
-------
-- P --
-------
procedure P (Str : String) is
begin
Put (Output, Str);
end P;
--------
-- PL --
--------
procedure PL (Str : String) is
begin
for X in 1 .. Indent loop
Put (Output, " ");
end loop;
Put_Line (Output, Str);
end PL;
--------
-- NL --
--------
procedure NL is
begin
New_Line (Output);
end NL;
----------------
-- Put_Object --
----------------
procedure Put_Object (M : Map;
Obj : Object_Groups.Object)
is
begin
PL ("kind : " & Rust_Object_Kind (Obj.Kind) & ",");
PL ("id : " & Obj.Id'Img & ",");
if Obj.Name /= null then
PL ("name :""" & Obj.Name.all & """,");
else
PL ("name : """",");
end if;
PL ("x : " & Obj.Pt.X'Img & ",");
PL ("y : " & Obj.Pt.Y'Img & ",");
PL ("width : " & Obj.Width'Img & ",");
PL ("height : " & Obj.Height'Img & ",");
PL ("flip_vertical : " & Rust_Boolean (Obj.Flip_Vertical) & ",");
PL ("flip_horizontal : " & Rust_Boolean (Obj.Flip_Horizontal) & ",");
PL ("tile_id : " & Master_Tile (M, Obj.Tile_Id)'Img & ",");
if Obj.Str /= null then
PL ("str : """ & Obj.Str.all & """,");
else
PL ("str : """",");
end if;
end Put_Object;
begin
Create (Output, Out_File, Filepath);
PL ("// " & M.Name.all);
PL ("#[allow(unused_imports)]");
NL;
PL ("const WIDTH : usize =" & M.Width'Img & ";");
PL ("const HEIGHT : usize =" & M.Height'Img & ";");
PL ("const TILE_WIDTH : usize =" & M.Tile_Width'Img & ";");
PL ("const TILE_HEIGHT : usize =" & M.Tile_Height'Img & ";");
NL;
for L of M.Layer_List loop
PL ("pub mod " & To_Rust_Identifier (Name (L)) & " {");
Indent := Indent + 4;
PL ("use sprite_and_tile::*;");
PL ("pub const WIDTH : usize = " & Width (L)'Img & ";");
PL ("pub const HEIGHT : usize = " & Height (L)'Img & ";");
PL ("pub static TILE_MAP_DATA : [usize;" &
Integer'Image (Width (L) * Height (L)) & "] =");
P (" [");
for Y in 1 .. Height (L) loop
if Y /= 1 then
P (" ");
end if;
for X in 1 .. Width (L) loop
P (Master_Tile (M, Tile (L, X, Y))'Img);
P (",");
end loop;
if Y /= Height (L) then
NL;
end if;
end loop;
PL ("];");
PL ("static TILE_MAP : TileMap =");
PL (" TileMap {width : WIDTH,");
PL (" height : HEIGHT,");
PL (" map : & TILE_MAP_DATA}; ");
Indent := Indent - 4;
PL ("}");
NL;
end loop;
for G of M.Obj_Group_List loop
PL ("pub mod " & To_Rust_Identifier (Name (G)) & " {");
Indent := Indent + 3;
if Length (G) /= 0 then
-- Objects as array
PL ("pub static OBJECTS : [super::super::Object;" &
Length (G)'Img & "] =");
Indent := Indent + 2;
PL ("[");
Indent := Indent + 2;
for Index in First_Index (G) .. Last_Index (G) loop
declare
Obj : constant Object_Groups.Object :=
Get_Object (G, Index);
begin
PL ("super::super::Object {");
Indent := Indent + 2;
Put_Object (M, Obj);
Indent := Indent - 2;
PL ("},");
end;
end loop;
Indent := Indent - 2;
PL ("];");
Indent := Indent - 2;
end if;
if Length (G) /= 0 then
-- Object as indivial declaration
for Index in First_Index (G) .. Last_Index (G) loop
declare
Obj : constant Object_Groups.Object :=
Get_Object (G, Index);
begin
if Obj.Name /= null then
PL ("pub static " &
TCG.Utils.To_Rust_Static_Identifier (Obj.Name.all) &
" : super::super::Object = " &
"super::super::Object {");
Indent := Indent + 2;
Put_Object (M, Obj);
PL ("};");
Indent := Indent - 2;
end if;
end;
end loop;
end if;
Indent := Indent - 3;
PL ("}");
end loop;
Close (Output);
end Generate_RSTE_Source;
-------------------------
-- Fill_Master_Tileset --
-------------------------
procedure Fill_Master_Tileset (M : Map) is
Unused : Tilesets.Master_Tile_Id;
begin
-- For all layers...
for L of M.Layer_List loop
-- For all tiles...
for X in 1 .. Width (L) loop
for Y in 1 .. Height (L) loop
-- Convert to a Master_Tile_ID to make sure the tile is
-- added to the master tile set.
Unused := Master_Tile (M, Tile (L, X, Y));
end loop;
end loop;
-- For all groups...
for G of M.Obj_Group_List loop
if Length (G) /= 0 then
-- For all objects...
for Index in First_Index (G) .. Last_Index (G) loop
declare
Obj : constant Object_Groups.Object :=
Get_Object (G, Index);
begin
-- Convert the tile to a Master_Tile_ID to make sure the
-- tile is added to the master tile set.
Unused := Master_Tile (M, Obj.Tile_Id);
end;
end loop;
end if;
end loop;
end loop;
end Fill_Master_Tileset;
end TCG.Maps;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.CMOF.Classes;
with AMF.CMOF.Comments.Collections;
with AMF.CMOF.Elements.Collections;
with AMF.CMOF.Properties;
with AMF.Extents;
with AMF.Internals.Elements;
with League.Holders;
package AMF.Internals.CMOF_Elements is
type CMOF_Element_Proxy is
abstract limited new AMF.Internals.Elements.Element_Base
and AMF.CMOF.Elements.CMOF_Element with null record;
overriding function Get
(Self : not null access constant CMOF_Element_Proxy;
Property : not null AMF.CMOF.Properties.CMOF_Property_Access)
return League.Holders.Holder;
overriding function Get_Meta_Class
(Self : not null access constant CMOF_Element_Proxy)
return AMF.CMOF.Classes.CMOF_Class_Access;
overriding function Get_Owned_Comment
(Self : not null access constant CMOF_Element_Proxy)
return AMF.CMOF.Comments.Collections.Set_Of_CMOF_Comment;
overriding function Get_Owned_Element
(Self : not null access constant CMOF_Element_Proxy)
return AMF.CMOF.Elements.Collections.Set_Of_CMOF_Element;
overriding function Get_Owner
(Self : not null access constant CMOF_Element_Proxy)
return AMF.CMOF.Elements.CMOF_Element_Access;
overriding procedure Set
(Self : not null access CMOF_Element_Proxy;
Property : not null AMF.CMOF.Properties.CMOF_Property_Access;
Value : League.Holders.Holder);
overriding function Extent
(Self : not null access constant CMOF_Element_Proxy)
return AMF.Extents.Extent_Access;
overriding function Must_Be_Owned
(Self : not null access constant CMOF_Element_Proxy) return Boolean;
-- Operation Element::mustBeOwned.
--
-- The query mustBeOwned() indicates whether elements of this type must
-- have an owner. Subclasses of Element that do not require an owner must
-- override this operation.
end AMF.Internals.CMOF_Elements;
|
-- Copyright 2008-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 Pck is
type Position is record
X : Integer;
Y : Integer;
end record;
type Circle is record
Pos : Position;
Radius : Integer;
end record;
procedure Do_Nothing (C : in out Circle);
end Pck;
|
with
AdaM.Factory;
package body AdaM.access_Definition
is
-- Storage Pool
--
record_Version : constant := 1;
pool_Size : constant := 5_000;
package Pool is new AdaM.Factory.Pools (storage_Folder => ".adam-store",
pool_Name => "access_Definitions",
max_Items => pool_Size,
record_Version => record_Version,
Item => access_Definition.item,
View => access_Definition.view);
-- Forge
--
procedure define (Self : in out Item)
is
begin
null;
end define;
procedure destruct (Self : in out Item)
is
begin
null;
end destruct;
function new_Definition return access_Definition.view
is
new_View : constant access_Definition.view := Pool.new_Item;
begin
define (access_Definition.item (new_View.all));
return new_View;
end new_Definition;
procedure free (Self : in out access_Definition.view)
is
begin
destruct (access_Definition.item (Self.all));
Pool.free (Self);
end free;
-- Attributes
--
overriding function Id (Self : access Item) return AdaM.Id
is
begin
return Pool.to_Id (Self);
end Id;
overriding
function to_Source (Self : in Item) return text_Vectors.Vector
is
pragma Unreferenced (Self);
the_Source : text_Vectors.Vector;
begin
raise Program_Error with "TODO";
return the_Source;
end to_Source;
function is_Constrained (Self : in Item) return Boolean
is
begin
return Self.is_Constrained;
end is_Constrained;
procedure is_Constrained (Self : in out Item; Now : in Boolean := True)
is
begin
Self.is_Constrained := Now;
end is_Constrained;
function First (Self : in Item) return String
is
begin
return +Self.First;
end First;
procedure First_is (Self : in out Item; Now : in String)
is
begin
Self.First := +Now;
end First_is;
function Last (Self : in Item) return String
is
begin
return +Self.Last;
end Last;
procedure Last_is (Self : in out Item; Now : in String)
is
begin
Self.Last := +Now;
end Last_is;
function has_not_Null (Self : in Item) return Boolean
is
begin
return Self.has_not_Null;
end has_not_Null;
procedure has_not_Null (Self : in out Item; Now : in Boolean := True)
is
begin
Self.has_not_Null := Now;
end has_not_Null;
function main_Type (Self : access Item) return access AdaM.a_Type.view
is
begin
return Self.main_Type'Access;
end main_Type;
function main_Type (Self : in Item) return AdaM.a_Type.view
is
begin
return Self.main_Type;
end main_Type;
procedure main_Type_is (Self : in out Item; Now : in AdaM.a_Type.view)
is
begin
Self.main_Type := Now;
end main_Type_is;
overriding
function Name (Self : in Item) return Identifier
is
pragma Unreferenced (Self);
begin
return "";
end Name;
-- Streams
--
procedure View_write (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : in View)
renames Pool.View_write;
procedure View_read (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : out View)
renames Pool.View_read;
end AdaM.access_Definition;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T A S K _ A T T R I B U T E S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1991-1994, Florida State University --
-- Copyright (C) 1995-2006, AdaCore --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 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. --
-- --
------------------------------------------------------------------------------
-- The following notes are provided in case someone decides the implementation
-- of this package is too complicated, or too slow. Please read this before
-- making any "simplifications".
-- Correct implementation of this package is more difficult than one might
-- expect. After considering (and coding) several alternatives, we settled on
-- the present compromise. Things we do not like about this implementation
-- include:
-- - It is vulnerable to bad Task_Id values, to the extent of possibly
-- trashing memory and crashing the runtime system.
-- - It requires dynamic storage allocation for each new attribute value,
-- except for types that happen to be the same size as System.Address, or
-- shorter.
-- - Instantiations at other than the library level rely on being able to
-- do down-level calls to a procedure declared in the generic package body.
-- This makes it potentially vulnerable to compiler changes.
-- The main implementation issue here is that the connection from task to
-- attribute is a potential source of dangling references.
-- When a task goes away, we want to be able to recover all the storage
-- associated with its attributes. The Ada mechanism for this is finalization,
-- via controlled attribute types. For this reason, the ARM requires
-- finalization of attribute values when the associated task terminates.
-- This finalization must be triggered by the tasking runtime system, during
-- termination of the task. Given the active set of instantiations of
-- Ada.Task_Attributes is dynamic, the number and types of attributes
-- belonging to a task will not be known until the task actually terminates.
-- Some of these types may be controlled and some may not. The RTS must find
-- some way to determine which of these attributes need finalization, and
-- invoke the appropriate finalization on them.
-- One way this might be done is to create a special finalization chain for
-- each task, similar to the finalization chain that is used for controlled
-- objects within the task. This would differ from the usual finalization
-- chain in that it would not have a LIFO structure, since attributes may be
-- added to a task at any time during its lifetime. This might be the right
-- way to go for the longer term, but at present this approach is not open,
-- since GNAT does not provide such special finalization support.
-- Lacking special compiler support, the RTS is limited to the normal ways an
-- application invokes finalization, i.e.
-- a) Explicit call to the procedure Finalize, if we know the type has this
-- operation defined on it. This is not sufficient, since we have no way
-- of determining whether a given generic formal Attribute type is
-- controlled, and no visibility of the associated Finalize procedure, in
-- the generic body.
-- b) Leaving the scope of a local object of a controlled type. This does not
-- help, since the lifetime of an instantiation of Ada.Task_Attributes
-- does not correspond to the lifetimes of the various tasks which may
-- have that attribute.
-- c) Assignment of another value to the object. This would not help, since
-- we then have to finalize the new value of the object.
-- d) Unchecked deallocation of an object of a controlled type. This seems to
-- be the only mechanism available to the runtime system for finalization
-- of task attributes.
-- We considered two ways of using unchecked deallocation, both based on a
-- linked list of that would hang from the task control block.
-- In the first approach the objects on the attribute list are all derived
-- from one controlled type, say T, and are linked using an access type to
-- T'Class. The runtime system has an Unchecked_Deallocation for T'Class with
-- access type T'Class, and uses this to deallocate and finalize all the
-- items in the list. The limitation of this approach is that each
-- instantiation of the package Ada.Task_Attributes derives a new record
-- extension of T, and since T is controlled (RM 3.9.1 (3)), instantiation is
-- only allowed at the library level.
-- In the second approach the objects on the attribute list are of unrelated
-- but structurally similar types. Unchecked conversion is used to circument
-- Ada type checking. Each attribute-storage node contains not only the
-- attribute value and a link for chaining, but also a pointer to descriptor
-- for the corresponding instantiation of Task_Attributes. The instantiation
-- descriptor contains pointer to a procedure that can do the correct
-- deallocation and finalization for that type of attribute. On task
-- termination, the runtime system uses the pointer to call the appropriate
-- deallocator.
-- While this gets around the limitation that instantations be at the library
-- level, it relies on an implementation feature that may not always be safe,
-- i.e. that it is safe to call the Deallocate procedure for an instantiation
-- of Ada.Task_Attributes that no longer exists. In general, it seems this
-- might result in dangling references.
-- Another problem with instantiations deeper than the library level is that
-- there is risk of storage leakage, or dangling references to reused
-- storage. That is, if an instantiation of Ada.Task_Attributes is made
-- within a procedure, what happens to the storage allocated for attributes,
-- when the procedure call returns? Apparently (RM 7.6.1 (4)) any such
-- objects must be finalized, since they will no longer be accessible, and in
-- general one would expect that the storage they occupy would be recovered
-- for later reuse. (If not, we would have a case of storage leakage.)
-- Assuming the storage is recovered and later reused, we have potentially
-- dangerous dangling references. When the procedure containing the
-- instantiation of Ada.Task_Attributes returns, there may still be
-- unterminated tasks with associated attribute values for that instantiation.
-- When such tasks eventually terminate, the RTS will attempt to call the
-- Deallocate procedure on them. If the corresponding storage has already
-- been deallocated, when the master of the access type was left, we have a
-- potential disaster. This disaster is compounded since the pointer to
-- Deallocate is probably through a "trampoline" which will also have been
-- destroyed.
-- For this reason, we arrange to remove all dangling references before
-- leaving the scope of an instantiation. This is ugly, since it requires
-- traversing the list of all tasks, but it is no more ugly than a similar
-- traversal that we must do at the point of instantiation in order to
-- initialize the attributes of all tasks. At least we only need to do these
-- traversals if the type is controlled.
-- We chose to defer allocation of storage for attributes until the Reference
-- function is called or the attribute is first set to a value different from
-- the default initial one. This allows a potential savings in allocation,
-- for attributes that are not used by all tasks.
-- For efficiency, we reserve space in the TCB for a fixed number of
-- direct-access attributes. These are required to be of a size that fits in
-- the space of an object of type System.Address. Because we must use
-- unchecked bitwise copy operations on these values, they cannot be of a
-- controlled type, but that is covered automatically since controlled
-- objects are too large to fit in the spaces.
-- We originally deferred the initialization of these direct-access
-- attributes, just as we do for the indirect-access attributes, and used a
-- per-task bit vector to keep track of which attributes were currently
-- defined for that task. We found that the overhead of maintaining this
-- bit-vector seriously slowed down access to the attributes, and made the
-- fetch operation non-atomic, so that even to read an attribute value
-- required locking the TCB. Therefore, we now initialize such attributes for
-- all existing tasks at the time of the attribute instantiation, and
-- initialize existing attributes for each new task at the time it is
-- created.
-- The latter initialization requires a list of all the instantiation
-- descriptors. Updates to this list, as well as the bit-vector that is used
-- to reserve slots for attributes in the TCB, require mutual exclusion. That
-- is provided by the Lock/Unlock_RTS.
-- One special problem that added complexity to the design is that the
-- per-task list of indirect attributes contains objects of different types.
-- We use unchecked pointer conversion to link these nodes together and
-- access them, but the records may not have identical internal structure.
-- Initially, we thought it would be enough to allocate all the common
-- components of the records at the front of each record, so that their
-- positions would correspond. Unfortunately, GNAT adds "dope" information at
-- the front of a record, if the record contains any controlled-type
-- components.
--
-- This means that the offset of the fields we use to link the nodes is at
-- different positions on nodes of different types. To get around this, each
-- attribute storage record consists of a core node and wrapper. The core
-- nodes are all of the same type, and it is these that are linked together
-- and generally "seen" by the RTS. Each core node contains a pointer to its
-- own wrapper, which is a record that contains the core node along with an
-- attribute value, approximately as follows:
-- type Node;
-- type Node_Access is access all Node;
-- type Node_Access;
-- type Access_Wrapper is access all Wrapper;
-- type Node is record
-- Next : Node_Access;
-- ...
-- Wrapper : Access_Wrapper;
-- end record;
-- type Wrapper is record
-- Dummy_Node : aliased Node;
-- Value : aliased Attribute; -- the generic formal type
-- end record;
-- Another interesting problem is with the initialization of the
-- instantiation descriptors. Originally, we did this all via the Initialize
-- procedure of the descriptor type and code in the package body. It turned
-- out that the Initialize procedure needed quite a bit of information,
-- including the size of the attribute type, the initial value of the
-- attribute (if it fits in the TCB), and a pointer to the deallocator
-- procedure. These needed to be "passed" in via access discriminants. GNAT
-- was having trouble with access discriminants, so all this work was moved
-- to the package body.
with System.Error_Reporting;
-- Used for Shutdown;
with System.Storage_Elements;
-- Used for Integer_Address
with System.Task_Primitives.Operations;
-- Used for Write_Lock
-- Unlock
-- Lock/Unlock_RTS
with System.Tasking;
-- Used for Access_Address
-- Task_Id
-- Direct_Index_Vector
-- Direct_Index
with System.Tasking.Initialization;
-- Used for Defer_Abortion
-- Undefer_Abortion
-- Initialize_Attributes_Link
-- Finalize_Attributes_Link
with System.Tasking.Task_Attributes;
-- Used for Access_Node
-- Access_Dummy_Wrapper
-- Deallocator
-- Instance
-- Node
-- Access_Instance
with Ada.Exceptions;
-- Used for Raise_Exception
with Unchecked_Conversion;
with Unchecked_Deallocation;
pragma Elaborate_All (System.Tasking.Task_Attributes);
-- To ensure the initialization of object Local (below) will work
package body Ada.Task_Attributes is
use System.Error_Reporting,
System.Tasking.Initialization,
System.Tasking,
System.Tasking.Task_Attributes,
Ada.Exceptions;
use type System.Tasking.Access_Address;
package POP renames System.Task_Primitives.Operations;
---------------------------
-- Unchecked Conversions --
---------------------------
-- The following type corresponds to Dummy_Wrapper,
-- declared in System.Tasking.Task_Attributes.
type Wrapper;
type Access_Wrapper is access all Wrapper;
pragma Warnings (Off);
-- We turn warnings off for the following declarations of the
-- To_Attribute_Handle conversions, since these are used only for small
-- attributes where we know that there are no problems with alignment, but
-- the compiler will generate warnings for the occurrences in the large
-- attribute case, even though they will not actually be used.
function To_Attribute_Handle is new Unchecked_Conversion
(System.Address, Attribute_Handle);
function To_Direct_Attribute_Element is new Unchecked_Conversion
(System.Address, Direct_Attribute_Element);
-- For reference to directly addressed task attributes
type Access_Integer_Address is access all
System.Storage_Elements.Integer_Address;
function To_Attribute_Handle is new Unchecked_Conversion
(Access_Integer_Address, Attribute_Handle);
-- For reference to directly addressed task attributes
pragma Warnings (On);
-- End of warnings off region for directly addressed
-- attribute conversion functions.
function To_Access_Address is new Unchecked_Conversion
(Access_Node, Access_Address);
-- To store pointer to list of indirect attributes
pragma Warnings (Off);
function To_Access_Wrapper is new Unchecked_Conversion
(Access_Dummy_Wrapper, Access_Wrapper);
pragma Warnings (On);
-- To fetch pointer to actual wrapper of attribute node. We turn off
-- warnings since this may generate an alignment warning. The warning can
-- be ignored since Dummy_Wrapper is only a non-generic standin for the
-- real wrapper type (we never actually allocate objects of type
-- Dummy_Wrapper).
function To_Access_Dummy_Wrapper is new Unchecked_Conversion
(Access_Wrapper, Access_Dummy_Wrapper);
-- To store pointer to actual wrapper of attribute node
function To_Task_Id is new Unchecked_Conversion
(Task_Identification.Task_Id, Task_Id);
-- To access TCB of identified task
type Local_Deallocator is access procedure (P : in out Access_Node);
function To_Lib_Level_Deallocator is new Unchecked_Conversion
(Local_Deallocator, Deallocator);
-- To defeat accessibility check
pragma Warnings (On);
------------------------
-- Storage Management --
------------------------
procedure Deallocate (P : in out Access_Node);
-- Passed to the RTS via unchecked conversion of a pointer to
-- permit finalization and deallocation of attribute storage nodes
--------------------------
-- Instantiation Record --
--------------------------
Local : aliased Instance;
-- Initialized in package body
type Wrapper is record
Dummy_Node : aliased Node;
Value : aliased Attribute := Initial_Value;
-- The generic formal type, may be controlled
end record;
-- A number of unchecked conversions involving Wrapper_Access sources
-- are performed in this unit. We have to ensure that the designated
-- object is always strictly enough aligned.
for Wrapper'Alignment use Standard'Maximum_Alignment;
procedure Free is
new Unchecked_Deallocation (Wrapper, Access_Wrapper);
procedure Deallocate (P : in out Access_Node) is
T : Access_Wrapper := To_Access_Wrapper (P.Wrapper);
begin
Free (T);
end Deallocate;
---------------
-- Reference --
---------------
function Reference
(T : Task_Identification.Task_Id := Task_Identification.Current_Task)
return Attribute_Handle
is
TT : constant Task_Id := To_Task_Id (T);
Error_Message : constant String := "Trying to get the reference of a ";
begin
if TT = null then
Raise_Exception (Program_Error'Identity, Error_Message & "null task");
end if;
if TT.Common.State = Terminated then
Raise_Exception (Tasking_Error'Identity,
Error_Message & "terminated task");
end if;
-- Directly addressed case
if Local.Index /= 0 then
-- Return the attribute handle. Warnings off because this return
-- statement generates alignment warnings for large attributes
-- (but will never be executed in this case anyway).
pragma Warnings (Off);
return
To_Attribute_Handle (TT.Direct_Attributes (Local.Index)'Address);
pragma Warnings (On);
-- Not directly addressed
else
declare
P : Access_Node := To_Access_Node (TT.Indirect_Attributes);
W : Access_Wrapper;
Self_Id : constant Task_Id := POP.Self;
begin
Defer_Abort (Self_Id);
POP.Lock_RTS;
while P /= null loop
if P.Instance = Access_Instance'(Local'Unchecked_Access) then
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
return To_Access_Wrapper (P.Wrapper).Value'Access;
end if;
P := P.Next;
end loop;
-- Unlock the RTS here to follow the lock ordering rule
-- that prevent us from using new (i.e the Global_Lock) while
-- holding any other lock.
POP.Unlock_RTS;
W := new Wrapper'
((null, Local'Unchecked_Access, null), Initial_Value);
POP.Lock_RTS;
P := W.Dummy_Node'Unchecked_Access;
P.Wrapper := To_Access_Dummy_Wrapper (W);
P.Next := To_Access_Node (TT.Indirect_Attributes);
TT.Indirect_Attributes := To_Access_Address (P);
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
return W.Value'Access;
exception
when others =>
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
raise;
end;
end if;
pragma Assert (Shutdown ("Should never get here in Reference"));
return null;
exception
when Tasking_Error | Program_Error =>
raise;
when others =>
raise Program_Error;
end Reference;
------------------
-- Reinitialize --
------------------
procedure Reinitialize
(T : Task_Identification.Task_Id := Task_Identification.Current_Task)
is
TT : constant Task_Id := To_Task_Id (T);
Error_Message : constant String := "Trying to Reinitialize a ";
begin
if TT = null then
Raise_Exception (Program_Error'Identity, Error_Message & "null task");
end if;
if TT.Common.State = Terminated then
Raise_Exception (Tasking_Error'Identity,
Error_Message & "terminated task");
end if;
if Local.Index /= 0 then
Set_Value (Initial_Value, T);
else
declare
P, Q : Access_Node;
W : Access_Wrapper;
Self_Id : constant Task_Id := POP.Self;
begin
Defer_Abort (Self_Id);
POP.Lock_RTS;
Q := To_Access_Node (TT.Indirect_Attributes);
while Q /= null loop
if Q.Instance = Access_Instance'(Local'Unchecked_Access) then
if P = null then
TT.Indirect_Attributes := To_Access_Address (Q.Next);
else
P.Next := Q.Next;
end if;
W := To_Access_Wrapper (Q.Wrapper);
Free (W);
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
return;
end if;
P := Q;
Q := Q.Next;
end loop;
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
exception
when others =>
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
raise;
end;
end if;
exception
when Tasking_Error | Program_Error =>
raise;
when others =>
raise Program_Error;
end Reinitialize;
---------------
-- Set_Value --
---------------
procedure Set_Value
(Val : Attribute;
T : Task_Identification.Task_Id := Task_Identification.Current_Task)
is
TT : constant Task_Id := To_Task_Id (T);
Error_Message : constant String := "Trying to Set the Value of a ";
begin
if TT = null then
Raise_Exception (Program_Error'Identity, Error_Message & "null task");
end if;
if TT.Common.State = Terminated then
Raise_Exception (Tasking_Error'Identity,
Error_Message & "terminated task");
end if;
-- Directly addressed case
if Local.Index /= 0 then
-- Set attribute handle, warnings off, because this code can generate
-- alignment warnings with large attributes (but of course will not
-- be executed in this case, since we never have direct addressing in
-- such cases).
pragma Warnings (Off);
To_Attribute_Handle
(TT.Direct_Attributes (Local.Index)'Address).all := Val;
pragma Warnings (On);
return;
end if;
-- Not directly addressed
declare
P : Access_Node := To_Access_Node (TT.Indirect_Attributes);
W : Access_Wrapper;
Self_Id : constant Task_Id := POP.Self;
begin
Defer_Abort (Self_Id);
POP.Lock_RTS;
while P /= null loop
if P.Instance = Access_Instance'(Local'Unchecked_Access) then
To_Access_Wrapper (P.Wrapper).Value := Val;
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
return;
end if;
P := P.Next;
end loop;
-- Unlock RTS here to follow the lock ordering rule that prevent us
-- from using new (i.e the Global_Lock) while holding any other
-- lock.
POP.Unlock_RTS;
W := new Wrapper'((null, Local'Unchecked_Access, null), Val);
POP.Lock_RTS;
P := W.Dummy_Node'Unchecked_Access;
P.Wrapper := To_Access_Dummy_Wrapper (W);
P.Next := To_Access_Node (TT.Indirect_Attributes);
TT.Indirect_Attributes := To_Access_Address (P);
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
exception
when others =>
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
raise;
end;
exception
when Tasking_Error | Program_Error =>
raise;
when others =>
raise Program_Error;
end Set_Value;
-----------
-- Value --
-----------
function Value
(T : Task_Identification.Task_Id := Task_Identification.Current_Task)
return Attribute
is
TT : constant Task_Id := To_Task_Id (T);
Error_Message : constant String := "Trying to get the Value of a ";
begin
if TT = null then
Raise_Exception (Program_Error'Identity, Error_Message & "null task");
end if;
if TT.Common.State = Terminated then
Raise_Exception
(Program_Error'Identity, Error_Message & "terminated task");
end if;
-- Directly addressed case
if Local.Index /= 0 then
-- Get value of attribute. Warnings off, because for large
-- attributes, this code can generate alignment warnings. But of
-- course large attributes are never directly addressed so in fact
-- we will never execute the code in this case.
pragma Warnings (Off);
return To_Attribute_Handle
(TT.Direct_Attributes (Local.Index)'Address).all;
pragma Warnings (On);
end if;
-- Not directly addressed
declare
P : Access_Node;
Result : Attribute;
Self_Id : constant Task_Id := POP.Self;
begin
Defer_Abort (Self_Id);
POP.Lock_RTS;
P := To_Access_Node (TT.Indirect_Attributes);
while P /= null loop
if P.Instance = Access_Instance'(Local'Unchecked_Access) then
Result := To_Access_Wrapper (P.Wrapper).Value;
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
return Result;
end if;
P := P.Next;
end loop;
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
return Initial_Value;
exception
when others =>
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
raise;
end;
exception
when Tasking_Error | Program_Error =>
raise;
when others =>
raise Program_Error;
end Value;
-- Start of elaboration code for package Ada.Task_Attributes
begin
-- This unchecked conversion can give warnings when alignments
-- are incorrect, but they will not be used in such cases anyway,
-- so the warnings can be safely ignored.
pragma Warnings (Off);
Local.Deallocate := To_Lib_Level_Deallocator (Deallocate'Access);
pragma Warnings (On);
declare
Two_To_J : Direct_Index_Vector;
Self_Id : constant Task_Id := POP.Self;
begin
Defer_Abort (Self_Id);
-- Need protection for updating links to per-task initialization and
-- finalization routines, in case some task is being created or
-- terminated concurrently.
POP.Lock_RTS;
-- Add this instantiation to the list of all instantiations
Local.Next := System.Tasking.Task_Attributes.All_Attributes;
System.Tasking.Task_Attributes.All_Attributes :=
Local'Unchecked_Access;
-- Try to find space for the attribute in the TCB
Local.Index := 0;
Two_To_J := 1;
if Attribute'Size <= System.Address'Size then
for J in Direct_Index_Range loop
if (Two_To_J and In_Use) = 0 then
-- Reserve location J for this attribute
In_Use := In_Use or Two_To_J;
Local.Index := J;
-- This unchecked conversions can give a warning when the the
-- alignment is incorrect, but it will not be used in such a
-- case anyway, so the warning can be safely ignored.
pragma Warnings (Off);
To_Attribute_Handle (Local.Initial_Value'Access).all :=
Initial_Value;
pragma Warnings (On);
exit;
end if;
Two_To_J := Two_To_J * 2;
end loop;
end if;
-- Attribute goes directly in the TCB
if Local.Index /= 0 then
-- Replace stub for initialization routine that is called at task
-- creation.
Initialization.Initialize_Attributes_Link :=
System.Tasking.Task_Attributes.Initialize_Attributes'Access;
-- Initialize the attribute, for all tasks
declare
C : System.Tasking.Task_Id := System.Tasking.All_Tasks_List;
begin
while C /= null loop
C.Direct_Attributes (Local.Index) :=
To_Direct_Attribute_Element
(System.Storage_Elements.To_Address (Local.Initial_Value));
C := C.Common.All_Tasks_Link;
end loop;
end;
-- Attribute goes into a node onto a linked list
else
-- Replace stub for finalization routine that is called at task
-- termination.
Initialization.Finalize_Attributes_Link :=
System.Tasking.Task_Attributes.Finalize_Attributes'Access;
end if;
POP.Unlock_RTS;
Undefer_Abort (Self_Id);
end;
end Ada.Task_Attributes;
|
--- tools/configure/configure-tests-sqlite3.adb.orig 2015-05-13 12:17:27 UTC
+++ tools/configure/configure-tests-sqlite3.adb
@@ -87,7 +87,7 @@ package body Configure.Tests.SQLite3 is
(SQLite3_Library_Options,
+"""-L"
& Self.Switches.Libdir
- & """, ""-lsqlite3""");
+ & """, ""-Lsqlite3"", ""-Wl,-rpath,@PREFIX@/lib""");
Self.Report_Status ("yes (command line)");
@@ -126,6 +126,7 @@ package body Configure.Tests.SQLite3 is
Append (Opts, '"');
end loop;
+ Append (Opts, ", ""-Wl,-rpath,@PREFIX@/lib""");
Substitutions.Insert (SQLite3_Library_Options, Opts);
Self.Report_Status (+Opts);
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2015-2016, 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$
------------------------------------------------------------------------------
-- Routines to convert HTTP date to/from string according to RFC-2616
with League.Strings;
with League.Calendars;
package Matreshka.RFC2616_Dates is
pragma Preelaborate;
type Format is tagged private;
procedure From_String
(Self : Format;
Text : League.Strings.Universal_String;
Value : out League.Calendars.Date_Time;
Success : out Boolean);
function To_String
(Self : Format;
Value : League.Calendars.Date_Time)
return League.Strings.Universal_String;
private
function "+"
(Text : Wide_Wide_String) return League.Strings.Universal_String
renames League.Strings.To_Universal_String;
type Format is tagged record
Month_List : League.Strings.Universal_String
:= +" JanFebMarAprMayJunJulAugSepOctNovDec";
GMT : League.Strings.Universal_String := +"GMT";
Pattern : League.Strings.Universal_String
:= +"EEE, dd MMM yyyy HH:mm:ss ";
end record;
end Matreshka.RFC2616_Dates;
|
-- CD2A24E.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 IF A SIZE CLAUSE AND AN ENUMERATION
-- REPRESENTATION CLAUSE ARE GIVEN FOR AN ENUMERATION TYPE,
-- AND THE SMALLEST SIZE APPROPRIATE FOR AN UNSIGNED REPRESENTATION
-- IS SPECIFIED, THEN OPERATIONS ON THE TYPE ARE NOT AFFECTED.
-- HISTORY:
-- JET 08/19/87 CREATED ORIGINAL TEST.
-- PWB 05/11/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA'.
-- WMC 03/27/92 ELIMINATED TEST REDUNDANCIES.
WITH REPORT; USE REPORT;
PROCEDURE CD2A24E IS
BASIC_SIZE : CONSTANT := 3;
TYPE CHECK_TYPE IS (ZERO, ONE, TWO);
FOR CHECK_TYPE USE (ZERO => 3, ONE => 4,
TWO => 5);
FOR CHECK_TYPE'SIZE USE BASIC_SIZE;
C0 : CHECK_TYPE := ZERO;
C1 : CHECK_TYPE := ONE;
C2 : CHECK_TYPE := TWO;
TYPE ARRAY_TYPE IS ARRAY (0 .. 2) OF CHECK_TYPE;
CHARRAY : ARRAY_TYPE := (ZERO, ONE, TWO);
TYPE REC_TYPE IS RECORD
COMP0 : CHECK_TYPE := ZERO;
COMP1 : CHECK_TYPE := ONE;
COMP2 : CHECK_TYPE := TWO;
END RECORD;
CHREC : REC_TYPE;
FUNCTION IDENT (CH : CHECK_TYPE) RETURN CHECK_TYPE IS
BEGIN
IF EQUAL (3, 3) THEN
RETURN CH;
ELSE
RETURN ONE;
END IF;
END IDENT;
PROCEDURE PROC (CI0, CI2 : CHECK_TYPE;
CIO1, CIO2 : IN OUT CHECK_TYPE;
CO2 : OUT CHECK_TYPE) IS
BEGIN
IF NOT ((CI0 < IDENT (ONE)) AND
(IDENT (CI2) > IDENT (CIO1)) AND
(CIO1 <= IDENT (ONE)) AND(IDENT (TWO) = CI2)) THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL OPERATORS " &
"- 1");
END IF;
IF CHECK_TYPE'POS (CI0) /= IDENT_INT (0) OR
CHECK_TYPE'POS (CIO1) /= IDENT_INT (1) OR
CHECK_TYPE'POS (CI2) /= IDENT_INT (2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'POS - 1");
END IF;
IF CHECK_TYPE'SUCC (CI0) /= IDENT (CIO1) OR
CHECK_TYPE'SUCC (CIO1) /= IDENT (CI2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'SUCC - 1");
END IF;
IF CHECK_TYPE'IMAGE (CI0) /= IDENT_STR ("ZERO") OR
CHECK_TYPE'IMAGE (CIO1) /= IDENT_STR ("ONE") OR
CHECK_TYPE'IMAGE (CI2) /= IDENT_STR ("TWO") THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'IMAGE - 1");
END IF;
CO2 := TWO;
END PROC;
BEGIN
TEST ("CD2A24E", "CHECK THAT IF A SIZE CLAUSE AND AN ENUMERATION " &
"REPRESENTATION CLAUSE ARE GIVEN FOR AN " &
"ENUMERATION TYPE, AND THE SMALLEST SIZE " &
"APPROPRIATE FOR AN UNSIGNED REPRESENTATION " &
"IS SPECIFIED, THEN OPERATIONS ON THE TYPE " &
"ARE NOT AFFECTED");
PROC (ZERO, TWO, C1, C2, C2);
IF C1 /= ONE OR C2 /= TWO THEN
FAILED ("INCORRECT VALUE RETURNED BY PROCEDURE");
END IF;
IF CHECK_TYPE'SIZE /= IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'SIZE");
END IF;
IF C0'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR C0'SIZE");
END IF;
IF NOT ((IDENT (C1) IN C1 .. C2) AND
(C0 NOT IN IDENT (ONE) .. C2)) THEN
FAILED ("INCORRECT RESULTS FOR MEMBERSHIP OPERATORS - 2");
END IF;
IF CHECK_TYPE'FIRST /= IDENT (ZERO) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'FIRST - 2");
END IF;
IF CHECK_TYPE'VAL (0) /= IDENT (C0) OR
CHECK_TYPE'VAL (1) /= IDENT (C1) OR
CHECK_TYPE'VAL (2) /= IDENT (C2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'VAL - 2");
END IF;
IF CHECK_TYPE'PRED (C1) /= IDENT (C0) OR
CHECK_TYPE'PRED (C2) /= IDENT (C1) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'PRED - 2");
END IF;
IF CHECK_TYPE'VALUE ("ZERO") /= IDENT (C0) OR
CHECK_TYPE'VALUE ("ONE") /= IDENT (C1) OR
CHECK_TYPE'VALUE ("TWO") /= IDENT (C2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'VALUE - 2");
END IF;
IF CHARRAY(1)'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR CHARRAY(1)'SIZE");
END IF;
IF NOT ((CHARRAY (0) < IDENT (ONE)) AND
(IDENT (CHARRAY (2)) > IDENT (CHARRAY (1))) AND
(CHARRAY (1) <= IDENT (ONE)) AND
(IDENT (TWO) = CHARRAY (2))) THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL OPERATORS - 3");
END IF;
IF NOT ((IDENT (CHARRAY (1)) IN CHARRAY (1) .. CHARRAY (2)) AND
(CHARRAY (0) NOT IN IDENT (ONE) .. CHARRAY (2))) THEN
FAILED ("INCORRECT RESULTS FOR MEMBERSHIP OPERATORS - 3");
END IF;
IF CHECK_TYPE'POS (CHARRAY (0)) /= IDENT_INT (0) OR
CHECK_TYPE'POS (CHARRAY (1)) /= IDENT_INT (1) OR
CHECK_TYPE'POS (CHARRAY (2)) /= IDENT_INT (2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'POS - 3");
END IF;
IF CHECK_TYPE'SUCC (CHARRAY (0)) /= IDENT (CHARRAY (1)) OR
CHECK_TYPE'SUCC (CHARRAY (1)) /= IDENT (CHARRAY (2)) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'SUCC - 3");
END IF;
IF CHECK_TYPE'IMAGE (CHARRAY (0)) /= IDENT_STR ("ZERO") OR
CHECK_TYPE'IMAGE (CHARRAY (1)) /= IDENT_STR ("ONE") OR
CHECK_TYPE'IMAGE (CHARRAY (2)) /= IDENT_STR ("TWO") THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'IMAGE - 3");
END IF;
IF CHREC.COMP2'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR CHREC.COMP2'SIZE");
END IF;
IF NOT ((CHREC.COMP0 < IDENT (ONE)) AND
(IDENT (CHREC.COMP2) > IDENT (CHREC.COMP1)) AND
(CHREC.COMP1 <= IDENT (ONE)) AND
(IDENT (TWO) = CHREC.COMP2)) THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL OPERATORS - 4");
END IF;
IF NOT ((IDENT (CHREC.COMP1) IN CHREC.COMP1 .. CHREC.COMP2) AND
(CHREC.COMP0 NOT IN IDENT (ONE) .. CHREC.COMP2)) THEN
FAILED ("INCORRECT RESULTS FOR MEMBERSHIP OPERATORS - 4");
END IF;
IF CHECK_TYPE'VAL (0) /= IDENT (CHREC.COMP0) OR
CHECK_TYPE'VAL (1) /= IDENT (CHREC.COMP1) OR
CHECK_TYPE'VAL (2) /= IDENT (CHREC.COMP2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'VAL - 4");
END IF;
IF CHECK_TYPE'PRED (CHREC.COMP1) /= IDENT (CHREC.COMP0) OR
CHECK_TYPE'PRED (CHREC.COMP2) /= IDENT (CHREC.COMP1) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'PRED - 4");
END IF;
IF CHECK_TYPE'VALUE ("ZERO") /= IDENT (CHREC.COMP0) OR
CHECK_TYPE'VALUE ("ONE") /= IDENT (CHREC.COMP1) OR
CHECK_TYPE'VALUE ("TWO") /= IDENT (CHREC.COMP2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'VALUE - 4");
END IF;
RESULT;
END CD2A24E;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ A T T R --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Characters.Latin_1; use Ada.Characters.Latin_1;
with Aspects; use Aspects;
with Atree; use Atree;
with Casing; use Casing;
with Checks; use Checks;
with Debug; use Debug;
with Einfo; use Einfo;
with Elists; use Elists;
with Errout; use Errout;
with Eval_Fat;
with Exp_Dist; use Exp_Dist;
with Exp_Util; use Exp_Util;
with Expander; use Expander;
with Freeze; use Freeze;
with Gnatvsn; use Gnatvsn;
with Itypes; use Itypes;
with Lib; use Lib;
with Lib.Xref; use Lib.Xref;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Restrict; use Restrict;
with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sdefault;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Cat; use Sem_Cat;
with Sem_Ch6; use Sem_Ch6;
with Sem_Ch8; use Sem_Ch8;
with Sem_Ch10; use Sem_Ch10;
with Sem_Dim; use Sem_Dim;
with Sem_Dist; use Sem_Dist;
with Sem_Elab; use Sem_Elab;
with Sem_Elim; use Sem_Elim;
with Sem_Eval; use Sem_Eval;
with Sem_Prag; use Sem_Prag;
with Sem_Res; use Sem_Res;
with Sem_Type; use Sem_Type;
with Sem_Util; use Sem_Util;
with Sem_Warn;
with Stand; use Stand;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with System;
with Stringt; use Stringt;
with Style;
with Stylesw; use Stylesw;
with Targparm; use Targparm;
with Ttypes; use Ttypes;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
with Uname; use Uname;
with Urealp; use Urealp;
with System.CRC32; use System.CRC32;
package body Sem_Attr is
True_Value : constant Uint := Uint_1;
False_Value : constant Uint := Uint_0;
-- Synonyms to be used when these constants are used as Boolean values
Bad_Attribute : exception;
-- Exception raised if an error is detected during attribute processing,
-- used so that we can abandon the processing so we don't run into
-- trouble with cascaded errors.
-- The following array is the list of attributes defined in the Ada 83 RM.
-- In Ada 83 mode, these are the only recognized attributes. In other Ada
-- modes all these attributes are recognized, even if removed in Ada 95.
Attribute_83 : constant Attribute_Class_Array := Attribute_Class_Array'(
Attribute_Address |
Attribute_Aft |
Attribute_Alignment |
Attribute_Base |
Attribute_Callable |
Attribute_Constrained |
Attribute_Count |
Attribute_Delta |
Attribute_Digits |
Attribute_Emax |
Attribute_Epsilon |
Attribute_First |
Attribute_First_Bit |
Attribute_Fore |
Attribute_Image |
Attribute_Large |
Attribute_Last |
Attribute_Last_Bit |
Attribute_Leading_Part |
Attribute_Length |
Attribute_Machine_Emax |
Attribute_Machine_Emin |
Attribute_Machine_Mantissa |
Attribute_Machine_Overflows |
Attribute_Machine_Radix |
Attribute_Machine_Rounds |
Attribute_Mantissa |
Attribute_Pos |
Attribute_Position |
Attribute_Pred |
Attribute_Range |
Attribute_Safe_Emax |
Attribute_Safe_Large |
Attribute_Safe_Small |
Attribute_Size |
Attribute_Small |
Attribute_Storage_Size |
Attribute_Succ |
Attribute_Terminated |
Attribute_Val |
Attribute_Value |
Attribute_Width => True,
others => False);
-- The following array is the list of attributes defined in the Ada 2005
-- RM which are not defined in Ada 95. These are recognized in Ada 95 mode,
-- but in Ada 95 they are considered to be implementation defined.
Attribute_05 : constant Attribute_Class_Array := Attribute_Class_Array'(
Attribute_Machine_Rounding |
Attribute_Mod |
Attribute_Priority |
Attribute_Stream_Size |
Attribute_Wide_Wide_Width => True,
others => False);
-- The following array is the list of attributes defined in the Ada 2012
-- RM which are not defined in Ada 2005. These are recognized in Ada 95
-- and Ada 2005 modes, but are considered to be implementation defined.
Attribute_12 : constant Attribute_Class_Array := Attribute_Class_Array'(
Attribute_First_Valid |
Attribute_Has_Same_Storage |
Attribute_Last_Valid |
Attribute_Max_Alignment_For_Allocation => True,
others => False);
-- The following array is the list of attributes defined in the Ada 2020
-- RM which are not defined in Ada 2012. These are recognized in Ada
-- 95/2005/2012 modes, but are considered to be implementation defined.
Attribute_20 : constant Attribute_Class_Array := Attribute_Class_Array'(
Attribute_Enum_Rep |
Attribute_Enum_Val => True,
others => False);
-- The following array contains all attributes that imply a modification
-- of their prefixes or result in an access value. Such prefixes can be
-- considered as lvalues.
Attribute_Name_Implies_Lvalue_Prefix : constant Attribute_Class_Array :=
Attribute_Class_Array'(
Attribute_Access |
Attribute_Address |
Attribute_Input |
Attribute_Read |
Attribute_Unchecked_Access |
Attribute_Unrestricted_Access => True,
others => False);
-----------------------
-- Local_Subprograms --
-----------------------
procedure Eval_Attribute (N : Node_Id);
-- Performs compile time evaluation of attributes where possible, leaving
-- the Is_Static_Expression/Raises_Constraint_Error flags appropriately
-- set, and replacing the node with a literal node if the value can be
-- computed at compile time. All static attribute references are folded,
-- as well as a number of cases of non-static attributes that can always
-- be computed at compile time (e.g. floating-point model attributes that
-- are applied to non-static subtypes). Of course in such cases, the
-- Is_Static_Expression flag will not be set on the resulting literal.
-- Note that the only required action of this procedure is to catch the
-- static expression cases as described in the RM. Folding of other cases
-- is done where convenient, but some additional non-static folding is in
-- Expand_N_Attribute_Reference in cases where this is more convenient.
function Is_Anonymous_Tagged_Base
(Anon : Entity_Id;
Typ : Entity_Id) return Boolean;
-- For derived tagged types that constrain parent discriminants we build
-- an anonymous unconstrained base type. We need to recognize the relation
-- between the two when analyzing an access attribute for a constrained
-- component, before the full declaration for Typ has been analyzed, and
-- where therefore the prefix of the attribute does not match the enclosing
-- scope.
procedure Set_Boolean_Result (N : Node_Id; B : Boolean);
-- Rewrites node N with an occurrence of either Standard_False or
-- Standard_True, depending on the value of the parameter B. The
-- result is marked as a static expression.
-----------------------
-- Analyze_Attribute --
-----------------------
procedure Analyze_Attribute (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Aname : constant Name_Id := Attribute_Name (N);
P : constant Node_Id := Prefix (N);
Exprs : constant List_Id := Expressions (N);
Attr_Id : constant Attribute_Id := Get_Attribute_Id (Aname);
E1 : Node_Id;
E2 : Node_Id;
P_Type : Entity_Id := Empty;
-- Type of prefix after analysis
P_Base_Type : Entity_Id := Empty;
-- Base type of prefix after analysis
-----------------------
-- Local Subprograms --
-----------------------
procedure Address_Checks;
-- Semantic checks for valid use of Address attribute. This was made
-- a separate routine with the idea of using it for unrestricted access
-- which seems like it should follow the same rules, but that turned
-- out to be impractical. So now this is only used for Address.
procedure Analyze_Access_Attribute;
-- Used for Access, Unchecked_Access, Unrestricted_Access attributes.
-- Internally, Id distinguishes which of the three cases is involved.
procedure Analyze_Attribute_Old_Result
(Legal : out Boolean;
Spec_Id : out Entity_Id);
-- Common processing for attributes 'Old and 'Result. The routine checks
-- that the attribute appears in a postcondition-like aspect or pragma
-- associated with a suitable subprogram or a body. Flag Legal is set
-- when the above criteria are met. Spec_Id denotes the entity of the
-- subprogram [body] or Empty if the attribute is illegal.
procedure Analyze_Image_Attribute (Str_Typ : Entity_Id);
-- Common processing for attributes 'Img, 'Image, 'Wide_Image, and
-- 'Wide_Wide_Image. The routine checks that the prefix is valid and
-- sets the type of the attribute to the one specified by Str_Typ (e.g.
-- Standard_String for 'Image and Standard_Wide_String for 'Wide_Image).
procedure Bad_Attribute_For_Predicate;
-- Output error message for use of a predicate (First, Last, Range) not
-- allowed with a type that has predicates. If the type is a generic
-- actual, then the message is a warning, and we generate code to raise
-- program error with an appropriate reason. No error message is given
-- for internally generated uses of the attributes. This legality rule
-- only applies to scalar types.
procedure Check_Array_Or_Scalar_Type;
-- Common procedure used by First, Last, Range attribute to check
-- that the prefix is a constrained array or scalar type, or a name
-- of an array object, and that an argument appears only if appropriate
-- (i.e. only in the array case).
procedure Check_Array_Type;
-- Common semantic checks for all array attributes. Checks that the
-- prefix is a constrained array type or the name of an array object.
-- The error message for non-arrays is specialized appropriately.
procedure Check_Asm_Attribute;
-- Common semantic checks for Asm_Input and Asm_Output attributes
procedure Check_Component;
-- Common processing for Bit_Position, First_Bit, Last_Bit, and
-- Position. Checks prefix is an appropriate selected component.
procedure Check_Decimal_Fixed_Point_Type;
-- Check that prefix of attribute N is a decimal fixed-point type
procedure Check_Dereference;
-- If the prefix of attribute is an object of an access type, then
-- introduce an explicit dereference, and adjust P_Type accordingly.
procedure Check_Discrete_Type;
-- Verify that prefix of attribute N is a discrete type
procedure Check_E0;
-- Check that no attribute arguments are present
procedure Check_Either_E0_Or_E1;
-- Check that there are zero or one attribute arguments present
procedure Check_E1;
-- Check that exactly one attribute argument is present
procedure Check_E2;
-- Check that two attribute arguments are present
procedure Check_Enum_Image;
-- If the prefix type of 'Image is an enumeration type, set all its
-- literals as referenced, since the image function could possibly end
-- up referencing any of the literals indirectly. Same for Enum_Val.
-- Set the flag only if the reference is in the main code unit. Same
-- restriction when resolving 'Value; otherwise an improperly set
-- reference when analyzing an inlined body will lose a proper
-- warning on a useless with_clause.
procedure Check_First_Last_Valid;
-- Perform all checks for First_Valid and Last_Valid attributes
procedure Check_Fixed_Point_Type;
-- Verify that prefix of attribute N is a fixed type
procedure Check_Fixed_Point_Type_0;
-- Verify that prefix of attribute N is a fixed type and that
-- no attribute expressions are present.
procedure Check_Floating_Point_Type;
-- Verify that prefix of attribute N is a float type
procedure Check_Floating_Point_Type_0;
-- Verify that prefix of attribute N is a float type and that
-- no attribute expressions are present.
procedure Check_Floating_Point_Type_1;
-- Verify that prefix of attribute N is a float type and that
-- exactly one attribute expression is present.
procedure Check_Floating_Point_Type_2;
-- Verify that prefix of attribute N is a float type and that
-- two attribute expressions are present
procedure Check_Integer_Type;
-- Verify that prefix of attribute N is an integer type
procedure Check_Modular_Integer_Type;
-- Verify that prefix of attribute N is a modular integer type
procedure Check_Not_CPP_Type;
-- Check that P (the prefix of the attribute) is not an CPP type
-- for which no Ada predefined primitive is available.
procedure Check_Not_Incomplete_Type;
-- Check that P (the prefix of the attribute) is not an incomplete
-- type or a private type for which no full view has been given.
procedure Check_Object_Reference (P : Node_Id);
-- Check that P is an object reference
procedure Check_PolyORB_Attribute;
-- Validity checking for PolyORB/DSA attribute
procedure Check_Program_Unit;
-- Verify that prefix of attribute N is a program unit
procedure Check_Real_Type;
-- Verify that prefix of attribute N is fixed or float type
procedure Check_Scalar_Type;
-- Verify that prefix of attribute N is a scalar type
procedure Check_Standard_Prefix;
-- Verify that prefix of attribute N is package Standard. Also checks
-- that there are no arguments.
procedure Check_Stream_Attribute (Nam : TSS_Name_Type);
-- Validity checking for stream attribute. Nam is the TSS name of the
-- corresponding possible defined attribute function (e.g. for the
-- Read attribute, Nam will be TSS_Stream_Read).
procedure Check_Put_Image_Attribute;
-- Validity checking for Put_Image attribute
procedure Check_System_Prefix;
-- Verify that prefix of attribute N is package System
procedure Check_Task_Prefix;
-- Verify that prefix of attribute N is a task or task type
procedure Check_Type;
-- Verify that the prefix of attribute N is a type
procedure Check_Unit_Name (Nod : Node_Id);
-- Check that Nod is of the form of a library unit name, i.e that
-- it is an identifier, or a selected component whose prefix is
-- itself of the form of a library unit name. Note that this is
-- quite different from Check_Program_Unit, since it only checks
-- the syntactic form of the name, not the semantic identity. This
-- is because it is used with attributes (Elab_Body, Elab_Spec and
-- Elaborated) which can refer to non-visible unit.
procedure Error_Attr (Msg : String; Error_Node : Node_Id);
pragma No_Return (Error_Attr);
procedure Error_Attr;
pragma No_Return (Error_Attr);
-- Posts error using Error_Msg_N at given node, sets type of attribute
-- node to Any_Type, and then raises Bad_Attribute to avoid any further
-- semantic processing. The message typically contains a % insertion
-- character which is replaced by the attribute name. The call with
-- no arguments is used when the caller has already generated the
-- required error messages.
procedure Error_Attr_P (Msg : String);
pragma No_Return (Error_Attr_P);
-- Like Error_Attr, but error is posted at the start of the prefix
procedure Legal_Formal_Attribute;
-- Common processing for attributes Definite and Has_Discriminants.
-- Checks that prefix is generic indefinite formal type.
procedure Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements;
-- Common processing for attributes Max_Alignment_For_Allocation and
-- Max_Size_In_Storage_Elements.
procedure Min_Max;
-- Common processing for attributes Max and Min
procedure Standard_Attribute (Val : Int);
-- Used to process attributes whose prefix is package Standard which
-- yield values of type Universal_Integer. The attribute reference
-- node is rewritten with an integer literal of the given value which
-- is marked as static.
procedure Uneval_Old_Msg;
-- Called when Loop_Entry or Old is used in a potentially unevaluated
-- expression. Generates appropriate message or warning depending on
-- the setting of Opt.Uneval_Old (or flags in an N_Aspect_Specification
-- node in the aspect case).
procedure Unexpected_Argument (En : Node_Id);
pragma No_Return (Unexpected_Argument);
-- Signal unexpected attribute argument (En is the argument), and then
-- raises Bad_Attribute to avoid any further semantic processing.
procedure Validate_Non_Static_Attribute_Function_Call;
-- Called when processing an attribute that is a function call to a
-- non-static function, i.e. an attribute function that either takes
-- non-scalar arguments or returns a non-scalar result. Verifies that
-- such a call does not appear in a preelaborable context.
--------------------
-- Address_Checks --
--------------------
procedure Address_Checks is
begin
-- An Address attribute created by expansion is legal even when it
-- applies to other entity-denoting expressions.
if not Comes_From_Source (N) then
return;
-- Address attribute on a protected object self reference is legal
elsif Is_Protected_Self_Reference (P) then
return;
-- Address applied to an entity
elsif Is_Entity_Name (P) then
declare
Ent : constant Entity_Id := Entity (P);
begin
if Is_Subprogram (Ent) then
Set_Address_Taken (Ent);
Kill_Current_Values (Ent);
-- An Address attribute is accepted when generated by the
-- compiler for dispatching operation, and an error is
-- issued once the subprogram is frozen (to avoid confusing
-- errors about implicit uses of Address in the dispatch
-- table initialization).
if Has_Pragma_Inline_Always (Entity (P))
and then Comes_From_Source (P)
then
Error_Attr_P
("prefix of % attribute cannot be Inline_Always "
& "subprogram");
-- It is illegal to apply 'Address to an intrinsic
-- subprogram. This is now formalized in AI05-0095.
-- In an instance, an attempt to obtain 'Address of an
-- intrinsic subprogram (e.g the renaming of a predefined
-- operator that is an actual) raises Program_Error.
elsif Convention (Ent) = Convention_Intrinsic then
if In_Instance then
Rewrite (N,
Make_Raise_Program_Error (Loc,
Reason => PE_Address_Of_Intrinsic));
else
Error_Msg_Name_1 := Aname;
Error_Msg_N
("cannot take % of intrinsic subprogram", N);
end if;
-- Issue an error if prefix denotes an eliminated subprogram
else
Check_For_Eliminated_Subprogram (P, Ent);
end if;
-- Object or label reference
elsif Is_Object_Reference (P) or else Ekind (Ent) = E_Label then
Set_Address_Taken (Ent);
-- Deal with No_Implicit_Aliasing restriction
if Restriction_Check_Required (No_Implicit_Aliasing) then
if not Is_Aliased_View (P) then
Check_Restriction (No_Implicit_Aliasing, P);
else
Check_No_Implicit_Aliasing (P);
end if;
end if;
-- If we have an address of an object, and the attribute
-- comes from source, then set the object as potentially
-- source modified. We do this because the resulting address
-- can potentially be used to modify the variable and we
-- might not detect this, leading to some junk warnings.
Set_Never_Set_In_Source (Ent, False);
-- Allow Address to be applied to task or protected type,
-- returning null address (what is that about???)
elsif (Is_Concurrent_Type (Etype (Ent))
and then Etype (Ent) = Base_Type (Ent))
or else Ekind (Ent) = E_Package
or else Is_Generic_Unit (Ent)
then
Rewrite (N,
New_Occurrence_Of (RTE (RE_Null_Address), Sloc (N)));
-- Anything else is illegal
else
Error_Attr ("invalid prefix for % attribute", P);
end if;
end;
-- Object is OK
elsif Is_Object_Reference (P) then
return;
-- Subprogram called using dot notation
elsif Nkind (P) = N_Selected_Component
and then Is_Subprogram (Entity (Selector_Name (P)))
then
return;
-- What exactly are we allowing here ??? and is this properly
-- documented in the sinfo documentation for this node ???
elsif Relaxed_RM_Semantics
and then Nkind (P) = N_Attribute_Reference
then
return;
-- All other non-entity name cases are illegal
else
Error_Attr ("invalid prefix for % attribute", P);
end if;
end Address_Checks;
------------------------------
-- Analyze_Access_Attribute --
------------------------------
procedure Analyze_Access_Attribute is
Acc_Type : Entity_Id;
Scop : Entity_Id;
Typ : Entity_Id;
function Build_Access_Object_Type (DT : Entity_Id) return Entity_Id;
-- Build an access-to-object type whose designated type is DT,
-- and whose Ekind is appropriate to the attribute type. The
-- type that is constructed is returned as the result.
procedure Build_Access_Subprogram_Type (P : Node_Id);
-- Build an access to subprogram whose designated type is the type of
-- the prefix. If prefix is overloaded, so is the node itself. The
-- result is stored in Acc_Type.
function OK_Self_Reference return Boolean;
-- An access reference whose prefix is a type can legally appear
-- within an aggregate, where it is obtained by expansion of
-- a defaulted aggregate. The enclosing aggregate that contains
-- the self-referenced is flagged so that the self-reference can
-- be expanded into a reference to the target object (see exp_aggr).
------------------------------
-- Build_Access_Object_Type --
------------------------------
function Build_Access_Object_Type (DT : Entity_Id) return Entity_Id is
Typ : constant Entity_Id :=
New_Internal_Entity
(E_Access_Attribute_Type, Current_Scope, Loc, 'A');
begin
Set_Etype (Typ, Typ);
Set_Is_Itype (Typ);
Set_Associated_Node_For_Itype (Typ, N);
Set_Directly_Designated_Type (Typ, DT);
return Typ;
end Build_Access_Object_Type;
----------------------------------
-- Build_Access_Subprogram_Type --
----------------------------------
procedure Build_Access_Subprogram_Type (P : Node_Id) is
Index : Interp_Index;
It : Interp;
procedure Check_Local_Access (E : Entity_Id);
-- Deal with possible access to local subprogram. If we have such
-- an access, we set a flag to kill all tracked values on any call
-- because this access value may be passed around, and any called
-- code might use it to access a local procedure which clobbers a
-- tracked value. If the scope is a loop or block, indicate that
-- value tracking is disabled for the enclosing subprogram.
function Get_Convention (E : Entity_Id) return Convention_Id;
function Get_Kind (E : Entity_Id) return Entity_Kind;
-- Distinguish between access to regular/protected subprograms
------------------------
-- Check_Local_Access --
------------------------
procedure Check_Local_Access (E : Entity_Id) is
begin
if not Is_Library_Level_Entity (E) then
Set_Suppress_Value_Tracking_On_Call (Current_Scope);
Set_Suppress_Value_Tracking_On_Call
(Nearest_Dynamic_Scope (Current_Scope));
end if;
end Check_Local_Access;
--------------------
-- Get_Convention --
--------------------
function Get_Convention (E : Entity_Id) return Convention_Id is
begin
-- Restrict handling by_protected_procedure access subprograms
-- to source entities; required to avoid building access to
-- subprogram types with convention protected when building
-- dispatch tables.
if Comes_From_Source (P)
and then Is_By_Protected_Procedure (E)
then
return Convention_Protected;
else
return Convention (E);
end if;
end Get_Convention;
--------------
-- Get_Kind --
--------------
function Get_Kind (E : Entity_Id) return Entity_Kind is
begin
if Get_Convention (E) = Convention_Protected then
return E_Access_Protected_Subprogram_Type;
else
return E_Access_Subprogram_Type;
end if;
end Get_Kind;
-- Start of processing for Build_Access_Subprogram_Type
begin
-- In the case of an access to subprogram, use the name of the
-- subprogram itself as the designated type. Type-checking in
-- this case compares the signatures of the designated types.
-- Note: This fragment of the tree is temporarily malformed
-- because the correct tree requires an E_Subprogram_Type entity
-- as the designated type. In most cases this designated type is
-- later overridden by the semantics with the type imposed by the
-- context during the resolution phase. In the specific case of
-- the expression Address!(Prim'Unrestricted_Access), used to
-- initialize slots of dispatch tables, this work will be done by
-- the expander (see Exp_Aggr).
-- The reason to temporarily add this kind of node to the tree
-- instead of a proper E_Subprogram_Type itype, is the following:
-- in case of errors found in the source file we report better
-- error messages. For example, instead of generating the
-- following error:
-- "expected access to subprogram with profile
-- defined at line X"
-- we currently generate:
-- "expected access to function Z defined at line X"
Set_Etype (N, Any_Type);
if not Is_Overloaded (P) then
Check_Local_Access (Entity (P));
if not Is_Intrinsic_Subprogram (Entity (P)) then
Acc_Type := Create_Itype (Get_Kind (Entity (P)), N);
Set_Is_Public (Acc_Type, False);
Set_Etype (Acc_Type, Acc_Type);
Set_Convention (Acc_Type, Get_Convention (Entity (P)));
Set_Directly_Designated_Type (Acc_Type, Entity (P));
Set_Etype (N, Acc_Type);
Freeze_Before (N, Acc_Type);
end if;
else
Get_First_Interp (P, Index, It);
while Present (It.Nam) loop
Check_Local_Access (It.Nam);
if not Is_Intrinsic_Subprogram (It.Nam) then
Acc_Type := Create_Itype (Get_Kind (It.Nam), N);
Set_Is_Public (Acc_Type, False);
Set_Etype (Acc_Type, Acc_Type);
Set_Convention (Acc_Type, Get_Convention (It.Nam));
Set_Directly_Designated_Type (Acc_Type, It.Nam);
Add_One_Interp (N, Acc_Type, Acc_Type);
Freeze_Before (N, Acc_Type);
end if;
Get_Next_Interp (Index, It);
end loop;
end if;
-- Cannot be applied to intrinsic. Looking at the tests above,
-- the only way Etype (N) can still be set to Any_Type is if
-- Is_Intrinsic_Subprogram was True for some referenced entity.
if Etype (N) = Any_Type then
Error_Attr_P ("prefix of % attribute cannot be intrinsic");
end if;
end Build_Access_Subprogram_Type;
----------------------
-- OK_Self_Reference --
----------------------
function OK_Self_Reference return Boolean is
Par : Node_Id;
begin
Par := Parent (N);
while Present (Par)
and then
(Nkind (Par) = N_Component_Association
or else Nkind (Par) in N_Subexpr)
loop
if Nkind (Par) in N_Aggregate | N_Extension_Aggregate then
if Etype (Par) = Typ then
Set_Has_Self_Reference (Par);
-- Check the context: the aggregate must be part of the
-- initialization of a type or component, or it is the
-- resulting expansion in an initialization procedure.
if Is_Init_Proc (Current_Scope) then
return True;
else
Par := Parent (Par);
while Present (Par) loop
if Nkind (Par) = N_Full_Type_Declaration then
return True;
end if;
Par := Parent (Par);
end loop;
end if;
return False;
end if;
end if;
Par := Parent (Par);
end loop;
-- No enclosing aggregate, or not a self-reference
return False;
end OK_Self_Reference;
-- Start of processing for Analyze_Access_Attribute
begin
-- Access and Unchecked_Access are illegal in declare_expressions,
-- according to the RM. We also make the GNAT-specific
-- Unrestricted_Access attribute illegal.
if In_Declare_Expr > 0 then
Error_Attr ("% attribute cannot occur in a declare_expression", N);
end if;
Check_E0;
if Nkind (P) = N_Character_Literal then
Error_Attr_P
("prefix of % attribute cannot be enumeration literal");
end if;
-- Preserve relevant elaboration-related attributes of the context
-- which are no longer available or very expensive to recompute once
-- analysis, resolution, and expansion are over.
Mark_Elaboration_Attributes
(N_Id => N,
Checks => True,
Modes => True,
Warnings => True);
-- Save the scenario for later examination by the ABE Processing
-- phase.
Record_Elaboration_Scenario (N);
-- Case of access to subprogram
if Is_Entity_Name (P) and then Is_Overloadable (Entity (P)) then
if Has_Pragma_Inline_Always (Entity (P)) then
Error_Attr_P
("prefix of % attribute cannot be Inline_Always subprogram");
elsif Aname = Name_Unchecked_Access then
Error_Attr ("attribute% cannot be applied to a subprogram", P);
end if;
-- Issue an error if the prefix denotes an eliminated subprogram
Check_For_Eliminated_Subprogram (P, Entity (P));
-- Check for obsolescent subprogram reference
Check_Obsolescent_2005_Entity (Entity (P), P);
-- Build the appropriate subprogram type
Build_Access_Subprogram_Type (P);
-- For P'Access or P'Unrestricted_Access, where P is a nested
-- subprogram, we might be passing P to another subprogram (but we
-- don't check that here), which might call P. P could modify
-- local variables, so we need to kill current values. It is
-- important not to do this for library-level subprograms, because
-- Kill_Current_Values is very inefficient in the case of library
-- level packages with lots of tagged types.
if Is_Library_Level_Entity (Entity (Prefix (N))) then
null;
-- Do not kill values on nodes initializing dispatch tables
-- slots. The construct Prim_Ptr!(Prim'Unrestricted_Access)
-- is currently generated by the expander only for this
-- purpose. Done to keep the quality of warnings currently
-- generated by the compiler (otherwise any declaration of
-- a tagged type cleans constant indications from its scope).
elsif Nkind (Parent (N)) = N_Unchecked_Type_Conversion
and then (Etype (Parent (N)) = RTE (RE_Prim_Ptr)
or else
Etype (Parent (N)) = RTE (RE_Size_Ptr))
and then Is_Dispatching_Operation
(Directly_Designated_Type (Etype (N)))
then
null;
else
Kill_Current_Values;
end if;
-- In the static elaboration model, treat the attribute reference
-- as a subprogram call for elaboration purposes. Suppress this
-- treatment under debug flag. In any case, we are all done.
if Legacy_Elaboration_Checks
and not Dynamic_Elaboration_Checks
and not Debug_Flag_Dot_UU
then
Check_Elab_Call (N);
end if;
return;
-- Component is an operation of a protected type
elsif Nkind (P) = N_Selected_Component
and then Is_Overloadable (Entity (Selector_Name (P)))
then
if Ekind (Entity (Selector_Name (P))) = E_Entry then
Error_Attr_P ("prefix of % attribute must be subprogram");
end if;
Build_Access_Subprogram_Type (Selector_Name (P));
return;
end if;
-- Deal with incorrect reference to a type, but note that some
-- accesses are allowed: references to the current type instance,
-- or in Ada 2005 self-referential pointer in a default-initialized
-- aggregate.
if Is_Entity_Name (P) then
Typ := Entity (P);
-- The reference may appear in an aggregate that has been expanded
-- into a loop. Locate scope of type definition, if any.
Scop := Current_Scope;
while Ekind (Scop) = E_Loop loop
Scop := Scope (Scop);
end loop;
if Is_Type (Typ) then
-- OK if we are within the scope of a limited type
-- let's mark the component as having per object constraint
if Is_Anonymous_Tagged_Base (Scop, Typ) then
Typ := Scop;
Set_Entity (P, Typ);
Set_Etype (P, Typ);
end if;
if Typ = Scop then
declare
Q : Node_Id := Parent (N);
begin
while Present (Q)
and then Nkind (Q) /= N_Component_Declaration
loop
Q := Parent (Q);
end loop;
if Present (Q) then
Set_Has_Per_Object_Constraint
(Defining_Identifier (Q), True);
end if;
end;
if Nkind (P) = N_Expanded_Name then
Error_Msg_F
("current instance prefix must be a direct name", P);
end if;
-- If a current instance attribute appears in a component
-- constraint it must appear alone; other contexts (spec-
-- expressions, within a task body) are not subject to this
-- restriction.
if not In_Spec_Expression
and then not Has_Completion (Scop)
and then
Nkind (Parent (N)) not in
N_Discriminant_Association |
N_Index_Or_Discriminant_Constraint
then
Error_Msg_N
("current instance attribute must appear alone", N);
end if;
if Is_CPP_Class (Root_Type (Typ)) then
Error_Msg_N
("??current instance unsupported for derivations of "
& "'C'P'P types", N);
end if;
-- OK if we are in initialization procedure for the type
-- in question, in which case the reference to the type
-- is rewritten as a reference to the current object.
elsif Ekind (Scop) = E_Procedure
and then Is_Init_Proc (Scop)
and then Etype (First_Formal (Scop)) = Typ
then
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => Make_Identifier (Loc, Name_uInit),
Attribute_Name => Name_Unrestricted_Access));
Analyze (N);
return;
-- OK if a task type, this test needs sharpening up ???
elsif Is_Task_Type (Typ) then
null;
-- OK if self-reference in an aggregate in Ada 2005, and
-- the reference comes from a copied default expression.
-- Note that we check legality of self-reference even if the
-- expression comes from source, e.g. when a single component
-- association in an aggregate has a box association.
elsif Ada_Version >= Ada_2005
and then OK_Self_Reference
then
null;
-- OK if reference to current instance of a protected object
elsif Is_Protected_Self_Reference (P) then
null;
-- Otherwise we have an error case
else
Error_Attr ("% attribute cannot be applied to type", P);
return;
end if;
end if;
end if;
-- If we fall through, we have a normal access to object case
-- Unrestricted_Access is (for now) legal wherever an allocator would
-- be legal, so its Etype is set to E_Allocator. The expected type
-- of the other attributes is a general access type, and therefore
-- we label them with E_Access_Attribute_Type.
if not Is_Overloaded (P) then
Acc_Type := Build_Access_Object_Type (P_Type);
Set_Etype (N, Acc_Type);
else
declare
Index : Interp_Index;
It : Interp;
begin
Set_Etype (N, Any_Type);
Get_First_Interp (P, Index, It);
while Present (It.Typ) loop
Acc_Type := Build_Access_Object_Type (It.Typ);
Add_One_Interp (N, Acc_Type, Acc_Type);
Get_Next_Interp (Index, It);
end loop;
end;
end if;
-- Special cases when we can find a prefix that is an entity name
declare
PP : Node_Id;
Ent : Entity_Id;
begin
PP := P;
loop
if Is_Entity_Name (PP) then
Ent := Entity (PP);
-- If we have an access to an object, and the attribute
-- comes from source, then set the object as potentially
-- source modified. We do this because the resulting access
-- pointer can be used to modify the variable, and we might
-- not detect this, leading to some junk warnings.
-- We only do this for source references, since otherwise
-- we can suppress warnings, e.g. from the unrestricted
-- access generated for validity checks in -gnatVa mode.
if Comes_From_Source (N) then
Set_Never_Set_In_Source (Ent, False);
end if;
-- Mark entity as address taken in the case of
-- 'Unrestricted_Access or subprograms, and kill current
-- values.
if Aname = Name_Unrestricted_Access
or else Is_Subprogram (Ent)
then
Set_Address_Taken (Ent);
end if;
Kill_Current_Values (Ent);
exit;
elsif Nkind (PP) in N_Selected_Component | N_Indexed_Component
then
PP := Prefix (PP);
else
exit;
end if;
end loop;
end;
end Analyze_Access_Attribute;
----------------------------------
-- Analyze_Attribute_Old_Result --
----------------------------------
procedure Analyze_Attribute_Old_Result
(Legal : out Boolean;
Spec_Id : out Entity_Id)
is
procedure Check_Placement_In_Check (Prag : Node_Id);
-- Verify that the attribute appears within pragma Check that mimics
-- a postcondition.
procedure Check_Placement_In_Contract_Cases (Prag : Node_Id);
-- Verify that the attribute appears within a consequence of aspect
-- or pragma Contract_Cases denoted by Prag.
procedure Check_Placement_In_Test_Case (Prag : Node_Id);
-- Verify that the attribute appears within the "Ensures" argument of
-- aspect or pragma Test_Case denoted by Prag.
function Is_Within
(Nod : Node_Id;
Encl_Nod : Node_Id) return Boolean;
-- Subsidiary to Check_Placemenet_In_XXX. Determine whether arbitrary
-- node Nod is within enclosing node Encl_Nod.
procedure Placement_Error;
pragma No_Return (Placement_Error);
-- Emit a general error when the attributes does not appear in a
-- postcondition-like aspect or pragma, and then raises Bad_Attribute
-- to avoid any further semantic processing.
------------------------------
-- Check_Placement_In_Check --
------------------------------
procedure Check_Placement_In_Check (Prag : Node_Id) is
Args : constant List_Id := Pragma_Argument_Associations (Prag);
Nam : constant Name_Id := Chars (Get_Pragma_Arg (First (Args)));
begin
-- The "Name" argument of pragma Check denotes a postcondition
if Nam in Name_Post
| Name_Post_Class
| Name_Postcondition
| Name_Refined_Post
then
null;
-- Otherwise the placement of the attribute is illegal
else
Placement_Error;
end if;
end Check_Placement_In_Check;
---------------------------------------
-- Check_Placement_In_Contract_Cases --
---------------------------------------
procedure Check_Placement_In_Contract_Cases (Prag : Node_Id) is
Arg : Node_Id;
Cases : Node_Id;
CCase : Node_Id;
begin
-- Obtain the argument of the aspect or pragma
if Nkind (Prag) = N_Aspect_Specification then
Arg := Prag;
else
Arg := First (Pragma_Argument_Associations (Prag));
end if;
Cases := Expression (Arg);
if Present (Component_Associations (Cases)) then
CCase := First (Component_Associations (Cases));
while Present (CCase) loop
-- Detect whether the attribute appears within the
-- consequence of the current contract case.
if Nkind (CCase) = N_Component_Association
and then Is_Within (N, Expression (CCase))
then
return;
end if;
Next (CCase);
end loop;
end if;
-- Otherwise aspect or pragma Contract_Cases is either malformed
-- or the attribute does not appear within a consequence.
Error_Attr
("attribute % must appear in the consequence of a contract case",
P);
end Check_Placement_In_Contract_Cases;
----------------------------------
-- Check_Placement_In_Test_Case --
----------------------------------
procedure Check_Placement_In_Test_Case (Prag : Node_Id) is
Arg : constant Node_Id :=
Test_Case_Arg
(Prag => Prag,
Arg_Nam => Name_Ensures,
From_Aspect => Nkind (Prag) = N_Aspect_Specification);
begin
-- Detect whether the attribute appears within the "Ensures"
-- expression of aspect or pragma Test_Case.
if Present (Arg) and then Is_Within (N, Arg) then
null;
else
Error_Attr
("attribute % must appear in the ensures expression of a "
& "test case", P);
end if;
end Check_Placement_In_Test_Case;
---------------
-- Is_Within --
---------------
function Is_Within
(Nod : Node_Id;
Encl_Nod : Node_Id) return Boolean
is
Par : Node_Id;
begin
Par := Nod;
while Present (Par) loop
if Par = Encl_Nod then
return True;
-- Prevent the search from going too far
elsif Is_Body_Or_Package_Declaration (Par) then
exit;
end if;
Par := Parent (Par);
end loop;
return False;
end Is_Within;
---------------------
-- Placement_Error --
---------------------
procedure Placement_Error is
begin
if Aname = Name_Old then
Error_Attr ("attribute % can only appear in postcondition", P);
-- Specialize the error message for attribute 'Result
else
Error_Attr
("attribute % can only appear in postcondition of function",
P);
end if;
end Placement_Error;
-- Local variables
Prag : Node_Id;
Prag_Nam : Name_Id;
Subp_Decl : Node_Id;
-- Start of processing for Analyze_Attribute_Old_Result
begin
-- Assume that the attribute is illegal
Legal := False;
Spec_Id := Empty;
-- Traverse the parent chain to find the aspect or pragma where the
-- attribute resides.
Prag := N;
while Present (Prag) loop
if Nkind (Prag) in N_Aspect_Specification | N_Pragma then
exit;
-- Prevent the search from going too far
elsif Is_Body_Or_Package_Declaration (Prag) then
exit;
end if;
Prag := Parent (Prag);
end loop;
-- The attribute is allowed to appear only in postcondition-like
-- aspects or pragmas.
if Nkind (Prag) in N_Aspect_Specification | N_Pragma then
if Nkind (Prag) = N_Aspect_Specification then
Prag_Nam := Chars (Identifier (Prag));
else
Prag_Nam := Pragma_Name (Prag);
end if;
if Prag_Nam = Name_Check then
Check_Placement_In_Check (Prag);
elsif Prag_Nam = Name_Contract_Cases then
Check_Placement_In_Contract_Cases (Prag);
-- Attribute 'Result is allowed to appear in aspect or pragma
-- [Refined_]Depends (SPARK RM 6.1.5(11)).
elsif Prag_Nam in Name_Depends | Name_Refined_Depends
and then Aname = Name_Result
then
null;
-- Attribute 'Result is allowed to appear in aspect
-- Relaxed_Initialization (SPARK RM 6.10).
elsif Prag_Nam = Name_Relaxed_Initialization
and then Aname = Name_Result
then
null;
elsif Prag_Nam in Name_Post
| Name_Post_Class
| Name_Postcondition
| Name_Refined_Post
then
null;
elsif Prag_Nam = Name_Test_Case then
Check_Placement_In_Test_Case (Prag);
else
Placement_Error;
return;
end if;
-- Otherwise the placement of the attribute is illegal
else
Placement_Error;
return;
end if;
-- Find the related subprogram subject to the aspect or pragma
if Nkind (Prag) = N_Aspect_Specification then
Subp_Decl := Parent (Prag);
else
Subp_Decl := Find_Related_Declaration_Or_Body (Prag);
end if;
-- The aspect or pragma where the attribute resides should be
-- associated with a subprogram declaration or a body. If this is not
-- the case, then the aspect or pragma is illegal. Return as analysis
-- cannot be carried out. Note that it is legal to have the aspect
-- appear on a subprogram renaming, when the renamed entity is an
-- attribute reference.
-- Generating C code the internally built nested _postcondition
-- subprograms are inlined; after expanded, inlined aspects are
-- located in the internal block generated by the frontend.
if Nkind (Subp_Decl) = N_Block_Statement
and then Modify_Tree_For_C
and then In_Inlined_Body
then
null;
elsif Nkind (Subp_Decl) not in N_Abstract_Subprogram_Declaration
| N_Entry_Declaration
| N_Expression_Function
| N_Generic_Subprogram_Declaration
| N_Subprogram_Body
| N_Subprogram_Body_Stub
| N_Subprogram_Declaration
| N_Subprogram_Renaming_Declaration
then
return;
end if;
-- If we get here, then the attribute is legal
Legal := True;
Spec_Id := Unique_Defining_Entity (Subp_Decl);
-- When generating C code, nested _postcondition subprograms are
-- inlined by the front end to avoid problems (when unnested) with
-- referenced itypes. Handle that here, since as part of inlining the
-- expander nests subprogram within a dummy procedure named _parent
-- (see Build_Postconditions_Procedure and Build_Body_To_Inline).
-- Hence, in this context, the spec_id of _postconditions is the
-- enclosing scope.
if Modify_Tree_For_C
and then Chars (Spec_Id) = Name_uParent
and then Chars (Scope (Spec_Id)) = Name_uPostconditions
then
-- This situation occurs only when preanalyzing the inlined body
pragma Assert (not Full_Analysis);
Spec_Id := Scope (Spec_Id);
pragma Assert (Is_Inlined (Spec_Id));
end if;
end Analyze_Attribute_Old_Result;
-----------------------------
-- Analyze_Image_Attribute --
-----------------------------
procedure Analyze_Image_Attribute (Str_Typ : Entity_Id) is
procedure Check_Image_Type (Image_Type : Entity_Id);
-- Check that Image_Type is legal as the type of a prefix of 'Image.
-- Legality depends on the Ada language version.
procedure Check_Image_Type (Image_Type : Entity_Id) is
begin
if Ada_Version < Ada_2020
and then not Is_Scalar_Type (Image_Type)
then
Error_Msg_Ada_2020_Feature ("|nonscalar ''Image", Sloc (P));
Error_Attr;
end if;
end Check_Image_Type;
-- Start of processing for Analyze_Image_Attribute
begin
-- AI12-0124: The ARG has adopted the GNAT semantics of 'Img for
-- scalar types, so that the prefix can be an object, a named value,
-- or a type. If the prefix is an object, there is no argument.
if Is_Object_Image (P) then
Check_E0;
Set_Etype (N, Str_Typ);
Check_Image_Type (Etype (P));
if Attr_Id /= Attribute_Img and then Ada_Version < Ada_2012 then
Error_Msg_Ada_2012_Feature ("|Object''Image", Sloc (P));
end if;
else
Check_E1;
Set_Etype (N, Str_Typ);
-- ???It's not clear why 'Img should behave any differently than
-- 'Image.
if Attr_Id = Attribute_Img then
Error_Attr_P
("prefix of % attribute must be a scalar object name");
end if;
pragma Assert (Is_Entity_Name (P) and then Is_Type (Entity (P)));
if Ekind (Entity (P)) = E_Incomplete_Type
and then Present (Full_View (Entity (P)))
then
P_Type := Full_View (Entity (P));
P_Base_Type := Base_Type (P_Type);
Set_Entity (P, P_Type);
end if;
Check_Image_Type (P_Type);
Resolve (E1, P_Base_Type);
Validate_Non_Static_Attribute_Function_Call;
end if;
Check_Enum_Image;
-- Check restriction No_Fixed_IO. Note the check of Comes_From_Source
-- to avoid giving a duplicate message for when Image attributes
-- applied to object references get expanded into type-based Image
-- attributes.
if Restriction_Check_Required (No_Fixed_IO)
and then Comes_From_Source (N)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
end Analyze_Image_Attribute;
---------------------------------
-- Bad_Attribute_For_Predicate --
---------------------------------
procedure Bad_Attribute_For_Predicate is
begin
if Is_Scalar_Type (P_Type)
and then Comes_From_Source (N)
then
Error_Msg_Name_1 := Aname;
Bad_Predicated_Subtype_Use
("type& has predicates, attribute % not allowed", N, P_Type);
end if;
end Bad_Attribute_For_Predicate;
--------------------------------
-- Check_Array_Or_Scalar_Type --
--------------------------------
procedure Check_Array_Or_Scalar_Type is
function In_Aspect_Specification return Boolean;
-- A current instance of a type in an aspect specification is an
-- object and not a type, and therefore cannot be of a scalar type
-- in the prefix of one of the array attributes if the attribute
-- reference is part of an aspect expression.
-----------------------------
-- In_Aspect_Specification --
-----------------------------
function In_Aspect_Specification return Boolean is
P : Node_Id;
begin
P := Parent (N);
while Present (P) loop
if Nkind (P) = N_Aspect_Specification then
return P_Type = Entity (P);
elsif Nkind (P) in N_Declaration then
return False;
end if;
P := Parent (P);
end loop;
return False;
end In_Aspect_Specification;
-- Local variables
Dims : Int;
Index : Entity_Id;
-- Start of processing for Check_Array_Or_Scalar_Type
begin
-- Case of string literal or string literal subtype. These cases
-- cannot arise from legal Ada code, but the expander is allowed
-- to generate them. They require special handling because string
-- literal subtypes do not have standard bounds (the whole idea
-- of these subtypes is to avoid having to generate the bounds)
if Ekind (P_Type) = E_String_Literal_Subtype then
Set_Etype (N, Etype (First_Index (P_Base_Type)));
return;
-- Scalar types
elsif Is_Scalar_Type (P_Type) then
Check_Type;
if Present (E1) then
Error_Attr ("invalid argument in % attribute", E1);
elsif In_Aspect_Specification then
Error_Attr
("prefix of % attribute cannot be the current instance of a "
& "scalar type", P);
else
Set_Etype (N, P_Base_Type);
return;
end if;
-- The following is a special test to allow 'First to apply to
-- private scalar types if the attribute comes from generated
-- code. This occurs in the case of Normalize_Scalars code.
elsif Is_Private_Type (P_Type)
and then Present (Full_View (P_Type))
and then Is_Scalar_Type (Full_View (P_Type))
and then not Comes_From_Source (N)
then
Set_Etype (N, Implementation_Base_Type (P_Type));
-- Array types other than string literal subtypes handled above
else
Check_Array_Type;
-- We know prefix is an array type, or the name of an array
-- object, and that the expression, if present, is static
-- and within the range of the dimensions of the type.
pragma Assert (Is_Array_Type (P_Type));
Index := First_Index (P_Base_Type);
if No (E1) then
-- First dimension assumed
Set_Etype (N, Base_Type (Etype (Index)));
else
Dims := UI_To_Int (Intval (E1));
for J in 1 .. Dims - 1 loop
Next_Index (Index);
end loop;
Set_Etype (N, Base_Type (Etype (Index)));
Set_Etype (E1, Standard_Integer);
end if;
end if;
end Check_Array_Or_Scalar_Type;
----------------------
-- Check_Array_Type --
----------------------
procedure Check_Array_Type is
D : Int;
-- Dimension number for array attributes
begin
-- If the type is a string literal type, then this must be generated
-- internally, and no further check is required on its legality.
if Ekind (P_Type) = E_String_Literal_Subtype then
return;
-- If the type is a composite, it is an illegal aggregate, no point
-- in going on.
elsif P_Type = Any_Composite then
raise Bad_Attribute;
end if;
-- Normal case of array type or subtype. Note that if the
-- prefix is a current instance of a type declaration it
-- appears within an aspect specification and is legal.
Check_Either_E0_Or_E1;
Check_Dereference;
if Is_Array_Type (P_Type) then
if not Is_Constrained (P_Type)
and then Is_Entity_Name (P)
and then Is_Type (Entity (P))
and then not Is_Current_Instance (P)
then
-- Note: we do not call Error_Attr here, since we prefer to
-- continue, using the relevant index type of the array,
-- even though it is unconstrained. This gives better error
-- recovery behavior.
Error_Msg_Name_1 := Aname;
Error_Msg_F
("prefix for % attribute must be constrained array", P);
end if;
-- The attribute reference freezes the type, and thus the
-- component type, even if the attribute may not depend on the
-- component. Diagnose arrays with incomplete components now.
-- If the prefix is an access to array, this does not freeze
-- the designated type.
if Nkind (P) /= N_Explicit_Dereference then
Check_Fully_Declared (Component_Type (P_Type), P);
end if;
D := Number_Dimensions (P_Type);
else
if Is_Private_Type (P_Type) then
Error_Attr_P ("prefix for % attribute may not be private type");
elsif Is_Access_Type (P_Type)
and then Is_Array_Type (Designated_Type (P_Type))
and then Is_Entity_Name (P)
and then Is_Type (Entity (P))
then
Error_Attr_P ("prefix of % attribute cannot be access type");
elsif Attr_Id = Attribute_First
or else
Attr_Id = Attribute_Last
then
Error_Attr ("invalid prefix for % attribute", P);
else
Error_Attr_P ("prefix for % attribute must be array");
end if;
end if;
if Present (E1) then
Resolve (E1, Any_Integer);
Set_Etype (E1, Standard_Integer);
if not Is_OK_Static_Expression (E1)
or else Raises_Constraint_Error (E1)
then
Flag_Non_Static_Expr
("expression for dimension must be static!", E1);
Error_Attr;
elsif UI_To_Int (Expr_Value (E1)) > D
or else UI_To_Int (Expr_Value (E1)) < 1
then
Error_Attr ("invalid dimension number for array type", E1);
end if;
end if;
if (Style_Check and Style_Check_Array_Attribute_Index)
and then Comes_From_Source (N)
then
Style.Check_Array_Attribute_Index (N, E1, D);
end if;
end Check_Array_Type;
-------------------------
-- Check_Asm_Attribute --
-------------------------
procedure Check_Asm_Attribute is
begin
Check_Type;
Check_E2;
-- Check first argument is static string expression
Analyze_And_Resolve (E1, Standard_String);
if Etype (E1) = Any_Type then
return;
elsif not Is_OK_Static_Expression (E1) then
Flag_Non_Static_Expr
("constraint argument must be static string expression!", E1);
Error_Attr;
end if;
-- Check second argument is right type
Analyze_And_Resolve (E2, Entity (P));
-- Note: that is all we need to do, we don't need to check
-- that it appears in a correct context. The Ada type system
-- will do that for us.
end Check_Asm_Attribute;
---------------------
-- Check_Component --
---------------------
procedure Check_Component is
begin
Check_E0;
if Nkind (P) /= N_Selected_Component
or else
(Ekind (Entity (Selector_Name (P))) /= E_Component
and then
Ekind (Entity (Selector_Name (P))) /= E_Discriminant)
then
Error_Attr_P ("prefix for % attribute must be selected component");
end if;
end Check_Component;
------------------------------------
-- Check_Decimal_Fixed_Point_Type --
------------------------------------
procedure Check_Decimal_Fixed_Point_Type is
begin
Check_Type;
if not Is_Decimal_Fixed_Point_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be decimal type");
end if;
end Check_Decimal_Fixed_Point_Type;
-----------------------
-- Check_Dereference --
-----------------------
procedure Check_Dereference is
begin
-- Case of a subtype mark
if Is_Entity_Name (P) and then Is_Type (Entity (P)) then
return;
end if;
-- Case of an expression
Resolve (P);
if Is_Access_Type (P_Type) then
-- If there is an implicit dereference, then we must freeze the
-- designated type of the access type, since the type of the
-- referenced array is this type (see AI95-00106).
-- As done elsewhere, freezing must not happen when preanalyzing
-- a pre- or postcondition or a default value for an object or for
-- a formal parameter.
if not In_Spec_Expression then
Freeze_Before (N, Designated_Type (P_Type));
end if;
Rewrite (P,
Make_Explicit_Dereference (Sloc (P),
Prefix => Relocate_Node (P)));
Analyze_And_Resolve (P);
P_Type := Etype (P);
if P_Type = Any_Type then
raise Bad_Attribute;
end if;
P_Base_Type := Base_Type (P_Type);
end if;
end Check_Dereference;
-------------------------
-- Check_Discrete_Type --
-------------------------
procedure Check_Discrete_Type is
begin
Check_Type;
if not Is_Discrete_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be discrete type");
end if;
end Check_Discrete_Type;
--------------
-- Check_E0 --
--------------
procedure Check_E0 is
begin
if Present (E1) then
Unexpected_Argument (E1);
end if;
end Check_E0;
--------------
-- Check_E1 --
--------------
procedure Check_E1 is
begin
Check_Either_E0_Or_E1;
if No (E1) then
-- Special-case attributes that are functions and that appear as
-- the prefix of another attribute. Error is posted on parent.
if Nkind (Parent (N)) = N_Attribute_Reference
and then Attribute_Name (Parent (N)) in Name_Address
| Name_Code_Address
| Name_Access
then
Error_Msg_Name_1 := Attribute_Name (Parent (N));
Error_Msg_N ("illegal prefix for % attribute", Parent (N));
Set_Etype (Parent (N), Any_Type);
Set_Entity (Parent (N), Any_Type);
raise Bad_Attribute;
else
Error_Attr ("missing argument for % attribute", N);
end if;
end if;
end Check_E1;
--------------
-- Check_E2 --
--------------
procedure Check_E2 is
begin
if No (E1) then
Error_Attr ("missing arguments for % attribute (2 required)", N);
elsif No (E2) then
Error_Attr ("missing argument for % attribute (2 required)", N);
end if;
end Check_E2;
---------------------------
-- Check_Either_E0_Or_E1 --
---------------------------
procedure Check_Either_E0_Or_E1 is
begin
if Present (E2) then
Unexpected_Argument (E2);
end if;
end Check_Either_E0_Or_E1;
----------------------
-- Check_Enum_Image --
----------------------
procedure Check_Enum_Image is
Lit : Entity_Id;
begin
-- When an enumeration type appears in an attribute reference, all
-- literals of the type are marked as referenced. This must only be
-- done if the attribute reference appears in the current source.
-- Otherwise the information on references may differ between a
-- normal compilation and one that performs inlining.
if Is_Enumeration_Type (P_Base_Type)
and then In_Extended_Main_Code_Unit (N)
then
Lit := First_Literal (P_Base_Type);
while Present (Lit) loop
Set_Referenced (Lit);
Next_Literal (Lit);
end loop;
end if;
end Check_Enum_Image;
----------------------------
-- Check_First_Last_Valid --
----------------------------
procedure Check_First_Last_Valid is
begin
Check_Discrete_Type;
-- Freeze the subtype now, so that the following test for predicates
-- works (we set the predicates stuff up at freeze time)
Insert_Actions (N, Freeze_Entity (P_Type, P));
-- Now test for dynamic predicate
if Has_Predicates (P_Type)
and then not (Has_Static_Predicate (P_Type))
then
Error_Attr_P
("prefix of % attribute may not have dynamic predicate");
end if;
-- Check non-static subtype
if not Is_OK_Static_Subtype (P_Type) then
Error_Attr_P ("prefix of % attribute must be a static subtype");
end if;
-- Test case for no values
if Expr_Value (Type_Low_Bound (P_Type)) >
Expr_Value (Type_High_Bound (P_Type))
or else (Has_Predicates (P_Type)
and then
Is_Empty_List (Static_Discrete_Predicate (P_Type)))
then
Error_Attr_P
("prefix of % attribute must be subtype with at least one "
& "value");
end if;
end Check_First_Last_Valid;
----------------------------
-- Check_Fixed_Point_Type --
----------------------------
procedure Check_Fixed_Point_Type is
begin
Check_Type;
if not Is_Fixed_Point_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be fixed point type");
end if;
end Check_Fixed_Point_Type;
------------------------------
-- Check_Fixed_Point_Type_0 --
------------------------------
procedure Check_Fixed_Point_Type_0 is
begin
Check_Fixed_Point_Type;
Check_E0;
end Check_Fixed_Point_Type_0;
-------------------------------
-- Check_Floating_Point_Type --
-------------------------------
procedure Check_Floating_Point_Type is
begin
Check_Type;
if not Is_Floating_Point_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be float type");
end if;
end Check_Floating_Point_Type;
---------------------------------
-- Check_Floating_Point_Type_0 --
---------------------------------
procedure Check_Floating_Point_Type_0 is
begin
Check_Floating_Point_Type;
Check_E0;
end Check_Floating_Point_Type_0;
---------------------------------
-- Check_Floating_Point_Type_1 --
---------------------------------
procedure Check_Floating_Point_Type_1 is
begin
Check_Floating_Point_Type;
Check_E1;
end Check_Floating_Point_Type_1;
---------------------------------
-- Check_Floating_Point_Type_2 --
---------------------------------
procedure Check_Floating_Point_Type_2 is
begin
Check_Floating_Point_Type;
Check_E2;
end Check_Floating_Point_Type_2;
------------------------
-- Check_Integer_Type --
------------------------
procedure Check_Integer_Type is
begin
Check_Type;
if not Is_Integer_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be integer type");
end if;
end Check_Integer_Type;
--------------------------------
-- Check_Modular_Integer_Type --
--------------------------------
procedure Check_Modular_Integer_Type is
begin
Check_Type;
if not Is_Modular_Integer_Type (P_Type) then
Error_Attr_P
("prefix of % attribute must be modular integer type");
end if;
end Check_Modular_Integer_Type;
------------------------
-- Check_Not_CPP_Type --
------------------------
procedure Check_Not_CPP_Type is
begin
if Is_Tagged_Type (Etype (P))
and then Convention (Etype (P)) = Convention_CPP
and then Is_CPP_Class (Root_Type (Etype (P)))
then
Error_Attr_P
("invalid use of % attribute with 'C'P'P tagged type");
end if;
end Check_Not_CPP_Type;
-------------------------------
-- Check_Not_Incomplete_Type --
-------------------------------
procedure Check_Not_Incomplete_Type is
E : Entity_Id;
Typ : Entity_Id;
begin
-- Ada 2005 (AI-50217, AI-326): If the prefix is an explicit
-- dereference we have to check wrong uses of incomplete types
-- (other wrong uses are checked at their freezing point).
-- In Ada 2012, incomplete types can appear in subprogram
-- profiles, but formals with incomplete types cannot be the
-- prefix of attributes.
-- Example 1: Limited-with
-- limited with Pkg;
-- package P is
-- type Acc is access Pkg.T;
-- X : Acc;
-- S : Integer := X.all'Size; -- ERROR
-- end P;
-- Example 2: Tagged incomplete
-- type T is tagged;
-- type Acc is access all T;
-- X : Acc;
-- S : constant Integer := X.all'Size; -- ERROR
-- procedure Q (Obj : Integer := X.all'Alignment); -- ERROR
if Ada_Version >= Ada_2005
and then Nkind (P) = N_Explicit_Dereference
then
E := P;
while Nkind (E) = N_Explicit_Dereference loop
E := Prefix (E);
end loop;
Typ := Etype (E);
if From_Limited_With (Typ) then
Error_Attr_P
("prefix of % attribute cannot be an incomplete type");
-- If the prefix is an access type check the designated type
elsif Is_Access_Type (Typ)
and then Nkind (P) = N_Explicit_Dereference
then
Typ := Directly_Designated_Type (Typ);
end if;
if Is_Class_Wide_Type (Typ) then
Typ := Root_Type (Typ);
end if;
-- A legal use of a shadow entity occurs only when the unit where
-- the non-limited view resides is imported via a regular with
-- clause in the current body. Such references to shadow entities
-- may occur in subprogram formals.
if Is_Incomplete_Type (Typ)
and then From_Limited_With (Typ)
and then Present (Non_Limited_View (Typ))
and then Is_Legal_Shadow_Entity_In_Body (Typ)
then
Typ := Non_Limited_View (Typ);
end if;
-- If still incomplete, it can be a local incomplete type, or a
-- limited view whose scope is also a limited view.
if Ekind (Typ) = E_Incomplete_Type then
if not From_Limited_With (Typ)
and then No (Full_View (Typ))
then
Error_Attr_P
("prefix of % attribute cannot be an incomplete type");
-- The limited view may be available indirectly through
-- an intermediate unit. If the non-limited view is available
-- the attribute reference is legal.
elsif From_Limited_With (Typ)
and then
(No (Non_Limited_View (Typ))
or else Is_Incomplete_Type (Non_Limited_View (Typ)))
then
Error_Attr_P
("prefix of % attribute cannot be an incomplete type");
end if;
end if;
-- Ada 2012 : formals in bodies may be incomplete, but no attribute
-- legally applies.
elsif Is_Entity_Name (P)
and then Is_Formal (Entity (P))
and then Is_Incomplete_Type (Etype (Etype (P)))
then
Error_Attr_P
("prefix of % attribute cannot be an incomplete type");
end if;
if not Is_Entity_Name (P)
or else not Is_Type (Entity (P))
or else In_Spec_Expression
then
return;
else
Check_Fully_Declared (P_Type, P);
end if;
end Check_Not_Incomplete_Type;
----------------------------
-- Check_Object_Reference --
----------------------------
procedure Check_Object_Reference (P : Node_Id) is
Rtyp : Entity_Id;
begin
-- If we need an object, and we have a prefix that is the name of a
-- function entity, convert it into a function call.
if Is_Entity_Name (P)
and then Ekind (Entity (P)) = E_Function
then
Rtyp := Etype (Entity (P));
Rewrite (P,
Make_Function_Call (Sloc (P),
Name => Relocate_Node (P)));
Analyze_And_Resolve (P, Rtyp);
-- Otherwise we must have an object reference
elsif not Is_Object_Reference (P) then
Error_Attr_P ("prefix of % attribute must be object");
end if;
end Check_Object_Reference;
----------------------------
-- Check_PolyORB_Attribute --
----------------------------
procedure Check_PolyORB_Attribute is
begin
Validate_Non_Static_Attribute_Function_Call;
Check_Type;
Check_Not_CPP_Type;
if Get_PCS_Name /= Name_PolyORB_DSA then
Error_Attr
("attribute% requires the 'Poly'O'R'B 'P'C'S", N);
end if;
end Check_PolyORB_Attribute;
------------------------
-- Check_Program_Unit --
------------------------
procedure Check_Program_Unit is
begin
if Is_Entity_Name (P) then
declare
K : constant Entity_Kind := Ekind (Entity (P));
T : constant Entity_Id := Etype (Entity (P));
begin
if K in Subprogram_Kind
or else K in Task_Kind
or else K in Protected_Kind
or else K = E_Package
or else K in Generic_Unit_Kind
or else (K = E_Variable
and then
(Is_Task_Type (T)
or else
Is_Protected_Type (T)))
then
return;
end if;
end;
end if;
Error_Attr_P ("prefix of % attribute must be program unit");
end Check_Program_Unit;
---------------------
-- Check_Real_Type --
---------------------
procedure Check_Real_Type is
begin
Check_Type;
if not Is_Real_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be real type");
end if;
end Check_Real_Type;
-----------------------
-- Check_Scalar_Type --
-----------------------
procedure Check_Scalar_Type is
begin
Check_Type;
if not Is_Scalar_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be scalar type");
end if;
end Check_Scalar_Type;
---------------------------
-- Check_Standard_Prefix --
---------------------------
procedure Check_Standard_Prefix is
begin
Check_E0;
if Nkind (P) /= N_Identifier or else Chars (P) /= Name_Standard then
Error_Attr ("only allowed prefix for % attribute is Standard", P);
end if;
end Check_Standard_Prefix;
-------------------------------
-- Check_Put_Image_Attribute --
-------------------------------
procedure Check_Put_Image_Attribute is
begin
-- Put_Image is a procedure, and can only appear at the position of a
-- procedure call. If it's a list member and it's parent is a
-- procedure call or aggregate, then this is appearing as an actual
-- parameter or component association, which is wrong.
if Is_List_Member (N)
and then Nkind (Parent (N)) not in
N_Procedure_Call_Statement | N_Aggregate
then
null;
else
Error_Attr
("invalid context for attribute%, which is a procedure", N);
end if;
Check_Type;
Analyze_And_Resolve (E1);
-- Check that the first argument is
-- Ada.Strings.Text_Output.Sink'Class.
-- Note: the double call to Root_Type here is needed because the
-- root type of a class-wide type is the corresponding type (e.g.
-- X for X'Class, and we really want to go to the root.)
if Root_Type (Root_Type (Etype (E1))) /= RTE (RE_Sink) then
Error_Attr
("expected Ada.Strings.Text_Output.Sink''Class", E1);
end if;
-- Check that the second argument is of the right type
Analyze (E2);
Resolve (E2, P_Type);
end Check_Put_Image_Attribute;
----------------------------
-- Check_Stream_Attribute --
----------------------------
procedure Check_Stream_Attribute (Nam : TSS_Name_Type) is
Etyp : Entity_Id;
Btyp : Entity_Id;
In_Shared_Var_Procs : Boolean;
-- True when compiling System.Shared_Storage.Shared_Var_Procs body.
-- For this runtime package (always compiled in GNAT mode), we allow
-- stream attributes references for limited types for the case where
-- shared passive objects are implemented using stream attributes,
-- which is the default in GNAT's persistent storage implementation.
begin
Validate_Non_Static_Attribute_Function_Call;
-- With the exception of 'Input, Stream attributes are procedures,
-- and can only appear at the position of procedure calls. We check
-- for this here, before they are rewritten, to give a more precise
-- diagnostic.
if Nam = TSS_Stream_Input then
null;
elsif Is_List_Member (N)
and then Nkind (Parent (N)) not in
N_Procedure_Call_Statement | N_Aggregate
then
null;
else
Error_Attr
("invalid context for attribute%, which is a procedure", N);
end if;
Check_Type;
Btyp := Implementation_Base_Type (P_Type);
-- Stream attributes not allowed on limited types unless the
-- attribute reference was generated by the expander (in which
-- case the underlying type will be used, as described in Sinfo),
-- or the attribute was specified explicitly for the type itself
-- or one of its ancestors (taking visibility rules into account if
-- in Ada 2005 mode), or a pragma Stream_Convert applies to Btyp
-- (with no visibility restriction).
declare
Gen_Body : constant Node_Id := Enclosing_Generic_Body (N);
begin
if Present (Gen_Body) then
In_Shared_Var_Procs :=
Is_RTE (Corresponding_Spec (Gen_Body), RE_Shared_Var_Procs);
else
In_Shared_Var_Procs := False;
end if;
end;
if (Comes_From_Source (N)
and then not (In_Shared_Var_Procs or In_Instance))
and then not Stream_Attribute_Available (P_Type, Nam)
and then not Has_Rep_Pragma (Btyp, Name_Stream_Convert)
then
Error_Msg_Name_1 := Aname;
if Is_Limited_Type (P_Type) then
Error_Msg_NE
("limited type& has no% attribute", P, P_Type);
Explain_Limited_Type (P_Type, P);
else
Error_Msg_NE
("attribute% for type& is not available", P, P_Type);
end if;
end if;
-- Check for no stream operations allowed from No_Tagged_Streams
if Is_Tagged_Type (P_Type)
and then Present (No_Tagged_Streams_Pragma (P_Type))
then
Error_Msg_Sloc := Sloc (No_Tagged_Streams_Pragma (P_Type));
Error_Msg_NE
("no stream operations for & (No_Tagged_Streams #)", N, P_Type);
return;
end if;
-- Check restriction violations
-- First check the No_Streams restriction, which prohibits the use
-- of explicit stream attributes in the source program. We do not
-- prevent the occurrence of stream attributes in generated code,
-- for instance those generated implicitly for dispatching purposes.
if Comes_From_Source (N) then
Check_Restriction (No_Streams, P);
end if;
-- AI05-0057: if restriction No_Default_Stream_Attributes is active,
-- it is illegal to use a predefined elementary type stream attribute
-- either by itself, or more importantly as part of the attribute
-- subprogram for a composite type. However, if the broader
-- restriction No_Streams is active, stream operations are not
-- generated, and there is no error.
if Restriction_Active (No_Default_Stream_Attributes)
and then not Restriction_Active (No_Streams)
then
declare
T : Entity_Id;
begin
if Nam = TSS_Stream_Input
or else
Nam = TSS_Stream_Read
then
T :=
Type_Without_Stream_Operation (P_Type, TSS_Stream_Read);
else
T :=
Type_Without_Stream_Operation (P_Type, TSS_Stream_Write);
end if;
if Present (T) then
Check_Restriction (No_Default_Stream_Attributes, N);
Error_Msg_NE
("missing user-defined Stream Read or Write for type&",
N, T);
if not Is_Elementary_Type (P_Type) then
Error_Msg_NE
("\which is a component of type&", N, P_Type);
end if;
end if;
end;
end if;
-- Check special case of Exception_Id and Exception_Occurrence which
-- are not allowed for restriction No_Exception_Registration.
if Restriction_Check_Required (No_Exception_Registration)
and then (Is_RTE (P_Type, RE_Exception_Id)
or else
Is_RTE (P_Type, RE_Exception_Occurrence))
then
Check_Restriction (No_Exception_Registration, P);
end if;
-- Here we must check that the first argument is an access type
-- that is compatible with Ada.Streams.Root_Stream_Type'Class.
Analyze_And_Resolve (E1);
Etyp := Etype (E1);
-- Note: the double call to Root_Type here is needed because the
-- root type of a class-wide type is the corresponding type (e.g.
-- X for X'Class, and we really want to go to the root.)
if not Is_Access_Type (Etyp)
or else Root_Type (Root_Type (Designated_Type (Etyp))) /=
RTE (RE_Root_Stream_Type)
then
Error_Attr
("expected access to Ada.Streams.Root_Stream_Type''Class", E1);
end if;
-- Check that the second argument is of the right type if there is
-- one (the Input attribute has only one argument so this is skipped)
if Present (E2) then
Analyze (E2);
if Nam = TSS_Stream_Read
and then not Is_OK_Variable_For_Out_Formal (E2)
then
Error_Attr
("second argument of % attribute must be a variable", E2);
end if;
Resolve (E2, P_Type);
end if;
Check_Not_CPP_Type;
end Check_Stream_Attribute;
-------------------------
-- Check_System_Prefix --
-------------------------
procedure Check_System_Prefix is
begin
if Nkind (P) /= N_Identifier or else Chars (P) /= Name_System then
Error_Attr ("only allowed prefix for % attribute is System", P);
end if;
end Check_System_Prefix;
-----------------------
-- Check_Task_Prefix --
-----------------------
procedure Check_Task_Prefix is
begin
Analyze (P);
-- Ada 2005 (AI-345): Attribute 'Terminated can be applied to
-- task interface class-wide types.
if Is_Task_Type (Etype (P))
or else (Is_Access_Type (Etype (P))
and then Is_Task_Type (Designated_Type (Etype (P))))
or else (Ada_Version >= Ada_2005
and then Ekind (Etype (P)) = E_Class_Wide_Type
and then Is_Interface (Etype (P))
and then Is_Task_Interface (Etype (P)))
then
Resolve (P);
else
if Ada_Version >= Ada_2005 then
Error_Attr_P
("prefix of % attribute must be a task or a task " &
"interface class-wide object");
else
Error_Attr_P ("prefix of % attribute must be a task");
end if;
end if;
end Check_Task_Prefix;
----------------
-- Check_Type --
----------------
-- The possibilities are an entity name denoting a type, or an
-- attribute reference that denotes a type (Base or Class). If
-- the type is incomplete, replace it with its full view.
procedure Check_Type is
begin
if not Is_Entity_Name (P)
or else not Is_Type (Entity (P))
then
Error_Attr_P ("prefix of % attribute must be a type");
elsif Is_Protected_Self_Reference (P) then
Error_Attr_P
("prefix of % attribute denotes current instance "
& "(RM 9.4(21/2))");
elsif Ekind (Entity (P)) = E_Incomplete_Type
and then Present (Full_View (Entity (P)))
then
P_Type := Full_View (Entity (P));
Set_Entity (P, P_Type);
end if;
end Check_Type;
---------------------
-- Check_Unit_Name --
---------------------
procedure Check_Unit_Name (Nod : Node_Id) is
begin
if Nkind (Nod) = N_Identifier then
return;
elsif Nkind (Nod) in N_Selected_Component | N_Expanded_Name then
Check_Unit_Name (Prefix (Nod));
if Nkind (Selector_Name (Nod)) = N_Identifier then
return;
end if;
end if;
Error_Attr ("argument for % attribute must be unit name", P);
end Check_Unit_Name;
----------------
-- Error_Attr --
----------------
procedure Error_Attr is
begin
Set_Etype (N, Any_Type);
Set_Entity (N, Any_Type);
raise Bad_Attribute;
end Error_Attr;
procedure Error_Attr (Msg : String; Error_Node : Node_Id) is
begin
Error_Msg_Name_1 := Aname;
Error_Msg_N (Msg, Error_Node);
Error_Attr;
end Error_Attr;
------------------
-- Error_Attr_P --
------------------
procedure Error_Attr_P (Msg : String) is
begin
Error_Msg_Name_1 := Aname;
Error_Msg_F (Msg, P);
Error_Attr;
end Error_Attr_P;
----------------------------
-- Legal_Formal_Attribute --
----------------------------
procedure Legal_Formal_Attribute is
begin
Check_E0;
if not Is_Entity_Name (P)
or else not Is_Type (Entity (P))
then
Error_Attr_P ("prefix of % attribute must be generic type");
elsif Is_Generic_Actual_Type (Entity (P))
or else In_Instance
or else In_Inlined_Body
then
null;
elsif Is_Generic_Type (Entity (P)) then
if Is_Definite_Subtype (Entity (P)) then
Error_Attr_P
("prefix of % attribute must be indefinite generic type");
end if;
else
Error_Attr_P
("prefix of % attribute must be indefinite generic type");
end if;
Set_Etype (N, Standard_Boolean);
end Legal_Formal_Attribute;
---------------------------------------------------------------
-- Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements --
---------------------------------------------------------------
procedure Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements is
begin
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Universal_Integer);
end Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements;
-------------
-- Min_Max --
-------------
procedure Min_Max is
begin
-- Attribute can appear as function name in a reduction.
-- Semantic checks are performed later.
if Nkind (Parent (N)) = N_Attribute_Reference
and then Attribute_Name (Parent (N)) = Name_Reduce
then
Set_Etype (N, P_Base_Type);
return;
end if;
Check_E2;
Check_Scalar_Type;
Resolve (E1, P_Base_Type);
Resolve (E2, P_Base_Type);
Set_Etype (N, P_Base_Type);
-- Check for comparison on unordered enumeration type
if Bad_Unordered_Enumeration_Reference (N, P_Base_Type) then
Error_Msg_Sloc := Sloc (P_Base_Type);
Error_Msg_NE
("comparison on unordered enumeration type& declared#?U?",
N, P_Base_Type);
end if;
end Min_Max;
------------------------
-- Standard_Attribute --
------------------------
procedure Standard_Attribute (Val : Int) is
begin
Check_Standard_Prefix;
Rewrite (N, Make_Integer_Literal (Loc, Val));
Analyze (N);
Set_Is_Static_Expression (N, True);
end Standard_Attribute;
--------------------
-- Uneval_Old_Msg --
--------------------
procedure Uneval_Old_Msg is
Uneval_Old_Setting : Character;
Prag : Node_Id;
begin
-- If from aspect, then Uneval_Old_Setting comes from flags in the
-- N_Aspect_Specification node that corresponds to the attribute.
-- First find the pragma in which we appear (note that at this stage,
-- even if we appeared originally within an aspect specification, we
-- are now within the corresponding pragma).
Prag := N;
loop
Prag := Parent (Prag);
exit when No (Prag) or else Nkind (Prag) = N_Pragma;
end loop;
if Present (Prag) then
if Uneval_Old_Accept (Prag) then
Uneval_Old_Setting := 'A';
elsif Uneval_Old_Warn (Prag) then
Uneval_Old_Setting := 'W';
else
Uneval_Old_Setting := 'E';
end if;
-- If we did not find the pragma, that's odd, just use the setting
-- from Opt.Uneval_Old. Perhaps this is due to a previous error?
else
Uneval_Old_Setting := Opt.Uneval_Old;
end if;
-- Processing depends on the setting of Uneval_Old
case Uneval_Old_Setting is
when 'E' =>
-- ??? In the case where Ada_Version is < Ada_2020 and
-- an illegal 'Old prefix would be legal in Ada_2020,
-- we'd like to call Error_Msg_Ada_2020_Feature.
-- Identifying that case involves some work.
Error_Attr_P
("prefix of attribute % that is potentially "
& "unevaluated must statically name an entity"
-- further text needed for accuracy if Ada_2020
& (if Ada_Version >= Ada_2020
and then Attr_Id = Attribute_Old
then " or be eligible for conditional evaluation"
& " (RM 6.1.1 (27))"
else ""));
when 'W' =>
Error_Msg_Name_1 := Aname;
Error_Msg_F
("??prefix of attribute % appears in potentially "
& "unevaluated context, exception may be raised", P);
when 'A' =>
null;
when others =>
raise Program_Error;
end case;
end Uneval_Old_Msg;
-------------------------
-- Unexpected Argument --
-------------------------
procedure Unexpected_Argument (En : Node_Id) is
begin
Error_Attr ("unexpected argument for % attribute", En);
end Unexpected_Argument;
-------------------------------------------------
-- Validate_Non_Static_Attribute_Function_Call --
-------------------------------------------------
-- This function should be moved to Sem_Dist ???
procedure Validate_Non_Static_Attribute_Function_Call is
begin
if In_Preelaborated_Unit
and then not In_Subprogram_Or_Concurrent_Unit
then
Flag_Non_Static_Expr
("non-static function call in preelaborated unit!", N);
end if;
end Validate_Non_Static_Attribute_Function_Call;
-- Start of processing for Analyze_Attribute
begin
-- Immediate return if unrecognized attribute (already diagnosed by
-- parser, so there is nothing more that we need to do).
if not Is_Attribute_Name (Aname) then
raise Bad_Attribute;
end if;
Check_Restriction_No_Use_Of_Attribute (N);
-- Deal with Ada 83 issues
if Comes_From_Source (N) then
if not Attribute_83 (Attr_Id) then
if Ada_Version = Ada_83 and then Comes_From_Source (N) then
Error_Msg_Name_1 := Aname;
Error_Msg_N ("(Ada 83) attribute% is not standard??", N);
end if;
if Attribute_Impl_Def (Attr_Id) then
Check_Restriction (No_Implementation_Attributes, N);
end if;
end if;
end if;
-- Deal with Ada 2005 attributes that are implementation attributes
-- because they appear in a version of Ada before Ada 2005, ditto for
-- Ada 2012 and Ada 2020 attributes appearing in an earlier version.
if (Attribute_05 (Attr_Id) and then Ada_Version < Ada_2005)
or else
(Attribute_12 (Attr_Id) and then Ada_Version < Ada_2012)
or else
(Attribute_20 (Attr_Id) and then Ada_Version < Ada_2020)
then
Check_Restriction (No_Implementation_Attributes, N);
end if;
-- Remote access to subprogram type access attribute reference needs
-- unanalyzed copy for tree transformation. The analyzed copy is used
-- for its semantic information (whether prefix is a remote subprogram
-- name), the unanalyzed copy is used to construct new subtree rooted
-- with N_Aggregate which represents a fat pointer aggregate.
if Aname = Name_Access then
Discard_Node (Copy_Separate_Tree (N));
end if;
-- Analyze prefix and exit if error in analysis. If the prefix is an
-- incomplete type, use full view if available. Note that there are
-- some attributes for which we do not analyze the prefix, since the
-- prefix is not a normal name, or else needs special handling.
if Aname /= Name_Elab_Body and then
Aname /= Name_Elab_Spec and then
Aname /= Name_Elab_Subp_Body and then
Aname /= Name_Enabled and then
Aname /= Name_Old
then
Analyze (P);
P_Type := Etype (P);
if Is_Entity_Name (P)
and then Present (Entity (P))
and then Is_Type (Entity (P))
then
if Ekind (Entity (P)) = E_Incomplete_Type then
P_Type := Get_Full_View (P_Type);
Set_Entity (P, P_Type);
Set_Etype (P, P_Type);
elsif Entity (P) = Current_Scope
and then Is_Record_Type (Entity (P))
then
-- Use of current instance within the type. Verify that if the
-- attribute appears within a constraint, it yields an access
-- type, other uses are illegal.
declare
Par : Node_Id;
begin
Par := Parent (N);
while Present (Par)
and then Nkind (Parent (Par)) /= N_Component_Definition
loop
Par := Parent (Par);
end loop;
if Present (Par)
and then Nkind (Par) = N_Subtype_Indication
then
if Attr_Id /= Attribute_Access
and then Attr_Id /= Attribute_Unchecked_Access
and then Attr_Id /= Attribute_Unrestricted_Access
then
Error_Msg_N
("in a constraint the current instance can only "
& "be used with an access attribute", N);
end if;
end if;
end;
end if;
end if;
if P_Type = Any_Type then
raise Bad_Attribute;
end if;
P_Base_Type := Base_Type (P_Type);
end if;
-- Analyze expressions that may be present, exiting if an error occurs
if No (Exprs) then
E1 := Empty;
E2 := Empty;
else
E1 := First (Exprs);
-- Skip analysis for case of Restriction_Set, we do not expect
-- the argument to be analyzed in this case.
if Aname /= Name_Restriction_Set then
Analyze (E1);
-- Check for missing/bad expression (result of previous error)
if No (E1) or else Etype (E1) = Any_Type then
raise Bad_Attribute;
end if;
end if;
E2 := Next (E1);
if Present (E2) then
Analyze (E2);
if Etype (E2) = Any_Type then
raise Bad_Attribute;
end if;
if Present (Next (E2)) then
Unexpected_Argument (Next (E2));
end if;
end if;
end if;
-- Cases where prefix must be resolvable by itself
if Is_Overloaded (P)
and then Aname /= Name_Access
and then Aname /= Name_Address
and then Aname /= Name_Code_Address
and then Aname /= Name_Result
and then Aname /= Name_Unchecked_Access
then
-- The prefix must be resolvable by itself, without reference to the
-- attribute. One case that requires special handling is a prefix
-- that is a function name, where one interpretation may be a
-- parameterless call. Entry attributes are handled specially below.
if Is_Entity_Name (P)
and then Aname not in Name_Count | Name_Caller
then
Check_Parameterless_Call (P);
end if;
if Is_Overloaded (P) then
-- Ada 2005 (AI-345): Since protected and task types have
-- primitive entry wrappers, the attributes Count, and Caller
-- require a context check
if Aname in Name_Count | Name_Caller then
declare
Count : Natural := 0;
I : Interp_Index;
It : Interp;
begin
Get_First_Interp (P, I, It);
while Present (It.Nam) loop
if Comes_From_Source (It.Nam) then
Count := Count + 1;
else
Remove_Interp (I);
end if;
Get_Next_Interp (I, It);
end loop;
if Count > 1 then
Error_Attr ("ambiguous prefix for % attribute", P);
else
Set_Is_Overloaded (P, False);
end if;
end;
else
Error_Attr ("ambiguous prefix for % attribute", P);
end if;
end if;
end if;
-- Remaining processing depends on attribute
case Attr_Id is
-- Attributes related to Ada 2012 iterators. Attribute specifications
-- exist for these, but they cannot be queried.
when Attribute_Constant_Indexing
| Attribute_Default_Iterator
| Attribute_Implicit_Dereference
| Attribute_Iterator_Element
| Attribute_Iterable
| Attribute_Variable_Indexing
=>
Error_Msg_N ("illegal attribute", N);
-- Internal attributes used to deal with Ada 2012 delayed aspects. These
-- were already rejected by the parser. Thus they shouldn't appear here.
when Internal_Attribute_Id =>
raise Program_Error;
------------------
-- Abort_Signal --
------------------
when Attribute_Abort_Signal =>
Check_Standard_Prefix;
Rewrite (N, New_Occurrence_Of (Stand.Abort_Signal, Loc));
Analyze (N);
------------
-- Access --
------------
when Attribute_Access =>
Analyze_Access_Attribute;
Check_Not_Incomplete_Type;
-------------
-- Address --
-------------
when Attribute_Address =>
Check_E0;
Address_Checks;
Check_Not_Incomplete_Type;
Set_Etype (N, RTE (RE_Address));
------------------
-- Address_Size --
------------------
when Attribute_Address_Size =>
Standard_Attribute (System_Address_Size);
--------------
-- Adjacent --
--------------
when Attribute_Adjacent =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
Resolve (E2, P_Base_Type);
---------
-- Aft --
---------
when Attribute_Aft =>
Check_Fixed_Point_Type_0;
Set_Etype (N, Universal_Integer);
---------------
-- Alignment --
---------------
when Attribute_Alignment =>
-- Don't we need more checking here, cf Size ???
Check_E0;
Check_Not_Incomplete_Type;
Check_Not_CPP_Type;
Set_Etype (N, Universal_Integer);
---------------
-- Asm_Input --
---------------
when Attribute_Asm_Input =>
Check_Asm_Attribute;
-- The back end may need to take the address of E2
if Is_Entity_Name (E2) then
Set_Address_Taken (Entity (E2));
end if;
Set_Etype (N, RTE (RE_Asm_Input_Operand));
----------------
-- Asm_Output --
----------------
when Attribute_Asm_Output =>
Check_Asm_Attribute;
if Etype (E2) = Any_Type then
return;
elsif Aname = Name_Asm_Output then
if not Is_Variable (E2) then
Error_Attr
("second argument for Asm_Output is not variable", E2);
end if;
end if;
Note_Possible_Modification (E2, Sure => True);
-- The back end may need to take the address of E2
if Is_Entity_Name (E2) then
Set_Address_Taken (Entity (E2));
end if;
Set_Etype (N, RTE (RE_Asm_Output_Operand));
-----------------------------
-- Atomic_Always_Lock_Free --
-----------------------------
when Attribute_Atomic_Always_Lock_Free =>
Check_E0;
Check_Type;
Set_Etype (N, Standard_Boolean);
----------
-- Base --
----------
-- Note: when the base attribute appears in the context of a subtype
-- mark, the analysis is done by Sem_Ch8.Find_Type, rather than by
-- the following circuit.
when Attribute_Base => Base : declare
Typ : Entity_Id;
begin
Check_E0;
Find_Type (P);
Typ := Entity (P);
if Ada_Version >= Ada_95
and then not Is_Scalar_Type (Typ)
and then not Is_Generic_Type (Typ)
then
Error_Attr_P ("prefix of Base attribute must be scalar type");
elsif Sloc (Typ) = Standard_Location
and then Base_Type (Typ) = Typ
and then Warn_On_Redundant_Constructs
then
Error_Msg_NE -- CODEFIX
("?r?redundant attribute, & is its own base type", N, Typ);
end if;
Set_Etype (N, Base_Type (Entity (P)));
Set_Entity (N, Base_Type (Entity (P)));
Rewrite (N, New_Occurrence_Of (Entity (N), Loc));
Analyze (N);
end Base;
---------
-- Bit --
---------
when Attribute_Bit =>
Check_E0;
if not Is_Object_Reference (P) then
Error_Attr_P ("prefix for % attribute must be object");
-- What about the access object cases ???
else
null;
end if;
Set_Etype (N, Universal_Integer);
---------------
-- Bit_Order --
---------------
when Attribute_Bit_Order =>
Check_E0;
Check_Type;
if not Is_Record_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be record type");
end if;
if Bytes_Big_Endian xor Reverse_Bit_Order (P_Type) then
Rewrite (N,
New_Occurrence_Of (RTE (RE_High_Order_First), Loc));
else
Rewrite (N,
New_Occurrence_Of (RTE (RE_Low_Order_First), Loc));
end if;
Set_Etype (N, RTE (RE_Bit_Order));
Resolve (N);
-- Reset incorrect indication of staticness
Set_Is_Static_Expression (N, False);
------------------
-- Bit_Position --
------------------
-- Note: in generated code, we can have a Bit_Position attribute
-- applied to a (naked) record component (i.e. the prefix is an
-- identifier that references an E_Component or E_Discriminant
-- entity directly, and this is interpreted as expected by Gigi.
-- The following code will not tolerate such usage, but when the
-- expander creates this special case, it marks it as analyzed
-- immediately and sets an appropriate type.
when Attribute_Bit_Position =>
if Comes_From_Source (N) then
Check_Component;
end if;
Set_Etype (N, Universal_Integer);
------------------
-- Body_Version --
------------------
when Attribute_Body_Version =>
Check_E0;
Check_Program_Unit;
Set_Etype (N, RTE (RE_Version_String));
--------------
-- Callable --
--------------
when Attribute_Callable =>
Check_E0;
Set_Etype (N, Standard_Boolean);
Check_Task_Prefix;
------------
-- Caller --
------------
when Attribute_Caller => Caller : declare
Ent : Entity_Id;
S : Entity_Id;
begin
Check_E0;
if Nkind (P) in N_Identifier | N_Expanded_Name then
Ent := Entity (P);
if not Is_Entry (Ent) then
Error_Attr ("invalid entry name", N);
end if;
else
Error_Attr ("invalid entry name", N);
return;
end if;
for J in reverse 0 .. Scope_Stack.Last loop
S := Scope_Stack.Table (J).Entity;
if S = Scope (Ent) then
Error_Attr ("Caller must appear in matching accept or body", N);
elsif S = Ent then
exit;
end if;
end loop;
Set_Etype (N, RTE (RO_AT_Task_Id));
end Caller;
-------------
-- Ceiling --
-------------
when Attribute_Ceiling =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
-----------
-- Class --
-----------
when Attribute_Class =>
Check_Restriction (No_Dispatch, N);
Check_E0;
Find_Type (N);
-- Applying Class to untagged incomplete type is obsolescent in Ada
-- 2005. Note that we can't test Is_Tagged_Type here on P_Type, since
-- this flag gets set by Find_Type in this situation.
if Restriction_Check_Required (No_Obsolescent_Features)
and then Ada_Version >= Ada_2005
and then Ekind (P_Type) = E_Incomplete_Type
then
declare
DN : constant Node_Id := Declaration_Node (P_Type);
begin
if Nkind (DN) = N_Incomplete_Type_Declaration
and then not Tagged_Present (DN)
then
Check_Restriction (No_Obsolescent_Features, P);
end if;
end;
end if;
------------------
-- Code_Address --
------------------
when Attribute_Code_Address =>
Check_E0;
if Nkind (P) = N_Attribute_Reference
and then Attribute_Name (P) in Name_Elab_Body | Name_Elab_Spec
then
null;
elsif not Is_Entity_Name (P)
or else (Ekind (Entity (P)) /= E_Function
and then
Ekind (Entity (P)) /= E_Procedure)
then
Error_Attr ("invalid prefix for % attribute", P);
Set_Address_Taken (Entity (P));
-- Issue an error if the prefix denotes an eliminated subprogram
else
Check_For_Eliminated_Subprogram (P, Entity (P));
end if;
Set_Etype (N, RTE (RE_Address));
----------------------
-- Compiler_Version --
----------------------
when Attribute_Compiler_Version =>
Check_E0;
Check_Standard_Prefix;
Rewrite (N, Make_String_Literal (Loc, "GNAT " & Gnat_Version_String));
Analyze_And_Resolve (N, Standard_String);
Set_Is_Static_Expression (N, True);
--------------------
-- Component_Size --
--------------------
when Attribute_Component_Size =>
Check_E0;
Set_Etype (N, Universal_Integer);
-- Note: unlike other array attributes, unconstrained arrays are OK
if Is_Array_Type (P_Type) and then not Is_Constrained (P_Type) then
null;
else
Check_Array_Type;
end if;
-------------
-- Compose --
-------------
when Attribute_Compose =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
Resolve (E2, Any_Integer);
-----------------
-- Constrained --
-----------------
when Attribute_Constrained =>
Check_E0;
Set_Etype (N, Standard_Boolean);
-- Case from RM J.4(2) of constrained applied to private type
if Is_Entity_Name (P) and then Is_Type (Entity (P)) then
Check_Restriction (No_Obsolescent_Features, P);
if Warn_On_Obsolescent_Feature then
Error_Msg_N
("constrained for private type is an obsolescent feature "
& "(RM J.4)?j?", N);
end if;
-- If we are within an instance, the attribute must be legal
-- because it was valid in the generic unit. Ditto if this is
-- an inlining of a function declared in an instance.
if In_Instance or else In_Inlined_Body then
return;
-- For sure OK if we have a real private type itself, but must
-- be completed, cannot apply Constrained to incomplete type.
elsif Is_Private_Type (Entity (P)) then
-- Note: this is one of the Annex J features that does not
-- generate a warning from -gnatwj, since in fact it seems
-- very useful, and is used in the GNAT runtime.
Check_Not_Incomplete_Type;
return;
end if;
-- Normal (non-obsolescent case) of application to object or value of
-- a discriminated type.
else
-- AI12-0068: In a type or subtype aspect, a prefix denoting the
-- current instance of the (sub)type is defined to be a value,
-- not an object, so the Constrained attribute is always True
-- (see RM 8.6(18/5) and RM 3.7.2(3/5)). We issue a warning about
-- this unintuitive result, to help avoid confusion.
if Is_Current_Instance_Reference_In_Type_Aspect (P) then
Error_Msg_Name_1 := Aname;
Error_Msg_N
("current instance attribute % in subtype aspect always " &
"true??", N);
else
Check_Object_Reference (P);
end if;
-- If N does not come from source, then we allow the
-- the attribute prefix to be of a private type whose
-- full type has discriminants. This occurs in cases
-- involving expanded calls to stream attributes.
if not Comes_From_Source (N) then
P_Type := Underlying_Type (P_Type);
end if;
-- Must have discriminants or be an access type designating a type
-- with discriminants. If it is a class-wide type it has unknown
-- discriminants.
if Has_Discriminants (P_Type)
or else Has_Unknown_Discriminants (P_Type)
or else
(Is_Access_Type (P_Type)
and then Has_Discriminants (Designated_Type (P_Type)))
then
return;
-- The rule given in 3.7.2 is part of static semantics, but the
-- intent is clearly that it be treated as a legality rule, and
-- rechecked in the visible part of an instance. Nevertheless
-- the intent also seems to be it should legally apply to the
-- actual of a formal with unknown discriminants, regardless of
-- whether the actual has discriminants, in which case the value
-- of the attribute is determined using the J.4 rules. This choice
-- seems the most useful, and is compatible with existing tests.
elsif In_Instance then
return;
-- Also allow an object of a generic type if extensions allowed
-- and allow this for any type at all.
elsif (Is_Generic_Type (P_Type)
or else Is_Generic_Actual_Type (P_Type))
and then Extensions_Allowed
then
return;
end if;
end if;
-- Fall through if bad prefix
Error_Attr_P
("prefix of % attribute must be object of discriminated type");
---------------
-- Copy_Sign --
---------------
when Attribute_Copy_Sign =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
Resolve (E2, P_Base_Type);
-----------
-- Count --
-----------
when Attribute_Count => Count : declare
Ent : Entity_Id;
S : Entity_Id;
Tsk : Entity_Id;
begin
Check_E0;
if Nkind (P) in N_Identifier | N_Expanded_Name then
Ent := Entity (P);
if Ekind (Ent) /= E_Entry then
Error_Attr ("invalid entry name", N);
end if;
elsif Nkind (P) = N_Indexed_Component then
if not Is_Entity_Name (Prefix (P))
or else No (Entity (Prefix (P)))
or else Ekind (Entity (Prefix (P))) /= E_Entry_Family
then
if Nkind (Prefix (P)) = N_Selected_Component
and then Present (Entity (Selector_Name (Prefix (P))))
and then Ekind (Entity (Selector_Name (Prefix (P)))) =
E_Entry_Family
then
Error_Attr
("attribute % must apply to entry of current task", P);
else
Error_Attr ("invalid entry family name", P);
end if;
return;
else
Ent := Entity (Prefix (P));
end if;
elsif Nkind (P) = N_Selected_Component
and then Present (Entity (Selector_Name (P)))
and then Ekind (Entity (Selector_Name (P))) = E_Entry
then
Error_Attr
("attribute % must apply to entry of current task", P);
else
Error_Attr ("invalid entry name", N);
return;
end if;
for J in reverse 0 .. Scope_Stack.Last loop
S := Scope_Stack.Table (J).Entity;
if S = Scope (Ent) then
if Nkind (P) = N_Expanded_Name then
Tsk := Entity (Prefix (P));
-- The prefix denotes either the task type, or else a
-- single task whose task type is being analyzed.
if (Is_Type (Tsk) and then Tsk = S)
or else (not Is_Type (Tsk)
and then Etype (Tsk) = S
and then not (Comes_From_Source (S)))
then
null;
else
Error_Attr
("Attribute % must apply to entry of current task", N);
end if;
end if;
exit;
elsif Ekind (Scope (Ent)) in Task_Kind
and then Ekind (S) not in E_Block
| E_Entry
| E_Entry_Family
| E_Loop
then
Error_Attr ("Attribute % cannot appear in inner unit", N);
elsif Ekind (Scope (Ent)) = E_Protected_Type
and then not Has_Completion (Scope (Ent))
then
Error_Attr ("attribute % can only be used inside body", N);
end if;
end loop;
if Is_Overloaded (P) then
declare
Index : Interp_Index;
It : Interp;
begin
Get_First_Interp (P, Index, It);
while Present (It.Nam) loop
if It.Nam = Ent then
null;
-- Ada 2005 (AI-345): Do not consider primitive entry
-- wrappers generated for task or protected types.
elsif Ada_Version >= Ada_2005
and then not Comes_From_Source (It.Nam)
then
null;
else
Error_Attr ("ambiguous entry name", N);
end if;
Get_Next_Interp (Index, It);
end loop;
end;
end if;
Set_Etype (N, Universal_Integer);
end Count;
-----------------------
-- Default_Bit_Order --
-----------------------
when Attribute_Default_Bit_Order => Default_Bit_Order : declare
Target_Default_Bit_Order : System.Bit_Order;
begin
Check_Standard_Prefix;
if Bytes_Big_Endian then
Target_Default_Bit_Order := System.High_Order_First;
else
Target_Default_Bit_Order := System.Low_Order_First;
end if;
Rewrite (N,
Make_Integer_Literal (Loc,
UI_From_Int (System.Bit_Order'Pos (Target_Default_Bit_Order))));
Set_Etype (N, Universal_Integer);
Set_Is_Static_Expression (N);
end Default_Bit_Order;
----------------------------------
-- Default_Scalar_Storage_Order --
----------------------------------
when Attribute_Default_Scalar_Storage_Order => Default_SSO : declare
RE_Default_SSO : RE_Id;
begin
Check_Standard_Prefix;
case Opt.Default_SSO is
when ' ' =>
if Bytes_Big_Endian then
RE_Default_SSO := RE_High_Order_First;
else
RE_Default_SSO := RE_Low_Order_First;
end if;
when 'H' =>
RE_Default_SSO := RE_High_Order_First;
when 'L' =>
RE_Default_SSO := RE_Low_Order_First;
when others =>
raise Program_Error;
end case;
Rewrite (N, New_Occurrence_Of (RTE (RE_Default_SSO), Loc));
end Default_SSO;
--------------
-- Definite --
--------------
when Attribute_Definite =>
Legal_Formal_Attribute;
-----------
-- Delta --
-----------
when Attribute_Delta =>
Check_Fixed_Point_Type_0;
Set_Etype (N, Universal_Real);
------------
-- Denorm --
------------
when Attribute_Denorm =>
Check_Floating_Point_Type_0;
Set_Etype (N, Standard_Boolean);
-----------
-- Deref --
-----------
when Attribute_Deref =>
Check_Type;
Check_E1;
Resolve (E1, RTE (RE_Address));
Set_Etype (N, P_Type);
---------------------
-- Descriptor_Size --
---------------------
when Attribute_Descriptor_Size =>
Check_E0;
if not Is_Entity_Name (P) or else not Is_Type (Entity (P)) then
Error_Attr_P ("prefix of attribute % must denote a type");
end if;
Set_Etype (N, Universal_Integer);
------------
-- Digits --
------------
when Attribute_Digits =>
Check_E0;
Check_Type;
if not Is_Floating_Point_Type (P_Type)
and then not Is_Decimal_Fixed_Point_Type (P_Type)
then
Error_Attr_P
("prefix of % attribute must be float or decimal type");
end if;
Set_Etype (N, Universal_Integer);
---------------
-- Elab_Body --
---------------
-- Also handles processing for Elab_Spec and Elab_Subp_Body
when Attribute_Elab_Body
| Attribute_Elab_Spec
| Attribute_Elab_Subp_Body
=>
Check_E0;
Check_Unit_Name (P);
Set_Etype (N, Standard_Void_Type);
-- We have to manually call the expander in this case to get
-- the necessary expansion (normally attributes that return
-- entities are not expanded).
Expand (N);
---------------
-- Elab_Spec --
---------------
-- Shares processing with Elab_Body
----------------
-- Elaborated --
----------------
when Attribute_Elaborated =>
Check_E0;
Check_Unit_Name (P);
Set_Etype (N, Standard_Boolean);
----------
-- Emax --
----------
when Attribute_Emax =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
-------------
-- Enabled --
-------------
when Attribute_Enabled =>
Check_Either_E0_Or_E1;
if Present (E1) then
if not Is_Entity_Name (E1) or else No (Entity (E1)) then
Error_Msg_N ("entity name expected for Enabled attribute", E1);
E1 := Empty;
end if;
end if;
if Nkind (P) /= N_Identifier then
Error_Msg_N ("identifier expected (check name)", P);
elsif Get_Check_Id (Chars (P)) = No_Check_Id then
Error_Msg_N ("& is not a recognized check name", P);
end if;
Set_Etype (N, Standard_Boolean);
--------------
-- Enum_Rep --
--------------
when Attribute_Enum_Rep =>
-- T'Enum_Rep (X) case
if Present (E1) then
Check_E1;
Check_Discrete_Type;
Resolve (E1, P_Base_Type);
-- X'Enum_Rep case. X must be an object or enumeration literal
-- (including an attribute reference), and it must be of a
-- discrete type.
elsif not
((Is_Object_Reference (P)
or else
(Is_Entity_Name (P)
and then Ekind (Entity (P)) = E_Enumeration_Literal)
or else Nkind (P) = N_Attribute_Reference)
and then Is_Discrete_Type (Etype (P)))
then
Error_Attr_P ("prefix of % attribute must be discrete object");
end if;
Set_Etype (N, Universal_Integer);
--------------
-- Enum_Val --
--------------
when Attribute_Enum_Val =>
Check_E1;
Check_Type;
if not Is_Enumeration_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be enumeration type");
end if;
-- If the enumeration type has a standard representation, the effect
-- is the same as 'Val, so rewrite the attribute as a 'Val.
if not Has_Non_Standard_Rep (P_Base_Type) then
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (Prefix (N)),
Attribute_Name => Name_Val,
Expressions => New_List (Relocate_Node (E1))));
Analyze_And_Resolve (N, P_Base_Type);
-- Non-standard representation case (enumeration with holes)
else
Check_Enum_Image;
Resolve (E1, Any_Integer);
Set_Etype (N, P_Base_Type);
end if;
-------------
-- Epsilon --
-------------
when Attribute_Epsilon =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Real);
--------------
-- Exponent --
--------------
when Attribute_Exponent =>
Check_Floating_Point_Type_1;
Set_Etype (N, Universal_Integer);
Resolve (E1, P_Base_Type);
------------------
-- External_Tag --
------------------
when Attribute_External_Tag =>
Check_E0;
Check_Type;
Set_Etype (N, Standard_String);
if not Is_Tagged_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be tagged");
end if;
---------------
-- Fast_Math --
---------------
when Attribute_Fast_Math =>
Check_Standard_Prefix;
Rewrite (N, New_Occurrence_Of (Boolean_Literals (Fast_Math), Loc));
-----------------------
-- Finalization_Size --
-----------------------
when Attribute_Finalization_Size =>
Check_E0;
-- The prefix denotes an object
if Is_Object_Reference (P) then
Check_Object_Reference (P);
-- The prefix denotes a type
elsif Is_Entity_Name (P) and then Is_Type (Entity (P)) then
Check_Type;
Check_Not_Incomplete_Type;
-- Attribute 'Finalization_Size is not defined for class-wide
-- types because it is not possible to know statically whether
-- a definite type will have controlled components or not.
if Is_Class_Wide_Type (Etype (P)) then
Error_Attr_P
("prefix of % attribute cannot denote a class-wide type");
end if;
-- The prefix denotes an illegal construct
else
Error_Attr_P
("prefix of % attribute must be a definite type or an object");
end if;
Set_Etype (N, Universal_Integer);
-----------
-- First --
-----------
when Attribute_First =>
Check_Array_Or_Scalar_Type;
Bad_Attribute_For_Predicate;
---------------
-- First_Bit --
---------------
when Attribute_First_Bit =>
Check_Component;
Set_Etype (N, Universal_Integer);
-----------------
-- First_Valid --
-----------------
when Attribute_First_Valid =>
Check_First_Last_Valid;
Set_Etype (N, P_Type);
-----------------
-- Fixed_Value --
-----------------
when Attribute_Fixed_Value =>
Check_E1;
Check_Fixed_Point_Type;
Resolve (E1, Any_Integer);
Set_Etype (N, P_Base_Type);
-----------
-- Floor --
-----------
when Attribute_Floor =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
----------
-- Fore --
----------
when Attribute_Fore =>
Check_Fixed_Point_Type_0;
Set_Etype (N, Universal_Integer);
--------------
-- Fraction --
--------------
when Attribute_Fraction =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
--------------
-- From_Any --
--------------
when Attribute_From_Any =>
Check_E1;
Check_PolyORB_Attribute;
Set_Etype (N, P_Base_Type);
-----------------------
-- Has_Access_Values --
-----------------------
when Attribute_Has_Access_Values =>
Check_Type;
Check_E0;
Set_Etype (N, Standard_Boolean);
----------------------
-- Has_Same_Storage --
----------------------
when Attribute_Has_Same_Storage =>
Check_E1;
-- The arguments must be objects of any type
Analyze_And_Resolve (P);
Analyze_And_Resolve (E1);
Check_Object_Reference (P);
Check_Object_Reference (E1);
Set_Etype (N, Standard_Boolean);
-----------------------
-- Has_Tagged_Values --
-----------------------
when Attribute_Has_Tagged_Values =>
Check_Type;
Check_E0;
Set_Etype (N, Standard_Boolean);
-----------------------
-- Has_Discriminants --
-----------------------
when Attribute_Has_Discriminants =>
Legal_Formal_Attribute;
--------------
-- Identity --
--------------
when Attribute_Identity =>
Check_E0;
Analyze (P);
if Etype (P) = Standard_Exception_Type then
Set_Etype (N, RTE (RE_Exception_Id));
-- Ada 2005 (AI-345): Attribute 'Identity may be applied to task
-- interface class-wide types.
elsif Is_Task_Type (Etype (P))
or else (Is_Access_Type (Etype (P))
and then Is_Task_Type (Designated_Type (Etype (P))))
or else (Ada_Version >= Ada_2005
and then Ekind (Etype (P)) = E_Class_Wide_Type
and then Is_Interface (Etype (P))
and then Is_Task_Interface (Etype (P)))
then
Resolve (P);
Set_Etype (N, RTE (RO_AT_Task_Id));
else
if Ada_Version >= Ada_2005 then
Error_Attr_P
("prefix of % attribute must be an exception, a task or a "
& "task interface class-wide object");
else
Error_Attr_P
("prefix of % attribute must be a task or an exception");
end if;
end if;
-----------
-- Image --
-----------
when Attribute_Image =>
if Is_Real_Type (P_Type) then
if Ada_Version = Ada_83 and then Comes_From_Source (N) then
Error_Msg_Name_1 := Aname;
Error_Msg_N
("(Ada 83) % attribute not allowed for real types", N);
end if;
end if;
Analyze_Image_Attribute (Standard_String);
---------
-- Img --
---------
when Attribute_Img =>
Analyze_Image_Attribute (Standard_String);
-----------------
-- Initialized --
-----------------
when Attribute_Initialized =>
Check_E0;
if Comes_From_Source (N) then
-- This attribute be prefixed with references to objects or
-- values (such as a current instance value given within a type
-- or subtype aspect).
if not Is_Object_Reference (P)
and then not Is_Current_Instance_Reference_In_Type_Aspect (P)
then
Error_Attr_P ("prefix of % attribute must be object");
end if;
end if;
Set_Etype (N, Standard_Boolean);
-----------
-- Input --
-----------
when Attribute_Input =>
Check_E1;
Check_Stream_Attribute (TSS_Stream_Input);
Set_Etype (N, P_Base_Type);
-------------------
-- Integer_Value --
-------------------
when Attribute_Integer_Value =>
Check_E1;
Check_Integer_Type;
Resolve (E1, Any_Fixed);
-- Signal an error if argument type is not a specific fixed-point
-- subtype. An error has been signalled already if the argument
-- was not of a fixed-point type.
if Etype (E1) = Any_Fixed and then not Error_Posted (E1) then
Error_Attr ("argument of % must be of a fixed-point type", E1);
end if;
Set_Etype (N, P_Base_Type);
-------------------
-- Invalid_Value --
-------------------
when Attribute_Invalid_Value =>
Check_E0;
Check_Scalar_Type;
Set_Etype (N, P_Base_Type);
Invalid_Value_Used := True;
-----------
-- Large --
-----------
when Attribute_Large =>
Check_E0;
Check_Real_Type;
Set_Etype (N, Universal_Real);
----------
-- Last --
----------
when Attribute_Last =>
Check_Array_Or_Scalar_Type;
Bad_Attribute_For_Predicate;
--------------
-- Last_Bit --
--------------
when Attribute_Last_Bit =>
Check_Component;
Set_Etype (N, Universal_Integer);
----------------
-- Last_Valid --
----------------
when Attribute_Last_Valid =>
Check_First_Last_Valid;
Set_Etype (N, P_Type);
------------------
-- Leading_Part --
------------------
when Attribute_Leading_Part =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
Resolve (E2, Any_Integer);
------------
-- Length --
------------
when Attribute_Length =>
Check_Array_Type;
Set_Etype (N, Universal_Integer);
-------------------
-- Library_Level --
-------------------
when Attribute_Library_Level =>
Check_E0;
if not Is_Entity_Name (P) then
Error_Attr_P ("prefix of % attribute must be an entity name");
end if;
if not Inside_A_Generic then
Set_Boolean_Result (N,
Is_Library_Level_Entity (Entity (P)));
end if;
Set_Etype (N, Standard_Boolean);
---------------
-- Lock_Free --
---------------
when Attribute_Lock_Free =>
Check_E0;
Set_Etype (N, Standard_Boolean);
if not Is_Protected_Type (P_Type) then
Error_Attr_P
("prefix of % attribute must be a protected object");
end if;
----------------
-- Loop_Entry --
----------------
when Attribute_Loop_Entry => Loop_Entry : declare
procedure Check_References_In_Prefix (Loop_Id : Entity_Id);
-- Inspect the prefix for any uses of entities declared within the
-- related loop. Loop_Id denotes the loop identifier.
--------------------------------
-- Check_References_In_Prefix --
--------------------------------
procedure Check_References_In_Prefix (Loop_Id : Entity_Id) is
Loop_Decl : constant Node_Id := Label_Construct (Parent (Loop_Id));
function Check_Reference (Nod : Node_Id) return Traverse_Result;
-- Determine whether a reference mentions an entity declared
-- within the related loop.
function Declared_Within (Nod : Node_Id) return Boolean;
-- Determine whether Nod appears in the subtree of Loop_Decl
---------------------
-- Check_Reference --
---------------------
function Check_Reference (Nod : Node_Id) return Traverse_Result is
begin
if Nkind (Nod) = N_Identifier
and then Present (Entity (Nod))
and then Declared_Within (Declaration_Node (Entity (Nod)))
then
Error_Attr
("prefix of attribute % cannot reference local entities",
Nod);
return Abandon;
else
return OK;
end if;
end Check_Reference;
procedure Check_References is new Traverse_Proc (Check_Reference);
---------------------
-- Declared_Within --
---------------------
function Declared_Within (Nod : Node_Id) return Boolean is
Stmt : Node_Id;
begin
Stmt := Nod;
while Present (Stmt) loop
if Stmt = Loop_Decl then
return True;
-- Prevent the search from going too far
elsif Is_Body_Or_Package_Declaration (Stmt) then
exit;
end if;
Stmt := Parent (Stmt);
end loop;
return False;
end Declared_Within;
-- Start of processing for Check_Prefix_For_Local_References
begin
Check_References (P);
end Check_References_In_Prefix;
-- Local variables
Context : constant Node_Id := Parent (N);
Attr : Node_Id;
Encl_Loop : Node_Id := Empty;
Encl_Prag : Node_Id := Empty;
Loop_Id : Entity_Id := Empty;
Scop : Entity_Id;
Stmt : Node_Id;
-- Start of processing for Loop_Entry
begin
Attr := N;
-- Set the type of the attribute now to ensure the successful
-- continuation of analysis even if the attribute is misplaced.
Set_Etype (Attr, P_Type);
-- Attribute 'Loop_Entry may appear in several flavors:
-- * Prefix'Loop_Entry - in this form, the attribute applies to the
-- nearest enclosing loop.
-- * Prefix'Loop_Entry (Expr) - depending on what Expr denotes, the
-- attribute may be related to a loop denoted by label Expr or
-- the prefix may denote an array object and Expr may act as an
-- indexed component.
-- * Prefix'Loop_Entry (Expr1, ..., ExprN) - the attribute applies
-- to the nearest enclosing loop, all expressions are part of
-- an indexed component.
-- * Prefix'Loop_Entry (Expr) (...) (...) - depending on what Expr
-- denotes, the attribute may be related to a loop denoted by
-- label Expr or the prefix may denote a multidimensional array
-- array object and Expr along with the rest of the expressions
-- may act as indexed components.
-- Regardless of variations, the attribute reference does not have an
-- expression list. Instead, all available expressions are stored as
-- indexed components.
-- When the attribute is part of an indexed component, find the first
-- expression as it will determine the semantics of 'Loop_Entry.
-- If the attribute is itself an index in an indexed component, i.e.
-- a member of a list, the context itself is not relevant (the code
-- below would lead to an infinite loop) and the attribute applies
-- to the enclosing loop.
if Nkind (Context) = N_Indexed_Component
and then not Is_List_Member (N)
then
E1 := First (Expressions (Context));
E2 := Next (E1);
-- The attribute reference appears in the following form:
-- Prefix'Loop_Entry (Exp1, Expr2, ..., ExprN) [(...)]
-- In this case, the loop name is omitted and no rewriting is
-- required.
if Present (E2) then
null;
-- The form of the attribute is:
-- Prefix'Loop_Entry (Expr) [(...)]
-- If Expr denotes a loop entry, the whole attribute and indexed
-- component will have to be rewritten to reflect this relation.
else
pragma Assert (Present (E1));
-- Do not expand the expression as it may have side effects.
-- Simply preanalyze to determine whether it is a loop name or
-- something else.
Preanalyze_And_Resolve (E1);
if Is_Entity_Name (E1)
and then Present (Entity (E1))
and then Ekind (Entity (E1)) = E_Loop
then
Loop_Id := Entity (E1);
-- Transform the attribute and enclosing indexed component
Set_Expressions (N, Expressions (Context));
Rewrite (Context, N);
Set_Etype (Context, P_Type);
Attr := Context;
end if;
end if;
end if;
-- The prefix must denote an object
if not Is_Object_Reference (P) then
Error_Attr_P ("prefix of attribute % must denote an object");
end if;
-- The prefix cannot be of a limited type because the expansion of
-- Loop_Entry must create a constant initialized by the evaluated
-- prefix.
if Is_Limited_View (Etype (P)) then
Error_Attr_P ("prefix of attribute % cannot be limited");
end if;
-- Climb the parent chain to verify the location of the attribute and
-- find the enclosing loop.
Stmt := Attr;
while Present (Stmt) loop
-- Locate the corresponding enclosing pragma. Note that in the
-- case of Assert[And_Cut] and Assume, we have already checked
-- that the pragma appears in an appropriate loop location.
if Nkind (Original_Node (Stmt)) = N_Pragma
and then
Pragma_Name_Unmapped (Original_Node (Stmt))
in Name_Loop_Invariant
| Name_Loop_Variant
| Name_Assert
| Name_Assert_And_Cut
| Name_Assume
then
Encl_Prag := Original_Node (Stmt);
-- Locate the enclosing loop (if any). Note that Ada 2012 array
-- iteration may be expanded into several nested loops, we are
-- interested in the outermost one which has the loop identifier,
-- and comes from source.
elsif Nkind (Stmt) = N_Loop_Statement
and then Present (Identifier (Stmt))
and then Comes_From_Source (Original_Node (Stmt))
and then Nkind (Original_Node (Stmt)) = N_Loop_Statement
then
Encl_Loop := Stmt;
-- The original attribute reference may lack a loop name. Use
-- the name of the enclosing loop because it is the related
-- loop.
if No (Loop_Id) then
Loop_Id := Entity (Identifier (Encl_Loop));
end if;
exit;
-- Prevent the search from going too far
elsif Is_Body_Or_Package_Declaration (Stmt) then
exit;
end if;
Stmt := Parent (Stmt);
end loop;
-- Loop_Entry must appear within a Loop_Assertion pragma (Assert,
-- Assert_And_Cut, Assume count as loop assertion pragmas for this
-- purpose if they appear in an appropriate location in a loop,
-- which was already checked by the top level pragma circuit).
-- Loop_Entry also denotes a value and as such can appear within an
-- expression that is an argument for another loop aspect. In that
-- case it will have been expanded into the corresponding assignment.
if Expander_Active
and then Nkind (Parent (N)) = N_Assignment_Statement
and then not Comes_From_Source (Parent (N))
then
null;
elsif No (Encl_Prag) then
Error_Attr ("attribute% must appear within appropriate pragma", N);
end if;
-- A Loop_Entry that applies to a given loop statement must not
-- appear within a body of accept statement, if this construct is
-- itself enclosed by the given loop statement.
for Index in reverse 0 .. Scope_Stack.Last loop
Scop := Scope_Stack.Table (Index).Entity;
if Ekind (Scop) = E_Loop and then Scop = Loop_Id then
exit;
elsif Ekind (Scop) in E_Block | E_Loop | E_Return_Statement then
null;
else
Error_Attr
("attribute % cannot appear in body or accept statement", N);
exit;
end if;
end loop;
-- The prefix cannot mention entities declared within the related
-- loop because they will not be visible once the prefix is moved
-- outside the loop.
Check_References_In_Prefix (Loop_Id);
-- The prefix must statically name an object if the pragma does not
-- apply to the innermost enclosing loop statement, or if it appears
-- within a potentially unevaluated expression.
if Is_Entity_Name (P)
or else Nkind (Parent (P)) = N_Object_Renaming_Declaration
or else Statically_Names_Object (P)
then
null;
elsif Present (Encl_Loop)
and then Entity (Identifier (Encl_Loop)) /= Loop_Id
then
Error_Attr_P
("prefix of attribute % that applies to outer loop must denote "
& "an entity");
elsif Is_Potentially_Unevaluated (P) then
Uneval_Old_Msg;
end if;
-- Replace the Loop_Entry attribute reference by its prefix if the
-- related pragma is ignored. This transformation is OK with respect
-- to typing because Loop_Entry's type is that of its prefix. This
-- early transformation also avoids the generation of a useless loop
-- entry constant.
if Present (Encl_Prag) and then Is_Ignored (Encl_Prag) then
Rewrite (N, Relocate_Node (P));
Preanalyze_And_Resolve (N);
else
Preanalyze_And_Resolve (P);
end if;
end Loop_Entry;
-------------
-- Machine --
-------------
when Attribute_Machine =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
------------------
-- Machine_Emax --
------------------
when Attribute_Machine_Emax =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
------------------
-- Machine_Emin --
------------------
when Attribute_Machine_Emin =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
----------------------
-- Machine_Mantissa --
----------------------
when Attribute_Machine_Mantissa =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
-----------------------
-- Machine_Overflows --
-----------------------
when Attribute_Machine_Overflows =>
Check_Real_Type;
Check_E0;
Set_Etype (N, Standard_Boolean);
-------------------
-- Machine_Radix --
-------------------
when Attribute_Machine_Radix =>
Check_Real_Type;
Check_E0;
Set_Etype (N, Universal_Integer);
----------------------
-- Machine_Rounding --
----------------------
when Attribute_Machine_Rounding =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
--------------------
-- Machine_Rounds --
--------------------
when Attribute_Machine_Rounds =>
Check_Real_Type;
Check_E0;
Set_Etype (N, Standard_Boolean);
------------------
-- Machine_Size --
------------------
when Attribute_Machine_Size =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Universal_Integer);
--------------
-- Mantissa --
--------------
when Attribute_Mantissa =>
Check_E0;
Check_Real_Type;
Set_Etype (N, Universal_Integer);
---------
-- Max --
---------
when Attribute_Max =>
Min_Max;
----------------------------------
-- Max_Alignment_For_Allocation --
----------------------------------
when Attribute_Max_Size_In_Storage_Elements =>
Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements;
----------------------
-- Max_Integer_Size --
----------------------
when Attribute_Max_Integer_Size =>
Standard_Attribute (System_Max_Integer_Size);
----------------------------------
-- Max_Size_In_Storage_Elements --
----------------------------------
when Attribute_Max_Alignment_For_Allocation =>
Max_Alignment_For_Allocation_Max_Size_In_Storage_Elements;
-----------------------
-- Maximum_Alignment --
-----------------------
when Attribute_Maximum_Alignment =>
Standard_Attribute (Ttypes.Maximum_Alignment);
--------------------
-- Mechanism_Code --
--------------------
when Attribute_Mechanism_Code =>
if not Is_Entity_Name (P)
or else not Is_Subprogram (Entity (P))
then
Error_Attr_P ("prefix of % attribute must be subprogram");
end if;
Check_Either_E0_Or_E1;
if Present (E1) then
Resolve (E1, Any_Integer);
Set_Etype (E1, Standard_Integer);
if not Is_OK_Static_Expression (E1) then
Flag_Non_Static_Expr
("expression for parameter number must be static!", E1);
Error_Attr;
elsif UI_To_Int (Intval (E1)) > Number_Formals (Entity (P))
or else UI_To_Int (Intval (E1)) < 0
then
Error_Attr ("invalid parameter number for % attribute", E1);
end if;
end if;
Set_Etype (N, Universal_Integer);
---------
-- Min --
---------
when Attribute_Min =>
Min_Max;
---------
-- Mod --
---------
when Attribute_Mod =>
-- Note: this attribute is only allowed in Ada 2005 mode, but
-- we do not need to test that here, since Mod is only recognized
-- as an attribute name in Ada 2005 mode during the parse.
Check_E1;
Check_Modular_Integer_Type;
Resolve (E1, Any_Integer);
Set_Etype (N, P_Base_Type);
-----------
-- Model --
-----------
when Attribute_Model =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
----------------
-- Model_Emin --
----------------
when Attribute_Model_Emin =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
-------------------
-- Model_Epsilon --
-------------------
when Attribute_Model_Epsilon =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Real);
--------------------
-- Model_Mantissa --
--------------------
when Attribute_Model_Mantissa =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
-----------------
-- Model_Small --
-----------------
when Attribute_Model_Small =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Real);
-------------
-- Modulus --
-------------
when Attribute_Modulus =>
Check_E0;
Check_Modular_Integer_Type;
Set_Etype (N, Universal_Integer);
--------------------
-- Null_Parameter --
--------------------
when Attribute_Null_Parameter => Null_Parameter : declare
Parnt : constant Node_Id := Parent (N);
GParnt : constant Node_Id := Parent (Parnt);
procedure Bad_Null_Parameter (Msg : String);
-- Used if bad Null parameter attribute node is found. Issues
-- given error message, and also sets the type to Any_Type to
-- avoid blowups later on from dealing with a junk node.
procedure Must_Be_Imported (Proc_Ent : Entity_Id);
-- Called to check that Proc_Ent is imported subprogram
------------------------
-- Bad_Null_Parameter --
------------------------
procedure Bad_Null_Parameter (Msg : String) is
begin
Error_Msg_N (Msg, N);
Set_Etype (N, Any_Type);
end Bad_Null_Parameter;
----------------------
-- Must_Be_Imported --
----------------------
procedure Must_Be_Imported (Proc_Ent : Entity_Id) is
Pent : constant Entity_Id := Ultimate_Alias (Proc_Ent);
begin
-- Ignore check if procedure not frozen yet (we will get
-- another chance when the default parameter is reanalyzed)
if not Is_Frozen (Pent) then
return;
elsif not Is_Imported (Pent) then
Bad_Null_Parameter
("Null_Parameter can only be used with imported subprogram");
else
return;
end if;
end Must_Be_Imported;
-- Start of processing for Null_Parameter
begin
Check_Type;
Check_E0;
Set_Etype (N, P_Type);
-- Case of attribute used as default expression
if Nkind (Parnt) = N_Parameter_Specification then
Must_Be_Imported (Defining_Entity (GParnt));
-- Case of attribute used as actual for subprogram (positional)
elsif Nkind (Parnt) in N_Subprogram_Call
and then Is_Entity_Name (Name (Parnt))
then
Must_Be_Imported (Entity (Name (Parnt)));
-- Case of attribute used as actual for subprogram (named)
elsif Nkind (Parnt) = N_Parameter_Association
and then Nkind (GParnt) in N_Subprogram_Call
and then Is_Entity_Name (Name (GParnt))
then
Must_Be_Imported (Entity (Name (GParnt)));
-- Not an allowed case
else
Bad_Null_Parameter
("Null_Parameter must be actual or default parameter");
end if;
end Null_Parameter;
-----------------
-- Object_Size --
-----------------
when Attribute_Object_Size =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Universal_Integer);
---------
-- Old --
---------
when Attribute_Old => Old : declare
procedure Check_References_In_Prefix (Subp_Id : Entity_Id);
-- Inspect the contents of the prefix and detect illegal uses of a
-- nested 'Old, attribute 'Result or a use of an entity declared in
-- the related postcondition expression. Subp_Id is the subprogram to
-- which the related postcondition applies.
--------------------------------
-- Check_References_In_Prefix --
--------------------------------
procedure Check_References_In_Prefix (Subp_Id : Entity_Id) is
function Check_Reference (Nod : Node_Id) return Traverse_Result;
-- Detect attribute 'Old, attribute 'Result of a use of an entity
-- and perform the appropriate semantic check.
---------------------
-- Check_Reference --
---------------------
function Check_Reference (Nod : Node_Id) return Traverse_Result is
begin
-- Attributes 'Old and 'Result cannot appear in the prefix of
-- another attribute 'Old.
if Nkind (Nod) = N_Attribute_Reference
and then Attribute_Name (Nod) in Name_Old | Name_Result
then
Error_Msg_Name_1 := Attribute_Name (Nod);
Error_Msg_Name_2 := Name_Old;
Error_Msg_N
("attribute % cannot appear in the prefix of attribute %",
Nod);
return Abandon;
-- Entities mentioned within the prefix of attribute 'Old must
-- be global to the related postcondition. If this is not the
-- case, then the scope of the local entity is nested within
-- that of the subprogram.
elsif Is_Entity_Name (Nod)
and then Present (Entity (Nod))
and then Scope_Within (Scope (Entity (Nod)), Subp_Id)
then
Error_Attr
("prefix of attribute % cannot reference local entities",
Nod);
return Abandon;
-- Otherwise keep inspecting the prefix
else
return OK;
end if;
end Check_Reference;
procedure Check_References is new Traverse_Proc (Check_Reference);
-- Start of processing for Check_References_In_Prefix
begin
Check_References (P);
end Check_References_In_Prefix;
-- Local variables
Legal : Boolean;
Pref_Id : Entity_Id;
Pref_Typ : Entity_Id;
Spec_Id : Entity_Id;
-- Start of processing for Old
begin
-- The attribute reference is a primary. If any expressions follow,
-- then the attribute reference is an indexable object. Transform the
-- attribute into an indexed component and analyze it.
if Present (E1) then
Rewrite (N,
Make_Indexed_Component (Loc,
Prefix =>
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (P),
Attribute_Name => Name_Old),
Expressions => Expressions (N)));
Analyze (N);
return;
end if;
Analyze_Attribute_Old_Result (Legal, Spec_Id);
-- The aspect or pragma where attribute 'Old resides should be
-- associated with a subprogram declaration or a body. If this is not
-- the case, then the aspect or pragma is illegal. Return as analysis
-- cannot be carried out.
-- The exception to this rule is when generating C since in this case
-- postconditions are inlined.
if No (Spec_Id)
and then Modify_Tree_For_C
and then In_Inlined_Body
then
Spec_Id := Entity (P);
elsif not Legal then
return;
end if;
-- The prefix must be preanalyzed as the full analysis will take
-- place during expansion.
Preanalyze_And_Resolve (P);
-- Ensure that the prefix does not contain attributes 'Old or 'Result
Check_References_In_Prefix (Spec_Id);
-- Set the type of the attribute now to prevent cascaded errors
Pref_Typ := Etype (P);
Set_Etype (N, Pref_Typ);
-- Legality checks
if Is_Limited_Type (Pref_Typ) then
Error_Attr ("attribute % cannot apply to limited objects", P);
end if;
-- The prefix is a simple name
if Is_Entity_Name (P) and then Present (Entity (P)) then
Pref_Id := Entity (P);
-- Emit a warning when the prefix is a constant. Note that the use
-- of Error_Attr would reset the type of N to Any_Type even though
-- this is a warning. Use Error_Msg_XXX instead.
if Is_Constant_Object (Pref_Id) then
Error_Msg_Name_1 := Name_Old;
Error_Msg_N
("??attribute % applied to constant has no effect", P);
end if;
-- Otherwise the prefix is not a simple name
else
-- Ensure that the prefix of attribute 'Old is an entity when it
-- is potentially unevaluated (6.1.1 (27/3)). This rule is
-- relaxed in Ada2020 - this relaxation is reflected in the
-- call (below) to Eligible_For_Conditional_Evaluation.
if Is_Potentially_Unevaluated (N)
and then not Statically_Names_Object (P)
and then not
Old_Attr_Util.Conditional_Evaluation
.Eligible_For_Conditional_Evaluation (N)
then
Uneval_Old_Msg;
-- Detect a possible infinite recursion when the prefix denotes
-- the related function.
-- function Func (...) return ...
-- with Post => Func'Old ...;
-- The function may be specified in qualified form X.Y where X is
-- a protected object and Y is a protected function. In that case
-- ensure that the qualified form has an entity.
elsif Nkind (P) = N_Function_Call
and then Nkind (Name (P)) in N_Has_Entity
then
Pref_Id := Entity (Name (P));
if Ekind (Spec_Id) in E_Function | E_Generic_Function
and then Pref_Id = Spec_Id
then
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_N ("!possible infinite recursion<<", P);
Error_Msg_N ("\!??Storage_Error ]<<", P);
end if;
end if;
-- The prefix of attribute 'Old may refer to a component of a
-- formal parameter. In this case its expansion may generate
-- actual subtypes that are referenced in an inner context and
-- that must be elaborated within the subprogram itself. If the
-- prefix includes a function call, it may involve finalization
-- actions that should be inserted when the attribute has been
-- rewritten as a declaration. Create a declaration for the prefix
-- and insert it at the start of the enclosing subprogram. This is
-- an expansion activity that has to be performed now to prevent
-- out-of-order issues.
-- This expansion is both harmful and not needed in SPARK mode,
-- since the formal verification back end relies on the types of
-- nodes (hence is not robust w.r.t. a change to base type here),
-- and does not suffer from the out-of-order issue described
-- above. Thus, this expansion is skipped in SPARK mode.
-- The expansion is not relevant for discrete types, which will
-- not generate extra declarations, and where use of the base type
-- may lead to spurious errors if context is a case.
if not GNATprove_Mode then
if not Is_Discrete_Type (Pref_Typ) then
Pref_Typ := Base_Type (Pref_Typ);
end if;
Set_Etype (N, Pref_Typ);
Set_Etype (P, Pref_Typ);
Analyze_Dimension (N);
Expand (N);
end if;
end if;
end Old;
----------------------
-- Overlaps_Storage --
----------------------
when Attribute_Overlaps_Storage =>
Check_E1;
-- Both arguments must be objects of any type
Analyze_And_Resolve (P);
Analyze_And_Resolve (E1);
Check_Object_Reference (P);
Check_Object_Reference (E1);
Set_Etype (N, Standard_Boolean);
------------
-- Output --
------------
when Attribute_Output =>
Check_E2;
Check_Stream_Attribute (TSS_Stream_Output);
Set_Etype (N, Standard_Void_Type);
Resolve (N, Standard_Void_Type);
------------------
-- Partition_ID --
------------------
when Attribute_Partition_ID =>
Check_E0;
if P_Type /= Any_Type then
if not Is_Library_Level_Entity (Entity (P)) then
Error_Attr_P
("prefix of % attribute must be library-level entity");
-- The defining entity of prefix should not be declared inside a
-- Pure unit. RM E.1(8). Is_Pure was set during declaration.
elsif Is_Entity_Name (P)
and then Is_Pure (Entity (P))
then
Error_Attr_P ("prefix of% attribute must not be declared pure");
end if;
end if;
Set_Etype (N, Universal_Integer);
-------------------------
-- Passed_By_Reference --
-------------------------
when Attribute_Passed_By_Reference =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Standard_Boolean);
------------------
-- Pool_Address --
------------------
when Attribute_Pool_Address =>
Check_E0;
Set_Etype (N, RTE (RE_Address));
---------
-- Pos --
---------
when Attribute_Pos =>
Check_Discrete_Type;
Check_E1;
Resolve (E1, P_Base_Type);
Set_Etype (N, Universal_Integer);
--------------
-- Position --
--------------
when Attribute_Position =>
Check_Component;
Set_Etype (N, Universal_Integer);
----------
-- Pred --
----------
when Attribute_Pred =>
Check_Scalar_Type;
Check_E1;
Resolve (E1, P_Base_Type);
Set_Etype (N, P_Base_Type);
-- Since Pred works on the base type, we normally do no check for the
-- floating-point case, since the base type is unconstrained. But we
-- make an exception in Check_Float_Overflow mode.
if Is_Floating_Point_Type (P_Type) then
if not Range_Checks_Suppressed (P_Base_Type) then
Set_Do_Range_Check (E1);
end if;
-- If not modular type, test for overflow check required
else
if not Is_Modular_Integer_Type (P_Type)
and then not Range_Checks_Suppressed (P_Base_Type)
then
Enable_Range_Check (E1);
end if;
end if;
--------------
-- Priority --
--------------
-- Ada 2005 (AI-327): Dynamic ceiling priorities
when Attribute_Priority =>
if Ada_Version < Ada_2005 then
Error_Attr ("% attribute is allowed only in Ada 2005 mode", P);
end if;
Check_E0;
Check_Restriction (No_Dynamic_Priorities, N);
-- The prefix must be a protected object (AARM D.5.2 (2/2))
Analyze (P);
if Is_Protected_Type (Etype (P))
or else (Is_Access_Type (Etype (P))
and then Is_Protected_Type (Designated_Type (Etype (P))))
then
Resolve (P, Etype (P));
else
Error_Attr_P ("prefix of % attribute must be a protected object");
end if;
Set_Etype (N, Standard_Integer);
-- Must be called from within a protected procedure or entry of the
-- protected object.
declare
S : Entity_Id;
begin
S := Current_Scope;
while S /= Etype (P)
and then S /= Standard_Standard
loop
S := Scope (S);
end loop;
if S = Standard_Standard then
Error_Attr ("the attribute % is only allowed inside protected "
& "operations", P);
end if;
end;
Validate_Non_Static_Attribute_Function_Call;
---------------
-- Put_Image --
---------------
when Attribute_Put_Image =>
Check_E2;
Check_Put_Image_Attribute;
Set_Etype (N, Standard_Void_Type);
Resolve (N, Standard_Void_Type);
-----------
-- Range --
-----------
when Attribute_Range =>
Check_Array_Or_Scalar_Type;
Bad_Attribute_For_Predicate;
if Ada_Version = Ada_83
and then Is_Scalar_Type (P_Type)
and then Comes_From_Source (N)
then
Error_Attr
("(Ada 83) % attribute not allowed for scalar type", P);
end if;
------------
-- Result --
------------
when Attribute_Result => Result : declare
function Denote_Same_Function
(Pref_Id : Entity_Id;
Spec_Id : Entity_Id) return Boolean;
-- Determine whether the entity of the prefix Pref_Id denotes the
-- same entity as that of the related subprogram Spec_Id.
--------------------------
-- Denote_Same_Function --
--------------------------
function Denote_Same_Function
(Pref_Id : Entity_Id;
Spec_Id : Entity_Id) return Boolean
is
Over_Id : constant Entity_Id := Overridden_Operation (Spec_Id);
Subp_Spec : constant Node_Id := Parent (Spec_Id);
begin
-- The prefix denotes the related subprogram
if Pref_Id = Spec_Id then
return True;
-- Account for a special case when attribute 'Result appears in
-- the postcondition of a generic function.
-- generic
-- function Gen_Func return ...
-- with Post => Gen_Func'Result ...;
-- When the generic function is instantiated, the Chars field of
-- the instantiated prefix still denotes the name of the generic
-- function. Note that any preemptive transformation is impossible
-- without a proper analysis. The structure of the wrapper package
-- is as follows:
-- package Anon_Gen_Pack is
-- <subtypes and renamings>
-- function Subp_Decl return ...; -- (!)
-- pragma Postcondition (Gen_Func'Result ...); -- (!)
-- function Gen_Func ... renames Subp_Decl;
-- end Anon_Gen_Pack;
elsif Nkind (Subp_Spec) = N_Function_Specification
and then Present (Generic_Parent (Subp_Spec))
and then Ekind (Pref_Id) in E_Generic_Function | E_Function
then
if Generic_Parent (Subp_Spec) = Pref_Id then
return True;
elsif Present (Alias (Pref_Id))
and then Alias (Pref_Id) = Spec_Id
then
return True;
end if;
-- Account for a special case where a primitive of a tagged type
-- inherits a class-wide postcondition from a parent type. In this
-- case the prefix of attribute 'Result denotes the overriding
-- primitive.
elsif Present (Over_Id) and then Pref_Id = Over_Id then
return True;
end if;
-- Otherwise the prefix does not denote the related subprogram
return False;
end Denote_Same_Function;
-- Local variables
In_Inlined_C_Postcondition : constant Boolean :=
Modify_Tree_For_C
and then In_Inlined_Body;
Legal : Boolean;
Pref_Id : Entity_Id;
Spec_Id : Entity_Id;
-- Start of processing for Result
begin
-- The attribute reference is a primary. If any expressions follow,
-- then the attribute reference is an indexable object. Transform the
-- attribute into an indexed component and analyze it.
if Present (E1) then
Rewrite (N,
Make_Indexed_Component (Loc,
Prefix =>
Make_Attribute_Reference (Loc,
Prefix => Relocate_Node (P),
Attribute_Name => Name_Result),
Expressions => Expressions (N)));
Analyze (N);
return;
end if;
Analyze_Attribute_Old_Result (Legal, Spec_Id);
-- The aspect or pragma where attribute 'Result resides should be
-- associated with a subprogram declaration or a body. If this is not
-- the case, then the aspect or pragma is illegal. Return as analysis
-- cannot be carried out.
-- The exception to this rule is when generating C since in this case
-- postconditions are inlined.
if No (Spec_Id) and then In_Inlined_C_Postcondition then
Spec_Id := Entity (P);
elsif not Legal then
Error_Attr ("prefix of % attribute must be a function", P);
return;
end if;
-- Attribute 'Result is part of a _Postconditions procedure. There is
-- no need to perform the semantic checks below as they were already
-- verified when the attribute was analyzed in its original context.
-- Instead, rewrite the attribute as a reference to formal parameter
-- _Result of the _Postconditions procedure.
if Chars (Spec_Id) = Name_uPostconditions
or else
(In_Inlined_C_Postcondition
and then Nkind (Parent (Spec_Id)) = N_Block_Statement)
then
Rewrite (N, Make_Identifier (Loc, Name_uResult));
-- The type of formal parameter _Result is that of the function
-- encapsulating the _Postconditions procedure. Resolution must
-- be carried out against the function return type.
Analyze_And_Resolve (N, Etype (Scope (Spec_Id)));
-- Otherwise attribute 'Result appears in its original context and
-- all semantic checks should be carried out.
else
-- Verify the legality of the prefix. It must denotes the entity
-- of the related [generic] function.
if Is_Entity_Name (P) then
Pref_Id := Entity (P);
-- Either both the prefix and the annotated spec must be
-- generic functions, or they both must be nongeneric
-- functions, or the prefix must be generic and the spec
-- must be nongeneric (i.e. it must denote an instance).
if (Ekind (Pref_Id) in E_Function | E_Generic_Function
and then Ekind (Pref_Id) = Ekind (Spec_Id))
or else
(Ekind (Pref_Id) = E_Generic_Function
and then Ekind (Spec_Id) = E_Function)
then
if Denote_Same_Function (Pref_Id, Spec_Id) then
-- Correct the prefix of the attribute when the context
-- is a generic function.
if Pref_Id /= Spec_Id then
Rewrite (P, New_Occurrence_Of (Spec_Id, Loc));
Analyze (P);
end if;
Set_Etype (N, Etype (Spec_Id));
-- Otherwise the prefix denotes some unrelated function
else
Error_Msg_Name_2 := Chars (Spec_Id);
Error_Attr
("incorrect prefix for attribute %, expected %", P);
end if;
-- Otherwise the prefix denotes some other form of subprogram
-- entity.
else
Error_Attr
("attribute % can only appear in postcondition of "
& "function", P);
end if;
-- Otherwise the prefix is illegal
else
Error_Msg_Name_2 := Chars (Spec_Id);
Error_Attr ("incorrect prefix for attribute %, expected %", P);
end if;
end if;
end Result;
------------------
-- Range_Length --
------------------
when Attribute_Range_Length =>
Check_E0;
Check_Discrete_Type;
Set_Etype (N, Universal_Integer);
------------
-- Reduce --
------------
when Attribute_Reduce =>
Check_E2;
if not Extensions_Allowed then
Error_Attr
("% attribute only supported under -gnatX", P);
end if;
declare
Stream : constant Node_Id := Prefix (N);
Typ : Entity_Id;
begin
if Nkind (Stream) /= N_Aggregate then
-- Prefix is a name, as for other attributes.
-- If the object is a function we asume that it is not
-- overloaded. AI12-242 does not suggest a name resolution
-- rule for that case, but we can suppose that the expected
-- type of the reduction is the expected type of the component
-- of the prefix.
Analyze_And_Resolve (Stream);
Typ := Etype (Stream);
-- Verify that prefix can be iterated upon.
if Is_Array_Type (Typ)
or else Present (Find_Aspect (Typ, Aspect_Default_Iterator))
or else Present (Find_Aspect (Typ, Aspect_Iterable))
then
null;
else
Error_Msg_NE
("cannot apply reduce to object of type$", N, Typ);
end if;
elsif Present (Expressions (Stream))
or else No (Component_Associations (Stream))
or else Nkind (First (Component_Associations (Stream))) /=
N_Iterated_Component_Association
then
Error_Msg_N
("Prefix of reduce must be an iterated component", N);
end if;
Analyze (E1);
Analyze (E2);
Set_Etype (N, Etype (E2));
end;
----------
-- Read --
----------
when Attribute_Read =>
Check_E2;
Check_Stream_Attribute (TSS_Stream_Read);
Set_Etype (N, Standard_Void_Type);
Resolve (N, Standard_Void_Type);
Note_Possible_Modification (E2, Sure => True);
---------
-- Ref --
---------
when Attribute_Ref =>
Check_E1;
Analyze (P);
if Nkind (P) /= N_Expanded_Name
or else not Is_RTE (P_Type, RE_Address)
then
Error_Attr_P ("prefix of % attribute must be System.Address");
end if;
Analyze_And_Resolve (E1, Any_Integer);
Set_Etype (N, RTE (RE_Address));
---------------
-- Remainder --
---------------
when Attribute_Remainder =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
Resolve (E2, P_Base_Type);
---------------------
-- Restriction_Set --
---------------------
when Attribute_Restriction_Set => Restriction_Set : declare
R : Restriction_Id;
U : Node_Id;
Unam : Unit_Name_Type;
begin
Check_E1;
Analyze (P);
Check_System_Prefix;
-- No_Dependence case
if Nkind (E1) = N_Parameter_Association then
pragma Assert (Chars (Selector_Name (E1)) = Name_No_Dependence);
U := Explicit_Actual_Parameter (E1);
if not OK_No_Dependence_Unit_Name (U) then
Set_Boolean_Result (N, False);
Error_Attr;
end if;
-- See if there is an entry already in the table. That's the
-- case in which we can return True.
for J in No_Dependences.First .. No_Dependences.Last loop
if Designate_Same_Unit (U, No_Dependences.Table (J).Unit)
and then No_Dependences.Table (J).Warn = False
then
Set_Boolean_Result (N, True);
return;
end if;
end loop;
-- If not in the No_Dependence table, result is False
Set_Boolean_Result (N, False);
-- In this case, we must ensure that the binder will reject any
-- other unit in the partition that sets No_Dependence for this
-- unit. We do that by making an entry in the special table kept
-- for this purpose (if the entry is not there already).
Unam := Get_Spec_Name (Get_Unit_Name (U));
for J in Restriction_Set_Dependences.First ..
Restriction_Set_Dependences.Last
loop
if Restriction_Set_Dependences.Table (J) = Unam then
return;
end if;
end loop;
Restriction_Set_Dependences.Append (Unam);
-- Normal restriction case
else
if Nkind (E1) /= N_Identifier then
Set_Boolean_Result (N, False);
Error_Attr ("attribute % requires restriction identifier", E1);
else
R := Get_Restriction_Id (Process_Restriction_Synonyms (E1));
if R = Not_A_Restriction_Id then
Set_Boolean_Result (N, False);
Error_Msg_Node_1 := E1;
Error_Attr ("invalid restriction identifier &", E1);
elsif R not in Partition_Boolean_Restrictions then
Set_Boolean_Result (N, False);
Error_Msg_Node_1 := E1;
Error_Attr
("& is not a boolean partition-wide restriction", E1);
end if;
if Restriction_Active (R) then
Set_Boolean_Result (N, True);
else
Check_Restriction (R, N);
Set_Boolean_Result (N, False);
end if;
end if;
end if;
end Restriction_Set;
-----------
-- Round --
-----------
when Attribute_Round =>
Check_E1;
Check_Decimal_Fixed_Point_Type;
Set_Etype (N, P_Base_Type);
-- Because the context is universal_real (3.5.10(12)) it is a
-- legal context for a universal fixed expression. This is the
-- only attribute whose functional description involves U_R.
if Etype (E1) = Universal_Fixed then
declare
Conv : constant Node_Id := Make_Type_Conversion (Loc,
Subtype_Mark => New_Occurrence_Of (Universal_Real, Loc),
Expression => Relocate_Node (E1));
begin
Rewrite (E1, Conv);
Analyze (E1);
end;
end if;
Resolve (E1, Any_Real);
--------------
-- Rounding --
--------------
when Attribute_Rounding =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
---------------
-- Safe_Emax --
---------------
when Attribute_Safe_Emax =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Integer);
----------------
-- Safe_First --
----------------
when Attribute_Safe_First =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Real);
----------------
-- Safe_Large --
----------------
when Attribute_Safe_Large =>
Check_E0;
Check_Real_Type;
Set_Etype (N, Universal_Real);
---------------
-- Safe_Last --
---------------
when Attribute_Safe_Last =>
Check_Floating_Point_Type_0;
Set_Etype (N, Universal_Real);
----------------
-- Safe_Small --
----------------
when Attribute_Safe_Small =>
Check_E0;
Check_Real_Type;
Set_Etype (N, Universal_Real);
--------------------------
-- Scalar_Storage_Order --
--------------------------
when Attribute_Scalar_Storage_Order => Scalar_Storage_Order : declare
Ent : Entity_Id := Empty;
begin
Check_E0;
Check_Type;
if not (Is_Record_Type (P_Type) or else Is_Array_Type (P_Type)) then
-- The attribute applies to generic private types (in which case
-- the legality rule is applied in the instance) as well as to
-- composite types. For noncomposite types it always returns the
-- default bit order for the target.
-- Allowing formal private types was originally introduced in
-- GNAT_Mode only, to compile instances of Sequential_IO, but
-- users find it more generally useful in generic units.
if not (Is_Generic_Type (P_Type) and then Is_Private_Type (P_Type))
and then not In_Instance
then
Error_Attr_P
("prefix of % attribute must be record or array type");
elsif not Is_Generic_Type (P_Type) then
if Bytes_Big_Endian then
Ent := RTE (RE_High_Order_First);
else
Ent := RTE (RE_Low_Order_First);
end if;
end if;
elsif Bytes_Big_Endian xor Reverse_Storage_Order (P_Type) then
Ent := RTE (RE_High_Order_First);
else
Ent := RTE (RE_Low_Order_First);
end if;
if Present (Ent) then
Rewrite (N, New_Occurrence_Of (Ent, Loc));
end if;
Set_Etype (N, RTE (RE_Bit_Order));
Resolve (N);
-- Reset incorrect indication of staticness
Set_Is_Static_Expression (N, False);
end Scalar_Storage_Order;
-----------
-- Scale --
-----------
when Attribute_Scale =>
Check_E0;
Check_Decimal_Fixed_Point_Type;
Set_Etype (N, Universal_Integer);
-------------
-- Scaling --
-------------
when Attribute_Scaling =>
Check_Floating_Point_Type_2;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
------------------
-- Signed_Zeros --
------------------
when Attribute_Signed_Zeros =>
Check_Floating_Point_Type_0;
Set_Etype (N, Standard_Boolean);
----------
-- Size --
----------
when Attribute_Size
| Attribute_VADS_Size
=>
Check_E0;
-- If prefix is parameterless function call, rewrite and resolve
-- as such.
if Is_Entity_Name (P)
and then Ekind (Entity (P)) = E_Function
then
Resolve (P);
-- Similar processing for a protected function call
elsif Nkind (P) = N_Selected_Component
and then Ekind (Entity (Selector_Name (P))) = E_Function
then
Resolve (P);
end if;
if Is_Object_Reference (P) then
Check_Object_Reference (P);
elsif Is_Entity_Name (P)
and then (Is_Type (Entity (P))
or else Ekind (Entity (P)) = E_Enumeration_Literal)
then
null;
elsif Nkind (P) = N_Type_Conversion
and then not Comes_From_Source (P)
then
null;
-- Some other compilers allow dubious use of X'???'Size
elsif Relaxed_RM_Semantics
and then Nkind (P) = N_Attribute_Reference
then
null;
else
Error_Attr_P ("invalid prefix for % attribute");
end if;
Check_Not_Incomplete_Type;
Check_Not_CPP_Type;
Set_Etype (N, Universal_Integer);
-- If we are processing pragmas Compile_Time_Warning and Compile_
-- Time_Errors after the back end has been called and this occurrence
-- of 'Size is known at compile time then it is safe to perform this
-- evaluation. Needed to perform the static evaluation of the full
-- boolean expression of these pragmas. Note that Known_RM_Size is
-- sometimes True when Size_Known_At_Compile_Time is False, when the
-- back end has computed it.
if In_Compile_Time_Warning_Or_Error
and then Is_Entity_Name (P)
and then (Is_Type (Entity (P))
or else Ekind (Entity (P)) = E_Enumeration_Literal)
and then (Known_RM_Size (Entity (P))
or else Size_Known_At_Compile_Time (Entity (P)))
then
declare
Siz : Uint;
begin
if Known_Static_RM_Size (Entity (P)) then
Siz := RM_Size (Entity (P));
else
Siz := Esize (Entity (P));
end if;
Rewrite (N, Make_Integer_Literal (Sloc (N), Siz));
Analyze (N);
end;
end if;
-----------
-- Small --
-----------
when Attribute_Small =>
Check_E0;
Check_Real_Type;
Set_Etype (N, Universal_Real);
------------------
-- Storage_Pool --
------------------
when Attribute_Storage_Pool
| Attribute_Simple_Storage_Pool
=>
Check_E0;
if Is_Access_Type (P_Type) then
if Ekind (P_Type) = E_Access_Subprogram_Type then
Error_Attr_P
("cannot use % attribute for access-to-subprogram type");
end if;
-- Set appropriate entity
if Present (Associated_Storage_Pool (Root_Type (P_Type))) then
Set_Entity (N, Associated_Storage_Pool (Root_Type (P_Type)));
else
Set_Entity (N, RTE (RE_Global_Pool_Object));
end if;
if Attr_Id = Attribute_Storage_Pool then
if Present (Get_Rep_Pragma (Etype (Entity (N)),
Name_Simple_Storage_Pool_Type))
then
Error_Msg_Name_1 := Aname;
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_N
("cannot use % attribute for type with simple storage "
& "pool<<", N);
Error_Msg_N ("\Program_Error [<<", N);
Rewrite
(N, Make_Raise_Program_Error
(Sloc (N), Reason => PE_Explicit_Raise));
end if;
Set_Etype (N, Class_Wide_Type (RTE (RE_Root_Storage_Pool)));
-- In the Simple_Storage_Pool case, verify that the pool entity is
-- actually of a simple storage pool type, and set the attribute's
-- type to the pool object's type.
else
if not Present (Get_Rep_Pragma (Etype (Entity (N)),
Name_Simple_Storage_Pool_Type))
then
Error_Attr_P
("cannot use % attribute for type without simple " &
"storage pool");
end if;
Set_Etype (N, Etype (Entity (N)));
end if;
-- Validate_Remote_Access_To_Class_Wide_Type for attribute
-- Storage_Pool since this attribute is not defined for such
-- types (RM E.2.2(17)).
Validate_Remote_Access_To_Class_Wide_Type (N);
else
Error_Attr_P ("prefix of % attribute must be access type");
end if;
------------------
-- Storage_Size --
------------------
when Attribute_Storage_Size =>
Check_E0;
if Is_Task_Type (P_Type) then
Set_Etype (N, Universal_Integer);
-- Use with tasks is an obsolescent feature
Check_Restriction (No_Obsolescent_Features, P);
elsif Is_Access_Type (P_Type) then
if Ekind (P_Type) = E_Access_Subprogram_Type then
Error_Attr_P
("cannot use % attribute for access-to-subprogram type");
end if;
if Is_Entity_Name (P)
and then Is_Type (Entity (P))
then
Check_Type;
Set_Etype (N, Universal_Integer);
-- Validate_Remote_Access_To_Class_Wide_Type for attribute
-- Storage_Size since this attribute is not defined for
-- such types (RM E.2.2(17)).
Validate_Remote_Access_To_Class_Wide_Type (N);
-- The prefix is allowed to be an implicit dereference of an
-- access value designating a task.
else
Check_Task_Prefix;
Set_Etype (N, Universal_Integer);
end if;
else
Error_Attr_P ("prefix of % attribute must be access or task type");
end if;
------------------
-- Storage_Unit --
------------------
when Attribute_Storage_Unit =>
Standard_Attribute (Ttypes.System_Storage_Unit);
-----------------
-- Stream_Size --
-----------------
when Attribute_Stream_Size =>
Check_E0;
Check_Type;
if Is_Entity_Name (P)
and then Is_Elementary_Type (Entity (P))
then
Set_Etype (N, Universal_Integer);
else
Error_Attr_P ("invalid prefix for % attribute");
end if;
---------------
-- Stub_Type --
---------------
when Attribute_Stub_Type =>
Check_Type;
Check_E0;
if Is_Remote_Access_To_Class_Wide_Type (Base_Type (P_Type)) then
-- For a real RACW [sub]type, use corresponding stub type
if not Is_Generic_Type (P_Type) then
Rewrite (N,
New_Occurrence_Of
(Corresponding_Stub_Type (Base_Type (P_Type)), Loc));
-- For a generic type (that has been marked as an RACW using the
-- Remote_Access_Type aspect or pragma), use a generic RACW stub
-- type. Note that if the actual is not a remote access type, the
-- instantiation will fail.
else
-- Note: we go to the underlying type here because the view
-- returned by RTE (RE_RACW_Stub_Type) might be incomplete.
Rewrite (N,
New_Occurrence_Of
(Underlying_Type (RTE (RE_RACW_Stub_Type)), Loc));
end if;
else
Error_Attr_P
("prefix of% attribute must be remote access-to-class-wide");
end if;
----------
-- Succ --
----------
when Attribute_Succ =>
Check_Scalar_Type;
Check_E1;
Resolve (E1, P_Base_Type);
Set_Etype (N, P_Base_Type);
-- Since Pred works on the base type, we normally do no check for the
-- floating-point case, since the base type is unconstrained. But we
-- make an exception in Check_Float_Overflow mode.
if Is_Floating_Point_Type (P_Type) then
if not Range_Checks_Suppressed (P_Base_Type) then
Set_Do_Range_Check (E1);
end if;
-- If not modular type, test for overflow check required
else
if not Is_Modular_Integer_Type (P_Type)
and then not Range_Checks_Suppressed (P_Base_Type)
then
Enable_Range_Check (E1);
end if;
end if;
--------------------------------
-- System_Allocator_Alignment --
--------------------------------
when Attribute_System_Allocator_Alignment =>
Standard_Attribute (Ttypes.System_Allocator_Alignment);
---------
-- Tag --
---------
when Attribute_Tag =>
Check_E0;
Check_Dereference;
if not Is_Tagged_Type (P_Type) then
Error_Attr_P ("prefix of % attribute must be tagged");
-- Next test does not apply to generated code why not, and what does
-- the illegal reference mean???
elsif Is_Object_Reference (P)
and then not Is_Class_Wide_Type (P_Type)
and then Comes_From_Source (N)
then
Error_Attr_P
("% attribute can only be applied to objects " &
"of class - wide type");
end if;
-- The prefix cannot be an incomplete type. However, references to
-- 'Tag can be generated when expanding interface conversions, and
-- this is legal.
if Comes_From_Source (N) then
Check_Not_Incomplete_Type;
end if;
-- Set appropriate type
Set_Etype (N, RTE (RE_Tag));
-----------------
-- Target_Name --
-----------------
when Attribute_Target_Name => Target_Name : declare
TN : constant String := Sdefault.Target_Name.all;
TL : Natural;
begin
Check_Standard_Prefix;
TL := TN'Last;
if TN (TL) = '/' or else TN (TL) = '\' then
TL := TL - 1;
end if;
Rewrite (N,
Make_String_Literal (Loc,
Strval => TN (TN'First .. TL)));
Analyze_And_Resolve (N, Standard_String);
Set_Is_Static_Expression (N, True);
end Target_Name;
----------------
-- Terminated --
----------------
when Attribute_Terminated =>
Check_E0;
Set_Etype (N, Standard_Boolean);
Check_Task_Prefix;
----------------
-- To_Address --
----------------
when Attribute_To_Address => To_Address : declare
Val : Uint;
begin
Check_E1;
Analyze (P);
Check_System_Prefix;
Generate_Reference (RTE (RE_Address), P);
Analyze_And_Resolve (E1, Any_Integer);
Set_Etype (N, RTE (RE_Address));
Set_Is_Static_Expression (N, Is_Static_Expression (E1));
-- OK static expression case, check range and set appropriate type
if Is_OK_Static_Expression (E1) then
Val := Expr_Value (E1);
if Val < -(Uint_2 ** (System_Address_Size - 1))
or else
Val > Uint_2 ** System_Address_Size - 1
then
Error_Attr ("address value out of range for % attribute", E1);
end if;
-- In most cases the expression is a numeric literal or some other
-- address expression, but if it is a declared constant it may be
-- of a compatible type that must be left on the node.
if Is_Entity_Name (E1) then
null;
-- Set type to universal integer if negative
elsif Val < 0 then
Set_Etype (E1, Universal_Integer);
-- Otherwise set type to Unsigned_64 to accommodate large values
else
Set_Etype (E1, Standard_Unsigned_64);
end if;
end if;
end To_Address;
------------
-- To_Any --
------------
when Attribute_To_Any =>
Check_E1;
Check_PolyORB_Attribute;
Set_Etype (N, RTE (RE_Any));
----------------
-- Truncation --
----------------
when Attribute_Truncation =>
Check_Floating_Point_Type_1;
Resolve (E1, P_Base_Type);
Set_Etype (N, P_Base_Type);
----------------
-- Type_Class --
----------------
when Attribute_Type_Class =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, RTE (RE_Type_Class));
--------------
-- TypeCode --
--------------
when Attribute_TypeCode =>
Check_E0;
Check_PolyORB_Attribute;
Set_Etype (N, RTE (RE_TypeCode));
--------------
-- Type_Key --
--------------
when Attribute_Type_Key => Type_Key : declare
Full_Name : constant String_Id :=
Fully_Qualified_Name_String (Entity (P));
CRC : CRC32;
-- The computed signature for the type
Deref : Boolean;
-- To simplify the handling of mutually recursive types, follow a
-- single dereference link in a composite type.
procedure Compute_Type_Key (T : Entity_Id);
-- Create a CRC integer from the declaration of the type. For a
-- composite type, fold in the representation of its components in
-- recursive fashion. We use directly the source representation of
-- the types involved.
----------------------
-- Compute_Type_Key --
----------------------
procedure Compute_Type_Key (T : Entity_Id) is
Buffer : Source_Buffer_Ptr;
P_Max : Source_Ptr;
P_Min : Source_Ptr;
Rep : Node_Id;
SFI : Source_File_Index;
procedure Process_One_Declaration;
-- Update CRC with the characters of one type declaration, or a
-- representation pragma that applies to the type.
-----------------------------
-- Process_One_Declaration --
-----------------------------
procedure Process_One_Declaration is
begin
-- Scan type declaration, skipping blanks
for Ptr in P_Min .. P_Max loop
if Buffer (Ptr) /= ' ' then
System.CRC32.Update (CRC, Buffer (Ptr));
end if;
end loop;
end Process_One_Declaration;
-- Start of processing for Compute_Type_Key
begin
if Is_Itype (T) then
return;
end if;
-- If the type is declared in Standard, there is no source, so
-- just use its name.
if Scope (T) = Standard_Standard then
declare
Name : constant String := Get_Name_String (Chars (T));
begin
for J in Name'Range loop
System.CRC32.Update (CRC, Name (J));
end loop;
end;
return;
end if;
Sloc_Range (Enclosing_Declaration (T), P_Min, P_Max);
SFI := Get_Source_File_Index (P_Min);
pragma Assert (SFI = Get_Source_File_Index (P_Max));
Buffer := Source_Text (SFI);
Process_One_Declaration;
-- Recurse on relevant component types
if Is_Array_Type (T) then
Compute_Type_Key (Component_Type (T));
elsif Is_Access_Type (T) then
if not Deref then
Deref := True;
Compute_Type_Key (Designated_Type (T));
end if;
elsif Is_Derived_Type (T) then
Compute_Type_Key (Etype (T));
elsif Is_Record_Type (T) then
declare
Comp : Entity_Id;
begin
Comp := First_Component (T);
while Present (Comp) loop
Compute_Type_Key (Etype (Comp));
Next_Component (Comp);
end loop;
end;
end if;
if Is_First_Subtype (T) then
-- Fold in representation aspects for the type, which appear in
-- the same source buffer. If the representation aspects are in
-- a different source file, then skip them; they apply to some
-- other type, perhaps one we're derived from.
Rep := First_Rep_Item (T);
while Present (Rep) loop
if Comes_From_Source (Rep) then
Sloc_Range (Rep, P_Min, P_Max);
if SFI = Get_Source_File_Index (P_Min) then
pragma Assert (SFI = Get_Source_File_Index (P_Max));
Process_One_Declaration;
end if;
end if;
Next_Rep_Item (Rep);
end loop;
end if;
end Compute_Type_Key;
-- Start of processing for Type_Key
begin
Check_E0;
Check_Type;
Start_String;
Deref := False;
-- Copy all characters in Full_Name but the trailing NUL
for J in 1 .. String_Length (Full_Name) - 1 loop
Store_String_Char (Get_String_Char (Full_Name, Pos (J)));
end loop;
-- Compute CRC and convert it to string one character at a time, so
-- as not to use Image within the compiler.
Initialize (CRC);
Compute_Type_Key (Entity (P));
if not Is_Frozen (Entity (P)) then
Error_Msg_N ("premature usage of Type_Key?", N);
end if;
while CRC > 0 loop
Store_String_Char (Character'Val (48 + (CRC rem 10)));
CRC := CRC / 10;
end loop;
Rewrite (N, Make_String_Literal (Loc, End_String));
Analyze_And_Resolve (N, Standard_String);
end Type_Key;
-----------------------
-- Unbiased_Rounding --
-----------------------
when Attribute_Unbiased_Rounding =>
Check_Floating_Point_Type_1;
Set_Etype (N, P_Base_Type);
Resolve (E1, P_Base_Type);
----------------------
-- Unchecked_Access --
----------------------
when Attribute_Unchecked_Access =>
if Comes_From_Source (N) then
Check_Restriction (No_Unchecked_Access, N);
end if;
Analyze_Access_Attribute;
Check_Not_Incomplete_Type;
-------------------------
-- Unconstrained_Array --
-------------------------
when Attribute_Unconstrained_Array =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Standard_Boolean);
Set_Is_Static_Expression (N, True);
------------------------------
-- Universal_Literal_String --
------------------------------
-- This is a GNAT specific attribute whose prefix must be a named
-- number where the expression is either a single numeric literal,
-- or a numeric literal immediately preceded by a minus sign. The
-- result is equivalent to a string literal containing the text of
-- the literal as it appeared in the source program with a possible
-- leading minus sign.
when Attribute_Universal_Literal_String =>
Check_E0;
if not Is_Entity_Name (P)
or else Ekind (Entity (P)) not in Named_Kind
then
Error_Attr_P ("prefix for % attribute must be named number");
else
declare
Expr : Node_Id;
Negative : Boolean;
S : Source_Ptr;
Src : Source_Buffer_Ptr;
begin
Expr := Original_Node (Expression (Parent (Entity (P))));
if Nkind (Expr) = N_Op_Minus then
Negative := True;
Expr := Original_Node (Right_Opnd (Expr));
else
Negative := False;
end if;
if Nkind (Expr) not in N_Integer_Literal | N_Real_Literal then
Error_Attr
("named number for % attribute must be simple literal", N);
end if;
-- Build string literal corresponding to source literal text
Start_String;
if Negative then
Store_String_Char (Get_Char_Code ('-'));
end if;
S := Sloc (Expr);
Src := Source_Text (Get_Source_File_Index (S));
while Src (S) /= ';' and then Src (S) /= ' ' loop
Store_String_Char (Get_Char_Code (Src (S)));
S := S + 1;
end loop;
-- Now we rewrite the attribute with the string literal
Rewrite (N,
Make_String_Literal (Loc, End_String));
Analyze (N);
Set_Is_Static_Expression (N, True);
end;
end if;
-------------------------
-- Unrestricted_Access --
-------------------------
-- This is a GNAT specific attribute which is like Access except that
-- all scope checks and checks for aliased views are omitted. It is
-- documented as being equivalent to the use of the Address attribute
-- followed by an unchecked conversion to the target access type.
when Attribute_Unrestricted_Access =>
-- If from source, deal with relevant restrictions
if Comes_From_Source (N) then
Check_Restriction (No_Unchecked_Access, N);
if Nkind (P) in N_Has_Entity
and then Present (Entity (P))
and then Is_Object (Entity (P))
then
Check_Restriction (No_Implicit_Aliasing, N);
end if;
end if;
if Is_Entity_Name (P) then
Set_Address_Taken (Entity (P));
end if;
-- It might seem reasonable to call Address_Checks here to apply the
-- same set of semantic checks that we enforce for 'Address (after
-- all we document Unrestricted_Access as being equivalent to the
-- use of Address followed by an Unchecked_Conversion). However, if
-- we do enable these checks, we get multiple failures in both the
-- compiler run-time and in our regression test suite, so we leave
-- out these checks for now. To be investigated further some time???
-- Address_Checks;
-- Now complete analysis using common access processing
Analyze_Access_Attribute;
------------
-- Update --
------------
when Attribute_Update => Update : declare
Common_Typ : Entity_Id;
-- The common type of a multiple component update for a record
Comps : Elist_Id := No_Elist;
-- A list used in the resolution of a record update. It contains the
-- entities of all record components processed so far.
procedure Analyze_Array_Component_Update (Assoc : Node_Id);
-- Analyze and resolve array_component_association Assoc against the
-- index of array type P_Type.
procedure Analyze_Record_Component_Update (Comp : Node_Id);
-- Analyze and resolve record_component_association Comp against
-- record type P_Type.
------------------------------------
-- Analyze_Array_Component_Update --
------------------------------------
procedure Analyze_Array_Component_Update (Assoc : Node_Id) is
Expr : Node_Id;
High : Node_Id;
Index : Node_Id;
Index_Typ : Entity_Id;
Low : Node_Id;
begin
-- The current association contains a sequence of indexes denoting
-- an element of a multidimensional array:
-- (Index_1, ..., Index_N)
-- Examine each individual index and resolve it against the proper
-- index type of the array.
if Nkind (First (Choices (Assoc))) = N_Aggregate then
Expr := First (Choices (Assoc));
while Present (Expr) loop
-- The use of others is illegal (SPARK RM 4.4.1(12))
if Nkind (Expr) = N_Others_Choice then
Error_Attr
("others choice not allowed in attribute %", Expr);
-- Otherwise analyze and resolve all indexes
else
Index := First (Expressions (Expr));
Index_Typ := First_Index (P_Type);
while Present (Index) and then Present (Index_Typ) loop
Analyze_And_Resolve (Index, Etype (Index_Typ));
Next (Index);
Next_Index (Index_Typ);
end loop;
-- Detect a case where the association either lacks an
-- index or contains an extra index.
if Present (Index) or else Present (Index_Typ) then
Error_Msg_N
("dimension mismatch in index list", Assoc);
end if;
end if;
Next (Expr);
end loop;
-- The current association denotes either a single component or a
-- range of components of a one dimensional array:
-- 1, 2 .. 5
-- Resolve the index or its high and low bounds (if range) against
-- the proper index type of the array.
else
Index := First (Choices (Assoc));
Index_Typ := First_Index (P_Type);
if Present (Next_Index (Index_Typ)) then
Error_Msg_N ("too few subscripts in array reference", Assoc);
end if;
while Present (Index) loop
-- The use of others is illegal (SPARK RM 4.4.1(12))
if Nkind (Index) = N_Others_Choice then
Error_Attr
("others choice not allowed in attribute %", Index);
-- The index denotes a range of elements
elsif Nkind (Index) = N_Range then
Low := Low_Bound (Index);
High := High_Bound (Index);
Analyze_And_Resolve (Low, Etype (Index_Typ));
Analyze_And_Resolve (High, Etype (Index_Typ));
-- Otherwise the index denotes a single element
else
Analyze_And_Resolve (Index, Etype (Index_Typ));
end if;
Next (Index);
end loop;
end if;
end Analyze_Array_Component_Update;
-------------------------------------
-- Analyze_Record_Component_Update --
-------------------------------------
procedure Analyze_Record_Component_Update (Comp : Node_Id) is
Comp_Name : constant Name_Id := Chars (Comp);
Base_Typ : Entity_Id;
Comp_Or_Discr : Entity_Id;
begin
-- Find the discriminant or component whose name corresponds to
-- Comp. A simple character comparison is sufficient because all
-- visible names within a record type are unique.
Comp_Or_Discr := First_Entity (P_Type);
while Present (Comp_Or_Discr) loop
if Chars (Comp_Or_Discr) = Comp_Name then
-- Decorate the component reference by setting its entity
-- and type for resolution purposes.
Set_Entity (Comp, Comp_Or_Discr);
Set_Etype (Comp, Etype (Comp_Or_Discr));
exit;
end if;
Next_Entity (Comp_Or_Discr);
end loop;
-- Diagnose an illegal reference
if Present (Comp_Or_Discr) then
if Ekind (Comp_Or_Discr) = E_Discriminant then
Error_Attr
("attribute % may not modify record discriminants", Comp);
else pragma Assert (Ekind (Comp_Or_Discr) = E_Component);
if Contains (Comps, Comp_Or_Discr) then
Error_Msg_N ("component & already updated", Comp);
-- Mark this component as processed
else
Append_New_Elmt (Comp_Or_Discr, Comps);
end if;
end if;
-- The update aggregate mentions an entity that does not belong to
-- the record type.
else
Error_Msg_N ("& is not a component of aggregate subtype", Comp);
end if;
-- Verify the consistency of types when the current component is
-- part of a multiple component update.
-- Comp_1 | ... | Comp_N => <value>
if Present (Etype (Comp)) then
Base_Typ := Base_Type (Etype (Comp));
-- Save the type of the first component reference as the
-- remaning references (if any) must resolve to this type.
if No (Common_Typ) then
Common_Typ := Base_Typ;
elsif Base_Typ /= Common_Typ then
Error_Msg_N
("components in choice list must have same type", Comp);
end if;
end if;
end Analyze_Record_Component_Update;
-- Local variables
Assoc : Node_Id;
Comp : Node_Id;
-- Start of processing for Update
begin
if Warn_On_Obsolescent_Feature then
Error_Msg_N ("?j?attribute Update is an obsolescent feature", N);
Error_Msg_N ("\?j?use a delta aggregate instead", N);
end if;
Check_E1;
if not Is_Object_Reference (P) then
Error_Attr_P ("prefix of attribute % must denote an object");
elsif not Is_Array_Type (P_Type)
and then not Is_Record_Type (P_Type)
then
Error_Attr_P ("prefix of attribute % must be a record or array");
elsif Is_Limited_View (P_Type) then
Error_Attr ("prefix of attribute % cannot be limited", N);
elsif Nkind (E1) /= N_Aggregate then
Error_Attr ("attribute % requires component association list", N);
elsif Present (Expressions (E1)) then
Error_Attr ("attribute % requires named component associations",
First (Expressions (E1)));
end if;
-- Inspect the update aggregate, looking at all the associations and
-- choices. Perform the following checks:
-- 1) Legality of "others" in all cases
-- 2) Legality of <>
-- 3) Component legality for arrays
-- 4) Component legality for records
-- The remaining checks are performed on the expanded attribute
Assoc := First (Component_Associations (E1));
while Present (Assoc) loop
-- The use of <> is illegal (SPARK RM 4.4.1(1))
if Box_Present (Assoc) then
Error_Attr
("default initialization not allowed in attribute %", Assoc);
-- Otherwise process the association
else
Analyze (Expression (Assoc));
if Is_Array_Type (P_Type) then
Analyze_Array_Component_Update (Assoc);
elsif Is_Record_Type (P_Type) then
-- Reset the common type used in a multiple component update
-- as we are processing the contents of a new association.
Common_Typ := Empty;
Comp := First (Choices (Assoc));
while Present (Comp) loop
if Nkind (Comp) = N_Identifier then
Analyze_Record_Component_Update (Comp);
-- The use of others is illegal (SPARK RM 4.4.1(5))
elsif Nkind (Comp) = N_Others_Choice then
Error_Attr
("others choice not allowed in attribute %", Comp);
-- The name of a record component cannot appear in any
-- other form.
else
Error_Msg_N
("name should be identifier or OTHERS", Comp);
end if;
Next (Comp);
end loop;
end if;
end if;
Next (Assoc);
end loop;
-- The type of attribute 'Update is that of the prefix
Set_Etype (N, P_Type);
Sem_Warn.Warn_On_Suspicious_Update (N);
end Update;
---------
-- Val --
---------
when Attribute_Val =>
Check_E1;
Check_Discrete_Type;
-- Note, we need a range check in general, but we wait for the
-- Resolve call to do this, since we want to let Eval_Attribute
-- have a chance to find an static illegality first.
Resolve (E1, Any_Integer);
Set_Etype (N, P_Base_Type);
-----------
-- Valid --
-----------
when Attribute_Valid => Valid : declare
Pred_Func : constant Entity_Id := Predicate_Function (P_Type);
begin
Check_E0;
-- Ignore check for object if we have a 'Valid reference generated
-- by the expanded code, since in some cases valid checks can occur
-- on items that are names, but are not objects (e.g. attributes).
if Comes_From_Source (N) then
Check_Object_Reference (P);
if not Is_Scalar_Type (P_Type) then
Error_Attr_P ("object for % attribute must be of scalar type");
end if;
-- If the attribute appears within the subtype's own predicate
-- function, then issue a warning that this will cause infinite
-- recursion.
if Present (Pred_Func) and then Current_Scope = Pred_Func then
Error_Msg_N ("attribute Valid requires a predicate check??", N);
Error_Msg_N ("\and will result in infinite recursion??", N);
end if;
end if;
Set_Etype (N, Standard_Boolean);
end Valid;
-------------------
-- Valid_Scalars --
-------------------
when Attribute_Valid_Scalars => Valid_Scalars : declare
begin
Check_E0;
if Comes_From_Source (N) then
Check_Object_Reference (P);
-- Do not emit any diagnostics related to private types to avoid
-- disclosing the structure of the type.
if Is_Private_Type (P_Type) then
-- Attribute 'Valid_Scalars is not supported on private tagged
-- types due to a code generation issue. Is_Visible_Component
-- does not allow for a component of a private tagged type to
-- be successfully retrieved.
-- ??? This attribute should simply ignore type privacy
-- (see Validated_View). It should examine components of the
-- tagged type extensions (if any) and recursively examine
-- 'Valid_Scalars of the parent's type (if any).
-- Do not use Error_Attr_P because this bypasses any subsequent
-- processing and leaves the attribute with type Any_Type. This
-- in turn prevents the proper expansion of the attribute into
-- True.
if Is_Tagged_Type (P_Type) then
Error_Msg_Name_1 := Aname;
Error_Msg_N ("??effects of attribute % are ignored", N);
end if;
-- Otherwise the type is not private
else
if not Scalar_Part_Present (P_Type) then
Error_Msg_Name_1 := Aname;
Error_Msg_F
("??attribute % always True, no scalars to check", P);
Set_Boolean_Result (N, True);
end if;
-- Attribute 'Valid_Scalars is illegal on unchecked union types
-- because it is not always guaranteed that the components are
-- retrievable based on whether the discriminants are inferable
if Has_Unchecked_Union (P_Type) then
Error_Attr_P
("attribute % not allowed for Unchecked_Union type");
end if;
end if;
end if;
Set_Etype (N, Standard_Boolean);
end Valid_Scalars;
-----------
-- Value --
-----------
when Attribute_Value =>
Check_E1;
Check_Scalar_Type;
-- Case of enumeration type
-- When an enumeration type appears in an attribute reference, all
-- literals of the type are marked as referenced. This must only be
-- done if the attribute reference appears in the current source.
-- Otherwise the information on references may differ between a
-- normal compilation and one that performs inlining.
if Is_Enumeration_Type (P_Type)
and then In_Extended_Main_Code_Unit (N)
then
Check_Restriction (No_Enumeration_Maps, N);
-- Mark all enumeration literals as referenced, since the use of
-- the Value attribute can implicitly reference any of the
-- literals of the enumeration base type.
declare
Ent : Entity_Id := First_Literal (P_Base_Type);
begin
while Present (Ent) loop
Set_Referenced (Ent);
Next_Literal (Ent);
end loop;
end;
end if;
-- Set Etype before resolving expression because expansion of
-- expression may require enclosing type. Note that the type
-- returned by 'Value is the base type of the prefix type.
Set_Etype (N, P_Base_Type);
Validate_Non_Static_Attribute_Function_Call;
-- Check restriction No_Fixed_IO
if Restriction_Check_Required (No_Fixed_IO)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
----------------
-- Value_Size --
----------------
when Attribute_Value_Size =>
Check_E0;
Check_Type;
Check_Not_Incomplete_Type;
Set_Etype (N, Universal_Integer);
-------------
-- Version --
-------------
when Attribute_Version =>
Check_E0;
Check_Program_Unit;
Set_Etype (N, RTE (RE_Version_String));
------------------
-- Wchar_T_Size --
------------------
when Attribute_Wchar_T_Size =>
Standard_Attribute (Interfaces_Wchar_T_Size);
----------------
-- Wide_Image --
----------------
when Attribute_Wide_Image =>
Analyze_Image_Attribute (Standard_Wide_String);
---------------------
-- Wide_Wide_Image --
---------------------
when Attribute_Wide_Wide_Image =>
Analyze_Image_Attribute (Standard_Wide_Wide_String);
----------------
-- Wide_Value --
----------------
when Attribute_Wide_Value =>
Check_E1;
Check_Scalar_Type;
-- Set Etype before resolving expression because expansion
-- of expression may require enclosing type.
Set_Etype (N, P_Type);
Validate_Non_Static_Attribute_Function_Call;
-- Check restriction No_Fixed_IO
if Restriction_Check_Required (No_Fixed_IO)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
---------------------
-- Wide_Wide_Value --
---------------------
when Attribute_Wide_Wide_Value =>
Check_E1;
Check_Scalar_Type;
-- Set Etype before resolving expression because expansion
-- of expression may require enclosing type.
Set_Etype (N, P_Type);
Validate_Non_Static_Attribute_Function_Call;
-- Check restriction No_Fixed_IO
if Restriction_Check_Required (No_Fixed_IO)
and then Is_Fixed_Point_Type (P_Type)
then
Check_Restriction (No_Fixed_IO, P);
end if;
---------------------
-- Wide_Wide_Width --
---------------------
when Attribute_Wide_Wide_Width =>
Check_E0;
Check_Scalar_Type;
Set_Etype (N, Universal_Integer);
----------------
-- Wide_Width --
----------------
when Attribute_Wide_Width =>
Check_E0;
Check_Scalar_Type;
Set_Etype (N, Universal_Integer);
-----------
-- Width --
-----------
when Attribute_Width =>
Check_E0;
Check_Scalar_Type;
Set_Etype (N, Universal_Integer);
---------------
-- Word_Size --
---------------
when Attribute_Word_Size =>
Standard_Attribute (System_Word_Size);
-----------
-- Write --
-----------
when Attribute_Write =>
Check_E2;
Check_Stream_Attribute (TSS_Stream_Write);
Set_Etype (N, Standard_Void_Type);
Resolve (N, Standard_Void_Type);
end case;
-- In SPARK certain attributes (see below) depend on Tasking_State.
-- Ensure that the entity is available for gnat2why by loading it.
-- See SPARK RM 9(18) for the relevant rule.
if GNATprove_Mode then
case Attr_Id is
when Attribute_Callable
| Attribute_Caller
| Attribute_Count
| Attribute_Terminated
=>
SPARK_Implicit_Load (RE_Tasking_State);
when others =>
null;
end case;
end if;
-- All errors raise Bad_Attribute, so that we get out before any further
-- damage occurs when an error is detected (for example, if we check for
-- one attribute expression, and the check succeeds, we want to be able
-- to proceed securely assuming that an expression is in fact present.
-- Note: we set the attribute analyzed in this case to prevent any
-- attempt at reanalysis which could generate spurious error msgs.
exception
when Bad_Attribute =>
Set_Analyzed (N);
Set_Etype (N, Any_Type);
return;
end Analyze_Attribute;
--------------------
-- Eval_Attribute --
--------------------
procedure Eval_Attribute (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
C_Type : constant Entity_Id := Etype (N);
-- The type imposed by the context
Aname : Name_Id;
-- Attribute_Name (N) after verification of validity of N
Id : Attribute_Id;
-- Get_Attribute_Id (Aname) after Aname is set
P : Node_Id;
-- Prefix (N) after verification of validity of N
E1 : Node_Id;
-- First expression, or Empty if none
E2 : Node_Id;
-- Second expression, or Empty if none
P_Entity : Entity_Id;
-- Entity denoted by prefix
P_Type : Entity_Id;
-- The type of the prefix
P_Base_Type : Entity_Id;
-- The base type of the prefix type
P_Root_Type : Entity_Id;
-- The root type of the prefix type
Static : Boolean := False;
-- True if the result is Static. This is set by the general processing
-- to true if the prefix is static, and all expressions are static. It
-- can be reset as processing continues for particular attributes. This
-- flag can still be True if the reference raises a constraint error.
-- Is_Static_Expression (N) is set to follow this value as it is set
-- and we could always reference this, but it is convenient to have a
-- simple short name to use, since it is frequently referenced.
Lo_Bound, Hi_Bound : Node_Id;
-- Expressions for low and high bounds of type or array index referenced
-- by First, Last, or Length attribute for array, set by Set_Bounds.
CE_Node : Node_Id;
-- Constraint error node used if we have an attribute reference has
-- an argument that raises a constraint error. In this case we replace
-- the attribute with a raise constraint_error node. This is important
-- processing, since otherwise gigi might see an attribute which it is
-- unprepared to deal with.
procedure Check_Concurrent_Discriminant (Bound : Node_Id);
-- If Bound is a reference to a discriminant of a task or protected type
-- occurring within the object's body, rewrite attribute reference into
-- a reference to the corresponding discriminal. Use for the expansion
-- of checks against bounds of entry family index subtypes.
procedure Check_Expressions;
-- In case where the attribute is not foldable, the expressions, if
-- any, of the attribute, are in a non-static context. This procedure
-- performs the required additional checks.
function Compile_Time_Known_Bounds (Typ : Entity_Id) return Boolean;
-- Determines if the given type has compile time known bounds. Note
-- that we enter the case statement even in cases where the prefix
-- type does NOT have known bounds, so it is important to guard any
-- attempt to evaluate both bounds with a call to this function.
procedure Compile_Time_Known_Attribute (N : Node_Id; Val : Uint);
-- This procedure is called when the attribute N has a non-static
-- but compile time known value given by Val. It includes the
-- necessary checks for out of range values.
function Fore_Value return Nat;
-- Computes the Fore value for the current attribute prefix, which is
-- known to be a static fixed-point type. Used by Fore and Width.
function Mantissa return Uint;
-- Returns the Mantissa value for the prefix type
procedure Set_Bounds;
-- Used for First, Last and Length attributes applied to an array or
-- array subtype. Sets the variables Lo_Bound and Hi_Bound to the low
-- and high bound expressions for the index referenced by the attribute
-- designator (i.e. the first index if no expression is present, and the
-- N'th index if the value N is present as an expression). Also used for
-- First and Last of scalar types and for First_Valid and Last_Valid.
-- Static is reset to False if the type or index type is not statically
-- constrained.
-----------------------------------
-- Check_Concurrent_Discriminant --
-----------------------------------
procedure Check_Concurrent_Discriminant (Bound : Node_Id) is
Tsk : Entity_Id;
-- The concurrent (task or protected) type
begin
if Nkind (Bound) = N_Identifier
and then Ekind (Entity (Bound)) = E_Discriminant
and then Is_Concurrent_Record_Type (Scope (Entity (Bound)))
then
Tsk := Corresponding_Concurrent_Type (Scope (Entity (Bound)));
if In_Open_Scopes (Tsk) and then Has_Completion (Tsk) then
-- Find discriminant of original concurrent type, and use
-- its current discriminal, which is the renaming within
-- the task/protected body.
Rewrite (N,
New_Occurrence_Of
(Find_Body_Discriminal (Entity (Bound)), Loc));
end if;
end if;
end Check_Concurrent_Discriminant;
-----------------------
-- Check_Expressions --
-----------------------
procedure Check_Expressions is
E : Node_Id;
begin
E := E1;
while Present (E) loop
Check_Non_Static_Context (E);
Next (E);
end loop;
end Check_Expressions;
----------------------------------
-- Compile_Time_Known_Attribute --
----------------------------------
procedure Compile_Time_Known_Attribute (N : Node_Id; Val : Uint) is
T : constant Entity_Id := Etype (N);
begin
Fold_Uint (N, Val, False);
-- Check that result is in bounds of the type if it is static
if Is_In_Range (N, T, Assume_Valid => False) then
null;
elsif Is_Out_Of_Range (N, T) then
Apply_Compile_Time_Constraint_Error
(N, "value not in range of}??", CE_Range_Check_Failed);
elsif not Range_Checks_Suppressed (T) then
Enable_Range_Check (N);
else
Set_Do_Range_Check (N, False);
end if;
end Compile_Time_Known_Attribute;
-------------------------------
-- Compile_Time_Known_Bounds --
-------------------------------
function Compile_Time_Known_Bounds (Typ : Entity_Id) return Boolean is
begin
return
Compile_Time_Known_Value (Type_Low_Bound (Typ))
and then
Compile_Time_Known_Value (Type_High_Bound (Typ));
end Compile_Time_Known_Bounds;
----------------
-- Fore_Value --
----------------
-- Note that the Fore calculation is based on the actual values
-- of the bounds, and does not take into account possible rounding.
function Fore_Value return Nat is
Lo : constant Uint := Expr_Value (Type_Low_Bound (P_Type));
Hi : constant Uint := Expr_Value (Type_High_Bound (P_Type));
Small : constant Ureal := Small_Value (P_Type);
Lo_Real : constant Ureal := Lo * Small;
Hi_Real : constant Ureal := Hi * Small;
T : Ureal;
R : Nat;
begin
-- Bounds are given in terms of small units, so first compute
-- proper values as reals.
T := UR_Max (abs Lo_Real, abs Hi_Real);
R := 2;
-- Loop to compute proper value if more than one digit required
while T >= Ureal_10 loop
R := R + 1;
T := T / Ureal_10;
end loop;
return R;
end Fore_Value;
--------------
-- Mantissa --
--------------
-- Table of mantissa values accessed by function Computed using
-- the relation:
-- T'Mantissa = integer next above (D * log(10)/log(2)) + 1)
-- where D is T'Digits (RM83 3.5.7)
Mantissa_Value : constant array (Nat range 1 .. 40) of Nat := (
1 => 5,
2 => 8,
3 => 11,
4 => 15,
5 => 18,
6 => 21,
7 => 25,
8 => 28,
9 => 31,
10 => 35,
11 => 38,
12 => 41,
13 => 45,
14 => 48,
15 => 51,
16 => 55,
17 => 58,
18 => 61,
19 => 65,
20 => 68,
21 => 71,
22 => 75,
23 => 78,
24 => 81,
25 => 85,
26 => 88,
27 => 91,
28 => 95,
29 => 98,
30 => 101,
31 => 104,
32 => 108,
33 => 111,
34 => 114,
35 => 118,
36 => 121,
37 => 124,
38 => 128,
39 => 131,
40 => 134);
function Mantissa return Uint is
begin
return
UI_From_Int (Mantissa_Value (UI_To_Int (Digits_Value (P_Type))));
end Mantissa;
----------------
-- Set_Bounds --
----------------
procedure Set_Bounds is
Ndim : Nat;
Indx : Node_Id;
Ityp : Entity_Id;
begin
-- For a string literal subtype, we have to construct the bounds.
-- Valid Ada code never applies attributes to string literals, but
-- it is convenient to allow the expander to generate attribute
-- references of this type (e.g. First and Last applied to a string
-- literal).
-- Note that the whole point of the E_String_Literal_Subtype is to
-- avoid this construction of bounds, but the cases in which we
-- have to materialize them are rare enough that we don't worry.
-- The low bound is simply the low bound of the base type. The
-- high bound is computed from the length of the string and this
-- low bound.
if Ekind (P_Type) = E_String_Literal_Subtype then
Ityp := Etype (First_Index (Base_Type (P_Type)));
Lo_Bound := Type_Low_Bound (Ityp);
Hi_Bound :=
Make_Integer_Literal (Sloc (P),
Intval =>
Expr_Value (Lo_Bound) + String_Literal_Length (P_Type) - 1);
Set_Parent (Hi_Bound, P);
Analyze_And_Resolve (Hi_Bound, Etype (Lo_Bound));
return;
-- For non-array case, just get bounds of scalar type
elsif Is_Scalar_Type (P_Type) then
Ityp := P_Type;
-- For a fixed-point type, we must freeze to get the attributes
-- of the fixed-point type set now so we can reference them.
if Is_Fixed_Point_Type (P_Type)
and then not Is_Frozen (Base_Type (P_Type))
and then Compile_Time_Known_Value (Type_Low_Bound (P_Type))
and then Compile_Time_Known_Value (Type_High_Bound (P_Type))
then
Freeze_Fixed_Point_Type (Base_Type (P_Type));
end if;
-- For array case, get type of proper index
else
if No (E1) then
Ndim := 1;
else
Ndim := UI_To_Int (Expr_Value (E1));
end if;
Indx := First_Index (P_Type);
for J in 1 .. Ndim - 1 loop
Next_Index (Indx);
end loop;
-- If no index type, get out (some other error occurred, and
-- we don't have enough information to complete the job).
if No (Indx) then
Lo_Bound := Error;
Hi_Bound := Error;
return;
end if;
Ityp := Etype (Indx);
end if;
-- A discrete range in an index constraint is allowed to be a
-- subtype indication. This is syntactically a pain, but should
-- not propagate to the entity for the corresponding index subtype.
-- After checking that the subtype indication is legal, the range
-- of the subtype indication should be transfered to the entity.
-- The attributes for the bounds should remain the simple retrievals
-- that they are now.
Lo_Bound := Type_Low_Bound (Ityp);
Hi_Bound := Type_High_Bound (Ityp);
-- If subtype is non-static, result is definitely non-static
if not Is_Static_Subtype (Ityp) then
Static := False;
Set_Is_Static_Expression (N, False);
-- Subtype is static, does it raise CE?
elsif not Is_OK_Static_Subtype (Ityp) then
Set_Raises_Constraint_Error (N);
end if;
end Set_Bounds;
-- Start of processing for Eval_Attribute
begin
-- Return immediately if e.g. N has been rewritten or is malformed due
-- to previous errors.
if Nkind (N) /= N_Attribute_Reference then
return;
end if;
Aname := Attribute_Name (N);
Id := Get_Attribute_Id (Aname);
P := Prefix (N);
-- The To_Address attribute can be static, but it cannot be evaluated at
-- compile time, so just return.
if Id = Attribute_To_Address then
return;
end if;
-- Initialize result as non-static, will be reset if appropriate
Set_Is_Static_Expression (N, False);
-- Acquire first two expressions (at the moment, no attributes take more
-- than two expressions in any case).
if Present (Expressions (N)) then
E1 := First (Expressions (N));
E2 := Next (E1);
else
E1 := Empty;
E2 := Empty;
end if;
-- Special processing for Enabled attribute. This attribute has a very
-- special prefix, and the easiest way to avoid lots of special checks
-- to protect this special prefix from causing trouble is to deal with
-- this attribute immediately and be done with it.
if Id = Attribute_Enabled then
-- We skip evaluation if the expander is not active. This is not just
-- an optimization. It is of key importance that we not rewrite the
-- attribute in a generic template, since we want to pick up the
-- setting of the check in the instance.
if not Inside_A_Generic then
declare
C : constant Check_Id := Get_Check_Id (Chars (P));
R : Boolean;
begin
if No (E1) then
if C in Predefined_Check_Id then
R := Scope_Suppress.Suppress (C);
else
R := Is_Check_Suppressed (Empty, C);
end if;
else
R := Is_Check_Suppressed (Entity (E1), C);
end if;
Rewrite (N, New_Occurrence_Of (Boolean_Literals (not R), Loc));
end;
end if;
return;
end if;
-- Attribute 'Img applied to a static enumeration value is static, and
-- we will do the folding right here (things get confused if we let this
-- case go through the normal circuitry).
if Attribute_Name (N) = Name_Img
and then Is_Entity_Name (P)
and then Is_Enumeration_Type (Etype (Entity (P)))
and then Is_OK_Static_Expression (P)
then
declare
Lit : constant Entity_Id := Expr_Value_E (P);
Str : String_Id;
begin
Start_String;
Get_Unqualified_Decoded_Name_String (Chars (Lit));
Set_Casing (All_Upper_Case);
Store_String_Chars (Name_Buffer (1 .. Name_Len));
Str := End_String;
Rewrite (N, Make_String_Literal (Loc, Strval => Str));
Analyze_And_Resolve (N, Standard_String);
Set_Is_Static_Expression (N, True);
end;
return;
end if;
-- Special processing for cases where the prefix is an object or value,
-- including string literals (attributes of string literals can only
-- appear in generated code) and current instance prefixes in type or
-- subtype aspects.
if Is_Object_Reference (P)
or else Is_Current_Instance_Reference_In_Type_Aspect (P)
or else Nkind (P) = N_String_Literal
or else (Is_Entity_Name (P)
and then Ekind (Entity (P)) = E_Enumeration_Literal)
then
-- For Alignment, give alignment of object if available, otherwise we
-- cannot fold Alignment.
if Id = Attribute_Alignment then
if Is_Entity_Name (P) and then Known_Alignment (Entity (P)) then
Compile_Time_Known_Attribute (N, Alignment (Entity (P)));
else
Check_Expressions;
end if;
return;
-- For Component_Size, the prefix is an array object, and we apply
-- the attribute to the type of the object. This is allowed for both
-- unconstrained and constrained arrays, since the bounds have no
-- influence on the value of this attribute.
elsif Id = Attribute_Component_Size then
P_Entity := Etype (P);
-- For Enum_Rep, evaluation depends on the nature of the prefix and
-- the optional argument.
elsif Id = Attribute_Enum_Rep then
if Is_Entity_Name (P) then
declare
Enum_Expr : Node_Id;
-- The enumeration-type expression of interest
begin
-- P'Enum_Rep case
if Ekind (Entity (P)) in E_Constant | E_Enumeration_Literal
then
Enum_Expr := P;
-- Enum_Type'Enum_Rep (E1) case
elsif Is_Enumeration_Type (Entity (P)) then
Enum_Expr := E1;
-- Otherwise the attribute must be expanded into a
-- conversion and evaluated at run time.
else
Check_Expressions;
return;
end if;
-- We can fold if the expression is an enumeration
-- literal, or if it denotes a constant whose value
-- is known at compile time.
if Nkind (Enum_Expr) in N_Has_Entity
and then (Ekind (Entity (Enum_Expr)) =
E_Enumeration_Literal
or else
(Ekind (Entity (Enum_Expr)) = E_Constant
and then Nkind (Parent (Entity (Enum_Expr))) =
N_Object_Declaration
and then Present
(Expression (Parent (Entity (P))))
and then Compile_Time_Known_Value
(Expression (Parent (Entity (P))))))
then
P_Entity := Etype (P);
else
Check_Expressions;
return;
end if;
end;
-- Otherwise the attribute is illegal, do not attempt to perform
-- any kind of folding.
else
return;
end if;
-- For Bit_Position, give Component_Bit_Offset of object if available
-- otherwise we cannot fold Bit_Position. Note that the attribute can
-- be applied to a naked record component in generated code, in which
-- case the prefix is an identifier that references the component or
-- discriminant entity.
elsif Id = Attribute_Bit_Position then
declare
CE : Entity_Id;
begin
if Is_Entity_Name (P) then
CE := Entity (P);
else
CE := Entity (Selector_Name (P));
end if;
if Known_Static_Component_Bit_Offset (CE) then
Compile_Time_Known_Attribute
(N, Component_Bit_Offset (Entity (P)));
else
Check_Expressions;
end if;
return;
end;
-- For Position, in Ada 2005 (or later) if we have the non-default
-- bit order, we return the original value as given in the component
-- clause (RM 2005 13.5.2(3/2)). Otherwise (Ada 83/95, or later with
-- default bit order) return the value if it is known statically.
elsif Id = Attribute_Position then
declare
CE : constant Entity_Id := Entity (Selector_Name (P));
begin
if Present (Component_Clause (CE))
and then Ada_Version >= Ada_2005
and then Reverse_Bit_Order (Scope (CE))
then
Compile_Time_Known_Attribute
(N, Expr_Value (Position (Component_Clause (CE))));
elsif Known_Static_Component_Bit_Offset (CE) then
Compile_Time_Known_Attribute
(N, Component_Bit_Offset (CE) / System_Storage_Unit);
else
Check_Expressions;
end if;
return;
end;
-- For First_Bit, in Ada 2005 (or later) if we have the non-default
-- bit order, we return the original value as given in the component
-- clause (RM 2005 13.5.2(3/2)). Otherwise (Ada 83/95, or later with
-- default bit order) return the value if it is known statically.
elsif Id = Attribute_First_Bit then
declare
CE : constant Entity_Id := Entity (Selector_Name (P));
begin
if Present (Component_Clause (CE))
and then Ada_Version >= Ada_2005
and then Reverse_Bit_Order (Scope (CE))
then
Compile_Time_Known_Attribute
(N, Expr_Value (First_Bit (Component_Clause (CE))));
elsif Known_Static_Component_Bit_Offset (CE) then
Compile_Time_Known_Attribute
(N, Component_Bit_Offset (CE) mod System_Storage_Unit);
else
Check_Expressions;
end if;
return;
end;
-- For Last_Bit, in Ada 2005 (or later) if we have the non-default
-- bit order, we return the original value as given in the component
-- clause (RM 2005 13.5.2(3/2)). Otherwise (Ada 83/95, or later with
-- default bit order) return the value if it is known statically.
elsif Id = Attribute_Last_Bit then
declare
CE : constant Entity_Id := Entity (Selector_Name (P));
begin
if Present (Component_Clause (CE))
and then Ada_Version >= Ada_2005
and then Reverse_Bit_Order (Scope (CE))
then
Compile_Time_Known_Attribute
(N, Expr_Value (Last_Bit (Component_Clause (CE))));
elsif Known_Static_Component_Bit_Offset (CE)
and then Known_Static_Esize (CE)
then
Compile_Time_Known_Attribute
(N, (Component_Bit_Offset (CE) mod System_Storage_Unit)
+ Esize (CE) - 1);
else
Check_Expressions;
end if;
return;
end;
-- For First, Last and Length, the prefix is an array object, and we
-- apply the attribute to its type, but we need a constrained type
-- for this, so we use the actual subtype if available.
elsif Id = Attribute_First
or else Id = Attribute_Last
or else Id = Attribute_Length
then
declare
AS : constant Entity_Id := Get_Actual_Subtype_If_Available (P);
begin
if Present (AS) and then Is_Constrained (AS) then
P_Entity := AS;
-- If we have an unconstrained type we cannot fold
else
Check_Expressions;
return;
end if;
end;
-- For Size, give size of object if available, otherwise we
-- cannot fold Size.
elsif Id = Attribute_Size then
if Is_Entity_Name (P)
and then Known_Static_Esize (Entity (P))
then
Compile_Time_Known_Attribute (N, Esize (Entity (P)));
else
Check_Expressions;
end if;
return;
-- For Lock_Free, we apply the attribute to the type of the object.
-- This is allowed since we have already verified that the type is a
-- protected type.
elsif Id = Attribute_Lock_Free then
P_Entity := Etype (P);
-- No other attributes for objects are folded
else
Check_Expressions;
return;
end if;
-- Cases where P is not an object. Cannot do anything if P is not the
-- name of an entity.
elsif not Is_Entity_Name (P) then
Check_Expressions;
return;
-- Otherwise get prefix entity
else
P_Entity := Entity (P);
end if;
-- If we are asked to evaluate an attribute where the prefix is a
-- non-frozen generic actual type whose RM_Size is still set to zero,
-- then abandon the effort.
if Is_Type (P_Entity)
and then (not Is_Frozen (P_Entity)
and then Is_Generic_Actual_Type (P_Entity)
and then RM_Size (P_Entity) = 0)
-- However, the attribute Unconstrained_Array must be evaluated,
-- since it is documented to be a static attribute (and can for
-- example appear in a Compile_Time_Warning pragma). The frozen
-- status of the type does not affect its evaluation.
and then Id /= Attribute_Unconstrained_Array
then
return;
end if;
-- At this stage P_Entity is the entity to which the attribute
-- is to be applied. This is usually simply the entity of the
-- prefix, except in some cases of attributes for objects, where
-- as described above, we apply the attribute to the object type.
-- Here is where we make sure that static attributes are properly
-- marked as such. These are attributes whose prefix is a static
-- scalar subtype, whose result is scalar, and whose arguments, if
-- present, are static scalar expressions. Note that such references
-- are static expressions even if they raise Constraint_Error.
-- For example, Boolean'Pos (1/0 = 0) is a static expression, even
-- though evaluating it raises constraint error. This means that a
-- declaration like:
-- X : constant := (if True then 1 else Boolean'Pos (1/0 = 0));
-- is legal, since here this expression appears in a statically
-- unevaluated position, so it does not actually raise an exception.
--
-- T'Descriptor_Size is never static, even if T is static.
if Is_Scalar_Type (P_Entity)
and then (not Is_Generic_Type (P_Entity))
and then Is_Static_Subtype (P_Entity)
and then Is_Scalar_Type (Etype (N))
and then
(No (E1)
or else (Is_Static_Expression (E1)
and then Is_Scalar_Type (Etype (E1))))
and then
(No (E2)
or else (Is_Static_Expression (E2)
and then Is_Scalar_Type (Etype (E1))))
and then Id /= Attribute_Descriptor_Size
then
Static := True;
Set_Is_Static_Expression (N, True);
end if;
-- First foldable possibility is a scalar or array type (RM 4.9(7))
-- that is not generic (generic types are eliminated by RM 4.9(25)).
-- Note we allow nonstatic nongeneric types at this stage as further
-- described below.
if Is_Type (P_Entity)
and then (Is_Scalar_Type (P_Entity) or Is_Array_Type (P_Entity))
and then (not Is_Generic_Type (P_Entity))
then
P_Type := P_Entity;
-- Second foldable possibility is an array object (RM 4.9(8))
elsif Ekind (P_Entity) in E_Variable | E_Constant
and then Is_Array_Type (Etype (P_Entity))
and then (not Is_Generic_Type (Etype (P_Entity)))
then
P_Type := Etype (P_Entity);
-- If the entity is an array constant with an unconstrained nominal
-- subtype then get the type from the initial value. If the value has
-- been expanded into assignments, there is no expression and the
-- attribute reference remains dynamic.
-- We could do better here and retrieve the type ???
if Ekind (P_Entity) = E_Constant
and then not Is_Constrained (P_Type)
then
if No (Constant_Value (P_Entity)) then
return;
else
P_Type := Etype (Constant_Value (P_Entity));
end if;
end if;
-- Definite must be folded if the prefix is not a generic type, that
-- is to say if we are within an instantiation. Same processing applies
-- to selected GNAT attributes.
elsif (Id = Attribute_Atomic_Always_Lock_Free or else
Id = Attribute_Definite or else
Id = Attribute_Descriptor_Size or else
Id = Attribute_Has_Access_Values or else
Id = Attribute_Has_Discriminants or else
Id = Attribute_Has_Tagged_Values or else
Id = Attribute_Lock_Free or else
Id = Attribute_Type_Class or else
Id = Attribute_Unconstrained_Array or else
Id = Attribute_Max_Alignment_For_Allocation)
and then not Is_Generic_Type (P_Entity)
then
P_Type := P_Entity;
-- We can fold 'Size applied to a type if the size is known (as happens
-- for a size from an attribute definition clause). At this stage, this
-- can happen only for types (e.g. record types) for which the size is
-- always non-static. We exclude generic types from consideration (since
-- they have bogus sizes set within templates). We can also fold
-- Max_Size_In_Storage_Elements in the same cases.
elsif (Id = Attribute_Size or
Id = Attribute_Max_Size_In_Storage_Elements)
and then Is_Type (P_Entity)
and then (not Is_Generic_Type (P_Entity))
and then Known_Static_RM_Size (P_Entity)
then
declare
Attr_Value : Uint := RM_Size (P_Entity);
begin
if Id = Attribute_Max_Size_In_Storage_Elements then
Attr_Value := (Attr_Value + System_Storage_Unit - 1)
/ System_Storage_Unit;
end if;
Compile_Time_Known_Attribute (N, Attr_Value);
end;
return;
-- We can fold 'Alignment applied to a type if the alignment is known
-- (as happens for an alignment from an attribute definition clause).
-- At this stage, this can happen only for types (e.g. record types) for
-- which the size is always non-static. We exclude generic types from
-- consideration (since they have bogus sizes set within templates).
elsif Id = Attribute_Alignment
and then Is_Type (P_Entity)
and then (not Is_Generic_Type (P_Entity))
and then Known_Alignment (P_Entity)
then
Compile_Time_Known_Attribute (N, Alignment (P_Entity));
return;
-- If this is an access attribute that is known to fail accessibility
-- check, rewrite accordingly.
elsif Attribute_Name (N) = Name_Access
and then Raises_Constraint_Error (N)
then
Rewrite (N,
Make_Raise_Program_Error (Loc,
Reason => PE_Accessibility_Check_Failed));
Set_Etype (N, C_Type);
return;
-- No other cases are foldable (they certainly aren't static, and at
-- the moment we don't try to fold any cases other than the ones above).
else
Check_Expressions;
return;
end if;
-- If either attribute or the prefix is Any_Type, then propagate
-- Any_Type to the result and don't do anything else at all.
if P_Type = Any_Type
or else (Present (E1) and then Etype (E1) = Any_Type)
or else (Present (E2) and then Etype (E2) = Any_Type)
then
Set_Etype (N, Any_Type);
return;
end if;
-- Scalar subtype case. We have not yet enforced the static requirement
-- of (RM 4.9(7)) and we don't intend to just yet, since there are cases
-- of non-static attribute references (e.g. S'Digits for a non-static
-- floating-point type, which we can compute at compile time).
-- Note: this folding of non-static attributes is not simply a case of
-- optimization. For many of the attributes affected, Gigi cannot handle
-- the attribute and depends on the front end having folded them away.
-- Note: although we don't require staticness at this stage, we do set
-- the Static variable to record the staticness, for easy reference by
-- those attributes where it matters (e.g. Succ and Pred), and also to
-- be used to ensure that non-static folded things are not marked as
-- being static (a check that is done right at the end).
P_Root_Type := Root_Type (P_Type);
P_Base_Type := Base_Type (P_Type);
-- If the root type or base type is generic, then we cannot fold. This
-- test is needed because subtypes of generic types are not always
-- marked as being generic themselves (which seems odd???)
if Is_Generic_Type (P_Root_Type)
or else Is_Generic_Type (P_Base_Type)
then
return;
end if;
if Is_Scalar_Type (P_Type) then
if not Is_Static_Subtype (P_Type) then
Static := False;
Set_Is_Static_Expression (N, False);
elsif not Is_OK_Static_Subtype (P_Type) then
Set_Raises_Constraint_Error (N);
end if;
-- Array case. We enforce the constrained requirement of (RM 4.9(7-8))
-- since we can't do anything with unconstrained arrays. In addition,
-- only the First, Last and Length attributes are possibly static.
-- Atomic_Always_Lock_Free, Definite, Descriptor_Size, Has_Access_Values
-- Has_Discriminants, Has_Tagged_Values, Lock_Free, Type_Class, and
-- Unconstrained_Array are again exceptions, because they apply as well
-- to unconstrained types.
-- In addition Component_Size is an exception since it is possibly
-- foldable, even though it is never static, and it does apply to
-- unconstrained arrays. Furthermore, it is essential to fold this
-- in the packed case, since otherwise the value will be incorrect.
elsif Id = Attribute_Atomic_Always_Lock_Free or else
Id = Attribute_Definite or else
Id = Attribute_Descriptor_Size or else
Id = Attribute_Has_Access_Values or else
Id = Attribute_Has_Discriminants or else
Id = Attribute_Has_Tagged_Values or else
Id = Attribute_Lock_Free or else
Id = Attribute_Type_Class or else
Id = Attribute_Unconstrained_Array or else
Id = Attribute_Component_Size
then
Static := False;
Set_Is_Static_Expression (N, False);
elsif Id /= Attribute_Max_Alignment_For_Allocation then
if not Is_Constrained (P_Type)
or else (Id /= Attribute_First and then
Id /= Attribute_Last and then
Id /= Attribute_Length)
then
Check_Expressions;
return;
end if;
-- The rules in (RM 4.9(7,8)) require a static array, but as in the
-- scalar case, we hold off on enforcing staticness, since there are
-- cases which we can fold at compile time even though they are not
-- static (e.g. 'Length applied to a static index, even though other
-- non-static indexes make the array type non-static). This is only
-- an optimization, but it falls out essentially free, so why not.
-- Again we compute the variable Static for easy reference later
-- (note that no array attributes are static in Ada 83).
-- We also need to set Static properly for subsequent legality checks
-- which might otherwise accept non-static constants in contexts
-- where they are not legal.
Static :=
Ada_Version >= Ada_95 and then Statically_Denotes_Entity (P);
Set_Is_Static_Expression (N, Static);
declare
Nod : Node_Id;
begin
Nod := First_Index (P_Type);
-- The expression is static if the array type is constrained
-- by given bounds, and not by an initial expression. Constant
-- strings are static in any case.
if Root_Type (P_Type) /= Standard_String then
Static :=
Static and then not Is_Constr_Subt_For_U_Nominal (P_Type);
Set_Is_Static_Expression (N, Static);
end if;
while Present (Nod) loop
if not Is_Static_Subtype (Etype (Nod)) then
Static := False;
Set_Is_Static_Expression (N, False);
elsif not Is_OK_Static_Subtype (Etype (Nod)) then
Set_Raises_Constraint_Error (N);
Static := False;
Set_Is_Static_Expression (N, False);
end if;
-- If however the index type is generic, or derived from
-- one, attributes cannot be folded.
if Is_Generic_Type (Root_Type (Etype (Nod)))
and then Id /= Attribute_Component_Size
then
return;
end if;
Next_Index (Nod);
end loop;
end;
end if;
-- Check any expressions that are present. Note that these expressions,
-- depending on the particular attribute type, are either part of the
-- attribute designator, or they are arguments in a case where the
-- attribute reference returns a function. In the latter case, the
-- rule in (RM 4.9(22)) applies and in particular requires the type
-- of the expressions to be scalar in order for the attribute to be
-- considered to be static.
declare
E : Node_Id;
begin
E := E1;
while Present (E) loop
-- If expression is not static, then the attribute reference
-- result certainly cannot be static.
if not Is_Static_Expression (E) then
Static := False;
Set_Is_Static_Expression (N, False);
end if;
if Raises_Constraint_Error (E) then
Set_Raises_Constraint_Error (N);
end if;
-- If the result is not known at compile time, or is not of
-- a scalar type, then the result is definitely not static,
-- so we can quit now.
if not Compile_Time_Known_Value (E)
or else not Is_Scalar_Type (Etype (E))
then
Check_Expressions;
return;
-- If the expression raises a constraint error, then so does
-- the attribute reference. We keep going in this case because
-- we are still interested in whether the attribute reference
-- is static even if it is not static.
elsif Raises_Constraint_Error (E) then
Set_Raises_Constraint_Error (N);
end if;
Next (E);
end loop;
if Raises_Constraint_Error (Prefix (N)) then
Set_Is_Static_Expression (N, False);
return;
end if;
end;
-- Deal with the case of a static attribute reference that raises
-- constraint error. The Raises_Constraint_Error flag will already
-- have been set, and the Static flag shows whether the attribute
-- reference is static. In any case we certainly can't fold such an
-- attribute reference.
-- Note that the rewriting of the attribute node with the constraint
-- error node is essential in this case, because otherwise Gigi might
-- blow up on one of the attributes it never expects to see.
-- The constraint_error node must have the type imposed by the context,
-- to avoid spurious errors in the enclosing expression.
if Raises_Constraint_Error (N) then
CE_Node :=
Make_Raise_Constraint_Error (Sloc (N),
Reason => CE_Range_Check_Failed);
Set_Etype (CE_Node, Etype (N));
Set_Raises_Constraint_Error (CE_Node);
Check_Expressions;
Rewrite (N, Relocate_Node (CE_Node));
Set_Raises_Constraint_Error (N, True);
return;
end if;
-- At this point we have a potentially foldable attribute reference.
-- If Static is set, then the attribute reference definitely obeys
-- the requirements in (RM 4.9(7,8,22)), and it definitely can be
-- folded. If Static is not set, then the attribute may or may not
-- be foldable, and the individual attribute processing routines
-- test Static as required in cases where it makes a difference.
-- In the case where Static is not set, we do know that all the
-- expressions present are at least known at compile time (we assumed
-- above that if this was not the case, then there was no hope of static
-- evaluation). However, we did not require that the bounds of the
-- prefix type be compile time known, let alone static). That's because
-- there are many attributes that can be computed at compile time on
-- non-static subtypes, even though such references are not static
-- expressions.
-- For VAX float, the root type is an IEEE type. So make sure to use the
-- base type instead of the root-type for floating point attributes.
case Id is
-- Attributes related to Ada 2012 iterators; nothing to evaluate for
-- these.
when Attribute_Constant_Indexing
| Attribute_Default_Iterator
| Attribute_Implicit_Dereference
| Attribute_Iterator_Element
| Attribute_Iterable
| Attribute_Reduce
| Attribute_Variable_Indexing
=>
null;
-- Internal attributes used to deal with Ada 2012 delayed aspects.
-- These were already rejected by the parser. Thus they shouldn't
-- appear here.
when Internal_Attribute_Id =>
raise Program_Error;
--------------
-- Adjacent --
--------------
when Attribute_Adjacent =>
Fold_Ureal
(N,
Eval_Fat.Adjacent
(P_Base_Type, Expr_Value_R (E1), Expr_Value_R (E2)),
Static);
---------
-- Aft --
---------
when Attribute_Aft =>
Fold_Uint (N, Aft_Value (P_Type), Static);
---------------
-- Alignment --
---------------
when Attribute_Alignment => Alignment_Block : declare
P_TypeA : constant Entity_Id := Underlying_Type (P_Type);
begin
-- Fold if alignment is set and not otherwise
if Known_Alignment (P_TypeA) then
Fold_Uint (N, Alignment (P_TypeA), Static);
end if;
end Alignment_Block;
-----------------------------
-- Atomic_Always_Lock_Free --
-----------------------------
-- Atomic_Always_Lock_Free attribute is a Boolean, thus no need to fold
-- here.
when Attribute_Atomic_Always_Lock_Free => Atomic_Always_Lock_Free :
declare
V : constant Entity_Id :=
Boolean_Literals
(Support_Atomic_Primitives_On_Target
and then Support_Atomic_Primitives (P_Type));
begin
Rewrite (N, New_Occurrence_Of (V, Loc));
-- Analyze and resolve as boolean. Note that this attribute is a
-- static attribute in GNAT.
Analyze_And_Resolve (N, Standard_Boolean);
Static := True;
Set_Is_Static_Expression (N);
end Atomic_Always_Lock_Free;
---------
-- Bit --
---------
-- Bit can never be folded
when Attribute_Bit =>
null;
------------------
-- Body_Version --
------------------
-- Body_version can never be static
when Attribute_Body_Version =>
null;
-------------
-- Ceiling --
-------------
when Attribute_Ceiling =>
Fold_Ureal
(N, Eval_Fat.Ceiling (P_Base_Type, Expr_Value_R (E1)), Static);
--------------------
-- Component_Size --
--------------------
-- Fold Component_Size if it is known at compile time, which is always
-- true in the packed array case. It is important that the packed array
-- case is handled here since the back end would otherwise get confused
-- by the equivalent packed array type.
when Attribute_Component_Size =>
if Known_Static_Component_Size (P_Type) then
Fold_Uint (N, Component_Size (P_Type), Static);
end if;
-------------
-- Compose --
-------------
when Attribute_Compose =>
Fold_Ureal
(N,
Eval_Fat.Compose (P_Base_Type, Expr_Value_R (E1), Expr_Value (E2)),
Static);
-----------------
-- Constrained --
-----------------
-- Constrained is never folded for now, there may be cases that
-- could be handled at compile time. To be looked at later.
when Attribute_Constrained =>
-- The expander might fold it and set the static flag accordingly,
-- but with expansion disabled, it remains as an attribute reference,
-- and this reference is not static.
Set_Is_Static_Expression (N, False);
---------------
-- Copy_Sign --
---------------
when Attribute_Copy_Sign =>
Fold_Ureal
(N,
Eval_Fat.Copy_Sign
(P_Base_Type, Expr_Value_R (E1), Expr_Value_R (E2)),
Static);
--------------
-- Definite --
--------------
when Attribute_Definite =>
Rewrite (N, New_Occurrence_Of (
Boolean_Literals (Is_Definite_Subtype (P_Entity)), Loc));
Analyze_And_Resolve (N, Standard_Boolean);
-----------
-- Delta --
-----------
when Attribute_Delta =>
Fold_Ureal (N, Delta_Value (P_Type), True);
------------
-- Denorm --
------------
when Attribute_Denorm =>
Fold_Uint
(N, UI_From_Int (Boolean'Pos (Has_Denormals (P_Type))), Static);
---------------------
-- Descriptor_Size --
---------------------
-- Descriptor_Size is nonnull only for unconstrained array types
when Attribute_Descriptor_Size =>
if not Is_Array_Type (P_Type) or else Is_Constrained (P_Type) then
Fold_Uint (N, Uint_0, Static);
end if;
------------
-- Digits --
------------
when Attribute_Digits =>
Fold_Uint (N, Digits_Value (P_Type), Static);
----------
-- Emax --
----------
when Attribute_Emax =>
-- Ada 83 attribute is defined as (RM83 3.5.8)
-- T'Emax = 4 * T'Mantissa
Fold_Uint (N, 4 * Mantissa, Static);
--------------
-- Enum_Rep --
--------------
when Attribute_Enum_Rep => Enum_Rep : declare
Val : Node_Id;
begin
-- The attribute appears in the form:
-- Enum_Typ'Enum_Rep (Const)
-- Enum_Typ'Enum_Rep (Enum_Lit)
if Present (E1) then
Val := E1;
-- Otherwise the prefix denotes a constant or enumeration literal:
-- Const'Enum_Rep
-- Enum_Lit'Enum_Rep
else
Val := P;
end if;
-- For an enumeration type with a non-standard representation use
-- the Enumeration_Rep field of the proper constant. Note that this
-- will not work for types Character/Wide_[Wide-]Character, since no
-- real entities are created for the enumeration literals, but that
-- does not matter since these two types do not have non-standard
-- representations anyway.
if Is_Enumeration_Type (P_Type)
and then Has_Non_Standard_Rep (P_Type)
then
Fold_Uint (N, Enumeration_Rep (Expr_Value_E (Val)), Static);
-- For enumeration types with standard representations and all other
-- cases (i.e. all integer and modular types), Enum_Rep is equivalent
-- to Pos.
else
Fold_Uint (N, Expr_Value (Val), Static);
end if;
end Enum_Rep;
--------------
-- Enum_Val --
--------------
when Attribute_Enum_Val => Enum_Val : declare
Lit : Entity_Id;
begin
-- We have something like Enum_Type'Enum_Val (23), so search for a
-- corresponding value in the list of Enum_Rep values for the type.
Lit := First_Literal (P_Base_Type);
loop
if Enumeration_Rep (Lit) = Expr_Value (E1) then
Fold_Uint (N, Enumeration_Pos (Lit), Static);
exit;
end if;
Next_Literal (Lit);
if No (Lit) then
Apply_Compile_Time_Constraint_Error
(N, "no representation value matches",
CE_Range_Check_Failed,
Warn => not Static);
exit;
end if;
end loop;
end Enum_Val;
-------------
-- Epsilon --
-------------
when Attribute_Epsilon =>
-- Ada 83 attribute is defined as (RM83 3.5.8)
-- T'Epsilon = 2.0**(1 - T'Mantissa)
Fold_Ureal (N, Ureal_2 ** (1 - Mantissa), True);
--------------
-- Exponent --
--------------
when Attribute_Exponent =>
Fold_Uint (N,
Eval_Fat.Exponent (P_Base_Type, Expr_Value_R (E1)), Static);
-----------------------
-- Finalization_Size --
-----------------------
when Attribute_Finalization_Size =>
null;
-----------
-- First --
-----------
when Attribute_First =>
Set_Bounds;
if Compile_Time_Known_Value (Lo_Bound) then
if Is_Real_Type (P_Type) then
Fold_Ureal (N, Expr_Value_R (Lo_Bound), Static);
else
Fold_Uint (N, Expr_Value (Lo_Bound), Static);
end if;
else
Check_Concurrent_Discriminant (Lo_Bound);
end if;
-----------------
-- First_Valid --
-----------------
when Attribute_First_Valid =>
if Has_Predicates (P_Type)
and then Has_Static_Predicate (P_Type)
then
declare
FirstN : constant Node_Id :=
First (Static_Discrete_Predicate (P_Type));
begin
if Nkind (FirstN) = N_Range then
Fold_Uint (N, Expr_Value (Low_Bound (FirstN)), Static);
else
Fold_Uint (N, Expr_Value (FirstN), Static);
end if;
end;
else
Set_Bounds;
Fold_Uint (N, Expr_Value (Lo_Bound), Static);
end if;
-----------------
-- Fixed_Value --
-----------------
when Attribute_Fixed_Value =>
null;
-----------
-- Floor --
-----------
when Attribute_Floor =>
Fold_Ureal
(N, Eval_Fat.Floor (P_Base_Type, Expr_Value_R (E1)), Static);
----------
-- Fore --
----------
when Attribute_Fore =>
if Compile_Time_Known_Bounds (P_Type) then
Fold_Uint (N, UI_From_Int (Fore_Value), Static);
end if;
--------------
-- Fraction --
--------------
when Attribute_Fraction =>
Fold_Ureal
(N, Eval_Fat.Fraction (P_Base_Type, Expr_Value_R (E1)), Static);
-----------------------
-- Has_Access_Values --
-----------------------
when Attribute_Has_Access_Values =>
Rewrite (N, New_Occurrence_Of
(Boolean_Literals (Has_Access_Values (P_Root_Type)), Loc));
Analyze_And_Resolve (N, Standard_Boolean);
-----------------------
-- Has_Discriminants --
-----------------------
when Attribute_Has_Discriminants =>
Rewrite (N, New_Occurrence_Of (
Boolean_Literals (Has_Discriminants (P_Entity)), Loc));
Analyze_And_Resolve (N, Standard_Boolean);
----------------------
-- Has_Same_Storage --
----------------------
when Attribute_Has_Same_Storage =>
null;
-----------------------
-- Has_Tagged_Values --
-----------------------
when Attribute_Has_Tagged_Values =>
Rewrite (N, New_Occurrence_Of
(Boolean_Literals (Has_Tagged_Component (P_Root_Type)), Loc));
Analyze_And_Resolve (N, Standard_Boolean);
--------------
-- Identity --
--------------
when Attribute_Identity =>
null;
-----------
-- Image --
-----------
-- Image is a scalar attribute, but is never static, because it is
-- not a static function (having a non-scalar argument (RM 4.9(22))
-- However, we can constant-fold the image of an enumeration literal
-- if names are available.
when Attribute_Image =>
if Is_Entity_Name (E1)
and then Ekind (Entity (E1)) = E_Enumeration_Literal
and then not Discard_Names (First_Subtype (Etype (E1)))
and then not Global_Discard_Names
then
declare
Lit : constant Entity_Id := Entity (E1);
Str : String_Id;
begin
Start_String;
Get_Unqualified_Decoded_Name_String (Chars (Lit));
Set_Casing (All_Upper_Case);
Store_String_Chars (Name_Buffer (1 .. Name_Len));
Str := End_String;
Rewrite (N, Make_String_Literal (Loc, Strval => Str));
Analyze_And_Resolve (N, Standard_String);
Set_Is_Static_Expression (N, False);
end;
end if;
-------------------
-- Integer_Value --
-------------------
-- We never try to fold Integer_Value (though perhaps we could???)
when Attribute_Integer_Value =>
null;
-------------------
-- Invalid_Value --
-------------------
-- Invalid_Value is a scalar attribute that is never static, because
-- the value is by design out of range.
when Attribute_Invalid_Value =>
null;
-----------
-- Large --
-----------
when Attribute_Large =>
-- For fixed-point, we use the identity:
-- T'Large = (2.0**T'Mantissa - 1.0) * T'Small
if Is_Fixed_Point_Type (P_Type) then
Rewrite (N,
Make_Op_Multiply (Loc,
Left_Opnd =>
Make_Op_Subtract (Loc,
Left_Opnd =>
Make_Op_Expon (Loc,
Left_Opnd =>
Make_Real_Literal (Loc, Ureal_2),
Right_Opnd =>
Make_Attribute_Reference (Loc,
Prefix => P,
Attribute_Name => Name_Mantissa)),
Right_Opnd => Make_Real_Literal (Loc, Ureal_1)),
Right_Opnd =>
Make_Real_Literal (Loc, Small_Value (Entity (P)))));
Analyze_And_Resolve (N, C_Type);
-- Floating-point (Ada 83 compatibility)
else
-- Ada 83 attribute is defined as (RM83 3.5.8)
-- T'Large = 2.0**T'Emax * (1.0 - 2.0**(-T'Mantissa))
-- where
-- T'Emax = 4 * T'Mantissa
Fold_Ureal
(N,
Ureal_2 ** (4 * Mantissa) * (Ureal_1 - Ureal_2 ** (-Mantissa)),
True);
end if;
---------------
-- Lock_Free --
---------------
when Attribute_Lock_Free => Lock_Free : declare
V : constant Entity_Id := Boolean_Literals (Uses_Lock_Free (P_Type));
begin
Rewrite (N, New_Occurrence_Of (V, Loc));
-- Analyze and resolve as boolean. Note that this attribute is a
-- static attribute in GNAT.
Analyze_And_Resolve (N, Standard_Boolean);
Static := True;
Set_Is_Static_Expression (N);
end Lock_Free;
----------
-- Last --
----------
when Attribute_Last =>
Set_Bounds;
if Compile_Time_Known_Value (Hi_Bound) then
if Is_Real_Type (P_Type) then
Fold_Ureal (N, Expr_Value_R (Hi_Bound), Static);
else
Fold_Uint (N, Expr_Value (Hi_Bound), Static);
end if;
else
Check_Concurrent_Discriminant (Hi_Bound);
end if;
----------------
-- Last_Valid --
----------------
when Attribute_Last_Valid =>
if Has_Predicates (P_Type)
and then Has_Static_Predicate (P_Type)
then
declare
LastN : constant Node_Id :=
Last (Static_Discrete_Predicate (P_Type));
begin
if Nkind (LastN) = N_Range then
Fold_Uint (N, Expr_Value (High_Bound (LastN)), Static);
else
Fold_Uint (N, Expr_Value (LastN), Static);
end if;
end;
else
Set_Bounds;
Fold_Uint (N, Expr_Value (Hi_Bound), Static);
end if;
------------------
-- Leading_Part --
------------------
when Attribute_Leading_Part =>
Fold_Ureal
(N,
Eval_Fat.Leading_Part
(P_Base_Type, Expr_Value_R (E1), Expr_Value (E2)),
Static);
------------
-- Length --
------------
when Attribute_Length => Length : declare
Ind : Node_Id;
begin
-- If any index type is a formal type, or derived from one, the
-- bounds are not static. Treating them as static can produce
-- spurious warnings or improper constant folding.
Ind := First_Index (P_Type);
while Present (Ind) loop
if Is_Generic_Type (Root_Type (Etype (Ind))) then
return;
end if;
Next_Index (Ind);
end loop;
Set_Bounds;
-- For two compile time values, we can compute length
if Compile_Time_Known_Value (Lo_Bound)
and then Compile_Time_Known_Value (Hi_Bound)
then
Fold_Uint (N,
UI_Max (0, 1 + (Expr_Value (Hi_Bound) - Expr_Value (Lo_Bound))),
Static);
end if;
-- One more case is where Hi_Bound and Lo_Bound are compile-time
-- comparable, and we can figure out the difference between them.
declare
Diff : aliased Uint;
begin
case
Compile_Time_Compare
(Lo_Bound, Hi_Bound, Diff'Access, Assume_Valid => False)
is
when EQ =>
Fold_Uint (N, Uint_1, Static);
when GT =>
Fold_Uint (N, Uint_0, Static);
when LT =>
if Diff /= No_Uint then
Fold_Uint (N, Diff + 1, Static);
end if;
when others =>
null;
end case;
end;
end Length;
----------------
-- Loop_Entry --
----------------
-- Loop_Entry acts as an alias of a constant initialized to the prefix
-- of the said attribute at the point of entry into the related loop. As
-- such, the attribute reference does not need to be evaluated because
-- the prefix is the one that is evaluted.
when Attribute_Loop_Entry =>
null;
-------------
-- Machine --
-------------
when Attribute_Machine =>
Fold_Ureal
(N,
Eval_Fat.Machine
(P_Base_Type, Expr_Value_R (E1), Eval_Fat.Round, N),
Static);
------------------
-- Machine_Emax --
------------------
when Attribute_Machine_Emax =>
Fold_Uint (N, Machine_Emax_Value (P_Type), Static);
------------------
-- Machine_Emin --
------------------
when Attribute_Machine_Emin =>
Fold_Uint (N, Machine_Emin_Value (P_Type), Static);
----------------------
-- Machine_Mantissa --
----------------------
when Attribute_Machine_Mantissa =>
Fold_Uint (N, Machine_Mantissa_Value (P_Type), Static);
-----------------------
-- Machine_Overflows --
-----------------------
when Attribute_Machine_Overflows =>
-- Always true for fixed-point
if Is_Fixed_Point_Type (P_Type) then
Fold_Uint (N, True_Value, Static);
-- Floating point case
else
Fold_Uint (N,
UI_From_Int (Boolean'Pos (Machine_Overflows_On_Target)),
Static);
end if;
-------------------
-- Machine_Radix --
-------------------
when Attribute_Machine_Radix =>
if Is_Fixed_Point_Type (P_Type) then
if Is_Decimal_Fixed_Point_Type (P_Type)
and then Machine_Radix_10 (P_Type)
then
Fold_Uint (N, Uint_10, Static);
else
Fold_Uint (N, Uint_2, Static);
end if;
-- All floating-point type always have radix 2
else
Fold_Uint (N, Uint_2, Static);
end if;
----------------------
-- Machine_Rounding --
----------------------
-- Note: for the folding case, it is fine to treat Machine_Rounding
-- exactly the same way as Rounding, since this is one of the allowed
-- behaviors, and performance is not an issue here. It might be a bit
-- better to give the same result as it would give at run time, even
-- though the non-determinism is certainly permitted.
when Attribute_Machine_Rounding =>
Fold_Ureal
(N, Eval_Fat.Rounding (P_Base_Type, Expr_Value_R (E1)), Static);
--------------------
-- Machine_Rounds --
--------------------
when Attribute_Machine_Rounds =>
-- Always False for fixed-point
if Is_Fixed_Point_Type (P_Type) then
Fold_Uint (N, False_Value, Static);
-- Else yield proper floating-point result
else
Fold_Uint
(N, UI_From_Int (Boolean'Pos (Machine_Rounds_On_Target)),
Static);
end if;
------------------
-- Machine_Size --
------------------
-- Note: Machine_Size is identical to Object_Size
when Attribute_Machine_Size => Machine_Size : declare
P_TypeA : constant Entity_Id := Underlying_Type (P_Type);
begin
if Known_Esize (P_TypeA) then
Fold_Uint (N, Esize (P_TypeA), Static);
end if;
end Machine_Size;
--------------
-- Mantissa --
--------------
when Attribute_Mantissa =>
-- Fixed-point mantissa
if Is_Fixed_Point_Type (P_Type) then
-- Compile time foldable case
if Compile_Time_Known_Value (Type_Low_Bound (P_Type))
and then
Compile_Time_Known_Value (Type_High_Bound (P_Type))
then
-- The calculation of the obsolete Ada 83 attribute Mantissa
-- is annoying, because of AI00143, quoted here:
-- !question 84-01-10
-- Consider the model numbers for F:
-- type F is delta 1.0 range -7.0 .. 8.0;
-- The wording requires that F'MANTISSA be the SMALLEST
-- integer number for which each bound of the specified
-- range is either a model number or lies at most small
-- distant from a model number. This means F'MANTISSA
-- is required to be 3 since the range -7.0 .. 7.0 fits
-- in 3 signed bits, and 8 is "at most" 1.0 from a model
-- number, namely, 7. Is this analysis correct? Note that
-- this implies the upper bound of the range is not
-- represented as a model number.
-- !response 84-03-17
-- The analysis is correct. The upper and lower bounds for
-- a fixed point type can lie outside the range of model
-- numbers.
declare
Siz : Uint;
LBound : Ureal;
UBound : Ureal;
Bound : Ureal;
Max_Man : Uint;
begin
LBound := Expr_Value_R (Type_Low_Bound (P_Type));
UBound := Expr_Value_R (Type_High_Bound (P_Type));
Bound := UR_Max (UR_Abs (LBound), UR_Abs (UBound));
Max_Man := UR_Trunc (Bound / Small_Value (P_Type));
-- If the Bound is exactly a model number, i.e. a multiple
-- of Small, then we back it off by one to get the integer
-- value that must be representable.
if Small_Value (P_Type) * Max_Man = Bound then
Max_Man := Max_Man - 1;
end if;
-- Now find corresponding size = Mantissa value
Siz := Uint_0;
while 2 ** Siz < Max_Man loop
Siz := Siz + 1;
end loop;
Fold_Uint (N, Siz, Static);
end;
else
-- The case of dynamic bounds cannot be evaluated at compile
-- time. Instead we use a runtime routine (see Exp_Attr).
null;
end if;
-- Floating-point Mantissa
else
Fold_Uint (N, Mantissa, Static);
end if;
---------
-- Max --
---------
when Attribute_Max =>
if Is_Real_Type (P_Type) then
Fold_Ureal
(N, UR_Max (Expr_Value_R (E1), Expr_Value_R (E2)), Static);
else
Fold_Uint (N, UI_Max (Expr_Value (E1), Expr_Value (E2)), Static);
end if;
----------------------------------
-- Max_Alignment_For_Allocation --
----------------------------------
-- Max_Alignment_For_Allocation is usually the Alignment. However,
-- arrays are allocated with dope, so we need to take into account both
-- the alignment of the array, which comes from the component alignment,
-- and the alignment of the dope. Also, if the alignment is unknown, we
-- use the max (it's OK to be pessimistic).
when Attribute_Max_Alignment_For_Allocation => Max_Align : declare
A : Uint := UI_From_Int (Ttypes.Maximum_Alignment);
begin
if Known_Alignment (P_Type)
and then (not Is_Array_Type (P_Type) or else Alignment (P_Type) > A)
then
A := Alignment (P_Type);
end if;
Fold_Uint (N, A, Static);
end Max_Align;
----------------------------------
-- Max_Size_In_Storage_Elements --
----------------------------------
-- Max_Size_In_Storage_Elements is simply the Size rounded up to a
-- Storage_Unit boundary. We can fold any cases for which the size
-- is known by the front end.
when Attribute_Max_Size_In_Storage_Elements =>
if Known_Esize (P_Type) then
Fold_Uint (N,
(Esize (P_Type) + System_Storage_Unit - 1) /
System_Storage_Unit,
Static);
end if;
--------------------
-- Mechanism_Code --
--------------------
when Attribute_Mechanism_Code => Mechanism_Code : declare
Formal : Entity_Id;
Mech : Mechanism_Type;
Val : Int;
begin
if No (E1) then
Mech := Mechanism (P_Entity);
else
Val := UI_To_Int (Expr_Value (E1));
Formal := First_Formal (P_Entity);
for J in 1 .. Val - 1 loop
Next_Formal (Formal);
end loop;
Mech := Mechanism (Formal);
end if;
if Mech < 0 then
Fold_Uint (N, UI_From_Int (Int (-Mech)), Static);
end if;
end Mechanism_Code;
---------
-- Min --
---------
when Attribute_Min =>
if Is_Real_Type (P_Type) then
Fold_Ureal
(N, UR_Min (Expr_Value_R (E1), Expr_Value_R (E2)), Static);
else
Fold_Uint
(N, UI_Min (Expr_Value (E1), Expr_Value (E2)), Static);
end if;
---------
-- Mod --
---------
when Attribute_Mod =>
Fold_Uint
(N, UI_Mod (Expr_Value (E1), Modulus (P_Base_Type)), Static);
-----------
-- Model --
-----------
when Attribute_Model =>
Fold_Ureal
(N, Eval_Fat.Model (P_Base_Type, Expr_Value_R (E1)), Static);
----------------
-- Model_Emin --
----------------
when Attribute_Model_Emin =>
Fold_Uint (N, Model_Emin_Value (P_Base_Type), Static);
-------------------
-- Model_Epsilon --
-------------------
when Attribute_Model_Epsilon =>
Fold_Ureal (N, Model_Epsilon_Value (P_Base_Type), Static);
--------------------
-- Model_Mantissa --
--------------------
when Attribute_Model_Mantissa =>
Fold_Uint (N, Model_Mantissa_Value (P_Base_Type), Static);
-----------------
-- Model_Small --
-----------------
when Attribute_Model_Small =>
Fold_Ureal (N, Model_Small_Value (P_Base_Type), Static);
-------------
-- Modulus --
-------------
when Attribute_Modulus =>
Fold_Uint (N, Modulus (P_Type), Static);
--------------------
-- Null_Parameter --
--------------------
-- Cannot fold, we know the value sort of, but the whole point is
-- that there is no way to talk about this imaginary value except
-- by using the attribute, so we leave it the way it is.
when Attribute_Null_Parameter =>
null;
-----------------
-- Object_Size --
-----------------
-- The Object_Size attribute for a type returns the Esize of the
-- type and can be folded if this value is known.
when Attribute_Object_Size => Object_Size : declare
P_TypeA : constant Entity_Id := Underlying_Type (P_Type);
begin
if Known_Esize (P_TypeA) then
Fold_Uint (N, Esize (P_TypeA), Static);
end if;
end Object_Size;
----------------------
-- Overlaps_Storage --
----------------------
when Attribute_Overlaps_Storage =>
null;
-------------------------
-- Passed_By_Reference --
-------------------------
-- Scalar types are never passed by reference
when Attribute_Passed_By_Reference =>
Fold_Uint (N, False_Value, Static);
---------
-- Pos --
---------
when Attribute_Pos =>
Fold_Uint (N, Expr_Value (E1), Static);
----------
-- Pred --
----------
when Attribute_Pred =>
-- Floating-point case
if Is_Floating_Point_Type (P_Type) then
Fold_Ureal
(N, Eval_Fat.Pred (P_Base_Type, Expr_Value_R (E1)), Static);
-- Fixed-point case
elsif Is_Fixed_Point_Type (P_Type) then
Fold_Ureal
(N, Expr_Value_R (E1) - Small_Value (P_Type), True);
-- Modular integer case (wraps)
elsif Is_Modular_Integer_Type (P_Type) then
Fold_Uint (N, (Expr_Value (E1) - 1) mod Modulus (P_Type), Static);
-- Other scalar cases
else
pragma Assert (Is_Scalar_Type (P_Type));
if Is_Enumeration_Type (P_Type)
and then Expr_Value (E1) =
Expr_Value (Type_Low_Bound (P_Base_Type))
then
Apply_Compile_Time_Constraint_Error
(N, "Pred of `&''First`",
CE_Overflow_Check_Failed,
Ent => P_Base_Type,
Warn => not Static);
Check_Expressions;
return;
end if;
Fold_Uint (N, Expr_Value (E1) - 1, Static);
end if;
-----------
-- Range --
-----------
-- No processing required, because by this stage, Range has been
-- replaced by First .. Last, so this branch can never be taken.
when Attribute_Range =>
raise Program_Error;
------------------
-- Range_Length --
------------------
when Attribute_Range_Length => Range_Length : declare
Diff : aliased Uint;
begin
Set_Bounds;
-- Can fold if both bounds are compile time known
if Compile_Time_Known_Value (Hi_Bound)
and then Compile_Time_Known_Value (Lo_Bound)
then
Fold_Uint (N,
UI_Max
(0, Expr_Value (Hi_Bound) - Expr_Value (Lo_Bound) + 1),
Static);
end if;
-- One more case is where Hi_Bound and Lo_Bound are compile-time
-- comparable, and we can figure out the difference between them.
case Compile_Time_Compare
(Lo_Bound, Hi_Bound, Diff'Access, Assume_Valid => False)
is
when EQ =>
Fold_Uint (N, Uint_1, Static);
when GT =>
Fold_Uint (N, Uint_0, Static);
when LT =>
if Diff /= No_Uint then
Fold_Uint (N, Diff + 1, Static);
end if;
when others =>
null;
end case;
end Range_Length;
---------
-- Ref --
---------
when Attribute_Ref =>
Fold_Uint (N, Expr_Value (E1), Static);
---------------
-- Remainder --
---------------
when Attribute_Remainder => Remainder : declare
X : constant Ureal := Expr_Value_R (E1);
Y : constant Ureal := Expr_Value_R (E2);
begin
if UR_Is_Zero (Y) then
Apply_Compile_Time_Constraint_Error
(N, "division by zero in Remainder",
CE_Overflow_Check_Failed,
Warn => not Static);
Check_Expressions;
return;
end if;
Fold_Ureal (N, Eval_Fat.Remainder (P_Base_Type, X, Y), Static);
end Remainder;
-----------------
-- Restriction --
-----------------
when Attribute_Restriction_Set =>
Rewrite (N, New_Occurrence_Of (Standard_False, Loc));
Set_Is_Static_Expression (N);
-----------
-- Round --
-----------
when Attribute_Round => Round : declare
Sr : Ureal;
Si : Uint;
begin
-- First we get the (exact result) in units of small
Sr := Expr_Value_R (E1) / Small_Value (C_Type);
-- Now round that exactly to an integer
Si := UR_To_Uint (Sr);
-- Finally the result is obtained by converting back to real
Fold_Ureal (N, Si * Small_Value (C_Type), Static);
end Round;
--------------
-- Rounding --
--------------
when Attribute_Rounding =>
Fold_Ureal
(N, Eval_Fat.Rounding (P_Base_Type, Expr_Value_R (E1)), Static);
---------------
-- Safe_Emax --
---------------
when Attribute_Safe_Emax =>
Fold_Uint (N, Safe_Emax_Value (P_Type), Static);
----------------
-- Safe_First --
----------------
when Attribute_Safe_First =>
Fold_Ureal (N, Safe_First_Value (P_Type), Static);
----------------
-- Safe_Large --
----------------
when Attribute_Safe_Large =>
if Is_Fixed_Point_Type (P_Type) then
Fold_Ureal
(N, Expr_Value_R (Type_High_Bound (P_Base_Type)), Static);
else
Fold_Ureal (N, Safe_Last_Value (P_Type), Static);
end if;
---------------
-- Safe_Last --
---------------
when Attribute_Safe_Last =>
Fold_Ureal (N, Safe_Last_Value (P_Type), Static);
----------------
-- Safe_Small --
----------------
when Attribute_Safe_Small =>
-- In Ada 95, the old Ada 83 attribute Safe_Small is redundant
-- for fixed-point, since is the same as Small, but we implement
-- it for backwards compatibility.
if Is_Fixed_Point_Type (P_Type) then
Fold_Ureal (N, Small_Value (P_Type), Static);
-- Ada 83 Safe_Small for floating-point cases
else
Fold_Ureal (N, Model_Small_Value (P_Type), Static);
end if;
-----------
-- Scale --
-----------
when Attribute_Scale =>
Fold_Uint (N, Scale_Value (P_Type), Static);
-------------
-- Scaling --
-------------
when Attribute_Scaling =>
Fold_Ureal
(N,
Eval_Fat.Scaling
(P_Base_Type, Expr_Value_R (E1), Expr_Value (E2)),
Static);
------------------
-- Signed_Zeros --
------------------
when Attribute_Signed_Zeros =>
Fold_Uint
(N, UI_From_Int (Boolean'Pos (Has_Signed_Zeros (P_Type))), Static);
----------
-- Size --
----------
-- Size attribute returns the RM size. All scalar types can be folded,
-- as well as any types for which the size is known by the front end,
-- including any type for which a size attribute is specified. This is
-- one of the places where it is annoying that a size of zero means two
-- things (zero size for scalars, unspecified size for non-scalars).
when Attribute_Size
| Attribute_VADS_Size
=>
Size : declare
P_TypeA : constant Entity_Id := Underlying_Type (P_Type);
begin
if Is_Scalar_Type (P_TypeA)
or else RM_Size (P_TypeA) /= Uint_0
then
-- VADS_Size case
if Id = Attribute_VADS_Size or else Use_VADS_Size then
declare
S : constant Node_Id := Size_Clause (P_TypeA);
begin
-- If a size clause applies, then use the size from it.
-- This is one of the rare cases where we can use the
-- Size_Clause field for a subtype when Has_Size_Clause
-- is False. Consider:
-- type x is range 1 .. 64;
-- for x'size use 12;
-- subtype y is x range 0 .. 3;
-- Here y has a size clause inherited from x, but
-- normally it does not apply, and y'size is 2. However,
-- y'VADS_Size is indeed 12 and not 2.
if Present (S)
and then Is_OK_Static_Expression (Expression (S))
then
Fold_Uint (N, Expr_Value (Expression (S)), Static);
-- If no size is specified, then we simply use the object
-- size in the VADS_Size case (e.g. Natural'Size is equal
-- to Integer'Size, not one less).
else
Fold_Uint (N, Esize (P_TypeA), Static);
end if;
end;
-- Normal case (Size) in which case we want the RM_Size
else
Fold_Uint (N, RM_Size (P_TypeA), Static);
end if;
end if;
end Size;
-----------
-- Small --
-----------
when Attribute_Small =>
-- The floating-point case is present only for Ada 83 compatibility.
-- Note that strictly this is an illegal addition, since we are
-- extending an Ada 95 defined attribute, but we anticipate an
-- ARG ruling that will permit this.
if Is_Floating_Point_Type (P_Type) then
-- Ada 83 attribute is defined as (RM83 3.5.8)
-- T'Small = 2.0**(-T'Emax - 1)
-- where
-- T'Emax = 4 * T'Mantissa
Fold_Ureal (N, Ureal_2 ** ((-(4 * Mantissa)) - 1), Static);
-- Normal Ada 95 fixed-point case
else
Fold_Ureal (N, Small_Value (P_Type), True);
end if;
-----------------
-- Stream_Size --
-----------------
when Attribute_Stream_Size =>
null;
----------
-- Succ --
----------
when Attribute_Succ =>
-- Floating-point case
if Is_Floating_Point_Type (P_Type) then
Fold_Ureal
(N, Eval_Fat.Succ (P_Base_Type, Expr_Value_R (E1)), Static);
-- Fixed-point case
elsif Is_Fixed_Point_Type (P_Type) then
Fold_Ureal (N, Expr_Value_R (E1) + Small_Value (P_Type), Static);
-- Modular integer case (wraps)
elsif Is_Modular_Integer_Type (P_Type) then
Fold_Uint (N, (Expr_Value (E1) + 1) mod Modulus (P_Type), Static);
-- Other scalar cases
else
pragma Assert (Is_Scalar_Type (P_Type));
if Is_Enumeration_Type (P_Type)
and then Expr_Value (E1) =
Expr_Value (Type_High_Bound (P_Base_Type))
then
Apply_Compile_Time_Constraint_Error
(N, "Succ of `&''Last`",
CE_Overflow_Check_Failed,
Ent => P_Base_Type,
Warn => not Static);
Check_Expressions;
return;
else
Fold_Uint (N, Expr_Value (E1) + 1, Static);
end if;
end if;
----------------
-- Truncation --
----------------
when Attribute_Truncation =>
Fold_Ureal
(N,
Eval_Fat.Truncation (P_Base_Type, Expr_Value_R (E1)),
Static);
----------------
-- Type_Class --
----------------
when Attribute_Type_Class => Type_Class : declare
Typ : constant Entity_Id := Underlying_Type (P_Base_Type);
Id : RE_Id;
begin
if Is_Descendant_Of_Address (Typ) then
Id := RE_Type_Class_Address;
elsif Is_Enumeration_Type (Typ) then
Id := RE_Type_Class_Enumeration;
elsif Is_Integer_Type (Typ) then
Id := RE_Type_Class_Integer;
elsif Is_Fixed_Point_Type (Typ) then
Id := RE_Type_Class_Fixed_Point;
elsif Is_Floating_Point_Type (Typ) then
Id := RE_Type_Class_Floating_Point;
elsif Is_Array_Type (Typ) then
Id := RE_Type_Class_Array;
elsif Is_Record_Type (Typ) then
Id := RE_Type_Class_Record;
elsif Is_Access_Type (Typ) then
Id := RE_Type_Class_Access;
elsif Is_Task_Type (Typ) then
Id := RE_Type_Class_Task;
-- We treat protected types like task types. It would make more
-- sense to have another enumeration value, but after all the
-- whole point of this feature is to be exactly DEC compatible,
-- and changing the type Type_Class would not meet this requirement.
elsif Is_Protected_Type (Typ) then
Id := RE_Type_Class_Task;
-- Not clear if there are any other possibilities, but if there
-- are, then we will treat them as the address case.
else
Id := RE_Type_Class_Address;
end if;
Rewrite (N, New_Occurrence_Of (RTE (Id), Loc));
end Type_Class;
-----------------------
-- Unbiased_Rounding --
-----------------------
when Attribute_Unbiased_Rounding =>
Fold_Ureal
(N,
Eval_Fat.Unbiased_Rounding (P_Base_Type, Expr_Value_R (E1)),
Static);
-------------------------
-- Unconstrained_Array --
-------------------------
when Attribute_Unconstrained_Array => Unconstrained_Array : declare
Typ : constant Entity_Id := Underlying_Type (P_Type);
begin
Rewrite (N, New_Occurrence_Of (
Boolean_Literals (
Is_Array_Type (P_Type)
and then not Is_Constrained (Typ)), Loc));
-- Analyze and resolve as boolean, note that this attribute is
-- a static attribute in GNAT.
Analyze_And_Resolve (N, Standard_Boolean);
Static := True;
Set_Is_Static_Expression (N, True);
end Unconstrained_Array;
-- Attribute Update is never static
when Attribute_Update =>
return;
---------------
-- VADS_Size --
---------------
-- Processing is shared with Size
---------
-- Val --
---------
when Attribute_Val =>
if Expr_Value (E1) < Expr_Value (Type_Low_Bound (P_Base_Type))
or else
Expr_Value (E1) > Expr_Value (Type_High_Bound (P_Base_Type))
then
Apply_Compile_Time_Constraint_Error
(N, "Val expression out of range",
CE_Range_Check_Failed,
Warn => not Static);
Check_Expressions;
return;
else
Fold_Uint (N, Expr_Value (E1), Static);
end if;
----------------
-- Value_Size --
----------------
-- The Value_Size attribute for a type returns the RM size of the type.
-- This an always be folded for scalar types, and can also be folded for
-- non-scalar types if the size is set. This is one of the places where
-- it is annoying that a size of zero means two things!
when Attribute_Value_Size => Value_Size : declare
P_TypeA : constant Entity_Id := Underlying_Type (P_Type);
begin
if Is_Scalar_Type (P_TypeA) or else RM_Size (P_TypeA) /= Uint_0 then
Fold_Uint (N, RM_Size (P_TypeA), Static);
end if;
end Value_Size;
-------------
-- Version --
-------------
-- Version can never be static
when Attribute_Version =>
null;
----------------
-- Wide_Image --
----------------
-- Wide_Image is a scalar attribute, but is never static, because it
-- is not a static function (having a non-scalar argument (RM 4.9(22))
when Attribute_Wide_Image =>
null;
---------------------
-- Wide_Wide_Image --
---------------------
-- Wide_Wide_Image is a scalar attribute but is never static, because it
-- is not a static function (having a non-scalar argument (RM 4.9(22)).
when Attribute_Wide_Wide_Image =>
null;
---------------------
-- Wide_Wide_Width --
---------------------
-- Processing for Wide_Wide_Width is combined with Width
----------------
-- Wide_Width --
----------------
-- Processing for Wide_Width is combined with Width
-----------
-- Width --
-----------
-- This processing also handles the case of Wide_[Wide_]Width
when Attribute_Width
| Attribute_Wide_Width
| Attribute_Wide_Wide_Width
=>
if Compile_Time_Known_Bounds (P_Type) then
-- Floating-point types
if Is_Floating_Point_Type (P_Type) then
-- Width is zero for a null range (RM 3.5 (38))
if Expr_Value_R (Type_High_Bound (P_Type)) <
Expr_Value_R (Type_Low_Bound (P_Type))
then
Fold_Uint (N, Uint_0, Static);
else
-- For floating-point, we have +N.dddE+nnn where length
-- of ddd is determined by type'Digits - 1, but is one
-- if Digits is one (RM 3.5 (33)).
-- nnn is set to 2 for Short_Float and Float (32 bit
-- floats), and 3 for Long_Float and Long_Long_Float.
-- For machines where Long_Long_Float is the IEEE
-- extended precision type, the exponent takes 4 digits.
declare
Len : Int :=
Int'Max (2, UI_To_Int (Digits_Value (P_Type)));
begin
if Esize (P_Type) <= 32 then
Len := Len + 6;
elsif Esize (P_Type) = 64 then
Len := Len + 7;
else
Len := Len + 8;
end if;
Fold_Uint (N, UI_From_Int (Len), Static);
end;
end if;
-- Fixed-point types
elsif Is_Fixed_Point_Type (P_Type) then
-- Width is zero for a null range (RM 3.5 (38))
if Expr_Value (Type_High_Bound (P_Type)) <
Expr_Value (Type_Low_Bound (P_Type))
then
Fold_Uint (N, Uint_0, Static);
-- The non-null case depends on the specific real type
else
-- For fixed-point type width is Fore + 1 + Aft (RM 3.5(34))
Fold_Uint
(N, UI_From_Int (Fore_Value + 1) + Aft_Value (P_Type),
Static);
end if;
-- Discrete types
else
declare
R : constant Entity_Id := Root_Type (P_Type);
Lo : constant Uint := Expr_Value (Type_Low_Bound (P_Type));
Hi : constant Uint := Expr_Value (Type_High_Bound (P_Type));
W : Nat;
Wt : Nat;
T : Uint;
L : Node_Id;
C : Character;
begin
-- Empty ranges
if Lo > Hi then
W := 0;
-- Width for types derived from Standard.Character
-- and Standard.Wide_[Wide_]Character.
elsif Is_Standard_Character_Type (P_Type) then
W := 0;
-- Set W larger if needed
for J in UI_To_Int (Lo) .. UI_To_Int (Hi) loop
-- All wide characters look like Hex_hhhhhhhh
if J > 255 then
-- No need to compute this more than once
exit;
else
C := Character'Val (J);
-- Test for all cases where Character'Image
-- yields an image that is longer than three
-- characters. First the cases of Reserved_xxx
-- names (length = 12).
case C is
when Reserved_128
| Reserved_129
| Reserved_132
| Reserved_153
=>
Wt := 12;
when BS
| CR
| EM
| FF
| FS
| GS
| HT
| LF
| MW
| PM
| RI
| RS
| SI
| SO
| ST
| US
| VT
=>
Wt := 2;
when ACK
| APC
| BEL
| BPH
| CAN
| CCH
| CSI
| DC1
| DC2
| DC3
| DC4
| DCS
| DEL
| DLE
| ENQ
| EOT
| EPA
| ESA
| ESC
| ETB
| ETX
| HTJ
| HTS
| NAK
| NBH
| NEL
| NUL
| OSC
| PLD
| PLU
| PU1
| PU2
| SCI
| SOH
| SOS
| SPA
| SS2
| SS3
| SSA
| STS
| STX
| SUB
| SYN
| VTS
=>
Wt := 3;
when Space .. Tilde
| No_Break_Space .. LC_Y_Diaeresis
=>
-- Special case of soft hyphen in Ada 2005
if C = Character'Val (16#AD#)
and then Ada_Version >= Ada_2005
then
Wt := 11;
else
Wt := 3;
end if;
end case;
W := Int'Max (W, Wt);
end if;
end loop;
-- Width for types derived from Standard.Boolean
elsif R = Standard_Boolean then
if Lo = 0 then
W := 5; -- FALSE
else
W := 4; -- TRUE
end if;
-- Width for integer types
elsif Is_Integer_Type (P_Type) then
T := UI_Max (abs Lo, abs Hi);
W := 2;
while T >= 10 loop
W := W + 1;
T := T / 10;
end loop;
-- User declared enum type with discard names
elsif Discard_Names (R) then
-- If range is null, result is zero, that has already
-- been dealt with, so what we need is the power of ten
-- that accommodates the Pos of the largest value, which
-- is the high bound of the range + one for the space.
W := 1;
T := Hi;
while T /= 0 loop
T := T / 10;
W := W + 1;
end loop;
-- Only remaining possibility is user declared enum type
-- with normal case of Discard_Names not active.
else
pragma Assert (Is_Enumeration_Type (P_Type));
W := 0;
L := First_Literal (P_Type);
while Present (L) loop
-- Only pay attention to in range characters
if Lo <= Enumeration_Pos (L)
and then Enumeration_Pos (L) <= Hi
then
-- For Width case, use decoded name
if Id = Attribute_Width then
Get_Decoded_Name_String (Chars (L));
Wt := Nat (Name_Len);
-- For Wide_[Wide_]Width, use encoded name, and
-- then adjust for the encoding.
else
Get_Name_String (Chars (L));
-- Character literals are always of length 3
if Name_Buffer (1) = 'Q' then
Wt := 3;
-- Otherwise loop to adjust for upper/wide chars
else
Wt := Nat (Name_Len);
for J in 1 .. Name_Len loop
if Name_Buffer (J) = 'U' then
Wt := Wt - 2;
elsif Name_Buffer (J) = 'W' then
Wt := Wt - 4;
end if;
end loop;
end if;
end if;
W := Int'Max (W, Wt);
end if;
Next_Literal (L);
end loop;
end if;
Fold_Uint (N, UI_From_Int (W), Static);
end;
end if;
end if;
-- The following attributes denote functions that cannot be folded
when Attribute_From_Any
| Attribute_To_Any
| Attribute_TypeCode
=>
null;
-- The following attributes can never be folded, and furthermore we
-- should not even have entered the case statement for any of these.
-- Note that in some cases, the values have already been folded as
-- a result of the processing in Analyze_Attribute or earlier in
-- this procedure.
when Attribute_Abort_Signal
| Attribute_Access
| Attribute_Address
| Attribute_Address_Size
| Attribute_Asm_Input
| Attribute_Asm_Output
| Attribute_Base
| Attribute_Bit_Order
| Attribute_Bit_Position
| Attribute_Callable
| Attribute_Caller
| Attribute_Class
| Attribute_Code_Address
| Attribute_Compiler_Version
| Attribute_Count
| Attribute_Default_Bit_Order
| Attribute_Default_Scalar_Storage_Order
| Attribute_Deref
| Attribute_Elaborated
| Attribute_Elab_Body
| Attribute_Elab_Spec
| Attribute_Elab_Subp_Body
| Attribute_Enabled
| Attribute_External_Tag
| Attribute_Fast_Math
| Attribute_First_Bit
| Attribute_Img
| Attribute_Input
| Attribute_Initialized
| Attribute_Last_Bit
| Attribute_Library_Level
| Attribute_Max_Integer_Size
| Attribute_Maximum_Alignment
| Attribute_Old
| Attribute_Output
| Attribute_Partition_ID
| Attribute_Pool_Address
| Attribute_Position
| Attribute_Priority
| Attribute_Put_Image
| Attribute_Read
| Attribute_Result
| Attribute_Scalar_Storage_Order
| Attribute_Simple_Storage_Pool
| Attribute_Storage_Pool
| Attribute_Storage_Size
| Attribute_Storage_Unit
| Attribute_Stub_Type
| Attribute_System_Allocator_Alignment
| Attribute_Tag
| Attribute_Target_Name
| Attribute_Terminated
| Attribute_To_Address
| Attribute_Type_Key
| Attribute_Unchecked_Access
| Attribute_Universal_Literal_String
| Attribute_Unrestricted_Access
| Attribute_Valid
| Attribute_Valid_Scalars
| Attribute_Value
| Attribute_Wchar_T_Size
| Attribute_Wide_Value
| Attribute_Wide_Wide_Value
| Attribute_Word_Size
| Attribute_Write
=>
raise Program_Error;
end case;
-- At the end of the case, one more check. If we did a static evaluation
-- so that the result is now a literal, then set Is_Static_Expression
-- in the constant only if the prefix type is a static subtype. For
-- non-static subtypes, the folding is still OK, but not static.
-- An exception is the GNAT attribute Constrained_Array which is
-- defined to be a static attribute in all cases.
if Nkind (N) in N_Integer_Literal
| N_Real_Literal
| N_Character_Literal
| N_String_Literal
or else (Is_Entity_Name (N)
and then Ekind (Entity (N)) = E_Enumeration_Literal)
then
Set_Is_Static_Expression (N, Static);
-- If this is still an attribute reference, then it has not been folded
-- and that means that its expressions are in a non-static context.
elsif Nkind (N) = N_Attribute_Reference then
Check_Expressions;
-- Note: the else case not covered here are odd cases where the
-- processing has transformed the attribute into something other
-- than a constant. Nothing more to do in such cases.
else
null;
end if;
end Eval_Attribute;
------------------------------
-- Is_Anonymous_Tagged_Base --
------------------------------
function Is_Anonymous_Tagged_Base
(Anon : Entity_Id;
Typ : Entity_Id) return Boolean
is
begin
return
Anon = Current_Scope
and then Is_Itype (Anon)
and then Associated_Node_For_Itype (Anon) = Parent (Typ);
end Is_Anonymous_Tagged_Base;
--------------------------------
-- Name_Implies_Lvalue_Prefix --
--------------------------------
function Name_Implies_Lvalue_Prefix (Nam : Name_Id) return Boolean is
pragma Assert (Is_Attribute_Name (Nam));
begin
return Attribute_Name_Implies_Lvalue_Prefix (Get_Attribute_Id (Nam));
end Name_Implies_Lvalue_Prefix;
-----------------------
-- Resolve_Attribute --
-----------------------
procedure Resolve_Attribute (N : Node_Id; Typ : Entity_Id) is
Loc : constant Source_Ptr := Sloc (N);
P : constant Node_Id := Prefix (N);
Aname : constant Name_Id := Attribute_Name (N);
Attr_Id : constant Attribute_Id := Get_Attribute_Id (Aname);
Btyp : constant Entity_Id := Base_Type (Typ);
Des_Btyp : Entity_Id;
Index : Interp_Index;
It : Interp;
Nom_Subt : Entity_Id;
procedure Accessibility_Message;
-- Error, or warning within an instance, if the static accessibility
-- rules of 3.10.2 are violated.
function Declared_Within_Generic_Unit
(Entity : Entity_Id;
Generic_Unit : Node_Id) return Boolean;
-- Returns True if Declared_Entity is declared within the declarative
-- region of Generic_Unit; otherwise returns False.
function Prefix_With_Safe_Accessibility_Level return Boolean;
-- Return True if the prefix does not have a value conversion of an
-- array because a value conversion is like an aggregate with respect
-- to determining accessibility level (RM 3.10.2); even if evaluation
-- of a value conversion is guaranteed to not create a new object,
-- accessibility rules are defined as if it might.
---------------------------
-- Accessibility_Message --
---------------------------
procedure Accessibility_Message is
Indic : Node_Id := Parent (Parent (N));
begin
-- In an instance, this is a runtime check, but one we
-- know will fail, so generate an appropriate warning.
if In_Instance_Body then
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_F
("non-local pointer cannot point to local object<<", P);
Error_Msg_F ("\Program_Error [<<", P);
Rewrite (N,
Make_Raise_Program_Error (Loc,
Reason => PE_Accessibility_Check_Failed));
Set_Etype (N, Typ);
return;
else
Error_Msg_F ("non-local pointer cannot point to local object", P);
-- Check for case where we have a missing access definition
if Is_Record_Type (Current_Scope)
and then
Nkind (Parent (N)) in N_Discriminant_Association
| N_Index_Or_Discriminant_Constraint
then
Indic := Parent (Parent (N));
while Present (Indic)
and then Nkind (Indic) /= N_Subtype_Indication
loop
Indic := Parent (Indic);
end loop;
if Present (Indic) then
Error_Msg_NE
("\use an access definition for" &
" the access discriminant of&",
N, Entity (Subtype_Mark (Indic)));
end if;
end if;
end if;
end Accessibility_Message;
----------------------------------
-- Declared_Within_Generic_Unit --
----------------------------------
function Declared_Within_Generic_Unit
(Entity : Entity_Id;
Generic_Unit : Node_Id) return Boolean
is
Generic_Encloser : Node_Id := Enclosing_Generic_Unit (Entity);
begin
while Present (Generic_Encloser) loop
if Generic_Encloser = Generic_Unit then
return True;
end if;
-- We have to step to the scope of the generic's entity, because
-- otherwise we'll just get back the same generic.
Generic_Encloser :=
Enclosing_Generic_Unit
(Scope (Defining_Entity (Generic_Encloser)));
end loop;
return False;
end Declared_Within_Generic_Unit;
------------------------------------------
-- Prefix_With_Safe_Accessibility_Level --
------------------------------------------
function Prefix_With_Safe_Accessibility_Level return Boolean is
function Safe_Value_Conversions return Boolean;
-- Return False if the prefix has a value conversion of an array type
----------------------------
-- Safe_Value_Conversions --
----------------------------
function Safe_Value_Conversions return Boolean is
PP : Node_Id := P;
begin
loop
if Nkind (PP) in N_Selected_Component | N_Indexed_Component then
PP := Prefix (PP);
elsif Comes_From_Source (PP)
and then Nkind (PP) in N_Type_Conversion
| N_Unchecked_Type_Conversion
and then Is_Array_Type (Etype (PP))
then
return False;
elsif Comes_From_Source (PP)
and then Nkind (PP) = N_Qualified_Expression
and then Is_Array_Type (Etype (PP))
and then Nkind (Original_Node (Expression (PP))) in
N_Aggregate | N_Extension_Aggregate
then
return False;
else
exit;
end if;
end loop;
return True;
end Safe_Value_Conversions;
-- Start of processing for Prefix_With_Safe_Accessibility_Level
begin
-- No check required for unchecked and unrestricted access
if Attr_Id = Attribute_Unchecked_Access
or else Attr_Id = Attribute_Unrestricted_Access
then
return True;
-- Check value conversions
elsif Ekind (Btyp) = E_General_Access_Type
and then not Safe_Value_Conversions
then
return False;
end if;
return True;
end Prefix_With_Safe_Accessibility_Level;
-- Start of processing for Resolve_Attribute
begin
-- If error during analysis, no point in continuing, except for array
-- types, where we get better recovery by using unconstrained indexes
-- than nothing at all (see Check_Array_Type).
if Error_Posted (N)
and then Attr_Id /= Attribute_First
and then Attr_Id /= Attribute_Last
and then Attr_Id /= Attribute_Length
and then Attr_Id /= Attribute_Range
then
return;
end if;
-- If attribute was universal type, reset to actual type
if Etype (N) = Universal_Integer
or else Etype (N) = Universal_Real
then
Set_Etype (N, Typ);
end if;
-- Remaining processing depends on attribute
case Attr_Id is
------------
-- Access --
------------
-- For access attributes, if the prefix denotes an entity, it is
-- interpreted as a name, never as a call. It may be overloaded,
-- in which case resolution uses the profile of the context type.
-- Otherwise prefix must be resolved.
when Attribute_Access
| Attribute_Unchecked_Access
| Attribute_Unrestricted_Access
=>
-- Note possible modification if we have a variable
if Is_Variable (P) then
declare
PN : constant Node_Id := Parent (N);
Nm : Node_Id;
Note : Boolean := True;
-- Skip this for the case of Unrestricted_Access occuring in
-- the context of a Valid check, since this otherwise leads
-- to a missed warning (the Valid check does not really
-- modify!) If this case, Note will be reset to False.
-- Skip it as well if the type is an Access_To_Constant,
-- given that no use of the value can modify the prefix.
begin
if Attr_Id = Attribute_Unrestricted_Access
and then Nkind (PN) = N_Function_Call
then
Nm := Name (PN);
if Nkind (Nm) = N_Expanded_Name
and then Chars (Nm) = Name_Valid
and then Nkind (Prefix (Nm)) = N_Identifier
and then Chars (Prefix (Nm)) = Name_Attr_Long_Float
then
Note := False;
end if;
elsif Is_Access_Constant (Typ) then
Note := False;
end if;
if Note then
Note_Possible_Modification (P, Sure => False);
end if;
end;
end if;
-- Case where prefix is an entity name
if Is_Entity_Name (P) then
-- Deal with case where prefix itself is overloaded
if Is_Overloaded (P) then
Get_First_Interp (P, Index, It);
while Present (It.Nam) loop
if Type_Conformant (Designated_Type (Typ), It.Nam) then
Set_Entity (P, It.Nam);
-- The prefix is definitely NOT overloaded anymore at
-- this point, so we reset the Is_Overloaded flag to
-- avoid any confusion when reanalyzing the node.
Set_Is_Overloaded (P, False);
Set_Is_Overloaded (N, False);
Generate_Reference (Entity (P), P);
exit;
end if;
Get_Next_Interp (Index, It);
end loop;
-- If Prefix is a subprogram name, this reference freezes,
-- but not if within spec expression mode. The profile of
-- the subprogram is not frozen at this point.
if not In_Spec_Expression then
Freeze_Before (N, Entity (P), Do_Freeze_Profile => False);
end if;
-- If it is a type, there is nothing to resolve.
-- If it is a subprogram, do not freeze its profile.
-- If it is an object, complete its resolution.
elsif Is_Overloadable (Entity (P)) then
if not In_Spec_Expression then
Freeze_Before (N, Entity (P), Do_Freeze_Profile => False);
end if;
-- Nothing to do if prefix is a type name
elsif Is_Type (Entity (P)) then
null;
-- Otherwise non-overloaded other case, resolve the prefix
else
Resolve (P);
end if;
-- Some further error checks
Error_Msg_Name_1 := Aname;
if not Is_Entity_Name (P) then
null;
elsif Is_Overloadable (Entity (P))
and then Is_Abstract_Subprogram (Entity (P))
then
Error_Msg_F ("prefix of % attribute cannot be abstract", P);
Set_Etype (N, Any_Type);
elsif Ekind (Entity (P)) = E_Enumeration_Literal then
Error_Msg_F
("prefix of % attribute cannot be enumeration literal", P);
Set_Etype (N, Any_Type);
-- An attempt to take 'Access of a function that renames an
-- enumeration literal. Issue a specialized error message.
elsif Ekind (Entity (P)) = E_Function
and then Present (Alias (Entity (P)))
and then Ekind (Alias (Entity (P))) = E_Enumeration_Literal
then
Error_Msg_F
("prefix of % attribute cannot be function renaming "
& "an enumeration literal", P);
Set_Etype (N, Any_Type);
elsif Convention (Entity (P)) = Convention_Intrinsic then
Error_Msg_F ("prefix of % attribute cannot be intrinsic", P);
Set_Etype (N, Any_Type);
end if;
-- Assignments, return statements, components of aggregates,
-- generic instantiations will require convention checks if
-- the type is an access to subprogram. Given that there will
-- also be accessibility checks on those, this is where the
-- checks can eventually be centralized ???
if Ekind (Btyp) in E_Access_Protected_Subprogram_Type
| E_Access_Subprogram_Type
| E_Anonymous_Access_Protected_Subprogram_Type
| E_Anonymous_Access_Subprogram_Type
then
-- Deal with convention mismatch
if Convention (Designated_Type (Btyp)) /=
Convention (Entity (P))
then
-- The rule in 6.3.1 (8) deserves a special error
-- message.
if Convention (Btyp) = Convention_Intrinsic
and then Nkind (Parent (N)) = N_Procedure_Call_Statement
and then Is_Entity_Name (Name (Parent (N)))
and then Inside_A_Generic
then
declare
Subp : constant Entity_Id :=
Entity (Name (Parent (N)));
begin
if Convention (Subp) = Convention_Intrinsic then
Error_Msg_FE
("?subprogram and its formal access "
& "parameters have convention Intrinsic",
Parent (N), Subp);
Error_Msg_N
("actual cannot be access attribute", N);
end if;
end;
else
Error_Msg_FE
("subprogram & has wrong convention", P, Entity (P));
Error_Msg_Sloc := Sloc (Btyp);
Error_Msg_FE ("\does not match & declared#", P, Btyp);
end if;
if not Is_Itype (Btyp)
and then not Has_Convention_Pragma (Btyp)
and then Convention (Entity (P)) /= Convention_Intrinsic
then
Error_Msg_FE
("\probable missing pragma Convention for &",
P, Btyp);
end if;
else
Check_Subtype_Conformant
(New_Id => Entity (P),
Old_Id => Designated_Type (Btyp),
Err_Loc => P);
end if;
if Attr_Id = Attribute_Unchecked_Access then
Error_Msg_Name_1 := Aname;
Error_Msg_F
("attribute% cannot be applied to a subprogram", P);
elsif Aname = Name_Unrestricted_Access then
null; -- Nothing to check
-- Check the static accessibility rule of 3.10.2(32).
-- This rule also applies within the private part of an
-- instantiation. This rule does not apply to anonymous
-- access-to-subprogram types in access parameters.
elsif Attr_Id = Attribute_Access
and then not In_Instance_Body
and then
(Ekind (Btyp) = E_Access_Subprogram_Type
or else Is_Local_Anonymous_Access (Btyp))
and then Subprogram_Access_Level (Entity (P)) >
Type_Access_Level (Btyp)
then
Error_Msg_F
("subprogram must not be deeper than access type", P);
-- Check the restriction of 3.10.2(32) that disallows the
-- access attribute within a generic body when the ultimate
-- ancestor of the type of the attribute is declared outside
-- of the generic unit and the subprogram is declared within
-- that generic unit. This includes any such attribute that
-- occurs within the body of a generic unit that is a child
-- of the generic unit where the subprogram is declared.
-- The rule also prohibits applying the attribute when the
-- access type is a generic formal access type (since the
-- level of the actual type is not known). This restriction
-- does not apply when the attribute type is an anonymous
-- access-to-subprogram type. Note that this check was
-- revised by AI-229, because the original Ada 95 rule
-- was too lax. The original rule only applied when the
-- subprogram was declared within the body of the generic,
-- which allowed the possibility of dangling references).
-- The rule was also too strict in some cases, in that it
-- didn't permit the access to be declared in the generic
-- spec, whereas the revised rule does (as long as it's not
-- a formal type).
-- There are a couple of subtleties of the test for applying
-- the check that are worth noting. First, we only apply it
-- when the levels of the subprogram and access type are the
-- same (the case where the subprogram is statically deeper
-- was applied above, and the case where the type is deeper
-- is always safe). Second, we want the check to apply
-- within nested generic bodies and generic child unit
-- bodies, but not to apply to an attribute that appears in
-- the generic unit's specification. This is done by testing
-- that the attribute's innermost enclosing generic body is
-- not the same as the innermost generic body enclosing the
-- generic unit where the subprogram is declared (we don't
-- want the check to apply when the access attribute is in
-- the spec and there's some other generic body enclosing
-- generic). Finally, there's no point applying the check
-- when within an instance, because any violations will have
-- been caught by the compilation of the generic unit.
-- We relax this check in Relaxed_RM_Semantics mode for
-- compatibility with legacy code for use by Ada source
-- code analyzers (e.g. CodePeer).
elsif Attr_Id = Attribute_Access
and then not Relaxed_RM_Semantics
and then not In_Instance
and then Present (Enclosing_Generic_Unit (Entity (P)))
and then Present (Enclosing_Generic_Body (N))
and then Enclosing_Generic_Body (N) /=
Enclosing_Generic_Body
(Enclosing_Generic_Unit (Entity (P)))
and then Subprogram_Access_Level (Entity (P)) =
Type_Access_Level (Btyp)
and then Ekind (Btyp) /=
E_Anonymous_Access_Subprogram_Type
and then Ekind (Btyp) /=
E_Anonymous_Access_Protected_Subprogram_Type
then
-- The attribute type's ultimate ancestor must be
-- declared within the same generic unit as the
-- subprogram is declared (including within another
-- nested generic unit). The error message is
-- specialized to say "ancestor" for the case where the
-- access type is not its own ancestor, since saying
-- simply "access type" would be very confusing.
if not Declared_Within_Generic_Unit
(Root_Type (Btyp),
Enclosing_Generic_Unit (Entity (P)))
then
Error_Msg_N
("''Access attribute not allowed in generic body",
N);
if Root_Type (Btyp) = Btyp then
Error_Msg_NE
("\because " &
"access type & is declared outside " &
"generic unit (RM 3.10.2(32))", N, Btyp);
else
Error_Msg_NE
("\because ancestor of " &
"access type & is declared outside " &
"generic unit (RM 3.10.2(32))", N, Btyp);
end if;
Error_Msg_NE
("\move ''Access to private part, or " &
"(Ada 2005) use anonymous access type instead of &",
N, Btyp);
-- If the ultimate ancestor of the attribute's type is
-- a formal type, then the attribute is illegal because
-- the actual type might be declared at a higher level.
-- The error message is specialized to say "ancestor"
-- for the case where the access type is not its own
-- ancestor, since saying simply "access type" would be
-- very confusing.
elsif Is_Generic_Type (Root_Type (Btyp)) then
if Root_Type (Btyp) = Btyp then
Error_Msg_N
("access type must not be a generic formal type",
N);
else
Error_Msg_N
("ancestor access type must not be a generic " &
"formal type", N);
end if;
end if;
end if;
end if;
-- If this is a renaming, an inherited operation, or a
-- subprogram instance, use the original entity. This may make
-- the node type-inconsistent, so this transformation can only
-- be done if the node will not be reanalyzed. In particular,
-- if it is within a default expression, the transformation
-- must be delayed until the default subprogram is created for
-- it, when the enclosing subprogram is frozen.
if Is_Entity_Name (P)
and then Is_Overloadable (Entity (P))
and then Present (Alias (Entity (P)))
and then Expander_Active
then
Rewrite (P,
New_Occurrence_Of (Alias (Entity (P)), Sloc (P)));
end if;
elsif Nkind (P) = N_Selected_Component
and then Is_Overloadable (Entity (Selector_Name (P)))
then
-- Protected operation. If operation is overloaded, must
-- disambiguate. Prefix that denotes protected object itself
-- is resolved with its own type.
if Attr_Id = Attribute_Unchecked_Access then
Error_Msg_Name_1 := Aname;
Error_Msg_F
("attribute% cannot be applied to protected operation", P);
end if;
Resolve (Prefix (P));
if not Is_Overloaded (P) then
Generate_Reference (Entity (Selector_Name (P)), P);
else
Get_First_Interp (P, Index, It);
while Present (It.Nam) loop
if Type_Conformant (Designated_Type (Typ), It.Nam) then
Set_Entity (Selector_Name (P), It.Nam);
-- The prefix is definitely NOT overloaded anymore at
-- this point, so we reset the Is_Overloaded flag to
-- avoid any confusion when reanalyzing the node.
Set_Is_Overloaded (P, False);
Set_Is_Overloaded (N, False);
Generate_Reference (Entity (Selector_Name (P)), P);
exit;
end if;
Get_Next_Interp (Index, It);
end loop;
end if;
-- Implement check implied by 3.10.2 (18.1/2) : F.all'access is
-- statically illegal if F is an anonymous access to subprogram.
elsif Nkind (P) = N_Explicit_Dereference
and then Is_Entity_Name (Prefix (P))
and then Ekind (Etype (Entity (Prefix (P)))) =
E_Anonymous_Access_Subprogram_Type
then
Error_Msg_N ("anonymous access to subprogram "
& "has deeper accessibility than any master", P);
elsif Is_Overloaded (P) then
-- Use the designated type of the context to disambiguate
-- Note that this was not strictly conformant to Ada 95,
-- but was the implementation adopted by most Ada 95 compilers.
-- The use of the context type to resolve an Access attribute
-- reference is now mandated in AI-235 for Ada 2005.
declare
Index : Interp_Index;
It : Interp;
begin
Get_First_Interp (P, Index, It);
while Present (It.Typ) loop
if Covers (Designated_Type (Typ), It.Typ) then
Resolve (P, It.Typ);
exit;
end if;
Get_Next_Interp (Index, It);
end loop;
end;
else
Resolve (P);
end if;
-- X'Access is illegal if X denotes a constant and the access type
-- is access-to-variable. Same for 'Unchecked_Access. The rule
-- does not apply to 'Unrestricted_Access. If the reference is a
-- default-initialized aggregate component for a self-referential
-- type the reference is legal.
if not (Ekind (Btyp) = E_Access_Subprogram_Type
or else Ekind (Btyp) = E_Anonymous_Access_Subprogram_Type
or else (Is_Record_Type (Btyp)
and then
Present (Corresponding_Remote_Type (Btyp)))
or else Ekind (Btyp) = E_Access_Protected_Subprogram_Type
or else Ekind (Btyp)
= E_Anonymous_Access_Protected_Subprogram_Type
or else Is_Access_Constant (Btyp)
or else Is_Variable (P)
or else Attr_Id = Attribute_Unrestricted_Access)
then
if Is_Entity_Name (P)
and then Is_Type (Entity (P))
then
-- Legality of a self-reference through an access
-- attribute has been verified in Analyze_Access_Attribute.
null;
elsif Comes_From_Source (N) then
Error_Msg_F ("access-to-variable designates constant", P);
end if;
end if;
Des_Btyp := Designated_Type (Btyp);
if Ada_Version >= Ada_2005
and then Is_Incomplete_Type (Des_Btyp)
then
-- Ada 2005 (AI-412): If the (sub)type is a limited view of an
-- imported entity, and the non-limited view is visible, make
-- use of it. If it is an incomplete subtype, use the base type
-- in any case.
if From_Limited_With (Des_Btyp)
and then Present (Non_Limited_View (Des_Btyp))
then
Des_Btyp := Non_Limited_View (Des_Btyp);
elsif Ekind (Des_Btyp) = E_Incomplete_Subtype then
Des_Btyp := Etype (Des_Btyp);
end if;
end if;
if (Attr_Id = Attribute_Access
or else
Attr_Id = Attribute_Unchecked_Access)
and then (Ekind (Btyp) = E_General_Access_Type
or else Ekind (Btyp) = E_Anonymous_Access_Type)
then
-- Ada 2005 (AI-230): Check the accessibility of anonymous
-- access types for stand-alone objects, record and array
-- components, and return objects. For a component definition
-- the level is the same of the enclosing composite type.
if Ada_Version >= Ada_2005
and then (Is_Local_Anonymous_Access (Btyp)
-- Handle cases where Btyp is the anonymous access
-- type of an Ada 2012 stand-alone object.
or else Nkind (Associated_Node_For_Itype (Btyp)) =
N_Object_Declaration)
and then Attr_Id = Attribute_Access
-- Verify that static checking is OK (namely that we aren't
-- in a specific context requiring dynamic checks on
-- expicitly aliased parameters), and then check the level.
-- Otherwise a check will be generated later when the return
-- statement gets expanded.
and then not Is_Special_Aliased_Formal_Access
(N, Current_Scope)
and then
Object_Access_Level (P) > Deepest_Type_Access_Level (Btyp)
then
-- In an instance, this is a runtime check, but one we know
-- will fail, so generate an appropriate warning. As usual,
-- this kind of warning is an error in SPARK mode.
if In_Instance_Body then
Error_Msg_Warn := SPARK_Mode /= On;
Error_Msg_F
("non-local pointer cannot point to local object<<", P);
Error_Msg_F ("\Program_Error [<<", P);
Rewrite (N,
Make_Raise_Program_Error (Loc,
Reason => PE_Accessibility_Check_Failed));
Set_Etype (N, Typ);
else
Error_Msg_F
("non-local pointer cannot point to local object", P);
end if;
end if;
if Is_Dependent_Component_Of_Mutable_Object (P) then
Error_Msg_F
("illegal attribute for discriminant-dependent component",
P);
end if;
-- Check static matching rule of 3.10.2(27). Nominal subtype
-- of the prefix must statically match the designated type.
Nom_Subt := Etype (P);
if Is_Constr_Subt_For_U_Nominal (Nom_Subt) then
Nom_Subt := Base_Type (Nom_Subt);
end if;
if Is_Tagged_Type (Designated_Type (Typ)) then
-- If the attribute is in the context of an access
-- parameter, then the prefix is allowed to be of
-- the class-wide type (by AI-127).
if Ekind (Typ) = E_Anonymous_Access_Type then
if not Covers (Designated_Type (Typ), Nom_Subt)
and then not Covers (Nom_Subt, Designated_Type (Typ))
then
declare
Desig : Entity_Id;
begin
Desig := Designated_Type (Typ);
if Is_Class_Wide_Type (Desig) then
Desig := Etype (Desig);
end if;
if Is_Anonymous_Tagged_Base (Nom_Subt, Desig) then
null;
else
Error_Msg_FE
("type of prefix: & not compatible",
P, Nom_Subt);
Error_Msg_FE
("\with &, the expected designated type",
P, Designated_Type (Typ));
end if;
end;
end if;
elsif not Covers (Designated_Type (Typ), Nom_Subt)
or else
(not Is_Class_Wide_Type (Designated_Type (Typ))
and then Is_Class_Wide_Type (Nom_Subt))
then
Error_Msg_FE
("type of prefix: & is not covered", P, Nom_Subt);
Error_Msg_FE
("\by &, the expected designated type" &
" (RM 3.10.2 (27))", P, Designated_Type (Typ));
end if;
if Is_Class_Wide_Type (Designated_Type (Typ))
and then Has_Discriminants (Etype (Designated_Type (Typ)))
and then Is_Constrained (Etype (Designated_Type (Typ)))
and then Designated_Type (Typ) /= Nom_Subt
then
Apply_Discriminant_Check
(N, Etype (Designated_Type (Typ)));
end if;
-- Ada 2005 (AI-363): Require static matching when designated
-- type has discriminants and a constrained partial view, since
-- in general objects of such types are mutable, so we can't
-- allow the access value to designate a constrained object
-- (because access values must be assumed to designate mutable
-- objects when designated type does not impose a constraint).
elsif Subtypes_Statically_Match (Des_Btyp, Nom_Subt) then
null;
elsif Has_Discriminants (Designated_Type (Typ))
and then not Is_Constrained (Des_Btyp)
and then
(Ada_Version < Ada_2005
or else
not Object_Type_Has_Constrained_Partial_View
(Typ => Designated_Type (Base_Type (Typ)),
Scop => Current_Scope))
then
null;
else
Error_Msg_F
("object subtype must statically match "
& "designated subtype", P);
if Is_Entity_Name (P)
and then Is_Array_Type (Designated_Type (Typ))
then
declare
D : constant Node_Id := Declaration_Node (Entity (P));
begin
Error_Msg_N
("aliased object has explicit bounds??", D);
Error_Msg_N
("\declare without bounds (and with explicit "
& "initialization)??", D);
Error_Msg_N
("\for use with unconstrained access??", D);
end;
end if;
end if;
-- Check the static accessibility rule of 3.10.2(28). Note that
-- this check is not performed for the case of an anonymous
-- access type, since the access attribute is always legal
-- in such a context.
if Attr_Id /= Attribute_Unchecked_Access
and then Ekind (Btyp) = E_General_Access_Type
and then
Object_Access_Level (P) > Deepest_Type_Access_Level (Btyp)
then
Accessibility_Message;
return;
end if;
end if;
if Ekind (Btyp) in E_Access_Protected_Subprogram_Type
| E_Anonymous_Access_Protected_Subprogram_Type
then
if Is_Entity_Name (P)
and then not Is_Protected_Type (Scope (Entity (P)))
then
Error_Msg_F ("context requires a protected subprogram", P);
-- Check accessibility of protected object against that of the
-- access type, but only on user code, because the expander
-- creates access references for handlers. If the context is an
-- anonymous_access_to_protected, there are no accessibility
-- checks either. Omit check entirely for Unrestricted_Access.
elsif Object_Access_Level (P) > Deepest_Type_Access_Level (Btyp)
and then Comes_From_Source (N)
and then Ekind (Btyp) = E_Access_Protected_Subprogram_Type
and then Attr_Id /= Attribute_Unrestricted_Access
then
Accessibility_Message;
return;
-- AI05-0225: If the context is not an access to protected
-- function, the prefix must be a variable, given that it may
-- be used subsequently in a protected call.
elsif Nkind (P) = N_Selected_Component
and then not Is_Variable (Prefix (P))
and then Ekind (Entity (Selector_Name (P))) /= E_Function
then
Error_Msg_N
("target object of access to protected procedure "
& "must be variable", N);
elsif Is_Entity_Name (P) then
Check_Internal_Protected_Use (N, Entity (P));
end if;
elsif Ekind (Btyp) in E_Access_Subprogram_Type
| E_Anonymous_Access_Subprogram_Type
and then Ekind (Etype (N)) = E_Access_Protected_Subprogram_Type
then
Error_Msg_F ("context requires a non-protected subprogram", P);
end if;
-- The context cannot be a pool-specific type, but this is a
-- legality rule, not a resolution rule, so it must be checked
-- separately, after possibly disambiguation (see AI-245).
if Ekind (Btyp) = E_Access_Type
and then Attr_Id /= Attribute_Unrestricted_Access
then
Wrong_Type (N, Typ);
end if;
-- The context may be a constrained access type (however ill-
-- advised such subtypes might be) so in order to generate a
-- constraint check we need to set the type of the attribute
-- reference to the base type of the context.
Set_Etype (N, Btyp);
-- Check for incorrect atomic/volatile reference (RM C.6(12))
if Attr_Id /= Attribute_Unrestricted_Access then
if Is_Atomic_Object (P)
and then not Is_Atomic (Designated_Type (Typ))
then
Error_Msg_F
("access to atomic object cannot yield access-to-" &
"non-atomic type", P);
elsif Is_Volatile_Object (P)
and then not Is_Volatile (Designated_Type (Typ))
then
Error_Msg_F
("access to volatile object cannot yield access-to-" &
"non-volatile type", P);
end if;
end if;
-- Check for aliased view. We allow a nonaliased prefix when in
-- an instance because the prefix may have been a tagged formal
-- object, which is defined to be aliased even when the actual
-- might not be (other instance cases will have been caught in
-- the generic). Similarly, within an inlined body we know that
-- the attribute is legal in the original subprogram, therefore
-- legal in the expansion.
if not (Is_Entity_Name (P)
and then Is_Overloadable (Entity (P)))
and then not (Nkind (P) = N_Selected_Component
and then
Is_Overloadable (Entity (Selector_Name (P))))
and then not Is_Aliased_View (Original_Node (P))
and then not In_Instance
and then not In_Inlined_Body
and then Comes_From_Source (N)
then
-- Here we have a non-aliased view. This is illegal unless we
-- have the case of Unrestricted_Access, where for now we allow
-- this (we will reject later if expected type is access to an
-- unconstrained array with a thin pointer).
-- No need for an error message on a generated access reference
-- for the controlling argument in a dispatching call: error
-- will be reported when resolving the call.
if Attr_Id /= Attribute_Unrestricted_Access then
Error_Msg_Name_1 := Aname;
Error_Msg_N ("prefix of % attribute must be aliased", P);
-- Check for unrestricted access where expected type is a thin
-- pointer to an unconstrained array.
elsif Has_Size_Clause (Typ)
and then RM_Size (Typ) = System_Address_Size
then
declare
DT : constant Entity_Id := Designated_Type (Typ);
begin
if Is_Array_Type (DT)
and then not Is_Constrained (DT)
then
Error_Msg_N
("illegal use of Unrestricted_Access attribute", P);
Error_Msg_N
("\attempt to generate thin pointer to unaliased "
& "object", P);
end if;
end;
end if;
end if;
-- Check that the prefix does not have a value conversion of an
-- array type since a value conversion is like an aggregate with
-- respect to determining accessibility level (RM 3.10.2).
if not Prefix_With_Safe_Accessibility_Level then
Accessibility_Message;
return;
end if;
-- Mark that address of entity is taken in case of
-- 'Unrestricted_Access or in case of a subprogram.
if Is_Entity_Name (P)
and then (Attr_Id = Attribute_Unrestricted_Access
or else Is_Subprogram (Entity (P)))
then
Set_Address_Taken (Entity (P));
end if;
-- Deal with possible elaboration check
if Is_Entity_Name (P) and then Is_Subprogram (Entity (P)) then
declare
Subp_Id : constant Entity_Id := Entity (P);
Scop : constant Entity_Id := Scope (Subp_Id);
Subp_Decl : constant Node_Id :=
Unit_Declaration_Node (Subp_Id);
Flag_Id : Entity_Id;
Subp_Body : Node_Id;
-- If the access has been taken and the body of the subprogram
-- has not been see yet, indirect calls must be protected with
-- elaboration checks. We have the proper elaboration machinery
-- for subprograms declared in packages, but within a block or
-- a subprogram the body will appear in the same declarative
-- part, and we must insert a check in the eventual body itself
-- using the elaboration flag that we generate now. The check
-- is then inserted when the body is expanded. This processing
-- is not needed for a stand alone expression function because
-- the internally generated spec and body are always inserted
-- as a pair in the same declarative list.
begin
if Expander_Active
and then Comes_From_Source (Subp_Id)
and then Comes_From_Source (N)
and then In_Open_Scopes (Scop)
and then Ekind (Scop) in E_Block | E_Procedure | E_Function
and then not Has_Completion (Subp_Id)
and then No (Elaboration_Entity (Subp_Id))
and then Nkind (Subp_Decl) = N_Subprogram_Declaration
and then Nkind (Original_Node (Subp_Decl)) /=
N_Expression_Function
then
-- Create elaboration variable for it
Flag_Id := Make_Temporary (Loc, 'E');
Set_Elaboration_Entity (Subp_Id, Flag_Id);
Set_Is_Frozen (Flag_Id);
-- Insert declaration for flag after subprogram
-- declaration. Note that attribute reference may
-- appear within a nested scope.
Insert_After_And_Analyze (Subp_Decl,
Make_Object_Declaration (Loc,
Defining_Identifier => Flag_Id,
Object_Definition =>
New_Occurrence_Of (Standard_Short_Integer, Loc),
Expression =>
Make_Integer_Literal (Loc, Uint_0)));
-- The above sets the Scope of the flag entity to the
-- current scope, in which the attribute appears, but
-- the flag declaration has been inserted after that
-- of Subp_Id, so the scope of the flag is the same as
-- that of Subp_Id. This is relevant when unnesting,
-- where processing depends on correct scope setting.
Set_Scope (Flag_Id, Scop);
end if;
-- Taking the 'Access of an expression function freezes its
-- expression (RM 13.14 10.3/3). This does not apply to an
-- expression function that acts as a completion because the
-- generated body is immediately analyzed and the expression
-- is automatically frozen.
if Is_Expression_Function (Subp_Id)
and then Present (Corresponding_Body (Subp_Decl))
then
Subp_Body :=
Unit_Declaration_Node (Corresponding_Body (Subp_Decl));
-- The body has already been analyzed when the expression
-- function acts as a completion.
if Analyzed (Subp_Body) then
null;
-- Attribute 'Access may appear within the generated body
-- of the expression function subject to the attribute:
-- function F is (... F'Access ...);
-- If the expression function is on the scope stack, then
-- the body is currently being analyzed. Do not reanalyze
-- it because this will lead to infinite recursion.
elsif In_Open_Scopes (Subp_Id) then
null;
-- If reference to the expression function appears in an
-- inner scope, for example as an actual in an instance,
-- this is not a freeze point either.
elsif Scope (Subp_Id) /= Current_Scope then
null;
-- Analyze the body of the expression function to freeze
-- the expression. This takes care of the case where the
-- 'Access is part of dispatch table initialization and
-- the generated body of the expression function has not
-- been analyzed yet.
else
Analyze (Subp_Body);
end if;
end if;
end;
end if;
-------------
-- Address --
-------------
-- Deal with resolving the type for Address attribute, overloading
-- is not permitted here, since there is no context to resolve it.
when Attribute_Address
| Attribute_Code_Address
=>
-- To be safe, assume that if the address of a variable is taken,
-- it may be modified via this address, so note modification.
if Is_Variable (P) then
Note_Possible_Modification (P, Sure => False);
end if;
if Nkind (P) in N_Subexpr
and then Is_Overloaded (P)
then
Get_First_Interp (P, Index, It);
Get_Next_Interp (Index, It);
if Present (It.Nam) then
Error_Msg_Name_1 := Aname;
Error_Msg_F
("prefix of % attribute cannot be overloaded", P);
end if;
end if;
if not Is_Entity_Name (P)
or else not Is_Overloadable (Entity (P))
then
if not Is_Task_Type (Etype (P))
or else Nkind (P) = N_Explicit_Dereference
then
Resolve (P);
end if;
end if;
-- If this is the name of a derived subprogram, or that of a
-- generic actual, the address is that of the original entity.
if Is_Entity_Name (P)
and then Is_Overloadable (Entity (P))
and then Present (Alias (Entity (P)))
then
Rewrite (P,
New_Occurrence_Of (Alias (Entity (P)), Sloc (P)));
end if;
if Is_Entity_Name (P) then
Set_Address_Taken (Entity (P));
end if;
if Nkind (P) = N_Slice then
-- Arr (X .. Y)'address is identical to Arr (X)'address,
-- even if the array is packed and the slice itself is not
-- addressable. Transform the prefix into an indexed component.
-- Note that the transformation is safe only if we know that
-- the slice is non-null. That is because a null slice can have
-- an out of bounds index value.
-- Right now, gigi blows up if given 'Address on a slice as a
-- result of some incorrect freeze nodes generated by the front
-- end, and this covers up that bug in one case, but the bug is
-- likely still there in the cases not handled by this code ???
-- It's not clear what 'Address *should* return for a null
-- slice with out of bounds indexes, this might be worth an ARG
-- discussion ???
-- One approach would be to do a length check unconditionally,
-- and then do the transformation below unconditionally, but
-- analyze with checks off, avoiding the problem of the out of
-- bounds index. This approach would interpret the address of
-- an out of bounds null slice as being the address where the
-- array element would be if there was one, which is probably
-- as reasonable an interpretation as any ???
declare
Loc : constant Source_Ptr := Sloc (P);
D : constant Node_Id := Discrete_Range (P);
Lo : Node_Id;
begin
if Is_Entity_Name (D)
and then
Not_Null_Range
(Type_Low_Bound (Entity (D)),
Type_High_Bound (Entity (D)))
then
Lo :=
Make_Attribute_Reference (Loc,
Prefix => (New_Occurrence_Of (Entity (D), Loc)),
Attribute_Name => Name_First);
elsif Nkind (D) = N_Range
and then Not_Null_Range (Low_Bound (D), High_Bound (D))
then
Lo := Low_Bound (D);
else
Lo := Empty;
end if;
if Present (Lo) then
Rewrite (P,
Make_Indexed_Component (Loc,
Prefix => Relocate_Node (Prefix (P)),
Expressions => New_List (Lo)));
Analyze_And_Resolve (P);
end if;
end;
end if;
------------------
-- Body_Version --
------------------
-- Prefix of Body_Version attribute can be a subprogram name which
-- must not be resolved, since this is not a call.
when Attribute_Body_Version =>
null;
------------
-- Caller --
------------
-- Prefix of Caller attribute is an entry name which must not
-- be resolved, since this is definitely not an entry call.
when Attribute_Caller =>
null;
------------------
-- Code_Address --
------------------
-- Shares processing with Address attribute
-----------
-- Count --
-----------
-- If the prefix of the Count attribute is an entry name it must not
-- be resolved, since this is definitely not an entry call. However,
-- if it is an element of an entry family, the index itself may
-- have to be resolved because it can be a general expression.
when Attribute_Count =>
if Nkind (P) = N_Indexed_Component
and then Is_Entity_Name (Prefix (P))
then
declare
Indx : constant Node_Id := First (Expressions (P));
Fam : constant Entity_Id := Entity (Prefix (P));
begin
Resolve (Indx, Entry_Index_Type (Fam));
Apply_Scalar_Range_Check (Indx, Entry_Index_Type (Fam));
end;
end if;
----------------
-- Elaborated --
----------------
-- Prefix of the Elaborated attribute is a subprogram name which
-- must not be resolved, since this is definitely not a call. Note
-- that it is a library unit, so it cannot be overloaded here.
when Attribute_Elaborated =>
null;
-------------
-- Enabled --
-------------
-- Prefix of Enabled attribute is a check name, which must be treated
-- specially and not touched by Resolve.
when Attribute_Enabled =>
null;
----------------
-- Loop_Entry --
----------------
-- Do not resolve the prefix of Loop_Entry, instead wait until the
-- attribute has been expanded (see Expand_Loop_Entry_Attributes).
-- The delay ensures that any generated checks or temporaries are
-- inserted before the relocated prefix.
when Attribute_Loop_Entry =>
null;
--------------------
-- Mechanism_Code --
--------------------
-- Prefix of the Mechanism_Code attribute is a function name
-- which must not be resolved. Should we check for overloaded ???
when Attribute_Mechanism_Code =>
null;
------------------
-- Partition_ID --
------------------
-- Most processing is done in sem_dist, after determining the
-- context type. Node is rewritten as a conversion to a runtime call.
when Attribute_Partition_ID =>
Process_Partition_Id (N);
return;
------------------
-- Pool_Address --
------------------
when Attribute_Pool_Address =>
Resolve (P);
-----------
-- Range --
-----------
-- We replace the Range attribute node with a range expression whose
-- bounds are the 'First and 'Last attributes applied to the same
-- prefix. The reason that we do this transformation here instead of
-- in the expander is that it simplifies other parts of the semantic
-- analysis which assume that the Range has been replaced; thus it
-- must be done even when in semantic-only mode (note that the RM
-- specifically mentions this equivalence, we take care that the
-- prefix is only evaluated once).
when Attribute_Range => Range_Attribute : declare
Dims : List_Id;
HB : Node_Id;
LB : Node_Id;
begin
if not Is_Entity_Name (P) or else not Is_Type (Entity (P)) then
Resolve (P);
-- If the prefix is a function call returning on the secondary
-- stack, we must make sure to mark/release the stack.
if Nkind (P) = N_Function_Call
and then Nkind (Parent (N)) = N_Loop_Parameter_Specification
and then Requires_Transient_Scope (Etype (P))
then
Set_Uses_Sec_Stack (Scope (Current_Scope));
end if;
end if;
Dims := Expressions (N);
HB :=
Make_Attribute_Reference (Loc,
Prefix => Duplicate_Subexpr (P, Name_Req => True),
Attribute_Name => Name_Last,
Expressions => Dims);
LB :=
Make_Attribute_Reference (Loc,
Prefix => P,
Attribute_Name => Name_First,
Expressions => (Dims));
-- Do not share the dimension indicator, if present. Even though
-- it is a static constant, its source location may be modified
-- when printing expanded code and node sharing will lead to chaos
-- in Sprint.
if Present (Dims) then
Set_Expressions (LB, New_List (New_Copy_Tree (First (Dims))));
end if;
-- If the original was marked as Must_Not_Freeze (see code in
-- Sem_Ch3.Make_Index), then make sure the rewriting does not
-- freeze either.
if Must_Not_Freeze (N) then
Set_Must_Not_Freeze (HB);
Set_Must_Not_Freeze (LB);
Set_Must_Not_Freeze (Prefix (HB));
Set_Must_Not_Freeze (Prefix (LB));
end if;
if Raises_Constraint_Error (Prefix (N)) then
-- Preserve Sloc of prefix in the new bounds, so that the
-- posted warning can be removed if we are within unreachable
-- code.
Set_Sloc (LB, Sloc (Prefix (N)));
Set_Sloc (HB, Sloc (Prefix (N)));
end if;
Rewrite (N, Make_Range (Loc, LB, HB));
Analyze_And_Resolve (N, Typ);
-- Ensure that the expanded range does not have side effects
Force_Evaluation (LB);
Force_Evaluation (HB);
-- Normally after resolving attribute nodes, Eval_Attribute
-- is called to do any possible static evaluation of the node.
-- However, here since the Range attribute has just been
-- transformed into a range expression it is no longer an
-- attribute node and therefore the call needs to be avoided
-- and is accomplished by simply returning from the procedure.
return;
end Range_Attribute;
-------------
-- Reduce --
-------------
when Attribute_Reduce =>
declare
E1 : constant Node_Id := First (Expressions (N));
E2 : constant Node_Id := Next (E1);
Op : Entity_Id := Empty;
Index : Interp_Index;
It : Interp;
function Proper_Op (Op : Entity_Id) return Boolean;
---------------
-- Proper_Op --
---------------
function Proper_Op (Op : Entity_Id) return Boolean is
F1, F2 : Entity_Id;
begin
F1 := First_Formal (Op);
if No (F1) then
return False;
else
F2 := Next_Formal (F1);
if No (F2)
or else Present (Next_Formal (F2))
then
return False;
elsif Ekind (Op) = E_Procedure then
return Ekind (F1) = E_In_Out_Parameter
and then Covers (Typ, Etype (F1));
else
return
(Ekind (Op) = E_Operator
and then Scope (Op) = Standard_Standard)
or else Covers (Typ, Etype (Op));
end if;
end if;
end Proper_Op;
begin
Resolve (E2, Typ);
if Is_Overloaded (E1) then
Get_First_Interp (E1, Index, It);
while Present (It.Nam) loop
if Proper_Op (It.Nam) then
Op := It.Nam;
Set_Entity (E1, Op);
exit;
end if;
Get_Next_Interp (Index, It);
end loop;
elsif Nkind (E1) = N_Attribute_Reference
and then (Attribute_Name (E1) = Name_Max
or else Attribute_Name (E1) = Name_Min)
then
Op := E1;
elsif Proper_Op (Entity (E1)) then
Op := Entity (E1);
Set_Etype (N, Typ);
end if;
if No (Op) then
Error_Msg_N ("No visible subprogram for reduction", E1);
end if;
end;
------------
-- Result --
------------
-- We will only come here during the prescan of a spec expression
-- containing a Result attribute. In that case the proper Etype has
-- already been set, and nothing more needs to be done here.
when Attribute_Result =>
null;
----------------------
-- Unchecked_Access --
----------------------
-- Processing is shared with Access
-------------------------
-- Unrestricted_Access --
-------------------------
-- Processing is shared with Access
------------
-- Update --
------------
-- Resolve aggregate components in component associations
when Attribute_Update => Update : declare
Aggr : constant Node_Id := First (Expressions (N));
Typ : constant Entity_Id := Etype (Prefix (N));
Assoc : Node_Id;
Comp : Node_Id;
Expr : Node_Id;
begin
-- Set the Etype of the aggregate to that of the prefix, even
-- though the aggregate may not be a proper representation of a
-- value of the type (missing or duplicated associations, etc.)
-- Complete resolution of the prefix. Note that in Ada 2012 it
-- can be a qualified expression that is e.g. an aggregate.
Set_Etype (Aggr, Typ);
Resolve (Prefix (N), Typ);
-- For an array type, resolve expressions with the component type
-- of the array, and apply constraint checks when needed.
if Is_Array_Type (Typ) then
Assoc := First (Component_Associations (Aggr));
while Present (Assoc) loop
Expr := Expression (Assoc);
Resolve (Expr, Component_Type (Typ));
-- The choices in the association are static constants,
-- or static aggregates each of whose components belongs
-- to the proper index type. However, they must also
-- belong to the index subtype (s) of the prefix, which
-- may be a subtype (e.g. given by a slice).
-- Choices may also be identifiers with no staticness
-- requirements, in which case they must resolve to the
-- index type.
declare
C : Node_Id;
C_E : Node_Id;
Indx : Node_Id;
begin
C := First (Choices (Assoc));
while Present (C) loop
Indx := First_Index (Etype (Prefix (N)));
if Nkind (C) /= N_Aggregate then
Analyze_And_Resolve (C, Etype (Indx));
else
C_E := First (Expressions (C));
while Present (C_E) loop
Analyze_And_Resolve (C_E, Etype (Indx));
Next (C_E);
Next_Index (Indx);
end loop;
end if;
Next (C);
end loop;
end;
Next (Assoc);
end loop;
-- For a record type, use type of each component, which is
-- recorded during analysis.
else
Assoc := First (Component_Associations (Aggr));
while Present (Assoc) loop
Comp := First (Choices (Assoc));
Expr := Expression (Assoc);
if Nkind (Comp) /= N_Others_Choice
and then not Error_Posted (Comp)
then
Resolve (Expr, Etype (Entity (Comp)));
end if;
Next (Assoc);
end loop;
end if;
end Update;
---------
-- Val --
---------
-- Apply range check. Note that we did not do this during the
-- analysis phase, since we wanted Eval_Attribute to have a
-- chance at finding an illegal out of range value.
when Attribute_Val =>
-- Note that we do our own Eval_Attribute call here rather than
-- use the common one, because we need to do processing after
-- the call, as per above comment.
Eval_Attribute (N);
-- Eval_Attribute may replace the node with a raise CE, or
-- fold it to a constant. Obviously we only apply a scalar
-- range check if this did not happen.
if Nkind (N) = N_Attribute_Reference
and then Attribute_Name (N) = Name_Val
then
Apply_Scalar_Range_Check (First (Expressions (N)), Btyp);
end if;
return;
-------------
-- Version --
-------------
-- Prefix of Version attribute can be a subprogram name which
-- must not be resolved, since this is not a call.
when Attribute_Version =>
null;
----------------------
-- Other Attributes --
----------------------
-- For other attributes, resolve prefix unless it is a type. If
-- the attribute reference itself is a type name ('Base and 'Class)
-- then this is only legal within a task or protected record.
when others =>
if not Is_Entity_Name (P) or else not Is_Type (Entity (P)) then
Resolve (P);
end if;
-- If the attribute reference itself is a type name ('Base,
-- 'Class) then this is only legal within a task or protected
-- record. What is this all about ???
if Is_Entity_Name (N) and then Is_Type (Entity (N)) then
if Is_Concurrent_Type (Entity (N))
and then In_Open_Scopes (Entity (P))
then
null;
else
Error_Msg_N
("invalid use of subtype name in expression or call", N);
end if;
end if;
-- For attributes whose argument may be a string, complete
-- resolution of argument now. This avoids premature expansion
-- (and the creation of transient scopes) before the attribute
-- reference is resolved.
case Attr_Id is
when Attribute_Value =>
Resolve (First (Expressions (N)), Standard_String);
when Attribute_Wide_Value =>
Resolve (First (Expressions (N)), Standard_Wide_String);
when Attribute_Wide_Wide_Value =>
Resolve (First (Expressions (N)), Standard_Wide_Wide_String);
when others => null;
end case;
-- If the prefix of the attribute is a class-wide type then it
-- will be expanded into a dispatching call to a predefined
-- primitive. Therefore we must check for potential violation
-- of such restriction.
if Is_Class_Wide_Type (Etype (P)) then
Check_Restriction (No_Dispatching_Calls, N);
end if;
end case;
-- Mark use clauses of the original prefix if the attribute is applied
-- to an entity.
if Nkind (Original_Node (P)) in N_Has_Entity
and then Present (Entity (Original_Node (P)))
then
Mark_Use_Clauses (Original_Node (P));
end if;
-- Normally the Freezing is done by Resolve but sometimes the Prefix
-- is not resolved, in which case the freezing must be done now.
-- For an elaboration check on a subprogram, we do not freeze its type.
-- It may be declared in an unrelated scope, in particular in the case
-- of a generic function whose type may remain unelaborated.
if Attr_Id = Attribute_Elaborated then
null;
-- Should this be restricted to Expander_Active???
else
Freeze_Expression (P);
end if;
-- Finally perform static evaluation on the attribute reference
Analyze_Dimension (N);
Eval_Attribute (N);
end Resolve_Attribute;
------------------------
-- Set_Boolean_Result --
------------------------
procedure Set_Boolean_Result (N : Node_Id; B : Boolean) is
Loc : constant Source_Ptr := Sloc (N);
begin
if B then
Rewrite (N, New_Occurrence_Of (Standard_True, Loc));
else
Rewrite (N, New_Occurrence_Of (Standard_False, Loc));
end if;
end Set_Boolean_Result;
--------------------------------
-- Stream_Attribute_Available --
--------------------------------
function Stream_Attribute_Available
(Typ : Entity_Id;
Nam : TSS_Name_Type;
Partial_View : Node_Id := Empty) return Boolean
is
Etyp : Entity_Id := Typ;
-- Start of processing for Stream_Attribute_Available
begin
-- We need some comments in this body ???
if Has_Stream_Attribute_Definition (Typ, Nam) then
return True;
end if;
if Is_Class_Wide_Type (Typ) then
return not Is_Limited_Type (Typ)
or else Stream_Attribute_Available (Etype (Typ), Nam);
end if;
if Nam = TSS_Stream_Input
and then Is_Abstract_Type (Typ)
and then not Is_Class_Wide_Type (Typ)
then
return False;
end if;
if not (Is_Limited_Type (Typ)
or else (Present (Partial_View)
and then Is_Limited_Type (Partial_View)))
then
return True;
end if;
-- In Ada 2005, Input can invoke Read, and Output can invoke Write
if Nam = TSS_Stream_Input
and then Ada_Version >= Ada_2005
and then Stream_Attribute_Available (Etyp, TSS_Stream_Read)
then
return True;
elsif Nam = TSS_Stream_Output
and then Ada_Version >= Ada_2005
and then Stream_Attribute_Available (Etyp, TSS_Stream_Write)
then
return True;
end if;
-- Case of Read and Write: check for attribute definition clause that
-- applies to an ancestor type.
while Etype (Etyp) /= Etyp loop
Etyp := Etype (Etyp);
if Has_Stream_Attribute_Definition (Etyp, Nam) then
return True;
end if;
end loop;
if Ada_Version < Ada_2005 then
-- In Ada 95 mode, also consider a non-visible definition
declare
Btyp : constant Entity_Id := Implementation_Base_Type (Typ);
begin
return Btyp /= Typ
and then Stream_Attribute_Available
(Btyp, Nam, Partial_View => Typ);
end;
end if;
return False;
end Stream_Attribute_Available;
end Sem_Attr;
|
package zlib.Strings is
pragma Preelaborate;
procedure Deflate (
Stream : in out zlib.Stream;
In_Item : in String;
In_Last : out Natural;
Out_Item : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Finish : in Boolean;
Finished : out Boolean);
procedure Deflate (
Stream : in out zlib.Stream;
In_Item : in String;
In_Last : out Natural;
Out_Item : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset);
procedure Deflate (
Stream : in out zlib.Stream;
Out_Item : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Finish : in Boolean;
Finished : out Boolean)
renames zlib.Deflate;
procedure Inflate (
Stream : in out zlib.Stream;
In_Item : in Ada.Streams.Stream_Element_Array;
In_Last : out Ada.Streams.Stream_Element_Offset;
Out_Item : out String;
Out_Last : out Natural;
Finish : in Boolean;
Finished : out Boolean);
procedure Inflate (
Stream : in out zlib.Stream;
In_Item : in Ada.Streams.Stream_Element_Array;
In_Last : out Ada.Streams.Stream_Element_Offset;
Out_Item : out String;
Out_Last : out Natural);
procedure Inflate (
Stream : in out zlib.Stream;
Out_Item : out String;
Out_Last : out Natural;
Finish : in Boolean;
Finished : out Boolean);
end zlib.Strings;
|
with Ada.Containers.Ordered_Maps;
with Ada.Unchecked_Deallocation;
with Interfaces; use Interfaces;
package body kv.avm.Actor_Pool is
use kv.avm.Executables;
package Actors is new Ada.Containers.Ordered_Maps
(Key_Type => Interfaces.Unsigned_32,
Element_Type => kv.avm.Executables.Executable_Access ); -- kv.avm.Instances.Instance_Access );
Pool : Actors.Map;
Count : Interfaces.Unsigned_32 := 0;
-----------------------------------------------------------------------------
procedure Add
(Actor : in kv.avm.Executables.Executable_Access;
Reference : out kv.avm.Actor_References.Actor_Reference_Type) is
begin
Count := Count + 1;
Pool.Insert(Count, Actor);
Reference.Initialize(Count);
end Add;
-----------------------------------------------------------------------------
procedure Free is new Ada.Unchecked_Deallocation(kv.avm.Executables.Executable_Interface'CLASS, kv.avm.Executables.Executable_Access);
-----------------------------------------------------------------------------
procedure Delete
(Reference : in kv.avm.Actor_References.Actor_Reference_Type) is
Location : Actors.Cursor;
Instance : kv.avm.Executables.Executable_Access;
use Actors;
begin
Location := Pool.Find(Reference.Get_Key);
if Location /= Actors.No_Element then
Instance := Actors.Element(Location);
Pool.Delete(Location);
Free(Instance);
end if;
end Delete;
-----------------------------------------------------------------------------
function Resolve(Reference : kv.avm.Actor_References.Actor_Reference_Type) return kv.avm.Executables.Executable_Access is
Location : Actors.Cursor;
use Actors;
begin
Location := Pool.Find(Reference.Get_Key);
if Location = Actors.No_Element then
return null;
else
return Actors.Element(Location);
end if;
end Resolve;
-----------------------------------------------------------------------------
procedure Empty_Actor_Pool is
begin
Pool.Clear;
end Empty_Actor_Pool;
end kv.avm.Actor_Pool;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2009-2011, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
package Matreshka.Atomics is
pragma Pure;
end Matreshka.Atomics;
|
address=/govjiangsu.cn/127.0.0.1
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.RED_BLACK_TREES.GENERIC_SET_OPERATIONS --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with System; use type System.Address;
package body Ada.Containers.Red_Black_Trees.Generic_Set_Operations 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 Clear (Tree : in out Tree_Type);
function Copy (Source : Tree_Type) return Tree_Type;
-----------
-- Clear --
-----------
procedure Clear (Tree : in out Tree_Type) is
use type Helpers.Tamper_Counts;
pragma Assert (Tree.TC = (Busy => 0, Lock => 0));
Root : Node_Access := Tree.Root;
pragma Warnings (Off, Root);
begin
Tree.Root := null;
Tree.First := null;
Tree.Last := null;
Tree.Length := 0;
Delete_Tree (Root);
end Clear;
----------
-- Copy --
----------
function Copy (Source : Tree_Type) return Tree_Type is
Target : Tree_Type;
begin
if Source.Length = 0 then
return Target;
end if;
Target.Root := Copy_Tree (Source.Root);
Target.First := Tree_Operations.Min (Target.Root);
Target.Last := Tree_Operations.Max (Target.Root);
Target.Length := Source.Length;
return Target;
end Copy;
----------------
-- Difference --
----------------
procedure Difference (Target : in out Tree_Type; Source : Tree_Type) is
Tgt : Node_Access;
Src : Node_Access;
Compare : Integer;
begin
TC_Check (Target.TC);
if Target'Address = Source'Address then
Clear (Target);
return;
end if;
if Source.Length = 0 then
return;
end if;
Tgt := Target.First;
Src := Source.First;
loop
if Tgt = null then
exit;
end if;
if Src = null then
exit;
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock_Target : With_Lock (Target.TC'Unrestricted_Access);
Lock_Source : With_Lock (Source.TC'Unrestricted_Access);
begin
if Is_Less (Tgt, Src) then
Compare := -1;
elsif Is_Less (Src, Tgt) then
Compare := 1;
else
Compare := 0;
end if;
end;
if Compare < 0 then
Tgt := Tree_Operations.Next (Tgt);
elsif Compare > 0 then
Src := Tree_Operations.Next (Src);
else
declare
X : Node_Access := Tgt;
begin
Tgt := Tree_Operations.Next (Tgt);
Tree_Operations.Delete_Node_Sans_Free (Target, X);
Free (X);
end;
Src := Tree_Operations.Next (Src);
end if;
end loop;
end Difference;
function Difference (Left, Right : Tree_Type) return Tree_Type is
begin
if Left'Address = Right'Address then
return Tree_Type'(others => <>); -- Empty set
end if;
if Left.Length = 0 then
return Tree_Type'(others => <>); -- Empty set
end if;
if Right.Length = 0 then
return Copy (Left);
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock_Left : With_Lock (Left.TC'Unrestricted_Access);
Lock_Right : With_Lock (Right.TC'Unrestricted_Access);
Tree : Tree_Type;
L_Node : Node_Access;
R_Node : Node_Access;
Dst_Node : Node_Access;
pragma Warnings (Off, Dst_Node);
begin
L_Node := Left.First;
R_Node := Right.First;
loop
if L_Node = null then
exit;
end if;
if R_Node = null then
while L_Node /= null loop
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => L_Node,
Dst_Node => Dst_Node);
L_Node := Tree_Operations.Next (L_Node);
end loop;
exit;
end if;
if Is_Less (L_Node, R_Node) then
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => L_Node,
Dst_Node => Dst_Node);
L_Node := Tree_Operations.Next (L_Node);
elsif Is_Less (R_Node, L_Node) then
R_Node := Tree_Operations.Next (R_Node);
else
L_Node := Tree_Operations.Next (L_Node);
R_Node := Tree_Operations.Next (R_Node);
end if;
end loop;
return Tree;
exception
when others =>
Delete_Tree (Tree.Root);
raise;
end;
end Difference;
------------------
-- Intersection --
------------------
procedure Intersection
(Target : in out Tree_Type;
Source : Tree_Type)
is
Tgt : Node_Access;
Src : Node_Access;
Compare : Integer;
begin
if Target'Address = Source'Address then
return;
end if;
TC_Check (Target.TC);
if Source.Length = 0 then
Clear (Target);
return;
end if;
Tgt := Target.First;
Src := Source.First;
while Tgt /= null
and then Src /= null
loop
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock_Target : With_Lock (Target.TC'Unrestricted_Access);
Lock_Source : With_Lock (Source.TC'Unrestricted_Access);
begin
if Is_Less (Tgt, Src) then
Compare := -1;
elsif Is_Less (Src, Tgt) then
Compare := 1;
else
Compare := 0;
end if;
end;
if Compare < 0 then
declare
X : Node_Access := Tgt;
begin
Tgt := Tree_Operations.Next (Tgt);
Tree_Operations.Delete_Node_Sans_Free (Target, X);
Free (X);
end;
elsif Compare > 0 then
Src := Tree_Operations.Next (Src);
else
Tgt := Tree_Operations.Next (Tgt);
Src := Tree_Operations.Next (Src);
end if;
end loop;
while Tgt /= null loop
declare
X : Node_Access := Tgt;
begin
Tgt := Tree_Operations.Next (Tgt);
Tree_Operations.Delete_Node_Sans_Free (Target, X);
Free (X);
end;
end loop;
end Intersection;
function Intersection (Left, Right : Tree_Type) return Tree_Type is
begin
if Left'Address = Right'Address then
return Copy (Left);
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock_Left : With_Lock (Left.TC'Unrestricted_Access);
Lock_Right : With_Lock (Right.TC'Unrestricted_Access);
Tree : Tree_Type;
L_Node : Node_Access;
R_Node : Node_Access;
Dst_Node : Node_Access;
pragma Warnings (Off, Dst_Node);
begin
L_Node := Left.First;
R_Node := Right.First;
loop
if L_Node = null then
exit;
end if;
if R_Node = null then
exit;
end if;
if Is_Less (L_Node, R_Node) then
L_Node := Tree_Operations.Next (L_Node);
elsif Is_Less (R_Node, L_Node) then
R_Node := Tree_Operations.Next (R_Node);
else
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => L_Node,
Dst_Node => Dst_Node);
L_Node := Tree_Operations.Next (L_Node);
R_Node := Tree_Operations.Next (R_Node);
end if;
end loop;
return Tree;
exception
when others =>
Delete_Tree (Tree.Root);
raise;
end;
end Intersection;
---------------
-- Is_Subset --
---------------
function Is_Subset
(Subset : Tree_Type;
Of_Set : Tree_Type) return Boolean
is
begin
if Subset'Address = Of_Set'Address then
return True;
end if;
if Subset.Length > Of_Set.Length then
return False;
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock_Subset : With_Lock (Subset.TC'Unrestricted_Access);
Lock_Of_Set : With_Lock (Of_Set.TC'Unrestricted_Access);
Subset_Node : Node_Access;
Set_Node : Node_Access;
begin
Subset_Node := Subset.First;
Set_Node := Of_Set.First;
loop
if Set_Node = null then
return Subset_Node = null;
end if;
if Subset_Node = null then
return True;
end if;
if Is_Less (Subset_Node, Set_Node) then
return False;
end if;
if Is_Less (Set_Node, Subset_Node) then
Set_Node := Tree_Operations.Next (Set_Node);
else
Set_Node := Tree_Operations.Next (Set_Node);
Subset_Node := Tree_Operations.Next (Subset_Node);
end if;
end loop;
end;
end Is_Subset;
-------------
-- Overlap --
-------------
function Overlap (Left, Right : Tree_Type) return Boolean is
begin
if Left'Address = Right'Address then
return Left.Length /= 0;
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock_Left : With_Lock (Left.TC'Unrestricted_Access);
Lock_Right : With_Lock (Right.TC'Unrestricted_Access);
L_Node : Node_Access;
R_Node : Node_Access;
begin
L_Node := Left.First;
R_Node := Right.First;
loop
if L_Node = null
or else R_Node = null
then
return False;
end if;
if Is_Less (L_Node, R_Node) then
L_Node := Tree_Operations.Next (L_Node);
elsif Is_Less (R_Node, L_Node) then
R_Node := Tree_Operations.Next (R_Node);
else
return True;
end if;
end loop;
end;
end Overlap;
--------------------------
-- Symmetric_Difference --
--------------------------
procedure Symmetric_Difference
(Target : in out Tree_Type;
Source : Tree_Type)
is
Tgt : Node_Access;
Src : Node_Access;
New_Tgt_Node : Node_Access;
pragma Warnings (Off, New_Tgt_Node);
Compare : Integer;
begin
if Target'Address = Source'Address then
Clear (Target);
return;
end if;
Tgt := Target.First;
Src := Source.First;
loop
if Tgt = null then
while Src /= null loop
Insert_With_Hint
(Dst_Tree => Target,
Dst_Hint => null,
Src_Node => Src,
Dst_Node => New_Tgt_Node);
Src := Tree_Operations.Next (Src);
end loop;
return;
end if;
if Src = null then
return;
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock_Target : With_Lock (Target.TC'Unrestricted_Access);
Lock_Source : With_Lock (Source.TC'Unrestricted_Access);
begin
if Is_Less (Tgt, Src) then
Compare := -1;
elsif Is_Less (Src, Tgt) then
Compare := 1;
else
Compare := 0;
end if;
end;
if Compare < 0 then
Tgt := Tree_Operations.Next (Tgt);
elsif Compare > 0 then
Insert_With_Hint
(Dst_Tree => Target,
Dst_Hint => Tgt,
Src_Node => Src,
Dst_Node => New_Tgt_Node);
Src := Tree_Operations.Next (Src);
else
declare
X : Node_Access := Tgt;
begin
Tgt := Tree_Operations.Next (Tgt);
Tree_Operations.Delete_Node_Sans_Free (Target, X);
Free (X);
end;
Src := Tree_Operations.Next (Src);
end if;
end loop;
end Symmetric_Difference;
function Symmetric_Difference (Left, Right : Tree_Type) return Tree_Type is
begin
if Left'Address = Right'Address then
return Tree_Type'(others => <>); -- Empty set
end if;
if Right.Length = 0 then
return Copy (Left);
end if;
if Left.Length = 0 then
return Copy (Right);
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock_Left : With_Lock (Left.TC'Unrestricted_Access);
Lock_Right : With_Lock (Right.TC'Unrestricted_Access);
Tree : Tree_Type;
L_Node : Node_Access;
R_Node : Node_Access;
Dst_Node : Node_Access;
pragma Warnings (Off, Dst_Node);
begin
L_Node := Left.First;
R_Node := Right.First;
loop
if L_Node = null then
while R_Node /= null loop
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => R_Node,
Dst_Node => Dst_Node);
R_Node := Tree_Operations.Next (R_Node);
end loop;
exit;
end if;
if R_Node = null then
while L_Node /= null loop
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => L_Node,
Dst_Node => Dst_Node);
L_Node := Tree_Operations.Next (L_Node);
end loop;
exit;
end if;
if Is_Less (L_Node, R_Node) then
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => L_Node,
Dst_Node => Dst_Node);
L_Node := Tree_Operations.Next (L_Node);
elsif Is_Less (R_Node, L_Node) then
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => R_Node,
Dst_Node => Dst_Node);
R_Node := Tree_Operations.Next (R_Node);
else
L_Node := Tree_Operations.Next (L_Node);
R_Node := Tree_Operations.Next (R_Node);
end if;
end loop;
return Tree;
exception
when others =>
Delete_Tree (Tree.Root);
raise;
end;
end Symmetric_Difference;
-----------
-- Union --
-----------
procedure Union (Target : in out Tree_Type; Source : Tree_Type) is
Hint : Node_Access;
procedure Process (Node : Node_Access);
pragma Inline (Process);
procedure Iterate is new Tree_Operations.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (Node : Node_Access) is
begin
Insert_With_Hint
(Dst_Tree => Target,
Dst_Hint => Hint, -- use node most recently inserted as hint
Src_Node => Node,
Dst_Node => Hint);
end Process;
-- Start of processing for Union
begin
if Target'Address = Source'Address then
return;
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock_Source : With_Lock (Source.TC'Unrestricted_Access);
begin
Iterate (Source);
end;
end Union;
function Union (Left, Right : Tree_Type) return Tree_Type is
begin
if Left'Address = Right'Address then
return Copy (Left);
end if;
if Left.Length = 0 then
return Copy (Right);
end if;
if Right.Length = 0 then
return Copy (Left);
end if;
declare
Lock_Left : With_Lock (Left.TC'Unrestricted_Access);
Lock_Right : With_Lock (Right.TC'Unrestricted_Access);
Tree : Tree_Type := Copy (Left);
Hint : Node_Access;
procedure Process (Node : Node_Access);
pragma Inline (Process);
procedure Iterate is
new Tree_Operations.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (Node : Node_Access) is
begin
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => Hint, -- use node most recently inserted as hint
Src_Node => Node,
Dst_Node => Hint);
end Process;
-- Start of processing for Union
begin
Iterate (Right);
return Tree;
exception
when others =>
Delete_Tree (Tree.Root);
raise;
end;
end Union;
end Ada.Containers.Red_Black_Trees.Generic_Set_Operations;
|
generic
type Color (<>) is private;
Screen_Width : Positive;
Screen_Height : Positive;
with function Color_Map (X, Y : Integer) return Color;
with function Height_Map (X, Y : Integer) return Integer;
with procedure Draw_Vertical_Line (X, Start_Y, Stop_Y : Integer; C : Color);
package Ada_Voxel is
procedure Render (Cam_X : Float;
Cam_Y : Float;
Cam_Angle : Float;
Cam_Height : Float;
Horizon : Float;
Distance : Float;
Scale_Height : Float);
end Ada_Voxel;
|
--------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, Luke A. Guest
--
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
--
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
--
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
-- Linux implementation.
--------------------------------------------------------------------------------------------------------------------
separate (SDL.Platform)
function Get return Platforms is
begin
return Linux;
end Get;
|
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Ada.Strings;
with Ada.Strings.Maps;
with Ada.Strings.Fixed;
with Ada.Wide_Text_IO; use Ada.Wide_Text_IO;
with Ada.Calendar;
with Ada.Calendar.Formatting;
with Ada.IO_Exceptions;
with Asis.Compilation_Units;
with Asis.Elements;
with Asis.Text;
with Asis.Extensions.Iterator;
with FP_Translation; use FP_Translation;
package body Unit_Processing is
procedure Recursive_Construct_Processing is new
Asis.Extensions.Iterator.Traverse_Unit
(State_Information => FP_Translation.Traversal_State,
Pre_Operation => FP_Translation.Pre_Op,
Post_Operation => FP_Translation.Post_Op);
------------------
-- Process_Unit --
------------------
procedure Process_Unit
(The_Unit : Asis.Compilation_Unit;
Trace : Boolean := False;
Output_Path : String)
is
Example_Element : Asis.Element := Asis.Elements.Unit_Declaration (The_Unit);
-- The top-level ctructural element of the library item or subunit
-- contained in The_Unit. Only needed as an example element from the
-- compilation unit so that we can obtain the span of the unit.
Unit_Span : Asis.Text.Span := Asis.Text.Compilation_Span(Example_Element);
-- Span is used to indicate a portion of the program text. Here we need
-- to span the whole text of the unit as that is the full scope of the translation.
Unit_Text_Name : String := To_String(Asis.Compilation_Units.Text_Name(The_Unit));
-- We assume that the text name is the full path of the .adb file
-- in which the unit is stored.
Last_Segment_Ix : Integer :=
Ada.Strings.Fixed.Index
(Source => Unit_Text_Name,
Set => Ada.Strings.Maps.To_Set("\\\\/"),
Going => Ada.Strings.Backward);
Output_File_Name : String :=
Output_Path &
Unit_Text_Name(Last_Segment_Ix..Unit_Text_Name'Last);
Process_Control : Asis.Traverse_Control := Asis.Continue;
Process_State : Traversal_State;
-- initialised later because it contains a file handle
begin
if Trace then
Put("Source text name: ");
Put(To_Wide_String(Unit_Text_Name));
New_Line;
end if;
-- Initialise the transversal state variable,
-- and open the appropriate output file:
Process_State.Span := Unit_Span;
Process_State.Trace := Trace;
declare
begin
Open(Process_State.Output_File, Out_File, Output_File_Name);
exception
when Ada.IO_Exceptions.Name_Error =>
Create(Process_State.Output_File, Out_File, Output_File_Name);
end;
if Trace then
Put("Target file name: ");
Put(To_Wide_String(Output_File_Name));
New_Line;
end if;
-- Write a header to the new file:
Put(Process_State.Output_File,
"-- This file has been modified by pp_fpops for floating-point verification.");
New_Line(Process_State.Output_File);
Put(Process_State.Output_File,
"-- pp_fpops is part of PolyPaver (https://github.com/michalkonecny/polypaver).");
New_Line(Process_State.Output_File);
Put(Process_State.Output_File,
"-- Generated on ");
Put(Process_State.Output_File,
To_Wide_String(Ada.Calendar.Formatting.Image(Ada.Calendar.Clock)));
Put(Process_State.Output_File,
" from the file:");
New_Line(Process_State.Output_File);
Put(Process_State.Output_File,
"-- ");
Put(Process_State.Output_File,
To_Wide_String(Unit_Text_Name));
New_Line(Process_State.Output_File);
Put(Process_State.Output_File,
"-- pp_fpops converted any floating-point operators to calls in the following packages:");
New_Line(Process_State.Output_File);
Put(Process_State.Output_File,
"with PP_SF_Rounded; with PP_F_Rounded; with PP_LF_Rounded;");
New_Line(Process_State.Output_File);
-- Put(Process_State.Output_File,
-- "--# inherit PP_SF_Rounded, PP_F_Rounded, PP_LF_Rounded;");
-- New_Line(Process_State.Output_File);
-- Recurse through the unit constructs.
-- When coming across an FP operator expression,
-- put all that precedes it and has not been printed yet,
-- and then put a translation of the FP operator expression.
Recursive_Construct_Processing
(Unit => The_Unit,
Control => Process_Control,
State => Process_State);
-- Put the remainder of the unit body.
-- If there are no FP operators in the body,
-- the span is the whole unit body text at the point
-- and the unit remains unchanged.
FP_Translation.Put_Current_Span(Example_Element, Process_State);
-- Close the output file:
Close(Process_State.Output_File);
end Process_Unit;
end Unit_Processing;
|
with Entities; use Entities;
with Vectors2D; use Vectors2D;
with Ada.Containers.Doubly_Linked_Lists;
with Links; use Links;
with Collisions; use Collisions;
package Worlds is
package EntsList is new Ada.Containers.Doubly_Linked_Lists(EntityClassAcc);
type EntsListAcc is access EntsList.List;
package LinksList is new Ada.Containers.Doubly_Linked_Lists(LinkAcc);
type LinksListAcc is access LinksList.List;
type SearchModes is (SM_Entity, SM_Environment, SM_All);
type StepModes is (Step_Normal, Step_LowRAM);
type EntCheckerAcc is access function(E : EntityClassAcc) return Boolean;
type World is tagged record
-- Access to accesses to the entities
Entities : EntsListAcc;
-- Access to accesses to the environments entities
Environments : EntsListAcc;
-- Access to accesses to the links
Links : LinksListAcc;
-- Access to collisions (note this is different from the 3 above)
Cols : ColsListAcc;
-- Entities.len + Environments.len + Links.len < MaxEntities
MaxEntities : Natural;
-- Timestep
dt : Float;
-- Inverse timestep
Invdt : Float;
-- Function called when World checks the validity of its entities
InvalidChecker : EntCheckerAcc;
-- Max speed of entities, 0.0 to disable on an axis
MaxSpeed : Vec2D := (0.0, 0.0);
-- Default static entity, useful for faking collisions
-- Its restitution is LinkTypesFactors(LTRope)
StaticEnt : EntityClassAcc := null;
end record;
pragma Pack (World);
-- init world
procedure Init(This : in out World; dt : in Float; MaxEnts : Natural := 32);
procedure Step(This : in out World; Mode : StepModes := Step_Normal);
-- clear the world (deep free)
procedure Free(This : in out World);
-- Add entity to the world
procedure AddEntity(This : in out World; Ent : not null EntityClassAcc);
-- Add env to the world
procedure AddEnvironment(This : in out World; Ent : not null EntityClassAcc);
-- Add a link between two entities (rope, spring...)
procedure LinkEntities(This : in out World; A, B : EntityClassAcc; LinkType : LinkTypes; Factor : Float := 0.0);
-- Remove all links tied to the passed entity
procedure UnlinkEntity(This : in out World; E : EntityClassAcc);
-- Increases the number of max entities by Count
procedure IncreaseMaxEntities(This : in out World; Count : Positive);
-- Gives the world a function to check if entities are valid or not
procedure SetInvalidChecker(This : in out World; Invalider : EntCheckerAcc);
-- Remove entity from the world
-- Entity is detroyed if Destroy is true
procedure RemoveEntity(This : in out World; Ent : EntityClassAcc; Destroy : Boolean);
-- Remove env from the world
-- Entity is detroyed if Destroy is true
procedure RemoveEnvironment(This : in out World; Ent : not null EntityClassAcc; Destroy : Boolean);
-- Returns the entity in which Pos is
-- If SearchMode = SM_All, searches first entities, then envs (ents are "on top")
function GetClosest(This : in out World; Pos : Vec2D; SearchMode : SearchModes := SM_All) return EntityClassAcc;
-- Get the list of entities
function GetEntities(This : in World) return EntsListAcc;
-- Get the list of envs
function GetEnvironments(This : in World) return EntsListAcc;
-- Get the list of links
function GetLinks(This : in World) return LinksListAcc;
-- Lets you set a maximum speed >= 0
-- If max speed = 0 -> no max speed on that axis
procedure SetMaxSpeed(This : in out World; Speed : Vec2D);
-- Remove invalid entities according to InvalidChecker, if not null
procedure CheckEntities(This : in out World);
end Worlds;
|
with IntList, Ada.Text_IO;
use Ada.Text_IO;
procedure Main is
List : IntList.T;
begin
for I in 1 .. 20 loop
IntList.Insert( List, I );
end loop;
for I in 1 .. 20 loop
if ( I mod 3 = 0 ) then
IntList.Remove( List, I );
end if;
end loop;
IntList.Print( List );
Put_Line("Done.");
end Main;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ W C H A R --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1997, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Val_Util; use System.Val_Util;
with System.WCh_Con; use System.WCh_Con;
with System.WCh_StW; use System.WCh_StW;
package body System.Val_WChar is
--------------------------
-- Value_Wide_Character --
--------------------------
function Value_Wide_Character
(Str : String;
EM : WC_Encoding_Method)
return Wide_Character
is
F : Natural;
L : Natural;
S : String (Str'Range) := Str;
begin
Normalize_String (S, F, L);
-- Character literal case
if S (F) = ''' and then S (L) = ''' then
-- If just three characters, simple character case
if L - F = 2 then
return Wide_Character'Val (Character'Pos (S (F + 1)));
-- Otherwise must be a wide character in quotes. The easiest
-- thing is to convert the string to a wide string and then
-- pick up the single character that it should contain.
else
declare
WS : constant Wide_String :=
String_To_Wide_String (S (F + 1 .. L - 1), EM);
begin
if WS'Length /= 1 then
raise Constraint_Error;
else
return WS (WS'First);
end if;
end;
end if;
-- the last two values of the type have language-defined names:
elsif S = "FFFE" then
return Wide_Character'Val (16#FFFE#);
elsif S = "FFFF" then
return Wide_Character'Val (16#FFFF#);
-- Otherwise must be a control character
else
for C in Character'Val (16#00#) .. Character'Val (16#1F#) loop
if S (F .. L) = Character'Image (C) then
return Wide_Character'Val (Character'Pos (C));
end if;
end loop;
for C in Character'Val (16#7F#) .. Character'Val (16#9F#) loop
if S (F .. L) = Character'Image (C) then
return Wide_Character'Val (Character'Pos (C));
end if;
end loop;
raise Constraint_Error;
end if;
end Value_Wide_Character;
end System.Val_WChar;
|
-- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
with File_Operations;
with Ada.Characters.Latin_1;
with Ada.Directories;
with Ada.Exceptions;
with Ada.Text_IO;
package body INI_File_Manager is
package EX renames Ada.Exceptions;
package LAT renames Ada.Characters.Latin_1;
package DIR renames Ada.Directories;
package TIO renames Ada.Text_IO;
package FOP renames File_Operations;
--------------------------------------------------------------------------------------------
-- scribe_file
--------------------------------------------------------------------------------------------
procedure scribe_file (directory, filename, first_comment : String)
is
package sorter is new string_crate.Generic_Sorting ("<" => HT.SU."<");
procedure write_section (section_name : HT.Text);
procedure write_section (position : string_crate.Cursor);
procedure save_section_name (position : list_crate.Cursor);
fullpath : String := directory & "/" & filename;
ini_file : TIO.File_Type;
sections : string_crate.Vector;
secitems : string_crate.Vector;
procedure write_section (section_name : HT.Text)
is
procedure write_item (position : string_crate.Cursor);
procedure save_item_name (position : nvpair_crate.Cursor);
section : String := HT.USS (section_name);
procedure write_item (position : string_crate.Cursor)
is
name : HT.Text renames string_crate.Element (position);
value : String := HT.USS (INI_sections.Element (section_name).list.Element (name));
begin
TIO.Put_Line (ini_file, HT.USS (name) & "= " & value);
end write_item;
procedure save_item_name (position : nvpair_crate.Cursor) is
begin
secitems.Append (nvpair_crate.Key (position));
end save_item_name;
begin
secitems.Clear;
INI_sections.Element (section_name).list.Iterate (save_item_name'Access);
sorter.Sort (Container => secitems);
TIO.Put_Line (ini_file, LAT.LF & LAT.Left_Square_Bracket & section &
LAT.Right_Square_Bracket);
secitems.Iterate (write_item'Access);
end write_section;
procedure save_section_name (position : list_crate.Cursor) is
begin
sections.Append (list_crate.Element (position).section);
end save_section_name;
procedure write_section (position : string_crate.Cursor)
is
section_name : HT.Text := string_crate.Element (position);
begin
write_section (section_name);
end write_section;
begin
INI_sections.Iterate (save_section_name'Access);
sorter.Sort (Container => sections);
FOP.mkdirp_from_filename (fullpath);
TIO.Create (File => ini_file,
Mode => TIO.Out_File,
Name => fullpath);
TIO.Put_Line (ini_file, "; " & first_comment);
TIO.Put_Line (ini_file, "; Take care when hand editing!");
sections.Iterate (write_section'Access);
TIO.Close (ini_file);
exception
when others =>
if TIO.Is_Open (ini_file) then
TIO.Close (ini_file);
end if;
raise file_operation_failed;
end scribe_file;
--------------------------------------------------------------------------------------------
-- Delete_Section
--------------------------------------------------------------------------------------------
procedure delete_section (section : String)
is
section_text : HT.Text := HT.SUS (section);
begin
if INI_sections.Contains (section_text) then
INI_sections.Delete (section_text);
end if;
end delete_section;
--------------------------------------------------------------------------------------------
-- delete_nv_pair
--------------------------------------------------------------------------------------------
procedure delete_nv_pair (section, name : String)
is
procedure delete_nvpair (Key : HT.Text; Element : in out group_list);
section_text : HT.Text := HT.SUS (section);
name_text : HT.Text := HT.SUS (name);
procedure delete_nvpair (Key : HT.Text; Element : in out group_list) is
begin
Element.list.Delete (name_text);
end delete_nvpair;
begin
if INI_sections.Contains (section_text) then
if INI_sections.Element (section_text).list.Contains (name_text) then
INI_sections.Update_Element (Position => INI_sections.Find (section_text),
Process => delete_nvpair'Access);
end if;
end if;
end delete_nv_pair;
--------------------------------------------------------------------------------------------
-- Insert_or_Update
--------------------------------------------------------------------------------------------
procedure insert_or_update (section, name, value : String)
is
procedure upsert (Key : HT.Text; Element : in out group_list);
procedure update (Key : HT.Text; Element : in out HT.Text);
section_text : HT.Text := HT.SUS (section);
name_text : HT.Text := HT.SUS (name);
value_text : HT.Text := HT.SUS (value);
initial_rec : group_list;
procedure update (Key : HT.Text; Element : in out HT.Text) is
begin
Element := value_text;
end update;
procedure upsert (Key : HT.Text; Element : in out group_list) is
begin
if Element.list.Contains (name_text) then
Element.list.Update_Element (Position => Element.list.Find (name_text),
Process => update'Access);
else
Element.list.Insert (name_text, value_text);
end if;
end upsert;
begin
if INI_sections.Contains (section_text) then
INI_sections.Update_Element (Position => INI_sections.Find (section_text),
Process => upsert'Access);
else
initial_rec.section := section_text;
initial_rec.index := 1;
initial_rec.list.Insert (name_text, value_text);
initial_rec.cursor := nvpair_crate.First (initial_rec.list);
INI_sections.Insert (section_text, initial_rec);
end if;
end insert_or_update;
--------------------------------------------------------------------------------------------
-- section_count
--------------------------------------------------------------------------------------------
function section_count return Natural is
begin
return Natural (INI_sections.Length);
end section_count;
--------------------------------------------------------------------------------------------
-- field_count
--------------------------------------------------------------------------------------------
function field_count (section : String) return Natural
is
section_text : HT.Text := HT.SUS (section);
begin
if INI_sections.Contains (section_text) then
return Natural (INI_sections.Element (section_text).list.Length);
else
return 0;
end if;
end field_count;
--------------------------------------------------------------------------------------------
-- section_reset
--------------------------------------------------------------------------------------------
procedure section_list_reset (section : String)
is
procedure reset_cursor (Key : HT.Text; Element : in out group_list);
section_text : HT.Text := HT.SUS (section);
first_position : nvpair_crate.Cursor;
procedure reset_cursor (Key : HT.Text; Element : in out group_list) is
begin
Element.cursor := first_position;
Element.index := 1;
end reset_cursor;
begin
if INI_sections.Contains (section_text) then
first_position := nvpair_crate.First (INI_sections.Element (section_text).list);
INI_sections.Update_Element (Position => INI_sections.Find (section_text),
Process => reset_cursor'Access);
end if;
end section_list_reset;
--------------------------------------------------------------------------------------------
-- show_name
--------------------------------------------------------------------------------------------
function show_name (section : String) return String
is
section_text : HT.Text := HT.SUS (section);
position : nvpair_crate.Cursor;
begin
if INI_sections.Contains (section_text) then
position := INI_sections.Element (section_text).cursor;
if nvpair_crate.Has_Element (position) then
return HT.USS (nvpair_crate.Element (position));
end if;
end if;
return "";
end show_name;
--------------------------------------------------------------------------------------------
-- show_value #1
--------------------------------------------------------------------------------------------
function show_value (section : String) return String
is
section_text : HT.Text := HT.SUS (section);
position : nvpair_crate.Cursor;
begin
if INI_sections.Contains (section_text) then
position := INI_sections.Element (section_text).cursor;
if nvpair_crate.Has_Element (position) then
return HT.USS (nvpair_crate.Key (position));
end if;
end if;
return "";
end show_value;
--------------------------------------------------------------------------------------------
-- show_value #2
--------------------------------------------------------------------------------------------
function show_value (section, name : String) return String
is
section_text : HT.Text := HT.SUS (section);
name_text : HT.Text := HT.SUS (name);
begin
if INI_sections.Contains (section_text) then
if INI_sections.Element (section_text).list.Contains (name_text) then
return HT.USS (INI_sections.Element (section_text).list.Element (name_text));
end if;
end if;
return "";
end show_value;
--------------------------------------------------------------------------------------------
-- advance_section_list
--------------------------------------------------------------------------------------------
function advance_section_list (section : String) return Boolean
is
procedure advance (Key : HT.Text; Element : in out group_list);
section_text : HT.Text := HT.SUS (section);
procedure advance (Key : HT.Text; Element : in out group_list) is
begin
nvpair_crate.Next (Element.cursor);
Element.index := Element.index + 1;
end advance;
begin
if INI_sections.Contains (section_text) then
if INI_sections.Element (section_text).index < field_count (section) then
INI_sections.Update_Element (Position => INI_sections.Find (section_text),
Process => advance'Access);
return True;
end if;
end if;
return False;
end advance_section_list;
--------------------------------------------------------------------------------------------
-- section_name
--------------------------------------------------------------------------------------------
function section_name (index : Positive) return String
is
position : list_crate.Cursor;
tracker : Positive := 1;
numsec : constant Natural := Natural (INI_sections.Length);
begin
if not INI_sections.Is_Empty and then
index <= numsec
then
position := list_crate.First (INI_sections);
loop
exit when tracker = index;
tracker := tracker + 1;
list_crate.Next (position);
end loop;
return HT.USS (list_crate.Element (position).section);
end if;
return "?";
end section_name;
--------------------------------------------------------------------------------------------
-- scan_file
--------------------------------------------------------------------------------------------
procedure scan_file (directory, filename : String)
is
procedure insert (Key : HT.Text; Element : in out group_list);
fullpath : String := directory & "/" & filename;
name_text : HT.Text;
value_text : HT.Text;
procedure insert (Key : HT.Text; Element : in out group_list) is
begin
Element.list.Insert (name_text, value_text);
end insert;
begin
if not DIR.Exists (fullpath) then
raise ini_file_nonexistent;
end if;
declare
contents : String := FOP.get_file_contents (fullpath);
markers : HT.Line_Markers;
last_section : HT.Text := HT.blank;
linenum : Natural := 0;
begin
INI_sections.Clear;
HT.initialize_markers (contents, markers);
loop
exit when not HT.next_line_present (contents, markers);
linenum := linenum + 1;
declare
line : constant String := HT.trim (HT.extract_line (contents, markers));
LN : constant String := "Line" & linenum'Img & ": ";
begin
if not (line = "") and then line (line'First) /= LAT.Semicolon then
if line (line'First) = LAT.Left_Square_Bracket then
if line (line'Last) = LAT.Right_Square_Bracket then
last_section := HT.SUS (HT.partial_search (line, 1, "]"));
if HT.SU.Length (last_section) /= line'Length - 2 then
raise bad_ini_format with LN & "heading contains ']'";
end if;
if INI_sections.Contains (last_section) then
raise bad_ini_format with LN & "duplicate heading found";
end if;
declare
initial_rec : group_list;
begin
initial_rec.section := last_section;
initial_rec.index := 0;
INI_sections.Insert (last_section, initial_rec);
end;
else
raise bad_ini_format with LN & "heading not terminated with ']'";
end if;
else
if not HT.contains (line, "=") then
raise bad_ini_format with LN & "missing '=', so not a name-value pair";
end if;
if HT.equivalent (last_section, HT.blank) then
raise bad_ini_format with LN & "name-value pair found before section set";
end if;
name_text := HT.SUS (HT.trim (HT.part_1 (line, "=")));
value_text := HT.SUS (HT.trim (HT.part_2 (line, "=")));
if INI_sections.Element (last_section).list.Contains (name_text) then
raise bad_ini_format with LN & "duplicate key '" & HT.USS (name_text)
& "' found in section '" & HT.USS (last_section) & "'";
else
INI_sections.Update_Element (Position => INI_sections.Find (last_section),
Process => insert'Access);
end if;
end if;
end if;
end;
end loop;
exception
when why : bad_ini_format =>
EX.Reraise_Occurrence (why);
when dunno : others =>
raise file_operation_failed with EX.Exception_Message (dunno);
end;
end scan_file;
--------------------------------------------------------------------------------------------
-- section_exists
--------------------------------------------------------------------------------------------
function section_exists (section : String) return Boolean
is
section_text : HT.Text := HT.SUS (section);
begin
return INI_sections.Contains (section_text);
end section_exists;
--------------------------------------------------------------------------------------------
-- clear_section_data
--------------------------------------------------------------------------------------------
procedure clear_section_data is
begin
INI_sections.Clear;
end clear_section_data;
end INI_File_Manager;
|
<?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_sum_loop_proc</name>
<ret_bitwidth>128</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></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>21</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_2">
<Value>
<Obj>
<type>0</type>
<id>2</id>
<name>x_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>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>30</item>
<item>31</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>3</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>32</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>5</id>
<name>sum_positive_0_loc_l</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sum_positive</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</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>6</id>
<name>sum_negative_0_loc_l</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sum_negative</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</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>7</id>
<name>i_0_i_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</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>8</id>
<name>tmp_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>31</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</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>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>31</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>53</item>
<item>55</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name></name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>31</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>31</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>56</item>
<item>57</item>
<item>58</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>tmp_1_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</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>60</item>
<item>61</item>
<item>62</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>tmp_2_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>tmp_3_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>66</item>
<item>67</item>
</oprand_edges>
<opcode>ddiv</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>sum_positive</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sum_positive</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>68</item>
<item>69</item>
</oprand_edges>
<opcode>dadd</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>tmp_5_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>33</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>33</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>70</item>
<item>72</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>18</id>
<name>tmp_6_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>33</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>33</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>73</item>
<item>74</item>
<item>75</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>tmp_7_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>33</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>33</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>tmp_8_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>33</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>33</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>78</item>
<item>79</item>
</oprand_edges>
<opcode>ddiv</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>sum_negative</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>33</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>33</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sum_negative</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>80</item>
<item>81</item>
</oprand_edges>
<opcode>dadd</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>31</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>31</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>82</item>
<item>84</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name></name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>31</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>31</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>85</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>mrv</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>34</item>
<item>35</item>
</oprand_edges>
<opcode>insertvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>mrv_1</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>37</item>
</oprand_edges>
<opcode>insertvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name></name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/hls_gui_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</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>38</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_23">
<Value>
<Obj>
<type>2</type>
<id>33</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>128</bitwidth>
</Value>
<const_type>4</const_type>
<content><Undef not integral></content>
</item>
<item class_id_reference="16" object_id="_24">
<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>64</bitwidth>
</Value>
<const_type>1</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_25">
<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>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_26">
<Value>
<Obj>
<type>2</type>
<id>54</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>21</content>
</item>
<item class_id_reference="16" object_id="_27">
<Value>
<Obj>
<type>2</type>
<id>59</id>
<name>power</name>
<fileName></fileName>
<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>6</const_type>
<content><constant:power></content>
</item>
<item class_id_reference="16" object_id="_28">
<Value>
<Obj>
<type>2</type>
<id>63</id>
<name>fact</name>
<fileName></fileName>
<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>6</const_type>
<content><constant:fact></content>
</item>
<item class_id_reference="16" object_id="_29">
<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>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_30">
<Value>
<Obj>
<type>2</type>
<id>83</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</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="_31">
<Obj>
<type>3</type>
<id>4</id>
<name>newFuncRoot</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_32">
<Obj>
<type>3</type>
<id>11</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>10</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_33">
<Obj>
<type>3</type>
<id>24</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>11</count>
<item_version>0</item_version>
<item>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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_34">
<Obj>
<type>3</type>
<id>28</id>
<name>sin_taylor_series_.exit2.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>3</count>
<item_version>0</item_version>
<item>25</item>
<item>26</item>
<item>27</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>51</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_35">
<id>31</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>2</sink_obj>
</item>
<item class_id_reference="20" object_id="_36">
<id>32</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>3</sink_obj>
</item>
<item class_id_reference="20" object_id="_37">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_38">
<id>35</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_39">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_40">
<id>37</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_41">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_42">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_43">
<id>41</id>
<edge_type>2</edge_type>
<source_obj>4</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_44">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_45">
<id>43</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>45</id>
<edge_type>2</edge_type>
<source_obj>4</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>47</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>50</id>
<edge_type>2</edge_type>
<source_obj>4</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>52</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>57</id>
<edge_type>2</edge_type>
<source_obj>28</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>58</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>85</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>96</id>
<edge_type>2</edge_type>
<source_obj>4</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>97</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>98</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>99</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>11</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="_86">
<mId>1</mId>
<mTag>Loop_sum_loop_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>1151</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_87">
<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>4</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="_88">
<mId>3</mId>
<mTag>sum_loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>11</item>
<item>24</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>5</mMinTripCount>
<mMaxTripCount>5</mMaxTripCount>
<mMinLatency>1150</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_89">
<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>28</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>21</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>2</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>3</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>5</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>8</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>13</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>2</first>
<second>30</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>33</first>
<second>4</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>30</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>33</first>
<second>4</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>37</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>
</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>4</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>37</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . R E D _ B L A C K _ T R E E S . --
-- G E N E R I C _ S E T _ O P E R A T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-2005, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- 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. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with System; use type System.Address;
package body Ada.Containers.Red_Black_Trees.Generic_Set_Operations is
-----------------------
-- Local Subprograms --
-----------------------
procedure Clear (Tree : in out Tree_Type);
function Copy (Source : Tree_Type) return Tree_Type;
-----------
-- Clear --
-----------
procedure Clear (Tree : in out Tree_Type) is
pragma Assert (Tree.Busy = 0);
pragma Assert (Tree.Lock = 0);
Root : Node_Access := Tree.Root;
begin
Tree.Root := null;
Tree.First := null;
Tree.Last := null;
Tree.Length := 0;
Delete_Tree (Root);
end Clear;
----------
-- Copy --
----------
function Copy (Source : Tree_Type) return Tree_Type is
Target : Tree_Type;
begin
if Source.Length = 0 then
return Target;
end if;
Target.Root := Copy_Tree (Source.Root);
Target.First := Tree_Operations.Min (Target.Root);
Target.Last := Tree_Operations.Max (Target.Root);
Target.Length := Source.Length;
return Target;
end Copy;
----------------
-- Difference --
----------------
procedure Difference (Target : in out Tree_Type; Source : Tree_Type) is
Tgt : Node_Access := Target.First;
Src : Node_Access := Source.First;
begin
if Target'Address = Source'Address then
if Target.Busy > 0 then
raise Program_Error with
"attempt to tamper with cursors (container is busy)";
end if;
Clear (Target);
return;
end if;
if Source.Length = 0 then
return;
end if;
if Target.Busy > 0 then
raise Program_Error with
"attempt to tamper with cursors (container is busy)";
end if;
loop
if Tgt = null then
return;
end if;
if Src = null then
return;
end if;
if Is_Less (Tgt, Src) then
Tgt := Tree_Operations.Next (Tgt);
elsif Is_Less (Src, Tgt) then
Src := Tree_Operations.Next (Src);
else
declare
X : Node_Access := Tgt;
begin
Tgt := Tree_Operations.Next (Tgt);
Tree_Operations.Delete_Node_Sans_Free (Target, X);
Free (X);
end;
Src := Tree_Operations.Next (Src);
end if;
end loop;
end Difference;
function Difference (Left, Right : Tree_Type) return Tree_Type is
Tree : Tree_Type;
L_Node : Node_Access := Left.First;
R_Node : Node_Access := Right.First;
Dst_Node : Node_Access;
begin
if Left'Address = Right'Address then
return Tree; -- Empty set
end if;
if Left.Length = 0 then
return Tree; -- Empty set
end if;
if Right.Length = 0 then
return Copy (Left);
end if;
loop
if L_Node = null then
return Tree;
end if;
if R_Node = null then
while L_Node /= null loop
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => L_Node,
Dst_Node => Dst_Node);
L_Node := Tree_Operations.Next (L_Node);
end loop;
return Tree;
end if;
if Is_Less (L_Node, R_Node) then
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => L_Node,
Dst_Node => Dst_Node);
L_Node := Tree_Operations.Next (L_Node);
elsif Is_Less (R_Node, L_Node) then
R_Node := Tree_Operations.Next (R_Node);
else
L_Node := Tree_Operations.Next (L_Node);
R_Node := Tree_Operations.Next (R_Node);
end if;
end loop;
exception
when others =>
Delete_Tree (Tree.Root);
raise;
end Difference;
------------------
-- Intersection --
------------------
procedure Intersection
(Target : in out Tree_Type;
Source : Tree_Type)
is
Tgt : Node_Access := Target.First;
Src : Node_Access := Source.First;
begin
if Target'Address = Source'Address then
return;
end if;
if Target.Busy > 0 then
raise Program_Error with
"attempt to tamper with cursors (container is busy)";
end if;
if Source.Length = 0 then
Clear (Target);
return;
end if;
while Tgt /= null
and then Src /= null
loop
if Is_Less (Tgt, Src) then
declare
X : Node_Access := Tgt;
begin
Tgt := Tree_Operations.Next (Tgt);
Tree_Operations.Delete_Node_Sans_Free (Target, X);
Free (X);
end;
elsif Is_Less (Src, Tgt) then
Src := Tree_Operations.Next (Src);
else
Tgt := Tree_Operations.Next (Tgt);
Src := Tree_Operations.Next (Src);
end if;
end loop;
while Tgt /= null loop
declare
X : Node_Access := Tgt;
begin
Tgt := Tree_Operations.Next (Tgt);
Tree_Operations.Delete_Node_Sans_Free (Target, X);
Free (X);
end;
end loop;
end Intersection;
function Intersection (Left, Right : Tree_Type) return Tree_Type is
Tree : Tree_Type;
L_Node : Node_Access := Left.First;
R_Node : Node_Access := Right.First;
Dst_Node : Node_Access;
begin
if Left'Address = Right'Address then
return Copy (Left);
end if;
loop
if L_Node = null then
return Tree;
end if;
if R_Node = null then
return Tree;
end if;
if Is_Less (L_Node, R_Node) then
L_Node := Tree_Operations.Next (L_Node);
elsif Is_Less (R_Node, L_Node) then
R_Node := Tree_Operations.Next (R_Node);
else
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => L_Node,
Dst_Node => Dst_Node);
L_Node := Tree_Operations.Next (L_Node);
R_Node := Tree_Operations.Next (R_Node);
end if;
end loop;
exception
when others =>
Delete_Tree (Tree.Root);
raise;
end Intersection;
---------------
-- Is_Subset --
---------------
function Is_Subset
(Subset : Tree_Type;
Of_Set : Tree_Type) return Boolean
is
begin
if Subset'Address = Of_Set'Address then
return True;
end if;
if Subset.Length > Of_Set.Length then
return False;
end if;
declare
Subset_Node : Node_Access := Subset.First;
Set_Node : Node_Access := Of_Set.First;
begin
loop
if Set_Node = null then
return Subset_Node = null;
end if;
if Subset_Node = null then
return True;
end if;
if Is_Less (Subset_Node, Set_Node) then
return False;
end if;
if Is_Less (Set_Node, Subset_Node) then
Set_Node := Tree_Operations.Next (Set_Node);
else
Set_Node := Tree_Operations.Next (Set_Node);
Subset_Node := Tree_Operations.Next (Subset_Node);
end if;
end loop;
end;
end Is_Subset;
-------------
-- Overlap --
-------------
function Overlap (Left, Right : Tree_Type) return Boolean is
L_Node : Node_Access := Left.First;
R_Node : Node_Access := Right.First;
begin
if Left'Address = Right'Address then
return Left.Length /= 0;
end if;
loop
if L_Node = null
or else R_Node = null
then
return False;
end if;
if Is_Less (L_Node, R_Node) then
L_Node := Tree_Operations.Next (L_Node);
elsif Is_Less (R_Node, L_Node) then
R_Node := Tree_Operations.Next (R_Node);
else
return True;
end if;
end loop;
end Overlap;
--------------------------
-- Symmetric_Difference --
--------------------------
procedure Symmetric_Difference
(Target : in out Tree_Type;
Source : Tree_Type)
is
Tgt : Node_Access := Target.First;
Src : Node_Access := Source.First;
New_Tgt_Node : Node_Access;
begin
if Target.Busy > 0 then
raise Program_Error with
"attempt to tamper with cursors (container is busy)";
end if;
if Target'Address = Source'Address then
Clear (Target);
return;
end if;
loop
if Tgt = null then
while Src /= null loop
Insert_With_Hint
(Dst_Tree => Target,
Dst_Hint => null,
Src_Node => Src,
Dst_Node => New_Tgt_Node);
Src := Tree_Operations.Next (Src);
end loop;
return;
end if;
if Src = null then
return;
end if;
if Is_Less (Tgt, Src) then
Tgt := Tree_Operations.Next (Tgt);
elsif Is_Less (Src, Tgt) then
Insert_With_Hint
(Dst_Tree => Target,
Dst_Hint => Tgt,
Src_Node => Src,
Dst_Node => New_Tgt_Node);
Src := Tree_Operations.Next (Src);
else
declare
X : Node_Access := Tgt;
begin
Tgt := Tree_Operations.Next (Tgt);
Tree_Operations.Delete_Node_Sans_Free (Target, X);
Free (X);
end;
Src := Tree_Operations.Next (Src);
end if;
end loop;
end Symmetric_Difference;
function Symmetric_Difference (Left, Right : Tree_Type) return Tree_Type is
Tree : Tree_Type;
L_Node : Node_Access := Left.First;
R_Node : Node_Access := Right.First;
Dst_Node : Node_Access;
begin
if Left'Address = Right'Address then
return Tree; -- Empty set
end if;
if Right.Length = 0 then
return Copy (Left);
end if;
if Left.Length = 0 then
return Copy (Right);
end if;
loop
if L_Node = null then
while R_Node /= null loop
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => R_Node,
Dst_Node => Dst_Node);
R_Node := Tree_Operations.Next (R_Node);
end loop;
return Tree;
end if;
if R_Node = null then
while L_Node /= null loop
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => L_Node,
Dst_Node => Dst_Node);
L_Node := Tree_Operations.Next (L_Node);
end loop;
return Tree;
end if;
if Is_Less (L_Node, R_Node) then
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => L_Node,
Dst_Node => Dst_Node);
L_Node := Tree_Operations.Next (L_Node);
elsif Is_Less (R_Node, L_Node) then
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => null,
Src_Node => R_Node,
Dst_Node => Dst_Node);
R_Node := Tree_Operations.Next (R_Node);
else
L_Node := Tree_Operations.Next (L_Node);
R_Node := Tree_Operations.Next (R_Node);
end if;
end loop;
exception
when others =>
Delete_Tree (Tree.Root);
raise;
end Symmetric_Difference;
-----------
-- Union --
-----------
procedure Union (Target : in out Tree_Type; Source : Tree_Type)
is
Hint : Node_Access;
procedure Process (Node : Node_Access);
pragma Inline (Process);
procedure Iterate is new Tree_Operations.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (Node : Node_Access) is
begin
Insert_With_Hint
(Dst_Tree => Target,
Dst_Hint => Hint,
Src_Node => Node,
Dst_Node => Hint);
end Process;
-- Start of processing for Union
begin
if Target'Address = Source'Address then
return;
end if;
if Target.Busy > 0 then
raise Program_Error with
"attempt to tamper with cursors (container is busy)";
end if;
Iterate (Source);
end Union;
function Union (Left, Right : Tree_Type) return Tree_Type is
begin
if Left'Address = Right'Address then
return Copy (Left);
end if;
if Left.Length = 0 then
return Copy (Right);
end if;
if Right.Length = 0 then
return Copy (Left);
end if;
declare
Tree : Tree_Type := Copy (Left);
Hint : Node_Access;
procedure Process (Node : Node_Access);
pragma Inline (Process);
procedure Iterate is
new Tree_Operations.Generic_Iteration (Process);
-------------
-- Process --
-------------
procedure Process (Node : Node_Access) is
begin
Insert_With_Hint
(Dst_Tree => Tree,
Dst_Hint => Hint,
Src_Node => Node,
Dst_Node => Hint);
end Process;
-- Start of processing for Union
begin
Iterate (Right);
return Tree;
exception
when others =>
Delete_Tree (Tree.Root);
raise;
end;
end Union;
end Ada.Containers.Red_Black_Trees.Generic_Set_Operations;
|
-- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with Interfaces.C;
package Glfw is
subtype Seconds is Interfaces.C.double;
subtype Size is Interfaces.C.int range 0 .. Interfaces.C.int'Last;
Initialization_Exception : exception;
Operation_Exception : exception;
-- for convenience, besides executing GLFW's init procedures, this also calls
-- GL.Init.
procedure Init;
-- because terminate is a keyword in Ada
procedure Shutdown;
procedure Version (Major, Minor, Rev : out Natural);
function Version_String return String;
function Time return Seconds;
procedure Set_Time (Value : Seconds);
function Extension_Supported (Name : String) return Boolean;
private
package C renames Interfaces.C;
type Bool is new Boolean;
for Bool use (False => 0, True => 1);
for Bool'Size use C.int'Size;
pragma Convention (C, Bool);
end Glfw;
|
-- The Beer-Ware License (revision 42)
--
-- Jacob Sparre Andersen <jacob@jacob-sparre.dk> wrote this. As long as you
-- retain this notice you can do whatever you want with this stuff. If we meet
-- some day, and you think this stuff is worth it, you can buy me a beer in
-- return.
--
-- Jacob Sparre Andersen
with
Interfaces.C.Strings;
package body Sound.Mono is
procedure Close (Line : in out Line_Type) is
use type Interfaces.C.int;
Error : Interfaces.C.int;
begin
Error := snd_pcm_close (Line);
if Error /= 0 then
raise Program_Error with "snd_pcm_close failed: " & Error'Img;
end if;
end Close;
function Is_Open (Line : in Line_Type) return Boolean is
use Sound.ALSA;
begin
case snd_pcm_state (Line) is
when Prepared | Running =>
return True;
when Open | Setup | XRun | Draining | Paused | Suspended
| Disconnected =>
return False;
end case;
end Is_Open;
procedure Open (Line : in out Line_Type;
Mode : in Line_Mode;
Resolution : in out Sample_Frequency;
Buffer_Size : in out Duration;
Period : in out Duration) is
use Interfaces.C, Interfaces.C.Strings, Sound.ALSA;
Name : aliased char_array := To_C ("plughw:0,0");
Error : Interfaces.C.int;
Local_Line : aliased Line_Type := Line;
Settings : aliased Sound.ALSA.snd_pcm_hw_params_t;
begin
Error := snd_pcm_open (pcmp => Local_Line'Access,
name => To_Chars_Ptr (Name'Unchecked_Access),
stream => Sound.ALSA.Value (Mode),
mode => 0);
if Error /= 0 then
raise Program_Error with "Error code (snd_pcm_open): " & Error'Img;
end if;
Clear_Settings :
begin
Error := snd_pcm_hw_params_any (pcm => Local_Line,
params => Settings'Access);
if Error /= 0 then
raise Program_Error with
"Error code (snd_pcm_hw_params_any): " & Error'Img;
end if;
end Clear_Settings;
Set_Resampling_Rate :
begin
Error := snd_pcm_hw_params_set_rate_resample
(pcm => Local_Line,
params => Settings'Access,
val => False);
if Error /= 0 then
raise Program_Error with
"Error code (snd_pcm_hw_params_set_rate_resample): " & Error'Img;
end if;
end Set_Resampling_Rate;
Set_Sampling_Layout :
begin
Error := snd_pcm_hw_params_set_access
(pcm => Local_Line,
params => Settings'Access,
val => Read_Write_Interleaved);
if Error /= 0 then
raise Program_Error with
"Error code (snd_pcm_hw_params_set_access): " & Error'Img;
end if;
end Set_Sampling_Layout;
Set_Recording_Format :
begin
Error := snd_pcm_hw_params_set_format
(pcm => Local_Line,
params => Settings'Access,
format => Sound.ALSA.Signed_16_Bit);
if Error /= 0 then
raise Program_Error with
"Error code (snd_pcm_hw_params_set_format): " & Error'Img;
end if;
end Set_Recording_Format;
Set_Channel_Count :
begin
Error := snd_pcm_hw_params_set_channels
(pcm => Local_Line,
params => Settings'Access,
val => 1);
if Error /= 0 then
raise Program_Error with
"Error code (snd_pcm_hw_params_set_channels): " & Error'Img;
end if;
end Set_Channel_Count;
Set_Sample_Frequency :
declare
Sample_Rate : aliased Interfaces.C.unsigned :=
Interfaces.C.unsigned (Resolution);
Approximation : aliased Sound.ALSA.Approximation_Direction := 0;
begin
Error := snd_pcm_hw_params_set_rate_near
(pcm => Local_Line,
params => Settings'Access,
val => Sample_Rate'Access,
dir => Approximation'Access);
if Error /= 0 then
raise Program_Error with
"Error code (snd_pcm_hw_params_set_rate_near): " & Error'Img;
end if;
Resolution := Sample_Frequency (Sample_Rate);
end Set_Sample_Frequency;
Set_Buffer_Time :
declare
Buffer_Time : aliased Interfaces.C.unsigned :=
Interfaces.C.unsigned (1_000_000 * Buffer_Size);
Approximation : aliased Sound.ALSA.Approximation_Direction := 0;
begin
Error := snd_pcm_hw_params_set_buffer_time_near
(pcm => Local_Line,
params => Settings'Access,
val => Buffer_Time'Access,
dir => Approximation'Access);
if Error /= 0 then
raise Program_Error with
"Error code (snd_pcm_hw_params_set_buffer_time_near): " &
Error'Img;
end if;
Buffer_Size := Duration (Buffer_Time) / 1_000_000.0;
end Set_Buffer_Time;
Set_Period :
declare
Period_Time : aliased Interfaces.C.unsigned :=
Interfaces.C.unsigned (1_000_000 * Period);
Approximation : aliased Sound.ALSA.Approximation_Direction := 0;
begin
Error := snd_pcm_hw_params_set_period_time_near
(pcm => Local_Line,
params => Settings'Access,
val => Period_Time'Access,
dir => Approximation'Access);
if Error /= 0 then
raise Program_Error with
"Error code (snd_pcm_hw_params_set_period_time_near): " &
Error'Img;
end if;
Period := Duration (Period_Time) / 1_000_000.0;
end Set_Period;
Register_Settings :
begin
Error := snd_pcm_hw_params (pcm => Local_Line,
params => Settings'Access);
if Error /= 0 then
raise Program_Error with
"Error code (snd_pcm_hw_params): " & Error'Img;
end if;
end Register_Settings;
Line := Local_Line;
end Open;
procedure Read (Line : in Line_Type;
Item : out Frame_Array;
Last : out Natural) is
pragma Unmodified (Item); -- As we cheat with "function snd_pcm_readi".
function snd_pcm_readi (pcm : in Line_Type;
buffer : in Frame_Array; -- actually "out"
size : in ALSA.snd_pcm_uframes_t)
return ALSA.snd_pcm_sframes_t;
pragma Import (C, snd_pcm_readi);
use type Sound.ALSA.snd_pcm_sframes_t;
Received_Frame_Count : Sound.ALSA.snd_pcm_sframes_t;
begin
Received_Frame_Count := snd_pcm_readi (pcm => Line,
buffer => Item,
size => Item'Length);
if Received_Frame_Count < 0 then
raise Program_Error with
"snd_pcm_readi failed: " & Received_Frame_Count'Img;
else
Last := Item'First - 1 + Natural (Received_Frame_Count);
end if;
end Read;
procedure Write (Line : in Line_Type;
Item : in Frame_Array;
Last : out Natural) is
function snd_pcm_writei (pcm : in Line_Type;
buffer : in Frame_Array;
size : in ALSA.snd_pcm_uframes_t)
return ALSA.snd_pcm_sframes_t;
pragma Import (C, snd_pcm_writei);
use type Sound.ALSA.snd_pcm_sframes_t;
Written_Frame_Count : Sound.ALSA.snd_pcm_sframes_t;
begin
Written_Frame_Count := snd_pcm_writei (pcm => Line,
buffer => Item,
size => Item'Length);
if Written_Frame_Count < 0 then
raise Program_Error with
"snd_pcm_writei failed: " & Written_Frame_Count'Img;
else
Last := Item'First - 1 + Natural (Written_Frame_Count);
end if;
end Write;
end Sound.Mono;
|
------------------------------------------------------------------------------
-- AGAR CORE LIBRARY --
-- A G A R --
-- S p e c --
------------------------------------------------------------------------------
package Agar is
pragma Pure (Agar);
end Agar;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces.C;
with xcb.xcb_client_message_data_t;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_client_message_data_iterator_t is
-- Item
--
type Item is record
data : access xcb.xcb_client_message_data_t.Item;
the_rem : aliased Interfaces.C.int;
index : aliased Interfaces.C.int;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_client_message_data_iterator_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_client_message_data_iterator_t.Item,
Element_Array => xcb.xcb_client_message_data_iterator_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_client_message_data_iterator_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_client_message_data_iterator_t.Pointer,
Element_Array => xcb.xcb_client_message_data_iterator_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_client_message_data_iterator_t;
|
-- This spec has been automatically generated from STM32L4x6.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.DMA is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- interrupt status register
type ISR_Register is record
-- Read-only. Channel x global interrupt flag (x = 1 ..7)
GIF1 : Boolean;
-- Read-only. Channel x transfer complete flag (x = 1 ..7)
TCIF1 : Boolean;
-- Read-only. Channel x half transfer flag (x = 1 ..7)
HTIF1 : Boolean;
-- Read-only. Channel x transfer error flag (x = 1 ..7)
TEIF1 : Boolean;
-- Read-only. Channel x global interrupt flag (x = 1 ..7)
GIF2 : Boolean;
-- Read-only. Channel x transfer complete flag (x = 1 ..7)
TCIF2 : Boolean;
-- Read-only. Channel x half transfer flag (x = 1 ..7)
HTIF2 : Boolean;
-- Read-only. Channel x transfer error flag (x = 1 ..7)
TEIF2 : Boolean;
-- Read-only. Channel x global interrupt flag (x = 1 ..7)
GIF3 : Boolean;
-- Read-only. Channel x transfer complete flag (x = 1 ..7)
TCIF3 : Boolean;
-- Read-only. Channel x half transfer flag (x = 1 ..7)
HTIF3 : Boolean;
-- Read-only. Channel x transfer error flag (x = 1 ..7)
TEIF3 : Boolean;
-- Read-only. Channel x global interrupt flag (x = 1 ..7)
GIF4 : Boolean;
-- Read-only. Channel x transfer complete flag (x = 1 ..7)
TCIF4 : Boolean;
-- Read-only. Channel x half transfer flag (x = 1 ..7)
HTIF4 : Boolean;
-- Read-only. Channel x transfer error flag (x = 1 ..7)
TEIF4 : Boolean;
-- Read-only. Channel x global interrupt flag (x = 1 ..7)
GIF5 : Boolean;
-- Read-only. Channel x transfer complete flag (x = 1 ..7)
TCIF5 : Boolean;
-- Read-only. Channel x half transfer flag (x = 1 ..7)
HTIF5 : Boolean;
-- Read-only. Channel x transfer error flag (x = 1 ..7)
TEIF5 : Boolean;
-- Read-only. Channel x global interrupt flag (x = 1 ..7)
GIF6 : Boolean;
-- Read-only. Channel x transfer complete flag (x = 1 ..7)
TCIF6 : Boolean;
-- Read-only. Channel x half transfer flag (x = 1 ..7)
HTIF6 : Boolean;
-- Read-only. Channel x transfer error flag (x = 1 ..7)
TEIF6 : Boolean;
-- Read-only. Channel x global interrupt flag (x = 1 ..7)
GIF7 : Boolean;
-- Read-only. Channel x transfer complete flag (x = 1 ..7)
TCIF7 : Boolean;
-- Read-only. Channel x half transfer flag (x = 1 ..7)
HTIF7 : Boolean;
-- Read-only. Channel x transfer error flag (x = 1 ..7)
TEIF7 : Boolean;
-- unspecified
Reserved_28_31 : HAL.UInt4;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
GIF1 at 0 range 0 .. 0;
TCIF1 at 0 range 1 .. 1;
HTIF1 at 0 range 2 .. 2;
TEIF1 at 0 range 3 .. 3;
GIF2 at 0 range 4 .. 4;
TCIF2 at 0 range 5 .. 5;
HTIF2 at 0 range 6 .. 6;
TEIF2 at 0 range 7 .. 7;
GIF3 at 0 range 8 .. 8;
TCIF3 at 0 range 9 .. 9;
HTIF3 at 0 range 10 .. 10;
TEIF3 at 0 range 11 .. 11;
GIF4 at 0 range 12 .. 12;
TCIF4 at 0 range 13 .. 13;
HTIF4 at 0 range 14 .. 14;
TEIF4 at 0 range 15 .. 15;
GIF5 at 0 range 16 .. 16;
TCIF5 at 0 range 17 .. 17;
HTIF5 at 0 range 18 .. 18;
TEIF5 at 0 range 19 .. 19;
GIF6 at 0 range 20 .. 20;
TCIF6 at 0 range 21 .. 21;
HTIF6 at 0 range 22 .. 22;
TEIF6 at 0 range 23 .. 23;
GIF7 at 0 range 24 .. 24;
TCIF7 at 0 range 25 .. 25;
HTIF7 at 0 range 26 .. 26;
TEIF7 at 0 range 27 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
-- interrupt flag clear register
type IFCR_Register is record
-- Write-only. Channel x global interrupt clear (x = 1 ..7)
CGIF1 : Boolean := False;
-- Write-only. Channel x transfer complete clear (x = 1 ..7)
CTCIF1 : Boolean := False;
-- Write-only. Channel x half transfer clear (x = 1 ..7)
CHTIF1 : Boolean := False;
-- Write-only. Channel x transfer error clear (x = 1 ..7)
CTEIF1 : Boolean := False;
-- Write-only. Channel x global interrupt clear (x = 1 ..7)
CGIF2 : Boolean := False;
-- Write-only. Channel x transfer complete clear (x = 1 ..7)
CTCIF2 : Boolean := False;
-- Write-only. Channel x half transfer clear (x = 1 ..7)
CHTIF2 : Boolean := False;
-- Write-only. Channel x transfer error clear (x = 1 ..7)
CTEIF2 : Boolean := False;
-- Write-only. Channel x global interrupt clear (x = 1 ..7)
CGIF3 : Boolean := False;
-- Write-only. Channel x transfer complete clear (x = 1 ..7)
CTCIF3 : Boolean := False;
-- Write-only. Channel x half transfer clear (x = 1 ..7)
CHTIF3 : Boolean := False;
-- Write-only. Channel x transfer error clear (x = 1 ..7)
CTEIF3 : Boolean := False;
-- Write-only. Channel x global interrupt clear (x = 1 ..7)
CGIF4 : Boolean := False;
-- Write-only. Channel x transfer complete clear (x = 1 ..7)
CTCIF4 : Boolean := False;
-- Write-only. Channel x half transfer clear (x = 1 ..7)
CHTIF4 : Boolean := False;
-- Write-only. Channel x transfer error clear (x = 1 ..7)
CTEIF4 : Boolean := False;
-- Write-only. Channel x global interrupt clear (x = 1 ..7)
CGIF5 : Boolean := False;
-- Write-only. Channel x transfer complete clear (x = 1 ..7)
CTCIF5 : Boolean := False;
-- Write-only. Channel x half transfer clear (x = 1 ..7)
CHTIF5 : Boolean := False;
-- Write-only. Channel x transfer error clear (x = 1 ..7)
CTEIF5 : Boolean := False;
-- Write-only. Channel x global interrupt clear (x = 1 ..7)
CGIF6 : Boolean := False;
-- Write-only. Channel x transfer complete clear (x = 1 ..7)
CTCIF6 : Boolean := False;
-- Write-only. Channel x half transfer clear (x = 1 ..7)
CHTIF6 : Boolean := False;
-- Write-only. Channel x transfer error clear (x = 1 ..7)
CTEIF6 : Boolean := False;
-- Write-only. Channel x global interrupt clear (x = 1 ..7)
CGIF7 : Boolean := False;
-- Write-only. Channel x transfer complete clear (x = 1 ..7)
CTCIF7 : Boolean := False;
-- Write-only. Channel x half transfer clear (x = 1 ..7)
CHTIF7 : Boolean := False;
-- Write-only. Channel x transfer error clear (x = 1 ..7)
CTEIF7 : Boolean := False;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IFCR_Register use record
CGIF1 at 0 range 0 .. 0;
CTCIF1 at 0 range 1 .. 1;
CHTIF1 at 0 range 2 .. 2;
CTEIF1 at 0 range 3 .. 3;
CGIF2 at 0 range 4 .. 4;
CTCIF2 at 0 range 5 .. 5;
CHTIF2 at 0 range 6 .. 6;
CTEIF2 at 0 range 7 .. 7;
CGIF3 at 0 range 8 .. 8;
CTCIF3 at 0 range 9 .. 9;
CHTIF3 at 0 range 10 .. 10;
CTEIF3 at 0 range 11 .. 11;
CGIF4 at 0 range 12 .. 12;
CTCIF4 at 0 range 13 .. 13;
CHTIF4 at 0 range 14 .. 14;
CTEIF4 at 0 range 15 .. 15;
CGIF5 at 0 range 16 .. 16;
CTCIF5 at 0 range 17 .. 17;
CHTIF5 at 0 range 18 .. 18;
CTEIF5 at 0 range 19 .. 19;
CGIF6 at 0 range 20 .. 20;
CTCIF6 at 0 range 21 .. 21;
CHTIF6 at 0 range 22 .. 22;
CTEIF6 at 0 range 23 .. 23;
CGIF7 at 0 range 24 .. 24;
CTCIF7 at 0 range 25 .. 25;
CHTIF7 at 0 range 26 .. 26;
CTEIF7 at 0 range 27 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype CCR_PSIZE_Field is HAL.UInt2;
subtype CCR_MSIZE_Field is HAL.UInt2;
subtype CCR_PL_Field is HAL.UInt2;
-- channel x configuration register
type CCR_Register is record
-- Channel enable
EN : Boolean := False;
-- Transfer complete interrupt enable
TCIE : Boolean := False;
-- Half transfer interrupt enable
HTIE : Boolean := False;
-- Transfer error interrupt enable
TEIE : Boolean := False;
-- Data transfer direction
DIR : Boolean := False;
-- Circular mode
CIRC : Boolean := False;
-- Peripheral increment mode
PINC : Boolean := False;
-- Memory increment mode
MINC : Boolean := False;
-- Peripheral size
PSIZE : CCR_PSIZE_Field := 16#0#;
-- Memory size
MSIZE : CCR_MSIZE_Field := 16#0#;
-- Channel priority level
PL : CCR_PL_Field := 16#0#;
-- Memory to memory mode
MEM2MEM : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR_Register use record
EN at 0 range 0 .. 0;
TCIE at 0 range 1 .. 1;
HTIE at 0 range 2 .. 2;
TEIE at 0 range 3 .. 3;
DIR at 0 range 4 .. 4;
CIRC at 0 range 5 .. 5;
PINC at 0 range 6 .. 6;
MINC at 0 range 7 .. 7;
PSIZE at 0 range 8 .. 9;
MSIZE at 0 range 10 .. 11;
PL at 0 range 12 .. 13;
MEM2MEM at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
subtype CNDTR_NDT_Field is HAL.UInt16;
-- channel x number of data register
type CNDTR_Register is record
-- Number of data to transfer
NDT : CNDTR_NDT_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNDTR_Register use record
NDT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CSELR_C1S_Field is HAL.UInt4;
subtype CSELR_C2S_Field is HAL.UInt4;
subtype CSELR_C3S_Field is HAL.UInt4;
subtype CSELR_C4S_Field is HAL.UInt4;
subtype CSELR_C5S_Field is HAL.UInt4;
subtype CSELR_C6S_Field is HAL.UInt4;
subtype CSELR_C7S_Field is HAL.UInt4;
-- channel selection register
type CSELR_Register is record
-- DMA channel 1 selection
C1S : CSELR_C1S_Field := 16#0#;
-- DMA channel 2 selection
C2S : CSELR_C2S_Field := 16#0#;
-- DMA channel 3 selection
C3S : CSELR_C3S_Field := 16#0#;
-- DMA channel 4 selection
C4S : CSELR_C4S_Field := 16#0#;
-- DMA channel 5 selection
C5S : CSELR_C5S_Field := 16#0#;
-- DMA channel 6 selection
C6S : CSELR_C6S_Field := 16#0#;
-- DMA channel 7 selection
C7S : CSELR_C7S_Field := 16#0#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CSELR_Register use record
C1S at 0 range 0 .. 3;
C2S at 0 range 4 .. 7;
C3S at 0 range 8 .. 11;
C4S at 0 range 12 .. 15;
C5S at 0 range 16 .. 19;
C6S at 0 range 20 .. 23;
C7S at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Direct memory access controller
type DMA_Peripheral is record
-- interrupt status register
ISR : aliased ISR_Register;
-- interrupt flag clear register
IFCR : aliased IFCR_Register;
-- channel x configuration register
CCR1 : aliased CCR_Register;
-- channel x number of data register
CNDTR1 : aliased CNDTR_Register;
-- channel x peripheral address register
CPAR1 : aliased HAL.UInt32;
-- channel x memory address register
CMAR1 : aliased HAL.UInt32;
-- channel x configuration register
CCR2 : aliased CCR_Register;
-- channel x number of data register
CNDTR2 : aliased CNDTR_Register;
-- channel x peripheral address register
CPAR2 : aliased HAL.UInt32;
-- channel x memory address register
CMAR2 : aliased HAL.UInt32;
-- channel x configuration register
CCR3 : aliased CCR_Register;
-- channel x number of data register
CNDTR3 : aliased CNDTR_Register;
-- channel x peripheral address register
CPAR3 : aliased HAL.UInt32;
-- channel x memory address register
CMAR3 : aliased HAL.UInt32;
-- channel x configuration register
CCR4 : aliased CCR_Register;
-- channel x number of data register
CNDTR4 : aliased CNDTR_Register;
-- channel x peripheral address register
CPAR4 : aliased HAL.UInt32;
-- channel x memory address register
CMAR4 : aliased HAL.UInt32;
-- channel x configuration register
CCR5 : aliased CCR_Register;
-- channel x number of data register
CNDTR5 : aliased CNDTR_Register;
-- channel x peripheral address register
CPAR5 : aliased HAL.UInt32;
-- channel x memory address register
CMAR5 : aliased HAL.UInt32;
-- channel x configuration register
CCR6 : aliased CCR_Register;
-- channel x number of data register
CNDTR6 : aliased CNDTR_Register;
-- channel x peripheral address register
CPAR6 : aliased HAL.UInt32;
-- channel x memory address register
CMAR6 : aliased HAL.UInt32;
-- channel x configuration register
CCR7 : aliased CCR_Register;
-- channel x number of data register
CNDTR7 : aliased CNDTR_Register;
-- channel x peripheral address register
CPAR7 : aliased HAL.UInt32;
-- channel x memory address register
CMAR7 : aliased HAL.UInt32;
-- channel selection register
CSELR : aliased CSELR_Register;
end record
with Volatile;
for DMA_Peripheral use record
ISR at 16#0# range 0 .. 31;
IFCR at 16#4# range 0 .. 31;
CCR1 at 16#8# range 0 .. 31;
CNDTR1 at 16#C# range 0 .. 31;
CPAR1 at 16#10# range 0 .. 31;
CMAR1 at 16#14# range 0 .. 31;
CCR2 at 16#1C# range 0 .. 31;
CNDTR2 at 16#20# range 0 .. 31;
CPAR2 at 16#24# range 0 .. 31;
CMAR2 at 16#28# range 0 .. 31;
CCR3 at 16#30# range 0 .. 31;
CNDTR3 at 16#34# range 0 .. 31;
CPAR3 at 16#38# range 0 .. 31;
CMAR3 at 16#3C# range 0 .. 31;
CCR4 at 16#44# range 0 .. 31;
CNDTR4 at 16#48# range 0 .. 31;
CPAR4 at 16#4C# range 0 .. 31;
CMAR4 at 16#50# range 0 .. 31;
CCR5 at 16#58# range 0 .. 31;
CNDTR5 at 16#5C# range 0 .. 31;
CPAR5 at 16#60# range 0 .. 31;
CMAR5 at 16#64# range 0 .. 31;
CCR6 at 16#6C# range 0 .. 31;
CNDTR6 at 16#70# range 0 .. 31;
CPAR6 at 16#74# range 0 .. 31;
CMAR6 at 16#78# range 0 .. 31;
CCR7 at 16#80# range 0 .. 31;
CNDTR7 at 16#84# range 0 .. 31;
CPAR7 at 16#88# range 0 .. 31;
CMAR7 at 16#8C# range 0 .. 31;
CSELR at 16#A8# range 0 .. 31;
end record;
-- Direct memory access controller
DMA1_Periph : aliased DMA_Peripheral
with Import, Address => System'To_Address (16#40020000#);
-- Direct memory access controller
DMA2_Periph : aliased DMA_Peripheral
with Import, Address => System'To_Address (16#40020400#);
end STM32_SVD.DMA;
|
--------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2018 Luke A. Guest
--
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
--
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
--
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
private with SDL.C_Pointers;
package body SDL.Inputs.Keyboards is
package C renames Interfaces.C;
function Get_Focus return SDL.Video.Windows.ID is
function SDL_Get_Window_ID (W : in SDL.C_Pointers.Windows_Pointer) return SDL.Video.Windows.ID with
Import => True,
Convention => C,
External_Name => "SDL_GetWindowID";
function SDL_Get_Keyboard_Focus return SDL.C_Pointers.Windows_Pointer with
Import => True,
Convention => C,
External_Name => "SDL_GetKeyboardFocus";
begin
return SDL_Get_Window_ID (SDL_Get_Keyboard_Focus);
end Get_Focus;
function Get_Modifiers return SDL.Events.Keyboards.Key_Modifiers is
function SDL_Get_Mod_State return SDL.Events.Keyboards.Key_Modifiers with
Import => True,
Convention => C,
External_Name => "SDL_GetModState";
begin
return SDL_Get_Mod_State;
end Get_Modifiers;
procedure Set_Modifiers (Modifiers : in SDL.Events.Keyboards.Key_Modifiers) is
procedure SDL_Set_Mod_State (Modifiers : in SDL.Events.Keyboards.Key_Modifiers) with
Import => True,
Convention => C,
External_Name => "SDL_SetModState";
begin
SDL_Set_Mod_State (Modifiers);
end Set_Modifiers;
function Supports_Screen_Keyboard return Boolean is
function SDL_Has_Screen_Keyboard_Support return SDL_Bool with
Import => True,
Convention => C,
External_Name => "SDL_HasScreenKeyboardSupport";
Result : SDL_Bool := SDL_Has_Screen_Keyboard_Support;
begin
if Result = SDL_True then
return True;
end if;
return False;
end Supports_Screen_Keyboard;
function Is_Screen_Keyboard_Visible (Window : in SDL.Video.Windows.Window) return Boolean is
function Get_Internal_Window (Self : in SDL.Video.Windows.Window) return SDL.C_Pointers.Windows_Pointer with
Convention => Ada,
Import => True;
function SDL_Screen_Keyboard_Shown (Window : in SDL.C_Pointers.Windows_Pointer) return SDL_Bool with
Import => True,
Convention => C,
External_Name => "SDL_IsScreenKeyboardShown";
Result : SDL_Bool := SDL_Screen_Keyboard_Shown (Get_Internal_Window (Window));
begin
if Result = SDL_True then
return True;
end if;
return False;
end Is_Screen_Keyboard_Visible;
function Is_Text_Input_Enabled return Boolean is
function SDL_Is_Text_Input_Active return SDL_Bool with
Import => True,
Convention => C,
External_Name => "SDL_IsTextInputActive";
Result : SDL_Bool := SDL_Is_Text_Input_Active;
begin
if Result = SDL_True then
return True;
end if;
return False;
end Is_Text_Input_Enabled;
procedure Set_Text_Input_Rectangle (Rectangle : in SDL.Video.Rectangles.Rectangle) is
procedure SDL_Set_Text_Input_Rect (Rectangle : in SDL.Video.Rectangles.Rectangle) with
Import => True,
Convention => C,
External_Name => "SDL_SetTextInputRect";
begin
SDL_Set_Text_Input_Rect (Rectangle);
end Set_Text_Input_Rectangle;
procedure Start_Text_Input is
procedure SDL_Start_Text_Input with
Import => True,
Convention => C,
External_Name => "SDL_StartTextInput";
begin
SDL_Start_Text_Input;
end Start_Text_Input;
procedure Stop_Text_Input is
procedure SDL_Stop_Text_Input with
Import => True,
Convention => C,
External_Name => "SDL_StopTextInput";
begin
SDL_Stop_Text_Input;
end Stop_Text_Input;
end SDL.Inputs.Keyboards;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . E X P I N T --
-- --
-- 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.Exp_Int is
-----------------
-- Exp_Integer --
-----------------
-- Note that negative exponents get a constraint error because the
-- subtype of the Right argument (the exponent) is Natural.
function Exp_Integer
(Left : Integer;
Right : Natural)
return Integer
is
Result : Integer := 1;
Factor : Integer := Left;
Exp : Natural := Right;
begin
-- We use the standard logarithmic approach, Exp gets shifted right
-- testing successive low order bits and Factor is the value of the
-- base raised to the next power of 2.
-- Note: it is not worth special casing base values -1, 0, +1 since
-- the expander does this when the base is a literal, and other cases
-- will be extremely rare.
if Exp /= 0 then
loop
if Exp rem 2 /= 0 then
declare
pragma Unsuppress (All_Checks);
begin
Result := Result * Factor;
end;
end if;
Exp := Exp / 2;
exit when Exp = 0;
declare
pragma Unsuppress (All_Checks);
begin
Factor := Factor * Factor;
end;
end loop;
end if;
return Result;
end Exp_Integer;
end System.Exp_Int;
|
with Ada.Unchecked_Conversion;
package Tkmrpc.Response.Cfg.Tkm_Reset.Convert is
function To_Response is new Ada.Unchecked_Conversion (
Source => Tkm_Reset.Response_Type,
Target => Response.Data_Type);
function From_Response is new Ada.Unchecked_Conversion (
Source => Response.Data_Type,
Target => Tkm_Reset.Response_Type);
end Tkmrpc.Response.Cfg.Tkm_Reset.Convert;
|
-- Generated by Snowball 2.2.0 - https://snowballstem.org/
package Stemmer.Catalan with SPARK_Mode is
type Context_Type is new Stemmer.Context_Type with private;
procedure Stem (Z : in out Context_Type; Result : out Boolean);
private
type Context_Type is new Stemmer.Context_Type with record
I_P2 : Integer;
I_P1 : Integer;
end record;
end Stemmer.Catalan;
|
-- This file is generated by SWIG. Please do *not* modify by hand.
--
with gmp_c.Pointers;
with gmp_c.a_a_gmp_randstate_struct;
with gmp_c.gmp_randstate_t;
with gmp_c.mp_ptr;
with gmp_c.mp_srcptr;
with gmp_c.mpf_ptr;
with gmp_c.mpf_srcptr;
with gmp_c.mpf_t;
with gmp_c.mpq_ptr;
with gmp_c.mpq_srcptr;
with gmp_c.mpz_ptr;
with gmp_c.mpz_srcptr;
with Interfaces.C;
with Interfaces.C.Strings;
with Swig;
with Swig.Pointers;
with Interfaces.C;
package gmp_c.Binding is
procedure randinit
(arg_3_1 : in gmp_c.gmp_randstate_t.Item;
arg_3_2 : in gmp_c.gmp_randalg_t);
procedure randinit_default (arg_1 : in gmp_c.gmp_randstate_t.Item);
procedure randinit_lc_2exp
(arg_4_1 : in gmp_c.gmp_randstate_t.Item;
arg_4_2 : in gmp_c.mpz_srcptr.Item;
arg_4_3 : in Interfaces.C.unsigned_long;
arg_4_4 : in gmp_c.mp_bitcnt_t);
function randinit_lc_2exp_size
(arg_2_1 : in gmp_c.gmp_randstate_t.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t) return Interfaces.C.int;
procedure randinit_mt (arg_1 : in gmp_c.gmp_randstate_t.Item);
procedure randinit_set
(arg_2_1 : in gmp_c.gmp_randstate_t.Item;
arg_2_2 : in gmp_c.a_a_gmp_randstate_struct.Pointer);
procedure randseed
(arg_2_1 : in gmp_c.gmp_randstate_t.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure randseed_ui
(arg_2_1 : in gmp_c.gmp_randstate_t.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure randclear (arg_1 : in gmp_c.gmp_randstate_t.Item);
function urandomb_ui
(arg_2_1 : in gmp_c.gmp_randstate_t.Item;
arg_2_2 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
function urandomm_ui
(arg_2_1 : in gmp_c.gmp_randstate_t.Item;
arg_2_2 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
function asprintf
(arg_3_1 : in Swig.Pointers.chars_ptr_Pointer;
arg_3_2 : in Interfaces.C.Strings.chars_ptr) return Interfaces.C.int;
function printf
(arg_2 : in Interfaces.C.Strings.chars_ptr) return Interfaces.C.int;
function snprintf
(arg_4_1 : in Interfaces.C.Strings.chars_ptr;
arg_4_2 : in Interfaces.C.size_t;
arg_4_3 : in Interfaces.C.Strings.chars_ptr) return Interfaces.C.int;
function sprintf
(arg_3_1 : in Interfaces.C.Strings.chars_ptr;
arg_3_2 : in Interfaces.C.Strings.chars_ptr) return Interfaces.C.int;
function scanf
(arg_2 : in Interfaces.C.Strings.chars_ptr) return Interfaces.C.int;
function sscanf
(arg_3_1 : in Interfaces.C.Strings.chars_ptr;
arg_3_2 : in Interfaces.C.Strings.chars_ptr) return Interfaces.C.int;
function realloc
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_size_t) return Swig.void_ptr;
procedure add
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure add_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure addmul
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure addmul_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure z_and
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure array_init
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mp_size_t;
arg_3_3 : in gmp_c.mp_size_t);
procedure bin_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure bin_uiui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure cdiv_q
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure cdiv_q_2exp
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
function cdiv_q_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
procedure cdiv_qr
(arg_4_1 : in gmp_c.mpz_ptr.Item;
arg_4_2 : in gmp_c.mpz_ptr.Item;
arg_4_3 : in gmp_c.mpz_srcptr.Item;
arg_4_4 : in gmp_c.mpz_srcptr.Item);
function cdiv_qr_ui
(arg_4_1 : in gmp_c.mpz_ptr.Item;
arg_4_2 : in gmp_c.mpz_ptr.Item;
arg_4_3 : in gmp_c.mpz_srcptr.Item;
arg_4_4 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
procedure cdiv_r
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure cdiv_r_2exp
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
function cdiv_r_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
function cdiv_ui
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
procedure clear (arg_1 : in gmp_c.mpz_ptr.Item);
procedure a_a_gmpz_clears (arg_2 : in gmp_c.mpz_ptr.Item);
procedure clrbit
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t);
function cmp
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function cmp_d
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.double) return Interfaces.C.int;
function a_a_gmpz_cmp_si
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.long) return Interfaces.C.int;
function a_a_gmpz_cmp_ui
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long) return Interfaces.C.int;
function cmpabs
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function cmpabs_d
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.double) return Interfaces.C.int;
function cmpabs_ui
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long) return Interfaces.C.int;
procedure com
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure combit
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t);
function congruent_p
(arg_3_1 : in gmp_c.mpz_srcptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function congruent_2exp_p
(arg_3_1 : in gmp_c.mpz_srcptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t) return Interfaces.C.int;
function congruent_ui_p
(arg_3_1 : in gmp_c.mpz_srcptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in Interfaces.C.unsigned_long) return Interfaces.C.int;
procedure divexact
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure divexact_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
function divisible_p
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function divisible_ui_p
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long) return Interfaces.C.int;
function divisible_2exp_p
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t) return Interfaces.C.int;
procedure dump (arg_1 : in gmp_c.mpz_srcptr.Item);
function z_export
(arg_7_1 : in Swig.void_ptr;
arg_7_2 : in Swig.Pointers.size_t_Pointer;
arg_7_3 : in Interfaces.C.int;
arg_7_4 : in Interfaces.C.size_t;
arg_7_5 : in Interfaces.C.int;
arg_7_6 : in Interfaces.C.size_t;
arg_7_7 : in gmp_c.mpz_srcptr.Item) return Swig.void_ptr;
procedure fac_ui
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure a_a_gmpz_2fac_ui
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure a_a_gmpz_mfac_uiui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure a_a_gmpz_primorial_ui
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure fdiv_q
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure fdiv_q_2exp
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
function fdiv_q_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
procedure fdiv_qr
(arg_4_1 : in gmp_c.mpz_ptr.Item;
arg_4_2 : in gmp_c.mpz_ptr.Item;
arg_4_3 : in gmp_c.mpz_srcptr.Item;
arg_4_4 : in gmp_c.mpz_srcptr.Item);
function fdiv_qr_ui
(arg_4_1 : in gmp_c.mpz_ptr.Item;
arg_4_2 : in gmp_c.mpz_ptr.Item;
arg_4_3 : in gmp_c.mpz_srcptr.Item;
arg_4_4 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
procedure fdiv_r
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure fdiv_r_2exp
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
function fdiv_r_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
function fdiv_ui
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
procedure fib_ui
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure fib2_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_ptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
function fits_sint_p
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function fits_slong_p
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function fits_sshort_p
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
procedure gcd
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
function gcd_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
procedure gcdext
(arg_5_1 : in gmp_c.mpz_ptr.Item;
arg_5_2 : in gmp_c.mpz_ptr.Item;
arg_5_3 : in gmp_c.mpz_ptr.Item;
arg_5_4 : in gmp_c.mpz_srcptr.Item;
arg_5_5 : in gmp_c.mpz_srcptr.Item);
function get_d
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.double;
function get_d_2exp
(arg_2_1 : in Swig.Pointers.long_Pointer;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.double;
function get_si (arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.long;
function get_str
(arg_3_1 : in Interfaces.C.Strings.chars_ptr;
arg_3_2 : in Interfaces.C.int;
arg_3_3 : in gmp_c.mpz_srcptr.Item)
return Interfaces.C.Strings.chars_ptr;
function hamdist
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return gmp_c.mp_bitcnt_t;
procedure import
(arg_7_1 : in gmp_c.mpz_ptr.Item;
arg_7_2 : in Interfaces.C.size_t;
arg_7_3 : in Interfaces.C.int;
arg_7_4 : in Interfaces.C.size_t;
arg_7_5 : in Interfaces.C.int;
arg_7_6 : in Interfaces.C.size_t;
arg_7_7 : in Swig.void_ptr);
procedure init (arg_1 : in gmp_c.mpz_ptr.Item);
procedure init2
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t);
procedure a_a_gmpz_inits (arg_2 : in gmp_c.mpz_ptr.Item);
procedure init_set
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure init_set_d
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.double);
procedure init_set_si
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.long);
function init_set_str
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int;
procedure init_set_ui
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
function invert
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
procedure ior
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
function jacobi
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function kronecker_si
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.long) return Interfaces.C.int;
function kronecker_ui
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long) return Interfaces.C.int;
function si_kronecker
(arg_2_1 : in Interfaces.C.long;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function ui_kronecker
(arg_2_1 : in Interfaces.C.unsigned_long;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
procedure lcm
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure lcm_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure lucnum_ui
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure lucnum2_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_ptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
function millerrabin
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.int) return Interfaces.C.int;
procedure the_mod
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure mul
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure mul_2exp
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure mul_si
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.long);
procedure mul_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure nextprime
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
function perfect_power_p
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
procedure pow_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure powm
(arg_4_1 : in gmp_c.mpz_ptr.Item;
arg_4_2 : in gmp_c.mpz_srcptr.Item;
arg_4_3 : in gmp_c.mpz_srcptr.Item;
arg_4_4 : in gmp_c.mpz_srcptr.Item);
procedure a_a_gmpz_powm_sec
(arg_4_1 : in gmp_c.mpz_ptr.Item;
arg_4_2 : in gmp_c.mpz_srcptr.Item;
arg_4_3 : in gmp_c.mpz_srcptr.Item;
arg_4_4 : in gmp_c.mpz_srcptr.Item);
procedure powm_ui
(arg_4_1 : in gmp_c.mpz_ptr.Item;
arg_4_2 : in gmp_c.mpz_srcptr.Item;
arg_4_3 : in Interfaces.C.unsigned_long;
arg_4_4 : in gmp_c.mpz_srcptr.Item);
function probab_prime_p
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.int) return Interfaces.C.int;
procedure random
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_size_t);
procedure random2
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_size_t);
procedure realloc2
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t);
function remove
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item) return gmp_c.mp_bitcnt_t;
function root
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long) return Interfaces.C.int;
procedure rootrem
(arg_4_1 : in gmp_c.mpz_ptr.Item;
arg_4_2 : in gmp_c.mpz_ptr.Item;
arg_4_3 : in gmp_c.mpz_srcptr.Item;
arg_4_4 : in Interfaces.C.unsigned_long);
procedure rrandomb
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.gmp_randstate_t.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
function scan0
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t) return gmp_c.mp_bitcnt_t;
function scan1
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t) return gmp_c.mp_bitcnt_t;
procedure set
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure set_d
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.double);
procedure set_f
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure set_si
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.long);
function set_str
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int;
procedure set_ui
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure setbit
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t);
function sizeinbase
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.int) return Interfaces.C.size_t;
procedure sqrt
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure sqrtrem
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_ptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure sub
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure sub_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure ui_sub
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure submul
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure submul_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure swap
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_ptr.Item);
function tdiv_ui
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
procedure tdiv_q
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure tdiv_q_2exp
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
function tdiv_q_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
procedure tdiv_qr
(arg_4_1 : in gmp_c.mpz_ptr.Item;
arg_4_2 : in gmp_c.mpz_ptr.Item;
arg_4_3 : in gmp_c.mpz_srcptr.Item;
arg_4_4 : in gmp_c.mpz_srcptr.Item);
function tdiv_qr_ui
(arg_4_1 : in gmp_c.mpz_ptr.Item;
arg_4_2 : in gmp_c.mpz_ptr.Item;
arg_4_3 : in gmp_c.mpz_srcptr.Item;
arg_4_4 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
procedure tdiv_r
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure tdiv_r_2exp
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
function tdiv_r_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long)
return Interfaces.C.unsigned_long;
function tstbit
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t) return Interfaces.C.int;
procedure ui_pow_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure urandomb
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.gmp_randstate_t.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure urandomm
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.gmp_randstate_t.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure z_xor
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure add
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item);
procedure canonicalize (arg_1 : in gmp_c.mpq_ptr.Item);
procedure clear (arg_1 : in gmp_c.mpq_ptr.Item);
procedure a_a_gmpq_clears (arg_2 : in gmp_c.mpq_ptr.Item);
function cmp
(arg_2_1 : in gmp_c.mpq_srcptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item) return Interfaces.C.int;
function a_a_gmpq_cmp_si
(arg_3_1 : in gmp_c.mpq_srcptr.Item;
arg_3_2 : in Interfaces.C.long;
arg_3_3 : in Interfaces.C.unsigned_long) return Interfaces.C.int;
function a_a_gmpq_cmp_ui
(arg_3_1 : in gmp_c.mpq_srcptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in Interfaces.C.unsigned_long) return Interfaces.C.int;
function a_a_gmpq_cmp_z
(arg_2_1 : in gmp_c.mpq_srcptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
procedure div
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item);
procedure div_2exp
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
function equal
(arg_2_1 : in gmp_c.mpq_srcptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item) return Interfaces.C.int;
procedure get_num
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item);
procedure get_den
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item);
function get_d
(arg_1 : in gmp_c.mpq_srcptr.Item) return Interfaces.C.double;
function get_str
(arg_3_1 : in Interfaces.C.Strings.chars_ptr;
arg_3_2 : in Interfaces.C.int;
arg_3_3 : in gmp_c.mpq_srcptr.Item)
return Interfaces.C.Strings.chars_ptr;
procedure init (arg_1 : in gmp_c.mpq_ptr.Item);
procedure a_a_gmpq_inits (arg_2 : in gmp_c.mpq_ptr.Item);
procedure inv
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item);
procedure mul
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item);
procedure mul_2exp
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure set
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item);
procedure set_d
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in Interfaces.C.double);
procedure set_den
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure set_f
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure set_num
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure set_si
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in Interfaces.C.long;
arg_3_3 : in Interfaces.C.unsigned_long);
function set_str
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int;
procedure set_ui
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure set_z
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure sub
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item);
procedure swap
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpq_ptr.Item);
procedure the_abs
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure add
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure add_ui
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure ceil
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure clear (arg_1 : in gmp_c.mpf_ptr.Item);
procedure a_a_gmpf_clears (arg_2 : in gmp_c.mpf_ptr.Item);
function cmp
(arg_2_1 : in gmp_c.mpf_srcptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function a_a_gmpf_cmp_z
(arg_2_1 : in gmp_c.mpf_srcptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function cmp_d
(arg_2_1 : in gmp_c.mpf_srcptr.Item;
arg_2_2 : in Interfaces.C.double) return Interfaces.C.int;
function cmp_si
(arg_2_1 : in gmp_c.mpf_srcptr.Item;
arg_2_2 : in Interfaces.C.long) return Interfaces.C.int;
function cmp_ui
(arg_2_1 : in gmp_c.mpf_srcptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long) return Interfaces.C.int;
procedure div
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure div_2exp
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure div_ui
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure dump (arg_1 : in gmp_c.mpf_srcptr.Item);
function eq
(arg_3_1 : in gmp_c.mpf_srcptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t) return Interfaces.C.int;
function fits_sint_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_slong_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_sshort_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_uint_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_ulong_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_ushort_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
procedure floor
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
function get_d
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.double;
function get_d_2exp
(arg_2_1 : in Swig.Pointers.long_Pointer;
arg_2_2 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.double;
function get_default_prec return gmp_c.mp_bitcnt_t;
function get_prec
(arg_1 : in gmp_c.mpf_srcptr.Item) return gmp_c.mp_bitcnt_t;
function get_si (arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.long;
function get_str
(arg_5_1 : in Interfaces.C.Strings.chars_ptr;
arg_5_2 : in gmp_c.Pointers.mp_exp_t_Pointer;
arg_5_3 : in Interfaces.C.int;
arg_5_4 : in Interfaces.C.size_t;
arg_5_5 : in gmp_c.mpf_srcptr.Item)
return Interfaces.C.Strings.chars_ptr;
function get_ui
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.unsigned_long;
procedure init (arg_1 : in gmp_c.mpf_ptr.Item);
procedure init2
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t);
procedure a_a_gmpf_inits (arg_2 : in gmp_c.mpf_ptr.Item);
procedure init_set
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure init_set_d
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.double);
procedure init_set_si
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.long);
function init_set_str
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int;
procedure init_set_ui
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
function integer_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
procedure mul
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure mul_2exp
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure mul_ui
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure neg
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure pow_ui
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure random2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mp_size_t;
arg_3_3 : in gmp_c.mp_exp_t);
procedure reldiff
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure set
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure set_d
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.double);
procedure set_default_prec (arg_1 : in gmp_c.mp_bitcnt_t);
procedure set_prec
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t);
procedure set_prec_raw
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t);
procedure set_q
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item);
procedure set_si
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.long);
function set_str
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int;
procedure set_ui
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure set_z
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
function size (arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.size_t;
procedure sqrt
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure sqrt_ui
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure sub
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure sub_ui
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure swap
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_ptr.Item);
procedure trunc
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure ui_div
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure ui_sub
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure urandomb
(arg_3_1 : in gmp_c.mpf_t.Item;
arg_3_2 : in gmp_c.gmp_randstate_t.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
function a_a_gmpn_add_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t) return gmp_c.mp_limb_t;
function a_a_gmpn_addmul_1
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_size_t;
arg_4_4 : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
procedure a_a_gmpn_divexact_1
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_size_t;
arg_4_4 : in gmp_c.mp_limb_t);
function a_a_gmpn_divexact_by3c
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_size_t;
arg_4_4 : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
function a_a_gmpn_divrem
(arg_6_1 : in gmp_c.mp_ptr.Item;
arg_6_2 : in gmp_c.mp_size_t;
arg_6_3 : in gmp_c.mp_ptr.Item;
arg_6_4 : in gmp_c.mp_size_t;
arg_6_5 : in gmp_c.mp_srcptr.Item;
arg_6_6 : in gmp_c.mp_size_t) return gmp_c.mp_limb_t;
function a_a_gmpn_divrem_1
(arg_5_1 : in gmp_c.mp_ptr.Item;
arg_5_2 : in gmp_c.mp_size_t;
arg_5_3 : in gmp_c.mp_srcptr.Item;
arg_5_4 : in gmp_c.mp_size_t;
arg_5_5 : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
function a_a_gmpn_divrem_2
(arg_5_1 : in gmp_c.mp_ptr.Item;
arg_5_2 : in gmp_c.mp_size_t;
arg_5_3 : in gmp_c.mp_ptr.Item;
arg_5_4 : in gmp_c.mp_size_t;
arg_5_5 : in gmp_c.mp_srcptr.Item) return gmp_c.mp_limb_t;
function a_a_gmpn_div_qr_2
(arg_5_1 : in gmp_c.mp_ptr.Item;
arg_5_2 : in gmp_c.mp_ptr.Item;
arg_5_3 : in gmp_c.mp_srcptr.Item;
arg_5_4 : in gmp_c.mp_size_t;
arg_5_5 : in gmp_c.mp_srcptr.Item) return gmp_c.mp_limb_t;
function a_a_gmpn_gcd
(arg_5_1 : in gmp_c.mp_ptr.Item;
arg_5_2 : in gmp_c.mp_ptr.Item;
arg_5_3 : in gmp_c.mp_size_t;
arg_5_4 : in gmp_c.mp_ptr.Item;
arg_5_5 : in gmp_c.mp_size_t) return gmp_c.mp_size_t;
function a_a_gmpn_gcd_1
(arg_3_1 : in gmp_c.mp_srcptr.Item;
arg_3_2 : in gmp_c.mp_size_t;
arg_3_3 : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
function a_a_gmpn_gcdext_1
(arg_4_1 : in gmp_c.Pointers.mp_limb_signed_t_Pointer;
arg_4_2 : in gmp_c.Pointers.mp_limb_signed_t_Pointer;
arg_4_3 : in gmp_c.mp_limb_t;
arg_4_4 : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
function a_a_gmpn_gcdext
(arg_7_1 : in gmp_c.mp_ptr.Item;
arg_7_2 : in gmp_c.mp_ptr.Item;
arg_7_3 : in gmp_c.Pointers.mp_size_t_Pointer;
arg_7_4 : in gmp_c.mp_ptr.Item;
arg_7_5 : in gmp_c.mp_size_t;
arg_7_6 : in gmp_c.mp_ptr.Item;
arg_7_7 : in gmp_c.mp_size_t) return gmp_c.mp_size_t;
function a_a_gmpn_get_str
(arg_4_1 : in Swig.Pointers.unsigned_char_Pointer;
arg_4_2 : in Interfaces.C.int;
arg_4_3 : in gmp_c.mp_ptr.Item;
arg_4_4 : in gmp_c.mp_size_t) return Interfaces.C.size_t;
function a_a_gmpn_hamdist
(arg_3_1 : in gmp_c.mp_srcptr.Item;
arg_3_2 : in gmp_c.mp_srcptr.Item;
arg_3_3 : in gmp_c.mp_size_t) return gmp_c.mp_bitcnt_t;
function a_a_gmpn_lshift
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_size_t;
arg_4_4 : in Interfaces.C.unsigned) return gmp_c.mp_limb_t;
function a_a_gmpn_mod_1
(arg_3_1 : in gmp_c.mp_srcptr.Item;
arg_3_2 : in gmp_c.mp_size_t;
arg_3_3 : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
function a_a_gmpn_mul
(arg_5_1 : in gmp_c.mp_ptr.Item;
arg_5_2 : in gmp_c.mp_srcptr.Item;
arg_5_3 : in gmp_c.mp_size_t;
arg_5_4 : in gmp_c.mp_srcptr.Item;
arg_5_5 : in gmp_c.mp_size_t) return gmp_c.mp_limb_t;
function a_a_gmpn_mul_1
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_size_t;
arg_4_4 : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
procedure a_a_gmpn_mul_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t);
procedure a_a_gmpn_sqr
(arg_3_1 : in gmp_c.mp_ptr.Item;
arg_3_2 : in gmp_c.mp_srcptr.Item;
arg_3_3 : in gmp_c.mp_size_t);
procedure a_a_gmpn_com
(arg_3_1 : in gmp_c.mp_ptr.Item;
arg_3_2 : in gmp_c.mp_srcptr.Item;
arg_3_3 : in gmp_c.mp_size_t);
function a_a_gmpn_perfect_square_p
(arg_2_1 : in gmp_c.mp_srcptr.Item;
arg_2_2 : in gmp_c.mp_size_t) return Interfaces.C.int;
function a_a_gmpn_perfect_power_p
(arg_2_1 : in gmp_c.mp_srcptr.Item;
arg_2_2 : in gmp_c.mp_size_t) return Interfaces.C.int;
function a_a_gmpn_popcount
(arg_2_1 : in gmp_c.mp_srcptr.Item;
arg_2_2 : in gmp_c.mp_size_t) return gmp_c.mp_bitcnt_t;
function a_a_gmpn_pow_1
(arg_5_1 : in gmp_c.mp_ptr.Item;
arg_5_2 : in gmp_c.mp_srcptr.Item;
arg_5_3 : in gmp_c.mp_size_t;
arg_5_4 : in gmp_c.mp_limb_t;
arg_5_5 : in gmp_c.mp_ptr.Item) return gmp_c.mp_size_t;
function a_a_gmpn_preinv_mod_1
(arg_4_1 : in gmp_c.mp_srcptr.Item;
arg_4_2 : in gmp_c.mp_size_t;
arg_4_3 : in gmp_c.mp_limb_t;
arg_4_4 : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
procedure a_a_gmpn_random
(arg_2_1 : in gmp_c.mp_ptr.Item;
arg_2_2 : in gmp_c.mp_size_t);
procedure a_a_gmpn_random2
(arg_2_1 : in gmp_c.mp_ptr.Item;
arg_2_2 : in gmp_c.mp_size_t);
function a_a_gmpn_rshift
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_size_t;
arg_4_4 : in Interfaces.C.unsigned) return gmp_c.mp_limb_t;
function a_a_gmpn_scan0
(arg_2_1 : in gmp_c.mp_srcptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t) return gmp_c.mp_bitcnt_t;
function a_a_gmpn_scan1
(arg_2_1 : in gmp_c.mp_srcptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t) return gmp_c.mp_bitcnt_t;
function a_a_gmpn_set_str
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in Swig.Pointers.unsigned_char_Pointer;
arg_4_3 : in Interfaces.C.size_t;
arg_4_4 : in Interfaces.C.int) return gmp_c.mp_size_t;
function a_a_gmpn_sqrtrem
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_ptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t) return gmp_c.mp_size_t;
function a_a_gmpn_sub_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t) return gmp_c.mp_limb_t;
function a_a_gmpn_submul_1
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_size_t;
arg_4_4 : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
procedure a_a_gmpn_tdiv_qr
(arg_7_1 : in gmp_c.mp_ptr.Item;
arg_7_2 : in gmp_c.mp_ptr.Item;
arg_7_3 : in gmp_c.mp_size_t;
arg_7_4 : in gmp_c.mp_srcptr.Item;
arg_7_5 : in gmp_c.mp_size_t;
arg_7_6 : in gmp_c.mp_srcptr.Item;
arg_7_7 : in gmp_c.mp_size_t);
procedure a_a_gmpn_and_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t);
procedure a_a_gmpn_andn_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t);
procedure a_a_gmpn_nand_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t);
procedure a_a_gmpn_ior_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t);
procedure a_a_gmpn_iorn_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t);
procedure a_a_gmpn_nior_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t);
procedure a_a_gmpn_xor_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t);
procedure a_a_gmpn_xnor_n
(arg_4_1 : in gmp_c.mp_ptr.Item;
arg_4_2 : in gmp_c.mp_srcptr.Item;
arg_4_3 : in gmp_c.mp_srcptr.Item;
arg_4_4 : in gmp_c.mp_size_t);
procedure a_a_gmpn_copyi
(arg_3_1 : in gmp_c.mp_ptr.Item;
arg_3_2 : in gmp_c.mp_srcptr.Item;
arg_3_3 : in gmp_c.mp_size_t);
procedure a_a_gmpn_copyd
(arg_3_1 : in gmp_c.mp_ptr.Item;
arg_3_2 : in gmp_c.mp_srcptr.Item;
arg_3_3 : in gmp_c.mp_size_t);
procedure a_a_gmpn_zero
(arg_2_1 : in gmp_c.mp_ptr.Item;
arg_2_2 : in gmp_c.mp_size_t);
procedure a_a_gmpn_cnd_swap
(arg_4_1 : in gmp_c.mp_limb_t;
arg_4_2 : in gmp_c.Pointers.mp_limb_t_Pointer;
arg_4_3 : in gmp_c.Pointers.mp_limb_t_Pointer;
arg_4_4 : in gmp_c.mp_size_t);
procedure the_abs
(a_a_gmp_w : in gmp_c.mpz_ptr.Item;
a_a_gmp_u : in gmp_c.mpz_srcptr.Item);
function fits_uint_p
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function fits_ulong_p
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function fits_ushort_p
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function get_ui
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.unsigned_long;
function getlimbn
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item;
a_a_gmp_n : in gmp_c.mp_size_t) return gmp_c.mp_limb_t;
procedure neg
(a_a_gmp_w : in gmp_c.mpz_ptr.Item;
a_a_gmp_u : in gmp_c.mpz_srcptr.Item);
function perfect_square_p
(a_a_gmp_a : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function popcount
(a_a_gmp_u : in gmp_c.mpz_srcptr.Item) return gmp_c.mp_bitcnt_t;
procedure set_q
(a_a_gmp_w : in gmp_c.mpz_ptr.Item;
a_a_gmp_u : in gmp_c.mpq_srcptr.Item);
function size
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.size_t;
procedure the_abs
(a_a_gmp_w : in gmp_c.mpq_ptr.Item;
a_a_gmp_u : in gmp_c.mpq_srcptr.Item);
procedure neg
(a_a_gmp_w : in gmp_c.mpq_ptr.Item;
a_a_gmp_u : in gmp_c.mpq_srcptr.Item);
function a_a_gmpn_add
(a_a_gmp_wp : in gmp_c.mp_ptr.Item;
a_a_gmp_xp : in gmp_c.mp_srcptr.Item;
a_a_gmp_xsize : in gmp_c.mp_size_t;
a_a_gmp_yp : in gmp_c.mp_srcptr.Item;
a_a_gmp_ysize : in gmp_c.mp_size_t) return gmp_c.mp_limb_t;
function a_a_gmpn_add_1
(a_a_gmp_dst : in gmp_c.mp_ptr.Item;
a_a_gmp_src : in gmp_c.mp_srcptr.Item;
a_a_gmp_size : in gmp_c.mp_size_t;
a_a_gmp_n : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
function a_a_gmpn_cmp
(a_a_gmp_xp : in gmp_c.mp_srcptr.Item;
a_a_gmp_yp : in gmp_c.mp_srcptr.Item;
a_a_gmp_size : in gmp_c.mp_size_t) return Interfaces.C.int;
function a_a_gmpn_zero_p
(a_a_gmp_p : in gmp_c.mp_srcptr.Item;
a_a_gmp_n : in gmp_c.mp_size_t) return Interfaces.C.int;
function a_a_gmpn_sub
(a_a_gmp_wp : in gmp_c.mp_ptr.Item;
a_a_gmp_xp : in gmp_c.mp_srcptr.Item;
a_a_gmp_xsize : in gmp_c.mp_size_t;
a_a_gmp_yp : in gmp_c.mp_srcptr.Item;
a_a_gmp_ysize : in gmp_c.mp_size_t) return gmp_c.mp_limb_t;
function a_a_gmpn_sub_1
(a_a_gmp_dst : in gmp_c.mp_ptr.Item;
a_a_gmp_src : in gmp_c.mp_srcptr.Item;
a_a_gmp_size : in gmp_c.mp_size_t;
a_a_gmp_n : in gmp_c.mp_limb_t) return gmp_c.mp_limb_t;
function a_a_gmpn_neg
(a_a_gmp_rp : in gmp_c.mp_ptr.Item;
a_a_gmp_up : in gmp_c.mp_srcptr.Item;
a_a_gmp_n : in gmp_c.mp_size_t) return gmp_c.mp_limb_t;
private
pragma Import (C, randinit, "Ada_randinit");
pragma Import (C, randinit_default, "Ada_randinit_default");
pragma Import (C, randinit_lc_2exp, "Ada_randinit_lc_2exp");
pragma Import (C, randinit_lc_2exp_size, "Ada_randinit_lc_2exp_size");
pragma Import (C, randinit_mt, "Ada_randinit_mt");
pragma Import (C, randinit_set, "Ada_randinit_set");
pragma Import (C, randseed, "Ada_randseed");
pragma Import (C, randseed_ui, "Ada_randseed_ui");
pragma Import (C, randclear, "Ada_randclear");
pragma Import (C, urandomb_ui, "Ada_urandomb_ui");
pragma Import (C, urandomm_ui, "Ada_urandomm_ui");
pragma Import (C, asprintf, "Ada_asprintf");
pragma Import (C, printf, "Ada_printf");
pragma Import (C, snprintf, "Ada_snprintf");
pragma Import (C, sprintf, "Ada_sprintf");
pragma Import (C, scanf, "Ada_scanf");
pragma Import (C, sscanf, "Ada_sscanf");
pragma Import (C, realloc, "Ada_realloc");
procedure add_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure add
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item) renames
add_v1;
pragma Import (C, add_v1, "Ada_add__SWIG_0");
procedure add_ui_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure add_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long) renames
add_ui_v1;
pragma Import (C, add_ui_v1, "Ada_add_ui__SWIG_0");
pragma Import (C, addmul, "Ada_addmul");
pragma Import (C, addmul_ui, "Ada_addmul_ui");
pragma Import (C, z_and, "Ada_z_and");
pragma Import (C, array_init, "Ada_array_init");
pragma Import (C, bin_ui, "Ada_bin_ui");
pragma Import (C, bin_uiui, "Ada_bin_uiui");
pragma Import (C, cdiv_q, "Ada_cdiv_q");
pragma Import (C, cdiv_q_2exp, "Ada_cdiv_q_2exp");
pragma Import (C, cdiv_q_ui, "Ada_cdiv_q_ui");
pragma Import (C, cdiv_qr, "Ada_cdiv_qr");
pragma Import (C, cdiv_qr_ui, "Ada_cdiv_qr_ui");
pragma Import (C, cdiv_r, "Ada_cdiv_r");
pragma Import (C, cdiv_r_2exp, "Ada_cdiv_r_2exp");
pragma Import (C, cdiv_r_ui, "Ada_cdiv_r_ui");
pragma Import (C, cdiv_ui, "Ada_cdiv_ui");
procedure clear_v1 (arg_1 : in gmp_c.mpz_ptr.Item);
procedure clear (arg_1 : in gmp_c.mpz_ptr.Item) renames clear_v1;
pragma Import (C, clear_v1, "Ada_clear__SWIG_0");
pragma Import (C, a_a_gmpz_clears, "Ada___gmpz_clears");
pragma Import (C, clrbit, "Ada_clrbit");
function cmp_v1
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function cmp
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int renames
cmp_v1;
pragma Import (C, cmp_v1, "Ada_cmp__SWIG_0");
function cmp_d_v1
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.double) return Interfaces.C.int;
function cmp_d
(arg_2_1 : in gmp_c.mpz_srcptr.Item;
arg_2_2 : in Interfaces.C.double) return Interfaces.C.int renames
cmp_d_v1;
pragma Import (C, cmp_d_v1, "Ada_cmp_d__SWIG_0");
pragma Import (C, a_a_gmpz_cmp_si, "Ada___gmpz_cmp_si");
pragma Import (C, a_a_gmpz_cmp_ui, "Ada___gmpz_cmp_ui");
pragma Import (C, cmpabs, "Ada_cmpabs");
pragma Import (C, cmpabs_d, "Ada_cmpabs_d");
pragma Import (C, cmpabs_ui, "Ada_cmpabs_ui");
pragma Import (C, com, "Ada_com");
pragma Import (C, combit, "Ada_combit");
pragma Import (C, congruent_p, "Ada_congruent_p");
pragma Import (C, congruent_2exp_p, "Ada_congruent_2exp_p");
pragma Import (C, congruent_ui_p, "Ada_congruent_ui_p");
pragma Import (C, divexact, "Ada_divexact");
pragma Import (C, divexact_ui, "Ada_divexact_ui");
pragma Import (C, divisible_p, "Ada_divisible_p");
pragma Import (C, divisible_ui_p, "Ada_divisible_ui_p");
pragma Import (C, divisible_2exp_p, "Ada_divisible_2exp_p");
procedure dump_v1 (arg_1 : in gmp_c.mpz_srcptr.Item);
procedure dump (arg_1 : in gmp_c.mpz_srcptr.Item) renames dump_v1;
pragma Import (C, dump_v1, "Ada_dump__SWIG_0");
pragma Import (C, z_export, "Ada_z_export");
pragma Import (C, fac_ui, "Ada_fac_ui");
pragma Import (C, a_a_gmpz_2fac_ui, "Ada___gmpz_2fac_ui");
pragma Import (C, a_a_gmpz_mfac_uiui, "Ada___gmpz_mfac_uiui");
pragma Import (C, a_a_gmpz_primorial_ui, "Ada___gmpz_primorial_ui");
pragma Import (C, fdiv_q, "Ada_fdiv_q");
pragma Import (C, fdiv_q_2exp, "Ada_fdiv_q_2exp");
pragma Import (C, fdiv_q_ui, "Ada_fdiv_q_ui");
pragma Import (C, fdiv_qr, "Ada_fdiv_qr");
pragma Import (C, fdiv_qr_ui, "Ada_fdiv_qr_ui");
pragma Import (C, fdiv_r, "Ada_fdiv_r");
pragma Import (C, fdiv_r_2exp, "Ada_fdiv_r_2exp");
pragma Import (C, fdiv_r_ui, "Ada_fdiv_r_ui");
pragma Import (C, fdiv_ui, "Ada_fdiv_ui");
pragma Import (C, fib_ui, "Ada_fib_ui");
pragma Import (C, fib2_ui, "Ada_fib2_ui");
function fits_sint_p_v1
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function fits_sint_p
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int renames
fits_sint_p_v1;
pragma Import (C, fits_sint_p_v1, "Ada_fits_sint_p__SWIG_0");
function fits_slong_p_v1
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function fits_slong_p
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int renames
fits_slong_p_v1;
pragma Import (C, fits_slong_p_v1, "Ada_fits_slong_p__SWIG_0");
function fits_sshort_p_v1
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function fits_sshort_p
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int renames
fits_sshort_p_v1;
pragma Import (C, fits_sshort_p_v1, "Ada_fits_sshort_p__SWIG_0");
pragma Import (C, gcd, "Ada_gcd");
pragma Import (C, gcd_ui, "Ada_gcd_ui");
pragma Import (C, gcdext, "Ada_gcdext");
function get_d_v1
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.double;
function get_d
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.double renames
get_d_v1;
pragma Import (C, get_d_v1, "Ada_get_d__SWIG_0");
function get_d_2exp_v1
(arg_2_1 : in Swig.Pointers.long_Pointer;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.double;
function get_d_2exp
(arg_2_1 : in Swig.Pointers.long_Pointer;
arg_2_2 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.double renames
get_d_2exp_v1;
pragma Import (C, get_d_2exp_v1, "Ada_get_d_2exp__SWIG_0");
function get_si_v1
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.long;
function get_si
(arg_1 : in gmp_c.mpz_srcptr.Item) return Interfaces.C.long renames
get_si_v1;
pragma Import (C, get_si_v1, "Ada_get_si__SWIG_0");
function get_str_v1
(arg_3_1 : in Interfaces.C.Strings.chars_ptr;
arg_3_2 : in Interfaces.C.int;
arg_3_3 : in gmp_c.mpz_srcptr.Item)
return Interfaces.C.Strings.chars_ptr;
function get_str
(arg_3_1 : in Interfaces.C.Strings.chars_ptr;
arg_3_2 : in Interfaces.C.int;
arg_3_3 : in gmp_c.mpz_srcptr.Item)
return Interfaces.C.Strings.chars_ptr renames
get_str_v1;
pragma Import (C, get_str_v1, "Ada_get_str__SWIG_0");
pragma Import (C, hamdist, "Ada_hamdist");
pragma Import (C, import, "Ada_import");
procedure init_v1 (arg_1 : in gmp_c.mpz_ptr.Item);
procedure init (arg_1 : in gmp_c.mpz_ptr.Item) renames init_v1;
pragma Import (C, init_v1, "Ada_init__SWIG_0");
procedure init2_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t);
procedure init2
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t) renames
init2_v1;
pragma Import (C, init2_v1, "Ada_init2__SWIG_0");
pragma Import (C, a_a_gmpz_inits, "Ada___gmpz_inits");
procedure init_set_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure init_set
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) renames
init_set_v1;
pragma Import (C, init_set_v1, "Ada_init_set__SWIG_0");
procedure init_set_d_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.double);
procedure init_set_d
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.double) renames
init_set_d_v1;
pragma Import (C, init_set_d_v1, "Ada_init_set_d__SWIG_0");
procedure init_set_si_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.long);
procedure init_set_si
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.long) renames
init_set_si_v1;
pragma Import (C, init_set_si_v1, "Ada_init_set_si__SWIG_0");
function init_set_str_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int;
function init_set_str
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int renames
init_set_str_v1;
pragma Import (C, init_set_str_v1, "Ada_init_set_str__SWIG_0");
procedure init_set_ui_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure init_set_ui
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long) renames
init_set_ui_v1;
pragma Import (C, init_set_ui_v1, "Ada_init_set_ui__SWIG_0");
pragma Import (C, invert, "Ada_invert");
pragma Import (C, ior, "Ada_ior");
pragma Import (C, jacobi, "Ada_jacobi");
pragma Import (C, kronecker_si, "Ada_kronecker_si");
pragma Import (C, kronecker_ui, "Ada_kronecker_ui");
pragma Import (C, si_kronecker, "Ada_si_kronecker");
pragma Import (C, ui_kronecker, "Ada_ui_kronecker");
pragma Import (C, lcm, "Ada_lcm");
pragma Import (C, lcm_ui, "Ada_lcm_ui");
pragma Import (C, lucnum_ui, "Ada_lucnum_ui");
pragma Import (C, lucnum2_ui, "Ada_lucnum2_ui");
pragma Import (C, millerrabin, "Ada_millerrabin");
pragma Import (C, the_mod, "Ada_mod");
procedure mul_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure mul
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item) renames
mul_v1;
pragma Import (C, mul_v1, "Ada_mul__SWIG_0");
procedure mul_2exp_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure mul_2exp
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t) renames
mul_2exp_v1;
pragma Import (C, mul_2exp_v1, "Ada_mul_2exp__SWIG_0");
pragma Import (C, mul_si, "Ada_mul_si");
procedure mul_ui_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure mul_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long) renames
mul_ui_v1;
pragma Import (C, mul_ui_v1, "Ada_mul_ui__SWIG_0");
pragma Import (C, nextprime, "Ada_nextprime");
pragma Import (C, perfect_power_p, "Ada_perfect_power_p");
procedure pow_ui_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure pow_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long) renames
pow_ui_v1;
pragma Import (C, pow_ui_v1, "Ada_pow_ui__SWIG_0");
pragma Import (C, powm, "Ada_powm");
pragma Import (C, a_a_gmpz_powm_sec, "Ada___gmpz_powm_sec");
pragma Import (C, powm_ui, "Ada_powm_ui");
pragma Import (C, probab_prime_p, "Ada_probab_prime_p");
pragma Import (C, random, "Ada_random");
procedure random2_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_size_t);
procedure random2
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mp_size_t) renames
random2_v1;
pragma Import (C, random2_v1, "Ada_random2__SWIG_0");
pragma Import (C, realloc2, "Ada_realloc2");
pragma Import (C, remove, "Ada_remove");
pragma Import (C, root, "Ada_root");
pragma Import (C, rootrem, "Ada_rootrem");
pragma Import (C, rrandomb, "Ada_rrandomb");
pragma Import (C, scan0, "Ada_scan0");
pragma Import (C, scan1, "Ada_scan1");
procedure set_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure set
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) renames
set_v1;
pragma Import (C, set_v1, "Ada_set__SWIG_0");
procedure set_d_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.double);
procedure set_d
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.double) renames
set_d_v1;
pragma Import (C, set_d_v1, "Ada_set_d__SWIG_0");
procedure set_f_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure set_f
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item) renames
set_f_v1;
pragma Import (C, set_f_v1, "Ada_set_f__SWIG_0");
procedure set_si_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.long);
procedure set_si
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.long) renames
set_si_v1;
pragma Import (C, set_si_v1, "Ada_set_si__SWIG_0");
function set_str_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int;
function set_str
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int renames
set_str_v1;
pragma Import (C, set_str_v1, "Ada_set_str__SWIG_0");
procedure set_ui_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure set_ui
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long) renames
set_ui_v1;
pragma Import (C, set_ui_v1, "Ada_set_ui__SWIG_0");
pragma Import (C, setbit, "Ada_setbit");
pragma Import (C, sizeinbase, "Ada_sizeinbase");
procedure sqrt_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure sqrt
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) renames
sqrt_v1;
pragma Import (C, sqrt_v1, "Ada_sqrt__SWIG_0");
pragma Import (C, sqrtrem, "Ada_sqrtrem");
procedure sub_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure sub
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in gmp_c.mpz_srcptr.Item) renames
sub_v1;
pragma Import (C, sub_v1, "Ada_sub__SWIG_0");
procedure sub_ui_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure sub_ui
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.mpz_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long) renames
sub_ui_v1;
pragma Import (C, sub_ui_v1, "Ada_sub_ui__SWIG_0");
procedure ui_sub_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in gmp_c.mpz_srcptr.Item);
procedure ui_sub
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in gmp_c.mpz_srcptr.Item) renames
ui_sub_v1;
pragma Import (C, ui_sub_v1, "Ada_ui_sub__SWIG_0");
pragma Import (C, submul, "Ada_submul");
pragma Import (C, submul_ui, "Ada_submul_ui");
procedure swap_v1
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_ptr.Item);
procedure swap
(arg_2_1 : in gmp_c.mpz_ptr.Item;
arg_2_2 : in gmp_c.mpz_ptr.Item) renames
swap_v1;
pragma Import (C, swap_v1, "Ada_swap__SWIG_0");
pragma Import (C, tdiv_ui, "Ada_tdiv_ui");
pragma Import (C, tdiv_q, "Ada_tdiv_q");
pragma Import (C, tdiv_q_2exp, "Ada_tdiv_q_2exp");
pragma Import (C, tdiv_q_ui, "Ada_tdiv_q_ui");
pragma Import (C, tdiv_qr, "Ada_tdiv_qr");
pragma Import (C, tdiv_qr_ui, "Ada_tdiv_qr_ui");
pragma Import (C, tdiv_r, "Ada_tdiv_r");
pragma Import (C, tdiv_r_2exp, "Ada_tdiv_r_2exp");
pragma Import (C, tdiv_r_ui, "Ada_tdiv_r_ui");
pragma Import (C, tstbit, "Ada_tstbit");
pragma Import (C, ui_pow_ui, "Ada_ui_pow_ui");
procedure urandomb_v1
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.gmp_randstate_t.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure urandomb
(arg_3_1 : in gmp_c.mpz_ptr.Item;
arg_3_2 : in gmp_c.gmp_randstate_t.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t) renames
urandomb_v1;
pragma Import (C, urandomb_v1, "Ada_urandomb__SWIG_0");
pragma Import (C, urandomm, "Ada_urandomm");
pragma Import (C, z_xor, "Ada_z_xor");
procedure add_v2
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item);
procedure add
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item) renames
add_v2;
pragma Import (C, add_v2, "Ada_add__SWIG_1");
pragma Import (C, canonicalize, "Ada_canonicalize");
procedure clear_v2 (arg_1 : in gmp_c.mpq_ptr.Item);
procedure clear (arg_1 : in gmp_c.mpq_ptr.Item) renames clear_v2;
pragma Import (C, clear_v2, "Ada_clear__SWIG_1");
pragma Import (C, a_a_gmpq_clears, "Ada___gmpq_clears");
function cmp_v2
(arg_2_1 : in gmp_c.mpq_srcptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item) return Interfaces.C.int;
function cmp
(arg_2_1 : in gmp_c.mpq_srcptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item) return Interfaces.C.int renames
cmp_v2;
pragma Import (C, cmp_v2, "Ada_cmp__SWIG_1");
pragma Import (C, a_a_gmpq_cmp_si, "Ada___gmpq_cmp_si");
pragma Import (C, a_a_gmpq_cmp_ui, "Ada___gmpq_cmp_ui");
pragma Import (C, a_a_gmpq_cmp_z, "Ada___gmpq_cmp_z");
procedure div_v1
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item);
procedure div
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item) renames
div_v1;
pragma Import (C, div_v1, "Ada_div__SWIG_0");
procedure div_2exp_v1
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure div_2exp
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t) renames
div_2exp_v1;
pragma Import (C, div_2exp_v1, "Ada_div_2exp__SWIG_0");
pragma Import (C, equal, "Ada_equal");
pragma Import (C, get_num, "Ada_get_num");
pragma Import (C, get_den, "Ada_get_den");
function get_d_v2
(arg_1 : in gmp_c.mpq_srcptr.Item) return Interfaces.C.double;
function get_d
(arg_1 : in gmp_c.mpq_srcptr.Item) return Interfaces.C.double renames
get_d_v2;
pragma Import (C, get_d_v2, "Ada_get_d__SWIG_1");
function get_str_v2
(arg_3_1 : in Interfaces.C.Strings.chars_ptr;
arg_3_2 : in Interfaces.C.int;
arg_3_3 : in gmp_c.mpq_srcptr.Item)
return Interfaces.C.Strings.chars_ptr;
function get_str
(arg_3_1 : in Interfaces.C.Strings.chars_ptr;
arg_3_2 : in Interfaces.C.int;
arg_3_3 : in gmp_c.mpq_srcptr.Item)
return Interfaces.C.Strings.chars_ptr renames
get_str_v2;
pragma Import (C, get_str_v2, "Ada_get_str__SWIG_1");
procedure init_v2 (arg_1 : in gmp_c.mpq_ptr.Item);
procedure init (arg_1 : in gmp_c.mpq_ptr.Item) renames init_v2;
pragma Import (C, init_v2, "Ada_init__SWIG_1");
pragma Import (C, a_a_gmpq_inits, "Ada___gmpq_inits");
pragma Import (C, inv, "Ada_inv");
procedure mul_v2
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item);
procedure mul
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item) renames
mul_v2;
pragma Import (C, mul_v2, "Ada_mul__SWIG_1");
procedure mul_2exp_v2
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure mul_2exp
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t) renames
mul_2exp_v2;
pragma Import (C, mul_2exp_v2, "Ada_mul_2exp__SWIG_1");
procedure set_v2
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item);
procedure set
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item) renames
set_v2;
pragma Import (C, set_v2, "Ada_set__SWIG_1");
procedure set_d_v2
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in Interfaces.C.double);
procedure set_d
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in Interfaces.C.double) renames
set_d_v2;
pragma Import (C, set_d_v2, "Ada_set_d__SWIG_1");
pragma Import (C, set_den, "Ada_set_den");
procedure set_f_v2
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure set_f
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item) renames
set_f_v2;
pragma Import (C, set_f_v2, "Ada_set_f__SWIG_1");
pragma Import (C, set_num, "Ada_set_num");
procedure set_si_v2
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in Interfaces.C.long;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure set_si
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in Interfaces.C.long;
arg_3_3 : in Interfaces.C.unsigned_long) renames
set_si_v2;
pragma Import (C, set_si_v2, "Ada_set_si__SWIG_1");
function set_str_v2
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int;
function set_str
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int renames
set_str_v2;
pragma Import (C, set_str_v2, "Ada_set_str__SWIG_1");
procedure set_ui_v2
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure set_ui
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in Interfaces.C.unsigned_long) renames
set_ui_v2;
pragma Import (C, set_ui_v2, "Ada_set_ui__SWIG_1");
procedure set_z_v1
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure set_z
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) renames
set_z_v1;
pragma Import (C, set_z_v1, "Ada_set_z__SWIG_0");
procedure sub_v2
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item);
procedure sub
(arg_3_1 : in gmp_c.mpq_ptr.Item;
arg_3_2 : in gmp_c.mpq_srcptr.Item;
arg_3_3 : in gmp_c.mpq_srcptr.Item) renames
sub_v2;
pragma Import (C, sub_v2, "Ada_sub__SWIG_1");
procedure swap_v2
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpq_ptr.Item);
procedure swap
(arg_2_1 : in gmp_c.mpq_ptr.Item;
arg_2_2 : in gmp_c.mpq_ptr.Item) renames
swap_v2;
pragma Import (C, swap_v2, "Ada_swap__SWIG_1");
procedure the_abs_v1
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure the_abs
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item) renames
the_abs_v1;
pragma Import (C, the_abs_v1, "Ada_abs__SWIG_0");
procedure add_v3
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure add
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item) renames
add_v3;
pragma Import (C, add_v3, "Ada_add__SWIG_2");
procedure add_ui_v2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure add_ui
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long) renames
add_ui_v2;
pragma Import (C, add_ui_v2, "Ada_add_ui__SWIG_1");
pragma Import (C, ceil, "Ada_ceil");
procedure clear_v3 (arg_1 : in gmp_c.mpf_ptr.Item);
procedure clear (arg_1 : in gmp_c.mpf_ptr.Item) renames clear_v3;
pragma Import (C, clear_v3, "Ada_clear__SWIG_2");
pragma Import (C, a_a_gmpf_clears, "Ada___gmpf_clears");
function cmp_v3
(arg_2_1 : in gmp_c.mpf_srcptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function cmp
(arg_2_1 : in gmp_c.mpf_srcptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int renames
cmp_v3;
pragma Import (C, cmp_v3, "Ada_cmp__SWIG_2");
pragma Import (C, a_a_gmpf_cmp_z, "Ada___gmpf_cmp_z");
function cmp_d_v2
(arg_2_1 : in gmp_c.mpf_srcptr.Item;
arg_2_2 : in Interfaces.C.double) return Interfaces.C.int;
function cmp_d
(arg_2_1 : in gmp_c.mpf_srcptr.Item;
arg_2_2 : in Interfaces.C.double) return Interfaces.C.int renames
cmp_d_v2;
pragma Import (C, cmp_d_v2, "Ada_cmp_d__SWIG_1");
pragma Import (C, cmp_si, "Ada_cmp_si");
pragma Import (C, cmp_ui, "Ada_cmp_ui");
procedure div_v2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure div
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item) renames
div_v2;
pragma Import (C, div_v2, "Ada_div__SWIG_1");
procedure div_2exp_v2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure div_2exp
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t) renames
div_2exp_v2;
pragma Import (C, div_2exp_v2, "Ada_div_2exp__SWIG_1");
pragma Import (C, div_ui, "Ada_div_ui");
procedure dump_v2 (arg_1 : in gmp_c.mpf_srcptr.Item);
procedure dump (arg_1 : in gmp_c.mpf_srcptr.Item) renames dump_v2;
pragma Import (C, dump_v2, "Ada_dump__SWIG_1");
pragma Import (C, eq, "Ada_eq");
function fits_sint_p_v2
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_sint_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int renames
fits_sint_p_v2;
pragma Import (C, fits_sint_p_v2, "Ada_fits_sint_p__SWIG_1");
function fits_slong_p_v2
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_slong_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int renames
fits_slong_p_v2;
pragma Import (C, fits_slong_p_v2, "Ada_fits_slong_p__SWIG_1");
function fits_sshort_p_v2
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_sshort_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int renames
fits_sshort_p_v2;
pragma Import (C, fits_sshort_p_v2, "Ada_fits_sshort_p__SWIG_1");
function fits_uint_p_v1
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_uint_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int renames
fits_uint_p_v1;
pragma Import (C, fits_uint_p_v1, "Ada_fits_uint_p__SWIG_0");
function fits_ulong_p_v1
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_ulong_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int renames
fits_ulong_p_v1;
pragma Import (C, fits_ulong_p_v1, "Ada_fits_ulong_p__SWIG_0");
function fits_ushort_p_v1
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int;
function fits_ushort_p
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.int renames
fits_ushort_p_v1;
pragma Import (C, fits_ushort_p_v1, "Ada_fits_ushort_p__SWIG_0");
pragma Import (C, floor, "Ada_floor");
function get_d_v3
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.double;
function get_d
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.double renames
get_d_v3;
pragma Import (C, get_d_v3, "Ada_get_d__SWIG_2");
function get_d_2exp_v2
(arg_2_1 : in Swig.Pointers.long_Pointer;
arg_2_2 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.double;
function get_d_2exp
(arg_2_1 : in Swig.Pointers.long_Pointer;
arg_2_2 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.double renames
get_d_2exp_v2;
pragma Import (C, get_d_2exp_v2, "Ada_get_d_2exp__SWIG_1");
pragma Import (C, get_default_prec, "Ada_get_default_prec");
pragma Import (C, get_prec, "Ada_get_prec");
function get_si_v2
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.long;
function get_si
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.long renames
get_si_v2;
pragma Import (C, get_si_v2, "Ada_get_si__SWIG_1");
function get_str_v3
(arg_5_1 : in Interfaces.C.Strings.chars_ptr;
arg_5_2 : in gmp_c.Pointers.mp_exp_t_Pointer;
arg_5_3 : in Interfaces.C.int;
arg_5_4 : in Interfaces.C.size_t;
arg_5_5 : in gmp_c.mpf_srcptr.Item)
return Interfaces.C.Strings.chars_ptr;
function get_str
(arg_5_1 : in Interfaces.C.Strings.chars_ptr;
arg_5_2 : in gmp_c.Pointers.mp_exp_t_Pointer;
arg_5_3 : in Interfaces.C.int;
arg_5_4 : in Interfaces.C.size_t;
arg_5_5 : in gmp_c.mpf_srcptr.Item)
return Interfaces.C.Strings.chars_ptr renames
get_str_v3;
pragma Import (C, get_str_v3, "Ada_get_str__SWIG_2");
function get_ui_v1
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.unsigned_long;
function get_ui
(arg_1 : in gmp_c.mpf_srcptr.Item)
return Interfaces.C.unsigned_long renames
get_ui_v1;
pragma Import (C, get_ui_v1, "Ada_get_ui__SWIG_0");
procedure init_v3 (arg_1 : in gmp_c.mpf_ptr.Item);
procedure init (arg_1 : in gmp_c.mpf_ptr.Item) renames init_v3;
pragma Import (C, init_v3, "Ada_init__SWIG_2");
procedure init2_v2
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t);
procedure init2
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mp_bitcnt_t) renames
init2_v2;
pragma Import (C, init2_v2, "Ada_init2__SWIG_1");
pragma Import (C, a_a_gmpf_inits, "Ada___gmpf_inits");
procedure init_set_v2
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure init_set
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item) renames
init_set_v2;
pragma Import (C, init_set_v2, "Ada_init_set__SWIG_1");
procedure init_set_d_v2
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.double);
procedure init_set_d
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.double) renames
init_set_d_v2;
pragma Import (C, init_set_d_v2, "Ada_init_set_d__SWIG_1");
procedure init_set_si_v2
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.long);
procedure init_set_si
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.long) renames
init_set_si_v2;
pragma Import (C, init_set_si_v2, "Ada_init_set_si__SWIG_1");
function init_set_str_v2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int;
function init_set_str
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int renames
init_set_str_v2;
pragma Import (C, init_set_str_v2, "Ada_init_set_str__SWIG_1");
procedure init_set_ui_v2
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure init_set_ui
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long) renames
init_set_ui_v2;
pragma Import (C, init_set_ui_v2, "Ada_init_set_ui__SWIG_1");
pragma Import (C, integer_p, "Ada_integer_p");
procedure mul_v3
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure mul
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item) renames
mul_v3;
pragma Import (C, mul_v3, "Ada_mul__SWIG_2");
procedure mul_2exp_v3
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure mul_2exp
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t) renames
mul_2exp_v3;
pragma Import (C, mul_2exp_v3, "Ada_mul_2exp__SWIG_2");
procedure mul_ui_v2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure mul_ui
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long) renames
mul_ui_v2;
pragma Import (C, mul_ui_v2, "Ada_mul_ui__SWIG_1");
procedure neg_v1
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure neg
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item) renames
neg_v1;
pragma Import (C, neg_v1, "Ada_neg__SWIG_0");
procedure pow_ui_v2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure pow_ui
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long) renames
pow_ui_v2;
pragma Import (C, pow_ui_v2, "Ada_pow_ui__SWIG_1");
procedure random2_v2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mp_size_t;
arg_3_3 : in gmp_c.mp_exp_t);
procedure random2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mp_size_t;
arg_3_3 : in gmp_c.mp_exp_t) renames
random2_v2;
pragma Import (C, random2_v2, "Ada_random2__SWIG_1");
pragma Import (C, reldiff, "Ada_reldiff");
procedure set_v3
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure set
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item) renames
set_v3;
pragma Import (C, set_v3, "Ada_set__SWIG_2");
procedure set_d_v3
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.double);
procedure set_d
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.double) renames
set_d_v3;
pragma Import (C, set_d_v3, "Ada_set_d__SWIG_2");
pragma Import (C, set_default_prec, "Ada_set_default_prec");
pragma Import (C, set_prec, "Ada_set_prec");
pragma Import (C, set_prec_raw, "Ada_set_prec_raw");
procedure set_q_v1
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item);
procedure set_q
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpq_srcptr.Item) renames
set_q_v1;
pragma Import (C, set_q_v1, "Ada_set_q__SWIG_0");
procedure set_si_v3
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.long);
procedure set_si
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.long) renames
set_si_v3;
pragma Import (C, set_si_v3, "Ada_set_si__SWIG_2");
function set_str_v3
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int;
function set_str
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in Interfaces.C.Strings.chars_ptr;
arg_3_3 : in Interfaces.C.int) return Interfaces.C.int renames
set_str_v3;
pragma Import (C, set_str_v3, "Ada_set_str__SWIG_2");
procedure set_ui_v3
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long);
procedure set_ui
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in Interfaces.C.unsigned_long) renames
set_ui_v3;
pragma Import (C, set_ui_v3, "Ada_set_ui__SWIG_2");
procedure set_z_v2
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item);
procedure set_z
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpz_srcptr.Item) renames
set_z_v2;
pragma Import (C, set_z_v2, "Ada_set_z__SWIG_1");
function size_v1
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.size_t;
function size
(arg_1 : in gmp_c.mpf_srcptr.Item) return Interfaces.C.size_t renames
size_v1;
pragma Import (C, size_v1, "Ada_size__SWIG_0");
procedure sqrt_v2
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item);
procedure sqrt
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_srcptr.Item) renames
sqrt_v2;
pragma Import (C, sqrt_v2, "Ada_sqrt__SWIG_1");
pragma Import (C, sqrt_ui, "Ada_sqrt_ui");
procedure sub_v3
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure sub
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in gmp_c.mpf_srcptr.Item) renames
sub_v3;
pragma Import (C, sub_v3, "Ada_sub__SWIG_2");
procedure sub_ui_v2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long);
procedure sub_ui
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in gmp_c.mpf_srcptr.Item;
arg_3_3 : in Interfaces.C.unsigned_long) renames
sub_ui_v2;
pragma Import (C, sub_ui_v2, "Ada_sub_ui__SWIG_1");
procedure swap_v3
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_ptr.Item);
procedure swap
(arg_2_1 : in gmp_c.mpf_ptr.Item;
arg_2_2 : in gmp_c.mpf_ptr.Item) renames
swap_v3;
pragma Import (C, swap_v3, "Ada_swap__SWIG_2");
pragma Import (C, trunc, "Ada_trunc");
pragma Import (C, ui_div, "Ada_ui_div");
procedure ui_sub_v2
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in gmp_c.mpf_srcptr.Item);
procedure ui_sub
(arg_3_1 : in gmp_c.mpf_ptr.Item;
arg_3_2 : in Interfaces.C.unsigned_long;
arg_3_3 : in gmp_c.mpf_srcptr.Item) renames
ui_sub_v2;
pragma Import (C, ui_sub_v2, "Ada_ui_sub__SWIG_1");
procedure urandomb_v2
(arg_3_1 : in gmp_c.mpf_t.Item;
arg_3_2 : in gmp_c.gmp_randstate_t.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t);
procedure urandomb
(arg_3_1 : in gmp_c.mpf_t.Item;
arg_3_2 : in gmp_c.gmp_randstate_t.Item;
arg_3_3 : in gmp_c.mp_bitcnt_t) renames
urandomb_v2;
pragma Import (C, urandomb_v2, "Ada_urandomb__SWIG_1");
pragma Import (C, a_a_gmpn_add_n, "Ada___gmpn_add_n");
pragma Import (C, a_a_gmpn_addmul_1, "Ada___gmpn_addmul_1");
pragma Import (C, a_a_gmpn_divexact_1, "Ada___gmpn_divexact_1");
pragma Import (C, a_a_gmpn_divexact_by3c, "Ada___gmpn_divexact_by3c");
pragma Import (C, a_a_gmpn_divrem, "Ada___gmpn_divrem");
pragma Import (C, a_a_gmpn_divrem_1, "Ada___gmpn_divrem_1");
pragma Import (C, a_a_gmpn_divrem_2, "Ada___gmpn_divrem_2");
pragma Import (C, a_a_gmpn_div_qr_2, "Ada___gmpn_div_qr_2");
pragma Import (C, a_a_gmpn_gcd, "Ada___gmpn_gcd");
pragma Import (C, a_a_gmpn_gcd_1, "Ada___gmpn_gcd_1");
pragma Import (C, a_a_gmpn_gcdext_1, "Ada___gmpn_gcdext_1");
pragma Import (C, a_a_gmpn_gcdext, "Ada___gmpn_gcdext");
pragma Import (C, a_a_gmpn_get_str, "Ada___gmpn_get_str");
pragma Import (C, a_a_gmpn_hamdist, "Ada___gmpn_hamdist");
pragma Import (C, a_a_gmpn_lshift, "Ada___gmpn_lshift");
pragma Import (C, a_a_gmpn_mod_1, "Ada___gmpn_mod_1");
pragma Import (C, a_a_gmpn_mul, "Ada___gmpn_mul");
pragma Import (C, a_a_gmpn_mul_1, "Ada___gmpn_mul_1");
pragma Import (C, a_a_gmpn_mul_n, "Ada___gmpn_mul_n");
pragma Import (C, a_a_gmpn_sqr, "Ada___gmpn_sqr");
pragma Import (C, a_a_gmpn_com, "Ada___gmpn_com");
pragma Import (C, a_a_gmpn_perfect_square_p, "Ada___gmpn_perfect_square_p");
pragma Import (C, a_a_gmpn_perfect_power_p, "Ada___gmpn_perfect_power_p");
pragma Import (C, a_a_gmpn_popcount, "Ada___gmpn_popcount");
pragma Import (C, a_a_gmpn_pow_1, "Ada___gmpn_pow_1");
pragma Import (C, a_a_gmpn_preinv_mod_1, "Ada___gmpn_preinv_mod_1");
pragma Import (C, a_a_gmpn_random, "Ada___gmpn_random");
pragma Import (C, a_a_gmpn_random2, "Ada___gmpn_random2");
pragma Import (C, a_a_gmpn_rshift, "Ada___gmpn_rshift");
pragma Import (C, a_a_gmpn_scan0, "Ada___gmpn_scan0");
pragma Import (C, a_a_gmpn_scan1, "Ada___gmpn_scan1");
pragma Import (C, a_a_gmpn_set_str, "Ada___gmpn_set_str");
pragma Import (C, a_a_gmpn_sqrtrem, "Ada___gmpn_sqrtrem");
pragma Import (C, a_a_gmpn_sub_n, "Ada___gmpn_sub_n");
pragma Import (C, a_a_gmpn_submul_1, "Ada___gmpn_submul_1");
pragma Import (C, a_a_gmpn_tdiv_qr, "Ada___gmpn_tdiv_qr");
pragma Import (C, a_a_gmpn_and_n, "Ada___gmpn_and_n");
pragma Import (C, a_a_gmpn_andn_n, "Ada___gmpn_andn_n");
pragma Import (C, a_a_gmpn_nand_n, "Ada___gmpn_nand_n");
pragma Import (C, a_a_gmpn_ior_n, "Ada___gmpn_ior_n");
pragma Import (C, a_a_gmpn_iorn_n, "Ada___gmpn_iorn_n");
pragma Import (C, a_a_gmpn_nior_n, "Ada___gmpn_nior_n");
pragma Import (C, a_a_gmpn_xor_n, "Ada___gmpn_xor_n");
pragma Import (C, a_a_gmpn_xnor_n, "Ada___gmpn_xnor_n");
pragma Import (C, a_a_gmpn_copyi, "Ada___gmpn_copyi");
pragma Import (C, a_a_gmpn_copyd, "Ada___gmpn_copyd");
pragma Import (C, a_a_gmpn_zero, "Ada___gmpn_zero");
pragma Import (C, a_a_gmpn_cnd_swap, "Ada___gmpn_cnd_swap");
procedure the_abs_v2
(a_a_gmp_w : in gmp_c.mpz_ptr.Item;
a_a_gmp_u : in gmp_c.mpz_srcptr.Item);
procedure the_abs
(a_a_gmp_w : in gmp_c.mpz_ptr.Item;
a_a_gmp_u : in gmp_c.mpz_srcptr.Item) renames
the_abs_v2;
pragma Import (C, the_abs_v2, "Ada_abs__SWIG_1");
function fits_uint_p_v2
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function fits_uint_p
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int renames
fits_uint_p_v2;
pragma Import (C, fits_uint_p_v2, "Ada_fits_uint_p__SWIG_1");
function fits_ulong_p_v2
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function fits_ulong_p
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int renames
fits_ulong_p_v2;
pragma Import (C, fits_ulong_p_v2, "Ada_fits_ulong_p__SWIG_1");
function fits_ushort_p_v2
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int;
function fits_ushort_p
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.int renames
fits_ushort_p_v2;
pragma Import (C, fits_ushort_p_v2, "Ada_fits_ushort_p__SWIG_1");
function get_ui_v2
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.unsigned_long;
function get_ui
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item)
return Interfaces.C.unsigned_long renames
get_ui_v2;
pragma Import (C, get_ui_v2, "Ada_get_ui__SWIG_1");
pragma Import (C, getlimbn, "Ada_getlimbn");
procedure neg_v2
(a_a_gmp_w : in gmp_c.mpz_ptr.Item;
a_a_gmp_u : in gmp_c.mpz_srcptr.Item);
procedure neg
(a_a_gmp_w : in gmp_c.mpz_ptr.Item;
a_a_gmp_u : in gmp_c.mpz_srcptr.Item) renames
neg_v2;
pragma Import (C, neg_v2, "Ada_neg__SWIG_1");
pragma Import (C, perfect_square_p, "Ada_perfect_square_p");
pragma Import (C, popcount, "Ada_popcount");
procedure set_q_v2
(a_a_gmp_w : in gmp_c.mpz_ptr.Item;
a_a_gmp_u : in gmp_c.mpq_srcptr.Item);
procedure set_q
(a_a_gmp_w : in gmp_c.mpz_ptr.Item;
a_a_gmp_u : in gmp_c.mpq_srcptr.Item) renames
set_q_v2;
pragma Import (C, set_q_v2, "Ada_set_q__SWIG_1");
function size_v2
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.size_t;
function size
(a_a_gmp_z : in gmp_c.mpz_srcptr.Item) return Interfaces.C.size_t renames
size_v2;
pragma Import (C, size_v2, "Ada_size__SWIG_1");
procedure the_abs_v3
(a_a_gmp_w : in gmp_c.mpq_ptr.Item;
a_a_gmp_u : in gmp_c.mpq_srcptr.Item);
procedure the_abs
(a_a_gmp_w : in gmp_c.mpq_ptr.Item;
a_a_gmp_u : in gmp_c.mpq_srcptr.Item) renames
the_abs_v3;
pragma Import (C, the_abs_v3, "Ada_abs__SWIG_2");
procedure neg_v3
(a_a_gmp_w : in gmp_c.mpq_ptr.Item;
a_a_gmp_u : in gmp_c.mpq_srcptr.Item);
procedure neg
(a_a_gmp_w : in gmp_c.mpq_ptr.Item;
a_a_gmp_u : in gmp_c.mpq_srcptr.Item) renames
neg_v3;
pragma Import (C, neg_v3, "Ada_neg__SWIG_2");
pragma Import (C, a_a_gmpn_add, "Ada___gmpn_add");
pragma Import (C, a_a_gmpn_add_1, "Ada___gmpn_add_1");
pragma Import (C, a_a_gmpn_cmp, "Ada___gmpn_cmp");
pragma Import (C, a_a_gmpn_zero_p, "Ada___gmpn_zero_p");
pragma Import (C, a_a_gmpn_sub, "Ada___gmpn_sub");
pragma Import (C, a_a_gmpn_sub_1, "Ada___gmpn_sub_1");
pragma Import (C, a_a_gmpn_neg, "Ada___gmpn_neg");
end gmp_c.Binding;
|
<?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>hog</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>INPUT_IMAGE</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>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>4</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>specs</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>specs</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>2</direction>
<if_type>1</if_type>
<array_size>4</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>image0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>image0</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>286</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>image0_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>image0</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>382</item>
<item>383</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>tmp_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>34</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>384</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>specs_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>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>385</item>
<item>387</item>
<item>388</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>descriptor0_V</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</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>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>descriptor0.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>390</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>normalized0_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>391</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>descriptor1_V</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>260</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>260</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>descriptor1.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>392</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>normalized1_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>393</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>image_buffer0_0</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[0]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>394</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>image_buffer0_1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[1]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>395</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>image_buffer0_2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>396</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>image_buffer0_3</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[3]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>397</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>image_buffer0_4</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[4]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>398</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>image_buffer0_5</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[5]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>399</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>image_buffer0_6</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[6]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>400</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>image_buffer0_7</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[7]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>401</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>image_buffer0_8</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[8]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>402</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>image_buffer0_9</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[9]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>403</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>image_buffer0_10</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[10]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>404</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>image_buffer0_11</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[11]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>405</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>image_buffer0_12</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[12]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>406</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>image_buffer0_13</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[13]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>407</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>image_buffer0_14</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[14]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>408</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>image_buffer0_15</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[15]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>409</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>image_buffer0_16</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[16]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>410</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>image_buffer0_17</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>264</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer0[17]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>411</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>image_buffer1_0</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[0]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>412</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>image_buffer1_1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[1]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>413</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>image_buffer1_2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>414</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>image_buffer1_3</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[3]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>415</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>image_buffer1_4</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[4]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>416</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>image_buffer1_5</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[5]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>417</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>image_buffer1_6</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[6]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>418</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>image_buffer1_7</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[7]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>419</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>image_buffer1_8</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[8]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>420</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>image_buffer1_9</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[9]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>421</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>image_buffer1_10</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[10]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>422</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>image_buffer1_11</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[11]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>423</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>image_buffer1_12</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[12]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>424</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>image_buffer1_13</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[13]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>425</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>image_buffer1_14</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[14]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>426</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>image_buffer1_15</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[15]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>427</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>image_buffer1_16</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[16]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>428</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>image_buffer1_17</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>266</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>266</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>image_buffer1[17]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>429</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>sum0</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>270</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>270</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sum0</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>430</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>sum1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sum1</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>431</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>specs_addr_1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>432</item>
<item>433</item>
<item>434</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>specs_load</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>435</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>specs_load_1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>436</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>tmp_35_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>276</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>276</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>33</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>437</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>276</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>276</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>438</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>74</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>10</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>445</item>
<item>446</item>
<item>447</item>
<item>448</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>i</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>450</item>
<item>451</item>
<item>452</item>
<item>453</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>indvar</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>455</item>
<item>456</item>
<item>457</item>
<item>458</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>77</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>459</item>
<item>461</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>78</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>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>462</item>
<item>464</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>465</item>
<item>466</item>
<item>467</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>exitcond</name>
<fileName></fileName>
<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>469</item>
<item>471</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>indvar_mid2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>472</item>
<item>473</item>
<item>474</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>i_s</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>276</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>276</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>475</item>
<item>477</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>tmp_mid2_v_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>478</item>
<item>479</item>
<item>480</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>tmp_mid2_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>481</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>tmp_mid2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>482</item>
<item>483</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>p_sum1_cast_mid2_v_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>33</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>484</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>p_sum1_cast_mid2_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>33</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>485</item>
<item>486</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>p_sum1_cast_mid2_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>487</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>p_shl_mid2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>489</item>
<item>490</item>
<item>491</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>p_shl4_cast_mid2_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>493</item>
<item>494</item>
<item>496</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>p_shl4_cast_mid2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>497</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>indvar_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>7</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>498</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>image02_sum</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>499</item>
<item>500</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>image02_sum_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>501</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>INPUT_IMAGE_addr</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>502</item>
<item>503</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>indvar_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>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>504</item>
<item>506</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>tmp</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>507</item>
<item>509</item>
</oprand_edges>
<opcode>urem</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name>tmp_45</name>
<fileName></fileName>
<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>510</item>
<item>511</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>105</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>512</item>
<item>513</item>
<item>514</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name>INPUT_IMAGE_addr_rd_s</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>516</item>
<item>517</item>
<item>519</item>
</oprand_edges>
<opcode>readreq</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>108</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>520</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>INPUT_IMAGE_addr_rea</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>522</item>
<item>523</item>
<item>1412</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>tmp2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>524</item>
<item>525</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name>tmp2_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>526</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name>tmp_38</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>527</item>
<item>528</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>114</id>
<name>zext_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>529</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name>mul</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>530</item>
<item>532</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name>tmp_40</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>533</item>
<item>534</item>
</oprand_edges>
<opcode>urem</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name>tmp_41</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>535</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name>tmp_45_t</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>537</item>
<item>538</item>
<item>540</item>
<item>542</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name>image_buffer0_0_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>543</item>
<item>544</item>
<item>545</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>120</id>
<name>image_buffer0_1_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>546</item>
<item>547</item>
<item>548</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name>image_buffer0_2_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>549</item>
<item>550</item>
<item>551</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>122</id>
<name>image_buffer0_3_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>552</item>
<item>553</item>
<item>554</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>123</id>
<name>image_buffer0_4_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>555</item>
<item>556</item>
<item>557</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name>image_buffer0_5_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>558</item>
<item>559</item>
<item>560</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>125</id>
<name>image_buffer0_6_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>561</item>
<item>562</item>
<item>563</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>126</id>
<name>image_buffer0_7_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>564</item>
<item>565</item>
<item>566</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name>image_buffer0_8_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>567</item>
<item>568</item>
<item>569</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>128</id>
<name>image_buffer0_9_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>570</item>
<item>571</item>
<item>572</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_101">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>image_buffer0_10_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>573</item>
<item>574</item>
<item>575</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>130</id>
<name>image_buffer0_11_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>576</item>
<item>577</item>
<item>578</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>131</id>
<name>image_buffer0_12_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>579</item>
<item>580</item>
<item>581</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>132</id>
<name>image_buffer0_13_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>582</item>
<item>583</item>
<item>584</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>133</id>
<name>image_buffer0_14_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>585</item>
<item>586</item>
<item>587</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_106">
<Value>
<Obj>
<type>0</type>
<id>134</id>
<name>image_buffer0_15_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>588</item>
<item>589</item>
<item>590</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_107">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name>image_buffer0_16_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>591</item>
<item>592</item>
<item>593</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_108">
<Value>
<Obj>
<type>0</type>
<id>136</id>
<name>image_buffer0_17_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>594</item>
<item>595</item>
<item>596</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_109">
<Value>
<Obj>
<type>0</type>
<id>137</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>36</count>
<item_version>0</item_version>
<item>597</item>
<item>598</item>
<item>599</item>
<item>600</item>
<item>601</item>
<item>602</item>
<item>604</item>
<item>605</item>
<item>607</item>
<item>608</item>
<item>610</item>
<item>611</item>
<item>613</item>
<item>614</item>
<item>616</item>
<item>617</item>
<item>619</item>
<item>620</item>
<item>622</item>
<item>623</item>
<item>625</item>
<item>626</item>
<item>628</item>
<item>629</item>
<item>631</item>
<item>632</item>
<item>634</item>
<item>635</item>
<item>637</item>
<item>638</item>
<item>640</item>
<item>641</item>
<item>643</item>
<item>644</item>
<item>646</item>
<item>647</item>
</oprand_edges>
<opcode>switch</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_110">
<Value>
<Obj>
<type>0</type>
<id>139</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1010</item>
<item>1011</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_111">
<Value>
<Obj>
<type>0</type>
<id>140</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>1012</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_112">
<Value>
<Obj>
<type>0</type>
<id>142</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1007</item>
<item>1008</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_113">
<Value>
<Obj>
<type>0</type>
<id>143</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>1009</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_114">
<Value>
<Obj>
<type>0</type>
<id>145</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1004</item>
<item>1005</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_115">
<Value>
<Obj>
<type>0</type>
<id>146</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>1006</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_116">
<Value>
<Obj>
<type>0</type>
<id>148</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1001</item>
<item>1002</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_117">
<Value>
<Obj>
<type>0</type>
<id>149</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>1003</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_118">
<Value>
<Obj>
<type>0</type>
<id>151</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>998</item>
<item>999</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_119">
<Value>
<Obj>
<type>0</type>
<id>152</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>1000</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_120">
<Value>
<Obj>
<type>0</type>
<id>154</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>995</item>
<item>996</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_121">
<Value>
<Obj>
<type>0</type>
<id>155</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>997</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_122">
<Value>
<Obj>
<type>0</type>
<id>157</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>992</item>
<item>993</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_123">
<Value>
<Obj>
<type>0</type>
<id>158</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>994</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_124">
<Value>
<Obj>
<type>0</type>
<id>160</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>989</item>
<item>990</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_125">
<Value>
<Obj>
<type>0</type>
<id>161</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>991</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_126">
<Value>
<Obj>
<type>0</type>
<id>163</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>986</item>
<item>987</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_127">
<Value>
<Obj>
<type>0</type>
<id>164</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>988</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_128">
<Value>
<Obj>
<type>0</type>
<id>166</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>983</item>
<item>984</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_129">
<Value>
<Obj>
<type>0</type>
<id>167</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>985</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_130">
<Value>
<Obj>
<type>0</type>
<id>169</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>980</item>
<item>981</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_131">
<Value>
<Obj>
<type>0</type>
<id>170</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>982</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_132">
<Value>
<Obj>
<type>0</type>
<id>172</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>977</item>
<item>978</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_133">
<Value>
<Obj>
<type>0</type>
<id>173</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>979</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_134">
<Value>
<Obj>
<type>0</type>
<id>175</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>974</item>
<item>975</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_135">
<Value>
<Obj>
<type>0</type>
<id>176</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>976</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_136">
<Value>
<Obj>
<type>0</type>
<id>178</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>971</item>
<item>972</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_137">
<Value>
<Obj>
<type>0</type>
<id>179</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>973</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_138">
<Value>
<Obj>
<type>0</type>
<id>181</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>968</item>
<item>969</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_139">
<Value>
<Obj>
<type>0</type>
<id>182</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>970</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_140">
<Value>
<Obj>
<type>0</type>
<id>184</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>965</item>
<item>966</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_141">
<Value>
<Obj>
<type>0</type>
<id>185</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>967</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_142">
<Value>
<Obj>
<type>0</type>
<id>187</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>962</item>
<item>963</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_143">
<Value>
<Obj>
<type>0</type>
<id>188</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>964</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_144">
<Value>
<Obj>
<type>0</type>
<id>190</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1013</item>
<item>1014</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_145">
<Value>
<Obj>
<type>0</type>
<id>191</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>277</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>1015</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_146">
<Value>
<Obj>
<type>0</type>
<id>194</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>468</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_147">
<Value>
<Obj>
<type>0</type>
<id>196</id>
<name>tmp3</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>33</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>439</item>
<item>441</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_148">
<Value>
<Obj>
<type>0</type>
<id>197</id>
<name>tmp3_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>442</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_149">
<Value>
<Obj>
<type>0</type>
<id>198</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>280</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>280</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>443</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_150">
<Value>
<Obj>
<type>0</type>
<id>200</id>
<name>indvar_flatten8</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>648</item>
<item>649</item>
<item>650</item>
<item>651</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_151">
<Value>
<Obj>
<type>0</type>
<id>201</id>
<name>i4</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>652</item>
<item>653</item>
<item>654</item>
<item>655</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_152">
<Value>
<Obj>
<type>0</type>
<id>202</id>
<name>indvar1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>656</item>
<item>657</item>
<item>658</item>
<item>659</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_153">
<Value>
<Obj>
<type>0</type>
<id>203</id>
<name>exitcond_flatten1</name>
<fileName></fileName>
<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>660</item>
<item>661</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_154">
<Value>
<Obj>
<type>0</type>
<id>204</id>
<name>indvar_flatten_next9</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>662</item>
<item>663</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_155">
<Value>
<Obj>
<type>0</type>
<id>205</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>664</item>
<item>665</item>
<item>666</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_156">
<Value>
<Obj>
<type>0</type>
<id>209</id>
<name>exitcond1</name>
<fileName></fileName>
<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>668</item>
<item>669</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_157">
<Value>
<Obj>
<type>0</type>
<id>210</id>
<name>indvar1_mid2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>670</item>
<item>671</item>
<item>672</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_158">
<Value>
<Obj>
<type>0</type>
<id>211</id>
<name>i_1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>280</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>280</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>673</item>
<item>674</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_159">
<Value>
<Obj>
<type>0</type>
<id>212</id>
<name>p_sum2_cast_mid2_v_v_s</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>675</item>
<item>676</item>
<item>677</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_160">
<Value>
<Obj>
<type>0</type>
<id>213</id>
<name>p_sum2_cast_mid2_v_v_1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>678</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_161">
<Value>
<Obj>
<type>0</type>
<id>214</id>
<name>p_sum2_cast_mid2_v_v_2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>679</item>
<item>680</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_162">
<Value>
<Obj>
<type>0</type>
<id>215</id>
<name>p_sum2_cast_mid2_v_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>681</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_163">
<Value>
<Obj>
<type>0</type>
<id>216</id>
<name>p_sum2_cast_mid2_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>682</item>
<item>683</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_164">
<Value>
<Obj>
<type>0</type>
<id>217</id>
<name>p_shl5_mid2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>684</item>
<item>685</item>
<item>686</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_165">
<Value>
<Obj>
<type>0</type>
<id>218</id>
<name>p_shl6_cast_mid2_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>687</item>
<item>688</item>
<item>689</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_166">
<Value>
<Obj>
<type>0</type>
<id>219</id>
<name>p_shl6_cast_mid2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>690</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_167">
<Value>
<Obj>
<type>0</type>
<id>220</id>
<name>indvar1_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>7</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>691</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_168">
<Value>
<Obj>
<type>0</type>
<id>222</id>
<name>image02_sum7</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>692</item>
<item>693</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_169">
<Value>
<Obj>
<type>0</type>
<id>223</id>
<name>image02_sum7_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>694</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_170">
<Value>
<Obj>
<type>0</type>
<id>224</id>
<name>INPUT_IMAGE_addr_1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>695</item>
<item>696</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_171">
<Value>
<Obj>
<type>0</type>
<id>227</id>
<name>indvar_next1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>697</item>
<item>698</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_172">
<Value>
<Obj>
<type>0</type>
<id>228</id>
<name>tmp_49</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>699</item>
<item>700</item>
</oprand_edges>
<opcode>urem</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_173">
<Value>
<Obj>
<type>0</type>
<id>229</id>
<name>tmp_50</name>
<fileName></fileName>
<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>701</item>
<item>702</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_174">
<Value>
<Obj>
<type>0</type>
<id>230</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>703</item>
<item>704</item>
<item>705</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_175">
<Value>
<Obj>
<type>0</type>
<id>232</id>
<name>INPUT_IMAGE_addr_2_r</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>706</item>
<item>707</item>
<item>708</item>
</oprand_edges>
<opcode>readreq</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_176">
<Value>
<Obj>
<type>0</type>
<id>233</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>709</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_177">
<Value>
<Obj>
<type>0</type>
<id>235</id>
<name>INPUT_IMAGE_addr_1_r</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>710</item>
<item>711</item>
<item>1413</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_178">
<Value>
<Obj>
<type>0</type>
<id>236</id>
<name>tmp6</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>712</item>
<item>713</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_179">
<Value>
<Obj>
<type>0</type>
<id>237</id>
<name>tmp6_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>714</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_180">
<Value>
<Obj>
<type>0</type>
<id>238</id>
<name>tmp_43</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>715</item>
<item>716</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_181">
<Value>
<Obj>
<type>0</type>
<id>239</id>
<name>zext3_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>717</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_182">
<Value>
<Obj>
<type>0</type>
<id>240</id>
<name>mul4</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>718</item>
<item>719</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_183">
<Value>
<Obj>
<type>0</type>
<id>241</id>
<name>tmp_s</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>720</item>
<item>721</item>
</oprand_edges>
<opcode>urem</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_184">
<Value>
<Obj>
<type>0</type>
<id>242</id>
<name>tmp_46</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>722</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_185">
<Value>
<Obj>
<type>0</type>
<id>243</id>
<name>tmp_52_t</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>723</item>
<item>724</item>
<item>725</item>
<item>726</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_186">
<Value>
<Obj>
<type>0</type>
<id>244</id>
<name>image_buffer1_0_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>727</item>
<item>728</item>
<item>729</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_187">
<Value>
<Obj>
<type>0</type>
<id>245</id>
<name>image_buffer1_1_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>730</item>
<item>731</item>
<item>732</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_188">
<Value>
<Obj>
<type>0</type>
<id>246</id>
<name>image_buffer1_2_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>733</item>
<item>734</item>
<item>735</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_189">
<Value>
<Obj>
<type>0</type>
<id>247</id>
<name>image_buffer1_3_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>736</item>
<item>737</item>
<item>738</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_190">
<Value>
<Obj>
<type>0</type>
<id>248</id>
<name>image_buffer1_4_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>739</item>
<item>740</item>
<item>741</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_191">
<Value>
<Obj>
<type>0</type>
<id>249</id>
<name>image_buffer1_5_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>742</item>
<item>743</item>
<item>744</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_192">
<Value>
<Obj>
<type>0</type>
<id>250</id>
<name>image_buffer1_6_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>745</item>
<item>746</item>
<item>747</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_193">
<Value>
<Obj>
<type>0</type>
<id>251</id>
<name>image_buffer1_7_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>748</item>
<item>749</item>
<item>750</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_194">
<Value>
<Obj>
<type>0</type>
<id>252</id>
<name>image_buffer1_8_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>751</item>
<item>752</item>
<item>753</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_195">
<Value>
<Obj>
<type>0</type>
<id>253</id>
<name>image_buffer1_9_add</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>754</item>
<item>755</item>
<item>756</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_196">
<Value>
<Obj>
<type>0</type>
<id>254</id>
<name>image_buffer1_10_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>757</item>
<item>758</item>
<item>759</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_197">
<Value>
<Obj>
<type>0</type>
<id>255</id>
<name>image_buffer1_11_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>760</item>
<item>761</item>
<item>762</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_198">
<Value>
<Obj>
<type>0</type>
<id>256</id>
<name>image_buffer1_12_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>763</item>
<item>764</item>
<item>765</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_199">
<Value>
<Obj>
<type>0</type>
<id>257</id>
<name>image_buffer1_13_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>766</item>
<item>767</item>
<item>768</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_200">
<Value>
<Obj>
<type>0</type>
<id>258</id>
<name>image_buffer1_14_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>769</item>
<item>770</item>
<item>771</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_201">
<Value>
<Obj>
<type>0</type>
<id>259</id>
<name>image_buffer1_15_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>772</item>
<item>773</item>
<item>774</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_202">
<Value>
<Obj>
<type>0</type>
<id>260</id>
<name>image_buffer1_16_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>775</item>
<item>776</item>
<item>777</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_203">
<Value>
<Obj>
<type>0</type>
<id>261</id>
<name>image_buffer1_17_ad</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>778</item>
<item>779</item>
<item>780</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_204">
<Value>
<Obj>
<type>0</type>
<id>262</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>36</count>
<item_version>0</item_version>
<item>781</item>
<item>782</item>
<item>783</item>
<item>784</item>
<item>785</item>
<item>786</item>
<item>787</item>
<item>788</item>
<item>789</item>
<item>790</item>
<item>791</item>
<item>792</item>
<item>793</item>
<item>794</item>
<item>795</item>
<item>796</item>
<item>797</item>
<item>798</item>
<item>799</item>
<item>800</item>
<item>801</item>
<item>802</item>
<item>803</item>
<item>804</item>
<item>805</item>
<item>806</item>
<item>807</item>
<item>808</item>
<item>809</item>
<item>810</item>
<item>811</item>
<item>812</item>
<item>813</item>
<item>814</item>
<item>815</item>
<item>816</item>
</oprand_edges>
<opcode>switch</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_205">
<Value>
<Obj>
<type>0</type>
<id>264</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1064</item>
<item>1065</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_206">
<Value>
<Obj>
<type>0</type>
<id>265</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1066</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_207">
<Value>
<Obj>
<type>0</type>
<id>267</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1061</item>
<item>1062</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_208">
<Value>
<Obj>
<type>0</type>
<id>268</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1063</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_209">
<Value>
<Obj>
<type>0</type>
<id>270</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1058</item>
<item>1059</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_210">
<Value>
<Obj>
<type>0</type>
<id>271</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1060</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_211">
<Value>
<Obj>
<type>0</type>
<id>273</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1055</item>
<item>1056</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_212">
<Value>
<Obj>
<type>0</type>
<id>274</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1057</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_213">
<Value>
<Obj>
<type>0</type>
<id>276</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1052</item>
<item>1053</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_214">
<Value>
<Obj>
<type>0</type>
<id>277</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1054</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_215">
<Value>
<Obj>
<type>0</type>
<id>279</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1049</item>
<item>1050</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_216">
<Value>
<Obj>
<type>0</type>
<id>280</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1051</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_217">
<Value>
<Obj>
<type>0</type>
<id>282</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1046</item>
<item>1047</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_218">
<Value>
<Obj>
<type>0</type>
<id>283</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1048</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_219">
<Value>
<Obj>
<type>0</type>
<id>285</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1043</item>
<item>1044</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_220">
<Value>
<Obj>
<type>0</type>
<id>286</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1045</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_221">
<Value>
<Obj>
<type>0</type>
<id>288</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1040</item>
<item>1041</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_222">
<Value>
<Obj>
<type>0</type>
<id>289</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1042</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_223">
<Value>
<Obj>
<type>0</type>
<id>291</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1037</item>
<item>1038</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_224">
<Value>
<Obj>
<type>0</type>
<id>292</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1039</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_225">
<Value>
<Obj>
<type>0</type>
<id>294</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1034</item>
<item>1035</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_226">
<Value>
<Obj>
<type>0</type>
<id>295</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1036</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_227">
<Value>
<Obj>
<type>0</type>
<id>297</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1031</item>
<item>1032</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_228">
<Value>
<Obj>
<type>0</type>
<id>298</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1033</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_229">
<Value>
<Obj>
<type>0</type>
<id>300</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1028</item>
<item>1029</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_230">
<Value>
<Obj>
<type>0</type>
<id>301</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1030</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_231">
<Value>
<Obj>
<type>0</type>
<id>303</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1025</item>
<item>1026</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_232">
<Value>
<Obj>
<type>0</type>
<id>304</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1027</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_233">
<Value>
<Obj>
<type>0</type>
<id>306</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1022</item>
<item>1023</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_234">
<Value>
<Obj>
<type>0</type>
<id>307</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1024</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_235">
<Value>
<Obj>
<type>0</type>
<id>309</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1019</item>
<item>1020</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_236">
<Value>
<Obj>
<type>0</type>
<id>310</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1021</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_237">
<Value>
<Obj>
<type>0</type>
<id>312</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1016</item>
<item>1017</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_238">
<Value>
<Obj>
<type>0</type>
<id>313</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1018</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_239">
<Value>
<Obj>
<type>0</type>
<id>315</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>1067</item>
<item>1068</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_240">
<Value>
<Obj>
<type>0</type>
<id>316</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>281</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>281</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>1069</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_241">
<Value>
<Obj>
<type>0</type>
<id>319</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>667</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_242">
<Value>
<Obj>
<type>0</type>
<id>321</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>284</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>284</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>25</count>
<item_version>0</item_version>
<item>818</item>
<item>819</item>
<item>820</item>
<item>821</item>
<item>822</item>
<item>823</item>
<item>824</item>
<item>825</item>
<item>826</item>
<item>827</item>
<item>828</item>
<item>829</item>
<item>830</item>
<item>831</item>
<item>832</item>
<item>833</item>
<item>834</item>
<item>835</item>
<item>836</item>
<item>837</item>
<item>838</item>
<item>1070</item>
<item>1071</item>
<item>1072</item>
<item>1073</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_243">
<Value>
<Obj>
<type>0</type>
<id>322</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>285</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>285</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>25</count>
<item_version>0</item_version>
<item>840</item>
<item>841</item>
<item>842</item>
<item>843</item>
<item>844</item>
<item>845</item>
<item>846</item>
<item>847</item>
<item>848</item>
<item>849</item>
<item>850</item>
<item>851</item>
<item>852</item>
<item>853</item>
<item>854</item>
<item>855</item>
<item>856</item>
<item>857</item>
<item>858</item>
<item>859</item>
<item>860</item>
<item>1074</item>
<item>1075</item>
<item>1076</item>
<item>1077</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_244">
<Value>
<Obj>
<type>0</type>
<id>323</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>287</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>287</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>862</item>
<item>863</item>
<item>864</item>
<item>865</item>
<item>1411</item>
<item>1414</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_245">
<Value>
<Obj>
<type>0</type>
<id>324</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>288</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>288</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>867</item>
<item>868</item>
<item>869</item>
<item>870</item>
<item>1410</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_246">
<Value>
<Obj>
<type>0</type>
<id>325</id>
<name>specs_addr_2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>871</item>
<item>872</item>
<item>874</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_247">
<Value>
<Obj>
<type>0</type>
<id>326</id>
<name>specs_load_2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</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>875</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_248">
<Value>
<Obj>
<type>0</type>
<id>327</id>
<name>tmp_47</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>876</item>
<item>878</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_249">
<Value>
<Obj>
<type>0</type>
<id>328</id>
<name>tmp_48</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>879</item>
<item>881</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_250">
<Value>
<Obj>
<type>0</type>
<id>329</id>
<name>tmp_34</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>882</item>
<item>883</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_251">
<Value>
<Obj>
<type>0</type>
<id>330</id>
<name>tmp_42</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</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>885</item>
<item>886</item>
<item>888</item>
<item>890</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_252">
<Value>
<Obj>
<type>0</type>
<id>331</id>
<name>offset_assign_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>891</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_253">
<Value>
<Obj>
<type>0</type>
<id>335</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>227</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>892</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_254">
<Value>
<Obj>
<type>0</type>
<id>337</id>
<name>classify_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sum</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>26</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>894</item>
<item>895</item>
<item>896</item>
<item>897</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_255">
<Value>
<Obj>
<type>0</type>
<id>338</id>
<name>i_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>899</item>
<item>900</item>
<item>901</item>
<item>902</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_256">
<Value>
<Obj>
<type>0</type>
<id>339</id>
<name>tmp_i</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>227</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>903</item>
<item>905</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_257">
<Value>
<Obj>
<type>0</type>
<id>340</id>
<name>i_3</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>227</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>906</item>
<item>908</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_258">
<Value>
<Obj>
<type>0</type>
<id>341</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>227</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>909</item>
<item>910</item>
<item>911</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_259">
<Value>
<Obj>
<type>0</type>
<id>343</id>
<name>i_i_cast9</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>227</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>912</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_260">
<Value>
<Obj>
<type>0</type>
<id>344</id>
<name>i_i_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>227</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>913</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_261">
<Value>
<Obj>
<type>0</type>
<id>349</id>
<name>tmp_1_i</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>230</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>914</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_262">
<Value>
<Obj>
<type>0</type>
<id>350</id>
<name>tmp_2_i</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>230</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>915</item>
<item>916</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_263">
<Value>
<Obj>
<type>0</type>
<id>351</id>
<name>tmp_3_i</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>230</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>917</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_264">
<Value>
<Obj>
<type>0</type>
<id>352</id>
<name>normalized0_V_addr</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>230</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>918</item>
<item>919</item>
<item>920</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_265">
<Value>
<Obj>
<type>0</type>
<id>353</id>
<name>normalized0_V_load</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>230</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>921</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_266">
<Value>
<Obj>
<type>0</type>
<id>354</id>
<name>lhs_V_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>922</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_267">
<Value>
<Obj>
<type>0</type>
<id>355</id>
<name>weights_addr</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>230</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>923</item>
<item>924</item>
<item>925</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_268">
<Value>
<Obj>
<type>0</type>
<id>356</id>
<name>weights_load</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>230</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>926</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_269">
<Value>
<Obj>
<type>0</type>
<id>357</id>
<name>rhs_V_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>927</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_270">
<Value>
<Obj>
<type>0</type>
<id>358</id>
<name>r_V</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>928</item>
<item>929</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_271">
<Value>
<Obj>
<type>0</type>
<id>359</id>
<name>tmp7</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>930</item>
<item>932</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_272">
<Value>
<Obj>
<type>0</type>
<id>360</id>
<name>tmp7_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>933</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_273">
<Value>
<Obj>
<type>0</type>
<id>361</id>
<name>tmp_8_i</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>934</item>
<item>935</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_274">
<Value>
<Obj>
<type>0</type>
<id>362</id>
<name>tmp_9_i</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</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>936</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_275">
<Value>
<Obj>
<type>0</type>
<id>363</id>
<name>normalized1_V_addr</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>937</item>
<item>938</item>
<item>939</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_276">
<Value>
<Obj>
<type>0</type>
<id>364</id>
<name>normalized1_V_load</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</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>940</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_277">
<Value>
<Obj>
<type>0</type>
<id>365</id>
<name>lhs_V_1_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>941</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_278">
<Value>
<Obj>
<type>0</type>
<id>366</id>
<name>weights_addr_1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</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>942</item>
<item>943</item>
<item>944</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_279">
<Value>
<Obj>
<type>0</type>
<id>367</id>
<name>weights_load_1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</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>945</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_280">
<Value>
<Obj>
<type>0</type>
<id>368</id>
<name>rhs_V_1_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>946</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_281">
<Value>
<Obj>
<type>0</type>
<id>369</id>
<name>r_V_1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>947</item>
<item>948</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_282">
<Value>
<Obj>
<type>0</type>
<id>370</id>
<name>tmp_44</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>949</item>
<item>950</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_283">
<Value>
<Obj>
<type>0</type>
<id>371</id>
<name>p_cast_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</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>951</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_284">
<Value>
<Obj>
<type>0</type>
<id>372</id>
<name>sum</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>231</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sum</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>26</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>952</item>
<item>953</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_285">
<Value>
<Obj>
<type>0</type>
<id>374</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>227</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>954</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_286">
<Value>
<Obj>
<type>0</type>
<id>376</id>
<name>classify_0_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>svm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>290</second>
</item>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>svm</second>
</first>
<second>227</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>955</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_287">
<Value>
<Obj>
<type>0</type>
<id>377</id>
<name>specs_addr_3</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>292</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>292</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>956</item>
<item>957</item>
<item>959</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_288">
<Value>
<Obj>
<type>0</type>
<id>378</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>292</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>292</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>960</item>
<item>961</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_289">
<Value>
<Obj>
<type>0</type>
<id>379</id>
<name></name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</fileDirectory>
<lineNumber>293</lineNumber>
<contextFuncName>hog</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>hog</second>
</first>
<second>293</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>47</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_290">
<Value>
<Obj>
<type>2</type>
<id>386</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="_291">
<Value>
<Obj>
<type>2</type>
<id>389</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_292">
<Value>
<Obj>
<type>2</type>
<id>440</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>33</bitwidth>
</Value>
<const_type>0</const_type>
<content>33</content>
</item>
<item class_id_reference="16" object_id="_293">
<Value>
<Obj>
<type>2</type>
<id>444</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_294">
<Value>
<Obj>
<type>2</type>
<id>449</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_295">
<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>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_296">
<Value>
<Obj>
<type>2</type>
<id>460</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>612</content>
</item>
<item class_id_reference="16" object_id="_297">
<Value>
<Obj>
<type>2</type>
<id>463</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_298">
<Value>
<Obj>
<type>2</type>
<id>470</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>34</content>
</item>
<item class_id_reference="16" object_id="_299">
<Value>
<Obj>
<type>2</type>
<id>476</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_300">
<Value>
<Obj>
<type>2</type>
<id>495</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="_301">
<Value>
<Obj>
<type>2</type>
<id>505</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_302">
<Value>
<Obj>
<type>2</type>
<id>508</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>34</content>
</item>
<item class_id_reference="16" object_id="_303">
<Value>
<Obj>
<type>2</type>
<id>518</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="_304">
<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>22</bitwidth>
</Value>
<const_type>0</const_type>
<content>1928</content>
</item>
<item class_id_reference="16" object_id="_305">
<Value>
<Obj>
<type>2</type>
<id>539</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="_306">
<Value>
<Obj>
<type>2</type>
<id>541</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>20</content>
</item>
<item class_id_reference="16" object_id="_307">
<Value>
<Obj>
<type>2</type>
<id>603</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_308">
<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>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_309">
<Value>
<Obj>
<type>2</type>
<id>609</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_310">
<Value>
<Obj>
<type>2</type>
<id>612</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>5</content>
</item>
<item class_id_reference="16" object_id="_311">
<Value>
<Obj>
<type>2</type>
<id>615</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>6</content>
</item>
<item class_id_reference="16" object_id="_312">
<Value>
<Obj>
<type>2</type>
<id>618</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>7</content>
</item>
<item class_id_reference="16" object_id="_313">
<Value>
<Obj>
<type>2</type>
<id>621</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_314">
<Value>
<Obj>
<type>2</type>
<id>624</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>9</content>
</item>
<item class_id_reference="16" object_id="_315">
<Value>
<Obj>
<type>2</type>
<id>627</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>10</content>
</item>
<item class_id_reference="16" object_id="_316">
<Value>
<Obj>
<type>2</type>
<id>630</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>11</content>
</item>
<item class_id_reference="16" object_id="_317">
<Value>
<Obj>
<type>2</type>
<id>633</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>12</content>
</item>
<item class_id_reference="16" object_id="_318">
<Value>
<Obj>
<type>2</type>
<id>636</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>13</content>
</item>
<item class_id_reference="16" object_id="_319">
<Value>
<Obj>
<type>2</type>
<id>639</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>14</content>
</item>
<item class_id_reference="16" object_id="_320">
<Value>
<Obj>
<type>2</type>
<id>642</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>15</content>
</item>
<item class_id_reference="16" object_id="_321">
<Value>
<Obj>
<type>2</type>
<id>645</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_322">
<Value>
<Obj>
<type>2</type>
<id>817</id>
<name>computeHistogram0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:computeHistogram0></content>
</item>
<item class_id_reference="16" object_id="_323">
<Value>
<Obj>
<type>2</type>
<id>839</id>
<name>computeHistogram1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:computeHistogram1></content>
</item>
<item class_id_reference="16" object_id="_324">
<Value>
<Obj>
<type>2</type>
<id>861</id>
<name>normalizeHisto0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:normalizeHisto0></content>
</item>
<item class_id_reference="16" object_id="_325">
<Value>
<Obj>
<type>2</type>
<id>866</id>
<name>normalizeHisto1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:normalizeHisto1></content>
</item>
<item class_id_reference="16" object_id="_326">
<Value>
<Obj>
<type>2</type>
<id>873</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>2</content>
</item>
<item class_id_reference="16" object_id="_327">
<Value>
<Obj>
<type>2</type>
<id>877</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="_328">
<Value>
<Obj>
<type>2</type>
<id>880</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="_329">
<Value>
<Obj>
<type>2</type>
<id>887</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="_330">
<Value>
<Obj>
<type>2</type>
<id>889</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="_331">
<Value>
<Obj>
<type>2</type>
<id>893</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>26</bitwidth>
</Value>
<const_type>0</const_type>
<content>67108850</content>
</item>
<item class_id_reference="16" object_id="_332">
<Value>
<Obj>
<type>2</type>
<id>898</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="_333">
<Value>
<Obj>
<type>2</type>
<id>904</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>72</content>
</item>
<item class_id_reference="16" object_id="_334">
<Value>
<Obj>
<type>2</type>
<id>907</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>1</content>
</item>
<item class_id_reference="16" object_id="_335">
<Value>
<Obj>
<type>2</type>
<id>931</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>72</content>
</item>
<item class_id_reference="16" object_id="_336">
<Value>
<Obj>
<type>2</type>
<id>958</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>3</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>52</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_337">
<Obj>
<type>3</type>
<id>73</id>
<name>arrayctor.loop1.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>50</count>
<item_version>0</item_version>
<item>13</item>
<item>14</item>
<item>17</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>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_338">
<Obj>
<type>3</type>
<id>80</id>
<name>burst.rd.header</name>
<fileName></fileName>
<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>74</item>
<item>75</item>
<item>76</item>
<item>77</item>
<item>78</item>
<item>79</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_339">
<Obj>
<type>3</type>
<id>106</id>
<name>burst.rd.end</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>20</count>
<item_version>0</item_version>
<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>97</item>
<item>98</item>
<item>99</item>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_340">
<Obj>
<type>3</type>
<id>109</id>
<name>ReqBB</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_341">
<Obj>
<type>3</type>
<id>138</id>
<name>BurstBB</name>
<fileName></fileName>
<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>28</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_342">
<Obj>
<type>3</type>
<id>141</id>
<name>branch16</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>139</item>
<item>140</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_343">
<Obj>
<type>3</type>
<id>144</id>
<name>branch15</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>142</item>
<item>143</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_344">
<Obj>
<type>3</type>
<id>147</id>
<name>branch14</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>145</item>
<item>146</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_345">
<Obj>
<type>3</type>
<id>150</id>
<name>branch13</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>148</item>
<item>149</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_346">
<Obj>
<type>3</type>
<id>153</id>
<name>branch12</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>151</item>
<item>152</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_347">
<Obj>
<type>3</type>
<id>156</id>
<name>branch11</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>154</item>
<item>155</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_348">
<Obj>
<type>3</type>
<id>159</id>
<name>branch10</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>157</item>
<item>158</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_349">
<Obj>
<type>3</type>
<id>162</id>
<name>branch9</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>160</item>
<item>161</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_350">
<Obj>
<type>3</type>
<id>165</id>
<name>branch8</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>163</item>
<item>164</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_351">
<Obj>
<type>3</type>
<id>168</id>
<name>branch7</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>166</item>
<item>167</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_352">
<Obj>
<type>3</type>
<id>171</id>
<name>branch6</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>169</item>
<item>170</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_353">
<Obj>
<type>3</type>
<id>174</id>
<name>branch5</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>172</item>
<item>173</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_354">
<Obj>
<type>3</type>
<id>177</id>
<name>branch4</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_355">
<Obj>
<type>3</type>
<id>180</id>
<name>branch3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>178</item>
<item>179</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_356">
<Obj>
<type>3</type>
<id>183</id>
<name>branch2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>181</item>
<item>182</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_357">
<Obj>
<type>3</type>
<id>186</id>
<name>branch1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>184</item>
<item>185</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_358">
<Obj>
<type>3</type>
<id>189</id>
<name>branch0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>187</item>
<item>188</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_359">
<Obj>
<type>3</type>
<id>192</id>
<name>branch17</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>190</item>
<item>191</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_360">
<Obj>
<type>3</type>
<id>195</id>
<name>burst.rd.body29</name>
<fileName></fileName>
<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>194</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_361">
<Obj>
<type>3</type>
<id>199</id>
<name>.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
<item>198</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_362">
<Obj>
<type>3</type>
<id>206</id>
<name>burst.rd.header26</name>
<fileName></fileName>
<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>200</item>
<item>201</item>
<item>202</item>
<item>203</item>
<item>204</item>
<item>205</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_363">
<Obj>
<type>3</type>
<id>231</id>
<name>burst.rd.end25</name>
<fileName></fileName>
<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>19</count>
<item_version>0</item_version>
<item>209</item>
<item>210</item>
<item>211</item>
<item>212</item>
<item>213</item>
<item>214</item>
<item>215</item>
<item>216</item>
<item>217</item>
<item>218</item>
<item>219</item>
<item>220</item>
<item>222</item>
<item>223</item>
<item>224</item>
<item>227</item>
<item>228</item>
<item>229</item>
<item>230</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_364">
<Obj>
<type>3</type>
<id>234</id>
<name>ReqBB18</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>232</item>
<item>233</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_365">
<Obj>
<type>3</type>
<id>263</id>
<name>BurstBB16</name>
<fileName></fileName>
<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>28</count>
<item_version>0</item_version>
<item>235</item>
<item>236</item>
<item>237</item>
<item>238</item>
<item>239</item>
<item>240</item>
<item>241</item>
<item>242</item>
<item>243</item>
<item>244</item>
<item>245</item>
<item>246</item>
<item>247</item>
<item>248</item>
<item>249</item>
<item>250</item>
<item>251</item>
<item>252</item>
<item>253</item>
<item>254</item>
<item>255</item>
<item>256</item>
<item>257</item>
<item>258</item>
<item>259</item>
<item>260</item>
<item>261</item>
<item>262</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_366">
<Obj>
<type>3</type>
<id>266</id>
<name>branch34</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>264</item>
<item>265</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_367">
<Obj>
<type>3</type>
<id>269</id>
<name>branch33</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>267</item>
<item>268</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_368">
<Obj>
<type>3</type>
<id>272</id>
<name>branch32</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>270</item>
<item>271</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_369">
<Obj>
<type>3</type>
<id>275</id>
<name>branch31</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>273</item>
<item>274</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_370">
<Obj>
<type>3</type>
<id>278</id>
<name>branch30</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>276</item>
<item>277</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_371">
<Obj>
<type>3</type>
<id>281</id>
<name>branch29</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>279</item>
<item>280</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_372">
<Obj>
<type>3</type>
<id>284</id>
<name>branch28</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>282</item>
<item>283</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_373">
<Obj>
<type>3</type>
<id>287</id>
<name>branch27</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>285</item>
<item>286</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_374">
<Obj>
<type>3</type>
<id>290</id>
<name>branch26</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>288</item>
<item>289</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_375">
<Obj>
<type>3</type>
<id>293</id>
<name>branch25</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>291</item>
<item>292</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_376">
<Obj>
<type>3</type>
<id>296</id>
<name>branch24</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>294</item>
<item>295</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_377">
<Obj>
<type>3</type>
<id>299</id>
<name>branch23</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>297</item>
<item>298</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_378">
<Obj>
<type>3</type>
<id>302</id>
<name>branch22</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>300</item>
<item>301</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_379">
<Obj>
<type>3</type>
<id>305</id>
<name>branch21</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>303</item>
<item>304</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_380">
<Obj>
<type>3</type>
<id>308</id>
<name>branch20</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>306</item>
<item>307</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_381">
<Obj>
<type>3</type>
<id>311</id>
<name>branch19</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>309</item>
<item>310</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_382">
<Obj>
<type>3</type>
<id>314</id>
<name>branch18</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>312</item>
<item>313</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_383">
<Obj>
<type>3</type>
<id>317</id>
<name>branch35</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>315</item>
<item>316</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_384">
<Obj>
<type>3</type>
<id>320</id>
<name>burst.rd.body2748</name>
<fileName></fileName>
<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>319</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_385">
<Obj>
<type>3</type>
<id>336</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<item>321</item>
<item>322</item>
<item>323</item>
<item>324</item>
<item>325</item>
<item>326</item>
<item>327</item>
<item>328</item>
<item>329</item>
<item>330</item>
<item>331</item>
<item>335</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_386">
<Obj>
<type>3</type>
<id>342</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>337</item>
<item>338</item>
<item>339</item>
<item>340</item>
<item>341</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_387">
<Obj>
<type>3</type>
<id>375</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>27</count>
<item_version>0</item_version>
<item>343</item>
<item>344</item>
<item>349</item>
<item>350</item>
<item>351</item>
<item>352</item>
<item>353</item>
<item>354</item>
<item>355</item>
<item>356</item>
<item>357</item>
<item>358</item>
<item>359</item>
<item>360</item>
<item>361</item>
<item>362</item>
<item>363</item>
<item>364</item>
<item>365</item>
<item>366</item>
<item>367</item>
<item>368</item>
<item>369</item>
<item>370</item>
<item>371</item>
<item>372</item>
<item>374</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_388">
<Obj>
<type>3</type>
<id>380</id>
<name>svm.exit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>376</item>
<item>377</item>
<item>378</item>
<item>379</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>726</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_389">
<id>383</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_390">
<id>384</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_391">
<id>385</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_392">
<id>387</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_393">
<id>388</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_394">
<id>390</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_395">
<id>391</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_396">
<id>392</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_397">
<id>393</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_398">
<id>394</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_399">
<id>395</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_400">
<id>396</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_401">
<id>397</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_402">
<id>398</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_403">
<id>399</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_404">
<id>400</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_405">
<id>401</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_406">
<id>402</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_407">
<id>403</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_408">
<id>404</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_409">
<id>405</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_410">
<id>406</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_411">
<id>407</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_412">
<id>408</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_413">
<id>409</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_414">
<id>410</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_415">
<id>411</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_416">
<id>412</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_417">
<id>413</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_418">
<id>414</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_419">
<id>415</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_420">
<id>416</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_421">
<id>417</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_422">
<id>418</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_423">
<id>419</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_424">
<id>420</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_425">
<id>421</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_426">
<id>422</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_427">
<id>423</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_428">
<id>424</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_429">
<id>425</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_430">
<id>426</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_431">
<id>427</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_432">
<id>428</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_433">
<id>429</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_434">
<id>430</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_435">
<id>431</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_436">
<id>432</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_437">
<id>433</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_438">
<id>434</id>
<edge_type>1</edge_type>
<source_obj>389</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_439">
<id>435</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_440">
<id>436</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_441">
<id>437</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_442">
<id>438</id>
<edge_type>2</edge_type>
<source_obj>80</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_443">
<id>439</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>196</sink_obj>
</item>
<item class_id_reference="20" object_id="_444">
<id>441</id>
<edge_type>1</edge_type>
<source_obj>440</source_obj>
<sink_obj>196</sink_obj>
</item>
<item class_id_reference="20" object_id="_445">
<id>442</id>
<edge_type>1</edge_type>
<source_obj>196</source_obj>
<sink_obj>197</sink_obj>
</item>
<item class_id_reference="20" object_id="_446">
<id>443</id>
<edge_type>2</edge_type>
<source_obj>206</source_obj>
<sink_obj>198</sink_obj>
</item>
<item class_id_reference="20" object_id="_447">
<id>445</id>
<edge_type>1</edge_type>
<source_obj>444</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_448">
<id>446</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_449">
<id>447</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_450">
<id>448</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_451">
<id>450</id>
<edge_type>1</edge_type>
<source_obj>449</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_452">
<id>451</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_453">
<id>452</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_454">
<id>453</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_455">
<id>455</id>
<edge_type>1</edge_type>
<source_obj>454</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_456">
<id>456</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_457">
<id>457</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_458">
<id>458</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_459">
<id>459</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_460">
<id>461</id>
<edge_type>1</edge_type>
<source_obj>460</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_461">
<id>462</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_462">
<id>464</id>
<edge_type>1</edge_type>
<source_obj>463</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_463">
<id>465</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_464">
<id>466</id>
<edge_type>2</edge_type>
<source_obj>106</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_465">
<id>467</id>
<edge_type>2</edge_type>
<source_obj>199</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_466">
<id>468</id>
<edge_type>2</edge_type>
<source_obj>80</source_obj>
<sink_obj>194</sink_obj>
</item>
<item class_id_reference="20" object_id="_467">
<id>469</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_468">
<id>471</id>
<edge_type>1</edge_type>
<source_obj>470</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_469">
<id>472</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_470">
<id>473</id>
<edge_type>1</edge_type>
<source_obj>454</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_471">
<id>474</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_472">
<id>475</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_473">
<id>477</id>
<edge_type>1</edge_type>
<source_obj>476</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_474">
<id>478</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_475">
<id>479</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_476">
<id>480</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_477">
<id>481</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_478">
<id>482</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_479">
<id>483</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_480">
<id>484</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_481">
<id>485</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_482">
<id>486</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_483">
<id>487</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_484">
<id>490</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_485">
<id>491</id>
<edge_type>1</edge_type>
<source_obj>449</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_486">
<id>494</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_487">
<id>496</id>
<edge_type>1</edge_type>
<source_obj>495</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_488">
<id>497</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_489">
<id>498</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_490">
<id>499</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>97</sink_obj>
</item>
<item class_id_reference="20" object_id="_491">
<id>500</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>97</sink_obj>
</item>
<item class_id_reference="20" object_id="_492">
<id>501</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_493">
<id>502</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>99</sink_obj>
</item>
<item class_id_reference="20" object_id="_494">
<id>503</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>99</sink_obj>
</item>
<item class_id_reference="20" object_id="_495">
<id>504</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_496">
<id>506</id>
<edge_type>1</edge_type>
<source_obj>505</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_497">
<id>507</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_498">
<id>509</id>
<edge_type>1</edge_type>
<source_obj>508</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_499">
<id>510</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_500">
<id>511</id>
<edge_type>1</edge_type>
<source_obj>444</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_501">
<id>512</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_502">
<id>513</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_503">
<id>514</id>
<edge_type>2</edge_type>
<source_obj>109</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_504">
<id>517</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>107</sink_obj>
</item>
<item class_id_reference="20" object_id="_505">
<id>519</id>
<edge_type>1</edge_type>
<source_obj>518</source_obj>
<sink_obj>107</sink_obj>
</item>
<item class_id_reference="20" object_id="_506">
<id>520</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>108</sink_obj>
</item>
<item class_id_reference="20" object_id="_507">
<id>523</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_508">
<id>524</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_509">
<id>525</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_510">
<id>526</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>112</sink_obj>
</item>
<item class_id_reference="20" object_id="_511">
<id>527</id>
<edge_type>1</edge_type>
<source_obj>112</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_512">
<id>528</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_513">
<id>529</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>114</sink_obj>
</item>
<item class_id_reference="20" object_id="_514">
<id>530</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_515">
<id>532</id>
<edge_type>1</edge_type>
<source_obj>531</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_516">
<id>533</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_517">
<id>534</id>
<edge_type>1</edge_type>
<source_obj>508</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_518">
<id>535</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_519">
<id>538</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>118</sink_obj>
</item>
<item class_id_reference="20" object_id="_520">
<id>540</id>
<edge_type>1</edge_type>
<source_obj>539</source_obj>
<sink_obj>118</sink_obj>
</item>
<item class_id_reference="20" object_id="_521">
<id>542</id>
<edge_type>1</edge_type>
<source_obj>541</source_obj>
<sink_obj>118</sink_obj>
</item>
<item class_id_reference="20" object_id="_522">
<id>543</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>119</sink_obj>
</item>
<item class_id_reference="20" object_id="_523">
<id>544</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>119</sink_obj>
</item>
<item class_id_reference="20" object_id="_524">
<id>545</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>119</sink_obj>
</item>
<item class_id_reference="20" object_id="_525">
<id>546</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>120</sink_obj>
</item>
<item class_id_reference="20" object_id="_526">
<id>547</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>120</sink_obj>
</item>
<item class_id_reference="20" object_id="_527">
<id>548</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>120</sink_obj>
</item>
<item class_id_reference="20" object_id="_528">
<id>549</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>121</sink_obj>
</item>
<item class_id_reference="20" object_id="_529">
<id>550</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>121</sink_obj>
</item>
<item class_id_reference="20" object_id="_530">
<id>551</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>121</sink_obj>
</item>
<item class_id_reference="20" object_id="_531">
<id>552</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_532">
<id>553</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_533">
<id>554</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_534">
<id>555</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>123</sink_obj>
</item>
<item class_id_reference="20" object_id="_535">
<id>556</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>123</sink_obj>
</item>
<item class_id_reference="20" object_id="_536">
<id>557</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>123</sink_obj>
</item>
<item class_id_reference="20" object_id="_537">
<id>558</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_538">
<id>559</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_539">
<id>560</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_540">
<id>561</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>125</sink_obj>
</item>
<item class_id_reference="20" object_id="_541">
<id>562</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>125</sink_obj>
</item>
<item class_id_reference="20" object_id="_542">
<id>563</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>125</sink_obj>
</item>
<item class_id_reference="20" object_id="_543">
<id>564</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>126</sink_obj>
</item>
<item class_id_reference="20" object_id="_544">
<id>565</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>126</sink_obj>
</item>
<item class_id_reference="20" object_id="_545">
<id>566</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>126</sink_obj>
</item>
<item class_id_reference="20" object_id="_546">
<id>567</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>127</sink_obj>
</item>
<item class_id_reference="20" object_id="_547">
<id>568</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>127</sink_obj>
</item>
<item class_id_reference="20" object_id="_548">
<id>569</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>127</sink_obj>
</item>
<item class_id_reference="20" object_id="_549">
<id>570</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>128</sink_obj>
</item>
<item class_id_reference="20" object_id="_550">
<id>571</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>128</sink_obj>
</item>
<item class_id_reference="20" object_id="_551">
<id>572</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>128</sink_obj>
</item>
<item class_id_reference="20" object_id="_552">
<id>573</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>129</sink_obj>
</item>
<item class_id_reference="20" object_id="_553">
<id>574</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>129</sink_obj>
</item>
<item class_id_reference="20" object_id="_554">
<id>575</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>129</sink_obj>
</item>
<item class_id_reference="20" object_id="_555">
<id>576</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>130</sink_obj>
</item>
<item class_id_reference="20" object_id="_556">
<id>577</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>130</sink_obj>
</item>
<item class_id_reference="20" object_id="_557">
<id>578</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>130</sink_obj>
</item>
<item class_id_reference="20" object_id="_558">
<id>579</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>131</sink_obj>
</item>
<item class_id_reference="20" object_id="_559">
<id>580</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>131</sink_obj>
</item>
<item class_id_reference="20" object_id="_560">
<id>581</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>131</sink_obj>
</item>
<item class_id_reference="20" object_id="_561">
<id>582</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>132</sink_obj>
</item>
<item class_id_reference="20" object_id="_562">
<id>583</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>132</sink_obj>
</item>
<item class_id_reference="20" object_id="_563">
<id>584</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>132</sink_obj>
</item>
<item class_id_reference="20" object_id="_564">
<id>585</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>133</sink_obj>
</item>
<item class_id_reference="20" object_id="_565">
<id>586</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>133</sink_obj>
</item>
<item class_id_reference="20" object_id="_566">
<id>587</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>133</sink_obj>
</item>
<item class_id_reference="20" object_id="_567">
<id>588</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>134</sink_obj>
</item>
<item class_id_reference="20" object_id="_568">
<id>589</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>134</sink_obj>
</item>
<item class_id_reference="20" object_id="_569">
<id>590</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>134</sink_obj>
</item>
<item class_id_reference="20" object_id="_570">
<id>591</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>135</sink_obj>
</item>
<item class_id_reference="20" object_id="_571">
<id>592</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>135</sink_obj>
</item>
<item class_id_reference="20" object_id="_572">
<id>593</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>135</sink_obj>
</item>
<item class_id_reference="20" object_id="_573">
<id>594</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>136</sink_obj>
</item>
<item class_id_reference="20" object_id="_574">
<id>595</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>136</sink_obj>
</item>
<item class_id_reference="20" object_id="_575">
<id>596</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>136</sink_obj>
</item>
<item class_id_reference="20" object_id="_576">
<id>597</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_577">
<id>598</id>
<edge_type>2</edge_type>
<source_obj>192</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_578">
<id>599</id>
<edge_type>1</edge_type>
<source_obj>449</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_579">
<id>600</id>
<edge_type>2</edge_type>
<source_obj>189</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_580">
<id>601</id>
<edge_type>1</edge_type>
<source_obj>476</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_581">
<id>602</id>
<edge_type>2</edge_type>
<source_obj>186</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_582">
<id>604</id>
<edge_type>1</edge_type>
<source_obj>603</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_583">
<id>605</id>
<edge_type>2</edge_type>
<source_obj>183</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_584">
<id>607</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_585">
<id>608</id>
<edge_type>2</edge_type>
<source_obj>180</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_586">
<id>610</id>
<edge_type>1</edge_type>
<source_obj>609</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_587">
<id>611</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_588">
<id>613</id>
<edge_type>1</edge_type>
<source_obj>612</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_589">
<id>614</id>
<edge_type>2</edge_type>
<source_obj>174</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_590">
<id>616</id>
<edge_type>1</edge_type>
<source_obj>615</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_591">
<id>617</id>
<edge_type>2</edge_type>
<source_obj>171</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_592">
<id>619</id>
<edge_type>1</edge_type>
<source_obj>618</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_593">
<id>620</id>
<edge_type>2</edge_type>
<source_obj>168</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_594">
<id>622</id>
<edge_type>1</edge_type>
<source_obj>621</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_595">
<id>623</id>
<edge_type>2</edge_type>
<source_obj>165</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_596">
<id>625</id>
<edge_type>1</edge_type>
<source_obj>624</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_597">
<id>626</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_598">
<id>628</id>
<edge_type>1</edge_type>
<source_obj>627</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_599">
<id>629</id>
<edge_type>2</edge_type>
<source_obj>159</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_600">
<id>631</id>
<edge_type>1</edge_type>
<source_obj>630</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_601">
<id>632</id>
<edge_type>2</edge_type>
<source_obj>156</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_602">
<id>634</id>
<edge_type>1</edge_type>
<source_obj>633</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_603">
<id>635</id>
<edge_type>2</edge_type>
<source_obj>153</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_604">
<id>637</id>
<edge_type>1</edge_type>
<source_obj>636</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_605">
<id>638</id>
<edge_type>2</edge_type>
<source_obj>150</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_606">
<id>640</id>
<edge_type>1</edge_type>
<source_obj>639</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_607">
<id>641</id>
<edge_type>2</edge_type>
<source_obj>147</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_608">
<id>643</id>
<edge_type>1</edge_type>
<source_obj>642</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_609">
<id>644</id>
<edge_type>2</edge_type>
<source_obj>144</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_610">
<id>646</id>
<edge_type>1</edge_type>
<source_obj>645</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_611">
<id>647</id>
<edge_type>2</edge_type>
<source_obj>141</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_612">
<id>648</id>
<edge_type>1</edge_type>
<source_obj>444</source_obj>
<sink_obj>200</sink_obj>
</item>
<item class_id_reference="20" object_id="_613">
<id>649</id>
<edge_type>2</edge_type>
<source_obj>199</source_obj>
<sink_obj>200</sink_obj>
</item>
<item class_id_reference="20" object_id="_614">
<id>650</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>200</sink_obj>
</item>
<item class_id_reference="20" object_id="_615">
<id>651</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>200</sink_obj>
</item>
<item class_id_reference="20" object_id="_616">
<id>652</id>
<edge_type>1</edge_type>
<source_obj>449</source_obj>
<sink_obj>201</sink_obj>
</item>
<item class_id_reference="20" object_id="_617">
<id>653</id>
<edge_type>2</edge_type>
<source_obj>199</source_obj>
<sink_obj>201</sink_obj>
</item>
<item class_id_reference="20" object_id="_618">
<id>654</id>
<edge_type>1</edge_type>
<source_obj>212</source_obj>
<sink_obj>201</sink_obj>
</item>
<item class_id_reference="20" object_id="_619">
<id>655</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>201</sink_obj>
</item>
<item class_id_reference="20" object_id="_620">
<id>656</id>
<edge_type>1</edge_type>
<source_obj>454</source_obj>
<sink_obj>202</sink_obj>
</item>
<item class_id_reference="20" object_id="_621">
<id>657</id>
<edge_type>2</edge_type>
<source_obj>199</source_obj>
<sink_obj>202</sink_obj>
</item>
<item class_id_reference="20" object_id="_622">
<id>658</id>
<edge_type>1</edge_type>
<source_obj>227</source_obj>
<sink_obj>202</sink_obj>
</item>
<item class_id_reference="20" object_id="_623">
<id>659</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>202</sink_obj>
</item>
<item class_id_reference="20" object_id="_624">
<id>660</id>
<edge_type>1</edge_type>
<source_obj>200</source_obj>
<sink_obj>203</sink_obj>
</item>
<item class_id_reference="20" object_id="_625">
<id>661</id>
<edge_type>1</edge_type>
<source_obj>460</source_obj>
<sink_obj>203</sink_obj>
</item>
<item class_id_reference="20" object_id="_626">
<id>662</id>
<edge_type>1</edge_type>
<source_obj>200</source_obj>
<sink_obj>204</sink_obj>
</item>
<item class_id_reference="20" object_id="_627">
<id>663</id>
<edge_type>1</edge_type>
<source_obj>463</source_obj>
<sink_obj>204</sink_obj>
</item>
<item class_id_reference="20" object_id="_628">
<id>664</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>205</sink_obj>
</item>
<item class_id_reference="20" object_id="_629">
<id>665</id>
<edge_type>2</edge_type>
<source_obj>231</source_obj>
<sink_obj>205</sink_obj>
</item>
<item class_id_reference="20" object_id="_630">
<id>666</id>
<edge_type>2</edge_type>
<source_obj>336</source_obj>
<sink_obj>205</sink_obj>
</item>
<item class_id_reference="20" object_id="_631">
<id>667</id>
<edge_type>2</edge_type>
<source_obj>206</source_obj>
<sink_obj>319</sink_obj>
</item>
<item class_id_reference="20" object_id="_632">
<id>668</id>
<edge_type>1</edge_type>
<source_obj>202</source_obj>
<sink_obj>209</sink_obj>
</item>
<item class_id_reference="20" object_id="_633">
<id>669</id>
<edge_type>1</edge_type>
<source_obj>470</source_obj>
<sink_obj>209</sink_obj>
</item>
<item class_id_reference="20" object_id="_634">
<id>670</id>
<edge_type>1</edge_type>
<source_obj>209</source_obj>
<sink_obj>210</sink_obj>
</item>
<item class_id_reference="20" object_id="_635">
<id>671</id>
<edge_type>1</edge_type>
<source_obj>454</source_obj>
<sink_obj>210</sink_obj>
</item>
<item class_id_reference="20" object_id="_636">
<id>672</id>
<edge_type>1</edge_type>
<source_obj>202</source_obj>
<sink_obj>210</sink_obj>
</item>
<item class_id_reference="20" object_id="_637">
<id>673</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>211</sink_obj>
</item>
<item class_id_reference="20" object_id="_638">
<id>674</id>
<edge_type>1</edge_type>
<source_obj>476</source_obj>
<sink_obj>211</sink_obj>
</item>
<item class_id_reference="20" object_id="_639">
<id>675</id>
<edge_type>1</edge_type>
<source_obj>209</source_obj>
<sink_obj>212</sink_obj>
</item>
<item class_id_reference="20" object_id="_640">
<id>676</id>
<edge_type>1</edge_type>
<source_obj>211</source_obj>
<sink_obj>212</sink_obj>
</item>
<item class_id_reference="20" object_id="_641">
<id>677</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>212</sink_obj>
</item>
<item class_id_reference="20" object_id="_642">
<id>678</id>
<edge_type>1</edge_type>
<source_obj>212</source_obj>
<sink_obj>213</sink_obj>
</item>
<item class_id_reference="20" object_id="_643">
<id>679</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>214</sink_obj>
</item>
<item class_id_reference="20" object_id="_644">
<id>680</id>
<edge_type>1</edge_type>
<source_obj>213</source_obj>
<sink_obj>214</sink_obj>
</item>
<item class_id_reference="20" object_id="_645">
<id>681</id>
<edge_type>1</edge_type>
<source_obj>214</source_obj>
<sink_obj>215</sink_obj>
</item>
<item class_id_reference="20" object_id="_646">
<id>682</id>
<edge_type>1</edge_type>
<source_obj>197</source_obj>
<sink_obj>216</sink_obj>
</item>
<item class_id_reference="20" object_id="_647">
<id>683</id>
<edge_type>1</edge_type>
<source_obj>215</source_obj>
<sink_obj>216</sink_obj>
</item>
<item class_id_reference="20" object_id="_648">
<id>685</id>
<edge_type>1</edge_type>
<source_obj>212</source_obj>
<sink_obj>217</sink_obj>
</item>
<item class_id_reference="20" object_id="_649">
<id>686</id>
<edge_type>1</edge_type>
<source_obj>449</source_obj>
<sink_obj>217</sink_obj>
</item>
<item class_id_reference="20" object_id="_650">
<id>688</id>
<edge_type>1</edge_type>
<source_obj>212</source_obj>
<sink_obj>218</sink_obj>
</item>
<item class_id_reference="20" object_id="_651">
<id>689</id>
<edge_type>1</edge_type>
<source_obj>495</source_obj>
<sink_obj>218</sink_obj>
</item>
<item class_id_reference="20" object_id="_652">
<id>690</id>
<edge_type>1</edge_type>
<source_obj>218</source_obj>
<sink_obj>219</sink_obj>
</item>
<item class_id_reference="20" object_id="_653">
<id>691</id>
<edge_type>1</edge_type>
<source_obj>210</source_obj>
<sink_obj>220</sink_obj>
</item>
<item class_id_reference="20" object_id="_654">
<id>692</id>
<edge_type>1</edge_type>
<source_obj>216</source_obj>
<sink_obj>222</sink_obj>
</item>
<item class_id_reference="20" object_id="_655">
<id>693</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>222</sink_obj>
</item>
<item class_id_reference="20" object_id="_656">
<id>694</id>
<edge_type>1</edge_type>
<source_obj>222</source_obj>
<sink_obj>223</sink_obj>
</item>
<item class_id_reference="20" object_id="_657">
<id>695</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>224</sink_obj>
</item>
<item class_id_reference="20" object_id="_658">
<id>696</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>224</sink_obj>
</item>
<item class_id_reference="20" object_id="_659">
<id>697</id>
<edge_type>1</edge_type>
<source_obj>210</source_obj>
<sink_obj>227</sink_obj>
</item>
<item class_id_reference="20" object_id="_660">
<id>698</id>
<edge_type>1</edge_type>
<source_obj>505</source_obj>
<sink_obj>227</sink_obj>
</item>
<item class_id_reference="20" object_id="_661">
<id>699</id>
<edge_type>1</edge_type>
<source_obj>200</source_obj>
<sink_obj>228</sink_obj>
</item>
<item class_id_reference="20" object_id="_662">
<id>700</id>
<edge_type>1</edge_type>
<source_obj>508</source_obj>
<sink_obj>228</sink_obj>
</item>
<item class_id_reference="20" object_id="_663">
<id>701</id>
<edge_type>1</edge_type>
<source_obj>228</source_obj>
<sink_obj>229</sink_obj>
</item>
<item class_id_reference="20" object_id="_664">
<id>702</id>
<edge_type>1</edge_type>
<source_obj>444</source_obj>
<sink_obj>229</sink_obj>
</item>
<item class_id_reference="20" object_id="_665">
<id>703</id>
<edge_type>1</edge_type>
<source_obj>229</source_obj>
<sink_obj>230</sink_obj>
</item>
<item class_id_reference="20" object_id="_666">
<id>704</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>230</sink_obj>
</item>
<item class_id_reference="20" object_id="_667">
<id>705</id>
<edge_type>2</edge_type>
<source_obj>234</source_obj>
<sink_obj>230</sink_obj>
</item>
<item class_id_reference="20" object_id="_668">
<id>707</id>
<edge_type>1</edge_type>
<source_obj>224</source_obj>
<sink_obj>232</sink_obj>
</item>
<item class_id_reference="20" object_id="_669">
<id>708</id>
<edge_type>1</edge_type>
<source_obj>518</source_obj>
<sink_obj>232</sink_obj>
</item>
<item class_id_reference="20" object_id="_670">
<id>709</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>233</sink_obj>
</item>
<item class_id_reference="20" object_id="_671">
<id>711</id>
<edge_type>1</edge_type>
<source_obj>224</source_obj>
<sink_obj>235</sink_obj>
</item>
<item class_id_reference="20" object_id="_672">
<id>712</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>236</sink_obj>
</item>
<item class_id_reference="20" object_id="_673">
<id>713</id>
<edge_type>1</edge_type>
<source_obj>220</source_obj>
<sink_obj>236</sink_obj>
</item>
<item class_id_reference="20" object_id="_674">
<id>714</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>237</sink_obj>
</item>
<item class_id_reference="20" object_id="_675">
<id>715</id>
<edge_type>1</edge_type>
<source_obj>237</source_obj>
<sink_obj>238</sink_obj>
</item>
<item class_id_reference="20" object_id="_676">
<id>716</id>
<edge_type>1</edge_type>
<source_obj>217</source_obj>
<sink_obj>238</sink_obj>
</item>
<item class_id_reference="20" object_id="_677">
<id>717</id>
<edge_type>1</edge_type>
<source_obj>238</source_obj>
<sink_obj>239</sink_obj>
</item>
<item class_id_reference="20" object_id="_678">
<id>718</id>
<edge_type>1</edge_type>
<source_obj>239</source_obj>
<sink_obj>240</sink_obj>
</item>
<item class_id_reference="20" object_id="_679">
<id>719</id>
<edge_type>1</edge_type>
<source_obj>531</source_obj>
<sink_obj>240</sink_obj>
</item>
<item class_id_reference="20" object_id="_680">
<id>720</id>
<edge_type>1</edge_type>
<source_obj>238</source_obj>
<sink_obj>241</sink_obj>
</item>
<item class_id_reference="20" object_id="_681">
<id>721</id>
<edge_type>1</edge_type>
<source_obj>508</source_obj>
<sink_obj>241</sink_obj>
</item>
<item class_id_reference="20" object_id="_682">
<id>722</id>
<edge_type>1</edge_type>
<source_obj>241</source_obj>
<sink_obj>242</sink_obj>
</item>
<item class_id_reference="20" object_id="_683">
<id>724</id>
<edge_type>1</edge_type>
<source_obj>240</source_obj>
<sink_obj>243</sink_obj>
</item>
<item class_id_reference="20" object_id="_684">
<id>725</id>
<edge_type>1</edge_type>
<source_obj>539</source_obj>
<sink_obj>243</sink_obj>
</item>
<item class_id_reference="20" object_id="_685">
<id>726</id>
<edge_type>1</edge_type>
<source_obj>541</source_obj>
<sink_obj>243</sink_obj>
</item>
<item class_id_reference="20" object_id="_686">
<id>727</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>244</sink_obj>
</item>
<item class_id_reference="20" object_id="_687">
<id>728</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>244</sink_obj>
</item>
<item class_id_reference="20" object_id="_688">
<id>729</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>244</sink_obj>
</item>
<item class_id_reference="20" object_id="_689">
<id>730</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>245</sink_obj>
</item>
<item class_id_reference="20" object_id="_690">
<id>731</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>245</sink_obj>
</item>
<item class_id_reference="20" object_id="_691">
<id>732</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>245</sink_obj>
</item>
<item class_id_reference="20" object_id="_692">
<id>733</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>246</sink_obj>
</item>
<item class_id_reference="20" object_id="_693">
<id>734</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>246</sink_obj>
</item>
<item class_id_reference="20" object_id="_694">
<id>735</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>246</sink_obj>
</item>
<item class_id_reference="20" object_id="_695">
<id>736</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>247</sink_obj>
</item>
<item class_id_reference="20" object_id="_696">
<id>737</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>247</sink_obj>
</item>
<item class_id_reference="20" object_id="_697">
<id>738</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>247</sink_obj>
</item>
<item class_id_reference="20" object_id="_698">
<id>739</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>248</sink_obj>
</item>
<item class_id_reference="20" object_id="_699">
<id>740</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>248</sink_obj>
</item>
<item class_id_reference="20" object_id="_700">
<id>741</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>248</sink_obj>
</item>
<item class_id_reference="20" object_id="_701">
<id>742</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>249</sink_obj>
</item>
<item class_id_reference="20" object_id="_702">
<id>743</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>249</sink_obj>
</item>
<item class_id_reference="20" object_id="_703">
<id>744</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>249</sink_obj>
</item>
<item class_id_reference="20" object_id="_704">
<id>745</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>250</sink_obj>
</item>
<item class_id_reference="20" object_id="_705">
<id>746</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>250</sink_obj>
</item>
<item class_id_reference="20" object_id="_706">
<id>747</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>250</sink_obj>
</item>
<item class_id_reference="20" object_id="_707">
<id>748</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>251</sink_obj>
</item>
<item class_id_reference="20" object_id="_708">
<id>749</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>251</sink_obj>
</item>
<item class_id_reference="20" object_id="_709">
<id>750</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>251</sink_obj>
</item>
<item class_id_reference="20" object_id="_710">
<id>751</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>252</sink_obj>
</item>
<item class_id_reference="20" object_id="_711">
<id>752</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>252</sink_obj>
</item>
<item class_id_reference="20" object_id="_712">
<id>753</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>252</sink_obj>
</item>
<item class_id_reference="20" object_id="_713">
<id>754</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>253</sink_obj>
</item>
<item class_id_reference="20" object_id="_714">
<id>755</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>253</sink_obj>
</item>
<item class_id_reference="20" object_id="_715">
<id>756</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>253</sink_obj>
</item>
<item class_id_reference="20" object_id="_716">
<id>757</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>254</sink_obj>
</item>
<item class_id_reference="20" object_id="_717">
<id>758</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>254</sink_obj>
</item>
<item class_id_reference="20" object_id="_718">
<id>759</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>254</sink_obj>
</item>
<item class_id_reference="20" object_id="_719">
<id>760</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>255</sink_obj>
</item>
<item class_id_reference="20" object_id="_720">
<id>761</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>255</sink_obj>
</item>
<item class_id_reference="20" object_id="_721">
<id>762</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>255</sink_obj>
</item>
<item class_id_reference="20" object_id="_722">
<id>763</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>256</sink_obj>
</item>
<item class_id_reference="20" object_id="_723">
<id>764</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>256</sink_obj>
</item>
<item class_id_reference="20" object_id="_724">
<id>765</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>256</sink_obj>
</item>
<item class_id_reference="20" object_id="_725">
<id>766</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>257</sink_obj>
</item>
<item class_id_reference="20" object_id="_726">
<id>767</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>257</sink_obj>
</item>
<item class_id_reference="20" object_id="_727">
<id>768</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>257</sink_obj>
</item>
<item class_id_reference="20" object_id="_728">
<id>769</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>258</sink_obj>
</item>
<item class_id_reference="20" object_id="_729">
<id>770</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>258</sink_obj>
</item>
<item class_id_reference="20" object_id="_730">
<id>771</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>258</sink_obj>
</item>
<item class_id_reference="20" object_id="_731">
<id>772</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>259</sink_obj>
</item>
<item class_id_reference="20" object_id="_732">
<id>773</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>259</sink_obj>
</item>
<item class_id_reference="20" object_id="_733">
<id>774</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>259</sink_obj>
</item>
<item class_id_reference="20" object_id="_734">
<id>775</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>260</sink_obj>
</item>
<item class_id_reference="20" object_id="_735">
<id>776</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>260</sink_obj>
</item>
<item class_id_reference="20" object_id="_736">
<id>777</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>260</sink_obj>
</item>
<item class_id_reference="20" object_id="_737">
<id>778</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>261</sink_obj>
</item>
<item class_id_reference="20" object_id="_738">
<id>779</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>261</sink_obj>
</item>
<item class_id_reference="20" object_id="_739">
<id>780</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>261</sink_obj>
</item>
<item class_id_reference="20" object_id="_740">
<id>781</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_741">
<id>782</id>
<edge_type>2</edge_type>
<source_obj>317</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_742">
<id>783</id>
<edge_type>1</edge_type>
<source_obj>449</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_743">
<id>784</id>
<edge_type>2</edge_type>
<source_obj>314</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_744">
<id>785</id>
<edge_type>1</edge_type>
<source_obj>476</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_745">
<id>786</id>
<edge_type>2</edge_type>
<source_obj>311</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_746">
<id>787</id>
<edge_type>1</edge_type>
<source_obj>603</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_747">
<id>788</id>
<edge_type>2</edge_type>
<source_obj>308</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_748">
<id>789</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_749">
<id>790</id>
<edge_type>2</edge_type>
<source_obj>305</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_750">
<id>791</id>
<edge_type>1</edge_type>
<source_obj>609</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_751">
<id>792</id>
<edge_type>2</edge_type>
<source_obj>302</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_752">
<id>793</id>
<edge_type>1</edge_type>
<source_obj>612</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_753">
<id>794</id>
<edge_type>2</edge_type>
<source_obj>299</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_754">
<id>795</id>
<edge_type>1</edge_type>
<source_obj>615</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_755">
<id>796</id>
<edge_type>2</edge_type>
<source_obj>296</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_756">
<id>797</id>
<edge_type>1</edge_type>
<source_obj>618</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_757">
<id>798</id>
<edge_type>2</edge_type>
<source_obj>293</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_758">
<id>799</id>
<edge_type>1</edge_type>
<source_obj>621</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_759">
<id>800</id>
<edge_type>2</edge_type>
<source_obj>290</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_760">
<id>801</id>
<edge_type>1</edge_type>
<source_obj>624</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_761">
<id>802</id>
<edge_type>2</edge_type>
<source_obj>287</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_762">
<id>803</id>
<edge_type>1</edge_type>
<source_obj>627</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_763">
<id>804</id>
<edge_type>2</edge_type>
<source_obj>284</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_764">
<id>805</id>
<edge_type>1</edge_type>
<source_obj>630</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_765">
<id>806</id>
<edge_type>2</edge_type>
<source_obj>281</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_766">
<id>807</id>
<edge_type>1</edge_type>
<source_obj>633</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_767">
<id>808</id>
<edge_type>2</edge_type>
<source_obj>278</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_768">
<id>809</id>
<edge_type>1</edge_type>
<source_obj>636</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_769">
<id>810</id>
<edge_type>2</edge_type>
<source_obj>275</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_770">
<id>811</id>
<edge_type>1</edge_type>
<source_obj>639</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_771">
<id>812</id>
<edge_type>2</edge_type>
<source_obj>272</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_772">
<id>813</id>
<edge_type>1</edge_type>
<source_obj>642</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_773">
<id>814</id>
<edge_type>2</edge_type>
<source_obj>269</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_774">
<id>815</id>
<edge_type>1</edge_type>
<source_obj>645</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_775">
<id>816</id>
<edge_type>2</edge_type>
<source_obj>266</source_obj>
<sink_obj>262</sink_obj>
</item>
<item class_id_reference="20" object_id="_776">
<id>818</id>
<edge_type>1</edge_type>
<source_obj>817</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_777">
<id>819</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_778">
<id>820</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_779">
<id>821</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_780">
<id>822</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_781">
<id>823</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_782">
<id>824</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_783">
<id>825</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_784">
<id>826</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_785">
<id>827</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_786">
<id>828</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_787">
<id>829</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_788">
<id>830</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_789">
<id>831</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_790">
<id>832</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_791">
<id>833</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_792">
<id>834</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_793">
<id>835</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_794">
<id>836</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_795">
<id>837</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_796">
<id>838</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_797">
<id>840</id>
<edge_type>1</edge_type>
<source_obj>839</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_798">
<id>841</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_799">
<id>842</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_800">
<id>843</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_801">
<id>844</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_802">
<id>845</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_803">
<id>846</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_804">
<id>847</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_805">
<id>848</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_806">
<id>849</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_807">
<id>850</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_808">
<id>851</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_809">
<id>852</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_810">
<id>853</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_811">
<id>854</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_812">
<id>855</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_813">
<id>856</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_814">
<id>857</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_815">
<id>858</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_816">
<id>859</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_817">
<id>860</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_818">
<id>862</id>
<edge_type>1</edge_type>
<source_obj>861</source_obj>
<sink_obj>323</sink_obj>
</item>
<item class_id_reference="20" object_id="_819">
<id>863</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>323</sink_obj>
</item>
<item class_id_reference="20" object_id="_820">
<id>864</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>323</sink_obj>
</item>
<item class_id_reference="20" object_id="_821">
<id>865</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>323</sink_obj>
</item>
<item class_id_reference="20" object_id="_822">
<id>867</id>
<edge_type>1</edge_type>
<source_obj>866</source_obj>
<sink_obj>324</sink_obj>
</item>
<item class_id_reference="20" object_id="_823">
<id>868</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>324</sink_obj>
</item>
<item class_id_reference="20" object_id="_824">
<id>869</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>324</sink_obj>
</item>
<item class_id_reference="20" object_id="_825">
<id>870</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>324</sink_obj>
</item>
<item class_id_reference="20" object_id="_826">
<id>871</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>325</sink_obj>
</item>
<item class_id_reference="20" object_id="_827">
<id>872</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>325</sink_obj>
</item>
<item class_id_reference="20" object_id="_828">
<id>874</id>
<edge_type>1</edge_type>
<source_obj>873</source_obj>
<sink_obj>325</sink_obj>
</item>
<item class_id_reference="20" object_id="_829">
<id>875</id>
<edge_type>1</edge_type>
<source_obj>325</source_obj>
<sink_obj>326</sink_obj>
</item>
<item class_id_reference="20" object_id="_830">
<id>876</id>
<edge_type>1</edge_type>
<source_obj>326</source_obj>
<sink_obj>327</sink_obj>
</item>
<item class_id_reference="20" object_id="_831">
<id>878</id>
<edge_type>1</edge_type>
<source_obj>877</source_obj>
<sink_obj>327</sink_obj>
</item>
<item class_id_reference="20" object_id="_832">
<id>879</id>
<edge_type>1</edge_type>
<source_obj>326</source_obj>
<sink_obj>328</sink_obj>
</item>
<item class_id_reference="20" object_id="_833">
<id>881</id>
<edge_type>1</edge_type>
<source_obj>880</source_obj>
<sink_obj>328</sink_obj>
</item>
<item class_id_reference="20" object_id="_834">
<id>882</id>
<edge_type>1</edge_type>
<source_obj>328</source_obj>
<sink_obj>329</sink_obj>
</item>
<item class_id_reference="20" object_id="_835">
<id>883</id>
<edge_type>1</edge_type>
<source_obj>327</source_obj>
<sink_obj>329</sink_obj>
</item>
<item class_id_reference="20" object_id="_836">
<id>886</id>
<edge_type>1</edge_type>
<source_obj>329</source_obj>
<sink_obj>330</sink_obj>
</item>
<item class_id_reference="20" object_id="_837">
<id>888</id>
<edge_type>1</edge_type>
<source_obj>887</source_obj>
<sink_obj>330</sink_obj>
</item>
<item class_id_reference="20" object_id="_838">
<id>890</id>
<edge_type>1</edge_type>
<source_obj>889</source_obj>
<sink_obj>330</sink_obj>
</item>
<item class_id_reference="20" object_id="_839">
<id>891</id>
<edge_type>1</edge_type>
<source_obj>330</source_obj>
<sink_obj>331</sink_obj>
</item>
<item class_id_reference="20" object_id="_840">
<id>892</id>
<edge_type>2</edge_type>
<source_obj>342</source_obj>
<sink_obj>335</sink_obj>
</item>
<item class_id_reference="20" object_id="_841">
<id>894</id>
<edge_type>1</edge_type>
<source_obj>893</source_obj>
<sink_obj>337</sink_obj>
</item>
<item class_id_reference="20" object_id="_842">
<id>895</id>
<edge_type>2</edge_type>
<source_obj>336</source_obj>
<sink_obj>337</sink_obj>
</item>
<item class_id_reference="20" object_id="_843">
<id>896</id>
<edge_type>1</edge_type>
<source_obj>372</source_obj>
<sink_obj>337</sink_obj>
</item>
<item class_id_reference="20" object_id="_844">
<id>897</id>
<edge_type>2</edge_type>
<source_obj>375</source_obj>
<sink_obj>337</sink_obj>
</item>
<item class_id_reference="20" object_id="_845">
<id>899</id>
<edge_type>1</edge_type>
<source_obj>898</source_obj>
<sink_obj>338</sink_obj>
</item>
<item class_id_reference="20" object_id="_846">
<id>900</id>
<edge_type>2</edge_type>
<source_obj>336</source_obj>
<sink_obj>338</sink_obj>
</item>
<item class_id_reference="20" object_id="_847">
<id>901</id>
<edge_type>1</edge_type>
<source_obj>340</source_obj>
<sink_obj>338</sink_obj>
</item>
<item class_id_reference="20" object_id="_848">
<id>902</id>
<edge_type>2</edge_type>
<source_obj>375</source_obj>
<sink_obj>338</sink_obj>
</item>
<item class_id_reference="20" object_id="_849">
<id>903</id>
<edge_type>1</edge_type>
<source_obj>338</source_obj>
<sink_obj>339</sink_obj>
</item>
<item class_id_reference="20" object_id="_850">
<id>905</id>
<edge_type>1</edge_type>
<source_obj>904</source_obj>
<sink_obj>339</sink_obj>
</item>
<item class_id_reference="20" object_id="_851">
<id>906</id>
<edge_type>1</edge_type>
<source_obj>338</source_obj>
<sink_obj>340</sink_obj>
</item>
<item class_id_reference="20" object_id="_852">
<id>908</id>
<edge_type>1</edge_type>
<source_obj>907</source_obj>
<sink_obj>340</sink_obj>
</item>
<item class_id_reference="20" object_id="_853">
<id>909</id>
<edge_type>1</edge_type>
<source_obj>339</source_obj>
<sink_obj>341</sink_obj>
</item>
<item class_id_reference="20" object_id="_854">
<id>910</id>
<edge_type>2</edge_type>
<source_obj>375</source_obj>
<sink_obj>341</sink_obj>
</item>
<item class_id_reference="20" object_id="_855">
<id>911</id>
<edge_type>2</edge_type>
<source_obj>380</source_obj>
<sink_obj>341</sink_obj>
</item>
<item class_id_reference="20" object_id="_856">
<id>912</id>
<edge_type>1</edge_type>
<source_obj>338</source_obj>
<sink_obj>343</sink_obj>
</item>
<item class_id_reference="20" object_id="_857">
<id>913</id>
<edge_type>1</edge_type>
<source_obj>338</source_obj>
<sink_obj>344</sink_obj>
</item>
<item class_id_reference="20" object_id="_858">
<id>914</id>
<edge_type>1</edge_type>
<source_obj>338</source_obj>
<sink_obj>349</sink_obj>
</item>
<item class_id_reference="20" object_id="_859">
<id>915</id>
<edge_type>1</edge_type>
<source_obj>331</source_obj>
<sink_obj>350</sink_obj>
</item>
<item class_id_reference="20" object_id="_860">
<id>916</id>
<edge_type>1</edge_type>
<source_obj>343</source_obj>
<sink_obj>350</sink_obj>
</item>
<item class_id_reference="20" object_id="_861">
<id>917</id>
<edge_type>1</edge_type>
<source_obj>350</source_obj>
<sink_obj>351</sink_obj>
</item>
<item class_id_reference="20" object_id="_862">
<id>918</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>352</sink_obj>
</item>
<item class_id_reference="20" object_id="_863">
<id>919</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>352</sink_obj>
</item>
<item class_id_reference="20" object_id="_864">
<id>920</id>
<edge_type>1</edge_type>
<source_obj>349</source_obj>
<sink_obj>352</sink_obj>
</item>
<item class_id_reference="20" object_id="_865">
<id>921</id>
<edge_type>1</edge_type>
<source_obj>352</source_obj>
<sink_obj>353</sink_obj>
</item>
<item class_id_reference="20" object_id="_866">
<id>922</id>
<edge_type>1</edge_type>
<source_obj>353</source_obj>
<sink_obj>354</sink_obj>
</item>
<item class_id_reference="20" object_id="_867">
<id>923</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>355</sink_obj>
</item>
<item class_id_reference="20" object_id="_868">
<id>924</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>355</sink_obj>
</item>
<item class_id_reference="20" object_id="_869">
<id>925</id>
<edge_type>1</edge_type>
<source_obj>351</source_obj>
<sink_obj>355</sink_obj>
</item>
<item class_id_reference="20" object_id="_870">
<id>926</id>
<edge_type>1</edge_type>
<source_obj>355</source_obj>
<sink_obj>356</sink_obj>
</item>
<item class_id_reference="20" object_id="_871">
<id>927</id>
<edge_type>1</edge_type>
<source_obj>356</source_obj>
<sink_obj>357</sink_obj>
</item>
<item class_id_reference="20" object_id="_872">
<id>928</id>
<edge_type>1</edge_type>
<source_obj>357</source_obj>
<sink_obj>358</sink_obj>
</item>
<item class_id_reference="20" object_id="_873">
<id>929</id>
<edge_type>1</edge_type>
<source_obj>354</source_obj>
<sink_obj>358</sink_obj>
</item>
<item class_id_reference="20" object_id="_874">
<id>930</id>
<edge_type>1</edge_type>
<source_obj>344</source_obj>
<sink_obj>359</sink_obj>
</item>
<item class_id_reference="20" object_id="_875">
<id>932</id>
<edge_type>1</edge_type>
<source_obj>931</source_obj>
<sink_obj>359</sink_obj>
</item>
<item class_id_reference="20" object_id="_876">
<id>933</id>
<edge_type>1</edge_type>
<source_obj>359</source_obj>
<sink_obj>360</sink_obj>
</item>
<item class_id_reference="20" object_id="_877">
<id>934</id>
<edge_type>1</edge_type>
<source_obj>360</source_obj>
<sink_obj>361</sink_obj>
</item>
<item class_id_reference="20" object_id="_878">
<id>935</id>
<edge_type>1</edge_type>
<source_obj>331</source_obj>
<sink_obj>361</sink_obj>
</item>
<item class_id_reference="20" object_id="_879">
<id>936</id>
<edge_type>1</edge_type>
<source_obj>361</source_obj>
<sink_obj>362</sink_obj>
</item>
<item class_id_reference="20" object_id="_880">
<id>937</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>363</sink_obj>
</item>
<item class_id_reference="20" object_id="_881">
<id>938</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>363</sink_obj>
</item>
<item class_id_reference="20" object_id="_882">
<id>939</id>
<edge_type>1</edge_type>
<source_obj>349</source_obj>
<sink_obj>363</sink_obj>
</item>
<item class_id_reference="20" object_id="_883">
<id>940</id>
<edge_type>1</edge_type>
<source_obj>363</source_obj>
<sink_obj>364</sink_obj>
</item>
<item class_id_reference="20" object_id="_884">
<id>941</id>
<edge_type>1</edge_type>
<source_obj>364</source_obj>
<sink_obj>365</sink_obj>
</item>
<item class_id_reference="20" object_id="_885">
<id>942</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>366</sink_obj>
</item>
<item class_id_reference="20" object_id="_886">
<id>943</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>366</sink_obj>
</item>
<item class_id_reference="20" object_id="_887">
<id>944</id>
<edge_type>1</edge_type>
<source_obj>362</source_obj>
<sink_obj>366</sink_obj>
</item>
<item class_id_reference="20" object_id="_888">
<id>945</id>
<edge_type>1</edge_type>
<source_obj>366</source_obj>
<sink_obj>367</sink_obj>
</item>
<item class_id_reference="20" object_id="_889">
<id>946</id>
<edge_type>1</edge_type>
<source_obj>367</source_obj>
<sink_obj>368</sink_obj>
</item>
<item class_id_reference="20" object_id="_890">
<id>947</id>
<edge_type>1</edge_type>
<source_obj>368</source_obj>
<sink_obj>369</sink_obj>
</item>
<item class_id_reference="20" object_id="_891">
<id>948</id>
<edge_type>1</edge_type>
<source_obj>365</source_obj>
<sink_obj>369</sink_obj>
</item>
<item class_id_reference="20" object_id="_892">
<id>949</id>
<edge_type>1</edge_type>
<source_obj>369</source_obj>
<sink_obj>370</sink_obj>
</item>
<item class_id_reference="20" object_id="_893">
<id>950</id>
<edge_type>1</edge_type>
<source_obj>358</source_obj>
<sink_obj>370</sink_obj>
</item>
<item class_id_reference="20" object_id="_894">
<id>951</id>
<edge_type>1</edge_type>
<source_obj>370</source_obj>
<sink_obj>371</sink_obj>
</item>
<item class_id_reference="20" object_id="_895">
<id>952</id>
<edge_type>1</edge_type>
<source_obj>337</source_obj>
<sink_obj>372</sink_obj>
</item>
<item class_id_reference="20" object_id="_896">
<id>953</id>
<edge_type>1</edge_type>
<source_obj>371</source_obj>
<sink_obj>372</sink_obj>
</item>
<item class_id_reference="20" object_id="_897">
<id>954</id>
<edge_type>2</edge_type>
<source_obj>342</source_obj>
<sink_obj>374</sink_obj>
</item>
<item class_id_reference="20" object_id="_898">
<id>955</id>
<edge_type>1</edge_type>
<source_obj>337</source_obj>
<sink_obj>376</sink_obj>
</item>
<item class_id_reference="20" object_id="_899">
<id>956</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>377</sink_obj>
</item>
<item class_id_reference="20" object_id="_900">
<id>957</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>377</sink_obj>
</item>
<item class_id_reference="20" object_id="_901">
<id>959</id>
<edge_type>1</edge_type>
<source_obj>958</source_obj>
<sink_obj>377</sink_obj>
</item>
<item class_id_reference="20" object_id="_902">
<id>960</id>
<edge_type>1</edge_type>
<source_obj>376</source_obj>
<sink_obj>378</sink_obj>
</item>
<item class_id_reference="20" object_id="_903">
<id>961</id>
<edge_type>1</edge_type>
<source_obj>377</source_obj>
<sink_obj>378</sink_obj>
</item>
<item class_id_reference="20" object_id="_904">
<id>962</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>187</sink_obj>
</item>
<item class_id_reference="20" object_id="_905">
<id>963</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>187</sink_obj>
</item>
<item class_id_reference="20" object_id="_906">
<id>964</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>188</sink_obj>
</item>
<item class_id_reference="20" object_id="_907">
<id>965</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>184</sink_obj>
</item>
<item class_id_reference="20" object_id="_908">
<id>966</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>184</sink_obj>
</item>
<item class_id_reference="20" object_id="_909">
<id>967</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>185</sink_obj>
</item>
<item class_id_reference="20" object_id="_910">
<id>968</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>181</sink_obj>
</item>
<item class_id_reference="20" object_id="_911">
<id>969</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>181</sink_obj>
</item>
<item class_id_reference="20" object_id="_912">
<id>970</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>182</sink_obj>
</item>
<item class_id_reference="20" object_id="_913">
<id>971</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>178</sink_obj>
</item>
<item class_id_reference="20" object_id="_914">
<id>972</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>178</sink_obj>
</item>
<item class_id_reference="20" object_id="_915">
<id>973</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>179</sink_obj>
</item>
<item class_id_reference="20" object_id="_916">
<id>974</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>175</sink_obj>
</item>
<item class_id_reference="20" object_id="_917">
<id>975</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>175</sink_obj>
</item>
<item class_id_reference="20" object_id="_918">
<id>976</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>176</sink_obj>
</item>
<item class_id_reference="20" object_id="_919">
<id>977</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>172</sink_obj>
</item>
<item class_id_reference="20" object_id="_920">
<id>978</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>172</sink_obj>
</item>
<item class_id_reference="20" object_id="_921">
<id>979</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>173</sink_obj>
</item>
<item class_id_reference="20" object_id="_922">
<id>980</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>169</sink_obj>
</item>
<item class_id_reference="20" object_id="_923">
<id>981</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>169</sink_obj>
</item>
<item class_id_reference="20" object_id="_924">
<id>982</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>170</sink_obj>
</item>
<item class_id_reference="20" object_id="_925">
<id>983</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>166</sink_obj>
</item>
<item class_id_reference="20" object_id="_926">
<id>984</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>166</sink_obj>
</item>
<item class_id_reference="20" object_id="_927">
<id>985</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>167</sink_obj>
</item>
<item class_id_reference="20" object_id="_928">
<id>986</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>163</sink_obj>
</item>
<item class_id_reference="20" object_id="_929">
<id>987</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>163</sink_obj>
</item>
<item class_id_reference="20" object_id="_930">
<id>988</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>164</sink_obj>
</item>
<item class_id_reference="20" object_id="_931">
<id>989</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>160</sink_obj>
</item>
<item class_id_reference="20" object_id="_932">
<id>990</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>160</sink_obj>
</item>
<item class_id_reference="20" object_id="_933">
<id>991</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>161</sink_obj>
</item>
<item class_id_reference="20" object_id="_934">
<id>992</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>157</sink_obj>
</item>
<item class_id_reference="20" object_id="_935">
<id>993</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>157</sink_obj>
</item>
<item class_id_reference="20" object_id="_936">
<id>994</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>158</sink_obj>
</item>
<item class_id_reference="20" object_id="_937">
<id>995</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>154</sink_obj>
</item>
<item class_id_reference="20" object_id="_938">
<id>996</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>154</sink_obj>
</item>
<item class_id_reference="20" object_id="_939">
<id>997</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>155</sink_obj>
</item>
<item class_id_reference="20" object_id="_940">
<id>998</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>151</sink_obj>
</item>
<item class_id_reference="20" object_id="_941">
<id>999</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>151</sink_obj>
</item>
<item class_id_reference="20" object_id="_942">
<id>1000</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>152</sink_obj>
</item>
<item class_id_reference="20" object_id="_943">
<id>1001</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>148</sink_obj>
</item>
<item class_id_reference="20" object_id="_944">
<id>1002</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>148</sink_obj>
</item>
<item class_id_reference="20" object_id="_945">
<id>1003</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>149</sink_obj>
</item>
<item class_id_reference="20" object_id="_946">
<id>1004</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>145</sink_obj>
</item>
<item class_id_reference="20" object_id="_947">
<id>1005</id>
<edge_type>1</edge_type>
<source_obj>133</source_obj>
<sink_obj>145</sink_obj>
</item>
<item class_id_reference="20" object_id="_948">
<id>1006</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>146</sink_obj>
</item>
<item class_id_reference="20" object_id="_949">
<id>1007</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>142</sink_obj>
</item>
<item class_id_reference="20" object_id="_950">
<id>1008</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>142</sink_obj>
</item>
<item class_id_reference="20" object_id="_951">
<id>1009</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>143</sink_obj>
</item>
<item class_id_reference="20" object_id="_952">
<id>1010</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>139</sink_obj>
</item>
<item class_id_reference="20" object_id="_953">
<id>1011</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>139</sink_obj>
</item>
<item class_id_reference="20" object_id="_954">
<id>1012</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>140</sink_obj>
</item>
<item class_id_reference="20" object_id="_955">
<id>1013</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>190</sink_obj>
</item>
<item class_id_reference="20" object_id="_956">
<id>1014</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>190</sink_obj>
</item>
<item class_id_reference="20" object_id="_957">
<id>1015</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>191</sink_obj>
</item>
<item class_id_reference="20" object_id="_958">
<id>1016</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>312</sink_obj>
</item>
<item class_id_reference="20" object_id="_959">
<id>1017</id>
<edge_type>1</edge_type>
<source_obj>244</source_obj>
<sink_obj>312</sink_obj>
</item>
<item class_id_reference="20" object_id="_960">
<id>1018</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>313</sink_obj>
</item>
<item class_id_reference="20" object_id="_961">
<id>1019</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>309</sink_obj>
</item>
<item class_id_reference="20" object_id="_962">
<id>1020</id>
<edge_type>1</edge_type>
<source_obj>245</source_obj>
<sink_obj>309</sink_obj>
</item>
<item class_id_reference="20" object_id="_963">
<id>1021</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>310</sink_obj>
</item>
<item class_id_reference="20" object_id="_964">
<id>1022</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>306</sink_obj>
</item>
<item class_id_reference="20" object_id="_965">
<id>1023</id>
<edge_type>1</edge_type>
<source_obj>246</source_obj>
<sink_obj>306</sink_obj>
</item>
<item class_id_reference="20" object_id="_966">
<id>1024</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>307</sink_obj>
</item>
<item class_id_reference="20" object_id="_967">
<id>1025</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>303</sink_obj>
</item>
<item class_id_reference="20" object_id="_968">
<id>1026</id>
<edge_type>1</edge_type>
<source_obj>247</source_obj>
<sink_obj>303</sink_obj>
</item>
<item class_id_reference="20" object_id="_969">
<id>1027</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>304</sink_obj>
</item>
<item class_id_reference="20" object_id="_970">
<id>1028</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>300</sink_obj>
</item>
<item class_id_reference="20" object_id="_971">
<id>1029</id>
<edge_type>1</edge_type>
<source_obj>248</source_obj>
<sink_obj>300</sink_obj>
</item>
<item class_id_reference="20" object_id="_972">
<id>1030</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>301</sink_obj>
</item>
<item class_id_reference="20" object_id="_973">
<id>1031</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>297</sink_obj>
</item>
<item class_id_reference="20" object_id="_974">
<id>1032</id>
<edge_type>1</edge_type>
<source_obj>249</source_obj>
<sink_obj>297</sink_obj>
</item>
<item class_id_reference="20" object_id="_975">
<id>1033</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>298</sink_obj>
</item>
<item class_id_reference="20" object_id="_976">
<id>1034</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>294</sink_obj>
</item>
<item class_id_reference="20" object_id="_977">
<id>1035</id>
<edge_type>1</edge_type>
<source_obj>250</source_obj>
<sink_obj>294</sink_obj>
</item>
<item class_id_reference="20" object_id="_978">
<id>1036</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>295</sink_obj>
</item>
<item class_id_reference="20" object_id="_979">
<id>1037</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>291</sink_obj>
</item>
<item class_id_reference="20" object_id="_980">
<id>1038</id>
<edge_type>1</edge_type>
<source_obj>251</source_obj>
<sink_obj>291</sink_obj>
</item>
<item class_id_reference="20" object_id="_981">
<id>1039</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>292</sink_obj>
</item>
<item class_id_reference="20" object_id="_982">
<id>1040</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>288</sink_obj>
</item>
<item class_id_reference="20" object_id="_983">
<id>1041</id>
<edge_type>1</edge_type>
<source_obj>252</source_obj>
<sink_obj>288</sink_obj>
</item>
<item class_id_reference="20" object_id="_984">
<id>1042</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>289</sink_obj>
</item>
<item class_id_reference="20" object_id="_985">
<id>1043</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>285</sink_obj>
</item>
<item class_id_reference="20" object_id="_986">
<id>1044</id>
<edge_type>1</edge_type>
<source_obj>253</source_obj>
<sink_obj>285</sink_obj>
</item>
<item class_id_reference="20" object_id="_987">
<id>1045</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>286</sink_obj>
</item>
<item class_id_reference="20" object_id="_988">
<id>1046</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>282</sink_obj>
</item>
<item class_id_reference="20" object_id="_989">
<id>1047</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>282</sink_obj>
</item>
<item class_id_reference="20" object_id="_990">
<id>1048</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>283</sink_obj>
</item>
<item class_id_reference="20" object_id="_991">
<id>1049</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>279</sink_obj>
</item>
<item class_id_reference="20" object_id="_992">
<id>1050</id>
<edge_type>1</edge_type>
<source_obj>255</source_obj>
<sink_obj>279</sink_obj>
</item>
<item class_id_reference="20" object_id="_993">
<id>1051</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>280</sink_obj>
</item>
<item class_id_reference="20" object_id="_994">
<id>1052</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>276</sink_obj>
</item>
<item class_id_reference="20" object_id="_995">
<id>1053</id>
<edge_type>1</edge_type>
<source_obj>256</source_obj>
<sink_obj>276</sink_obj>
</item>
<item class_id_reference="20" object_id="_996">
<id>1054</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>277</sink_obj>
</item>
<item class_id_reference="20" object_id="_997">
<id>1055</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>273</sink_obj>
</item>
<item class_id_reference="20" object_id="_998">
<id>1056</id>
<edge_type>1</edge_type>
<source_obj>257</source_obj>
<sink_obj>273</sink_obj>
</item>
<item class_id_reference="20" object_id="_999">
<id>1057</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>274</sink_obj>
</item>
<item class_id_reference="20" object_id="_1000">
<id>1058</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>270</sink_obj>
</item>
<item class_id_reference="20" object_id="_1001">
<id>1059</id>
<edge_type>1</edge_type>
<source_obj>258</source_obj>
<sink_obj>270</sink_obj>
</item>
<item class_id_reference="20" object_id="_1002">
<id>1060</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>271</sink_obj>
</item>
<item class_id_reference="20" object_id="_1003">
<id>1061</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>267</sink_obj>
</item>
<item class_id_reference="20" object_id="_1004">
<id>1062</id>
<edge_type>1</edge_type>
<source_obj>259</source_obj>
<sink_obj>267</sink_obj>
</item>
<item class_id_reference="20" object_id="_1005">
<id>1063</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>268</sink_obj>
</item>
<item class_id_reference="20" object_id="_1006">
<id>1064</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>264</sink_obj>
</item>
<item class_id_reference="20" object_id="_1007">
<id>1065</id>
<edge_type>1</edge_type>
<source_obj>260</source_obj>
<sink_obj>264</sink_obj>
</item>
<item class_id_reference="20" object_id="_1008">
<id>1066</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>265</sink_obj>
</item>
<item class_id_reference="20" object_id="_1009">
<id>1067</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>315</sink_obj>
</item>
<item class_id_reference="20" object_id="_1010">
<id>1068</id>
<edge_type>1</edge_type>
<source_obj>261</source_obj>
<sink_obj>315</sink_obj>
</item>
<item class_id_reference="20" object_id="_1011">
<id>1069</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>316</sink_obj>
</item>
<item class_id_reference="20" object_id="_1012">
<id>1070</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_1013">
<id>1071</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_1014">
<id>1072</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_1015">
<id>1073</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>321</sink_obj>
</item>
<item class_id_reference="20" object_id="_1016">
<id>1074</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_1017">
<id>1075</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_1018">
<id>1076</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_1019">
<id>1077</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>322</sink_obj>
</item>
<item class_id_reference="20" object_id="_1020">
<id>1305</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_1021">
<id>1306</id>
<edge_type>2</edge_type>
<source_obj>80</source_obj>
<sink_obj>199</sink_obj>
</item>
<item class_id_reference="20" object_id="_1022">
<id>1307</id>
<edge_type>2</edge_type>
<source_obj>80</source_obj>
<sink_obj>106</sink_obj>
</item>
<item class_id_reference="20" object_id="_1023">
<id>1308</id>
<edge_type>2</edge_type>
<source_obj>106</source_obj>
<sink_obj>109</sink_obj>
</item>
<item class_id_reference="20" object_id="_1024">
<id>1309</id>
<edge_type>2</edge_type>
<source_obj>106</source_obj>
<sink_obj>138</sink_obj>
</item>
<item class_id_reference="20" object_id="_1025">
<id>1310</id>
<edge_type>2</edge_type>
<source_obj>109</source_obj>
<sink_obj>138</sink_obj>
</item>
<item class_id_reference="20" object_id="_1026">
<id>1311</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>192</sink_obj>
</item>
<item class_id_reference="20" object_id="_1027">
<id>1312</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>189</sink_obj>
</item>
<item class_id_reference="20" object_id="_1028">
<id>1313</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>186</sink_obj>
</item>
<item class_id_reference="20" object_id="_1029">
<id>1314</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>183</sink_obj>
</item>
<item class_id_reference="20" object_id="_1030">
<id>1315</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>180</sink_obj>
</item>
<item class_id_reference="20" object_id="_1031">
<id>1316</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>177</sink_obj>
</item>
<item class_id_reference="20" object_id="_1032">
<id>1317</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>174</sink_obj>
</item>
<item class_id_reference="20" object_id="_1033">
<id>1318</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>171</sink_obj>
</item>
<item class_id_reference="20" object_id="_1034">
<id>1319</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>168</sink_obj>
</item>
<item class_id_reference="20" object_id="_1035">
<id>1320</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>165</sink_obj>
</item>
<item class_id_reference="20" object_id="_1036">
<id>1321</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>162</sink_obj>
</item>
<item class_id_reference="20" object_id="_1037">
<id>1322</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>159</sink_obj>
</item>
<item class_id_reference="20" object_id="_1038">
<id>1323</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>156</sink_obj>
</item>
<item class_id_reference="20" object_id="_1039">
<id>1324</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>153</sink_obj>
</item>
<item class_id_reference="20" object_id="_1040">
<id>1325</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>150</sink_obj>
</item>
<item class_id_reference="20" object_id="_1041">
<id>1326</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>147</sink_obj>
</item>
<item class_id_reference="20" object_id="_1042">
<id>1327</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>144</sink_obj>
</item>
<item class_id_reference="20" object_id="_1043">
<id>1328</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>141</sink_obj>
</item>
<item class_id_reference="20" object_id="_1044">
<id>1329</id>
<edge_type>2</edge_type>
<source_obj>141</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1045">
<id>1330</id>
<edge_type>2</edge_type>
<source_obj>144</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1046">
<id>1331</id>
<edge_type>2</edge_type>
<source_obj>147</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1047">
<id>1332</id>
<edge_type>2</edge_type>
<source_obj>150</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1048">
<id>1333</id>
<edge_type>2</edge_type>
<source_obj>153</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1049">
<id>1334</id>
<edge_type>2</edge_type>
<source_obj>156</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1050">
<id>1335</id>
<edge_type>2</edge_type>
<source_obj>159</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1051">
<id>1336</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1052">
<id>1337</id>
<edge_type>2</edge_type>
<source_obj>165</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1053">
<id>1338</id>
<edge_type>2</edge_type>
<source_obj>168</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1054">
<id>1339</id>
<edge_type>2</edge_type>
<source_obj>171</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1055">
<id>1340</id>
<edge_type>2</edge_type>
<source_obj>174</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1056">
<id>1341</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1057">
<id>1342</id>
<edge_type>2</edge_type>
<source_obj>180</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1058">
<id>1343</id>
<edge_type>2</edge_type>
<source_obj>183</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1059">
<id>1344</id>
<edge_type>2</edge_type>
<source_obj>186</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1060">
<id>1345</id>
<edge_type>2</edge_type>
<source_obj>189</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1061">
<id>1346</id>
<edge_type>2</edge_type>
<source_obj>192</source_obj>
<sink_obj>195</sink_obj>
</item>
<item class_id_reference="20" object_id="_1062">
<id>1347</id>
<edge_type>2</edge_type>
<source_obj>195</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_1063">
<id>1348</id>
<edge_type>2</edge_type>
<source_obj>199</source_obj>
<sink_obj>206</sink_obj>
</item>
<item class_id_reference="20" object_id="_1064">
<id>1349</id>
<edge_type>2</edge_type>
<source_obj>206</source_obj>
<sink_obj>336</sink_obj>
</item>
<item class_id_reference="20" object_id="_1065">
<id>1350</id>
<edge_type>2</edge_type>
<source_obj>206</source_obj>
<sink_obj>231</sink_obj>
</item>
<item class_id_reference="20" object_id="_1066">
<id>1351</id>
<edge_type>2</edge_type>
<source_obj>231</source_obj>
<sink_obj>234</sink_obj>
</item>
<item class_id_reference="20" object_id="_1067">
<id>1352</id>
<edge_type>2</edge_type>
<source_obj>231</source_obj>
<sink_obj>263</sink_obj>
</item>
<item class_id_reference="20" object_id="_1068">
<id>1353</id>
<edge_type>2</edge_type>
<source_obj>234</source_obj>
<sink_obj>263</sink_obj>
</item>
<item class_id_reference="20" object_id="_1069">
<id>1354</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>317</sink_obj>
</item>
<item class_id_reference="20" object_id="_1070">
<id>1355</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>314</sink_obj>
</item>
<item class_id_reference="20" object_id="_1071">
<id>1356</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>311</sink_obj>
</item>
<item class_id_reference="20" object_id="_1072">
<id>1357</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>308</sink_obj>
</item>
<item class_id_reference="20" object_id="_1073">
<id>1358</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>305</sink_obj>
</item>
<item class_id_reference="20" object_id="_1074">
<id>1359</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>302</sink_obj>
</item>
<item class_id_reference="20" object_id="_1075">
<id>1360</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>299</sink_obj>
</item>
<item class_id_reference="20" object_id="_1076">
<id>1361</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>296</sink_obj>
</item>
<item class_id_reference="20" object_id="_1077">
<id>1362</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>293</sink_obj>
</item>
<item class_id_reference="20" object_id="_1078">
<id>1363</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>290</sink_obj>
</item>
<item class_id_reference="20" object_id="_1079">
<id>1364</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>287</sink_obj>
</item>
<item class_id_reference="20" object_id="_1080">
<id>1365</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>284</sink_obj>
</item>
<item class_id_reference="20" object_id="_1081">
<id>1366</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>281</sink_obj>
</item>
<item class_id_reference="20" object_id="_1082">
<id>1367</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>278</sink_obj>
</item>
<item class_id_reference="20" object_id="_1083">
<id>1368</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>275</sink_obj>
</item>
<item class_id_reference="20" object_id="_1084">
<id>1369</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>272</sink_obj>
</item>
<item class_id_reference="20" object_id="_1085">
<id>1370</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>269</sink_obj>
</item>
<item class_id_reference="20" object_id="_1086">
<id>1371</id>
<edge_type>2</edge_type>
<source_obj>263</source_obj>
<sink_obj>266</sink_obj>
</item>
<item class_id_reference="20" object_id="_1087">
<id>1372</id>
<edge_type>2</edge_type>
<source_obj>266</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1088">
<id>1373</id>
<edge_type>2</edge_type>
<source_obj>269</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1089">
<id>1374</id>
<edge_type>2</edge_type>
<source_obj>272</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1090">
<id>1375</id>
<edge_type>2</edge_type>
<source_obj>275</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1091">
<id>1376</id>
<edge_type>2</edge_type>
<source_obj>278</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1092">
<id>1377</id>
<edge_type>2</edge_type>
<source_obj>281</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1093">
<id>1378</id>
<edge_type>2</edge_type>
<source_obj>284</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1094">
<id>1379</id>
<edge_type>2</edge_type>
<source_obj>287</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1095">
<id>1380</id>
<edge_type>2</edge_type>
<source_obj>290</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1096">
<id>1381</id>
<edge_type>2</edge_type>
<source_obj>293</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1097">
<id>1382</id>
<edge_type>2</edge_type>
<source_obj>296</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1098">
<id>1383</id>
<edge_type>2</edge_type>
<source_obj>299</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1099">
<id>1384</id>
<edge_type>2</edge_type>
<source_obj>302</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1100">
<id>1385</id>
<edge_type>2</edge_type>
<source_obj>305</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1101">
<id>1386</id>
<edge_type>2</edge_type>
<source_obj>308</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1102">
<id>1387</id>
<edge_type>2</edge_type>
<source_obj>311</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1103">
<id>1388</id>
<edge_type>2</edge_type>
<source_obj>314</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1104">
<id>1389</id>
<edge_type>2</edge_type>
<source_obj>317</source_obj>
<sink_obj>320</sink_obj>
</item>
<item class_id_reference="20" object_id="_1105">
<id>1390</id>
<edge_type>2</edge_type>
<source_obj>320</source_obj>
<sink_obj>206</sink_obj>
</item>
<item class_id_reference="20" object_id="_1106">
<id>1391</id>
<edge_type>2</edge_type>
<source_obj>336</source_obj>
<sink_obj>342</sink_obj>
</item>
<item class_id_reference="20" object_id="_1107">
<id>1392</id>
<edge_type>2</edge_type>
<source_obj>342</source_obj>
<sink_obj>380</sink_obj>
</item>
<item class_id_reference="20" object_id="_1108">
<id>1393</id>
<edge_type>2</edge_type>
<source_obj>342</source_obj>
<sink_obj>375</sink_obj>
</item>
<item class_id_reference="20" object_id="_1109">
<id>1394</id>
<edge_type>2</edge_type>
<source_obj>375</source_obj>
<sink_obj>342</sink_obj>
</item>
<item class_id_reference="20" object_id="_1110">
<id>1410</id>
<edge_type>4</edge_type>
<source_obj>322</source_obj>
<sink_obj>324</sink_obj>
</item>
<item class_id_reference="20" object_id="_1111">
<id>1411</id>
<edge_type>4</edge_type>
<source_obj>321</source_obj>
<sink_obj>323</sink_obj>
</item>
<item class_id_reference="20" object_id="_1112">
<id>1412</id>
<edge_type>4</edge_type>
<source_obj>107</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_1113">
<id>1413</id>
<edge_type>4</edge_type>
<source_obj>232</source_obj>
<sink_obj>235</sink_obj>
</item>
<item class_id_reference="20" object_id="_1114">
<id>1414</id>
<edge_type>4</edge_type>
<source_obj>321</source_obj>
<sink_obj>323</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_1115">
<mId>1</mId>
<mTag>hog</mTag>
<mType>0</mType>
<sub_regions>
<count>7</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</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>1787</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_1116">
<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>73</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_1117">
<mId>3</mId>
<mTag>read_input0_memcpy..image0</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>23</count>
<item_version>0</item_version>
<item>80</item>
<item>106</item>
<item>109</item>
<item>138</item>
<item>141</item>
<item>144</item>
<item>147</item>
<item>150</item>
<item>153</item>
<item>156</item>
<item>159</item>
<item>162</item>
<item>165</item>
<item>168</item>
<item>171</item>
<item>174</item>
<item>177</item>
<item>180</item>
<item>183</item>
<item>186</item>
<item>189</item>
<item>192</item>
<item>195</item>
</basic_blocks>
<mII>1</mII>
<mDepth>24</mDepth>
<mMinTripCount>612</mMinTripCount>
<mMaxTripCount>612</mMaxTripCount>
<mMinLatency>634</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_1118">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>199</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="_1119">
<mId>5</mId>
<mTag>read_input1_memcpy..image0</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>23</count>
<item_version>0</item_version>
<item>206</item>
<item>231</item>
<item>234</item>
<item>263</item>
<item>266</item>
<item>269</item>
<item>272</item>
<item>275</item>
<item>278</item>
<item>281</item>
<item>284</item>
<item>287</item>
<item>290</item>
<item>293</item>
<item>296</item>
<item>299</item>
<item>302</item>
<item>305</item>
<item>308</item>
<item>311</item>
<item>314</item>
<item>317</item>
<item>320</item>
</basic_blocks>
<mII>1</mII>
<mDepth>24</mDepth>
<mMinTripCount>612</mMinTripCount>
<mMaxTripCount>612</mMaxTripCount>
<mMinLatency>634</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_1120">
<mId>6</mId>
<mTag>Region 2</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>336</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>433</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_1121">
<mId>7</mId>
<mTag>svm_loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>342</item>
<item>375</item>
</basic_blocks>
<mII>1</mII>
<mDepth>8</mDepth>
<mMinTripCount>72</mMinTripCount>
<mMaxTripCount>72</mMaxTripCount>
<mMinLatency>78</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_1122">
<mId>8</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>380</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>286</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>13</first>
<second class_id="28" tracking_level="0" version="0">
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>12</first>
<second>4</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>16</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>16</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>3</first>
<second>13</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>18</first>
<second>6</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>24</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>12</first>
<second>2</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>12</first>
<second>13</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>126</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>127</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>128</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>129</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>130</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>132</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>133</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>134</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>137</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>139</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>140</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>142</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>143</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>145</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>146</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>148</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>149</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>151</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>152</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>154</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>155</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>157</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>158</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>160</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>161</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>163</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>164</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>166</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>167</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>169</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>170</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>172</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>173</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>175</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>176</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>178</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>179</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>181</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>182</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>184</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>185</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>187</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>188</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>190</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>191</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>194</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>196</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>197</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>198</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>200</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>201</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>202</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>203</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>204</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>205</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>209</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>210</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>211</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>212</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>213</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>214</first>
<second>
<first>13</first>
<second>4</second>
</second>
</item>
<item>
<first>215</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>216</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>217</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>218</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>219</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>220</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>222</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>223</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>224</first>
<second>
<first>18</first>
<second>0</second>
</second>
</item>
<item>
<first>227</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>228</first>
<second>
<first>5</first>
<second>13</second>
</second>
</item>
<item>
<first>229</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>230</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>232</first>
<second>
<first>20</first>
<second>6</second>
</second>
</item>
<item>
<first>233</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>235</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>236</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>237</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>238</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>239</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>240</first>
<second>
<first>14</first>
<second>2</second>
</second>
</item>
<item>
<first>241</first>
<second>
<first>14</first>
<second>13</second>
</second>
</item>
<item>
<first>242</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>243</first>
<second>
<first>16</first>
<second>0</second>
</second>
</item>
<item>
<first>244</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>245</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>246</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>247</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>248</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>249</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>250</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>251</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>252</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>253</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>254</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>255</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>256</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>257</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>258</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>259</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>260</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>261</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>262</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>264</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>265</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>267</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>268</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>270</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>271</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>273</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>274</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>276</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>277</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>279</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>280</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>282</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>283</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>285</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>286</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>288</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>289</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>291</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>292</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>294</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>295</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>297</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>298</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>300</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>301</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>303</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>304</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>306</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>307</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>309</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>310</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>312</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>313</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>315</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>316</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>319</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>321</first>
<second>
<first>6</first>
<second>1</second>
</second>
</item>
<item>
<first>322</first>
<second>
<first>6</first>
<second>1</second>
</second>
</item>
<item>
<first>323</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>324</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>325</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>326</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>327</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>328</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>329</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>330</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>331</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>335</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>337</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>338</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>339</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>340</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>341</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>343</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>344</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>349</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>350</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>351</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>352</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>353</first>
<second>
<first>11</first>
<second>1</second>
</second>
</item>
<item>
<first>354</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>355</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>356</first>
<second>
<first>11</first>
<second>1</second>
</second>
</item>
<item>
<first>357</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>358</first>
<second>
<first>14</first>
<second>2</second>
</second>
</item>
<item>
<first>359</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>360</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>361</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>362</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>363</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>364</first>
<second>
<first>11</first>
<second>1</second>
</second>
</item>
<item>
<first>365</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>366</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>367</first>
<second>
<first>11</first>
<second>1</second>
</second>
</item>
<item>
<first>368</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>369</first>
<second>
<first>13</first>
<second>2</second>
</second>
</item>
<item>
<first>370</first>
<second>
<first>16</first>
<second>0</second>
</second>
</item>
<item>
<first>371</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>372</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>374</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>376</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>377</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>378</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>379</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>52</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>73</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>2</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>3</first>
<second>17</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>18</first>
<second>24</second>
</second>
</item>
<item>
<first>138</first>
<second>
<first>11</first>
<second>26</second>
</second>
</item>
<item>
<first>141</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>144</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>147</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>150</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>153</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>156</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>159</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>162</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>165</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>168</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>171</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>174</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>177</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>180</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>183</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>186</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>189</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>192</first>
<second>
<first>25</first>
<second>26</second>
</second>
</item>
<item>
<first>195</first>
<second>
<first>26</first>
<second>26</second>
</second>
</item>
<item>
<first>199</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>206</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>231</first>
<second>
<first>5</first>
<second>19</second>
</second>
</item>
<item>
<first>234</first>
<second>
<first>20</first>
<second>26</second>
</second>
</item>
<item>
<first>263</first>
<second>
<first>13</first>
<second>28</second>
</second>
</item>
<item>
<first>266</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>269</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>272</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>275</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>278</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>281</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>284</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>287</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>290</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>293</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>296</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>299</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>302</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>305</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>308</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>311</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>314</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>317</first>
<second>
<first>27</first>
<second>28</second>
</second>
</item>
<item>
<first>320</first>
<second>
<first>28</first>
<second>28</second>
</second>
</item>
<item>
<first>336</first>
<second>
<first>6</first>
<second>9</second>
</second>
</item>
<item>
<first>342</first>
<second>
<first>10</first>
<second>10</second>
</second>
</item>
<item>
<first>375</first>
<second>
<first>10</first>
<second>17</second>
</second>
</item>
<item>
<first>380</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_1123">
<region_name>read_input0_memcpy..image0</region_name>
<basic_blocks>
<count>23</count>
<item_version>0</item_version>
<item>80</item>
<item>106</item>
<item>109</item>
<item>138</item>
<item>141</item>
<item>144</item>
<item>147</item>
<item>150</item>
<item>153</item>
<item>156</item>
<item>159</item>
<item>162</item>
<item>165</item>
<item>168</item>
<item>171</item>
<item>174</item>
<item>177</item>
<item>180</item>
<item>183</item>
<item>186</item>
<item>189</item>
<item>192</item>
<item>195</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>24</pipe_depth>
</item>
<item class_id_reference="33" object_id="_1124">
<region_name>read_input1_memcpy..image0</region_name>
<basic_blocks>
<count>23</count>
<item_version>0</item_version>
<item>206</item>
<item>231</item>
<item>234</item>
<item>263</item>
<item>266</item>
<item>269</item>
<item>272</item>
<item>275</item>
<item>278</item>
<item>281</item>
<item>284</item>
<item>287</item>
<item>290</item>
<item>293</item>
<item>296</item>
<item>299</item>
<item>302</item>
<item>305</item>
<item>308</item>
<item>311</item>
<item>314</item>
<item>317</item>
<item>320</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>24</pipe_depth>
</item>
<item class_id_reference="33" object_id="_1125">
<region_name>svm_loop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>342</item>
<item>375</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="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>
|
package body System.Shared_Locking is
pragma Suppress (All_Checks);
procedure Enter is
begin
Enter_Hook.all;
end Enter;
procedure Leave is
begin
Leave_Hook.all;
end Leave;
end System.Shared_Locking;
|
-----------------------------------------------------------------------
-- nodes-core -- Core nodes
-- Copyright (C) 2009, 2010, 2011, 2012, 2013, 2015, 2018 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Strings.Transforms;
with Util.Files;
with Ada.Exceptions;
with Ada.Strings.Fixed;
with Ada.Strings.Wide_Wide_Fixed;
package body ASF.Views.Nodes.Core is
-- ------------------------------
-- Set Tag
-- ------------------------------
-- ------------------------------
-- Create the Set Tag
-- ------------------------------
function Create_Set_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access is
Node : constant Set_Tag_Node_Access := new Set_Tag_Node;
begin
Initialize (Node.all'Access, Binding, Line, Parent, Attributes);
Node.Value := Find_Attribute (Attributes, "value");
Node.Var := Find_Attribute (Attributes, "var");
if Node.Value = null then
Node.Error ("Missing 'value' attribute");
end if;
if Node.Var = null then
Node.Error ("Missing 'var' attribute");
end if;
return Node.all'Access;
end Create_Set_Tag_Node;
-- ------------------------------
-- Build the component tree from the tag node and attach it as
-- the last child of the given parent. Calls recursively the
-- method to create children.
-- ------------------------------
overriding
procedure Build_Components (Node : access Set_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class) is
pragma Unreferenced (Parent);
begin
if Node.Value /= null then
declare
Value : constant EL.Expressions.Expression := Get_Expression (Node.Value.all);
begin
Context.Set_Variable (Node.Var.Value, Value);
end;
end if;
end Build_Components;
-- ------------------------------
-- If Tag
-- ------------------------------
-- ------------------------------
-- Create the If Tag
-- ------------------------------
function Create_If_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access is
Node : constant If_Tag_Node_Access := new If_Tag_Node;
begin
Initialize (Node.all'Access, Binding, Line, Parent, Attributes);
Node.Condition := Find_Attribute (Attributes, "test");
Node.Var := Find_Attribute (Attributes, "var");
if Node.Condition = null then
Node.Error ("Missing 'test' attribute");
end if;
return Node.all'Access;
end Create_If_Tag_Node;
-- ------------------------------
-- Build the component tree from the tag node and attach it as
-- the last child of the given parent. Calls recursively the
-- method to create children.
-- ------------------------------
overriding
procedure Build_Components (Node : access If_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class) is
begin
if Node.Condition /= null then
declare
Value : constant EL.Objects.Object := Get_Value (Node.Condition.all, Context);
begin
if Node.Var /= null then
Context.Set_Attribute (Node.Var.Value, Value);
end if;
if EL.Objects.To_Boolean (Value) then
Tag_Node (Node.all).Build_Children (Parent, Context);
end if;
end;
end if;
end Build_Components;
-- ------------------------------
-- Choose Tag
-- ------------------------------
-- ------------------------------
-- Create the Choose Tag
-- ------------------------------
function Create_Choose_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access is
Node : constant Choose_Tag_Node_Access := new Choose_Tag_Node;
begin
Initialize (Node.all'Access, Binding, Line, Parent, Attributes);
return Node.all'Access;
end Create_Choose_Tag_Node;
-- ------------------------------
-- Freeze the tag node tree and perform any initialization steps
-- necessary to build the components efficiently.
-- Prepare the evaluation of choices by identifying the <c:when> and
-- <c:otherwise> conditions.
-- ------------------------------
overriding
procedure Freeze (Node : access Choose_Tag_Node) is
Child : Tag_Node_Access := Node.First_Child;
Choice : When_Tag_Node_Access := null;
begin
while Child /= null loop
if Child.all in Otherwise_Tag_Node'Class then
Node.Otherwise := Child;
elsif Child.all in When_Tag_Node'Class then
if Choice = null then
Node.Choices := When_Tag_Node (Child.all)'Access;
else
Choice.Next_Choice := When_Tag_Node (Child.all)'Access;
end if;
Choice := When_Tag_Node (Child.all)'Access;
else
null;
-- @todo: report a warning in a log
-- @todo: clean the sub-tree and remove what is not necessary
end if;
Child := Child.Next;
end loop;
end Freeze;
-- ------------------------------
-- Build the component tree from the tag node and attach it as
-- the last child of the given parent. Calls recursively the
-- method to create children.
-- ------------------------------
overriding
procedure Build_Components (Node : access Choose_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class) is
Choice : When_Tag_Node_Access := Node.Choices;
begin
-- Evaluate the choices and stop at the first which succeeds
while Choice /= null loop
if Choice.Is_Selected (Context) then
Choice.Build_Children (Parent, Context);
return;
end if;
Choice := Choice.Next_Choice;
end loop;
-- No choice matched, build the otherwise clause.
if Node.Otherwise /= null then
Node.Otherwise.Build_Children (Parent, Context);
end if;
end Build_Components;
-- ------------------------------
-- Create the When Tag
-- ------------------------------
function Create_When_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access is
Node : constant When_Tag_Node_Access := new When_Tag_Node;
begin
Initialize (Node.all'Access, Binding, Line, Parent, Attributes);
Node.Condition := Find_Attribute (Attributes, "test");
if Node.Condition = null then
Node.Error ("Missing 'test' attribute");
end if;
-- Node.Var := Find_Attribute (Attributes, "var");
return Node.all'Access;
end Create_When_Tag_Node;
-- ------------------------------
-- Check whether the node condition is selected.
-- ------------------------------
function Is_Selected (Node : When_Tag_Node;
Context : Facelet_Context'Class) return Boolean is
begin
if Node.Condition = null then
return False;
else
return EL.Objects.To_Boolean (Get_Value (Node.Condition.all, Context));
end if;
exception
when E : others =>
Node.Error ("Exception: {0}", Ada.Exceptions.Exception_Message (E));
return False;
end Is_Selected;
-- ------------------------------
-- Create the Otherwise Tag
-- ------------------------------
function Create_Otherwise_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access is
Node : constant Otherwise_Tag_Node_Access := new Otherwise_Tag_Node;
begin
Initialize (Node.all'Access, Binding, Line, Parent, Attributes);
return Node.all'Access;
end Create_Otherwise_Tag_Node;
-- Tag names
CHOOSE_TAG : aliased constant String := "choose";
IF_TAG : aliased constant String := "if";
OTHERWISE_TAG : aliased constant String := "otherwise";
SET_TAG : aliased constant String := "set";
WHEN_TAG : aliased constant String := "when";
-- Name-space URI. Use the JSTL name-space to make the XHTML views compatible
-- the JSF.
URI : aliased constant String := "http://java.sun.com/jstl/core";
-- ------------------------------
-- Tag factory for nodes defined in this package.
-- ------------------------------
-- Register the facelets component factory.
procedure Register (Factory : in out ASF.Factory.Component_Factory) is
begin
ASF.Factory.Register (Factory,
URI => URI'Access,
Name => CHOOSE_TAG'Access,
Tag => Create_Choose_Tag_Node'Access,
Create => null);
ASF.Factory.Register (Factory,
URI => URI'Access,
Name => IF_TAG'Access,
Tag => Create_If_Tag_Node'Access,
Create => null);
ASF.Factory.Register (Factory,
URI => URI'Access,
Name => OTHERWISE_TAG'Access,
Tag => Create_Otherwise_Tag_Node'Access,
Create => null);
ASF.Factory.Register (Factory,
URI => URI'Access,
Name => SET_TAG'Access,
Tag => Create_Set_Tag_Node'Access,
Create => null);
ASF.Factory.Register (Factory,
URI => URI'Access,
Name => WHEN_TAG'Access,
Tag => Create_When_Tag_Node'Access,
Create => null);
end Register;
-- Function names
CAPITALIZE_FN : aliased constant String := "capitalize";
COMPOSE_PATH_FN : aliased constant String := "composePath";
CONTAINS_FN : aliased constant String := "contains";
ENDS_WITH_FN : aliased constant String := "endsWith";
LENGTH_FN : aliased constant String := "length";
TO_UPPER_CASE_FN : aliased constant String := "toUpperCase";
TO_LOWER_CASE_FN : aliased constant String := "toLowerCase";
STARTS_WITH_FN : aliased constant String := "startsWith";
SUBSTRING_FN : aliased constant String := "substring";
SUBSTRING_AFTER_FN : aliased constant String := "substringAfter";
SUBSTRING_BEFORE_FN : aliased constant String := "substringBefore";
TRIM_FN : aliased constant String := "trim";
INDEX_OF_FN : aliased constant String := "indexOf";
ESCAPE_XML_FN : aliased constant String := "escapeXml";
REPLACE_FN : aliased constant String := "replace";
-- JSFL function not implemented
-- CONTAINS_IGNORE_CASE_FN : aliased constant String := "containsIgnoreCase";
-- JOIN_FN : aliased constant String := "join";
-- SPLIT_FN : aliased constant String := "split";
function Length (Value : in EL.Objects.Object) return EL.Objects.Object;
function Contains (Value : in EL.Objects.Object;
Search : in EL.Objects.Object) return EL.Objects.Object;
function Capitalize (Value : EL.Objects.Object) return EL.Objects.Object;
function To_Upper_Case (Value : EL.Objects.Object) return EL.Objects.Object;
function To_Lower_Case (Value : EL.Objects.Object) return EL.Objects.Object;
function Trim (Value : in EL.Objects.Object) return EL.Objects.Object;
function Ends_With (Value : in EL.Objects.Object;
Search : in EL.Objects.Object) return EL.Objects.Object;
function Starts_With (Value : in EL.Objects.Object;
Search : in EL.Objects.Object) return EL.Objects.Object;
function Index_Of (Value : in EL.Objects.Object;
Search : in EL.Objects.Object) return EL.Objects.Object;
function Substring_Before (Value : in EL.Objects.Object;
Token : in EL.Objects.Object) return EL.Objects.Object;
function Substring_After (Value : in EL.Objects.Object;
Token : in EL.Objects.Object) return EL.Objects.Object;
function Compose_Path (Paths : in EL.Objects.Object;
Dir : in EL.Objects.Object) return EL.Objects.Object;
function Index (Value : in EL.Objects.Object;
Search : in EL.Objects.Object) return Natural;
function Substring (Value : in EL.Objects.Object;
Start : in EL.Objects.Object;
Finish : in EL.Objects.Object) return EL.Objects.Object;
-- Escapes characters that could be interpreted as XML markup.
function Escape_Xml (Value : in EL.Objects.Object) return EL.Objects.Object;
-- Returns a string resulting from replacing in an input string
-- all occurrences of a "before" string into an "after" substring.
function Replace (From, Before, After : in EL.Objects.Object) return EL.Objects.Object;
-- ------------------------------
-- Escapes characters that could be interpreted as XML markup.
-- ------------------------------
function Escape_Xml (Value : in EL.Objects.Object) return EL.Objects.Object is
Of_Type : constant EL.Objects.Data_Type := EL.Objects.Get_Type (Value);
begin
case Of_Type is
when EL.Objects.TYPE_STRING =>
declare
S : constant String := EL.Objects.To_String (Value);
begin
return EL.Objects.To_Object (Util.Strings.Transforms.Escape_Xml (S));
end;
when others =>
return Value;
end case;
end Escape_Xml;
-- ------------------------------
-- Get the length of the object.
-- ------------------------------
function Length (Value : in EL.Objects.Object) return EL.Objects.Object is
S : constant String := EL.Objects.To_String (Value);
begin
return EL.Objects.To_Object (Integer (S'Length));
end Length;
-- ------------------------------
-- Find the index of the search string in the value.
-- ------------------------------
function Index (Value : in EL.Objects.Object;
Search : in EL.Objects.Object) return Natural is
Of_Type : constant EL.Objects.Data_Type := EL.Objects.Get_Type (Value);
begin
case Of_Type is
when EL.Objects.TYPE_NULL =>
return 0;
when EL.Objects.TYPE_WIDE_STRING =>
declare
S : constant Wide_Wide_String := EL.Objects.To_Wide_Wide_String (Value);
P : constant Wide_Wide_String := EL.Objects.To_Wide_Wide_String (Search);
begin
return Ada.Strings.Wide_Wide_Fixed.Index (S, P);
end;
when others =>
declare
S : constant String := EL.Objects.To_String (Value);
P : constant String := EL.Objects.To_String (Search);
begin
return Ada.Strings.Fixed.Index (S, P);
end;
end case;
end Index;
-- ------------------------------
-- Check if the search string is contained in the value. If the value is a wide string,
-- the search string is converted to a wide string and the search is made using wide string.
-- Otherwise the value and search string are converted to a string.
-- Returns true if the <b>Search</b> is contained in <b>Value</b>
-- ------------------------------
function Contains (Value : in EL.Objects.Object;
Search : in EL.Objects.Object) return EL.Objects.Object is
begin
return EL.Objects.To_Object (Index (Value, Search) > 0);
end Contains;
-- ------------------------------
-- Find the index of the search string in the value.
-- Returns the index true if the <b>Search</b> is contained in <b>Value</b>
-- ------------------------------
function Index_Of (Value : in EL.Objects.Object;
Search : in EL.Objects.Object) return EL.Objects.Object is
begin
return EL.Objects.To_Object (Index (Value, Search));
end Index_Of;
-- ------------------------------
-- Check if the value starts with the given search string.
-- Returns true if the <b>Value</b> starts with <b>Search</b>
-- ------------------------------
function Starts_With (Value : in EL.Objects.Object;
Search : in EL.Objects.Object) return EL.Objects.Object is
Of_Type : constant EL.Objects.Data_Type := EL.Objects.Get_Type (Value);
begin
case Of_Type is
when EL.Objects.TYPE_NULL =>
return EL.Objects.To_Object (False);
when EL.Objects.TYPE_WIDE_STRING =>
declare
S : constant Wide_Wide_String := EL.Objects.To_Wide_Wide_String (Value);
P : constant Wide_Wide_String := EL.Objects.To_Wide_Wide_String (Search);
begin
return EL.Objects.To_Object (Ada.Strings.Wide_Wide_Fixed.Index (S, P) = S'First);
end;
when others =>
declare
S : constant String := EL.Objects.To_String (Value);
P : constant String := EL.Objects.To_String (Search);
begin
return EL.Objects.To_Object (Ada.Strings.Fixed.Index (S, P) = S'First);
end;
end case;
end Starts_With;
-- ------------------------------
-- Check if the value ends with the given search string.
-- Returns true if the <b>Value</b> starts with <b>Search</b>
-- ------------------------------
function Ends_With (Value : in EL.Objects.Object;
Search : in EL.Objects.Object) return EL.Objects.Object is
Of_Type : constant EL.Objects.Data_Type := EL.Objects.Get_Type (Value);
begin
case Of_Type is
when EL.Objects.TYPE_NULL =>
return EL.Objects.To_Object (False);
when EL.Objects.TYPE_WIDE_STRING =>
declare
S : constant Wide_Wide_String := EL.Objects.To_Wide_Wide_String (Value);
P : constant Wide_Wide_String := EL.Objects.To_Wide_Wide_String (Search);
I : constant Natural := Ada.Strings.Wide_Wide_Fixed.Index (S, P);
begin
return EL.Objects.To_Object (I > 0 and I + P'Length - 1 = S'Last);
end;
when others =>
declare
S : constant String := EL.Objects.To_String (Value);
P : constant String := EL.Objects.To_String (Search);
I : constant Natural := Ada.Strings.Fixed.Index (S, P);
begin
return EL.Objects.To_Object (I > 0 and I + P'Length - 1 = S'Last);
end;
end case;
end Ends_With;
-- ------------------------------
-- Returns the substring starting from the <b>Start</b> index up to the <b>Finish</b>
-- index inclusive.
-- ------------------------------
function Substring (Value : in EL.Objects.Object;
Start : in EL.Objects.Object;
Finish : in EL.Objects.Object) return EL.Objects.Object is
Of_Type : constant EL.Objects.Data_Type := EL.Objects.Get_Type (Value);
begin
case Of_Type is
when EL.Objects.TYPE_NULL =>
return Value;
when EL.Objects.TYPE_WIDE_STRING =>
declare
S : constant Wide_Wide_String := EL.Objects.To_Wide_Wide_String (Value);
First : Natural := EL.Objects.To_Integer (Start);
Last : Natural := EL.Objects.To_Integer (Finish);
begin
if First <= S'First then
First := S'First;
end if;
if Last >= S'Last then
Last := S'Last;
end if;
return EL.Objects.To_Object (S (First .. Last));
end;
when others =>
declare
S : constant String := EL.Objects.To_String (Value);
First : Natural := EL.Objects.To_Integer (Start);
Last : Natural := EL.Objects.To_Integer (Finish);
begin
if First <= S'First then
First := S'First;
end if;
if Last >= S'Last then
Last := S'Last;
end if;
return EL.Objects.To_Object (S (First .. Last));
end;
end case;
exception
when others =>
return Value;
end Substring;
function Capitalize (Value : EL.Objects.Object) return EL.Objects.Object is
S : constant String := EL.Objects.To_String (Value);
begin
return EL.Objects.To_Object (Util.Strings.Transforms.Capitalize (S));
end Capitalize;
function To_Upper_Case (Value : EL.Objects.Object) return EL.Objects.Object is
S : constant String := EL.Objects.To_String (Value);
begin
return EL.Objects.To_Object (Util.Strings.Transforms.To_Upper_Case (S));
end To_Upper_Case;
function To_Lower_Case (Value : EL.Objects.Object) return EL.Objects.Object is
S : constant String := EL.Objects.To_String (Value);
begin
return EL.Objects.To_Object (Util.Strings.Transforms.To_Lower_Case (S));
end To_Lower_Case;
-- ------------------------------
-- Trim the white spaces at beginning and end of the string.
-- ------------------------------
function Trim (Value : in EL.Objects.Object) return EL.Objects.Object is
Of_Type : constant EL.Objects.Data_Type := EL.Objects.Get_Type (Value);
begin
case Of_Type is
when EL.Objects.TYPE_STRING =>
declare
S : constant String := EL.Objects.To_String (Value);
begin
return EL.Objects.To_Object (Ada.Strings.Fixed.Trim (S, Ada.Strings.Both));
end;
when EL.Objects.TYPE_WIDE_STRING =>
declare
S : constant Wide_Wide_String := EL.Objects.To_Wide_Wide_String (Value);
begin
return EL.Objects.To_Object
(Ada.Strings.Wide_Wide_Fixed.Trim (S, Ada.Strings.Both));
end;
when others =>
return Value;
end case;
end Trim;
-- ------------------------------
-- Returns a string resulting from replacing in an input string
-- all occurrences of a "before" string into an "after" substring.
-- ------------------------------
function Replace (From, Before, After : in EL.Objects.Object) return EL.Objects.Object is
Of_Type : constant EL.Objects.Data_Type := EL.Objects.Get_Type (From);
begin
case Of_Type is
when EL.Objects.TYPE_NULL =>
return From;
when others =>
declare
S : Unbounded_String := EL.Objects.To_Unbounded_String (From);
B : constant String := EL.Objects.To_String (Before);
A : constant String := EL.Objects.To_String (After);
I : Natural := 1;
begin
loop
I := Ada.Strings.Unbounded.Index (S, B, I);
exit when I = 0;
Ada.Strings.Unbounded.Replace_Slice (S, I, I + B'Length - 1, A);
I := I + B'Length;
end loop;
return EL.Objects.To_Object (S);
end;
end case;
end Replace;
-- ------------------------------
-- Return the substring before the token string
-- ------------------------------
function Substring_Before (Value : in EL.Objects.Object;
Token : in EL.Objects.Object) return EL.Objects.Object is
S : constant String := EL.Objects.To_String (Value);
T : constant String := EL.Objects.To_String (Token);
Pos : constant Natural := Ada.Strings.Fixed.Index (S, T);
begin
if Pos = 0 then
return EL.Objects.Null_Object;
else
return EL.Objects.To_Object (S (S'First .. Pos - 1));
end if;
end Substring_Before;
-- ------------------------------
-- Return the substring after the token string
-- ------------------------------
function Substring_After (Value : in EL.Objects.Object;
Token : in EL.Objects.Object) return EL.Objects.Object is
S : constant String := EL.Objects.To_String (Value);
T : constant String := EL.Objects.To_String (Token);
Pos : constant Natural := Ada.Strings.Fixed.Index (S, T);
begin
if Pos = 0 then
return EL.Objects.Null_Object;
else
return EL.Objects.To_Object (S (Pos + T'Length .. S'Last));
end if;
end Substring_After;
-- ------------------------------
-- Expand the search paths <b>Paths</b> into a new search path which adds the
-- directory component <b>Dir</b>. Example:
-- Paths= /usr;/usr/local;/opt
-- Dir = bin
-- Result= /usr/bin;/usr/local/bin;/opt/bin
-- ------------------------------
function Compose_Path (Paths : in EL.Objects.Object;
Dir : in EL.Objects.Object) return EL.Objects.Object is
P : constant String := EL.Objects.To_String (Paths);
D : constant String := EL.Objects.To_String (Dir);
R : constant String := Util.Files.Compose_Path (P, D);
begin
return EL.Objects.To_Object (R);
end Compose_Path;
-- ------------------------------
-- Register a set of functions in the namespace
-- xmlns:fn="http://java.sun.com/jsp/jstl/functions"
-- Functions:
-- capitalize, toUpperCase, toLowerCase
-- ------------------------------
procedure Set_Functions (Mapper : in out EL.Functions.Function_Mapper'Class) is
begin
Mapper.Set_Function (Name => STARTS_WITH_FN,
Namespace => FN_URI,
Func => Starts_With'Access);
Mapper.Set_Function (Name => ENDS_WITH_FN,
Namespace => FN_URI,
Func => Ends_With'Access);
Mapper.Set_Function (Name => INDEX_OF_FN,
Namespace => FN_URI,
Func => Index_Of'Access);
Mapper.Set_Function (Name => SUBSTRING_FN,
Namespace => FN_URI,
Func => Substring'Access);
Mapper.Set_Function (Name => CAPITALIZE_FN,
Namespace => FN_URI,
Func => Capitalize'Access);
Mapper.Set_Function (Name => CONTAINS_FN,
Namespace => FN_URI,
Func => Contains'Access);
Mapper.Set_Function (Name => LENGTH_FN,
Namespace => FN_URI,
Func => Length'Access);
Mapper.Set_Function (Name => TO_LOWER_CASE_FN,
Namespace => FN_URI,
Func => To_Lower_Case'Access);
Mapper.Set_Function (Name => TO_UPPER_CASE_FN,
Namespace => FN_URI,
Func => To_Upper_Case'Access);
Mapper.Set_Function (Name => SUBSTRING_BEFORE_FN,
Namespace => FN_URI,
Func => Substring_Before'Access);
Mapper.Set_Function (Name => TRIM_FN,
Namespace => FN_URI,
Func => Trim'Access);
Mapper.Set_Function (Name => SUBSTRING_AFTER_FN,
Namespace => FN_URI,
Func => Substring_After'Access);
Mapper.Set_Function (Name => COMPOSE_PATH_FN,
Namespace => FN_URI,
Func => Compose_Path'Access);
Mapper.Set_Function (Name => ESCAPE_XML_FN,
Namespace => FN_URI,
Func => Escape_Xml'Access);
Mapper.Set_Function (Name => REPLACE_FN,
Namespace => FN_URI,
Func => Replace'Access);
end Set_Functions;
end ASF.Views.Nodes.Core;
|
with impact.d3.Vector;
with impact.d3.Scalar;
with ada.unchecked_Deallocation;
package body impact.d3.convex_Hull
is
------------
--- Globals
--
generic
type T is private;
procedure Any_swap (A, B : in out T);
procedure Any_swap (A, B : in out T)
is
Pad : constant T := A;
begin
A := B;
B := Pad;
end Any_swap;
-----------
-- Utility
--
function PlaneLineIntersection (plane : in btPlane;
p0, p1 : in math.Vector_3) return math.Vector_3;
function PlaneProject (plane : in btPlane;
point : in math.Vector_3) return math.Vector_3;
function ThreePlaneIntersection (p0, p1, p2 : in btPlane) return math.Vector_3
is
use impact.d3.Vector, Math;
N1 : constant math.Vector_3 := p0.normal;
N2 : constant math.Vector_3 := p1.normal;
N3 : constant math.Vector_3 := p2.normal;
n2n3 : math.Vector_3 := cross (N2, N3);
n3n1 : math.Vector_3 := cross (N3, N1);
n1n2 : math.Vector_3 := cross (N1, N2);
N1_dot_n2n3 : constant math.Real := dot (N1, n2n3); pragma Assert (abs (N1_dot_n2n3) > 0.000001);
quotient : constant math.Real := -1.0 / N1_dot_n2n3;
potentialVertex : math.Vector_3;
begin
n2n3 := n2n3 * p0.dist;
n3n1 := n3n1 * p1.dist;
n1n2 := n1n2 * p2.dist;
potentialVertex := (n2n3 + n3n1 + n1n2) * quotient;
return potentialVertex;
end ThreePlaneIntersection;
function DistanceBetweenLines (ustart, udir,
vstart, vdir : in math.Vector_3;
upoint, vpoint : access math.Vector_3 := null) return math.Real;
function TriNormal (v0, v1, v2 : in math.Vector_3) return math.Vector_3;
-- function NormalOf (vert : in math.Vector_3;
-- n : in Integer ) return math.Vector_3;
--- PlaneLineIntersection
--
-- Returns the point where the line 'p0 - p1' intersects the plane 'n & d'.
--
dif : math.Vector_3;
function PlaneLineIntersection (plane : in btPlane;
p0, p1 : in math.Vector_3) return math.Vector_3
is
use impact.d3.Vector, Math;
begin
dif := p1 - p0;
declare
dn : constant math.Real := dot (plane.normal, dif);
t : constant math.Real := -(plane.dist + dot (plane.normal, p0))
/ dn;
begin
return p0 + (dif * t);
end;
end PlaneLineIntersection;
function PlaneProject (plane : in btPlane;
point : in math.Vector_3) return math.Vector_3
is
use impact.d3.Vector, Math;
begin
return point - plane.normal
* (dot (point, plane.normal) + plane.dist);
end PlaneProject;
-- Return the normal of the triangle inscribed by v0, v1, and v2.
--
function TriNormal (v0, v1, v2 : in math.Vector_3) return math.Vector_3
is
use impact.d3.Vector, Math;
cp : constant math.Vector_3 := cross (v1 - v0,
v2 - v1);
m : constant math.Real := length (cp);
begin
if m = 0.0 then
return (1.0, 0.0, 0.0);
end if;
return cp * (1.0 / m);
end TriNormal;
cp : math.Vector_3;
function DistanceBetweenLines (ustart, udir,
vstart, vdir : in math.Vector_3;
upoint, vpoint : access math.Vector_3 := null) return math.Real
is
use impact.d3.Vector, Math;
begin
cp := normalized (cross (udir, vdir));
declare
distu : constant math.Real := -dot (cp, ustart);
distv : constant math.Real := -dot (cp, vstart);
dist : constant math.Real := abs (distu - distv);
plane : btPlane;
begin
if upoint /= null then
plane.normal := normalized (cross (vdir, cp));
plane.dist := -dot (plane.normal, vstart);
upoint.all := PlaneLineIntersection (plane, ustart, ustart + udir);
end if;
if vpoint /= null then
plane.normal := normalized (cross (udir, cp));
plane.dist := -dot (plane.normal, ustart);
vpoint.all := PlaneLineIntersection (plane, vstart, vstart + vdir);
end if;
return dist;
end;
end DistanceBetweenLines;
--- HullDesc
--
function to_HullDesc return HullDesc
is
Self : HullDesc;
begin
Self.mFlags := QF_DEFAULT;
Self.mVcount := 0;
Self.mVertexStride := math.Vector_3'Size / 8;
Self.mNormalEpsilon := 0.001;
Self.mMaxVertices := 4096; -- maximum number of points to be considered for a convex hull.
Self.mMaxFaces := 4096;
return Self;
end to_HullDesc;
function to_HullDesc (flag : in HullFlag;
vcount : in Natural;
vertices : access vector_3_Array;
stride : in Positive := math.Vector_3'Size / 8) return HullDesc
is
Self : HullDesc;
begin
Self.mFlags := flag;
Self.mVcount := vcount;
Self.mVertices := vertices;
Self.mVertexStride := stride;
Self.mNormalEpsilon := 0.001;
Self.mMaxVertices := 4096; -- maximum number of points to be considered for a convex hull.
return Self;
end to_HullDesc;
function HasHullFlag (Self : in HullDesc; Flag : in HullFlag) return Boolean
is
begin
if (Self.mFlags and flag) /= 0 then
return True;
end if;
return False;
end HasHullFlag;
procedure SetHullFlag (Self : in out HullDesc; Flag : in HullFlag)
is
begin
Self.mFlags := Self.mFlags or flag;
end SetHullFlag;
procedure ClearHullFlag (Self : in out HullDesc; Flag : in HullFlag)
is
begin
Self.mFlags := Self.mFlags and not flag;
end ClearHullFlag;
------------
--- btPlane
--
function to_btPlane return btPlane
is
begin
return (normal => math.Origin_3d,
dist => 0.0);
end to_btPlane;
function to_btPlane (n : in math.Vector_3;
d : in math.Real ) return btPlane
is
begin
return (normal => n,
dist => d);
end to_btPlane;
function PlaneFlip (Self : in btPlane) return btPlane
is
use Math;
begin
return to_btPlane (-Self.normal,
-Self.dist);
end PlaneFlip;
function coplanar (a, b : in btPlane) return Boolean
is
begin
return a = b
or else a = PlaneFlip (b);
end coplanar;
-------------
--- HalfEdge
--
function to_HalfEdge (ea : Integer;
v : Integer;
p : Integer) return HalfEdge
is
begin
return (ea => ea,
v => v,
p => p);
end to_HalfEdge;
------------
--- ConvexH
--
use type Flags;
COPLANAR_Flag : constant Flags := 0;
UNDER_Flag : constant Flags := 1;
OVER_Flag : constant Flags := 2;
SPLIT_Flag : constant Flags := OVER_Flag or UNDER_Flag;
PAPERWIDTH : constant := 0.001;
planetestepsilon : constant math.Real := PAPERWIDTH;
function to_ConvexH (vertices_size,
edges_size,
facets_size : in Positive) return ConvexH
is
use ada.Containers;
Self : ConvexH;
begin
Self.vertices.set_Length (Count_type (vertices_size));
Self.edges .set_Length (Count_type ( edges_size));
Self.facets .set_Length (Count_type (facets_size));
return Self;
end to_ConvexH;
---------
--- int4
--
function to_int4 (x, y, z, w : in Integer) return int4
is
begin
return (x => x,
y => y,
z => z,
w => w);
end to_int4;
function Element (Self : in int4; i : in Integer) return Integer
is
begin
case i
is
when 1 => return Self.x;
when 2 => return Self.y;
when 3 => return Self.z;
when 4 => return Self.w;
when others => raise Program_Error;
end case;
end Element;
function Element (Self : access int4; i : in Integer) return access Integer
is
begin
case i
is
when 1 => return Self.x'Access;
when 2 => return Self.y'Access;
when 3 => return Self.z'Access;
when 4 => return Self.w'Access;
when others => raise Program_Error;
end case;
end Element;
----------------
--- HullLibrary
--
function m_vertexIndexMapping (Self : access HullLibrary) return access Containers.Integer_Vector
is
begin
return Self.m_vertexIndexMapping'Access;
end m_vertexIndexMapping;
procedure ReleaseHull (result : in out PHullResult)
is
use type ada.containers.Count_type;
begin
if result.m_Indices.Length /= 0 then
result.m_Indices.clear;
end if;
result.mVcount := 0;
result.mIndexCount := 0;
result.mVertices := null;
end ReleaseHull;
function CreateConvexHull (Self : access HullLibrary; desc : in HullDesc 'Class; -- describes the input request
result : access HullResult'Class) -- contains the result
return HullError
is
use ada.Containers;
ret : HullError := QE_FAIL;
hr : aliased PHullResult;
vcount : constant Natural := Natural'Max (desc.mVcount, 8);
vertexSource : aliased vector_3_Array := (1 .. vcount => <>);
scale : aliased math.Vector_3;
ovcount : aliased Natural;
ok : Boolean;
begin
-- vertexSource.set_Length (Count_type (vcount));
-- Normalize point cloud, remove duplicates !
--
ok := Self.CleanupVertices (desc.mVcount, desc.mVertices, desc.mVertexStride,
ovcount'Access, vertexSource'Access,
desc.mNormalEpsilon,
scale'Access);
if ok then
-- Scale vertices back to their original size.
--
for i in 1 .. ovcount
loop
declare
use impact.d3.Vector;
v : math.Vector_3 renames vertexSource (i);
begin
v := Scaled (v, by => Scale);
-- v (1) := V (1) * scale[0];
-- v[1]*=scale[1];
-- v[2]*=scale[2];
end;
end loop;
ok := Self.ComputeHull (ovcount, vertexSource'Access, hr'Access, desc.mMaxVertices);
if ok then
declare
vertexScratch : aliased Vector_3_Array := (1 .. hr.mVcount => <>);
begin
-- vertexScratch.set_length (hr.mVcount);
-- Re-index triangle mesh so it refers to only used vertices, rebuild a new vertex table.
--
Self.BringOutYourDead (hr.mVertices, hr.mVcount, vertexScratch'Access,
ovcount, hr.m_Indices'Access, hr.mIndexCount);
ret := QE_OK;
if desc.HasHullFlag (QF_TRIANGLES) then -- if he wants the results as triangle!
result.mPolygons := False;
result.mNumOutputVertices := ovcount;
-- result.m_OutputVertices.set_Length (Count_type (ovcount));
result.m_OutputVertices := new vector_3_Array'(1 .. ovcount => <>);
result.mNumFaces := hr.mFaceCount;
result.mNumIndices := hr.mIndexCount;
result.m_Indices.set_Length (Count_type (hr.mIndexCount));
result.m_OutputVertices.all (1 .. ovcount) := vertexScratch (1 .. ovcount);
-- memcpy(&result.m_OutputVertices[0], &vertexScratch[0], sizeof(impact.d3.Vector)*ovcount );
if desc.HasHullFlag (QF_REVERSE_ORDER) then
declare
source : TUIntArray renames hr .m_Indices;
dest : TUIntArray renames result.m_Indices;
Offset : Integer := 0;
begin
for i in 1 .. hr.mFaceCount
loop
dest (Offset + 1) := source.Element (Offset + 3);
dest (Offset + 2) := source.Element (Offset + 2);
dest (Offset + 3) := source.Element (Offset + 1);
Offset := Offset + 3;
end loop;
end;
else
for i in 1 .. hr.mIndexCount
loop
result.m_Indices.replace_Element (i, hr.m_Indices (i));
end loop;
-- memcpy(&result.m_Indices[0], &hr.m_Indices[0], sizeof(unsigned int)*hr.mIndexCount);
end if;
else
result.mPolygons := True;
result.mNumOutputVertices := ovcount;
result.m_OutputVertices := new vector_3_Array'(1 .. ovcount => <>);
result.mNumFaces := hr.mFaceCount;
result.mNumIndices := hr.mIndexCount + hr.mFaceCount;
result.m_Indices.set_Length (Count_type (result.mNumIndices));
result.m_OutputVertices (1 .. ovcount) := vertexScratch (1 .. ovcount);
-- memcpy(&result.m_OutputVertices[0], &vertexScratch[0], sizeof(impact.d3.Vector)*ovcount );
declare
source : TUIntArray renames hr .m_Indices;
dest : TUIntArray renames result.m_Indices;
d_Offset : Integer := 0;
s_Offset : Integer := 0;
begin
for i in 1 .. hr.mFaceCount
loop
dest (d_Offset + 1) := 3;
if desc.HasHullFlag (QF_REVERSE_ORDER) then
dest (d_Offset + 2) := source.Element (s_Offset + 3);
dest (d_Offset + 3) := source.Element (s_Offset + 2);
dest (d_Offset + 4) := source.Element (s_Offset + 1);
else
dest (d_Offset + 2) := source.Element (s_Offset + 1);
dest (d_Offset + 3) := source.Element (s_Offset + 2);
dest (d_Offset + 4) := source.Element (s_Offset + 3);
end if;
d_Offset := d_Offset + 4;
s_Offset := s_Offset + 3;
end loop;
end;
end if;
ReleaseHull (hr);
end;
end if;
end if;
return ret;
end CreateConvexHull;
function ReleaseResult (Self : in HullLibrary; result : access HullResult'Class) -- release memory allocated for this result, we are done with it.
return HullError
is
pragma Unreferenced (Self);
use type ada.containers.Count_type;
procedure free is new ada.unchecked_Deallocation (vector_3_Array, access_vector_3_Array);
begin
if result.m_OutputVertices /= null then
result.mNumOutputVertices := 0;
free (result.m_OutputVertices);
end if;
if result.m_Indices.Length /= 0 then
result.mNumIndices := 0;
result.m_Indices.clear;
end if;
return QE_OK;
end ReleaseResult;
---------
--- int3
--
package body int3_Forge
is
function to_int3 (x, y, z : in Integer) return int3
is
Self : constant int3 := (x, y, z);
begin
return Self;
end to_int3;
end int3_Forge;
function Element (Self : in int3; i : in Integer) return Integer
is
begin
case i
is
when 1 => return Self.x;
when 2 => return Self.y;
when 3 => return Self.z;
when others => raise Program_Error;
end case;
end Element;
function Element (Self : access int3; i : in Integer) return access Integer
is
begin
case i
is
when 1 => return Self.x'Access;
when 2 => return Self.y'Access;
when 3 => return Self.z'Access;
when others => raise Program_Error;
end case;
end Element;
-------------------
--- btHullTriangle
--
function to_btHullTriangle (a, b, c : in Integer) return btHullTriangle
is
Self : btHullTriangle := (int3_Forge.to_int3 (a, b, c) with others => <>);
begin
Self.n := (-1, -1, -1);
Self.vmax := -1;
Self.rise := 0.0;
return Self;
end to_btHullTriangle;
er : aliased Integer := -1;
function neib (Self : access btHullTriangle; a, b : in Integer) return access Integer
is
i1, i2 : Integer;
begin
for i in 1 .. 3
loop
i1 := (i + 1) mod 3;
i2 := (i + 2) mod 3;
if Self.Element (i) = a
and then Self.Element (i1) = b
then
return Self.n'Access.Element (i2);
end if;
if Self.Element (i) = b
and then Self.Element (i1) = a
then
return Self.n'Access.Element (i2);
end if;
end loop;
pragma Assert (False);
return er'Access;
end neib;
----------------
--- HullLibrary
--
--- HullLibrary - Utility
--
function PlaneTest (p : in btPlane;
v : in math.Vector_3) return Flags
is
use impact.d3.Vector, math.Vectors;
a : constant math.Real := dot (v, p.normal) + p.dist;
begin
if a > planetestepsilon then return OVER_Flag;
elsif a < -planetestepsilon then return UNDER_Flag;
else return COPLANAR_Flag;
end if;
end PlaneTest;
function SplitTest (convex : access ConvexH;
plane : in btPlane) return Flags
is
use impact.d3.Vector, math.Vectors;
Flag : Flags := 0;
begin
for i in 1 .. Integer (convex.vertices.Length)
loop
Flag := Flag or PlaneTest (plane,
convex.vertices (i));
end loop;
return Flag;
end SplitTest;
type VertFlag is
record
planetest,
junk,
undermap,
overmap : Integer;
end record;
type EdgeFlag is
record
planetest,
fixes,
undermap,
overmap : Integer;
end record;
type PlaneFlag is
record
undermap,
overmap : Integer;
end record;
type Coplanar_t is
record
ea,
v0,
v1 : Integer;
end record;
-- generic
-- type T is private;
-- with function Element (Self : in T; Index : in Integer) return math.Vector_3;
--
-- function maxdirfiltered (p : in T;
-- count : in Natural;
-- dir : in math.Vector_3;
-- allow : access bullet.Containers.integer_Vector) return Integer;
-- function maxdirfiltered (p : in T;
-- count : in Natural;
-- dir : in math.Vector_3;
-- allow : access bullet.Containers.integer_Vector) return Integer
-- is
-- use impact.d3.Vector;
--
-- pragma assert (count /= 0);
-- m : Integer := -1;
-- begin
-- for i in 1 .. count
-- loop
-- if allow.all (i) /= 0 then
--
-- if m = -1
-- or else dot (Element (p, i), dir)
-- > dot (Element (p, m), dir)
-- then
-- m := i;
-- end if;
--
-- end if;
-- end loop;
--
-- pragma assert (m /= -1);
--
-- return m;
-- end maxdirfiltered;
function maxdirfiltered (p : in Vector_3_Array;
count : in Natural;
dir : in math.Vector_3;
allow : access Containers.integer_Vector) return Integer
is
use impact.d3.Vector;
pragma Assert (count /= 0);
m : Integer := -1;
begin
for i in 1 .. count
loop
if allow.all (i) /= 0 then
if m = -1
or else dot (p (i), dir)
> dot (p (m), dir)
then
m := i;
end if;
end if;
end loop;
pragma Assert (m /= -1);
return m;
end maxdirfiltered;
function orth (v : in math.Vector_3) return math.Vector_3
is
use impact.d3.Vector;
a : constant math.Vector_3 := cross (v, (0.0, 0.0, 1.0));
b : constant math.Vector_3 := cross (v, (0.0, 1.0, 0.0));
begin
if length (a) > length (b) then return normalized (a);
else return normalized (b);
end if;
end orth;
function Element (Self : in Vector_3_array; Index : in Integer) return math.Vector_3
is
begin
return Self (Index);
end Element;
-- generic
-- type T is private;
-- with function Element (Self : in T; Index : in Integer) return math.Vector_3;
--
-- function maxdirsterid (p : in T;
-- count : in Natural;
-- dir : in math.Vector_3;
-- allow : access bullet.Containers.integer_Vector) return Integer;
function maxdirsterid (p : in Vector_3_array;
count : in Natural;
dir : in math.Vector_3;
allow : access Containers.integer_Vector) return Integer
is
use impact.d3.Vector;
-- function my_maxdirfiltered is new maxdirfiltered (T, Element);
m : Integer := -1;
x, xx : math.Real;
u, v : math.Vector_3;
ma : Integer := -1;
begin
while m = -1
loop
m := maxdirfiltered (p, count, dir, allow);
if allow.all (m) = 3 then
return m;
end if;
u := orth (dir);
v := cross (u, dir);
ma := -1;
x := 0.0;
while x <= 360.0
loop
declare
use math.Functions, Math;
s : constant math.Real := sin (impact.d3.Scalar.SIMD_RADS_PER_DEG * x);
c : constant math.Real := cos (impact.d3.Scalar.SIMD_RADS_PER_DEG * x);
mb : constant Integer := maxdirfiltered (p, count, dir + (u * s + v*c) * 0.025, allow);
mc : Integer;
begin
if ma = m
and then mb = m
then
allow.all (m) := 3;
return m;
end if;
if ma /= -1 -- Yuck - this is really ugly
and then ma /= mb
then
mc := ma;
xx := x - 40.0;
while xx <= x
loop
declare
s : constant math.Real := sin (impact.d3.Scalar.SIMD_RADS_PER_DEG * xx);
c : constant math.Real := cos (impact.d3.Scalar.SIMD_RADS_PER_DEG * xx);
md : constant Integer := maxdirfiltered (p, count, dir + (u * s + v*c) * 0.025, allow);
begin
if mc = m
and then md = m
then
allow.all (m) := 3;
return m;
end if;
mc := md;
xx := xx + 5.0;
end;
end loop;
end if;
ma := mb;
x := x + 45.0;
end;
end loop;
allow.all (m) := 0;
m := -1;
end loop;
pragma Assert (False);
return m;
end maxdirsterid;
function above (vertices : in vector_3_array;
t : in int3 ;
p : in math.Vector_3;
epsilon : in math.Real ) return Boolean
is
use impact.d3.Vector, Math;
n : constant math.Vector_3 := TriNormal (vertices (t.Element (1)),
vertices (t.Element (2)),
vertices (t.Element (3)));
begin
return dot (n, p - vertices (t.Element (1)))
> epsilon; -- EPSILON ???
end above;
function hasedge (t : in int3; a, b : in Integer) return Boolean
is
i1 : Integer;
begin
for i in 1 .. 3
loop
i1 := (i + 1) mod 3;
if t.Element (i) = a
and then t.Element (i1) = b
then
return True;
end if;
end loop;
return False;
end hasedge;
function hasvert (t : in int3; v : in Integer) return Boolean
is
begin
return t.Element (1) = v
or else t.Element (2) = v
or else t.Element (3) = v;
end hasvert;
function shareedge (a, b : in int3) return Boolean
is
i1 : Integer;
begin
for i in 1 .. 3
loop
i1 := (i + 1) mod 3;
if hasedge (a, b.Element (i1),
b.Element (i))
then
return True;
end if;
end loop;
return False;
end shareedge;
--- HullLibrary - Operations
--
function ComputeHull (Self : access HullLibrary; vcount : in Natural ;
vertices : access Vector_3_array ;
result : access PHullResult'Class;
vlimit : in Natural ) return Boolean
is
tris_count : aliased Natural;
ret : constant Integer := Self.calchull (vertices, vcount, result.m_Indices'Access, tris_count'Access, vlimit);
begin
if ret = 0 then
return False;
end if;
result.mIndexCount := tris_count * 3;
result.mFaceCount := tris_count;
result.mVertices := vertices;
result.mVcount := vcount;
return True;
end ComputeHull;
function allocateTriangle (Self : access HullLibrary; a, b, c : in Integer ) return btHullTriangle_view
is
tr : constant btHullTriangle_view := new btHullTriangle'(to_btHullTriangle (a, b, c));
begin
tr.id := Integer (Self.m_tris.Length);
Self.m_tris.append (tr);
return tr;
end allocateTriangle;
procedure deAllocateTriangle (Self : in out HullLibrary; the_Triangle : in out btHullTriangle_view)
is
pragma Assert (Self.m_tris (the_Triangle.id) = the_Triangle);
procedure free is new ada.unchecked_Deallocation (btHullTriangle'Class, btHullTriangle_view);
begin
Self.m_tris (the_Triangle.id) := null;
the_Triangle.destruct;
free (the_Triangle);
end deAllocateTriangle;
procedure b2bfix (Self : in out HullLibrary; s, t : in btHullTriangle_view)
is
begin
for i in 1 .. 3
loop
declare
i1 : constant Integer := (i + 1) mod 3;
i2 : constant Integer := (i + 2) mod 3;
a : constant Integer := s.Element (i1);
b : constant Integer := s.Element (i2);
pragma Assert (Self.m_tris.Element (s.neib (a, b).all).neib (b, a).all = s.id);
pragma Assert (Self.m_tris.Element (t.neib (a, b).all).neib (b, a).all = t.id);
begin
Self.m_tris.Element (s.neib (a, b).all).neib (b, a).all := t.neib (b, a).all;
Self.m_tris.Element (t.neib (b, a).all).neib (a, b).all := s.neib (a, b).all;
end;
end loop;
end b2bfix;
procedure removeb2b (Self : in out HullLibrary; s, t : in out btHullTriangle_view)
is
begin
Self.b2bfix (s, t);
Self.deAllocateTriangle (s);
Self.deAllocateTriangle (t);
end removeb2b;
procedure checkit (Self : in out HullLibrary; t : in btHullTriangle_view)
is
pragma Assert (Self.m_tris (t.id) = t);
begin
for i in 1 .. 3
loop
declare
i1 : constant Integer := (i + 1) mod 3;
i2 : constant Integer := (i + 2) mod 3;
a : constant Integer := t.Element (i1);
b : constant Integer := t.Element (i2);
begin
pragma Assert (a /= b);
pragma Assert (Self.m_tris.Element (t.n.Element (i)).neib (b, a).all = t.id);
null;
end;
end loop;
end checkit;
function extrudable (Self : in HullLibrary; epsilon : in math.Real ) return btHullTriangle_view
is
t : btHullTriangle_view;
begin
for i in 1 .. Integer (Self.m_tris.Length)
loop
if t = null
or else ( Self.m_tris (i) /= null
and then t.rise < Self.m_tris (i).rise)
then
t := Self.m_tris (i);
end if;
end loop;
if t.rise > epsilon then return t;
else return null;
end if;
end extrudable;
function calchull (Self : access HullLibrary; verts : access Vector_3_array;
verts_count : in Natural;
tris_out : access TUIntArray;
tris_count : access Natural;
vlimit : in Integer ) return Integer
is
use type ada.containers.Count_type;
rc : constant Integer := Self.calchullgen (verts, verts_count, vlimit);
ts : Containers.integer_vector;
begin
if rc = 0 then
return 0;
end if;
for i in 1 .. Integer (Self.m_tris.Length)
loop
if Self.m_tris (i) /= null then
for j in 1 .. 3
loop
ts.append (Self.m_tris (i).all.Element (j));
end loop;
Self.deAllocateTriangle (Self.m_tris (i));
end if;
end loop;
tris_count.all := Integer (ts.Length) / 3;
tris_out.set_Length (ts.Length);
for i in 1 .. Integer (ts.Length)
loop
tris_out.replace_Element (i, ts (i));
end loop;
Self.m_tris.set_Length (0);
return 1;
end calchull;
function calchullgen (Self : access HullLibrary; verts : access Vector_3_array;
verts_count : in Natural;
the_vlimit : in Natural ) return Integer
is
vlimit : Natural := the_vlimit;
begin
if verts_count < 4 then
return 0;
end if;
if vlimit = 0 then
vlimit := 1000000000;
end if;
declare
use impact.d3.Vector, Math, ada.Containers;
bmin : math.Vector_3 := verts (1);
bmax : math.Vector_3 := verts (1);
isextreme : Containers.integer_Vector;
allow : aliased Containers.integer_Vector;
epsilon : math.Real;
p : int4;
begin
isextreme.reserve_Capacity (Count_type (verts_count));
allow .reserve_Capacity (Count_type (verts_count));
for j in 1 .. verts_count
loop
allow.append (1);
isextreme.append (0);
setMin (bmin, verts (j));
setMax (bmax, verts (j));
end loop;
epsilon := length (bmax - bmin) * 0.001; pragma Assert (epsilon /= 0.0);
p := int4 (Self.FindSimplex (verts, verts_count, allow'Access));
if p.x = -1 then
return 0; -- simplex failed
end if;
declare
use int3_Forge;
center : constant math.Vector_3 := (verts (p.Element (1))
+ verts (p.Element (2))
+ verts (p.Element (3))
+ verts (p.Element (4)))
/ 4.0; -- a valid interior point
t0 : constant btHullTriangle_view := Self.allocateTriangle (p.Element (3), p.Element (4), p.Element (2));
t1 : constant btHullTriangle_view := Self.allocateTriangle (p.Element (4), p.Element (3), p.Element (1));
t2 : constant btHullTriangle_view := Self.allocateTriangle (p.Element (1), p.Element (2), p.Element (4));
t3 : constant btHullTriangle_view := Self.allocateTriangle (p.Element (2), p.Element (1), p.Element (3));
te : btHullTriangle_view;
begin
t0.n := to_int3 (3, 4, 2);
t1.n := to_int3 (4, 3, 1);
t2.n := to_int3 (1, 2, 4);
t3.n := to_int3 (2, 1, 3);
isextreme (p.Element (1)) := 1;
isextreme (p.Element (2)) := 1;
isextreme (p.Element (3)) := 1;
isextreme (p.Element (4)) := 1;
Self.checkit (t0);
Self.checkit (t1);
Self.checkit (t2);
Self.checkit (t3);
for j in 1 .. Integer (Self.m_tris.Length)
loop
declare
t : constant btHullTriangle_view := Self.m_tris (j);
pragma Assert (t /= null);
pragma Assert (t.vmax < 0);
n : constant math.Vector_3 := TriNormal (verts (t.Element (1)),
verts (t.Element (2)),
verts (t.Element (3)));
begin
t.vmax := maxdirsterid (verts.all, verts_count, n, allow'Access);
t.rise := dot (n, verts (t.vmax) - verts (t.Element (1)));
end;
end loop;
vlimit := vlimit - 4;
loop
exit when vlimit = 0;
te := Self.extrudable (epsilon);
exit when te = null;
declare
ti : int3 := int3 (te.all);
v : constant Integer := te.vmax;
pragma Assert (v /= -1);
pragma Assert (isextreme (v) = 0); -- wtf we've already done this vertex
j : Integer;
begin
isextreme (v) := 1;
-- // if(v==p0 || v==p1 || v==p2 || v==p3) continue; -- done these already
j := Integer (Self.m_tris.Length);
while j /= 0
loop
j := j - 1;
if Self.m_tris (j) /= null then
declare
t : constant int3 := int3 (Self.m_tris (j).all);
begin
if above (verts.all, t, verts (v), 0.01 * epsilon) then
Self.extrude (Self.m_tris (j), v);
end if;
end;
end if;
end loop;
-- now check for those degenerate cases where we have a flipped triangle or a really skinny triangle
j := Integer (Self.m_tris.Length);
while j /= 0
loop
j := j - 1;
if Self.m_tris (j) /= null then
exit when not hasvert (int3 (Self.m_tris.Element (j).all), v);
declare
nt : constant int3 := int3 (Self.m_tris (j).all);
begin
if above (verts.all, nt, center, 0.01 * epsilon)
or else length (cross (verts (nt.Element (1)) - verts (nt.Element (0)),
verts (nt.Element (2)) - verts (nt.Element (1)))) < epsilon * epsilon * 0.1
then
declare
nb : btHullTriangle_view := Self.m_tris (Self.m_tris (j).n.Element (1));
pragma Assert (nb /= null);
pragma Assert (not hasvert (int3 (nb.all), v));
pragma Assert (nb.id < j);
begin
Self.extrude (nb, v);
j := Integer (Self.m_tris.Length);
end;
end if;
end;
end if;
end loop;
j := Integer (Self.m_tris.Length);
while j /= 0
loop
declare
t : constant btHullTriangle_view := Self.m_tris (j);
n : math.Vector_3;
begin
j := j - 1;
if t /= null then
exit when t.vmax >= 0;
n := TriNormal (verts (t.Element (1)),
verts (t.Element (2)),
verts (t.Element (3)));
t.vmax := maxdirsterid (verts.all, verts_count, n, allow'Access);
if isextreme (t.vmax) /= 0 then
t.vmax := -1; -- already done that vertex - algorithm needs to be able to terminate.
else
t.rise := dot (n, verts (t.vmax) - verts (t.Element (1)));
end if;
end if;
end;
end loop;
vlimit := vlimit - 1;
end;
end loop;
end;
end;
return 1;
end calchullgen;
function FindSimplex (Self : in HullLibrary; verts : access Vector_3_array;
verts_count : in Natural;
allow : access Containers.integer_Vector) return int4'Class
is
pragma Unreferenced (Self);
use impact.d3.Vector, Math;
basis : array (1 .. 3) of math.Vector_3 := ((0.01, 0.02, 1.0), others => <>);
p0 : constant Integer := maxdirsterid (verts.all, verts_count, basis (1), allow);
p1 : constant Integer := maxdirsterid (verts.all, verts_count, -basis (1), allow);
p2,
p3 : Integer;
procedure swap is new Any_swap (Integer);
begin
basis (1) := verts (p0) - verts (p1);
if p0 = p1
or else basis (1) = math.Origin_3d
then
return to_int4 (-1, -1, -1, -1);
end if;
basis (2) := cross ((1.00, 0.02, 0.0), basis (1));
basis (3) := cross ((-0.02, 1.00, 0.0), basis (1));
if length (basis (2)) > length (basis (3)) then
normalize (basis (2));
else
basis (2) := basis (3);
normalize (basis (2));
end if;
p2 := maxdirsterid (verts.all, verts_count, basis (2), allow);
if p2 = p0 or else p2 = p1 then
p2 := maxdirsterid (verts.all, verts_count, -basis (2), allow);
end if;
if p2 = p0 or else p2 = p1 then
return to_int4 (-1, -1, -1, -1);
end if;
basis (2) := verts (p2) - verts (p0);
basis (3) := normalized (cross (basis (2), basis (1)));
p3 := maxdirsterid (verts.all, verts_count, basis (3), allow);
if p3 = p0 or else p3 = p1 or else p3 = p2 then
p3 := maxdirsterid (verts.all, verts_count, -basis (3), allow);
end if;
if p3 = p0 or else p3 = p1 or else p3 = p2 then
return to_int4 (-1, -1, -1, -1);
end if;
pragma Assert (not (p0 = p1 or else p0 = p2 or else p0 = p3 or else p1 = p2 or else p1 = p3 or else p2 = p3));
if dot (verts (p3) - verts (p0),
cross (verts (p1) - verts (p0),
verts (p2) - verts (p0))) < 0.0
then
swap (p2, p3);
end if;
return to_int4 (p0, p1, p2, p3);
end FindSimplex;
-- function ConvexHCrop (Self : in HullLibrary; convex : access ConvexH'Class;
-- slice : in btPlane'Class) return access ConvexH'Class
-- is
-- begin
-- return ;
-- end;
procedure extrude (Self : in out HullLibrary; t0 : in out btHullTriangle_view;
v : in Integer)
is
use int3_Forge;
t : constant int3 := int3 (t0.all);
n : constant Natural := Natural (Self.m_tris.Length);
ta : btHullTriangle_view := Self.allocateTriangle (v, t.Element (2), t.Element (3));
tb,
tc : btHullTriangle_view;
begin
ta.n := to_int3 (t0.n.Element (1), n + 1, n + 2);
Self.m_tris.Element (t0.n.Element (1)).neib (t.Element (2), t.Element (3)).all := n + 0;
tb := Self.allocateTriangle (v, t.Element (3), t.Element (1));
tb.n := to_int3 (t0.n.Element (2), n + 2, n + 0);
Self.m_tris.Element (t0.n.Element (2)).neib (t.Element (3), t.Element (1)).all := n + 1;
tc := Self.allocateTriangle (v, t.Element (1), t.Element (2));
tc.n := to_int3 (t0.n.Element (3), n + 0, n + 1);
Self.m_tris.Element (t0.n.Element (3)).neib (t.Element (1), t.Element (2)).all := n + 2;
Self.checkit (ta);
Self.checkit (tb);
Self.checkit (tc);
-- if hasvert (int3 (Self.m_tris (ta.n.Element (1)).all), v) then Self.removeb2b (ta, Self.m_tris (ta.n.Element (1))); end if;
-- if hasvert (int3 (Self.m_tris (tb.n.Element (1)).all), v) then Self.removeb2b (tb, Self.m_tris (tb.n.Element (1))); end if;
-- if hasvert (int3 (Self.m_tris (tc.n.Element (1)).all), v) then Self.removeb2b (tc, Self.m_tris (tc.n.Element (1))); end if;
declare
my_ta : btHullTriangle_view := Self.m_tris (ta.n.Element (1));
my_tb : btHullTriangle_view := Self.m_tris (tb.n.Element (1));
my_tc : btHullTriangle_view := Self.m_tris (tc.n.Element (1));
begin
if hasvert (int3 (Self.m_tris (ta.n.Element (1)).all), v) then Self.removeb2b (ta, my_ta); end if;
if hasvert (int3 (Self.m_tris (tb.n.Element (1)).all), v) then Self.removeb2b (tb, my_tb); end if;
if hasvert (int3 (Self.m_tris (tc.n.Element (1)).all), v) then Self.removeb2b (tc, my_tc); end if;
end;
Self.deAllocateTriangle (t0);
end extrude;
-- XXX, might be broken
--
procedure addPoint (vcount : in out Integer;
p : access vector_3_Array;
x, y, z : in math.Real)
is
dest : math.Vector_3 renames p (vcount);
begin
dest := (x, y, z);
vcount := vcount + 1;
end addPoint;
function GetDist (px, py, pz : in math.Real;
p2 : in math.vector_3) return math.Real
is
dx : constant math.Real := px - p2 (1);
dy : constant math.Real := py - p2 (2);
dz : constant math.Real := pz - p2 (3);
begin
return dx * dx + dy*dy + dz*dz;
end GetDist;
procedure BringOutYourDead (Self : in out HullLibrary; verts : access Vector_3_Array;
vcount : in Natural;
overts : access Vector_3_Array;
ocount : out Natural;
indices : access Containers.integer_Vector;
indexcount : in Natural)
is
use ada.Containers;
tmpIndices : Containers.integer_Vector;
usedIndices : TUIntArray;
v : Integer;
begin
tmpIndices.set_Length (Self.m_vertexIndexMapping.Length);
for i in 1 .. Integer (Self.m_vertexIndexMapping.Length)
loop
tmpIndices (i) := Self.m_vertexIndexMapping.Element (i);
end loop;
usedIndices.append (0, count => Count_type (vcount)); -- memset(&usedIndices[0],0,sizeof(unsigned int)*vcount);
ocount := 0;
for i in 1 .. indexcount
loop
v := indices.all (i); -- original array index
pragma Assert ( v >= 0
and then v < vcount);
if usedIndices (v) /= 0 then -- already remapped
indices.all (i) := usedIndices (v) - 1; -- index to new array
else
indices.all (i) := ocount; -- new index mapping
overts (ocount)(1) := verts (v)(1); -- copy old vert to new vert array
overts (ocount)(2) := verts (v)(2);
overts (ocount)(3) := verts (v)(3);
for k in 1 .. Integer (Self.m_vertexIndexMapping.Length)
loop
if tmpIndices (k) = v then
Self.m_vertexIndexMapping (k) := ocount;
end if;
end loop;
ocount := ocount + 1; -- increment output vert count
pragma Assert ( ocount >= 0
and then ocount <= vcount);
usedIndices (v) := ocount; -- assign new index remapping
end if;
end loop;
end BringOutYourDead;
function CleanupVertices (Self : access HullLibrary; svcount : in Natural;
svertices : access vector_3_Array;
stride : in Integer;
vcount : access Natural; -- output number of vertices
vertices : access vector_3_Array; -- location to store the results
normalepsilon : in math.Real;
scale : access math.Vector_3) return Boolean
is
pragma Unreferenced (stride);
EPSILON : constant := 0.000001; -- close enough to consider two impact.d3.Scalaring point numbers to be 'the same'.
FLT_MAX : constant := math.Real'Last;
recip : Math.Vector_3;
bmin, bmax : math.Vector_3;
center : math.Vector_3;
dx, dy, dz : math.Real;
begin
if svcount = 0 then
return False;
end if;
Self.m_vertexIndexMapping.set_Length (0);
vcount.all := 0;
recip := (0.0, 0.0, 0.0);
if scale /= null then
scale (1) := 1.0;
scale (2) := 1.0;
scale (3) := 1.0;
end if;
bmin := (FLT_MAX, FLT_MAX, FLT_MAX);
bmax := (-FLT_MAX, -FLT_MAX, -FLT_MAX);
-- const char *vtx = (const char *) svertices;
for i in 1 .. svcount
loop
declare
-- const impact.d3.Scalar *p = (const impact.d3.Scalar *) vtx;
p : math.Vector_3 renames svertices (i);
begin
-- vtx := vtx + stride;
for j in 1 .. 3
loop
if p (j) < bmin (j) then bmin (j) := p (j); end if;
if p (j) > bmax (j) then bmax (j) := p (j); end if;
end loop;
end;
end loop;
dx := bmax (1) - bmin (1);
dy := bmax (2) - bmin (2);
dz := bmax (3) - bmin (3);
center (1) := dx * 0.5 + bmin (1);
center (2) := dy * 0.5 + bmin (2);
center (3) := dz * 0.5 + bmin (3);
if dx < EPSILON or else dy < EPSILON or else dz < EPSILON or else svcount < 3
then
declare
len : math.Real := FLT_MAX;
x1, x2,
y1, y2,
z1, z2 : math.Real;
begin
if dx > EPSILON and then dx < len then len := dx; end if;
if dy > EPSILON and then dy < len then len := dy; end if;
if dz > EPSILON and then dz < len then len := dz; end if;
if len = FLT_MAX then
dx := 0.01; -- one centimeter
dy := 0.01;
dz := 0.01;
else
if dx < EPSILON then dx := len * 0.05; end if; -- 1/5th the shortest non-zero edge.
if dy < EPSILON then dy := len * 0.05; end if;
if dz < EPSILON then dz := len * 0.05; end if;
end if;
x1 := center (1) - dx;
x2 := center (1) + dx;
y1 := center (2) - dy;
y2 := center (2) + dy;
z1 := center (3) - dz;
z2 := center (3) + dz;
addPoint (vcount.all, vertices, x1, y1, z1);
addPoint (vcount.all, vertices, x2, y1, z1);
addPoint (vcount.all, vertices, x2, y2, z1);
addPoint (vcount.all, vertices, x1, y2, z1);
addPoint (vcount.all, vertices, x1, y1, z2);
addPoint (vcount.all, vertices, x2, y1, z2);
addPoint (vcount.all, vertices, x2, y2, z2);
addPoint (vcount.all, vertices, x1, y2, z2);
return True; -- Return cube
end;
else
if scale /= null then
scale (1) := dx;
scale (2) := dy;
scale (3) := dz;
recip (1) := 1.0 / dx;
recip (2) := 1.0 / dy;
recip (3) := 1.0 / dz;
center (1) := center (1) * recip (1);
center (2) := center (2) * recip (2);
center (3) := center (3) * recip (3);
end if;
end if;
-- vtx := (const char *) svertices;
for i in 1 .. svcount
loop
declare
-- const impact.d3.Vector *p = (const impact.d3.Vector *)vtx;
p : math.Vector_3 renames svertices (i);
-- vtx+=stride;
px : math.Real := p (1);
py : math.Real := p (2);
pz : math.Real := p (3);
j : Integer;
begin
if scale /= null then
px := px * recip (1); -- normalize
py := py * recip (2);
pz := pz * recip (3);
end if;
j := 1;
loop
declare
-- XXX might be broken
v : math.Vector_3 renames vertices (j);
x : constant math.Real := v (1);
y : constant math.Real := v (2);
z : constant math.Real := v (3);
dx : constant math.Real := abs (x - px);
dy : constant math.Real := abs (y - py);
dz : math.Real := abs (z - pz);
dist1,
dist2 : math.Real;
begin
if dx < normalepsilon
and then dy < normalepsilon
and then dz < normalepsilon
then
-- ok, it is close enough to the old one
-- now let us see if it is further from the center of the point cloud than the one we already recorded.
-- in which case we keep this one instead.
dist1 := GetDist ( px, py, pz, center);
dist2 := GetDist (v (1), v (2), v (3), center);
if dist1 > dist2 then
v (1) := px;
v (2) := py;
v (3) := pz;
end if;
exit;
end if;
exit when j = vcount.all;
j := j + 1;
end;
end loop;
if j = vcount.all then
declare
dest : math.Vector_3 renames vertices (vcount.all);
begin
dest (1) := px;
dest (2) := py;
dest (3) := pz;
vcount.all := vcount.all + 1;
end;
end if;
Self.m_vertexIndexMapping.append (j);
end;
end loop;
-- Ok, now make sure we didn't prune so many vertices it is now invalid.
--
bmin := (FLT_MAX, FLT_MAX, FLT_MAX);
bmax := (-FLT_MAX, -FLT_MAX, -FLT_MAX);
for i in 1 .. vcount.all
loop
declare
p : math.Vector_3 renames vertices (i);
begin
for j in 1 .. 3
loop
if p (j) < bmin (j) then bmin (j) := p (j); end if;
if p (j) > bmax (j) then bmax (j) := p (j); end if;
end loop;
end;
end loop;
dx := bmax (1) - bmin (1);
dy := bmax (2) - bmin (2);
dz := bmax (3) - bmin (3);
if dx < EPSILON
or else dy < EPSILON
or else dz < EPSILON
or else vcount.all < 3
then
declare
cx : math.Real := dx * 0.5 + bmin (1);
cy : math.Real := dy * 0.5 + bmin (2);
cz : math.Real := dz * 0.5 + bmin (3);
len : math.Real := FLT_MAX;
x1, y1, z1 : math.Real;
x2, y2, z2 : math.Real;
begin
if dx >= EPSILON and then dx < len then len := dx; end if;
if dy >= EPSILON and then dy < len then len := dy; end if;
if dz >= EPSILON and then dz < len then len := dz; end if;
if len = FLT_MAX then
dx := 0.01; -- one centimeter
dy := 0.01;
dz := 0.01;
else
if dx < EPSILON then dx := len * 0.05; end if; -- 1/5th the shortest non-zero edge.
if dy < EPSILON then dy := len * 0.05; end if;
if dz < EPSILON then dz := len * 0.05; end if;
end if;
x1 := cx - dx;
x2 := cx + dx;
y1 := cy - dy;
y2 := cy + dy;
z1 := cz - dz;
z2 := cz + dz;
vcount.all := 0; -- add box
addPoint (vcount.all, vertices, x1, y1, z1);
addPoint (vcount.all, vertices, x2, y1, z1);
addPoint (vcount.all, vertices, x2, y2, z1);
addPoint (vcount.all, vertices, x1, y2, z1);
addPoint (vcount.all, vertices, x1, y1, z2);
addPoint (vcount.all, vertices, x2, y1, z2);
addPoint (vcount.all, vertices, x2, y2, z2);
addPoint (vcount.all, vertices, x1, y2, z2);
return True;
end;
end if;
return True;
end CleanupVertices;
end impact.d3.convex_Hull;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . E X N _ I N T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body System.Exn_Int is
-----------------
-- Exn_Integer --
-----------------
function Exn_Integer (Left : Integer; Right : Natural) return Integer is
pragma Suppress (Division_Check);
pragma Suppress (Overflow_Check);
Result : Integer := 1;
Factor : Integer := Left;
Exp : Natural := Right;
begin
-- We use the standard logarithmic approach, Exp gets shifted right
-- testing successive low order bits and Factor is the value of the
-- base raised to the next power of 2.
-- Note: it is not worth special casing base values -1, 0, +1 since
-- the expander does this when the base is a literal, and other cases
-- will be extremely rare.
if Exp /= 0 then
loop
if Exp rem 2 /= 0 then
Result := Result * Factor;
end if;
Exp := Exp / 2;
exit when Exp = 0;
Factor := Factor * Factor;
end loop;
end if;
return Result;
end Exn_Integer;
end System.Exn_Int;
|
-- Copyright (c) 2015-2017 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with XML.SAX.Writers;
with Incr.Documents;
with Incr.Parsers.Incremental;
package Incr.Debug is
package P renames Incr.Parsers.Incremental.Parser_Data_Providers;
procedure Dump
(Doc : Incr.Documents.Document'Class;
Provider : P.Parser_Data_Provider'Class;
Output : in out XML.SAX.Writers.SAX_Writer'Class);
end Incr.Debug;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . L O N G _ M K S _ I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 2018-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Provides output facilities for the Long_Float MKS dimension system (see
-- System.Dim.Long_Mks and System.Dim.Float_IO).
with System.Dim.Long_Mks; use System.Dim.Long_Mks;
with System.Dim.Float_IO;
package System.Dim.Long_Mks_IO is new System.Dim.Float_IO (Mks_Type);
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ W I D E _ U N B O U N D E D . A U X --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body Ada.Strings.Wide_Wide_Unbounded.Aux is
--------------------------
-- Get_Wide_Wide_String --
--------------------------
procedure Get_Wide_Wide_String
(U : Unbounded_Wide_Wide_String;
S : out Big_Wide_Wide_String_Access;
L : out Natural)
is
X : aliased Big_Wide_Wide_String;
for X'Address use U.Reference.Data'Address;
begin
S := X'Unchecked_Access;
L := U.Reference.Last;
end Get_Wide_Wide_String;
--------------------------
-- Set_Wide_Wide_String --
--------------------------
procedure Set_Wide_Wide_String
(UP : in out Unbounded_Wide_Wide_String;
S : Wide_Wide_String_Access)
is
X : Wide_Wide_String_Access := S;
begin
Set_Unbounded_Wide_Wide_String (UP, S.all);
Free (X);
end Set_Wide_Wide_String;
end Ada.Strings.Wide_Wide_Unbounded.Aux;
|
-----------------------------------------------------------------------
-- gen-model-list -- List bean interface for model objects
-- Copyright (C) 2009, 2010, 2011, 2012, 2018 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package body Gen.Model.List is
-- ------------------------------
-- Make an iterator for the list.
-- ------------------------------
function Iterate (Container : in List_Definition)
return List_Iterator.Forward_Iterator'Class is
begin
return Result : constant Iterator := (List => Container.Self);
end Iterate;
-- ------------------------------
-- Make an iterator for the list.
-- ------------------------------
function Element_Value (Container : in List_Definition;
Pos : in Cursor)
return T_Access is
pragma Unreferenced (Container);
begin
return Element (Pos);
end Element_Value;
overriding
function First (Object : in Iterator) return Cursor is
begin
return Object.List.First;
end First;
overriding
function Next (Object : in Iterator;
Pos : in Cursor) return Cursor is
pragma Unreferenced (Object);
C : Cursor := Pos;
begin
Next (C);
return C;
end Next;
-- ------------------------------
-- Compare the two definitions.
-- ------------------------------
function "<" (Left, Right : in T_Access) return Boolean is
Left_Name : constant String := Left.Get_Name;
Right_Name : constant String := Right.Get_Name;
begin
return Left_Name < Right_Name;
end "<";
-- ------------------------------
-- Get the first item of the list
-- ------------------------------
function First (Def : List_Definition) return Cursor is
begin
return Def.Nodes.First;
end First;
-- ------------------------------
-- Get the number of elements in the list.
-- ------------------------------
overriding
function Get_Count (From : List_Definition) return Natural is
Count : constant Natural := Natural (From.Nodes.Length);
begin
return Count;
end Get_Count;
-- ------------------------------
-- Set the current row index. Valid row indexes start at 1.
-- ------------------------------
overriding
procedure Set_Row_Index (From : in out List_Definition;
Index : in Natural) is
begin
From.Row := Index;
if Index > 0 then
declare
Current : constant T_Access := From.Nodes.Element (Index - 1);
Bean : constant Util.Beans.Basic.Readonly_Bean_Access := Current.all'Access;
begin
Current.Set_Index (Index);
From.Value_Bean := Util.Beans.Objects.To_Object (Bean, Util.Beans.Objects.STATIC);
end;
else
From.Value_Bean := Util.Beans.Objects.Null_Object;
end if;
end Set_Row_Index;
-- ------------------------------
-- Get the element at the current row index.
-- ------------------------------
overriding
function Get_Row (From : List_Definition) return Util.Beans.Objects.Object is
begin
return From.Value_Bean;
end Get_Row;
-- ------------------------------
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
-- ------------------------------
overriding
function Get_Value (From : List_Definition;
Name : String) return Util.Beans.Objects.Object is
begin
if Name = "size" then
return Util.Beans.Objects.To_Object (From.Get_Count);
else
return Util.Beans.Objects.Null_Object;
end if;
end Get_Value;
-- ------------------------------
-- Append the item in the list
-- ------------------------------
procedure Append (Def : in out List_Definition;
Item : in T_Access) is
begin
Def.Nodes.Append (Item);
end Append;
-- ------------------------------
-- Sort the list of items on their names.
-- ------------------------------
procedure Sort (List : in out List_Definition) is
begin
Sorting.Sort (List.Nodes);
end Sort;
procedure Sort_On (List : in out List_Definition) is
package Sorting is new Vectors.Generic_Sorting;
begin
Sorting.Sort (List.Nodes);
end Sort_On;
-- ------------------------------
-- Find a definition given the name.
-- Returns the definition object or null.
-- ------------------------------
function Find (Def : in List_Definition;
Name : in String) return T_Access is
Iter : Vectors.Cursor := Def.Nodes.First;
begin
while Vectors.Has_Element (Iter) loop
if Vectors.Element (Iter).Get_Name = Name then
return Vectors.Element (Iter);
end if;
Vectors.Next (Iter);
end loop;
return null;
end Find;
-- ------------------------------
-- Iterate over the elements of the list executing the <tt>Process</tt> procedure.
-- ------------------------------
procedure Iterate (Def : in List_Definition;
Process : not null access procedure (Item : in T_Access)) is
Iter : Vectors.Cursor := Def.Nodes.First;
begin
while Vectors.Has_Element (Iter) loop
Process (Vectors.Element (Iter));
Vectors.Next (Iter);
end loop;
end Iterate;
end Gen.Model.List;
|
-- Copyright 2015-2017 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Bar; use Bar;
procedure Foo_O224_021 is
O1 : constant Object_Type := Get_Str ("Foo");
procedure Child1 is
O2 : constant Object_Type := Get_Str ("Foo");
function Child2 (S : String) return Boolean is -- STOP
begin
for C of S loop
Do_Nothing (C);
if C = 'o' then
return True;
end if;
end loop;
return False;
end Child2;
R : Boolean;
begin
R := Child2 ("Foo");
R := Child2 ("Bar");
R := Child2 ("Foobar");
end Child1;
begin
Child1;
end Foo_O224_021;
|
pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with SDL_SDL_stdinc_h;
with SDL_SDL_keysym_h;
with Interfaces.C.Strings;
package SDL_SDL_keyboard_h is
SDL_ALL_HOTKEYS : constant := 16#FFFFFFFF#; -- ../include/SDL/SDL_keyboard.h:67
SDL_DEFAULT_REPEAT_DELAY : constant := 500; -- ../include/SDL/SDL_keyboard.h:84
SDL_DEFAULT_REPEAT_INTERVAL : constant := 30; -- ../include/SDL/SDL_keyboard.h:85
type SDL_keysym is record
scancode : aliased SDL_SDL_stdinc_h.Uint8; -- ../include/SDL/SDL_keyboard.h:60
sym : aliased SDL_SDL_keysym_h.SDLKey; -- ../include/SDL/SDL_keyboard.h:61
c_mod : aliased SDL_SDL_keysym_h.SDLMod; -- ../include/SDL/SDL_keyboard.h:62
unicode : aliased SDL_SDL_stdinc_h.Uint16; -- ../include/SDL/SDL_keyboard.h:63
end record;
pragma Convention (C_Pass_By_Copy, SDL_keysym); -- ../include/SDL/SDL_keyboard.h:59
function SDL_EnableUNICODE (enable : int) return int; -- ../include/SDL/SDL_keyboard.h:82
pragma Import (C, SDL_EnableUNICODE, "SDL_EnableUNICODE");
function SDL_EnableKeyRepeat (c_delay : int; interval : int) return int; -- ../include/SDL/SDL_keyboard.h:98
pragma Import (C, SDL_EnableKeyRepeat, "SDL_EnableKeyRepeat");
procedure SDL_GetKeyRepeat (c_delay : access int; interval : access int); -- ../include/SDL/SDL_keyboard.h:99
pragma Import (C, SDL_GetKeyRepeat, "SDL_GetKeyRepeat");
function SDL_GetKeyState (numkeys : access int) return access SDL_SDL_stdinc_h.Uint8; -- ../include/SDL/SDL_keyboard.h:110
pragma Import (C, SDL_GetKeyState, "SDL_GetKeyState");
function SDL_GetModState return SDL_SDL_keysym_h.SDLMod; -- ../include/SDL/SDL_keyboard.h:115
pragma Import (C, SDL_GetModState, "SDL_GetModState");
procedure SDL_SetModState (modstate : SDL_SDL_keysym_h.SDLMod); -- ../include/SDL/SDL_keyboard.h:121
pragma Import (C, SDL_SetModState, "SDL_SetModState");
function SDL_GetKeyName (key : SDL_SDL_keysym_h.SDLKey) return Interfaces.C.Strings.chars_ptr; -- ../include/SDL/SDL_keyboard.h:126
pragma Import (C, SDL_GetKeyName, "SDL_GetKeyName");
end SDL_SDL_keyboard_h;
|
package ItsyBitsy_UART_Interrupt_Handlers is
UART0_Data_Received : Boolean := False;
private
procedure UART0_IRQ_Handler
with Export => True,
Convention => C,
External_Name => "isr_irq20";
end ItsyBitsy_UART_Interrupt_Handlers;
|
-----------------------------------------------------------------------
-- babel-stores -- Storage management
-- Copyright (C) 2014, 2015, 2016 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 Babel.Files;
with Babel.Files.Buffers;
with Babel.Filters;
with Babel.Streams;
with Babel.Streams.Refs;
package Babel.Stores is
type Store_Type is limited interface;
type Store_Type_Access is access all Store_Type'Class;
-- Open a file in the store to read its content with a stream.
procedure Open_File (Store : in out Store_Type;
Path : in String;
Stream : out Babel.Streams.Stream_Access) is abstract;
-- Open a file in the store to read its content with a stream.
procedure Read_File (Store : in out Store_Type;
Path : in String;
Stream : out Babel.Streams.Refs.Stream_Ref) is abstract;
-- Write a file in the store with a stream.
procedure Write_File (Store : in out Store_Type;
Path : in String;
Stream : in Babel.Streams.Refs.Stream_Ref;
Mode : in Babel.Files.File_Mode) is abstract;
procedure Read (Store : in out Store_Type;
Path : in String;
Into : in out Babel.Files.Buffers.Buffer) is abstract;
procedure Write (Store : in out Store_Type;
Path : in String;
Into : in Babel.Files.Buffers.Buffer) is abstract;
procedure Scan (Store : in out Store_Type;
Path : in String;
Into : in out Babel.Files.File_Container'Class;
Filter : in Babel.Filters.Filter_Type'Class) is abstract;
end Babel.Stores;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . F L O A T _ M K S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2018-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Dim.Generic_Mks;
package System.Dim.Float_Mks is new System.Dim.Generic_Mks (Float);
|
-- Copyright 2008, 2009, 2010, 2011 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 body Pck is
procedure Do_Nothing (A : System.Address) is
begin
null;
end Do_Nothing;
end Pck;
|
-------------------------------------------------------------------------------
--
-- FIXED TYPES
--
-- Fixed_Short & Fixed_Sat_Short definitions
--
-- The MIT License (MIT)
--
-- Copyright (c) 2015 Gustavo A. Hoffmann
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to
-- deal in the Software without restriction, including without limitation the
-- rights to use, copy, modify, merge, publish, distribute, sublicense, and /
-- or sell copies of the Software, and to permit persons to whom the Software
-- is furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
-- IN THE SOFTWARE.
-------------------------------------------------------------------------------
-- with Ada.Text_IO; use Ada.Text_IO;
package body Fixed_Types.Short is
overriding
function "abs" (A : Fixed_Sat_Short) return Fixed_Sat_Short is
begin
if A = Fixed_Sat_Short'First then
return Fixed_Sat_Short'Last;
else
return Fixed_Sat_Short (abs Fixed_Short (A));
end if;
end "abs";
overriding
function "+" (A, B : Fixed_Sat_Short) return Fixed_Sat_Short is
pragma Suppress (Overflow_Check);
C : Fixed_Integer_Short;
Zero : constant Fixed_Integer_Short := 0;
begin
C := To_Fixed_Integer_Short (A) + To_Fixed_Integer_Short (B);
if A > 0.0 and then B > 0.0 and then C < Zero then
return Fixed_Sat_Short'Last;
elsif A < 0.0 and then B < 0.0 and then C > Zero then
return Fixed_Sat_Short'First;
else
return To_Fixed_Sat_Short (C);
end if;
end "+";
overriding
function "-" (A, B : Fixed_Sat_Short) return Fixed_Sat_Short is
pragma Suppress (Overflow_Check);
C : Fixed_Integer_Short;
Zero : constant Fixed_Integer_Short := 0;
begin
C := To_Fixed_Integer_Short (A) - To_Fixed_Integer_Short (B);
if A > 0.0 and then B < 0.0 and then C < Zero then
return Fixed_Sat_Short'Last;
elsif A < 0.0 and then B > 0.0 and then C > Zero then
return Fixed_Sat_Short'First;
else
return To_Fixed_Sat_Short (C);
end if;
end "-";
overriding
function "-" (A : Fixed_Sat_Short) return Fixed_Sat_Short is
pragma Suppress (Overflow_Check);
begin
if A = Fixed_Sat_Short'First then
return Fixed_Sat_Short'Last;
else
return Fixed_Sat_Short (-Fixed_Short (A));
end if;
end "-";
not overriding
function "*" (A, B : Fixed_Sat_Short) return Fixed_Sat_Short is
pragma Suppress (Overflow_Check);
begin
if A = Fixed_Sat_Short'First and then B = Fixed_Sat_Short'First then
return Fixed_Sat_Short'Last;
else
return Fixed_Sat_Short (Fixed_Short (A) * Fixed_Short (B));
end if;
end "*";
overriding
function "*" (A : Fixed_Sat_Short; B : Integer) return Fixed_Sat_Short is
pragma Unsuppress (Overflow_Check);
begin
return Fixed_Sat_Short (Fixed_Short (A) * B);
exception
when Constraint_Error =>
if (A > 0.0 and B > 0) or (A < 0.0 and B < 0) then
return Fixed_Sat_Short'Last;
else
return Fixed_Sat_Short'First;
end if;
end "*";
end Fixed_Types.Short;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2017, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This program demonstrates reading the VBat (battery voltage) value from
-- an ADC unit, using polling.
-- Note that you will likely need to reset the board manually after loading.
with Last_Chance_Handler; pragma Unreferenced (Last_Chance_Handler);
with STM32.Board; use STM32.Board;
with STM32.Device; use STM32.Device;
with HAL; use HAL;
with STM32.ADC; use STM32.ADC;
with STM32.GPIO; use STM32.GPIO;
with LCD_Std_Out;
procedure Demo_ADC_VBat_Polling is
Counts : UInt32;
Voltage : UInt32; -- in millivolts
Successful : Boolean;
Timed_Out : exception;
procedure Print (X, Y : Natural; Value : UInt32; Suffix : String := "");
-----------
-- Print --
-----------
procedure Print (X, Y : Natural; Value : UInt32; Suffix : String := "") is
Value_Image : constant String := Value'Img;
begin
LCD_Std_Out.Put (X, Y, Value_Image (2 .. Value_Image'Last) & Suffix & " ");
end Print;
begin
Initialize_LEDs;
Enable_Clock (VBat.ADC.all);
Reset_All_ADC_Units;
Configure_Common_Properties
(Mode => Independent,
Prescalar => PCLK2_Div_2,
DMA_Mode => Disabled,
Sampling_Delay => Sampling_Delay_5_Cycles);
Configure_Unit
(VBat.ADC.all,
Resolution => ADC_Resolution_12_Bits,
Alignment => Right_Aligned);
Configure_Regular_Conversions
(VBat.ADC.all,
Continuous => False,
Trigger => Software_Triggered,
Enable_EOC => True,
Conversions => (1 => (VBat.Channel, Sample_Time => Sample_112_Cycles)));
Enable (VBat.ADC.all);
loop
Start_Conversion (VBat.ADC.all);
Poll_For_Status (VBat.ADC.all, Regular_Channel_Conversion_Complete, Successful);
if not Successful then
raise Timed_Out;
end if;
Counts := UInt32 (Conversion_Value (VBat.ADC.all));
Print (0, 0, Counts);
Voltage := ((Counts * VBat_Bridge_Divisor) * ADC_Supply_Voltage) / 16#FFF#;
-- 16#FFF# because we are using 12-bit conversion resolution
Print (0, 24, Voltage, "mv");
Green_LED.Toggle;
end loop;
end Demo_ADC_VBat_Polling;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Classes;
with AMF.String_Collections;
with AMF.UML.Actions.Collections;
with AMF.UML.Behavioral_Features;
with AMF.UML.Behaviored_Classifiers;
with AMF.UML.Behaviors.Collections;
with AMF.UML.Classes.Collections;
with AMF.UML.Classifier_Template_Parameters;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Collaboration_Uses.Collections;
with AMF.UML.Connectable_Elements.Collections;
with AMF.UML.Connectors.Collections;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Element_Imports.Collections;
with AMF.UML.Extensions.Collections;
with AMF.UML.Features.Collections;
with AMF.UML.Gates.Collections;
with AMF.UML.General_Orderings.Collections;
with AMF.UML.Generalization_Sets.Collections;
with AMF.UML.Generalizations.Collections;
with AMF.UML.Interaction_Fragments.Collections;
with AMF.UML.Interaction_Operands;
with AMF.UML.Interactions;
with AMF.UML.Interface_Realizations.Collections;
with AMF.UML.Lifelines.Collections;
with AMF.UML.Messages.Collections;
with AMF.UML.Named_Elements.Collections;
with AMF.UML.Namespaces;
with AMF.UML.Operations.Collections;
with AMF.UML.Package_Imports.Collections;
with AMF.UML.Packageable_Elements.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Parameter_Sets.Collections;
with AMF.UML.Parameterable_Elements.Collections;
with AMF.UML.Parameters.Collections;
with AMF.UML.Ports.Collections;
with AMF.UML.Properties.Collections;
with AMF.UML.Receptions.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.Redefinable_Template_Signatures;
with AMF.UML.String_Expressions;
with AMF.UML.Substitutions.Collections;
with AMF.UML.Template_Bindings.Collections;
with AMF.UML.Template_Parameters;
with AMF.UML.Template_Signatures;
with AMF.UML.Types;
with AMF.UML.Use_Cases.Collections;
with AMF.Visitors;
package AMF.Internals.UML_Interactions is
type UML_Interaction_Proxy is
limited new AMF.Internals.UML_Classes.UML_Class_Proxy
and AMF.UML.Interactions.UML_Interaction with null record;
overriding function Get_Action
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Actions.Collections.Set_Of_UML_Action;
-- Getter of Interaction::action.
--
-- Actions owned by the Interaction.
overriding function Get_Formal_Gate
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Gates.Collections.Set_Of_UML_Gate;
-- Getter of Interaction::formalGate.
--
-- Specifies the gates that form the message interface between this
-- Interaction and any InteractionUses which reference it.
overriding function Get_Fragment
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Interaction_Fragments.Collections.Ordered_Set_Of_UML_Interaction_Fragment;
-- Getter of Interaction::fragment.
--
-- The ordered set of fragments in the Interaction.
overriding function Get_Lifeline
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Lifelines.Collections.Set_Of_UML_Lifeline;
-- Getter of Interaction::lifeline.
--
-- Specifies the participants in this Interaction.
overriding function Get_Message
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Messages.Collections.Set_Of_UML_Message;
-- Getter of Interaction::message.
--
-- The Messages contained in this Interaction.
overriding function Get_Context
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Behaviored_Classifiers.UML_Behaviored_Classifier_Access;
-- Getter of Behavior::context.
--
-- The classifier that is the context for the execution of the behavior.
-- If the behavior is owned by a BehavioredClassifier, that classifier is
-- the context. Otherwise, the context is the first BehavioredClassifier
-- reached by following the chain of owner relationships. For example,
-- following this algorithm, the context of an entry action in a state
-- machine is the classifier that owns the state machine. The features of
-- the context classifier as well as the elements visible to the context
-- classifier are visible to the behavior.
overriding function Get_Is_Reentrant
(Self : not null access constant UML_Interaction_Proxy)
return Boolean;
-- Getter of Behavior::isReentrant.
--
-- Tells whether the behavior can be invoked while it is still executing
-- from a previous invocation.
overriding procedure Set_Is_Reentrant
(Self : not null access UML_Interaction_Proxy;
To : Boolean);
-- Setter of Behavior::isReentrant.
--
-- Tells whether the behavior can be invoked while it is still executing
-- from a previous invocation.
overriding function Get_Owned_Parameter
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Parameters.Collections.Ordered_Set_Of_UML_Parameter;
-- Getter of Behavior::ownedParameter.
--
-- References a list of parameters to the behavior which describes the
-- order and type of arguments that can be given when the behavior is
-- invoked and of the values which will be returned when the behavior
-- completes its execution.
overriding function Get_Owned_Parameter_Set
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Parameter_Sets.Collections.Set_Of_UML_Parameter_Set;
-- Getter of Behavior::ownedParameterSet.
--
-- The ParameterSets owned by this Behavior.
overriding function Get_Postcondition
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Behavior::postcondition.
--
-- An optional set of Constraints specifying what is fulfilled after the
-- execution of the behavior is completed, if its precondition was
-- fulfilled before its invocation.
overriding function Get_Precondition
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Behavior::precondition.
--
-- An optional set of Constraints specifying what must be fulfilled when
-- the behavior is invoked.
overriding function Get_Redefined_Behavior
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Behaviors.Collections.Set_Of_UML_Behavior;
-- Getter of Behavior::redefinedBehavior.
--
-- References a behavior that this behavior redefines. A subtype of
-- Behavior may redefine any other subtype of Behavior. If the behavior
-- implements a behavioral feature, it replaces the redefined behavior. If
-- the behavior is a classifier behavior, it extends the redefined
-- behavior.
overriding function Get_Specification
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Behavioral_Features.UML_Behavioral_Feature_Access;
-- Getter of Behavior::specification.
--
-- Designates a behavioral feature that the behavior implements. The
-- behavioral feature must be owned by the classifier that owns the
-- behavior or be inherited by it. The parameters of the behavioral
-- feature and the implementing behavior must match. A behavior does not
-- need to have a specification, in which case it either is the classifer
-- behavior of a BehavioredClassifier or it can only be invoked by another
-- behavior of the classifier.
overriding procedure Set_Specification
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Behavioral_Features.UML_Behavioral_Feature_Access);
-- Setter of Behavior::specification.
--
-- Designates a behavioral feature that the behavior implements. The
-- behavioral feature must be owned by the classifier that owns the
-- behavior or be inherited by it. The parameters of the behavioral
-- feature and the implementing behavior must match. A behavior does not
-- need to have a specification, in which case it either is the classifer
-- behavior of a BehavioredClassifier or it can only be invoked by another
-- behavior of the classifier.
overriding function Get_Extension
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Extensions.Collections.Set_Of_UML_Extension;
-- Getter of Class::extension.
--
-- References the Extensions that specify additional properties of the
-- metaclass. The property is derived from the extensions whose memberEnds
-- are typed by the Class.
overriding function Get_Is_Abstract
(Self : not null access constant UML_Interaction_Proxy)
return Boolean;
-- Getter of Class::isAbstract.
--
-- True when a class is abstract.
-- If true, the Classifier does not provide a complete declaration and can
-- typically not be instantiated. An abstract classifier is intended to be
-- used by other classifiers e.g. as the target of general
-- metarelationships or generalization relationships.
overriding function Get_Is_Active
(Self : not null access constant UML_Interaction_Proxy)
return Boolean;
-- Getter of Class::isActive.
--
-- Determines whether an object specified by this class is active or not.
-- If true, then the owning class is referred to as an active class. If
-- false, then such a class is referred to as a passive class.
overriding procedure Set_Is_Active
(Self : not null access UML_Interaction_Proxy;
To : Boolean);
-- Setter of Class::isActive.
--
-- Determines whether an object specified by this class is active or not.
-- If true, then the owning class is referred to as an active class. If
-- false, then such a class is referred to as a passive class.
overriding function Get_Nested_Classifier
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Classifiers.Collections.Ordered_Set_Of_UML_Classifier;
-- Getter of Class::nestedClassifier.
--
-- References all the Classifiers that are defined (nested) within the
-- Class.
overriding function Get_Owned_Attribute
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Properties.Collections.Ordered_Set_Of_UML_Property;
-- Getter of Class::ownedAttribute.
--
-- The attributes (i.e. the properties) owned by the class.
overriding function Get_Owned_Operation
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Operations.Collections.Ordered_Set_Of_UML_Operation;
-- Getter of Class::ownedOperation.
--
-- The operations owned by the class.
overriding function Get_Owned_Reception
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Receptions.Collections.Set_Of_UML_Reception;
-- Getter of Class::ownedReception.
--
-- Receptions that objects of this class are willing to accept.
overriding function Get_Super_Class
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Classes.Collections.Set_Of_UML_Class;
-- Getter of Class::superClass.
--
-- This gives the superclasses of a class.
overriding function Get_Classifier_Behavior
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Behaviors.UML_Behavior_Access;
-- Getter of BehavioredClassifier::classifierBehavior.
--
-- A behavior specification that specifies the behavior of the classifier
-- itself.
overriding procedure Set_Classifier_Behavior
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Behaviors.UML_Behavior_Access);
-- Setter of BehavioredClassifier::classifierBehavior.
--
-- A behavior specification that specifies the behavior of the classifier
-- itself.
overriding function Get_Interface_Realization
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Interface_Realizations.Collections.Set_Of_UML_Interface_Realization;
-- Getter of BehavioredClassifier::interfaceRealization.
--
-- The set of InterfaceRealizations owned by the BehavioredClassifier.
-- Interface realizations reference the Interfaces of which the
-- BehavioredClassifier is an implementation.
overriding function Get_Owned_Behavior
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Behaviors.Collections.Set_Of_UML_Behavior;
-- Getter of BehavioredClassifier::ownedBehavior.
--
-- References behavior specifications owned by a classifier.
overriding function Get_Attribute
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property;
-- Getter of Classifier::attribute.
--
-- Refers to all of the Properties that are direct (i.e. not inherited or
-- imported) attributes of the classifier.
overriding function Get_Collaboration_Use
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Collaboration_Uses.Collections.Set_Of_UML_Collaboration_Use;
-- Getter of Classifier::collaborationUse.
--
-- References the collaboration uses owned by the classifier.
overriding function Get_Feature
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature;
-- Getter of Classifier::feature.
--
-- Specifies each feature defined in the classifier.
-- Note that there may be members of the Classifier that are of the type
-- Feature but are not included in this association, e.g. inherited
-- features.
overriding function Get_General
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of Classifier::general.
--
-- Specifies the general Classifiers for this Classifier.
-- References the general classifier in the Generalization relationship.
overriding function Get_Generalization
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Generalizations.Collections.Set_Of_UML_Generalization;
-- Getter of Classifier::generalization.
--
-- Specifies the Generalization relationships for this Classifier. These
-- Generalizations navigaten to more general classifiers in the
-- generalization hierarchy.
overriding function Get_Inherited_Member
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Classifier::inheritedMember.
--
-- Specifies all elements inherited by this classifier from the general
-- classifiers.
overriding function Get_Is_Final_Specialization
(Self : not null access constant UML_Interaction_Proxy)
return Boolean;
-- Getter of Classifier::isFinalSpecialization.
--
-- If true, the Classifier cannot be specialized by generalization. Note
-- that this property is preserved through package merge operations; that
-- is, the capability to specialize a Classifier (i.e.,
-- isFinalSpecialization =false) must be preserved in the resulting
-- Classifier of a package merge operation where a Classifier with
-- isFinalSpecialization =false is merged with a matching Classifier with
-- isFinalSpecialization =true: the resulting Classifier will have
-- isFinalSpecialization =false.
overriding procedure Set_Is_Final_Specialization
(Self : not null access UML_Interaction_Proxy;
To : Boolean);
-- Setter of Classifier::isFinalSpecialization.
--
-- If true, the Classifier cannot be specialized by generalization. Note
-- that this property is preserved through package merge operations; that
-- is, the capability to specialize a Classifier (i.e.,
-- isFinalSpecialization =false) must be preserved in the resulting
-- Classifier of a package merge operation where a Classifier with
-- isFinalSpecialization =false is merged with a matching Classifier with
-- isFinalSpecialization =true: the resulting Classifier will have
-- isFinalSpecialization =false.
overriding function Get_Owned_Template_Signature
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access;
-- Getter of Classifier::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding procedure Set_Owned_Template_Signature
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access);
-- Setter of Classifier::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding function Get_Owned_Use_Case
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case;
-- Getter of Classifier::ownedUseCase.
--
-- References the use cases owned by this classifier.
overriding function Get_Powertype_Extent
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Generalization_Sets.Collections.Set_Of_UML_Generalization_Set;
-- Getter of Classifier::powertypeExtent.
--
-- Designates the GeneralizationSet of which the associated Classifier is
-- a power type.
overriding function Get_Redefined_Classifier
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of Classifier::redefinedClassifier.
--
-- References the Classifiers that are redefined by this Classifier.
overriding function Get_Representation
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access;
-- Getter of Classifier::representation.
--
-- References a collaboration use which indicates the collaboration that
-- represents this classifier.
overriding procedure Set_Representation
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access);
-- Setter of Classifier::representation.
--
-- References a collaboration use which indicates the collaboration that
-- represents this classifier.
overriding function Get_Substitution
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Substitutions.Collections.Set_Of_UML_Substitution;
-- Getter of Classifier::substitution.
--
-- References the substitutions that are owned by this Classifier.
overriding function Get_Template_Parameter
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access;
-- Getter of Classifier::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding procedure Set_Template_Parameter
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access);
-- Setter of Classifier::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding function Get_Use_Case
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case;
-- Getter of Classifier::useCase.
--
-- The set of use cases for which this Classifier is the subject.
overriding function Get_Element_Import
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import;
-- Getter of Namespace::elementImport.
--
-- References the ElementImports owned by the Namespace.
overriding function Get_Imported_Member
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Getter of Namespace::importedMember.
--
-- References the PackageableElements that are members of this Namespace
-- as a result of either PackageImports or ElementImports.
overriding function Get_Member
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::member.
--
-- A collection of NamedElements identifiable within the Namespace, either
-- by being owned or by being introduced by importing or inheritance.
overriding function Get_Owned_Member
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::ownedMember.
--
-- A collection of NamedElements owned by the Namespace.
overriding function Get_Owned_Rule
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Namespace::ownedRule.
--
-- Specifies a set of Constraints owned by this Namespace.
overriding function Get_Package_Import
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import;
-- Getter of Namespace::packageImport.
--
-- References the PackageImports owned by the Namespace.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Interaction_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Get_Package
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Packages.UML_Package_Access;
-- Getter of Type::package.
--
-- Specifies the owning package of this classifier, if any.
overriding procedure Set_Package
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Packages.UML_Package_Access);
-- Setter of Type::package.
--
-- Specifies the owning package of this classifier, if any.
overriding function Get_Owning_Template_Parameter
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access;
-- Getter of ParameterableElement::owningTemplateParameter.
--
-- The formal template parameter that owns this element.
overriding procedure Set_Owning_Template_Parameter
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access);
-- Setter of ParameterableElement::owningTemplateParameter.
--
-- The formal template parameter that owns this element.
overriding function Get_Template_Parameter
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access;
-- Getter of ParameterableElement::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding procedure Set_Template_Parameter
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access);
-- Setter of ParameterableElement::templateParameter.
--
-- The template parameter that exposes this element as a formal parameter.
overriding function Get_Owned_Template_Signature
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Template_Signatures.UML_Template_Signature_Access;
-- Getter of TemplateableElement::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding procedure Set_Owned_Template_Signature
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Template_Signatures.UML_Template_Signature_Access);
-- Setter of TemplateableElement::ownedTemplateSignature.
--
-- The optional template signature specifying the formal template
-- parameters.
overriding function Get_Template_Binding
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Template_Bindings.Collections.Set_Of_UML_Template_Binding;
-- Getter of TemplateableElement::templateBinding.
--
-- The optional bindings from this element to templates.
overriding function Get_Is_Leaf
(Self : not null access constant UML_Interaction_Proxy)
return Boolean;
-- Getter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding procedure Set_Is_Leaf
(Self : not null access UML_Interaction_Proxy;
To : Boolean);
-- Setter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding function Get_Redefined_Element
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element;
-- Getter of RedefinableElement::redefinedElement.
--
-- The redefinable element that is being redefined by this element.
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of RedefinableElement::redefinitionContext.
--
-- References the contexts that this element may be redefined from.
overriding function Get_Owned_Port
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Ports.Collections.Set_Of_UML_Port;
-- Getter of EncapsulatedClassifier::ownedPort.
--
-- References a set of ports that an encapsulated classifier owns.
overriding function Get_Owned_Connector
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Connectors.Collections.Set_Of_UML_Connector;
-- Getter of StructuredClassifier::ownedConnector.
--
-- References the connectors owned by the classifier.
overriding function Get_Part
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property;
-- Getter of StructuredClassifier::part.
--
-- References the properties specifying instances that the classifier owns
-- by composition. This association is derived, selecting those owned
-- properties where isComposite is true.
overriding function Get_Role
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Connectable_Elements.Collections.Set_Of_UML_Connectable_Element;
-- Getter of StructuredClassifier::role.
--
-- References the roles that instances may play in this classifier.
overriding function Get_Covered
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Lifelines.Collections.Set_Of_UML_Lifeline;
-- Getter of InteractionFragment::covered.
--
-- References the Lifelines that the InteractionFragment involves.
overriding function Get_Enclosing_Interaction
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Interactions.UML_Interaction_Access;
-- Getter of InteractionFragment::enclosingInteraction.
--
-- The Interaction enclosing this InteractionFragment.
overriding procedure Set_Enclosing_Interaction
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Interactions.UML_Interaction_Access);
-- Setter of InteractionFragment::enclosingInteraction.
--
-- The Interaction enclosing this InteractionFragment.
overriding function Get_Enclosing_Operand
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Interaction_Operands.UML_Interaction_Operand_Access;
-- Getter of InteractionFragment::enclosingOperand.
--
-- The operand enclosing this InteractionFragment (they may nest
-- recursively)
overriding procedure Set_Enclosing_Operand
(Self : not null access UML_Interaction_Proxy;
To : AMF.UML.Interaction_Operands.UML_Interaction_Operand_Access);
-- Setter of InteractionFragment::enclosingOperand.
--
-- The operand enclosing this InteractionFragment (they may nest
-- recursively)
overriding function Get_General_Ordering
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.General_Orderings.Collections.Set_Of_UML_General_Ordering;
-- Getter of InteractionFragment::generalOrdering.
--
-- The general ordering relationships contained in this fragment.
overriding function Context
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Behaviored_Classifiers.UML_Behaviored_Classifier_Access;
-- Operation Behavior::context.
--
-- Missing derivation for Behavior::/context : BehavioredClassifier
overriding function Extension
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Extensions.Collections.Set_Of_UML_Extension;
-- Operation Class::extension.
--
-- Missing derivation for Class::/extension : Extension
overriding function Inherit
(Self : not null access constant UML_Interaction_Proxy;
Inhs : AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Class::inherit.
--
-- The inherit operation is overridden to exclude redefined properties.
overriding function Super_Class
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Classes.Collections.Set_Of_UML_Class;
-- Operation Class::superClass.
--
-- Missing derivation for Class::/superClass : Class
overriding function All_Features
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature;
-- Operation Classifier::allFeatures.
--
-- The query allFeatures() gives all of the features in the namespace of
-- the classifier. In general, through mechanisms such as inheritance,
-- this will be a larger set than feature.
overriding function Conforms_To
(Self : not null access constant UML_Interaction_Proxy;
Other : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean;
-- Operation Classifier::conformsTo.
--
-- The query conformsTo() gives true for a classifier that defines a type
-- that conforms to another. This is used, for example, in the
-- specification of signature conformance for operations.
overriding function General
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Operation Classifier::general.
--
-- The general classifiers are the classifiers referenced by the
-- generalization relationships.
overriding function Has_Visibility_Of
(Self : not null access constant UML_Interaction_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access)
return Boolean;
-- Operation Classifier::hasVisibilityOf.
--
-- The query hasVisibilityOf() determines whether a named element is
-- visible in the classifier. By default all are visible. It is only
-- called when the argument is something owned by a parent.
overriding function Inheritable_Members
(Self : not null access constant UML_Interaction_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Classifier::inheritableMembers.
--
-- The query inheritableMembers() gives all of the members of a classifier
-- that may be inherited in one of its descendants, subject to whatever
-- visibility restrictions apply.
overriding function Inherited_Member
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Classifier::inheritedMember.
--
-- The inheritedMember association is derived by inheriting the
-- inheritable members of the parents.
-- The inheritedMember association is derived by inheriting the
-- inheritable members of the parents.
overriding function Is_Template
(Self : not null access constant UML_Interaction_Proxy)
return Boolean;
-- Operation Classifier::isTemplate.
--
-- The query isTemplate() returns whether this templateable element is
-- actually a template.
overriding function May_Specialize_Type
(Self : not null access constant UML_Interaction_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean;
-- Operation Classifier::maySpecializeType.
--
-- The query maySpecializeType() determines whether this classifier may
-- have a generalization relationship to classifiers of the specified
-- type. By default a classifier may specialize classifiers of the same or
-- a more general type. It is intended to be redefined by classifiers that
-- have different specialization constraints.
overriding function Exclude_Collisions
(Self : not null access constant UML_Interaction_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::excludeCollisions.
--
-- The query excludeCollisions() excludes from a set of
-- PackageableElements any that would not be distinguishable from each
-- other in this namespace.
overriding function Get_Names_Of_Member
(Self : not null access constant UML_Interaction_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String;
-- Operation Namespace::getNamesOfMember.
--
-- The query getNamesOfMember() takes importing into account. It gives
-- back the set of names that an element would have in an importing
-- namespace, either because it is owned, or if not owned then imported
-- individually, or if not individually then from a package.
-- The query getNamesOfMember() gives a set of all of the names that a
-- member would have in a Namespace. In general a member can have multiple
-- names in a Namespace if it is imported more than once with different
-- aliases. The query takes account of importing. It gives back the set of
-- names that an element would have in an importing namespace, either
-- because it is owned, or if not owned then imported individually, or if
-- not individually then from a package.
overriding function Import_Members
(Self : not null access constant UML_Interaction_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importMembers.
--
-- The query importMembers() defines which of a set of PackageableElements
-- are actually imported into the namespace. This excludes hidden ones,
-- i.e., those which have names that conflict with names of owned members,
-- and also excludes elements which would have the same name when imported.
overriding function Imported_Member
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importedMember.
--
-- The importedMember property is derived from the ElementImports and the
-- PackageImports. References the PackageableElements that are members of
-- this Namespace as a result of either PackageImports or ElementImports.
overriding function Members_Are_Distinguishable
(Self : not null access constant UML_Interaction_Proxy)
return Boolean;
-- Operation Namespace::membersAreDistinguishable.
--
-- The Boolean query membersAreDistinguishable() determines whether all of
-- the namespace's members are distinguishable within it.
overriding function Owned_Member
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Namespace::ownedMember.
--
-- Missing derivation for Namespace::/ownedMember : NamedElement
overriding function All_Owning_Packages
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Interaction_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding function Conforms_To
(Self : not null access constant UML_Interaction_Proxy;
Other : AMF.UML.Types.UML_Type_Access)
return Boolean;
-- Operation Type::conformsTo.
--
-- The query conformsTo() gives true for a type that conforms to another.
-- By default, two types do not conform to each other. This query is
-- intended to be redefined for specific conformance situations.
overriding function Is_Compatible_With
(Self : not null access constant UML_Interaction_Proxy;
P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access)
return Boolean;
-- Operation ParameterableElement::isCompatibleWith.
--
-- The query isCompatibleWith() determines if this parameterable element
-- is compatible with the specified parameterable element. By default
-- parameterable element P is compatible with parameterable element Q if
-- the kind of P is the same or a subtype as the kind of Q. Subclasses
-- should override this operation to specify different compatibility
-- constraints.
overriding function Is_Template_Parameter
(Self : not null access constant UML_Interaction_Proxy)
return Boolean;
-- Operation ParameterableElement::isTemplateParameter.
--
-- The query isTemplateParameter() determines if this parameterable
-- element is exposed as a formal template parameter.
overriding function Parameterable_Elements
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Parameterable_Elements.Collections.Set_Of_UML_Parameterable_Element;
-- Operation TemplateableElement::parameterableElements.
--
-- The query parameterableElements() returns the set of elements that may
-- be used as the parametered elements for a template parameter of this
-- templateable element. By default, this set includes all the owned
-- elements. Subclasses may override this operation if they choose to
-- restrict the set of parameterable elements.
overriding function Is_Consistent_With
(Self : not null access constant UML_Interaction_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isConsistentWith.
--
-- The query isConsistentWith() specifies, for any two RedefinableElements
-- in a context in which redefinition is possible, whether redefinition
-- would be logically consistent. By default, this is false; this
-- operation must be overridden for subclasses of RedefinableElement to
-- define the consistency conditions.
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Interaction_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of this RedefinableElement are properly related
-- to the redefinition contexts of the specified RedefinableElement to
-- allow this element to redefine the other. By default at least one of
-- the redefinition contexts of this element must be a specialization of
-- at least one of the redefinition contexts of the specified element.
overriding function Owned_Port
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Ports.Collections.Set_Of_UML_Port;
-- Operation EncapsulatedClassifier::ownedPort.
--
-- Missing derivation for EncapsulatedClassifier::/ownedPort : Port
overriding function Part
(Self : not null access constant UML_Interaction_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property;
-- Operation StructuredClassifier::part.
--
-- Missing derivation for StructuredClassifier::/part : Property
overriding procedure Enter_Element
(Self : not null access constant UML_Interaction_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Interaction_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Interaction_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Interactions;
|
------------------------------------------------------------------------------
-- --
-- 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.Expressions.Hash is
new AMF.Elements.Generic_Hash (CMOF_Expression, CMOF_Expression_Access);
|
-------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- @author Alexander Senier
-- @date 2019-01-21
--
-- Copyright (C) 2018 Componolit GmbH
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
--
-- * Neither the name of the nor the names of its contributors may be used
-- to endorse or promote products derived from this software without
-- specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
-- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with LSC.Types;
with LSC.SHA1;
with LSC.SHA1.HMAC_Generic;
pragma Elaborate_All (LSC.SHA1.HMAC_Generic);
package LSC.SHA1.HMAC
is
pragma Pure;
function HMAC is new SHA1.HMAC_Generic.HMAC
(Types.Natural_Index, Types.Byte, Types.Bytes,
Types.Natural_Index, Types.Byte, Types.Bytes,
SHA1.Hash_Index, Types.Byte, SHA1.Hash_Type);
end LSC.SHA1.HMAC;
|
-----------------------------------------------------------------------
-- mat-readers-tests -- Unit tests for MAT readers
-- Copyright (C) 2014, 2015, 2019, 2021 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.Text_IO;
with Util.Test_Caller;
with MAT.Frames.Print;
package body MAT.Frames.Tests is
use Util.Tests;
package Caller is new Util.Test_Caller (Test, "Files");
procedure Verify_Frame (T : in out Test;
F : in Frame_Type;
Expect : in Frame_Table;
Message : in String);
function Create_Test_Frames return Frame_Type;
-- Builtin and well known definition of test frames.
Frame_1_0 : constant Frame_Table (1 .. 10) :=
(1_0, 1_2, 1_3, 1_4, 1_5, 1_6, 1_7, 1_8, 1_9, 1_10);
Frame_1_1 : constant Frame_Table (1 .. 15) :=
(1_0, 1_2, 1_3, 1_4, 1_5, 1_6, 1_7, 1_8, 1_9, 1_10,
1_11, 1_12, 1_13, 1_14, 1_15);
Frame_1_2 : constant Frame_Table (1 .. 16) :=
(1_0, 1_2, 1_3, 1_4, 1_5, 1_6, 1_7, 1_8, 1_9, 1_10,
1_11, 1_12, 1_13, 1_14, 1_20, 1_21);
Frame_1_3 : constant Frame_Table (1 .. 15) :=
(1_0, 1_2, 1_3, 1_4, 1_5, 1_6, 1_7, 1_8, 1_9, 1_10,
1_11, 1_12, 1_13, 1_14, 1_30);
Frame_2_0 : constant Frame_Table (1 .. 10) :=
(2_0, 2_2, 2_3, 2_4, 2_5, 2_6, 2_7, 2_8, 2_9, 2_10);
Frame_2_1 : constant Frame_Table (1 .. 10) :=
(2_0, 2_1, 2_1, 2_1, 2_1, 2_1, 2_1, 2_1, 2_1, 2_10);
Frame_2_2 : constant Frame_Table (1 .. 10) :=
(2_0, 2_1, 2_2, 2_1, 2_1, 2_1, 2_1, 2_1, 2_1, 2_1);
Frame_2_3 : constant Frame_Table (1 .. 10) :=
(2_0, 2_1, 2_2, 2_1, 2_1, 2_3, 2_1, 2_1, 2_1, 2_1);
Frame_3_0 : constant Frame_Table (1 .. 10) :=
(3_0, 3_1, 3_2, 3_3, 3_3, 3_4, 3_5, 3_6, 3_7, 3_8);
Frame_3_1 : constant Frame_Table (1 .. 10) :=
(3_0, 3_1, 3_2, 3_30, 3_3, 3_4, 3_5, 3_6, 3_7, 3_8);
Frame_3_2 : constant Frame_Table (1 .. 10) :=
(3_0, 3_1, 3_2, 3_31, 3_3, 3_4, 3_5, 3_6, 3_7, 3_8);
Frame_3_3 : constant Frame_Table (1 .. 10) :=
(3_0, 3_1, 3_2, 3_32, 3_3, 3_4, 3_5, 3_6, 3_7, 3_8);
Frame_3_4 : constant Frame_Table (1 .. 10) :=
(3_0, 3_1, 3_2, 3_32, 3_3, 3_4, 3_5, 3_61, 3_7, 3_8);
Frame_3_5 : constant Frame_Table (1 .. 10) :=
(3_0, 3_1, 3_2, 3_32, 3_3, 3_4, 3_5, 3_62, 3_7, 3_8);
Frame_3_6 : constant Frame_Table (1 .. 10) :=
(3_0, 3_1, 3_2, 3_32, 3_3, 3_4, 3_5, 3_63, 3_7, 3_8);
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test MAT.Frames.Insert",
Test_Simple_Frames'Access);
Caller.Add_Test (Suite, "Test MAT.Frames.Find",
Test_Find_Frames'Access);
Caller.Add_Test (Suite, "Test MAT.Frames.Backtrace",
Test_Complex_Frames'Access);
Caller.Add_Test (Suite, "Test MAT.Frames.Release",
Test_Release_Frames'Access);
end Add_Tests;
procedure Verify_Frame (T : in out Test;
F : in Frame_Type;
Expect : in Frame_Table;
Message : in String) is
use type MAT.Types.Target_Addr;
Len : constant Natural := Expect'Length;
Pc : constant Frame_Table := MAT.Frames.Backtrace (F);
begin
Util.Tests.Assert_Equals (T, Len, Pc'Length, "Invalid Backtrace length " & Message);
for I in Expect'Range loop
T.Assert (Expect (I) = Pc (I), "Backtrace PC " & Natural'Image (I) & " " & Message);
end loop;
end Verify_Frame;
-- ------------------------------
-- Create a tree with the well known test frames.
-- ------------------------------
function Create_Test_Frames return Frame_Type is
Root : constant Frame_Type := Create_Root;
F : Frame_Type;
begin
pragma Warnings (Off);
Insert (Root, Frame_1_0, F);
Insert (Root, Frame_1_1, F);
Insert (Root, Frame_1_2, F);
Insert (Root, Frame_1_3, F);
Insert (Root, Frame_2_0, F);
Insert (Root, Frame_2_1, F);
Insert (Root, Frame_2_2, F);
Insert (Root, Frame_2_3, F);
pragma Warnings (On);
return Root;
end Create_Test_Frames;
-- ------------------------------
-- Basic consistency checks when creating the test tree
-- ------------------------------
procedure Test_Simple_Frames (T : in out Test) is
Root : Frame_Type := Create_Root;
F : Frame_Type;
F_3_0 : Frame_Type;
F_3_1 : Frame_Type;
F_3_2 : Frame_Type;
F_3_3 : Frame_Type;
F_3_4 : Frame_Type;
F_3_5 : Frame_Type;
F_3_6 : Frame_Type;
begin
-- Consistency check on empty tree.
Util.Tests.Assert_Equals (T, 0, Count_Children (Root),
"Empty frame: Count_Children must return 0");
Util.Tests.Assert_Equals (T, 0, Current_Depth (Root),
"Empty frame: Current_Depth must return 0");
-- Insert first frame and verify consistency.
Insert (Root, Frame_1_0, F);
Util.Tests.Assert_Equals (T, 1, Count_Children (Root),
"Simple frame: Count_Children must return 1");
Util.Tests.Assert_Equals (T, 10, Current_Depth (F),
"Simple frame: Current_Depth must return 10");
Verify_Frame (T, F, Frame_1_0, "Frame_1_0");
-- Expect (Msg => "Frames.Count_Children",
-- Val => 1,
-- Result => Count_Children (Root));
-- Expect (Msg => "Frames.Count_Children(recursive)",
-- Val => 1,
-- Result => Count_Children (Root, True));
-- Expect (Msg => "Frames.Current_Depth",
-- Val => 10,
-- Result => Current_Depth (F));
Insert (Root, Frame_1_1, F);
Verify_Frame (T, F, Frame_1_1, "Frame_1_1");
Insert (Root, Frame_1_2, F);
Verify_Frame (T, F, Frame_1_2, "Frame_1_2");
Insert (Root, Frame_1_3, F);
Verify_Frame (T, F, Frame_1_3, "Frame_1_3");
if Verbose then
MAT.Frames.Print (Ada.Text_IO.Standard_Output, Root);
end if;
Util.Tests.Assert_Equals (T, 1, Count_Children (Root),
"Simple frame: Count_Children must return 1");
Util.Tests.Assert_Equals (T, 3, Count_Children (Root, True),
"Simple frame: Count_Children (recursive) must return 3");
Util.Tests.Assert_Equals (T, 15, Current_Depth (F),
"Simple frame: Current_Depth must return 15");
Insert (Root, Frame_2_0, F);
Verify_Frame (T, F, Frame_2_0, "Frame_2_0");
Insert (Root, Frame_2_1, F);
Verify_Frame (T, F, Frame_2_1, "Frame_2_1");
Insert (Root, Frame_2_2, F);
Verify_Frame (T, F, Frame_2_2, "Frame_2_2");
Insert (Root, Frame_2_3, F);
Verify_Frame (T, F, Frame_2_3, "Frame_2_3");
if Verbose then
MAT.Frames.Print (Ada.Text_IO.Standard_Output, Root);
end if;
Util.Tests.Assert_Equals (T, 2, Count_Children (Root),
"Simple frame: Count_Children must return 2");
Util.Tests.Assert_Equals (T, 7, Count_Children (Root, True),
"Simple frame: Count_Children (recursive) must return 7");
Util.Tests.Assert_Equals (T, 10, Current_Depth (F),
"Simple frame: Current_Depth must return 10");
Insert (Root, Frame_3_0, F_3_0);
Verify_Frame (T, F_3_0, Frame_3_0, "Frame_3_0");
Insert (Root, Frame_3_1, F_3_1);
Verify_Frame (T, F_3_1, Frame_3_1, "Frame_3_1");
Insert (Root, Frame_3_2, F_3_2);
Verify_Frame (T, F_3_2, Frame_3_2, "Frame_3_2");
Insert (Root, Frame_3_3, F_3_3);
Verify_Frame (T, F_3_3, Frame_3_3, "Frame_3_3");
Insert (Root, Frame_3_4, F_3_4);
Verify_Frame (T, F_3_4, Frame_3_4, "Frame_3_4");
Insert (Root, Frame_3_5, F_3_5);
Verify_Frame (T, F_3_5, Frame_3_5, "Frame_3_5");
Insert (Root, Frame_3_6, F_3_6);
Verify_Frame (T, F_3_6, Frame_3_6, "Frame_3_6");
Verify_Frame (T, F_3_5, Frame_3_5, "Frame_3_5");
Verify_Frame (T, F_3_4, Frame_3_4, "Frame_3_4");
Verify_Frame (T, F_3_3, Frame_3_3, "Frame_3_3");
Verify_Frame (T, F_3_2, Frame_3_2, "Frame_3_2");
Verify_Frame (T, F_3_1, Frame_3_1, "Frame_3_1");
Verify_Frame (T, F_3_0, Frame_3_0, "Frame_3_0");
Destroy (Root);
end Test_Simple_Frames;
-- ------------------------------
-- Test searching in the frame.
-- ------------------------------
procedure Test_Find_Frames (T : in out Test) is
Root : Frame_Type := Create_Test_Frames;
Result : Frame_Type with Unreferenced;
begin
begin
Result := Find (Root, 0);
T.Fail ("Frames.Find must raise a Not_Found exception");
exception
when Not_Found =>
null;
end;
Destroy (Root);
end Test_Find_Frames;
-- ------------------------------
-- Create a complex frame tree and run tests on it.
-- ------------------------------
procedure Test_Complex_Frames (T : in out Test) is
Pc : Frame_Table (1 .. 8) := (others => 0);
Root : Frame_Type := Create_Root;
procedure Create_Frame (Depth : in Natural);
procedure Create_Frame (Depth : in Natural) is
use type MAT.Types.Target_Addr;
F : Frame_Type;
begin
Pc (Depth) := MAT.Types.Target_Addr (Depth);
if Depth < Pc'Last then
Create_Frame (Depth + 1);
end if;
Insert (Root, Pc (1 .. Depth), F);
Pc (Depth) := MAT.Types.Target_Addr (Depth) + 1000;
Insert (Root, Pc (1 .. Depth), F);
if Depth < Pc'Last then
Create_Frame (Depth + 1);
end if;
declare
Read_Pc : constant Frame_Table := Backtrace (F);
begin
T.Assert (Read_Pc = Pc (1 .. Depth), "Frames.backtrace (same as inserted)");
if Verbose then
for I in Read_Pc'Range loop
Ada.Text_IO.Put (" " & MAT.Types.Target_Addr'Image (Read_Pc (I)));
end loop;
Ada.Text_IO.New_Line;
end if;
end;
end Create_Frame;
begin
Create_Frame (4);
if Verbose then
MAT.Frames.Print (Ada.Text_IO.Standard_Output, Root);
end if;
Destroy (Root);
end Test_Complex_Frames;
-- ------------------------------
-- Test allocating and releasing frames.
-- ------------------------------
procedure Test_Release_Frames (T : in out Test) is
Root : Frame_Type := Create_Root;
F1 : Frame_Type;
F2 : Frame_Type;
F3 : Frame_Type;
begin
Insert (Root, Frame_1_1, F1);
T.Assert (F1 /= null and then F1.Used > 0, "Insert must increment the root used count");
MAT.Frames.Print (Ada.Text_IO.Standard_Output, Root);
Insert (Root, Frame_1_2, F2);
MAT.Frames.Print (Ada.Text_IO.Standard_Output, Root);
Insert (Root, Frame_1_3, F3);
T.Assert (F3 /= null, "Insert frame 3 failed");
MAT.Frames.Print (Ada.Text_IO.Standard_Output, Root);
Ada.Text_IO.Put_Line (Ada.Text_IO.Standard_Output, "Release frame F1");
MAT.Frames.Print (Ada.Text_IO.Standard_Output, Root);
T.Assert (F2.Used > 0, "Release must not change other frames");
T.Assert (Root.Used > 0, "Release must not change root frame");
Destroy (Root);
end Test_Release_Frames;
end MAT.Frames.Tests;
|
-- SPDX-FileCopyrightText: 2021 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Cross_Reference_Updaters;
with Program.Elements.Discrete_Ranges;
with Program.Elements.Expressions;
with Program.Interpretations;
with Program.Visibility;
package Program.Complete_Contexts is
pragma Preelaborate;
procedure Resolve_To_Expected_Type
(Element : not null Program.Elements.Element_Access;
Sets : not null Program.Interpretations.Context_Access;
Setter : not null Program.Cross_Reference_Updaters
.Cross_Reference_Updater_Access;
Expect : Program.Visibility.View)
with Pre => Expect.Kind in Program.Visibility.Type_View_Kind;
procedure Resolve_To_Any_Type
(Element : not null Program.Elements.Expressions.Expression_Access;
Sets : not null Program.Interpretations.Context_Access;
Setter : not null Program.Cross_Reference_Updaters
.Cross_Reference_Updater_Access;
Result : out Program.Visibility.View);
procedure Resolve_To_Discrete_Type
(Element : not null Program.Elements.Expressions.Expression_Access;
Sets : not null Program.Interpretations.Context_Access;
Setter : not null Program.Cross_Reference_Updaters
.Cross_Reference_Updater_Access;
Result : out Program.Visibility.View);
private
function Up
(Element : not null access Program.Elements.Element'Class;
Sets : not null Program.Interpretations.Context_Access)
return Program.Interpretations.Interpretation_Set;
-- Visit subtree rooted at the Element and construct set of possible
-- interpretations for it.
procedure Down
(Element : not null access Program.Elements.Element'Class;
Solution : Program.Interpretations.Solution;
Setter : not null Program.Cross_Reference_Updaters
.Cross_Reference_Updater_Access;
Sets : not null Program.Interpretations.Context_Access);
-- Assign solution to the Element and all its children.
procedure Resolve_Parameters
(Arguments : Program.Interpretations.Interpretation_Set_Array;
Parameters : Program.Visibility.View_Array;
Callback : access procedure
(Down : Program.Interpretations.Solution_Array);
Down : in out Program.Interpretations.Solution_Array;
Index : Positive := 1);
-- For each parameter starting from Parameters (Index), find an
-- expression interpretation in Arguments provided that its type is an
-- expected type of the parameter. Then fill corresponding solutions in
-- Down and call Callback (Down).
end Program.Complete_Contexts;
|
--
-- Jan & Uwe R. Zimmer, Australia, July 2011
--
with Real_Type; use Real_Type;
generic
Dimension : Positive;
package Matrices is
type Matrix is array (1 .. Dimension, 1 .. Dimension) of Real;
-- function Image (Matrix : Matrix_3D) return String;
function "*" (A, B : Matrix) return Matrix;
function Transpose (M : Matrix) return Matrix;
end Matrices;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . O S _ P R I M I T I V E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1998-2020, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides low level primitives used to implement clock and
-- delays in non tasking applications.
-- The choice of the real clock/delay implementation (depending on whether
-- tasking is involved or not) is done via soft links (see s-soflin.ads)
-- NEVER add any dependency to tasking packages here
package System.OS_Primitives is
pragma Preelaborate;
Max_Sensible_Delay : constant Duration :=
Duration'Min (183 * 24 * 60 * 60.0,
Duration'Last);
-- Max of half a year delay, needed to prevent exceptions for large delay
-- values. It seems unlikely that any test will notice this restriction,
-- except in the case of applications setting the clock at run time (see
-- s-tastim.adb). Also note that a larger value might cause problems (e.g
-- overflow, or more likely OS limitation in the primitives used). In the
-- case where half a year is too long (which occurs in high integrity mode
-- with 32-bit words, and possibly on some specific ports of GNAT),
-- Duration'Last is used instead.
Max_System_Delay : constant Duration := Max_Sensible_Delay;
-- If the Max_System_Delay is larger it doesn't matter. Setting it equal
-- allows optimization of code in some targets delay functions.
procedure Initialize;
-- Initialize global settings related to this package. This procedure
-- should be called before any other subprograms in this package. Note
-- that this procedure can be called several times.
function Clock return Duration;
pragma Inline (Clock);
-- Returns "absolute" time, represented as an offset relative to "the
-- Epoch", which is Jan 1, 1970 00:00:00 UTC on UNIX systems. This
-- implementation is affected by system's clock changes.
Relative : constant := 0;
Absolute_Calendar : constant := 1;
Absolute_RT : constant := 2;
-- Values for Mode call below. Note that the compiler (exp_ch9.adb) relies
-- on these values. So any change here must be reflected in corresponding
-- changes in the compiler.
procedure Timed_Delay (Time : Duration; Mode : Integer);
-- Implements the semantics of the delay statement when no tasking is used
-- in the application.
--
-- Mode is one of the three values above
--
-- Time is a relative or absolute duration value, depending on Mode.
--
-- Note that currently Ada.Real_Time always uses the tasking run time,
-- so this procedure should never be called with Mode set to Absolute_RT.
-- This may change in future or bare board implementations.
end System.OS_Primitives;
|
------------------------------------------------------------------------------
-- AGAR GUI LIBRARY --
-- A G A R . W I D G E T --
-- B o d y --
-- --
-- Copyright (c) 2018-2019 Julien Nadeau Carriere (vedge@csoft.net) --
-- --
-- Permission to use, copy, modify, and/or distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
package body Agar.Widget is
--
-- Return the first visible widget intersecting a point or enclosing a
-- rectangle (in view coordinates). Scan all drivers and return first match.
--
--function Find_At_Point
-- (Class : in String;
-- X,Y : in Natural) return Widget_Access;
--function Find_Enclosing_Rect
-- (Class : in String;
-- X,Y : in Natural;
-- W,H : in Positive) return Widget_Access;
--
-- Set whether to accept (or deny) focused state.
--
procedure Set_Focusable
(Widget : in Widget_not_null_Access;
Enable : in Boolean)
is
Former_Status : aliased C.int;
begin
if Enable then
Former_Status := AG_WidgetSetFocusable (Widget, C.int(1));
else
Former_Status := AG_WidgetSetFocusable (Widget, C.int(0));
end if;
end;
--
-- Set whether to accept (or deny) focused state (return previous).
--
function Set_Focusable
(Widget : in Widget_not_null_Access;
Enable : in Boolean) return Boolean
is
begin
if Enable then
return 1 = AG_WidgetSetFocusable (Widget, C.int(1));
else
return 1 = AG_WidgetSetFocusable (Widget, C.int(0));
end if;
end;
--
-- Focus on the widget (and implicitely its parents up to and including
-- the parent window).
--
function Focus
(Widget : in Widget_not_null_Access) return Boolean is
begin
return 0 = AG_WidgetFocus (Widget);
end;
--
-- Return the topmost visible widget intersecting a display-coordinate point.
--
function Find_Widget_At_Point
(Class : String;
X,Y : Natural) return Widget_Access
is
Ch_Class : aliased C.char_array := C.To_C(Class);
begin
return AG_WidgetFindPoint
(Class => CS.To_Chars_Ptr(Ch_Class'Unchecked_Access),
X => C.int(X),
Y => C.int(Y));
end;
--
-- Return topmost visible widget intersecting a display-coordinate rectangle.
--
function Find_Widget_Enclosing_Rect
(Class : String;
X,Y : Natural;
Width, Height : Positive) return Widget_Access
is
Ch_Class : aliased C.char_array := C.To_C(Class);
begin
return AG_WidgetFindRect
(Class => CS.To_Chars_Ptr(Ch_Class'Unchecked_Access),
X => C.int(X),
Y => C.int(Y),
Width => C.int(Width),
Height => C.int(Height));
end;
--
-- Update the cached absolute display (rView) coordinates of a widget, and
-- of its descendants. The Widget and its parent VFS must both be locked.
--
procedure Update_Coordinates
(Widget : in Widget_not_null_Access;
X : in Natural;
Y : in Natural) is
begin
AG_WidgetUpdateCoords
(Widget => Widget,
X => C.int(X),
Y => C.int(Y));
end;
--
-- Free any Surface mapped to the given handle (as returned by Map_Surface).
-- Delete any hardware texture associated with the surface.
--
procedure Unmap_Surface
(Widget : in Widget_not_null_Access;
Handle : in Surface_Handle) is
begin
Replace_Surface
(Widget => Widget,
Handle => Handle,
Surface => null);
end;
--
-- Blit the surface (or render the hardware texture) at Source:[Handle],
-- at target coordinates X,Y relative to Widget.
--
-- Source may be different from Widget (i.e., Widgets may render other
-- widgets' surfaces) as long as both widgets are in the same Window.
--
procedure Blit_Surface
(Widget : in Widget_not_null_Access;
Source : in Widget_not_null_Access;
Handle : in Surface_Handle;
Src_Rect : in SU.Rect_Access := null;
X,Y : in Natural := 0) is
begin
AG_WidgetBlitFrom
(Widget => Widget,
Source => Source,
Handle => Handle,
Src_Rect => Src_Rect,
X => C.int(X),
Y => C.int(Y));
end;
--
-- Blit the surface (or render the hardware texture) at Widget:[Handle],
-- at target coordinates X,Y relative to Widget.
--
procedure Blit_Surface
(Widget : in Widget_not_null_Access;
Handle : in Surface_Handle;
Src_Rect : in SU.Rect_Access := null;
X,Y : in Natural := 0) is
begin
AG_WidgetBlitFrom
(Widget => Widget,
Source => Widget,
Handle => Handle,
Src_Rect => Src_Rect,
X => C.int(X),
Y => C.int(Y));
end;
--
-- Blit a Surface not managed by the Widget. This method is inefficient
-- (no hardware acceleration) and should be avoided.
--
procedure Blit_Surface
(Widget : in Widget_not_null_Access;
Surface : in SU.Surface_not_null_Access;
X,Y : in Natural := 0) is
begin
AG_WidgetBlit
(Widget => Widget,
Surface => Surface,
X => C.int(X),
Y => C.int(Y));
end;
--
-- Test whether widget is sensitive to view coordinates X,Y.
--
function Is_Sensitive
(Widget : in Widget_not_null_Access;
X,Y : in Natural) return Boolean is
begin
return 1 = AG_WidgetSensitive
(Widget => Widget,
X => C.int(X),
Y => C.int(Y));
end;
--
-- Create a new mouse instance under a Driver.
--
function New_Mouse
(Driver : in Driver_not_null_Access;
Descr : in String) return MSE.Mouse_Device_not_null_Access
is
Ch_Descr : aliased C.char_array := C.To_C(Descr);
begin
return AG_MouseNew
(Driver => Driver,
Descr => CS.To_Chars_Ptr(Ch_Descr'Unchecked_Access));
end;
--
-- Change the cursor if its coordinates overlap a registered cursor area.
-- Generally called from window/driver code following a mouse motion event.
--
procedure Mouse_Cursor_Update
(Window : in Window_not_null_Access;
X,Y : in Natural) is
begin
AG_MouseCursorUpdate
(Window => Window,
X => C.int(X),
Y => C.int(Y));
end;
--
-- Handle a mouse motion. Called from Driver code (agDrivers must be locked).
--
procedure Process_Mouse_Motion
(Window : in Window_not_null_Access;
X,Y : in Natural;
Xrel,Yrel : in Integer;
Buttons : in MSE.Mouse_Button) is
begin
AG_ProcessMouseMotion
(Window => Window,
X => C.int(X),
Y => C.int(Y),
Xrel => C.int(Xrel),
Yrel => C.int(Yrel),
Buttons => Buttons);
end;
--
-- Handle a mouse button release.
-- Called from Driver code (agDrivers must be locked).
--
procedure Process_Mouse_Button_Up
(Window : in Window_not_null_Access;
X,Y : in Natural;
Button : in MSE.Mouse_Button) is
begin
AG_ProcessMouseButtonUp
(Window => Window,
X => C.int(X),
Y => C.int(Y),
Button => Button);
end;
--
-- Handle a mouse button press.
-- Called from Driver code (agDrivers must be locked).
--
procedure Process_Mouse_Button_Down
(Window : in Window_not_null_Access;
X,Y : in Natural;
Button : in MSE.Mouse_Button) is
begin
AG_ProcessMouseButtonDown
(Window => Window,
X => C.int(X),
Y => C.int(Y),
Button => Button);
end;
end Agar.Widget;
|
--------------------------------------------------------------------------------
-- MIT License
--
-- Copyright (c) 2020 Zane Myers
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
--------------------------------------------------------------------------------
package Vulkan_Test is
pragma Preelaborate;
pragma Pure;
end Vulkan_Test;
|
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
package body Asis.Gela.Elements.Stmt is
function Statement_Paths
(Element : Base_Path_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Path_Lists.To_Element_List
(Element.Statement_Paths, Include_Pragmas);
end Statement_Paths;
procedure Set_Statement_Paths
(Element : in out Base_Path_Statement_Node;
Value : in Asis.Element) is
begin
Element.Statement_Paths := Primary_Path_Lists.List (Value);
end Set_Statement_Paths;
function Statement_Paths_List
(Element : Base_Path_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Statement_Paths);
end Statement_Paths_List;
function Children (Element : access Base_Path_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(True, Asis.Element (Element.Statement_Paths)));
end Children;
function New_If_Statement_Node
(The_Context : ASIS.Context)
return If_Statement_Ptr
is
Result : If_Statement_Ptr :=
new If_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_If_Statement_Node;
function Statement_Kind (Element : If_Statement_Node)
return Asis.Statement_Kinds is
begin
return An_If_Statement;
end;
function Clone
(Element : If_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant If_Statement_Ptr := new If_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access If_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Set_Statement_Paths
(Target.all,
Primary_Path_Lists.Deep_Copy
(Statement_Paths (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function Case_Expression
(Element : Case_Statement_Node) return Asis.Expression is
begin
return Element.Case_Expression;
end Case_Expression;
procedure Set_Case_Expression
(Element : in out Case_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Case_Expression := Value;
end Set_Case_Expression;
function New_Case_Statement_Node
(The_Context : ASIS.Context)
return Case_Statement_Ptr
is
Result : Case_Statement_Ptr :=
new Case_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Case_Statement_Node;
function Statement_Kind (Element : Case_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Case_Statement;
end;
function Children (Element : access Case_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Case_Expression'Access),
(True, Asis.Element (Element.Statement_Paths)));
end Children;
function Clone
(Element : Case_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Case_Statement_Ptr := new Case_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Case_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Case_Expression :=
Copy (Cloner, Case_Expression (Source.all), Asis.Element (Target));
Set_Statement_Paths
(Target.all,
Primary_Path_Lists.Deep_Copy
(Statement_Paths (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function New_Selective_Accept_Statement_Node
(The_Context : ASIS.Context)
return Selective_Accept_Statement_Ptr
is
Result : Selective_Accept_Statement_Ptr :=
new Selective_Accept_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Selective_Accept_Statement_Node;
function Statement_Kind (Element : Selective_Accept_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Selective_Accept_Statement;
end;
function Clone
(Element : Selective_Accept_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Selective_Accept_Statement_Ptr := new Selective_Accept_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Selective_Accept_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Set_Statement_Paths
(Target.all,
Primary_Path_Lists.Deep_Copy
(Statement_Paths (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function New_Timed_Entry_Call_Statement_Node
(The_Context : ASIS.Context)
return Timed_Entry_Call_Statement_Ptr
is
Result : Timed_Entry_Call_Statement_Ptr :=
new Timed_Entry_Call_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Timed_Entry_Call_Statement_Node;
function Statement_Kind (Element : Timed_Entry_Call_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Timed_Entry_Call_Statement;
end;
function Clone
(Element : Timed_Entry_Call_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Timed_Entry_Call_Statement_Ptr := new Timed_Entry_Call_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Timed_Entry_Call_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Set_Statement_Paths
(Target.all,
Primary_Path_Lists.Deep_Copy
(Statement_Paths (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function New_Conditional_Entry_Call_Statement_Node
(The_Context : ASIS.Context)
return Conditional_Entry_Call_Statement_Ptr
is
Result : Conditional_Entry_Call_Statement_Ptr :=
new Conditional_Entry_Call_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Conditional_Entry_Call_Statement_Node;
function Statement_Kind (Element : Conditional_Entry_Call_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Conditional_Entry_Call_Statement;
end;
function Clone
(Element : Conditional_Entry_Call_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Conditional_Entry_Call_Statement_Ptr := new Conditional_Entry_Call_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Conditional_Entry_Call_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Set_Statement_Paths
(Target.all,
Primary_Path_Lists.Deep_Copy
(Statement_Paths (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function New_Asynchronous_Select_Statement_Node
(The_Context : ASIS.Context)
return Asynchronous_Select_Statement_Ptr
is
Result : Asynchronous_Select_Statement_Ptr :=
new Asynchronous_Select_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Asynchronous_Select_Statement_Node;
function Statement_Kind (Element : Asynchronous_Select_Statement_Node)
return Asis.Statement_Kinds is
begin
return An_Asynchronous_Select_Statement;
end;
function Clone
(Element : Asynchronous_Select_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Asynchronous_Select_Statement_Ptr := new Asynchronous_Select_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Asynchronous_Select_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Set_Statement_Paths
(Target.all,
Primary_Path_Lists.Deep_Copy
(Statement_Paths (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function New_Null_Statement_Node
(The_Context : ASIS.Context)
return Null_Statement_Ptr
is
Result : Null_Statement_Ptr :=
new Null_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Null_Statement_Node;
function Statement_Kind (Element : Null_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Null_Statement;
end;
function Clone
(Element : Null_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Null_Statement_Ptr := new Null_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Null_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function Assignment_Variable_Name
(Element : Assignment_Statement_Node) return Asis.Expression is
begin
return Element.Assignment_Variable_Name;
end Assignment_Variable_Name;
procedure Set_Assignment_Variable_Name
(Element : in out Assignment_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Assignment_Variable_Name := Value;
end Set_Assignment_Variable_Name;
function Assignment_Expression
(Element : Assignment_Statement_Node) return Asis.Expression is
begin
return Element.Assignment_Expression;
end Assignment_Expression;
procedure Set_Assignment_Expression
(Element : in out Assignment_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Assignment_Expression := Value;
end Set_Assignment_Expression;
function New_Assignment_Statement_Node
(The_Context : ASIS.Context)
return Assignment_Statement_Ptr
is
Result : Assignment_Statement_Ptr :=
new Assignment_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Assignment_Statement_Node;
function Statement_Kind (Element : Assignment_Statement_Node)
return Asis.Statement_Kinds is
begin
return An_Assignment_Statement;
end;
function Children (Element : access Assignment_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Assignment_Variable_Name'Access),
(False, Element.Assignment_Expression'Access));
end Children;
function Clone
(Element : Assignment_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Assignment_Statement_Ptr := new Assignment_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Assignment_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Assignment_Variable_Name :=
Copy (Cloner, Assignment_Variable_Name (Source.all), Asis.Element (Target));
Target.Assignment_Expression :=
Copy (Cloner, Assignment_Expression (Source.all), Asis.Element (Target));
end Copy;
function Statement_Identifier
(Element : Loop_Statement_Node) return Asis.Defining_Name is
begin
return Element.Statement_Identifier;
end Statement_Identifier;
procedure Set_Statement_Identifier
(Element : in out Loop_Statement_Node;
Value : in Asis.Defining_Name) is
begin
Element.Statement_Identifier := Value;
end Set_Statement_Identifier;
function Back_Identifier
(Element : Loop_Statement_Node) return Asis.Identifier is
begin
return Element.Back_Identifier;
end Back_Identifier;
procedure Set_Back_Identifier
(Element : in out Loop_Statement_Node;
Value : in Asis.Identifier) is
begin
Element.Back_Identifier := Value;
end Set_Back_Identifier;
function Is_Name_Repeated
(Element : Loop_Statement_Node) return Boolean is
begin
return Element.Is_Name_Repeated;
end Is_Name_Repeated;
procedure Set_Is_Name_Repeated
(Element : in out Loop_Statement_Node;
Value : in Boolean) is
begin
Element.Is_Name_Repeated := Value;
end Set_Is_Name_Repeated;
function Loop_Statements
(Element : Loop_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Statement_Lists.To_Element_List
(Element.Loop_Statements, Include_Pragmas);
end Loop_Statements;
procedure Set_Loop_Statements
(Element : in out Loop_Statement_Node;
Value : in Asis.Element) is
begin
Element.Loop_Statements := Primary_Statement_Lists.List (Value);
end Set_Loop_Statements;
function Loop_Statements_List
(Element : Loop_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Loop_Statements);
end Loop_Statements_List;
function New_Loop_Statement_Node
(The_Context : ASIS.Context)
return Loop_Statement_Ptr
is
Result : Loop_Statement_Ptr :=
new Loop_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Loop_Statement_Node;
function Statement_Kind (Element : Loop_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Loop_Statement;
end;
function Children (Element : access Loop_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Statement_Identifier'Access),
(True, Asis.Element (Element.Loop_Statements)));
end Children;
function Clone
(Element : Loop_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Loop_Statement_Ptr := new Loop_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
Result.Back_Identifier := Element.Back_Identifier;
Result.Is_Name_Repeated := Element.Is_Name_Repeated;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Loop_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Statement_Identifier :=
Copy (Cloner, Statement_Identifier (Source.all), Asis.Element (Target));
Set_Loop_Statements
(Target.all,
Primary_Statement_Lists.Deep_Copy
(Loop_Statements (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function While_Condition
(Element : While_Loop_Statement_Node) return Asis.Expression is
begin
return Element.While_Condition;
end While_Condition;
procedure Set_While_Condition
(Element : in out While_Loop_Statement_Node;
Value : in Asis.Expression) is
begin
Element.While_Condition := Value;
end Set_While_Condition;
function New_While_Loop_Statement_Node
(The_Context : ASIS.Context)
return While_Loop_Statement_Ptr
is
Result : While_Loop_Statement_Ptr :=
new While_Loop_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_While_Loop_Statement_Node;
function Statement_Kind (Element : While_Loop_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_While_Loop_Statement;
end;
function Children (Element : access While_Loop_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Statement_Identifier'Access),
(False, Element.While_Condition'Access),
(True, Asis.Element (Element.Loop_Statements)));
end Children;
function Clone
(Element : While_Loop_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant While_Loop_Statement_Ptr := new While_Loop_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
Result.Back_Identifier := Element.Back_Identifier;
Result.Is_Name_Repeated := Element.Is_Name_Repeated;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access While_Loop_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Statement_Identifier :=
Copy (Cloner, Statement_Identifier (Source.all), Asis.Element (Target));
Target.While_Condition :=
Copy (Cloner, While_Condition (Source.all), Asis.Element (Target));
Set_Loop_Statements
(Target.all,
Primary_Statement_Lists.Deep_Copy
(Loop_Statements (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function Loop_Parameter_Specification
(Element : For_Loop_Statement_Node) return Asis.Declaration is
begin
return Element.Loop_Parameter_Specification;
end Loop_Parameter_Specification;
procedure Set_Loop_Parameter_Specification
(Element : in out For_Loop_Statement_Node;
Value : in Asis.Declaration) is
begin
Element.Loop_Parameter_Specification := Value;
end Set_Loop_Parameter_Specification;
function New_For_Loop_Statement_Node
(The_Context : ASIS.Context)
return For_Loop_Statement_Ptr
is
Result : For_Loop_Statement_Ptr :=
new For_Loop_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_For_Loop_Statement_Node;
function Statement_Kind (Element : For_Loop_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_For_Loop_Statement;
end;
function Children (Element : access For_Loop_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Statement_Identifier'Access),
(False, Element.Loop_Parameter_Specification'Access),
(True, Asis.Element (Element.Loop_Statements)));
end Children;
function Clone
(Element : For_Loop_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant For_Loop_Statement_Ptr := new For_Loop_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
Result.Back_Identifier := Element.Back_Identifier;
Result.Is_Name_Repeated := Element.Is_Name_Repeated;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access For_Loop_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Statement_Identifier :=
Copy (Cloner, Statement_Identifier (Source.all), Asis.Element (Target));
Target.Loop_Parameter_Specification :=
Copy (Cloner, Loop_Parameter_Specification (Source.all), Asis.Element (Target));
Set_Loop_Statements
(Target.all,
Primary_Statement_Lists.Deep_Copy
(Loop_Statements (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function Is_Name_Repeated
(Element : Block_Statement_Node) return Boolean is
begin
return Element.Is_Name_Repeated;
end Is_Name_Repeated;
procedure Set_Is_Name_Repeated
(Element : in out Block_Statement_Node;
Value : in Boolean) is
begin
Element.Is_Name_Repeated := Value;
end Set_Is_Name_Repeated;
function Is_Declare_Block
(Element : Block_Statement_Node) return Boolean is
begin
return Element.Is_Declare_Block;
end Is_Declare_Block;
procedure Set_Is_Declare_Block
(Element : in out Block_Statement_Node;
Value : in Boolean) is
begin
Element.Is_Declare_Block := Value;
end Set_Is_Declare_Block;
function Block_Declarative_Items
(Element : Block_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Declaration_Lists.To_Element_List
(Element.Block_Declarative_Items, Include_Pragmas);
end Block_Declarative_Items;
procedure Set_Block_Declarative_Items
(Element : in out Block_Statement_Node;
Value : in Asis.Element) is
begin
Element.Block_Declarative_Items := Primary_Declaration_Lists.List (Value);
end Set_Block_Declarative_Items;
function Block_Declarative_Items_List
(Element : Block_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Block_Declarative_Items);
end Block_Declarative_Items_List;
function Block_Statements
(Element : Block_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Statement_Lists.To_Element_List
(Element.Block_Statements, Include_Pragmas);
end Block_Statements;
procedure Set_Block_Statements
(Element : in out Block_Statement_Node;
Value : in Asis.Element) is
begin
Element.Block_Statements := Primary_Statement_Lists.List (Value);
end Set_Block_Statements;
function Block_Statements_List
(Element : Block_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Block_Statements);
end Block_Statements_List;
function Block_Exception_Handlers
(Element : Block_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Handler_Lists.To_Element_List
(Element.Block_Exception_Handlers, Include_Pragmas);
end Block_Exception_Handlers;
procedure Set_Block_Exception_Handlers
(Element : in out Block_Statement_Node;
Value : in Asis.Element) is
begin
Element.Block_Exception_Handlers := Primary_Handler_Lists.List (Value);
end Set_Block_Exception_Handlers;
function Block_Exception_Handlers_List
(Element : Block_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Block_Exception_Handlers);
end Block_Exception_Handlers_List;
function Statement_Identifier
(Element : Block_Statement_Node) return Asis.Defining_Name is
begin
return Element.Statement_Identifier;
end Statement_Identifier;
procedure Set_Statement_Identifier
(Element : in out Block_Statement_Node;
Value : in Asis.Defining_Name) is
begin
Element.Statement_Identifier := Value;
end Set_Statement_Identifier;
function Back_Identifier
(Element : Block_Statement_Node) return Asis.Identifier is
begin
return Element.Back_Identifier;
end Back_Identifier;
procedure Set_Back_Identifier
(Element : in out Block_Statement_Node;
Value : in Asis.Identifier) is
begin
Element.Back_Identifier := Value;
end Set_Back_Identifier;
function Handled_Statements
(Element : Block_Statement_Node) return Asis.Element is
begin
return Element.Handled_Statements;
end Handled_Statements;
procedure Set_Handled_Statements
(Element : in out Block_Statement_Node;
Value : in Asis.Element) is
begin
Element.Handled_Statements := Value;
end Set_Handled_Statements;
function New_Block_Statement_Node
(The_Context : ASIS.Context)
return Block_Statement_Ptr
is
Result : Block_Statement_Ptr :=
new Block_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Block_Statement_Node;
function Statement_Kind (Element : Block_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Block_Statement;
end;
function Children (Element : access Block_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Statement_Identifier'Access),
(True, Asis.Element (Element.Block_Declarative_Items)),
(True, Asis.Element (Element.Block_Statements)),
(True, Asis.Element (Element.Block_Exception_Handlers)));
end Children;
function Clone
(Element : Block_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Block_Statement_Ptr := new Block_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
Result.Is_Name_Repeated := Element.Is_Name_Repeated;
Result.Is_Declare_Block := Element.Is_Declare_Block;
Result.Back_Identifier := Element.Back_Identifier;
Result.Handled_Statements := Element.Handled_Statements;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Block_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Statement_Identifier :=
Copy (Cloner, Statement_Identifier (Source.all), Asis.Element (Target));
Set_Block_Declarative_Items
(Target.all,
Primary_Declaration_Lists.Deep_Copy
(Block_Declarative_Items (Source.all), Cloner, Asis.Element (Target)));
Set_Block_Statements
(Target.all,
Primary_Statement_Lists.Deep_Copy
(Block_Statements (Source.all), Cloner, Asis.Element (Target)));
Set_Block_Exception_Handlers
(Target.all,
Primary_Handler_Lists.Deep_Copy
(Block_Exception_Handlers (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function Exit_Loop_Name
(Element : Exit_Statement_Node) return Asis.Expression is
begin
return Element.Exit_Loop_Name;
end Exit_Loop_Name;
procedure Set_Exit_Loop_Name
(Element : in out Exit_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Exit_Loop_Name := Value;
end Set_Exit_Loop_Name;
function Corresponding_Loop_Exited
(Element : Exit_Statement_Node) return Asis.Statement is
begin
return Element.Corresponding_Loop_Exited;
end Corresponding_Loop_Exited;
procedure Set_Corresponding_Loop_Exited
(Element : in out Exit_Statement_Node;
Value : in Asis.Statement) is
begin
Element.Corresponding_Loop_Exited := Value;
end Set_Corresponding_Loop_Exited;
function Exit_Condition
(Element : Exit_Statement_Node) return Asis.Expression is
begin
return Element.Exit_Condition;
end Exit_Condition;
procedure Set_Exit_Condition
(Element : in out Exit_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Exit_Condition := Value;
end Set_Exit_Condition;
function New_Exit_Statement_Node
(The_Context : ASIS.Context)
return Exit_Statement_Ptr
is
Result : Exit_Statement_Ptr :=
new Exit_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Exit_Statement_Node;
function Statement_Kind (Element : Exit_Statement_Node)
return Asis.Statement_Kinds is
begin
return An_Exit_Statement;
end;
function Children (Element : access Exit_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Exit_Loop_Name'Access),
(False, Element.Exit_Condition'Access));
end Children;
function Clone
(Element : Exit_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Exit_Statement_Ptr := new Exit_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
Result.Corresponding_Loop_Exited := Element.Corresponding_Loop_Exited;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Exit_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Exit_Loop_Name :=
Copy (Cloner, Exit_Loop_Name (Source.all), Asis.Element (Target));
Target.Exit_Condition :=
Copy (Cloner, Exit_Condition (Source.all), Asis.Element (Target));
end Copy;
function Goto_Label
(Element : Goto_Statement_Node) return Asis.Expression is
begin
return Element.Goto_Label;
end Goto_Label;
procedure Set_Goto_Label
(Element : in out Goto_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Goto_Label := Value;
end Set_Goto_Label;
function Corresponding_Destination_Statement
(Element : Goto_Statement_Node) return Asis.Statement is
begin
return Element.Corresponding_Destination_Statement;
end Corresponding_Destination_Statement;
procedure Set_Corresponding_Destination_Statement
(Element : in out Goto_Statement_Node;
Value : in Asis.Statement) is
begin
Element.Corresponding_Destination_Statement := Value;
end Set_Corresponding_Destination_Statement;
function New_Goto_Statement_Node
(The_Context : ASIS.Context)
return Goto_Statement_Ptr
is
Result : Goto_Statement_Ptr :=
new Goto_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Goto_Statement_Node;
function Statement_Kind (Element : Goto_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Goto_Statement;
end;
function Children (Element : access Goto_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Goto_Label'Access));
end Children;
function Clone
(Element : Goto_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Goto_Statement_Ptr := new Goto_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
Result.Corresponding_Destination_Statement := Element.Corresponding_Destination_Statement;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Goto_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Goto_Label :=
Copy (Cloner, Goto_Label (Source.all), Asis.Element (Target));
end Copy;
function Called_Name
(Element : Base_Call_Statement_Node) return Asis.Expression is
begin
return Element.Called_Name;
end Called_Name;
procedure Set_Called_Name
(Element : in out Base_Call_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Called_Name := Value;
end Set_Called_Name;
function Corresponding_Called_Entity
(Element : Base_Call_Statement_Node) return Asis.Declaration is
begin
return Element.Corresponding_Called_Entity;
end Corresponding_Called_Entity;
procedure Set_Corresponding_Called_Entity
(Element : in out Base_Call_Statement_Node;
Value : in Asis.Declaration) is
begin
Element.Corresponding_Called_Entity := Value;
end Set_Corresponding_Called_Entity;
function Call_Statement_Parameters
(Element : Base_Call_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Association_Lists.To_Element_List
(Element.Call_Statement_Parameters, Include_Pragmas);
end Call_Statement_Parameters;
procedure Set_Call_Statement_Parameters
(Element : in out Base_Call_Statement_Node;
Value : in Asis.Element) is
begin
Element.Call_Statement_Parameters := Primary_Association_Lists.List (Value);
end Set_Call_Statement_Parameters;
function Call_Statement_Parameters_List
(Element : Base_Call_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Call_Statement_Parameters);
end Call_Statement_Parameters_List;
function Normalized_Call_Statement_Parameters
(Element : Base_Call_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Secondary_Association_Lists.To_Element_List
(Element.Normalized_Call_Statement_Parameters, Include_Pragmas);
end Normalized_Call_Statement_Parameters;
procedure Add_To_Normalized_Call_Statement_Parameters
(Element : in out Base_Call_Statement_Node;
Item : in Asis.Element) is
begin
Secondary_Association_Lists.Add (Element.Normalized_Call_Statement_Parameters, Item);
end Add_To_Normalized_Call_Statement_Parameters;
function Children (Element : access Base_Call_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Called_Name'Access),
(True, Asis.Element (Element.Call_Statement_Parameters)));
end Children;
function Is_Call_On_Dispatching_Operation
(Element : Procedure_Call_Statement_Node) return Boolean is
begin
return Element.Is_Call_On_Dispatching_Operation;
end Is_Call_On_Dispatching_Operation;
procedure Set_Is_Call_On_Dispatching_Operation
(Element : in out Procedure_Call_Statement_Node;
Value : in Boolean) is
begin
Element.Is_Call_On_Dispatching_Operation := Value;
end Set_Is_Call_On_Dispatching_Operation;
function Is_Dispatching_Call
(Element : Procedure_Call_Statement_Node) return Boolean is
begin
return Element.Is_Dispatching_Call;
end Is_Dispatching_Call;
procedure Set_Is_Dispatching_Call
(Element : in out Procedure_Call_Statement_Node;
Value : in Boolean) is
begin
Element.Is_Dispatching_Call := Value;
end Set_Is_Dispatching_Call;
function New_Procedure_Call_Statement_Node
(The_Context : ASIS.Context)
return Procedure_Call_Statement_Ptr
is
Result : Procedure_Call_Statement_Ptr :=
new Procedure_Call_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Procedure_Call_Statement_Node;
function Statement_Kind (Element : Procedure_Call_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Procedure_Call_Statement;
end;
function Clone
(Element : Procedure_Call_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Procedure_Call_Statement_Ptr := new Procedure_Call_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
Result.Corresponding_Called_Entity := Element.Corresponding_Called_Entity;
null;
Result.Is_Call_On_Dispatching_Operation := Element.Is_Call_On_Dispatching_Operation;
Result.Is_Dispatching_Call := Element.Is_Dispatching_Call;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Procedure_Call_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Called_Name :=
Copy (Cloner, Called_Name (Source.all), Asis.Element (Target));
Set_Call_Statement_Parameters
(Target.all,
Primary_Association_Lists.Deep_Copy
(Call_Statement_Parameters (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function New_Entry_Call_Statement_Node
(The_Context : ASIS.Context)
return Entry_Call_Statement_Ptr
is
Result : Entry_Call_Statement_Ptr :=
new Entry_Call_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Entry_Call_Statement_Node;
function Statement_Kind (Element : Entry_Call_Statement_Node)
return Asis.Statement_Kinds is
begin
return An_Entry_Call_Statement;
end;
function Clone
(Element : Entry_Call_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Entry_Call_Statement_Ptr := new Entry_Call_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
Result.Corresponding_Called_Entity := Element.Corresponding_Called_Entity;
null;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Entry_Call_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Called_Name :=
Copy (Cloner, Called_Name (Source.all), Asis.Element (Target));
Set_Call_Statement_Parameters
(Target.all,
Primary_Association_Lists.Deep_Copy
(Call_Statement_Parameters (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function Return_Expression
(Element : Simple_Return_Statement_Node) return Asis.Expression is
begin
return Element.Return_Expression;
end Return_Expression;
procedure Set_Return_Expression
(Element : in out Simple_Return_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Return_Expression := Value;
end Set_Return_Expression;
function New_Simple_Return_Statement_Node
(The_Context : ASIS.Context)
return Simple_Return_Statement_Ptr
is
Result : Simple_Return_Statement_Ptr :=
new Simple_Return_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Simple_Return_Statement_Node;
function Statement_Kind (Element : Simple_Return_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Simple_Return_Statement;
end;
function Children (Element : access Simple_Return_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Return_Expression'Access));
end Children;
function Clone
(Element : Simple_Return_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Simple_Return_Statement_Ptr := new Simple_Return_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Simple_Return_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Return_Expression :=
Copy (Cloner, Return_Expression (Source.all), Asis.Element (Target));
end Copy;
function Return_Object_Specification
(Element : Extended_Return_Statement_Node) return Asis.Declaration is
begin
return Element.Return_Object_Specification;
end Return_Object_Specification;
procedure Set_Return_Object_Specification
(Element : in out Extended_Return_Statement_Node;
Value : in Asis.Declaration) is
begin
Element.Return_Object_Specification := Value;
end Set_Return_Object_Specification;
function Extended_Return_Statements
(Element : Extended_Return_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Statement_Lists.To_Element_List
(Element.Extended_Return_Statements, Include_Pragmas);
end Extended_Return_Statements;
procedure Set_Extended_Return_Statements
(Element : in out Extended_Return_Statement_Node;
Value : in Asis.Element) is
begin
Element.Extended_Return_Statements := Primary_Statement_Lists.List (Value);
end Set_Extended_Return_Statements;
function Extended_Return_Statements_List
(Element : Extended_Return_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Extended_Return_Statements);
end Extended_Return_Statements_List;
function Extended_Return_Exception_Handlers
(Element : Extended_Return_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Handler_Lists.To_Element_List
(Element.Extended_Return_Exception_Handlers, Include_Pragmas);
end Extended_Return_Exception_Handlers;
procedure Set_Extended_Return_Exception_Handlers
(Element : in out Extended_Return_Statement_Node;
Value : in Asis.Element) is
begin
Element.Extended_Return_Exception_Handlers := Primary_Handler_Lists.List (Value);
end Set_Extended_Return_Exception_Handlers;
function Extended_Return_Exception_Handlers_List
(Element : Extended_Return_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Extended_Return_Exception_Handlers);
end Extended_Return_Exception_Handlers_List;
function Handled_Statements
(Element : Extended_Return_Statement_Node) return Asis.Element is
begin
return Element.Handled_Statements;
end Handled_Statements;
procedure Set_Handled_Statements
(Element : in out Extended_Return_Statement_Node;
Value : in Asis.Element) is
begin
Element.Handled_Statements := Value;
end Set_Handled_Statements;
function New_Extended_Return_Statement_Node
(The_Context : ASIS.Context)
return Extended_Return_Statement_Ptr
is
Result : Extended_Return_Statement_Ptr :=
new Extended_Return_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Extended_Return_Statement_Node;
function Statement_Kind (Element : Extended_Return_Statement_Node)
return Asis.Statement_Kinds is
begin
return An_Extended_Return_Statement;
end;
function Children (Element : access Extended_Return_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Return_Object_Specification'Access),
(True, Asis.Element (Element.Extended_Return_Statements)),
(True, Asis.Element (Element.Extended_Return_Exception_Handlers)));
end Children;
function Clone
(Element : Extended_Return_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Extended_Return_Statement_Ptr := new Extended_Return_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
Result.Handled_Statements := Element.Handled_Statements;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Extended_Return_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Return_Object_Specification :=
Copy (Cloner, Return_Object_Specification (Source.all), Asis.Element (Target));
Set_Extended_Return_Statements
(Target.all,
Primary_Statement_Lists.Deep_Copy
(Extended_Return_Statements (Source.all), Cloner, Asis.Element (Target)));
Set_Extended_Return_Exception_Handlers
(Target.all,
Primary_Handler_Lists.Deep_Copy
(Extended_Return_Exception_Handlers (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function Accept_Entry_Index
(Element : Accept_Statement_Node) return Asis.Expression is
begin
return Element.Accept_Entry_Index;
end Accept_Entry_Index;
procedure Set_Accept_Entry_Index
(Element : in out Accept_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Accept_Entry_Index := Value;
end Set_Accept_Entry_Index;
function Accept_Entry_Direct_Name
(Element : Accept_Statement_Node) return Asis.Name is
begin
return Element.Accept_Entry_Direct_Name;
end Accept_Entry_Direct_Name;
procedure Set_Accept_Entry_Direct_Name
(Element : in out Accept_Statement_Node;
Value : in Asis.Name) is
begin
Element.Accept_Entry_Direct_Name := Value;
end Set_Accept_Entry_Direct_Name;
function Accept_Parameters
(Element : Accept_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Parameter_Lists.To_Element_List
(Element.Accept_Parameters, Include_Pragmas);
end Accept_Parameters;
procedure Set_Accept_Parameters
(Element : in out Accept_Statement_Node;
Value : in Asis.Element) is
begin
Element.Accept_Parameters := Primary_Parameter_Lists.List (Value);
end Set_Accept_Parameters;
function Accept_Parameters_List
(Element : Accept_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Accept_Parameters);
end Accept_Parameters_List;
function Accept_Body_Statements
(Element : Accept_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Statement_Lists.To_Element_List
(Element.Accept_Body_Statements, Include_Pragmas);
end Accept_Body_Statements;
procedure Set_Accept_Body_Statements
(Element : in out Accept_Statement_Node;
Value : in Asis.Element) is
begin
Element.Accept_Body_Statements := Primary_Statement_Lists.List (Value);
end Set_Accept_Body_Statements;
function Accept_Body_Statements_List
(Element : Accept_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Accept_Body_Statements);
end Accept_Body_Statements_List;
function Accept_Body_Exception_Handlers
(Element : Accept_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Handler_Lists.To_Element_List
(Element.Accept_Body_Exception_Handlers, Include_Pragmas);
end Accept_Body_Exception_Handlers;
procedure Set_Accept_Body_Exception_Handlers
(Element : in out Accept_Statement_Node;
Value : in Asis.Element) is
begin
Element.Accept_Body_Exception_Handlers := Primary_Handler_Lists.List (Value);
end Set_Accept_Body_Exception_Handlers;
function Accept_Body_Exception_Handlers_List
(Element : Accept_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Accept_Body_Exception_Handlers);
end Accept_Body_Exception_Handlers_List;
function Corresponding_Entry
(Element : Accept_Statement_Node) return Asis.Declaration is
begin
return Element.Corresponding_Entry;
end Corresponding_Entry;
procedure Set_Corresponding_Entry
(Element : in out Accept_Statement_Node;
Value : in Asis.Declaration) is
begin
Element.Corresponding_Entry := Value;
end Set_Corresponding_Entry;
function Is_Name_Repeated
(Element : Accept_Statement_Node) return Boolean is
begin
return Element.Is_Name_Repeated;
end Is_Name_Repeated;
procedure Set_Is_Name_Repeated
(Element : in out Accept_Statement_Node;
Value : in Boolean) is
begin
Element.Is_Name_Repeated := Value;
end Set_Is_Name_Repeated;
function Handled_Statements
(Element : Accept_Statement_Node) return Asis.Element is
begin
return Element.Handled_Statements;
end Handled_Statements;
procedure Set_Handled_Statements
(Element : in out Accept_Statement_Node;
Value : in Asis.Element) is
begin
Element.Handled_Statements := Value;
end Set_Handled_Statements;
function New_Accept_Statement_Node
(The_Context : ASIS.Context)
return Accept_Statement_Ptr
is
Result : Accept_Statement_Ptr :=
new Accept_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Accept_Statement_Node;
function Statement_Kind (Element : Accept_Statement_Node)
return Asis.Statement_Kinds is
begin
return An_Accept_Statement;
end;
function Children (Element : access Accept_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Accept_Entry_Direct_Name'Access),
(False, Element.Accept_Entry_Index'Access),
(True, Asis.Element (Element.Accept_Parameters)),
(True, Asis.Element (Element.Accept_Body_Statements)),
(True, Asis.Element (Element.Accept_Body_Exception_Handlers)));
end Children;
function Clone
(Element : Accept_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Accept_Statement_Ptr := new Accept_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
Result.Corresponding_Entry := Element.Corresponding_Entry;
Result.Is_Name_Repeated := Element.Is_Name_Repeated;
Result.Handled_Statements := Element.Handled_Statements;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Accept_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Accept_Entry_Direct_Name :=
Copy (Cloner, Accept_Entry_Direct_Name (Source.all), Asis.Element (Target));
Target.Accept_Entry_Index :=
Copy (Cloner, Accept_Entry_Index (Source.all), Asis.Element (Target));
Set_Accept_Parameters
(Target.all,
Primary_Parameter_Lists.Deep_Copy
(Accept_Parameters (Source.all), Cloner, Asis.Element (Target)));
Set_Accept_Body_Statements
(Target.all,
Primary_Statement_Lists.Deep_Copy
(Accept_Body_Statements (Source.all), Cloner, Asis.Element (Target)));
Set_Accept_Body_Exception_Handlers
(Target.all,
Primary_Handler_Lists.Deep_Copy
(Accept_Body_Exception_Handlers (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function Requeue_Entry_Name
(Element : Requeue_Statement_Node) return Asis.Name is
begin
return Element.Requeue_Entry_Name;
end Requeue_Entry_Name;
procedure Set_Requeue_Entry_Name
(Element : in out Requeue_Statement_Node;
Value : in Asis.Name) is
begin
Element.Requeue_Entry_Name := Value;
end Set_Requeue_Entry_Name;
function New_Requeue_Statement_Node
(The_Context : ASIS.Context)
return Requeue_Statement_Ptr
is
Result : Requeue_Statement_Ptr :=
new Requeue_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Requeue_Statement_Node;
function Statement_Kind (Element : Requeue_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Requeue_Statement;
end;
function Children (Element : access Requeue_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Requeue_Entry_Name'Access));
end Children;
function Clone
(Element : Requeue_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Requeue_Statement_Ptr := new Requeue_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Requeue_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Requeue_Entry_Name :=
Copy (Cloner, Requeue_Entry_Name (Source.all), Asis.Element (Target));
end Copy;
function New_Requeue_Statement_With_Abort_Node
(The_Context : ASIS.Context)
return Requeue_Statement_With_Abort_Ptr
is
Result : Requeue_Statement_With_Abort_Ptr :=
new Requeue_Statement_With_Abort_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Requeue_Statement_With_Abort_Node;
function Statement_Kind (Element : Requeue_Statement_With_Abort_Node)
return Asis.Statement_Kinds is
begin
return A_Requeue_Statement_With_Abort;
end;
function Clone
(Element : Requeue_Statement_With_Abort_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Requeue_Statement_With_Abort_Ptr := new Requeue_Statement_With_Abort_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Requeue_Statement_With_Abort_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Requeue_Entry_Name :=
Copy (Cloner, Requeue_Entry_Name (Source.all), Asis.Element (Target));
end Copy;
function Delay_Expression
(Element : Delay_Until_Statement_Node) return Asis.Expression is
begin
return Element.Delay_Expression;
end Delay_Expression;
procedure Set_Delay_Expression
(Element : in out Delay_Until_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Delay_Expression := Value;
end Set_Delay_Expression;
function New_Delay_Until_Statement_Node
(The_Context : ASIS.Context)
return Delay_Until_Statement_Ptr
is
Result : Delay_Until_Statement_Ptr :=
new Delay_Until_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Delay_Until_Statement_Node;
function Statement_Kind (Element : Delay_Until_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Delay_Until_Statement;
end;
function Children (Element : access Delay_Until_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Delay_Expression'Access));
end Children;
function Clone
(Element : Delay_Until_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Delay_Until_Statement_Ptr := new Delay_Until_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Delay_Until_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Delay_Expression :=
Copy (Cloner, Delay_Expression (Source.all), Asis.Element (Target));
end Copy;
function New_Delay_Relative_Statement_Node
(The_Context : ASIS.Context)
return Delay_Relative_Statement_Ptr
is
Result : Delay_Relative_Statement_Ptr :=
new Delay_Relative_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Delay_Relative_Statement_Node;
function Statement_Kind (Element : Delay_Relative_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Delay_Relative_Statement;
end;
function Clone
(Element : Delay_Relative_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Delay_Relative_Statement_Ptr := new Delay_Relative_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Delay_Relative_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Delay_Expression :=
Copy (Cloner, Delay_Expression (Source.all), Asis.Element (Target));
end Copy;
function New_Terminate_Alternative_Statement_Node
(The_Context : ASIS.Context)
return Terminate_Alternative_Statement_Ptr
is
Result : Terminate_Alternative_Statement_Ptr :=
new Terminate_Alternative_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Terminate_Alternative_Statement_Node;
function Statement_Kind (Element : Terminate_Alternative_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Terminate_Alternative_Statement;
end;
function Clone
(Element : Terminate_Alternative_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Terminate_Alternative_Statement_Ptr := new Terminate_Alternative_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Terminate_Alternative_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function Aborted_Tasks
(Element : Abort_Statement_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List is
begin
return Primary_Expression_Lists.To_Element_List
(Element.Aborted_Tasks, Include_Pragmas);
end Aborted_Tasks;
procedure Set_Aborted_Tasks
(Element : in out Abort_Statement_Node;
Value : in Asis.Element) is
begin
Element.Aborted_Tasks := Primary_Expression_Lists.List (Value);
end Set_Aborted_Tasks;
function Aborted_Tasks_List
(Element : Abort_Statement_Node) return Asis.Element is
begin
return Asis.Element (Element.Aborted_Tasks);
end Aborted_Tasks_List;
function New_Abort_Statement_Node
(The_Context : ASIS.Context)
return Abort_Statement_Ptr
is
Result : Abort_Statement_Ptr :=
new Abort_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Abort_Statement_Node;
function Statement_Kind (Element : Abort_Statement_Node)
return Asis.Statement_Kinds is
begin
return An_Abort_Statement;
end;
function Children (Element : access Abort_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(True, Asis.Element (Element.Aborted_Tasks)));
end Children;
function Clone
(Element : Abort_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Abort_Statement_Ptr := new Abort_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Abort_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Set_Aborted_Tasks
(Target.all,
Primary_Expression_Lists.Deep_Copy
(Aborted_Tasks (Source.all), Cloner, Asis.Element (Target)));
end Copy;
function Raised_Exception
(Element : Raise_Statement_Node) return Asis.Expression is
begin
return Element.Raised_Exception;
end Raised_Exception;
procedure Set_Raised_Exception
(Element : in out Raise_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Raised_Exception := Value;
end Set_Raised_Exception;
function Raise_Statement_Message
(Element : Raise_Statement_Node) return Asis.Expression is
begin
return Element.Raise_Statement_Message;
end Raise_Statement_Message;
procedure Set_Raise_Statement_Message
(Element : in out Raise_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Raise_Statement_Message := Value;
end Set_Raise_Statement_Message;
function New_Raise_Statement_Node
(The_Context : ASIS.Context)
return Raise_Statement_Ptr
is
Result : Raise_Statement_Ptr :=
new Raise_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Raise_Statement_Node;
function Statement_Kind (Element : Raise_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Raise_Statement;
end;
function Children (Element : access Raise_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Raised_Exception'Access),
(False, Element.Raise_Statement_Message'Access));
end Children;
function Clone
(Element : Raise_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Raise_Statement_Ptr := new Raise_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Raise_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Raised_Exception :=
Copy (Cloner, Raised_Exception (Source.all), Asis.Element (Target));
Target.Raise_Statement_Message :=
Copy (Cloner, Raise_Statement_Message (Source.all), Asis.Element (Target));
end Copy;
function Qualified_Expression
(Element : Code_Statement_Node) return Asis.Expression is
begin
return Element.Qualified_Expression;
end Qualified_Expression;
procedure Set_Qualified_Expression
(Element : in out Code_Statement_Node;
Value : in Asis.Expression) is
begin
Element.Qualified_Expression := Value;
end Set_Qualified_Expression;
function New_Code_Statement_Node
(The_Context : ASIS.Context)
return Code_Statement_Ptr
is
Result : Code_Statement_Ptr :=
new Code_Statement_Node;
begin
Set_Enclosing_Compilation_Unit
(Result.all, Current_Unit (The_Context.all));
return Result;
end New_Code_Statement_Node;
function Statement_Kind (Element : Code_Statement_Node)
return Asis.Statement_Kinds is
begin
return A_Code_Statement;
end;
function Children (Element : access Code_Statement_Node)
return Traverse_List is
begin
return ((True, Asis.Element (Element.Label_Names)),
(False, Element.Qualified_Expression'Access));
end Children;
function Clone
(Element : Code_Statement_Node;
Parent : Asis.Element)
return Asis.Element
is
Result : constant Code_Statement_Ptr := new Code_Statement_Node;
begin
Result.Enclosing_Element := Parent;
Result.Is_Part_Of_Implicit := Element.Is_Part_Of_Implicit;
Result.Is_Part_Of_Inherited := Element.Is_Part_Of_Inherited;
Result.Is_Part_Of_Instance := Element.Is_Part_Of_Instance;
Result.Start_Position := Element.Start_Position;
Result.End_Position := Element.End_Position;
Result.Enclosing_Compilation_Unit :=
Enclosing_Compilation_Unit (Parent.all);
Result.Hash := Element.Hash;
null;
Result.Place := Element.Place;
return Asis.Element (Result);
end Clone;
procedure Copy
(Source : in Asis.Element;
Target : access Code_Statement_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element)
is
begin
Set_Label_Names
(Target.all,
Primary_Defining_Name_Lists.Deep_Copy
(Label_Names (Source.all), Cloner, Asis.Element (Target)));
Target.Qualified_Expression :=
Copy (Cloner, Qualified_Expression (Source.all), Asis.Element (Target));
end Copy;
end Asis.Gela.Elements.Stmt;
|
pragma Ada_2005;
pragma Style_Checks (Off);
pragma Warnings (Off);
with Interfaces.C; use Interfaces.C;
with glib;
with glib.Values;
with System;
with glib;
with System;
-- limited -- with GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h;
-- limited with GStreamer.GST_Low_Level.glib_2_0_glib_glist_h;
-- limited with GStreamer.GST_Low_Level.glib_2_0_gobject_gvaluearray_h;
package GStreamer.GST_Low_Level.gstreamer_0_10_gst_interfaces_propertyprobe_h is
-- unsupported macro: GST_TYPE_PROPERTY_PROBE (gst_property_probe_get_type ())
-- arg-macro: function GST_PROPERTY_PROBE (obj)
-- return G_TYPE_CHECK_INSTANCE_CAST ((obj), GST_TYPE_PROPERTY_PROBE, GstPropertyProbe);
-- arg-macro: function GST_IS_PROPERTY_PROBE (obj)
-- return G_TYPE_CHECK_INSTANCE_TYPE ((obj), GST_TYPE_PROPERTY_PROBE);
-- arg-macro: function GST_PROPERTY_PROBE_GET_IFACE (obj)
-- return G_TYPE_INSTANCE_GET_INTERFACE ((obj), GST_TYPE_PROPERTY_PROBE, GstPropertyProbeInterface);
-- GStreamer PropertyProbe
-- * Copyright (C) 2003 David A. Schleef <ds@schleef.org>
-- *
-- * property_probe.h: property_probe interface design
-- *
-- * 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.
--
--*
-- * GstPropertyProbe:
-- *
-- * Opaque #GstPropertyProbe data structure.
--
-- dummy typedef
-- skipped empty struct u_GstPropertyProbe
-- skipped empty struct GstPropertyProbe
type GstPropertyProbeInterface;
type u_GstPropertyProbeInterface_u_gst_reserved_array is array (0 .. 3) of System.Address;
--subtype GstPropertyProbeInterface is u_GstPropertyProbeInterface; -- gst/interfaces/propertyprobe.h:44
--*
-- * GstPropertyProbeInterface:
-- * @klass: parent interface type.
-- * @probe_needed: default signal handler
-- * @get_properties: virtual method to get list of probable properties
-- * @needs_probe: virtual method to tell if probe need update
-- * @probe_property: virtual method to probe a property
-- * @get_values: virtual method to get probe results for a property
-- *
-- * #GstPropertyProbe interface.
--
type GstPropertyProbeInterface is record
klass : aliased GStreamer.GST_Low_Level.glib_2_0_gobject_gtype_h.GTypeInterface; -- gst/interfaces/propertyprobe.h:58
probe_needed : access procedure (arg1 : System.Address; arg2 : access constant GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec); -- gst/interfaces/propertyprobe.h:62
get_properties : access function (arg1 : System.Address) return access constant GStreamer.GST_Low_Level.glib_2_0_glib_glist_h.GList; -- gst/interfaces/propertyprobe.h:65
needs_probe : access function
(arg1 : System.Address;
arg2 : GLIB.guint;
arg3 : access constant GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec) return GLIB.gboolean; -- gst/interfaces/propertyprobe.h:68
probe_property : access procedure
(arg1 : System.Address;
arg2 : GLIB.guint;
arg3 : access constant GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec); -- gst/interfaces/propertyprobe.h:71
get_values : access function
(arg1 : System.Address;
arg2 : GLIB.guint;
arg3 : access constant GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec) return access GStreamer.GST_Low_Level.glib_2_0_gobject_gvaluearray_h.GValueArray; -- gst/interfaces/propertyprobe.h:74
u_gst_reserved : u_GstPropertyProbeInterface_u_gst_reserved_array; -- gst/interfaces/propertyprobe.h:77
end record;
pragma Convention (C_Pass_By_Copy, GstPropertyProbeInterface); -- gst/interfaces/propertyprobe.h:57
-- signals
-- virtual functions
--< private >
function gst_property_probe_get_type return GLIB.GType; -- gst/interfaces/propertyprobe.h:80
pragma Import (C, gst_property_probe_get_type, "gst_property_probe_get_type");
-- virtual class function wrappers
-- returns list of GParamSpecs
function gst_property_probe_get_properties (probe : System.Address) return access constant GStreamer.GST_Low_Level.glib_2_0_glib_glist_h.GList; -- gst/interfaces/propertyprobe.h:85
pragma Import (C, gst_property_probe_get_properties, "gst_property_probe_get_properties");
function gst_property_probe_get_property (probe : System.Address; name : access GLIB.gchar) return access constant GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec; -- gst/interfaces/propertyprobe.h:86
pragma Import (C, gst_property_probe_get_property, "gst_property_probe_get_property");
-- probe one property
procedure gst_property_probe_probe_property (probe : System.Address; pspec : access constant GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec); -- gst/interfaces/propertyprobe.h:90
pragma Import (C, gst_property_probe_probe_property, "gst_property_probe_probe_property");
procedure gst_property_probe_probe_property_name (probe : System.Address; name : access GLIB.gchar); -- gst/interfaces/propertyprobe.h:92
pragma Import (C, gst_property_probe_probe_property_name, "gst_property_probe_probe_property_name");
-- do we need a probe?
function gst_property_probe_needs_probe (probe : System.Address; pspec : access constant GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec) return GLIB.gboolean; -- gst/interfaces/propertyprobe.h:96
pragma Import (C, gst_property_probe_needs_probe, "gst_property_probe_needs_probe");
function gst_property_probe_needs_probe_name (probe : System.Address; name : access GLIB.gchar) return GLIB.gboolean; -- gst/interfaces/propertyprobe.h:98
pragma Import (C, gst_property_probe_needs_probe_name, "gst_property_probe_needs_probe_name");
-- returns list of GValues
function gst_property_probe_get_values (probe : System.Address; pspec : access constant GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec) return access GStreamer.GST_Low_Level.glib_2_0_gobject_gvaluearray_h.GValueArray; -- gst/interfaces/propertyprobe.h:102
pragma Import (C, gst_property_probe_get_values, "gst_property_probe_get_values");
function gst_property_probe_get_values_name (probe : System.Address; name : access GLIB.gchar) return access GStreamer.GST_Low_Level.glib_2_0_gobject_gvaluearray_h.GValueArray; -- gst/interfaces/propertyprobe.h:104
pragma Import (C, gst_property_probe_get_values_name, "gst_property_probe_get_values_name");
-- sugar
function gst_property_probe_probe_and_get_values (probe : System.Address; pspec : access constant GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec) return access GStreamer.GST_Low_Level.glib_2_0_gobject_gvaluearray_h.GValueArray; -- gst/interfaces/propertyprobe.h:108
pragma Import (C, gst_property_probe_probe_and_get_values, "gst_property_probe_probe_and_get_values");
function gst_property_probe_probe_and_get_values_name (probe : System.Address; name : access GLIB.gchar) return access GStreamer.GST_Low_Level.glib_2_0_gobject_gvaluearray_h.GValueArray; -- gst/interfaces/propertyprobe.h:110
pragma Import (C, gst_property_probe_probe_and_get_values_name, "gst_property_probe_probe_and_get_values_name");
end GStreamer.GST_Low_Level.gstreamer_0_10_gst_interfaces_propertyprobe_h;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="17">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>genARPDiscovery</name>
<module_structure>Pipeline</module_structure>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>macIpEncode_req_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>3621216858</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>macIpEncode_rsp_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>128</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>arp_scan</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1768318322</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>2</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>myIpAddress</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<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="_5">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>macIpEncode_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName>FIFO_SRL</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>84</coreId>
<rtlModuleName></rtlModuleName>
</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>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>macIpEncode_rsp_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName>FIFO_SRL</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>84</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>52</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>gia_fsm_state_load</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>285</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>285</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202849232</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>v1_V</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>309</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>309</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>v1.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202470528</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>arp_scan_read</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>1049</lineNumber>
<contextFuncName>operator==&lt;32, true&gt;</contextFuncName>
<contextNormFuncName>operator_eq_32_true</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</first>
<second>operator==&lt;32, true&gt;</second>
</first>
<second>1049</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202470528</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>94</item>
<item>95</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>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>_ln285</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>285</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>285</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202470528</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>12</count>
<item_version>0</item_version>
<item>96</item>
<item>97</item>
<item>99</item>
<item>100</item>
<item>102</item>
<item>103</item>
<item>105</item>
<item>106</item>
<item>108</item>
<item>109</item>
<item>111</item>
<item>112</item>
</oprand_edges>
<opcode>switch</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.65</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>ip_lsb_V_write_ln330</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>330</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>330</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202470528</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>219</item>
<item>220</item>
<item>460</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>gia_fsm_state_write_ln331</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>331</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>331</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202470528</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>221</item>
<item>222</item>
<item>459</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>br_ln332</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>332</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>332</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202426640</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>223</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>tmp_2_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>empty</contextFuncName>
<contextNormFuncName>empty</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>empty</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>adapter</opType>
<implIndex>axi4stream</implIndex>
<coreName>axis</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>123</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>170</item>
<item>171</item>
<item>172</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>br_ln313</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>313</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>313</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202685408</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>173</item>
<item>174</item>
<item>175</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>adapter</opType>
<implIndex>axi4stream</implIndex>
<coreName>axis</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>123</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>177</item>
<item>178</item>
<item>465</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>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>macIpEncode_i_write_ln174</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>write</contextFuncName>
<contextNormFuncName>write</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>write</second>
</first>
<second>174</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>81</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>179</item>
<item>180</item>
<item>181</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.45</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>br_ln314</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>314</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>314</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202470528</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>182</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>checkArpScan_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>checkArpScan.V</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>184</item>
<item>185</item>
<item>187</item>
<item>188</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>tmp_4_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>empty</contextFuncName>
<contextNormFuncName>empty</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>empty</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>81</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>189</item>
<item>190</item>
<item>191</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>br_ln318</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>318</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>318</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>192</item>
<item>193</item>
<item>194</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp_1</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>81</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>195</item>
<item>196</item>
<item>466</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.41</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>macIpEncode_rsp_V_write_ln174</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>write</contextFuncName>
<contextNormFuncName>write</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>write</second>
</first>
<second>174</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>adapter</opType>
<implIndex>axi4stream</implIndex>
<coreName>axis</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>123</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>198</item>
<item>199</item>
<item>200</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>br_ln323</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>323</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>323</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202672352</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>201</item>
<item>202</item>
<item>203</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>arp_scan_1d_V_load</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>1049</lineNumber>
<contextFuncName>operator==&lt;32, true&gt;</contextFuncName>
<contextNormFuncName>operator_eq_32_true</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</first>
<second>operator==&lt;32, true&gt;</second>
</first>
<second>1049</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1769218162</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>204</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>xor_ln323</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>323</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>323</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>xor</opType>
<implIndex>auto</implIndex>
<coreName>LogicGate</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>74</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>205</item>
<item>206</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>18</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>or_ln323</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>323</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>323</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>or</opType>
<implIndex>auto</implIndex>
<coreName>LogicGate</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>74</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>207</item>
<item>208</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.12</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>br_ln323</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>323</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>323</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202496544</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>209</item>
<item>210</item>
<item>211</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>arp_scan_write_ln324</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>324</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>324</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202498304</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>213</item>
<item>214</item>
<item>215</item>
<item>464</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>gia_fsm_state_write_ln325</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>325</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>325</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202499408</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>216</item>
<item>217</item>
<item>463</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>br_ln326</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>326</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>326</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>976894836</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>218</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp_1_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>empty</contextFuncName>
<contextNormFuncName>empty</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>empty</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>81</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>150</item>
<item>151</item>
<item>152</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>br_ln301</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>301</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>301</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202523904</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>153</item>
<item>154</item>
<item>155</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>p_07</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>145</lineNumber>
<contextFuncName>read</contextFuncName>
<contextNormFuncName>read</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>read</second>
</first>
<second>145</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>81</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>157</item>
<item>158</item>
<item>468</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.41</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>icmp_ln1049_1</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>1049</lineNumber>
<contextFuncName>operator==&lt;32, true&gt;</contextFuncName>
<contextNormFuncName>operator_eq_32_true</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</first>
<second>operator==&lt;32, true&gt;</second>
</first>
<second>1049</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>icmp</opType>
<implIndex>auto</implIndex>
<coreName>Cmp</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>9</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>159</item>
<item>161</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.58</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>select_ln305</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>305</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>305</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>select</opType>
<implIndex>auto_sel</implIndex>
<coreName>Sel</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>73</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>162</item>
<item>163</item>
<item>164</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.27</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>gia_fsm_state_write_ln305</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>305</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>305</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>165</item>
<item>166</item>
<item>462</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>br_ln309</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>309</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>309</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>167</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>br_ln310</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>310</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>310</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>542329928</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>168</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>p_Val2_s</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202742088</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>130</item>
<item>131</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>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>trunc_ln674</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>674</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>674</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>892875008</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>132</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>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>p_s</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>312</lineNumber>
<contextFuncName>get</contextFuncName>
<contextNormFuncName>get</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_ref.h</first>
<second>get</second>
</first>
<second>312</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
<item>136</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>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>macIpEncode_i_write_ln174</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>write</contextFuncName>
<contextNormFuncName>write</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/hls_stream_39.h</first>
<second>write</second>
</first>
<second>174</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>81</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>138</item>
<item>139</item>
<item>140</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.45</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>add_ln870</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>870</lineNumber>
<contextFuncName>operator+=&lt;1, false&gt;</contextFuncName>
<contextNormFuncName>operator_add_assign_1_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</first>
<second>operator+=&lt;1, false&gt;</second>
</first>
<second>870</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>add</opType>
<implIndex>fabric</implIndex>
<coreName>Adder</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>141</item>
<item>143</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.70</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>ip_lsb_V_write_ln870</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>870</lineNumber>
<contextFuncName>operator+=&lt;1, false&gt;</contextFuncName>
<contextNormFuncName>operator_add_assign_1_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</first>
<second>operator+=&lt;1, false&gt;</second>
</first>
<second>870</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>144</item>
<item>145</item>
<item>458</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>gia_fsm_state_write_ln297</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>297</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>297</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202750144</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>146</item>
<item>147</item>
<item>457</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>br_ln298</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>298</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>298</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202751248</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>time_counter_load</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>1049</lineNumber>
<contextFuncName>operator==&lt;32, true&gt;</contextFuncName>
<contextNormFuncName>operator_eq_32_true</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</first>
<second>operator==&lt;32, true&gt;</second>
</first>
<second>1049</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>825438509</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>icmp_ln1049</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>1049</lineNumber>
<contextFuncName>operator==&lt;32, true&gt;</contextFuncName>
<contextNormFuncName>operator_eq_32_true</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</first>
<second>operator==&lt;32, true&gt;</second>
</first>
<second>1049</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>icmp</opType>
<implIndex>auto</implIndex>
<coreName>Cmp</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>9</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>114</item>
<item>116</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>br_ln288</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>288</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>288</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>117</item>
<item>118</item>
<item>119</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>40</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>gia_fsm_state_write_ln289</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>289</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>289</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202729504</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>120</item>
<item>121</item>
<item>461</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.45</m_delay>
<m_topoIndex>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>br_ln289</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>289</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>289</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202731040</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>122</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>add_ln870_1</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>870</lineNumber>
<contextFuncName>operator+=&lt;1, false&gt;</contextFuncName>
<contextNormFuncName>operator_add_assign_1_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</first>
<second>operator+=&lt;1, false&gt;</second>
</first>
<second>870</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control>auto</control>
<opType>add</opType>
<implIndex>fabric</implIndex>
<coreName>Adder</coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>123</item>
<item>125</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.88</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>time_counter_write_ln870</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>870</lineNumber>
<contextFuncName>operator+=&lt;1, false&gt;</contextFuncName>
<contextNormFuncName>operator_add_assign_1_false</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</first>
<second>operator+=&lt;1, false&gt;</second>
</first>
<second>870</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202734496</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>126</item>
<item>127</item>
<item>469</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>br_ln291</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>291</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>291</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.38</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>arp_scan_loc_1_i</name>
<fileName>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>1049</lineNumber>
<contextFuncName>operator==&lt;32, true&gt;</contextFuncName>
<contextNormFuncName>operator_eq_32_true</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/tools/Xilinx/Vitis_HLS/2021.1/common/technology/autopilot/ap_int_base.h</first>
<second>operator==&lt;32, true&gt;</second>
</first>
<second>1049</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1601399040</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>16</count>
<item_version>0</item_version>
<item>224</item>
<item>225</item>
<item>226</item>
<item>227</item>
<item>228</item>
<item>229</item>
<item>230</item>
<item>231</item>
<item>232</item>
<item>233</item>
<item>234</item>
<item>235</item>
<item>236</item>
<item>237</item>
<item>238</item>
<item>239</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>arp_scan_1d_V_write_ln334</name>
<fileName>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</fileName>
<fileDirectory>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</fileDirectory>
<lineNumber>334</lineNumber>
<contextFuncName>genARPDiscovery</contextFuncName>
<contextNormFuncName>genARPDiscovery</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/ubuntu/xup_vitis_network_example/NetLayers/100G-fpga-network-stack-core/synthesis_results_HMB/..//hls/arp_server/arp_server.cpp</first>
<second>genARPDiscovery</second>
</first>
<second>334</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202596800</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>240</item>
<item>241</item>
<item>467</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202754336</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_59">
<Value>
<Obj>
<type>2</type>
<id>98</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>62</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_60">
<Value>
<Obj>
<type>2</type>
<id>101</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202755504</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_61">
<Value>
<Obj>
<type>2</type>
<id>104</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1819113532</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_62">
<Value>
<Obj>
<type>2</type>
<id>107</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202756800</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_63">
<Value>
<Obj>
<type>2</type>
<id>110</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202757072</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>3</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>115</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1500000000</content>
</item>
<item class_id_reference="16" object_id="_65">
<Value>
<Obj>
<type>2</type>
<id>124</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202758928</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_66">
<Value>
<Obj>
<type>2</type>
<id>142</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202758176</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_67">
<Value>
<Obj>
<type>2</type>
<id>160</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202762824</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_68">
<Value>
<Obj>
<type>2</type>
<id>183</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202761536</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</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>186</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1702258035</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>16</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_70">
<Obj>
<type>3</type>
<id>27</id>
<name>entry</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1936025716</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_71">
<Obj>
<type>3</type>
<id>31</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1936290661</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>28</item>
<item>29</item>
<item>30</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_72">
<Obj>
<type>3</type>
<id>34</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1936025716</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>32</item>
<item>33</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_73">
<Obj>
<type>3</type>
<id>38</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1936290661</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>35</item>
<item>36</item>
<item>37</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_74">
<Obj>
<type>3</type>
<id>42</id>
<name>._crit_edge4.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1769170280</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>39</item>
<item>40</item>
<item>41</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_75">
<Obj>
<type>3</type>
<id>46</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1936025716</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>43</item>
<item>44</item>
<item>45</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_76">
<Obj>
<type>3</type>
<id>51</id>
<name>.critedge.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1936025716</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_77">
<Obj>
<type>3</type>
<id>55</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>52</item>
<item>53</item>
<item>54</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_78">
<Obj>
<type>3</type>
<id>58</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>176</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>56</item>
<item>57</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_79">
<Obj>
<type>3</type>
<id>64</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>825193216</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_80">
<Obj>
<type>3</type>
<id>66</id>
<name>._crit_edge3.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>0</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_81">
<Obj>
<type>3</type>
<id>75</id>
<name>_ZN7ap_uintILi32EEC2ILi8E11ap_int_baseILi8ELb0EELi32E12ap_range_refILi32ELb0EEEERK13ap_concat_refIXT_ET0_XT1_ET2_E.exit.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1952804447</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>8</count>
<item_version>0</item_version>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>74</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_82">
<Obj>
<type>3</type>
<id>79</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202724224</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
<item>78</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_83">
<Obj>
<type>3</type>
<id>82</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202729056</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>80</item>
<item>81</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_84">
<Obj>
<type>3</type>
<id>86</id>
<name>._crit_edge2.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1801675124</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>83</item>
<item>84</item>
<item>85</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_85">
<Obj>
<type>3</type>
<id>90</id>
<name>genARPDiscovery.exit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<isStorage>0</isStorage>
<storageDepth>0</storageDepth>
<coreId>1202470528</coreId>
<rtlModuleName></rtlModuleName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>87</item>
<item>88</item>
<item>89</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>156</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_86">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>97</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>100</id>
<edge_type>2</edge_type>
<source_obj>79</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>103</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_95">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_96">
<id>106</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_97">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>112</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>114</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="_103">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>117</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="_105">
<id>118</id>
<edge_type>2</edge_type>
<source_obj>86</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>119</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_109">
<id>122</id>
<edge_type>2</edge_type>
<source_obj>86</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_110">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_111">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_112">
<id>126</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="_113">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_114">
<id>128</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_117">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>136</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="_119">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>140</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="_121">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>142</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>144</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="_124">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_126">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>148</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_128">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_129">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_130">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_131">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_132">
<id>155</id>
<edge_type>2</edge_type>
<source_obj>64</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_133">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>160</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_136">
<id>162</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="_137">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_138">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>165</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="_140">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_141">
<id>167</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>168</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_145">
<id>173</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="_146">
<id>174</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>175</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>181</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="_151">
<id>182</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>185</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_154">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>188</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>193</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_160">
<id>194</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_164">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>202</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>203</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>209</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="_173">
<id>210</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_174">
<id>211</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>218</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>160</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_181">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>223</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>225</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>227</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>229</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>231</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>233</id>
<edge_type>2</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="_195">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>235</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>237</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>239</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>240</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="_202">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>431</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>432</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>433</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>434</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>435</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>436</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>437</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>438</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>439</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>440</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>441</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>442</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>443</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>444</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>445</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>446</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>447</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>448</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>449</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>450</id>
<edge_type>2</edge_type>
<source_obj>64</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>451</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>452</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>453</id>
<edge_type>2</edge_type>
<source_obj>79</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>454</id>
<edge_type>2</edge_type>
<source_obj>79</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>455</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>456</id>
<edge_type>2</edge_type>
<source_obj>86</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>457</id>
<edge_type>4</edge_type>
<source_obj>23</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>458</id>
<edge_type>4</edge_type>
<source_obj>24</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>459</id>
<edge_type>4</edge_type>
<source_obj>23</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>460</id>
<edge_type>4</edge_type>
<source_obj>24</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>461</id>
<edge_type>4</edge_type>
<source_obj>23</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>462</id>
<edge_type>4</edge_type>
<source_obj>23</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>463</id>
<edge_type>4</edge_type>
<source_obj>23</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>464</id>
<edge_type>4</edge_type>
<source_obj>25</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>465</id>
<edge_type>4</edge_type>
<source_obj>32</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>466</id>
<edge_type>4</edge_type>
<source_obj>40</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>467</id>
<edge_type>4</edge_type>
<source_obj>47</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>468</id>
<edge_type>4</edge_type>
<source_obj>56</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>469</id>
<edge_type>4</edge_type>
<source_obj>76</source_obj>
<sink_obj>84</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="_242">
<mId>1</mId>
<mTag>genARPDiscovery</mTag>
<mNormTag>genARPDiscovery</mNormTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>16</count>
<item_version>0</item_version>
<item>27</item>
<item>31</item>
<item>34</item>
<item>38</item>
<item>42</item>
<item>46</item>
<item>51</item>
<item>55</item>
<item>58</item>
<item>64</item>
<item>66</item>
<item>75</item>
<item>79</item>
<item>82</item>
<item>86</item>
<item>90</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2</mMinLatency>
<mMaxLatency>2</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_243">
<states class_id="25" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_244">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>59</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_245">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_246">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_247">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_248">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_249">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_250">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_251">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_252">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_253">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_254">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_255">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_256">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_257">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_258">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_259">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_260">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_261">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_262">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_263">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_264">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_268">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_269">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_270">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_271">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_272">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_275">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_276">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_277">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_278">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_279">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_280">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_284">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_285">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_286">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_287">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_288">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_289">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_290">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_291">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_292">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_293">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_294">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_295">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_296">
<id>78</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_297">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_298">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_299">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_300">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_301">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_302">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_303">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_304">
<id>2</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_305">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_306">
<id>44</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_307">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_308">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_309">
<id>3</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_310">
<id>44</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_311">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_312">
<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="_313">
<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>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="35" tracking_level="0" version="0">
<count>52</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>23</first>
<second class_id="37" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="38" tracking_level="0" version="0">
<count>16</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>27</first>
<second class_id="40" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>0</first>
<second>2</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>0</first>
<second>2</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="_314">
<region_name>genARPDiscovery</region_name>
<basic_blocks>
<count>16</count>
<item_version>0</item_version>
<item>27</item>
<item>31</item>
<item>34</item>
<item>38</item>
<item>42</item>
<item>46</item>
<item>51</item>
<item>55</item>
<item>58</item>
<item>64</item>
<item>66</item>
<item>75</item>
<item>79</item>
<item>82</item>
<item>86</item>
<item>90</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>3</pipe_depth>
<mDBIIViolationVec class_id="43" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</mDBIIViolationVec>
</item>
</regions>
<dp_fu_nodes class_id="44" tracking_level="0" version="0">
<count>33</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>100</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>40</item>
<item>56</item>
</second>
</item>
<item>
<first>108</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>59</item>
</second>
</item>
<item>
<first>114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>128</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>70</item>
</second>
</item>
<item>
<first>135</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>44</item>
<item>44</item>
</second>
</item>
<item>
<first>145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>186</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>196</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>206</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>212</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>224</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>230</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>238</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>244</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>254</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>260</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>300</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="47" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="0" version="0">
<first>add_ln870_1_fu_282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>add_ln870_fu_248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>arp_scan_loc_1_i_phi_fu_156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>checkArpScan_V_phi_fu_145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>icmp_ln1049_1_fu_224</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>icmp_ln1049_fu_270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>or_ln323_fu_212</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>p_s_fu_300</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>select_ln305_fu_230</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>trunc_ln674_fu_244</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>xor_ln323_fu_206</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</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>22</count>
<item_version>0</item_version>
<item>
<first>arp_scan_1d_V_load_load_fu_202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>arp_scan_read_read_fu_80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>gia_fsm_state_load_load_fu_182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>grp_nbreadreq_fu_100</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>40</item>
<item>56</item>
</second>
</item>
<item>
<first>grp_read_fu_108</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>59</item>
</second>
</item>
<item>
<first>grp_write_fu_128</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>70</item>
</second>
</item>
<item>
<first>grp_write_fu_135</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>44</item>
<item>44</item>
</second>
</item>
<item>
<first>p_Val2_s_read_fu_122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>store_ln289_store_fu_276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>store_ln297_store_fu_260</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>store_ln305_store_fu_238</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>store_ln325_store_fu_218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>store_ln330_store_fu_190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>store_ln331_store_fu_196</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>store_ln334_store_fu_294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>store_ln870_store_fu_254</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>store_ln870_store_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>time_counter_load_load_fu_266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>tmp_2_i_nbreadreq_fu_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>tmp_read_fu_94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>v1_V_load_fu_186</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>write_ln324_write_fu_114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</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="49" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>9</count>
<item_version>0</item_version>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>307</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>311</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>320</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>325</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>9</count>
<item_version>0</item_version>
<item>
<first>arp_scan_loc_1_i_reg_153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>checkArpScan_V_reg_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>gia_fsm_state_load_reg_307</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>tmp_1_reg_329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_2_i_reg_316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>tmp_4_i_reg_325</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>tmp_reg_320</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>trunc_ln674_reg_340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>v1_V_reg_311</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>arp_scan_loc_1_i_reg_153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>checkArpScan_V_reg_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="50" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first>arp_scan</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</second>
</item>
<item>
<first>macIpEncode_i</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>70</item>
<item>36</item>
</second>
</item>
</second>
</item>
<item>
<first>macIpEncode_req_V</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>nbreadreq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
</second>
</item>
<item>
<first>macIpEncode_rsp_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>44</item>
</second>
</item>
</second>
</item>
<item>
<first>macIpEncode_rsp_i</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>nbreadreq</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>56</item>
<item>40</item>
</second>
</item>
<item>
<first>read</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>59</item>
<item>43</item>
</second>
</item>
</second>
</item>
<item>
<first>myIpAddress</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core>
<count>2</count>
<item_version>0</item_version>
<item>
<first>8</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
</port2core>
<node2core>
<count>16</count>
<item_version>0</item_version>
<item>
<first>32</first>
<second>
<first>888</first>
<second>111</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>888</first>
<second>111</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>888</first>
<second>111</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>24</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>49</first>
<second>107</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>8</first>
<second>4</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>45</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>8</first>
<second>4</second>
</second>
</item>
</node2core>
</syndb>
</boost_serialization>
|
-- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
package body Tashy2.Test_Data is
procedure Set_Up(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Set_Up;
procedure Tear_Down(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Tear_Down;
end Tashy2.Test_Data;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . F I L E _ C O N T R O L _ B L O C K --
-- --
-- S p e c --
-- --
-- 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. --
-- --
-- --
-- --
-- --
-- --
-- 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 declaration of the basic file control block
-- shared between Text_IO, Sequential_IO, Direct_IO and Streams.Stream_IO.
-- The actual control blocks are derived from this block by extension. The
-- control block is itself derived from Ada.Streams.Root_Stream_Type which
-- facilitates implementation of Stream_IO.Stream and Text_Streams.Stream.
with Ada.Streams;
with Interfaces.C_Streams;
with System.CRTL;
package System.File_Control_Block is
----------------------------
-- Ada File Control Block --
----------------------------
-- The Ada file control block is an abstract extension of the root
-- stream type. This allows a file to be treated directly as a stream
-- for the purposes of Stream_IO, or stream operations on a text file.
-- The individual I/O packages extend this type with package specific
-- fields to create the concrete types to which the routines in this
-- package can be applied.
-- The type File_Type in the individual packages is an access to the
-- extended file control block. The value is null if the file is not
-- open, and a pointer to the control block if the file is open.
type Pstring is access all String;
-- Used to hold name and form strings
type File_Mode is (In_File, Inout_File, Out_File, Append_File);
subtype Read_File_Mode is File_Mode range In_File .. Inout_File;
-- File mode (union of file modes permitted by individual packages,
-- the types File_Mode in the individual packages are declared to
-- allow easy conversion to and from this general type.
type Shared_Status_Type is (Yes, No, None);
-- This type is used to define the sharing status of a file. The default
-- setting of None is used if no "shared=xxx" appears in the form string
-- when a file is created or opened. For a file with Shared_Status set to
-- None, Use_Error will be raised if any other file is opened or created
-- with the same full name. Yes/No are set in response to the presence
-- of "shared=yes" or "shared=no" in the form string. In either case it
-- is permissible to have multiple files opened with the same full name.
-- All files opened simultaneously with "shared=yes" will share the same
-- stream with the semantics specified in the RM for file sharing. All
-- files opened with "shared=no" will have their own stream.
type AFCB is tagged;
type AFCB_Ptr is access all AFCB'Class;
type AFCB is abstract new Ada.Streams.Root_Stream_Type with record
Stream : Interfaces.C_Streams.FILEs;
-- The file descriptor
Name : Pstring;
-- A pointer to the file name. The file name is null for temporary
-- files, and also for standard files (stdin, stdout, stderr). The
-- name is always null-terminated if it is non-null.
Encoding : System.CRTL.Filename_Encoding;
-- Encoding used to specified the filename
Form : Pstring;
-- A pointer to the form string. This is the string used in the
-- fopen call, and must be supplied by the caller (there are no
-- defaults at this level). The string is always null-terminated.
Mode : File_Mode;
-- The file mode. No checks are made that the mode is consistent
-- with the form used to fopen the file.
Is_Regular_File : Boolean;
-- A flag indicating if the file is a regular file
Is_Temporary_File : Boolean;
-- A flag set only for temporary files (i.e. files created using the
-- Create function with a null name parameter, using tmpfile). This
-- is currently not used since temporary files are deleted by the
-- operating system, but it is set properly in case some systems
-- need this information in the future.
Is_System_File : Boolean;
-- A flag set only for system files (stdin, stdout, stderr)
Is_Text_File : Boolean;
-- A flag set if the file was opened in text mode
Shared_Status : Shared_Status_Type;
-- Indicates sharing status of file, see description of type above
Access_Method : Character;
-- Set to 'Q', 'S', 'T', 'D' for Sequential_IO, Stream_IO, Text_IO,
-- Direct_IO file (used to validate file sharing request).
Next : AFCB_Ptr;
Prev : AFCB_Ptr;
-- All open files are kept on a doubly linked chain, with these
-- pointers used to maintain the next and previous pointers.
end record;
----------------------------------
-- Primitive Operations of AFCB --
----------------------------------
-- Note that we inherit the abstract operations Read and Write from
-- the base type. These must be overridden by the individual file
-- access methods to provide Stream Read/Write access.
function AFCB_Allocate (Control_Block : AFCB) return AFCB_Ptr is abstract;
-- Given a control block, allocate space for a control block of the same
-- type on the heap, and return the pointer to this allocated block. Note
-- that the argument Control_Block is not used other than as the argument
-- that controls which version of AFCB_Allocate is called.
procedure AFCB_Close (File : not null access AFCB) is abstract;
-- Performs any specialized close actions on a file before the file is
-- actually closed at the system level. This is called by Close, and
-- the reason we need the primitive operation is for the automatic
-- close operations done as part of finalization.
procedure AFCB_Free (File : not null access AFCB) is abstract;
-- Frees the AFCB referenced by the given parameter. It is not necessary
-- to free the strings referenced by the Form and Name fields, but if the
-- extension has any other heap objects, they must be freed as well. This
-- procedure must be overridden by each individual file package.
end System.File_Control_Block;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . P A R A M E T E R S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-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. --
-- --
------------------------------------------------------------------------------
-- Version used on all VxWorks targets.
package body System.Parameters is
-------------------------
-- Adjust_Storage_Size --
-------------------------
function Adjust_Storage_Size (Size : Size_Type) return Size_Type is
begin
if Size = Unspecified_Size then
return Default_Stack_Size;
elsif Size < Minimum_Stack_Size then
return Minimum_Stack_Size;
else
return Size;
end if;
end Adjust_Storage_Size;
------------------------
-- Default_Stack_Size --
------------------------
function Default_Stack_Size return Size_Type is
Default_Stack_Size : Integer;
pragma Import (C, Default_Stack_Size, "__gl_default_stack_size");
begin
if Default_Stack_Size = -1 then
return 20 * 1024;
else
return Size_Type (Default_Stack_Size);
end if;
end Default_Stack_Size;
------------------------
-- Minimum_Stack_Size --
------------------------
function Minimum_Stack_Size return Size_Type is
begin
return 8 * 1024;
end Minimum_Stack_Size;
end System.Parameters;
|
-- C24106A.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 UNDERSCORE CHARACTERS ARE PERMITTED IN ANY PART OF
-- A NON-BASED DECIMAL LITERAL.
-- HISTORY:
-- DHH 01/19/88 CREATED ORIGINAL TEST
WITH REPORT; USE REPORT;
PROCEDURE C24106A IS
BEGIN
TEST("C24106A", "CHECK THAT UNDERSCORE CHARACTERS " &
"ARE PERMITTED IN ANY PART OF " &
"A NON-BASED DECIMAL LITERAL");
IF 1.2_3_4_5_6 /= 1.23456 THEN
FAILED("UNDERSCORES NOT PERMITTED IN FRACTIONAL PART " &
"OF A NON_BASED LITERAL");
END IF;
IF 1_2_3_4_5.6 /= 12345.6 THEN
FAILED("UNDERSCORES NOT PERMITTED IN INTEGRAL PART " &
"OF A NON_BASED LITERAL");
END IF;
IF 0.12E1_2 /= 0.12E12 THEN
FAILED("UNDERSCORES NOT PERMITTED IN EXPONENT PART " &
"OF A NON_BASED LITERAL");
END IF;
IF 1_2_3_4_5 /= 12345 THEN
FAILED("UNDERSCORES NOT PERMITTED IN INTEGRAL PART " &
"OF A NON_BASED LITERAL INTEGER");
END IF;
IF 0E1_0 /= 0 THEN
FAILED("UNDERSCORES NOT PERMITTED IN EXPONENT PART " &
"OF A NON_BASED LITERAL INTEGER");
END IF;
RESULT;
END C24106A;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . S T R E A M _ A T T R I B U T E S . X D R --
-- --
-- B o d y --
-- --
-- Copyright (C) 1996-2020, Free Software Foundation, Inc. --
-- --
-- GARLIC is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.IO_Exceptions;
with Ada.Streams; use Ada.Streams;
with Ada.Unchecked_Conversion;
package body System.Stream_Attributes.XDR is
pragma Suppress (Range_Check);
pragma Suppress (Overflow_Check);
use UST;
Data_Error : exception renames Ada.IO_Exceptions.End_Error;
-- Exception raised if insufficient data read (End_Error is mandated by
-- AI95-00132).
SU : constant := System.Storage_Unit;
-- The code in this body assumes that SU = 8
BB : constant := 2 ** SU; -- Byte base
BL : constant := 2 ** SU - 1; -- Byte last
BS : constant := 2 ** (SU - 1); -- Byte sign
US : constant := Unsigned'Size; -- Unsigned size
UB : constant := (US - 1) / SU + 1; -- Unsigned byte
UL : constant := 2 ** US - 1; -- Unsigned last
subtype SE is Ada.Streams.Stream_Element;
subtype SEA is Ada.Streams.Stream_Element_Array;
subtype SEO is Ada.Streams.Stream_Element_Offset;
type Field_Type is record
E_Size : Integer; -- Exponent bit size
E_Bias : Integer; -- Exponent bias
F_Size : Integer; -- Fraction bit size
E_Last : Integer; -- Max exponent value
F_Mask : SE; -- Mask to apply on first fraction byte
E_Bytes : SEO; -- N. of exponent bytes completely used
F_Bytes : SEO; -- N. of fraction bytes completely used
F_Bits : Integer; -- N. of bits used on first fraction word
end record;
type Precision is (Single, Double, Quadruple);
Fields : constant array (Precision) of Field_Type := (
-- Single precision
(E_Size => 8,
E_Bias => 127,
F_Size => 23,
E_Last => 2 ** 8 - 1,
F_Mask => 16#7F#, -- 2 ** 7 - 1,
E_Bytes => 2,
F_Bytes => 3,
F_Bits => 23 mod US),
-- Double precision
(E_Size => 11,
E_Bias => 1023,
F_Size => 52,
E_Last => 2 ** 11 - 1,
F_Mask => 16#0F#, -- 2 ** 4 - 1,
E_Bytes => 2,
F_Bytes => 7,
F_Bits => 52 mod US),
-- Quadruple precision
(E_Size => 15,
E_Bias => 16383,
F_Size => 112,
E_Last => 2 ** 8 - 1,
F_Mask => 16#FF#, -- 2 ** 8 - 1,
E_Bytes => 2,
F_Bytes => 14,
F_Bits => 112 mod US));
-- The representation of all items requires a multiple of four bytes
-- (or 32 bits) of data. The bytes are numbered 0 through n-1. The bytes
-- are read or written to some byte stream such that byte m always
-- precedes byte m+1. If the n bytes needed to contain the data are not
-- a multiple of four, then the n bytes are followed by enough (0 to 3)
-- residual zero bytes, r, to make the total byte count a multiple of 4.
-- An XDR signed integer is a 32-bit datum that encodes an integer
-- in the range [-2147483648,2147483647]. The integer is represented
-- in two's complement notation. The most and least significant bytes
-- are 0 and 3, respectively. Integers are declared as follows:
-- (MSB) (LSB)
-- +-------+-------+-------+-------+
-- |byte 0 |byte 1 |byte 2 |byte 3 |
-- +-------+-------+-------+-------+
-- <------------32 bits------------>
SSI_L : constant := 1;
SI_L : constant := 2;
I24_L : constant := 3;
I_L : constant := 4;
LI_L : constant := 8;
LLI_L : constant := 8;
subtype XDR_S_SSI is SEA (1 .. SSI_L);
subtype XDR_S_SI is SEA (1 .. SI_L);
subtype XDR_S_I24 is SEA (1 .. I24_L);
subtype XDR_S_I is SEA (1 .. I_L);
subtype XDR_S_LI is SEA (1 .. LI_L);
subtype XDR_S_LLI is SEA (1 .. LLI_L);
function Short_Short_Integer_To_XDR_S_SSI is
new Ada.Unchecked_Conversion (Short_Short_Integer, XDR_S_SSI);
function XDR_S_SSI_To_Short_Short_Integer is
new Ada.Unchecked_Conversion (XDR_S_SSI, Short_Short_Integer);
function Short_Integer_To_XDR_S_SI is
new Ada.Unchecked_Conversion (Short_Integer, XDR_S_SI);
function XDR_S_SI_To_Short_Integer is
new Ada.Unchecked_Conversion (XDR_S_SI, Short_Integer);
function Integer_To_XDR_S_I24 is
new Ada.Unchecked_Conversion (Integer_24, XDR_S_I24);
function XDR_S_I24_To_Integer is
new Ada.Unchecked_Conversion (XDR_S_I24, Integer_24);
function Integer_To_XDR_S_I is
new Ada.Unchecked_Conversion (Integer, XDR_S_I);
function XDR_S_I_To_Integer is
new Ada.Unchecked_Conversion (XDR_S_I, Integer);
function Long_Long_Integer_To_XDR_S_LI is
new Ada.Unchecked_Conversion (Long_Long_Integer, XDR_S_LI);
function XDR_S_LI_To_Long_Long_Integer is
new Ada.Unchecked_Conversion (XDR_S_LI, Long_Long_Integer);
function Long_Long_Integer_To_XDR_S_LLI is
new Ada.Unchecked_Conversion (Long_Long_Integer, XDR_S_LLI);
function XDR_S_LLI_To_Long_Long_Integer is
new Ada.Unchecked_Conversion (XDR_S_LLI, Long_Long_Integer);
-- An XDR unsigned integer is a 32-bit datum that encodes a nonnegative
-- integer in the range [0,4294967295]. It is represented by an unsigned
-- binary number whose most and least significant bytes are 0 and 3,
-- respectively. An unsigned integer is declared as follows:
-- (MSB) (LSB)
-- +-------+-------+-------+-------+
-- |byte 0 |byte 1 |byte 2 |byte 3 |
-- +-------+-------+-------+-------+
-- <------------32 bits------------>
SSU_L : constant := 1;
SU_L : constant := 2;
U24_L : constant := 3;
U_L : constant := 4;
LU_L : constant := 8;
LLU_L : constant := 8;
subtype XDR_S_SSU is SEA (1 .. SSU_L);
subtype XDR_S_SU is SEA (1 .. SU_L);
subtype XDR_S_U24 is SEA (1 .. U24_L);
subtype XDR_S_U is SEA (1 .. U_L);
subtype XDR_S_LU is SEA (1 .. LU_L);
subtype XDR_S_LLU is SEA (1 .. LLU_L);
type XDR_SSU is mod BB ** SSU_L;
type XDR_SU is mod BB ** SU_L;
type XDR_U is mod BB ** U_L;
type XDR_U24 is mod BB ** U24_L;
function Short_Unsigned_To_XDR_S_SU is
new Ada.Unchecked_Conversion (Short_Unsigned, XDR_S_SU);
function XDR_S_SU_To_Short_Unsigned is
new Ada.Unchecked_Conversion (XDR_S_SU, Short_Unsigned);
function Unsigned_To_XDR_S_U24 is
new Ada.Unchecked_Conversion (Unsigned_24, XDR_S_U24);
function XDR_S_U24_To_Unsigned is
new Ada.Unchecked_Conversion (XDR_S_U24, Unsigned_24);
function Unsigned_To_XDR_S_U is
new Ada.Unchecked_Conversion (Unsigned, XDR_S_U);
function XDR_S_U_To_Unsigned is
new Ada.Unchecked_Conversion (XDR_S_U, Unsigned);
function Long_Long_Unsigned_To_XDR_S_LU is
new Ada.Unchecked_Conversion (Long_Long_Unsigned, XDR_S_LU);
function XDR_S_LU_To_Long_Long_Unsigned is
new Ada.Unchecked_Conversion (XDR_S_LU, Long_Long_Unsigned);
function Long_Long_Unsigned_To_XDR_S_LLU is
new Ada.Unchecked_Conversion (Long_Long_Unsigned, XDR_S_LLU);
function XDR_S_LLU_To_Long_Long_Unsigned is
new Ada.Unchecked_Conversion (XDR_S_LLU, Long_Long_Unsigned);
-- The standard defines the floating-point data type "float" (32 bits
-- or 4 bytes). The encoding used is the IEEE standard for normalized
-- single-precision floating-point numbers.
-- The standard defines the encoding used for the double-precision
-- floating-point data type "double" (64 bits or 8 bytes). The encoding
-- used is the IEEE standard for normalized double-precision floating-point
-- numbers.
SF_L : constant := 4; -- Single precision
F_L : constant := 4; -- Single precision
LF_L : constant := 8; -- Double precision
LLF_L : constant := 16; -- Quadruple precision
TM_L : constant := 8;
subtype XDR_S_TM is SEA (1 .. TM_L);
type XDR_TM is mod BB ** TM_L;
type XDR_SA is mod 2 ** Standard'Address_Size;
function To_XDR_SA is new Ada.Unchecked_Conversion (System.Address, XDR_SA);
function To_XDR_SA is new Ada.Unchecked_Conversion (XDR_SA, System.Address);
-- Enumerations have the same representation as signed integers.
-- Enumerations are handy for describing subsets of the integers.
-- Booleans are important enough and occur frequently enough to warrant
-- their own explicit type in the standard. Booleans are declared as
-- an enumeration, with FALSE = 0 and TRUE = 1.
-- The standard defines a string of n (numbered 0 through n-1) ASCII
-- bytes to be the number n encoded as an unsigned integer (as described
-- above), and followed by the n bytes of the string. Byte m of the string
-- always precedes byte m+1 of the string, and byte 0 of the string always
-- follows the string's length. If n is not a multiple of four, then the
-- n bytes are followed by enough (0 to 3) residual zero bytes, r, to make
-- the total byte count a multiple of four.
-- To fit with XDR string, do not consider character as an enumeration
-- type.
C_L : constant := 1;
subtype XDR_S_C is SEA (1 .. C_L);
-- Consider Wide_Character as an enumeration type
WC_L : constant := 4;
subtype XDR_S_WC is SEA (1 .. WC_L);
type XDR_WC is mod BB ** WC_L;
-- Consider Wide_Wide_Character as an enumeration type
WWC_L : constant := 8;
subtype XDR_S_WWC is SEA (1 .. WWC_L);
type XDR_WWC is mod BB ** WWC_L;
-- Optimization: if we already have the correct Bit_Order, then some
-- computations can be avoided since the source and the target will be
-- identical anyway. They will be replaced by direct unchecked
-- conversions.
Optimize_Integers : constant Boolean :=
Default_Bit_Order = High_Order_First;
----------
-- I_AD --
----------
function I_AD (Stream : not null access RST) return Fat_Pointer is
FP : Fat_Pointer;
begin
FP.P1 := I_AS (Stream).P1;
FP.P2 := I_AS (Stream).P1;
return FP;
end I_AD;
----------
-- I_AS --
----------
function I_AS (Stream : not null access RST) return Thin_Pointer is
S : XDR_S_TM;
L : SEO;
U : XDR_TM := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
else
for N in S'Range loop
U := U * BB + XDR_TM (S (N));
end loop;
return (P1 => To_XDR_SA (XDR_SA (U)));
end if;
end I_AS;
---------
-- I_B --
---------
function I_B (Stream : not null access RST) return Boolean is
begin
case I_SSU (Stream) is
when 0 => return False;
when 1 => return True;
when others => raise Data_Error;
end case;
end I_B;
---------
-- I_C --
---------
function I_C (Stream : not null access RST) return Character is
S : XDR_S_C;
L : SEO;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
else
-- Use Ada requirements on Character representation clause
return Character'Val (S (1));
end if;
end I_C;
---------
-- I_F --
---------
function I_F (Stream : not null access RST) return Float is
I : constant Precision := Single;
E_Size : Integer renames Fields (I).E_Size;
E_Bias : Integer renames Fields (I).E_Bias;
E_Last : Integer renames Fields (I).E_Last;
F_Mask : SE renames Fields (I).F_Mask;
E_Bytes : SEO renames Fields (I).E_Bytes;
F_Bytes : SEO renames Fields (I).F_Bytes;
F_Size : Integer renames Fields (I).F_Size;
Is_Positive : Boolean;
Exponent : Long_Unsigned;
Fraction : Long_Unsigned;
Result : Float;
S : SEA (1 .. F_L);
L : SEO;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
end if;
-- Extract Fraction, Sign and Exponent
Fraction := Long_Unsigned (S (F_L + 1 - F_Bytes) and F_Mask);
for N in F_L + 2 - F_Bytes .. F_L loop
Fraction := Fraction * BB + Long_Unsigned (S (N));
end loop;
Result := Float'Scaling (Float (Fraction), -F_Size);
if BS <= S (1) then
Is_Positive := False;
Exponent := Long_Unsigned (S (1) - BS);
else
Is_Positive := True;
Exponent := Long_Unsigned (S (1));
end if;
for N in 2 .. E_Bytes loop
Exponent := Exponent * BB + Long_Unsigned (S (N));
end loop;
Exponent := Shift_Right (Exponent, Integer (E_Bytes) * SU - E_Size - 1);
-- NaN or Infinities
if Integer (Exponent) = E_Last then
raise Constraint_Error;
elsif Exponent = 0 then
-- Signed zeros
if Fraction = 0 then
null;
-- Denormalized float
else
Result := Float'Scaling (Result, 1 - E_Bias);
end if;
-- Normalized float
else
Result := Float'Scaling
(1.0 + Result, Integer (Exponent) - E_Bias);
end if;
if not Is_Positive then
Result := -Result;
end if;
return Result;
end I_F;
---------
-- I_I --
---------
function I_I (Stream : not null access RST) return Integer is
S : XDR_S_I;
L : SEO;
U : XDR_U := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return XDR_S_I_To_Integer (S);
else
for N in S'Range loop
U := U * BB + XDR_U (S (N));
end loop;
-- Test sign and apply two complement notation
if S (1) < BL then
return Integer (U);
else
return Integer (-((XDR_U'Last xor U) + 1));
end if;
end if;
end I_I;
-----------
-- I_I24 --
-----------
function I_I24 (Stream : not null access RST) return Integer_24 is
S : XDR_S_I24;
L : SEO;
U : XDR_U24 := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return XDR_S_I24_To_Integer (S);
else
for N in S'Range loop
U := U * BB + XDR_U24 (S (N));
end loop;
-- Test sign and apply two complement notation
if S (1) < BL then
return Integer_24 (U);
else
return Integer_24 (-((XDR_U24'Last xor U) + 1));
end if;
end if;
end I_I24;
----------
-- I_LF --
----------
function I_LF (Stream : not null access RST) return Long_Float is
I : constant Precision := Double;
E_Size : Integer renames Fields (I).E_Size;
E_Bias : Integer renames Fields (I).E_Bias;
E_Last : Integer renames Fields (I).E_Last;
F_Mask : SE renames Fields (I).F_Mask;
E_Bytes : SEO renames Fields (I).E_Bytes;
F_Bytes : SEO renames Fields (I).F_Bytes;
F_Size : Integer renames Fields (I).F_Size;
Is_Positive : Boolean;
Exponent : Long_Unsigned;
Fraction : Long_Long_Unsigned;
Result : Long_Float;
S : SEA (1 .. LF_L);
L : SEO;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
end if;
-- Extract Fraction, Sign and Exponent
Fraction := Long_Long_Unsigned (S (LF_L + 1 - F_Bytes) and F_Mask);
for N in LF_L + 2 - F_Bytes .. LF_L loop
Fraction := Fraction * BB + Long_Long_Unsigned (S (N));
end loop;
Result := Long_Float'Scaling (Long_Float (Fraction), -F_Size);
if BS <= S (1) then
Is_Positive := False;
Exponent := Long_Unsigned (S (1) - BS);
else
Is_Positive := True;
Exponent := Long_Unsigned (S (1));
end if;
for N in 2 .. E_Bytes loop
Exponent := Exponent * BB + Long_Unsigned (S (N));
end loop;
Exponent := Shift_Right (Exponent, Integer (E_Bytes) * SU - E_Size - 1);
-- NaN or Infinities
if Integer (Exponent) = E_Last then
raise Constraint_Error;
elsif Exponent = 0 then
-- Signed zeros
if Fraction = 0 then
null;
-- Denormalized float
else
Result := Long_Float'Scaling (Result, 1 - E_Bias);
end if;
-- Normalized float
else
Result := Long_Float'Scaling
(1.0 + Result, Integer (Exponent) - E_Bias);
end if;
if not Is_Positive then
Result := -Result;
end if;
return Result;
end I_LF;
----------
-- I_LI --
----------
function I_LI (Stream : not null access RST) return Long_Integer is
S : XDR_S_LI;
L : SEO;
U : Unsigned := 0;
X : Long_Unsigned := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return Long_Integer (XDR_S_LI_To_Long_Long_Integer (S));
else
-- Compute using machine unsigned
-- rather than long_long_unsigned
for N in S'Range loop
U := U * BB + Unsigned (S (N));
-- We have filled an unsigned
if N mod UB = 0 then
X := Shift_Left (X, US) + Long_Unsigned (U);
U := 0;
end if;
end loop;
-- Test sign and apply two complement notation
if S (1) < BL then
return Long_Integer (X);
else
return Long_Integer (-((Long_Unsigned'Last xor X) + 1));
end if;
end if;
end I_LI;
-----------
-- I_LLF --
-----------
function I_LLF (Stream : not null access RST) return Long_Long_Float is
I : constant Precision := Quadruple;
E_Size : Integer renames Fields (I).E_Size;
E_Bias : Integer renames Fields (I).E_Bias;
E_Last : Integer renames Fields (I).E_Last;
E_Bytes : SEO renames Fields (I).E_Bytes;
F_Bytes : SEO renames Fields (I).F_Bytes;
F_Size : Integer renames Fields (I).F_Size;
Is_Positive : Boolean;
Exponent : Long_Unsigned;
Fraction_1 : Long_Long_Unsigned := 0;
Fraction_2 : Long_Long_Unsigned := 0;
Result : Long_Long_Float;
HF : constant Natural := F_Size / 2;
S : SEA (1 .. LLF_L);
L : SEO;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
end if;
-- Extract Fraction, Sign and Exponent
for I in LLF_L - F_Bytes + 1 .. LLF_L - 7 loop
Fraction_1 := Fraction_1 * BB + Long_Long_Unsigned (S (I));
end loop;
for I in SEO (LLF_L - 6) .. SEO (LLF_L) loop
Fraction_2 := Fraction_2 * BB + Long_Long_Unsigned (S (I));
end loop;
Result := Long_Long_Float'Scaling (Long_Long_Float (Fraction_2), -HF);
Result := Long_Long_Float (Fraction_1) + Result;
Result := Long_Long_Float'Scaling (Result, HF - F_Size);
if BS <= S (1) then
Is_Positive := False;
Exponent := Long_Unsigned (S (1) - BS);
else
Is_Positive := True;
Exponent := Long_Unsigned (S (1));
end if;
for N in 2 .. E_Bytes loop
Exponent := Exponent * BB + Long_Unsigned (S (N));
end loop;
Exponent := Shift_Right (Exponent, Integer (E_Bytes) * SU - E_Size - 1);
-- NaN or Infinities
if Integer (Exponent) = E_Last then
raise Constraint_Error;
elsif Exponent = 0 then
-- Signed zeros
if Fraction_1 = 0 and then Fraction_2 = 0 then
null;
-- Denormalized float
else
Result := Long_Long_Float'Scaling (Result, 1 - E_Bias);
end if;
-- Normalized float
else
Result := Long_Long_Float'Scaling
(1.0 + Result, Integer (Exponent) - E_Bias);
end if;
if not Is_Positive then
Result := -Result;
end if;
return Result;
end I_LLF;
-----------
-- I_LLI --
-----------
function I_LLI (Stream : not null access RST) return Long_Long_Integer is
S : XDR_S_LLI;
L : SEO;
U : Unsigned := 0;
X : Long_Long_Unsigned := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return XDR_S_LLI_To_Long_Long_Integer (S);
else
-- Compute using machine unsigned for computing
-- rather than long_long_unsigned.
for N in S'Range loop
U := U * BB + Unsigned (S (N));
-- We have filled an unsigned
if N mod UB = 0 then
X := Shift_Left (X, US) + Long_Long_Unsigned (U);
U := 0;
end if;
end loop;
-- Test sign and apply two complement notation
if S (1) < BL then
return Long_Long_Integer (X);
else
return Long_Long_Integer (-((Long_Long_Unsigned'Last xor X) + 1));
end if;
end if;
end I_LLI;
-----------
-- I_LLU --
-----------
function I_LLU (Stream : not null access RST) return Long_Long_Unsigned is
S : XDR_S_LLU;
L : SEO;
U : Unsigned := 0;
X : Long_Long_Unsigned := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return XDR_S_LLU_To_Long_Long_Unsigned (S);
else
-- Compute using machine unsigned
-- rather than long_long_unsigned.
for N in S'Range loop
U := U * BB + Unsigned (S (N));
-- We have filled an unsigned
if N mod UB = 0 then
X := Shift_Left (X, US) + Long_Long_Unsigned (U);
U := 0;
end if;
end loop;
return X;
end if;
end I_LLU;
----------
-- I_LU --
----------
function I_LU (Stream : not null access RST) return Long_Unsigned is
S : XDR_S_LU;
L : SEO;
U : Unsigned := 0;
X : Long_Unsigned := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return Long_Unsigned (XDR_S_LU_To_Long_Long_Unsigned (S));
else
-- Compute using machine unsigned
-- rather than long_unsigned.
for N in S'Range loop
U := U * BB + Unsigned (S (N));
-- We have filled an unsigned
if N mod UB = 0 then
X := Shift_Left (X, US) + Long_Unsigned (U);
U := 0;
end if;
end loop;
return X;
end if;
end I_LU;
----------
-- I_SF --
----------
function I_SF (Stream : not null access RST) return Short_Float is
I : constant Precision := Single;
E_Size : Integer renames Fields (I).E_Size;
E_Bias : Integer renames Fields (I).E_Bias;
E_Last : Integer renames Fields (I).E_Last;
F_Mask : SE renames Fields (I).F_Mask;
E_Bytes : SEO renames Fields (I).E_Bytes;
F_Bytes : SEO renames Fields (I).F_Bytes;
F_Size : Integer renames Fields (I).F_Size;
Exponent : Long_Unsigned;
Fraction : Long_Unsigned;
Is_Positive : Boolean;
Result : Short_Float;
S : SEA (1 .. SF_L);
L : SEO;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
end if;
-- Extract Fraction, Sign and Exponent
Fraction := Long_Unsigned (S (SF_L + 1 - F_Bytes) and F_Mask);
for N in SF_L + 2 - F_Bytes .. SF_L loop
Fraction := Fraction * BB + Long_Unsigned (S (N));
end loop;
Result := Short_Float'Scaling (Short_Float (Fraction), -F_Size);
if BS <= S (1) then
Is_Positive := False;
Exponent := Long_Unsigned (S (1) - BS);
else
Is_Positive := True;
Exponent := Long_Unsigned (S (1));
end if;
for N in 2 .. E_Bytes loop
Exponent := Exponent * BB + Long_Unsigned (S (N));
end loop;
Exponent := Shift_Right (Exponent, Integer (E_Bytes) * SU - E_Size - 1);
-- NaN or Infinities
if Integer (Exponent) = E_Last then
raise Constraint_Error;
elsif Exponent = 0 then
-- Signed zeros
if Fraction = 0 then
null;
-- Denormalized float
else
Result := Short_Float'Scaling (Result, 1 - E_Bias);
end if;
-- Normalized float
else
Result := Short_Float'Scaling
(1.0 + Result, Integer (Exponent) - E_Bias);
end if;
if not Is_Positive then
Result := -Result;
end if;
return Result;
end I_SF;
----------
-- I_SI --
----------
function I_SI (Stream : not null access RST) return Short_Integer is
S : XDR_S_SI;
L : SEO;
U : XDR_SU := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return XDR_S_SI_To_Short_Integer (S);
else
for N in S'Range loop
U := U * BB + XDR_SU (S (N));
end loop;
-- Test sign and apply two complement notation
if S (1) < BL then
return Short_Integer (U);
else
return Short_Integer (-((XDR_SU'Last xor U) + 1));
end if;
end if;
end I_SI;
-----------
-- I_SSI --
-----------
function I_SSI (Stream : not null access RST) return Short_Short_Integer is
S : XDR_S_SSI;
L : SEO;
U : XDR_SSU;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return XDR_S_SSI_To_Short_Short_Integer (S);
else
U := XDR_SSU (S (1));
-- Test sign and apply two complement notation
if S (1) < BL then
return Short_Short_Integer (U);
else
return Short_Short_Integer (-((XDR_SSU'Last xor U) + 1));
end if;
end if;
end I_SSI;
-----------
-- I_SSU --
-----------
function I_SSU (Stream : not null access RST) return Short_Short_Unsigned is
S : XDR_S_SSU;
L : SEO;
U : XDR_SSU := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
else
U := XDR_SSU (S (1));
return Short_Short_Unsigned (U);
end if;
end I_SSU;
----------
-- I_SU --
----------
function I_SU (Stream : not null access RST) return Short_Unsigned is
S : XDR_S_SU;
L : SEO;
U : XDR_SU := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return XDR_S_SU_To_Short_Unsigned (S);
else
for N in S'Range loop
U := U * BB + XDR_SU (S (N));
end loop;
return Short_Unsigned (U);
end if;
end I_SU;
---------
-- I_U --
---------
function I_U (Stream : not null access RST) return Unsigned is
S : XDR_S_U;
L : SEO;
U : XDR_U := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return XDR_S_U_To_Unsigned (S);
else
for N in S'Range loop
U := U * BB + XDR_U (S (N));
end loop;
return Unsigned (U);
end if;
end I_U;
-----------
-- I_U24 --
-----------
function I_U24 (Stream : not null access RST) return Unsigned_24 is
S : XDR_S_U24;
L : SEO;
U : XDR_U24 := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
elsif Optimize_Integers then
return XDR_S_U24_To_Unsigned (S);
else
for N in S'Range loop
U := U * BB + XDR_U24 (S (N));
end loop;
return Unsigned_24 (U);
end if;
end I_U24;
----------
-- I_WC --
----------
function I_WC (Stream : not null access RST) return Wide_Character is
S : XDR_S_WC;
L : SEO;
U : XDR_WC := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
else
for N in S'Range loop
U := U * BB + XDR_WC (S (N));
end loop;
-- Use Ada requirements on Wide_Character representation clause
return Wide_Character'Val (U);
end if;
end I_WC;
-----------
-- I_WWC --
-----------
function I_WWC (Stream : not null access RST) return Wide_Wide_Character is
S : XDR_S_WWC;
L : SEO;
U : XDR_WWC := 0;
begin
Ada.Streams.Read (Stream.all, S, L);
if L /= S'Last then
raise Data_Error;
else
for N in S'Range loop
U := U * BB + XDR_WWC (S (N));
end loop;
-- Use Ada requirements on Wide_Wide_Character representation clause
return Wide_Wide_Character'Val (U);
end if;
end I_WWC;
----------
-- W_AD --
----------
procedure W_AD (Stream : not null access RST; Item : Fat_Pointer) is
S : XDR_S_TM;
U : XDR_TM;
begin
U := XDR_TM (To_XDR_SA (Item.P1));
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
Ada.Streams.Write (Stream.all, S);
U := XDR_TM (To_XDR_SA (Item.P2));
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
Ada.Streams.Write (Stream.all, S);
if U /= 0 then
raise Data_Error;
end if;
end W_AD;
----------
-- W_AS --
----------
procedure W_AS (Stream : not null access RST; Item : Thin_Pointer) is
S : XDR_S_TM;
U : XDR_TM := XDR_TM (To_XDR_SA (Item.P1));
begin
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
Ada.Streams.Write (Stream.all, S);
if U /= 0 then
raise Data_Error;
end if;
end W_AS;
---------
-- W_B --
---------
procedure W_B (Stream : not null access RST; Item : Boolean) is
begin
if Item then
W_SSU (Stream, 1);
else
W_SSU (Stream, 0);
end if;
end W_B;
---------
-- W_C --
---------
procedure W_C (Stream : not null access RST; Item : Character) is
S : XDR_S_C;
pragma Assert (C_L = 1);
begin
-- Use Ada requirements on Character representation clause
S (1) := SE (Character'Pos (Item));
Ada.Streams.Write (Stream.all, S);
end W_C;
---------
-- W_F --
---------
procedure W_F (Stream : not null access RST; Item : Float) is
I : constant Precision := Single;
E_Size : Integer renames Fields (I).E_Size;
E_Bias : Integer renames Fields (I).E_Bias;
E_Bytes : SEO renames Fields (I).E_Bytes;
F_Bytes : SEO renames Fields (I).F_Bytes;
F_Size : Integer renames Fields (I).F_Size;
F_Mask : SE renames Fields (I).F_Mask;
Exponent : Long_Unsigned;
Fraction : Long_Unsigned;
Is_Positive : Boolean;
E : Integer;
F : Float;
S : SEA (1 .. F_L) := (others => 0);
begin
if not Item'Valid then
raise Constraint_Error;
end if;
-- Compute Sign
Is_Positive := (0.0 <= Item);
F := abs (Item);
-- Signed zero
if F = 0.0 then
Exponent := 0;
Fraction := 0;
else
E := Float'Exponent (F) - 1;
-- Denormalized float
if E <= -E_Bias then
F := Float'Scaling (F, F_Size + E_Bias - 1);
E := -E_Bias;
else
F := Float'Scaling (Float'Fraction (F), F_Size + 1);
end if;
-- Compute Exponent and Fraction
Exponent := Long_Unsigned (E + E_Bias);
Fraction := Long_Unsigned (F * 2.0) / 2;
end if;
-- Store Fraction
for I in reverse F_L - F_Bytes + 1 .. F_L loop
S (I) := SE (Fraction mod BB);
Fraction := Fraction / BB;
end loop;
-- Remove implicit bit
S (F_L - F_Bytes + 1) := S (F_L - F_Bytes + 1) and F_Mask;
-- Store Exponent (not always at the beginning of a byte)
Exponent := Shift_Left (Exponent, Integer (E_Bytes) * SU - E_Size - 1);
for N in reverse 1 .. E_Bytes loop
S (N) := SE (Exponent mod BB) + S (N);
Exponent := Exponent / BB;
end loop;
-- Store Sign
if not Is_Positive then
S (1) := S (1) + BS;
end if;
Ada.Streams.Write (Stream.all, S);
end W_F;
---------
-- W_I --
---------
procedure W_I (Stream : not null access RST; Item : Integer) is
S : XDR_S_I;
U : XDR_U;
begin
if Optimize_Integers then
S := Integer_To_XDR_S_I (Item);
else
-- Test sign and apply two complement notation
U := (if Item < 0
then XDR_U'Last xor XDR_U (-(Item + 1))
else XDR_U (Item));
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
if U /= 0 then
raise Data_Error;
end if;
end if;
Ada.Streams.Write (Stream.all, S);
end W_I;
-----------
-- W_I24 --
-----------
procedure W_I24 (Stream : not null access RST; Item : Integer_24) is
S : XDR_S_I24;
U : XDR_U24;
begin
if Optimize_Integers then
S := Integer_To_XDR_S_I24 (Item);
else
-- Test sign and apply two complement notation
U := (if Item < 0
then XDR_U24'Last xor XDR_U24 (-(Item + 1))
else XDR_U24 (Item));
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
if U /= 0 then
raise Data_Error;
end if;
end if;
Ada.Streams.Write (Stream.all, S);
end W_I24;
----------
-- W_LF --
----------
procedure W_LF (Stream : not null access RST; Item : Long_Float) is
I : constant Precision := Double;
E_Size : Integer renames Fields (I).E_Size;
E_Bias : Integer renames Fields (I).E_Bias;
E_Bytes : SEO renames Fields (I).E_Bytes;
F_Bytes : SEO renames Fields (I).F_Bytes;
F_Size : Integer renames Fields (I).F_Size;
F_Mask : SE renames Fields (I).F_Mask;
Exponent : Long_Unsigned;
Fraction : Long_Long_Unsigned;
Is_Positive : Boolean;
E : Integer;
F : Long_Float;
S : SEA (1 .. LF_L) := (others => 0);
begin
if not Item'Valid then
raise Constraint_Error;
end if;
-- Compute Sign
Is_Positive := (0.0 <= Item);
F := abs (Item);
-- Signed zero
if F = 0.0 then
Exponent := 0;
Fraction := 0;
else
E := Long_Float'Exponent (F) - 1;
-- Denormalized float
if E <= -E_Bias then
E := -E_Bias;
F := Long_Float'Scaling (F, F_Size + E_Bias - 1);
else
F := Long_Float'Scaling (F, F_Size - E);
end if;
-- Compute Exponent and Fraction
Exponent := Long_Unsigned (E + E_Bias);
Fraction := Long_Long_Unsigned (F * 2.0) / 2;
end if;
-- Store Fraction
for I in reverse LF_L - F_Bytes + 1 .. LF_L loop
S (I) := SE (Fraction mod BB);
Fraction := Fraction / BB;
end loop;
-- Remove implicit bit
S (LF_L - F_Bytes + 1) := S (LF_L - F_Bytes + 1) and F_Mask;
-- Store Exponent (not always at the beginning of a byte)
Exponent := Shift_Left (Exponent, Integer (E_Bytes) * SU - E_Size - 1);
for N in reverse 1 .. E_Bytes loop
S (N) := SE (Exponent mod BB) + S (N);
Exponent := Exponent / BB;
end loop;
-- Store Sign
if not Is_Positive then
S (1) := S (1) + BS;
end if;
Ada.Streams.Write (Stream.all, S);
end W_LF;
----------
-- W_LI --
----------
procedure W_LI (Stream : not null access RST; Item : Long_Integer) is
S : XDR_S_LI;
U : Unsigned := 0;
X : Long_Unsigned;
begin
if Optimize_Integers then
S := Long_Long_Integer_To_XDR_S_LI (Long_Long_Integer (Item));
else
-- Test sign and apply two complement notation
if Item < 0 then
X := Long_Unsigned'Last xor Long_Unsigned (-(Item + 1));
else
X := Long_Unsigned (Item);
end if;
-- Compute using machine unsigned rather than long_unsigned
for N in reverse S'Range loop
-- We have filled an unsigned
if (LU_L - N) mod UB = 0 then
U := Unsigned (X and UL);
X := Shift_Right (X, US);
end if;
S (N) := SE (U mod BB);
U := U / BB;
end loop;
if U /= 0 then
raise Data_Error;
end if;
end if;
Ada.Streams.Write (Stream.all, S);
end W_LI;
-----------
-- W_LLF --
-----------
procedure W_LLF (Stream : not null access RST; Item : Long_Long_Float) is
I : constant Precision := Quadruple;
E_Size : Integer renames Fields (I).E_Size;
E_Bias : Integer renames Fields (I).E_Bias;
E_Bytes : SEO renames Fields (I).E_Bytes;
F_Bytes : SEO renames Fields (I).F_Bytes;
F_Size : Integer renames Fields (I).F_Size;
HFS : constant Integer := F_Size / 2;
Exponent : Long_Unsigned;
Fraction_1 : Long_Long_Unsigned;
Fraction_2 : Long_Long_Unsigned;
Is_Positive : Boolean;
E : Integer;
F : Long_Long_Float := Item;
S : SEA (1 .. LLF_L) := (others => 0);
begin
if not Item'Valid then
raise Constraint_Error;
end if;
-- Compute Sign
Is_Positive := (0.0 <= Item);
if F < 0.0 then
F := -Item;
end if;
-- Signed zero
if F = 0.0 then
Exponent := 0;
Fraction_1 := 0;
Fraction_2 := 0;
else
E := Long_Long_Float'Exponent (F) - 1;
-- Denormalized float
if E <= -E_Bias then
F := Long_Long_Float'Scaling (F, E_Bias - 1);
E := -E_Bias;
else
F := Long_Long_Float'Scaling
(Long_Long_Float'Fraction (F), 1);
end if;
-- Compute Exponent and Fraction
Exponent := Long_Unsigned (E + E_Bias);
F := Long_Long_Float'Scaling (F, F_Size - HFS);
Fraction_1 := Long_Long_Unsigned (Long_Long_Float'Floor (F));
F := F - Long_Long_Float (Fraction_1);
F := Long_Long_Float'Scaling (F, HFS);
Fraction_2 := Long_Long_Unsigned (Long_Long_Float'Floor (F));
end if;
-- Store Fraction_1
for I in reverse LLF_L - F_Bytes + 1 .. LLF_L - 7 loop
S (I) := SE (Fraction_1 mod BB);
Fraction_1 := Fraction_1 / BB;
end loop;
-- Store Fraction_2
for I in reverse LLF_L - 6 .. LLF_L loop
S (SEO (I)) := SE (Fraction_2 mod BB);
Fraction_2 := Fraction_2 / BB;
end loop;
-- Store Exponent (not always at the beginning of a byte)
Exponent := Shift_Left (Exponent, Integer (E_Bytes) * SU - E_Size - 1);
for N in reverse 1 .. E_Bytes loop
S (N) := SE (Exponent mod BB) + S (N);
Exponent := Exponent / BB;
end loop;
-- Store Sign
if not Is_Positive then
S (1) := S (1) + BS;
end if;
Ada.Streams.Write (Stream.all, S);
end W_LLF;
-----------
-- W_LLI --
-----------
procedure W_LLI
(Stream : not null access RST;
Item : Long_Long_Integer)
is
S : XDR_S_LLI;
U : Unsigned := 0;
X : Long_Long_Unsigned;
begin
if Optimize_Integers then
S := Long_Long_Integer_To_XDR_S_LLI (Item);
else
-- Test sign and apply two complement notation
if Item < 0 then
X := Long_Long_Unsigned'Last xor Long_Long_Unsigned (-(Item + 1));
else
X := Long_Long_Unsigned (Item);
end if;
-- Compute using machine unsigned rather than long_long_unsigned
for N in reverse S'Range loop
-- We have filled an unsigned
if (LLU_L - N) mod UB = 0 then
U := Unsigned (X and UL);
X := Shift_Right (X, US);
end if;
S (N) := SE (U mod BB);
U := U / BB;
end loop;
if U /= 0 then
raise Data_Error;
end if;
end if;
Ada.Streams.Write (Stream.all, S);
end W_LLI;
-----------
-- W_LLU --
-----------
procedure W_LLU
(Stream : not null access RST;
Item : Long_Long_Unsigned)
is
S : XDR_S_LLU;
U : Unsigned := 0;
X : Long_Long_Unsigned := Item;
begin
if Optimize_Integers then
S := Long_Long_Unsigned_To_XDR_S_LLU (Item);
else
-- Compute using machine unsigned rather than long_long_unsigned
for N in reverse S'Range loop
-- We have filled an unsigned
if (LLU_L - N) mod UB = 0 then
U := Unsigned (X and UL);
X := Shift_Right (X, US);
end if;
S (N) := SE (U mod BB);
U := U / BB;
end loop;
if U /= 0 then
raise Data_Error;
end if;
end if;
Ada.Streams.Write (Stream.all, S);
end W_LLU;
----------
-- W_LU --
----------
procedure W_LU (Stream : not null access RST; Item : Long_Unsigned) is
S : XDR_S_LU;
U : Unsigned := 0;
X : Long_Unsigned := Item;
begin
if Optimize_Integers then
S := Long_Long_Unsigned_To_XDR_S_LU (Long_Long_Unsigned (Item));
else
-- Compute using machine unsigned rather than long_unsigned
for N in reverse S'Range loop
-- We have filled an unsigned
if (LU_L - N) mod UB = 0 then
U := Unsigned (X and UL);
X := Shift_Right (X, US);
end if;
S (N) := SE (U mod BB);
U := U / BB;
end loop;
if U /= 0 then
raise Data_Error;
end if;
end if;
Ada.Streams.Write (Stream.all, S);
end W_LU;
----------
-- W_SF --
----------
procedure W_SF (Stream : not null access RST; Item : Short_Float) is
I : constant Precision := Single;
E_Size : Integer renames Fields (I).E_Size;
E_Bias : Integer renames Fields (I).E_Bias;
E_Bytes : SEO renames Fields (I).E_Bytes;
F_Bytes : SEO renames Fields (I).F_Bytes;
F_Size : Integer renames Fields (I).F_Size;
F_Mask : SE renames Fields (I).F_Mask;
Exponent : Long_Unsigned;
Fraction : Long_Unsigned;
Is_Positive : Boolean;
E : Integer;
F : Short_Float;
S : SEA (1 .. SF_L) := (others => 0);
begin
if not Item'Valid then
raise Constraint_Error;
end if;
-- Compute Sign
Is_Positive := (0.0 <= Item);
F := abs (Item);
-- Signed zero
if F = 0.0 then
Exponent := 0;
Fraction := 0;
else
E := Short_Float'Exponent (F) - 1;
-- Denormalized float
if E <= -E_Bias then
E := -E_Bias;
F := Short_Float'Scaling (F, F_Size + E_Bias - 1);
else
F := Short_Float'Scaling (F, F_Size - E);
end if;
-- Compute Exponent and Fraction
Exponent := Long_Unsigned (E + E_Bias);
Fraction := Long_Unsigned (F * 2.0) / 2;
end if;
-- Store Fraction
for I in reverse SF_L - F_Bytes + 1 .. SF_L loop
S (I) := SE (Fraction mod BB);
Fraction := Fraction / BB;
end loop;
-- Remove implicit bit
S (SF_L - F_Bytes + 1) := S (SF_L - F_Bytes + 1) and F_Mask;
-- Store Exponent (not always at the beginning of a byte)
Exponent := Shift_Left (Exponent, Integer (E_Bytes) * SU - E_Size - 1);
for N in reverse 1 .. E_Bytes loop
S (N) := SE (Exponent mod BB) + S (N);
Exponent := Exponent / BB;
end loop;
-- Store Sign
if not Is_Positive then
S (1) := S (1) + BS;
end if;
Ada.Streams.Write (Stream.all, S);
end W_SF;
----------
-- W_SI --
----------
procedure W_SI (Stream : not null access RST; Item : Short_Integer) is
S : XDR_S_SI;
U : XDR_SU;
begin
if Optimize_Integers then
S := Short_Integer_To_XDR_S_SI (Item);
else
-- Test sign and apply two complement's notation
U := (if Item < 0
then XDR_SU'Last xor XDR_SU (-(Item + 1))
else XDR_SU (Item));
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
if U /= 0 then
raise Data_Error;
end if;
end if;
Ada.Streams.Write (Stream.all, S);
end W_SI;
-----------
-- W_SSI --
-----------
procedure W_SSI
(Stream : not null access RST;
Item : Short_Short_Integer)
is
S : XDR_S_SSI;
U : XDR_SSU;
begin
if Optimize_Integers then
S := Short_Short_Integer_To_XDR_S_SSI (Item);
else
-- Test sign and apply two complement's notation
U := (if Item < 0
then XDR_SSU'Last xor XDR_SSU (-(Item + 1))
else XDR_SSU (Item));
S (1) := SE (U);
end if;
Ada.Streams.Write (Stream.all, S);
end W_SSI;
-----------
-- W_SSU --
-----------
procedure W_SSU
(Stream : not null access RST;
Item : Short_Short_Unsigned)
is
U : constant XDR_SSU := XDR_SSU (Item);
S : XDR_S_SSU;
begin
S (1) := SE (U);
Ada.Streams.Write (Stream.all, S);
end W_SSU;
----------
-- W_SU --
----------
procedure W_SU (Stream : not null access RST; Item : Short_Unsigned) is
S : XDR_S_SU;
U : XDR_SU := XDR_SU (Item);
begin
if Optimize_Integers then
S := Short_Unsigned_To_XDR_S_SU (Item);
else
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
if U /= 0 then
raise Data_Error;
end if;
end if;
Ada.Streams.Write (Stream.all, S);
end W_SU;
---------
-- W_U --
---------
procedure W_U (Stream : not null access RST; Item : Unsigned) is
S : XDR_S_U;
U : XDR_U := XDR_U (Item);
begin
if Optimize_Integers then
S := Unsigned_To_XDR_S_U (Item);
else
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
if U /= 0 then
raise Data_Error;
end if;
end if;
Ada.Streams.Write (Stream.all, S);
end W_U;
-----------
-- W_U24 --
-----------
procedure W_U24 (Stream : not null access RST; Item : Unsigned_24) is
S : XDR_S_U24;
U : XDR_U24 := XDR_U24 (Item);
begin
if Optimize_Integers then
S := Unsigned_To_XDR_S_U24 (Item);
else
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
if U /= 0 then
raise Data_Error;
end if;
end if;
Ada.Streams.Write (Stream.all, S);
end W_U24;
----------
-- W_WC --
----------
procedure W_WC (Stream : not null access RST; Item : Wide_Character) is
S : XDR_S_WC;
U : XDR_WC;
begin
-- Use Ada requirements on Wide_Character representation clause
U := XDR_WC (Wide_Character'Pos (Item));
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
Ada.Streams.Write (Stream.all, S);
if U /= 0 then
raise Data_Error;
end if;
end W_WC;
-----------
-- W_WWC --
-----------
procedure W_WWC
(Stream : not null access RST; Item : Wide_Wide_Character)
is
S : XDR_S_WWC;
U : XDR_WWC;
begin
-- Use Ada requirements on Wide_Wide_Character representation clause
U := XDR_WWC (Wide_Wide_Character'Pos (Item));
for N in reverse S'Range loop
S (N) := SE (U mod BB);
U := U / BB;
end loop;
Ada.Streams.Write (Stream.all, S);
if U /= 0 then
raise Data_Error;
end if;
end W_WWC;
end System.Stream_Attributes.XDR;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- A D A . R E A L _ T I M E . D E L A Y S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2001-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/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
with System.Task_Primitives.Operations;
-- Used for Timed_Delay
-- Self
package body Ada.Real_Time.Delays is
package STPO renames System.Task_Primitives.Operations;
-----------------
-- Delay_Until --
-----------------
procedure Delay_Until (T : Time) is
begin
-- pragma Detect_Blocking is mandatory in this run time, so that
-- Program_Error must be raised if this delay (potentially blocking
-- operation) is called from a protected operation.
if STPO.Self.Common.Protected_Action_Nesting > 0 then
raise Program_Error;
else
STPO.Delay_Until (STPO.Time (T));
end if;
end Delay_Until;
-----------------
-- To_Duration --
-----------------
-- This function is not supposed to be used by the Ravenscar run time and
-- it is not supposed to be with'ed by the user either (because it is an
-- internal GNAT unit). It is kept here (returning a junk value) just for
-- sharing the same package specification with the regular run time.
function To_Duration (T : Time) return Duration is
pragma Unreferenced (T);
begin
return 0.0;
end To_Duration;
end Ada.Real_Time.Delays;
|
package body System.Formatting.Literals.Float is
pragma Suppress (All_Checks);
function copysignl (X, Y : Long_Long_Float) return Long_Long_Float
with Import,
Convention => Intrinsic, External_Name => "__builtin_copysignl";
procedure Get_Aft (
Item : String;
Last : in out Natural;
Result : out Long_Long_Float;
Base : Number_Base);
procedure Get_Aft (
Item : String;
Last : in out Natural;
Result : out Long_Long_Float;
Base : Number_Base)
is
Scale : Long_Long_Float := 1.0;
Old_Last : constant Natural := Last + 1; -- skip '.'
begin
Result := 0.0;
if Old_Last <= Item'Last and then Item (Old_Last) = '.' then
Last := Old_Last;
while Last < Item'Last loop
declare
X : Digit;
Is_Invalid : Boolean;
begin
if Item (Last + 1) = '_' then
exit when Last = Old_Last or else Last + 1 >= Item'Last;
Last := Last + 1;
end if;
Value (Item (Last + 1), X, Is_Invalid);
exit when Is_Invalid or else X >= Base;
if Scale <= Long_Long_Float'Last / Long_Long_Float (Base) then
Result :=
Result * Long_Long_Float (Base) + Long_Long_Float (X);
Scale := Scale * Long_Long_Float (Base);
end if;
Last := Last + 1;
end;
end loop;
Result := Result / Scale;
end if;
end Get_Aft;
procedure Get_Fore (
Item : String;
Last : in out Natural;
Result : out Long_Long_Float;
Base : Number_Base;
Error : out Boolean);
procedure Get_Fore (
Item : String;
Last : in out Natural;
Result : out Long_Long_Float;
Base : Number_Base;
Error : out Boolean)
is
Old_Last : constant Natural := Last;
begin
Result := 0.0;
while Last < Item'Last loop
declare
X : Digit;
Is_Invalid : Boolean;
begin
if Item (Last + 1) = '_' then
exit when Last = Old_Last or else Last + 1 >= Item'Last;
Last := Last + 1;
end if;
Value (Item (Last + 1), X, Is_Invalid);
exit when Is_Invalid or else X >= Base; -- implies '.'
if Result >
(Long_Long_Float'Last - Long_Long_Float (X))
/ Long_Long_Float (Base)
then
Error := True;
return; -- error
end if;
Result := Result * Long_Long_Float (Base) + Long_Long_Float (X);
Last := Last + 1;
end;
end loop;
Error := False;
end Get_Fore;
-- implementation
procedure Get_Literal (
Item : String;
Last : out Natural;
Result : out Long_Long_Float;
Error : out Boolean)
is
Sign : Long_Long_Float;
Before_Fore : Positive;
Aft : Long_Long_Float;
Base : Number_Base := 10;
Mark : Character;
Exponent : Integer;
begin
Last := Item'First - 1;
Skip_Spaces (Item, Last);
if Last < Item'Last and then Item (Last + 1) = '-' then
Last := Last + 1;
Sign := -1.0;
else
if Last < Item'Last and then Item (Last + 1) = '+' then
Last := Last + 1;
end if;
Sign := 1.0;
end if;
Before_Fore := Last;
Get_Fore (Item, Last, Result, Base => Base, Error => Error);
if not Error then
if Last < Item'Last
and then (Item (Last + 1) = '#' or else Item (Last + 1) = ':')
then
Mark := Item (Last + 1);
Last := Last + 1;
if Result not in
Long_Long_Float (Number_Base'First) ..
Long_Long_Float (Number_Base'Last)
then
Error := True;
else
Base := Number_Base (Result);
Before_Fore := Last;
Get_Fore (Item, Last, Result, Base => Base, Error => Error);
if not Error then
Get_Aft (Item, Last, Aft, Base => Base);
if Last = Before_Fore then
Error := True; -- no fore nor aft
else
Result := Result + Aft;
if Last >= Item'Last or else Item (Last + 1) /= Mark then
Error := True;
else
Last := Last + 1;
end if;
end if;
end if;
end if;
else
Get_Aft (Item, Last, Aft, Base => Base);
if Last = Before_Fore then
Error := True; -- no fore nor aft
else
Result := Result + Aft;
end if;
end if;
if not Error then
Get_Exponent (Item, Last, Exponent,
Positive_Only => False,
Error => Error);
if not Error then
if Exponent /= 0 then
Result := Result * Long_Long_Float (Base) ** Exponent;
end if;
Result := copysignl (Result, Sign);
end if;
end if;
end if;
end Get_Literal;
end System.Formatting.Literals.Float;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . T H R E A D S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is the VxWorks 653 version of this package
pragma Restrictions (No_Tasking);
-- The VxWorks 653 version of this package is intended only for programs
-- which do not use Ada tasking. This restriction ensures that this
-- will be checked by the binder.
with System.Storage_Elements; use System.Storage_Elements;
with System.OS_Versions; use System.OS_Versions;
package body System.Threads is
use Interfaces.C;
package SSL renames System.Soft_Links;
Main_ATSD : aliased ATSD;
-- TSD for environment task
Current_ATSD : aliased System.Address := System.Null_Address;
pragma Thread_Local_Storage (Current_ATSD);
-- pragma TLS needed since TaskVarAdd no longer available
-- Assume guard pages for Helix APEX partitions, but leave
-- checking mechanism in for now, in case of surprises. ???
Stack_Limit : Address;
pragma Import (C, Stack_Limit, "__gnat_stack_limit");
type Set_Stack_Limit_Proc_Acc is access procedure;
pragma Convention (C, Set_Stack_Limit_Proc_Acc);
Set_Stack_Limit_Hook : Set_Stack_Limit_Proc_Acc;
pragma Import (C, Set_Stack_Limit_Hook, "__gnat_set_stack_limit_hook");
-- Procedure to be called when a task is created to set stack limit if
-- limit checking is used.
-- VxWorks specific API
ERROR : constant STATUS := Interfaces.C.int (-1);
OK : constant STATUS := Interfaces.C.int (0);
function taskIdVerify (tid : t_id) return STATUS;
pragma Import (C, taskIdVerify, "taskIdVerify");
function taskIdSelf return t_id;
pragma Import (C, taskIdSelf, "taskIdSelf");
-----------------------
-- Local Subprograms --
-----------------------
procedure Init_RTS;
-- This procedure performs the initialization of the run-time lib.
-- It installs System.Threads versions of certain operations of the
-- run-time lib.
procedure Install_Handler;
pragma Import (C, Install_Handler, "__gnat_install_handler");
function Get_Sec_Stack return SST.SS_Stack_Ptr;
procedure Set_Sec_Stack (Stack : SST.SS_Stack_Ptr);
-----------------------
-- Thread_Body_Enter --
-----------------------
procedure Thread_Body_Enter
(Sec_Stack_Ptr : SST.SS_Stack_Ptr;
Process_ATSD_Address : System.Address)
is
ATSD : constant ATSD_Access := From_Address (Process_ATSD_Address);
begin
ATSD.Sec_Stack_Ptr := Sec_Stack_Ptr;
SST.SS_Init (ATSD.Sec_Stack_Ptr);
Current_ATSD := Process_ATSD_Address;
Install_Handler;
-- Assume guard pages for Helix/Vx7, but leave in for now ???
-- Initialize stack limit if needed.
if Current_ATSD /= Main_ATSD'Address
and then Set_Stack_Limit_Hook /= null
then
Set_Stack_Limit_Hook.all;
end if;
end Thread_Body_Enter;
----------------------------------
-- Thread_Body_Exceptional_Exit --
----------------------------------
procedure Thread_Body_Exceptional_Exit
(EO : Ada.Exceptions.Exception_Occurrence)
is
pragma Unreferenced (EO);
begin
-- No action for this target
null;
end Thread_Body_Exceptional_Exit;
-----------------------
-- Thread_Body_Leave --
-----------------------
procedure Thread_Body_Leave is
begin
-- No action for this target
null;
end Thread_Body_Leave;
--------------
-- Init_RTS --
--------------
procedure Init_RTS is
-- Register environment task
Result : constant Interfaces.C.int := Register (taskIdSelf);
pragma Assert (Result /= ERROR);
begin
Main_ATSD.Sec_Stack_Ptr := SSL.Get_Sec_Stack_NT;
Current_ATSD := Main_ATSD'Address;
Install_Handler;
SSL.Get_Sec_Stack := Get_Sec_Stack'Access;
SSL.Set_Sec_Stack := Set_Sec_Stack'Access;
end Init_RTS;
-------------------
-- Get_Sec_Stack --
-------------------
function Get_Sec_Stack return SST.SS_Stack_Ptr is
CTSD : constant ATSD_Access := From_Address (Current_ATSD);
begin
pragma Assert (CTSD /= null);
return CTSD.Sec_Stack_Ptr;
end Get_Sec_Stack;
--------------
-- Register --
--------------
function Register (T : Thread_Id) return STATUS is
begin
-- It cannot be assumed that the caller of this routine has a ATSD;
-- so neither this procedure nor the procedures that it calls should
-- raise or handle exceptions, or make use of a secondary stack.
if taskIdVerify (T) = ERROR then
return ERROR;
end if;
Current_ATSD := To_Address (Integer_Address (T));
-- The same issue applies to the task variable that contains the stack
-- limit when that overflow checking mechanism is used instead of
-- probing. If stack checking is enabled and limit checking is used,
-- allocate the limit for this task. The environment task has this
-- initialized by the binder-generated main when
-- System.Stack_Check_Limits = True.
pragma Warnings (Off);
-- OS is a constant
if OS /= VxWorks_653 and then Set_Stack_Limit_Hook /= null then
-- Check that this is correct if limit checking left in. ???
Stack_Limit := To_Address (Integer_Address (T));
end if;
pragma Warnings (On);
return OK;
end Register;
-------------------
-- Set_Sec_Stack --
-------------------
procedure Set_Sec_Stack (Stack : SST.SS_Stack_Ptr) is
CTSD : constant ATSD_Access := From_Address (Current_ATSD);
begin
pragma Assert (CTSD /= null);
CTSD.Sec_Stack_Ptr := Stack;
end Set_Sec_Stack;
begin
-- Initialize run-time library
Init_RTS;
end System.Threads;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Elements.Defining_Names;
with Program.Elements.Expressions;
with Program.Elements.Aspect_Specifications;
with Program.Elements.Generic_Function_Renaming_Declarations;
with Program.Element_Visitors;
package Program.Nodes.Generic_Function_Renaming_Declarations is
pragma Preelaborate;
type Generic_Function_Renaming_Declaration is
new Program.Nodes.Node
and Program.Elements.Generic_Function_Renaming_Declarations
.Generic_Function_Renaming_Declaration
and Program.Elements.Generic_Function_Renaming_Declarations
.Generic_Function_Renaming_Declaration_Text
with private;
function Create
(Generic_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Function_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Renames_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Renamed_Function : not null Program.Elements.Expressions
.Expression_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Generic_Function_Renaming_Declaration;
type Implicit_Generic_Function_Renaming_Declaration is
new Program.Nodes.Node
and Program.Elements.Generic_Function_Renaming_Declarations
.Generic_Function_Renaming_Declaration
with private;
function Create
(Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Renamed_Function : not null Program.Elements.Expressions
.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Generic_Function_Renaming_Declaration
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Generic_Function_Renaming_Declaration is
abstract new Program.Nodes.Node
and Program.Elements.Generic_Function_Renaming_Declarations
.Generic_Function_Renaming_Declaration
with record
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Renamed_Function : not null Program.Elements.Expressions
.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
end record;
procedure Initialize
(Self : aliased in out Base_Generic_Function_Renaming_Declaration'Class);
overriding procedure Visit
(Self : not null access Base_Generic_Function_Renaming_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Name
(Self : Base_Generic_Function_Renaming_Declaration)
return not null Program.Elements.Defining_Names.Defining_Name_Access;
overriding function Renamed_Function
(Self : Base_Generic_Function_Renaming_Declaration)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Aspects
(Self : Base_Generic_Function_Renaming_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
overriding function Is_Generic_Function_Renaming_Declaration_Element
(Self : Base_Generic_Function_Renaming_Declaration)
return Boolean;
overriding function Is_Declaration_Element
(Self : Base_Generic_Function_Renaming_Declaration)
return Boolean;
type Generic_Function_Renaming_Declaration is
new Base_Generic_Function_Renaming_Declaration
and Program.Elements.Generic_Function_Renaming_Declarations
.Generic_Function_Renaming_Declaration_Text
with record
Generic_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Function_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Renames_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Generic_Function_Renaming_Declaration_Text
(Self : aliased in out Generic_Function_Renaming_Declaration)
return Program.Elements.Generic_Function_Renaming_Declarations
.Generic_Function_Renaming_Declaration_Text_Access;
overriding function Generic_Token
(Self : Generic_Function_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Function_Token
(Self : Generic_Function_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Renames_Token
(Self : Generic_Function_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function With_Token
(Self : Generic_Function_Renaming_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function Semicolon_Token
(Self : Generic_Function_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Generic_Function_Renaming_Declaration is
new Base_Generic_Function_Renaming_Declaration
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Generic_Function_Renaming_Declaration_Text
(Self : aliased in out Implicit_Generic_Function_Renaming_Declaration)
return Program.Elements.Generic_Function_Renaming_Declarations
.Generic_Function_Renaming_Declaration_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Generic_Function_Renaming_Declaration)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Generic_Function_Renaming_Declaration)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Generic_Function_Renaming_Declaration)
return Boolean;
end Program.Nodes.Generic_Function_Renaming_Declarations;
|
-- Copyright (C) 2019 Thierry Rascle <thierr26@free.fr>
-- MIT license. Please refer to the LICENSE file.
with Ada.Tags; use Ada.Tags;
with Apsepp.Test_Node_Class.Testing; use Apsepp.Test_Node_Class.Testing;
with Apsepp.Abstract_Early_Test_Case; use Apsepp.Abstract_Early_Test_Case;
package Apsepp_Test_Node_Class_Early_Test_Case is
function Expected_Routine_State_Array return Routine_State_Array;
function Routine_State_Array_To_Tag_Array
(A : Routine_State_Array) return Tag_Array
with Post => Routine_State_Array_To_Tag_Array'Result'First = A'First
and then
Routine_State_Array_To_Tag_Array'Result'Length = A'Length
and then
(for all K in A'Range
=> Routine_State_Array_To_Tag_Array'Result(K) = A(K).T);
type Apsepp_Test_Node_Class_E_T_C
is limited new Early_Test_Case with null record;
overriding
function Early_Routine
(Obj : Apsepp_Test_Node_Class_E_T_C) return Test_Routine;
end Apsepp_Test_Node_Class_Early_Test_Case;
|
-- 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_query_best_size_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_query_best_size_cookie_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_query_best_size_cookie_t.Item,
Element_Array => xcb.xcb_query_best_size_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_query_best_size_cookie_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_query_best_size_cookie_t.Pointer,
Element_Array => xcb.xcb_query_best_size_cookie_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_query_best_size_cookie_t;
|
with Ada.Assertions; use Ada.Assertions;
with Ada.Containers.Ordered_Maps; use Ada.Containers;
with Ada.Text_IO; use Ada.Text_IO;
with Input; use Input;
procedure Day04 is
type Hour is array (Natural range 0 .. 59) of Natural;
package Time_Maps is new Ordered_Maps (Key_Type => Natural,
Element_Type => Hour);
Time_Table : Time_Maps.Map;
Most_Minutes_Guard : Natural := 0;
Most_Minutes_Max_Minute : Natural := 0;
Most_Minutes_Count : Natural := 0;
Most_In_Minute_Guard : Natural := 0;
Most_In_Minute_Count : Natural := 0;
Most_In_Minute : Natural := 0;
begin
-- Input Setup
declare
Current_Guard : Natural := 0;
Sleep_Start : Natural range 0 .. 59 := 0;
begin
for Repose_Record of Repose_Records loop
if Repose_Record.Action = Shift_Start then
Current_Guard := Repose_Record.Data;
elsif Repose_Record.Action = Fall_Asleep then
Sleep_Start := Repose_Record.Data;
elsif Repose_Record.Action = Wake_Up then
if not Time_Table.Contains (Current_Guard) then
Time_Table.Insert (Current_Guard, (others => 0));
end if;
declare
Current_Hour : Hour := Time_Table.Element (Current_Guard);
begin
for S in Sleep_Start .. (Repose_Record.Data - 1) loop
Current_Hour (S) := Current_Hour (S) + 1;
end loop;
Time_Table.Replace (Current_Guard, Current_Hour);
end;
else
Assert (False, "This should not happen!");
end if;
end loop;
end;
-- Part 1 & 2
for C in Time_Table.Iterate loop
declare
Max_Minute : Natural := 0;
Minute_Count : Natural := 0;
begin
for I in 0 .. 59 loop
Minute_Count := Minute_Count + Time_Maps.Element (C) (I);
if Time_Maps.Element (C) (I) > Time_Maps.Element (C) (Max_Minute) then
Max_Minute := I;
end if;
if Time_Maps.Element (C) (I) > Most_In_Minute_Count then
Most_In_Minute := I;
Most_In_Minute_Guard := Time_Maps.Key (C);
Most_In_Minute_Count := Time_Maps.Element (C) (I);
end if;
end loop;
if Minute_Count > Most_Minutes_Count then
Most_Minutes_Guard := Time_Maps.Key (C);
Most_Minutes_Count := Minute_Count;
Most_Minutes_Max_Minute := Max_Minute;
end if;
end;
end loop;
Put_Line ("Part 1 =" & Natural'Image (Most_Minutes_Guard * Most_Minutes_Max_Minute));
Put_Line ("Part 2 =" & Natural'Image (Most_In_Minute_Guard * Most_In_Minute));
end Day04;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S C A N S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- 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 Namet; use Namet;
with Types; use Types;
with Uintp; use Uintp;
with Urealp; use Urealp;
package Scans is
-- The scanner maintains a current state in the global variables defined
-- in this package. The call to the Scan routine advances this state to
-- the next token. The state is initialized by the call to one of the
-- initialization routines in Sinput.
-- The following type is used to identify token types returned by Scan.
-- The class column in this table indicates the token classes which
-- apply to the token, as defined by subsequent subtype declarations.
-- Note: Namet.Is_Keyword_Name depends on the fact that the first entry in
-- this type declaration is *not* for a reserved word. For details on why
-- there is this requirement, see Scans.Initialize_Ada_Keywords.
type Token_Type is (
-- Token name Token type Class(es)
Tok_Integer_Literal, -- numeric lit Literal, Lit_Or_Name
Tok_Real_Literal, -- numeric lit Literal, Lit_Or_Name
Tok_String_Literal, -- string lit Literal. Lit_Or_Name
Tok_Char_Literal, -- char lit Name, Literal. Lit_Or_Name
Tok_Operator_Symbol, -- op symbol Name, Literal, Lit_Or_Name, Desig
Tok_Identifier, -- identifier Name, Lit_Or_Name, Desig
Tok_Double_Asterisk, -- **
Tok_Ampersand, -- & Binary_Addop
Tok_Minus, -- - Binary_Addop, Unary_Addop
Tok_Plus, -- + Binary_Addop, Unary_Addop
Tok_Asterisk, -- * Mulop
Tok_Mod, -- MOD Mulop
Tok_Rem, -- REM Mulop
Tok_Slash, -- / Mulop
Tok_New, -- NEW
Tok_Abs, -- ABS
Tok_Others, -- OTHERS
Tok_Null, -- NULL
Tok_Dot, -- . Namext
Tok_Apostrophe, -- ' Namext
Tok_Left_Paren, -- ( Namext, Consk
Tok_Delta, -- DELTA Atkwd, Sterm, Consk
Tok_Digits, -- DIGITS Atkwd, Sterm, Consk
Tok_Range, -- RANGE Atkwd, Sterm, Consk
Tok_Right_Paren, -- ) Sterm
Tok_Comma, -- , Sterm
Tok_And, -- AND Logop, Sterm
Tok_Or, -- OR Logop, Sterm
Tok_Xor, -- XOR Logop, Sterm
Tok_Less, -- < Relop, Sterm
Tok_Equal, -- = Relop, Sterm
Tok_Greater, -- > Relop, Sterm
Tok_Not_Equal, -- /= Relop, Sterm
Tok_Greater_Equal, -- >= Relop, Sterm
Tok_Less_Equal, -- <= Relop, Sterm
Tok_In, -- IN Relop, Sterm
Tok_Not, -- NOT Relop, Sterm
Tok_Box, -- <> Relop, Eterm, Sterm
Tok_Colon_Equal, -- := Eterm, Sterm
Tok_Colon, -- : Eterm, Sterm
Tok_Greater_Greater, -- >> Eterm, Sterm
Tok_Abstract, -- ABSTRACT Eterm, Sterm
Tok_Access, -- ACCESS Eterm, Sterm
Tok_Aliased, -- ALIASED Eterm, Sterm
Tok_All, -- ALL Eterm, Sterm
Tok_Array, -- ARRAY Eterm, Sterm
Tok_At, -- AT Eterm, Sterm
Tok_Body, -- BODY Eterm, Sterm
Tok_Constant, -- CONSTANT Eterm, Sterm
Tok_Do, -- DO Eterm, Sterm
Tok_Is, -- IS Eterm, Sterm
Tok_Interface, -- INTERFACE Eterm, Sterm
Tok_Limited, -- LIMITED Eterm, Sterm
Tok_Of, -- OF Eterm, Sterm
Tok_Out, -- OUT Eterm, Sterm
Tok_Record, -- RECORD Eterm, Sterm
Tok_Renames, -- RENAMES Eterm, Sterm
Tok_Reverse, -- REVERSE Eterm, Sterm
Tok_Some, -- SOME Eterm, Sterm
Tok_Tagged, -- TAGGED Eterm, Sterm
Tok_Then, -- THEN Eterm, Sterm
Tok_Less_Less, -- << Eterm, Sterm, After_SM
Tok_Abort, -- ABORT Eterm, Sterm, After_SM
Tok_Accept, -- ACCEPT Eterm, Sterm, After_SM
Tok_Case, -- CASE Eterm, Sterm, After_SM
Tok_Delay, -- DELAY Eterm, Sterm, After_SM
Tok_Else, -- ELSE Eterm, Sterm, After_SM
Tok_Elsif, -- ELSIF Eterm, Sterm, After_SM
Tok_End, -- END Eterm, Sterm, After_SM
Tok_Exception, -- EXCEPTION Eterm, Sterm, After_SM
Tok_Exit, -- EXIT Eterm, Sterm, After_SM
Tok_Goto, -- GOTO Eterm, Sterm, After_SM
Tok_If, -- IF Eterm, Sterm, After_SM
Tok_Pragma, -- PRAGMA Eterm, Sterm, After_SM
Tok_Raise, -- RAISE Eterm, Sterm, After_SM
Tok_Requeue, -- REQUEUE Eterm, Sterm, After_SM
Tok_Return, -- RETURN Eterm, Sterm, After_SM
Tok_Select, -- SELECT Eterm, Sterm, After_SM
Tok_Terminate, -- TERMINATE Eterm, Sterm, After_SM
Tok_Until, -- UNTIL Eterm, Sterm, After_SM
Tok_When, -- WHEN Eterm, Sterm, After_SM
Tok_Begin, -- BEGIN Eterm, Sterm, After_SM, Labeled_Stmt
Tok_Declare, -- DECLARE Eterm, Sterm, After_SM, Labeled_Stmt
Tok_For, -- FOR Eterm, Sterm, After_SM, Labeled_Stmt
Tok_Loop, -- LOOP Eterm, Sterm, After_SM, Labeled_Stmt
Tok_While, -- WHILE Eterm, Sterm, After_SM, Labeled_Stmt
Tok_Entry, -- ENTRY Eterm, Sterm, Declk, Deckn, After_SM
Tok_Protected, -- PROTECTED Eterm, Sterm, Declk, Deckn, After_SM
Tok_Task, -- TASK Eterm, Sterm, Declk, Deckn, After_SM
Tok_Type, -- TYPE Eterm, Sterm, Declk, Deckn, After_SM
Tok_Subtype, -- SUBTYPE Eterm, Sterm, Declk, Deckn, After_SM
Tok_Overriding, -- OVERRIDING Eterm, Sterm, Declk, Declk, After_SM
Tok_Synchronized, -- SYNCHRONIZED Eterm, Sterm, Declk, Deckn, After_SM
Tok_Use, -- USE Eterm, Sterm, Declk, Deckn, After_SM
Tok_Function, -- FUNCTION Eterm, Sterm, Cunit, Declk, After_SM
Tok_Generic, -- GENERIC Eterm, Sterm, Cunit, Declk, After_SM
Tok_Package, -- PACKAGE Eterm, Sterm, Cunit, Declk, After_SM
Tok_Procedure, -- PROCEDURE Eterm, Sterm, Cunit, Declk, After_SM
Tok_Private, -- PRIVATE Eterm, Sterm, Cunit, After_SM
Tok_With, -- WITH Eterm, Sterm, Cunit, After_SM
Tok_Separate, -- SEPARATE Eterm, Sterm, Cunit, After_SM
Tok_EOF, -- End of file Eterm, Sterm, Cterm, After_SM
Tok_Semicolon, -- ; Eterm, Sterm, Cterm
Tok_Arrow, -- => Sterm, Cterm, Chtok
Tok_Vertical_Bar, -- | Cterm, Sterm, Chtok
Tok_Dot_Dot, -- .. Sterm, Chtok
Tok_Project,
Tok_Extends,
Tok_External,
Tok_External_As_List,
-- These four entries represent keywords for the project file language
-- and can be returned only in the case of scanning project files.
Tok_Comment,
-- This entry is used when scanning project files (where it represents
-- an entire comment), and in preprocessing with the -C switch set
-- (where it represents just the "--" of a comment). For the project
-- file case, the text of the comment is stored in
Tok_End_Of_Line,
-- Represents an end of line. Not used during normal compilation scans
-- where end of line is ignored. Active for preprocessor scanning and
-- also when scanning project files (where it is needed because of ???)
Tok_Special,
-- Used only in preprocessor scanning (to represent one of the
-- characters '#', '$', '?', '@', '`', '\', '^', '~', or '_'. The
-- character value itself is stored in Scans.Special_Character.
No_Token);
-- No_Token is used for initializing Token values to indicate that
-- no value has been set yet.
-- Note: in the RM, operator symbol is a special case of string literal.
-- We distinguish at the lexical level in this compiler, since there are
-- many syntactic situations in which only an operator symbol is allowed.
-- The following subtype declarations group the token types into classes.
-- These are used for class tests in the parser.
subtype Token_Class_Numeric_Literal is
Token_Type range Tok_Integer_Literal .. Tok_Real_Literal;
-- Numeric literal
subtype Token_Class_Literal is
Token_Type range Tok_Integer_Literal .. Tok_Operator_Symbol;
-- Literal
subtype Token_Class_Lit_Or_Name is
Token_Type range Tok_Integer_Literal .. Tok_Identifier;
subtype Token_Class_Binary_Addop is
Token_Type range Tok_Ampersand .. Tok_Plus;
-- Binary adding operator (& + -)
subtype Token_Class_Unary_Addop is
Token_Type range Tok_Minus .. Tok_Plus;
-- Unary adding operator (+ -)
subtype Token_Class_Mulop is
Token_Type range Tok_Asterisk .. Tok_Slash;
-- Multiplying operator
subtype Token_Class_Logop is
Token_Type range Tok_And .. Tok_Xor;
-- Logical operator (and, or, xor)
subtype Token_Class_Relop is
Token_Type range Tok_Less .. Tok_Box;
-- Relational operator (= /= < <= > >= not, in plus <> to catch misuse
-- of Pascal style not equal operator).
subtype Token_Class_Name is
Token_Type range Tok_Char_Literal .. Tok_Identifier;
-- First token of name (4.1),
-- (identifier, char literal, operator symbol)
subtype Token_Class_Desig is
Token_Type range Tok_Operator_Symbol .. Tok_Identifier;
-- Token which can be a Designator (identifier, operator symbol)
subtype Token_Class_Namext is
Token_Type range Tok_Dot .. Tok_Left_Paren;
-- Name extension tokens. These are tokens which can appear immediately
-- after a name to extend it recursively (period, quote, left paren)
subtype Token_Class_Consk is
Token_Type range Tok_Left_Paren .. Tok_Range;
-- Keywords which can start constraint
-- (left paren, delta, digits, range)
subtype Token_Class_Eterm is
Token_Type range Tok_Colon_Equal .. Tok_Semicolon;
-- Expression terminators. These tokens can never appear within a simple
-- expression. This is used for error recovery purposes (if we encounter
-- an error in an expression, we simply scan to the next Eterm token).
subtype Token_Class_Sterm is
Token_Type range Tok_Delta .. Tok_Dot_Dot;
-- Simple_Expression terminators. A Simple_Expression must be followed
-- by a token in this class, or an error message is issued complaining
-- about a missing binary operator.
subtype Token_Class_Atkwd is
Token_Type range Tok_Delta .. Tok_Range;
-- Attribute keywords. This class includes keywords which can be used
-- as an Attribute_Designator, namely DELTA, DIGITS and RANGE
subtype Token_Class_Cterm is
Token_Type range Tok_EOF .. Tok_Vertical_Bar;
-- Choice terminators. These tokens terminate a choice. This is used for
-- error recovery purposes (if we encounter an error in a Choice, we
-- simply scan to the next Cterm token).
subtype Token_Class_Chtok is
Token_Type range Tok_Arrow .. Tok_Dot_Dot;
-- Choice tokens. These tokens signal a choice when used in an Aggregate
subtype Token_Class_Cunit is
Token_Type range Tok_Function .. Tok_Separate;
-- Tokens which can begin a compilation unit
subtype Token_Class_Declk is
Token_Type range Tok_Entry .. Tok_Procedure;
-- Keywords which start a declaration
subtype Token_Class_Deckn is
Token_Type range Tok_Entry .. Tok_Use;
-- Keywords which start a declaration but can't start a compilation unit
subtype Token_Class_After_SM is
Token_Type range Tok_Less_Less .. Tok_EOF;
-- Tokens which always, or almost always, appear after a semicolon. Used
-- in the Resync_Past_Semicolon routine to avoid gobbling up stuff when
-- a semicolon is missing. Of significance only for error recovery.
subtype Token_Class_Labeled_Stmt is
Token_Type range Tok_Begin .. Tok_While;
-- Tokens which start labeled statements
type Token_Flag_Array is array (Token_Type) of Boolean;
Is_Reserved_Keyword : constant Token_Flag_Array :=
Token_Flag_Array'
(Tok_Mod .. Tok_Rem => True,
Tok_New .. Tok_Null => True,
Tok_Delta .. Tok_Range => True,
Tok_And .. Tok_Xor => True,
Tok_In .. Tok_Not => True,
Tok_Abstract .. Tok_Then => True,
Tok_Abort .. Tok_Separate => True,
others => False);
-- Flag array used to test for reserved word
procedure Initialize_Ada_Keywords;
-- Set up Token_Type values in Names table entries for Ada reserved words
--------------------------
-- Scan State Variables --
--------------------------
-- Note: these variables can only be referenced during the parsing of a
-- file. Reference to any of them from Sem or the expander is wrong.
-- These variables are initialized as required by Scn.Initialize_Scanner,
-- and should not be referenced before such a call. However, there are
-- situations in which these variables are saved and restored, and this
-- may happen before the first Initialize_Scanner call, resulting in the
-- assignment of invalid values. To avoid this, and allow building with
-- the -gnatVa switch, we initialize some variables to known valid values.
Scan_Ptr : Source_Ptr := No_Location; -- init for -gnatVa
-- Current scan pointer location. After a call to Scan, this points
-- just past the end of the token just scanned.
Token : Token_Type := No_Token; -- init for -gnatVa
-- Type of current token
Token_Ptr : Source_Ptr := No_Location; -- init for -gnatVa
-- Pointer to first character of current token
Current_Line_Start : Source_Ptr := No_Location; -- init for -gnatVa
-- Pointer to first character of line containing current token
Start_Column : Column_Number := No_Column_Number; -- init for -gnatVa
-- Starting column number (zero origin) of the first non-blank character
-- on the line containing the current token. This is used for error
-- recovery circuits which depend on looking at the column line up.
Type_Token_Location : Source_Ptr := No_Location; -- init for -gnatVa
-- Within a type declaration, gives the location of the TYPE keyword that
-- opened the type declaration. Used in checking the end column of a record
-- declaration, which can line up either with the TYPE keyword, or with the
-- start of the line containing the RECORD keyword.
Checksum : Word := 0; -- init for -gnatVa
-- Used to accumulate a CRC representing the tokens in the source
-- file being compiled. This CRC includes only program tokens, and
-- excludes comments.
First_Non_Blank_Location : Source_Ptr := No_Location; -- init for -gnatVa
-- Location of first non-blank character on the line containing the
-- current token (i.e. the location of the character whose column number
-- is stored in Start_Column).
Token_Node : Node_Id := Empty;
-- Node table Id for the current token. This is set only if the current
-- token is one for which the scanner constructs a node (i.e. it is an
-- identifier, operator symbol, or literal. For other token types,
-- Token_Node is undefined.
Token_Name : Name_Id := No_Name;
-- For identifiers, this is set to the Name_Id of the identifier scanned.
-- For all other tokens, Token_Name is set to Error_Name. Note that it
-- would be possible for the caller to extract this information from
-- Token_Node. We set Token_Name separately for two reasons. First it
-- allows a quicker test for a specific identifier. Second, it allows
-- a version of the parser to be built that does not build tree nodes,
-- usable as a syntax checker.
Prev_Token : Token_Type := No_Token;
-- Type of previous token
Prev_Token_Ptr : Source_Ptr;
-- Pointer to first character of previous token
Version_To_Be_Found : Boolean;
-- This flag is True if the scanner is still looking for an RCS version
-- number in a comment. Normally it is initialized to False so that this
-- circuit is not activated. If the -dv switch is set, then this flag is
-- initialized to True, and then reset when the version number is found.
-- We do things this way to minimize the impact on comment scanning.
Character_Code : Char_Code;
-- Valid only when Token is Tok_Char_Literal. Contains the value of the
-- scanned literal.
Real_Literal_Value : Ureal;
-- Valid only when Token is Tok_Real_Literal, contains the value of the
-- scanned literal.
Int_Literal_Value : Uint;
-- Valid only when Token = Tok_Integer_Literal, contains the value of the
-- scanned literal.
Based_Literal_Uses_Colon : Boolean;
-- Valid only when Token = Tok_Integer_Literal or Tok_Real_Literal. Set
-- True only for the case of a based literal using ':' instead of '#'.
String_Literal_Id : String_Id;
-- Valid only when Token = Tok_String_Literal or Tok_Operator_Symbol.
-- Contains the Id for currently scanned string value.
Wide_Character_Found : Boolean := False;
-- Valid only when Token = Tok_String_Literal. Set True if wide character
-- found (i.e. a character that does not fit in Character, but fits in
-- Wide_Wide_Character).
Wide_Wide_Character_Found : Boolean := False;
-- Valid only when Token = Tok_String_Literal. Set True if wide wide
-- character found (i.e. a character that does not fit in Character or
-- Wide_Character).
Special_Character : Character;
-- Valid only when Token = Tok_Special. Returns one of the characters
-- '#', '$', '?', '@', '`', '\', '^', '~', or '_'.
--
-- Why only this set? What about wide characters???
Comment_Id : Name_Id := No_Name;
-- Valid only when Token = Tok_Comment. Store the string that follows
-- the "--" of a comment when scanning project files.
--
-- Is it really right for this to be a Name rather than a String, what
-- about the case of Wide_Wide_Characters???
Inside_Conditional_Expression : Nat := 0;
-- This is a counter that is set non-zero while scanning out a conditional
-- expression (incremented on entry, decremented on exit). It is used to
-- disconnect format checks that normally apply to keywords THEN, ELSE etc.
--------------------------------------------------------
-- Procedures for Saving and Restoring the Scan State --
--------------------------------------------------------
-- The following procedures can be used to save and restore the entire
-- scan state. They are used in cases where it is necessary to backup
-- the scan during the parse.
type Saved_Scan_State is private;
-- Used for saving and restoring the scan state
procedure Save_Scan_State (Saved_State : out Saved_Scan_State);
pragma Inline (Save_Scan_State);
-- Saves the current scan state for possible later restoration. Note that
-- there is no harm in saving the state and then never restoring it.
procedure Restore_Scan_State (Saved_State : Saved_Scan_State);
pragma Inline (Restore_Scan_State);
-- Restores a scan state saved by a call to Save_Scan_State.
-- The saved scan state must refer to the current source file.
private
type Saved_Scan_State is record
Save_Scan_Ptr : Source_Ptr;
Save_Token : Token_Type;
Save_Token_Ptr : Source_Ptr;
Save_Current_Line_Start : Source_Ptr;
Save_Start_Column : Column_Number;
Save_Checksum : Word;
Save_First_Non_Blank_Location : Source_Ptr;
Save_Token_Node : Node_Id;
Save_Token_Name : Name_Id;
Save_Prev_Token : Token_Type;
Save_Prev_Token_Ptr : Source_Ptr;
end record;
end Scans;
|
-- Lumen.Binary.Endian.Shorts -- Byte re-ordering routines for "short"
-- (16-bit) values
--
--
-- Chip Richards, NiEstu, Phoenix AZ, Summer 2010
-- This code is covered by the ISC License:
--
-- Copyright © 2010, NiEstu
--
-- 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.
-- Environment
with Ada.Unchecked_Conversion;
package body Lumen.Binary.Endian.Shorts is
---------------------------------------------------------------------------
-- Swap the bytes, no matter the host ordering
function Swap_Bytes (Value : Short_Type) return Short_Type is
S : Two_Bytes;
T : Two_Bytes;
function VTT is new Ada.Unchecked_Conversion (Short_Type, Two_Bytes);
function TTV is new Ada.Unchecked_Conversion (Two_Bytes, Short_Type);
begin -- Swap_Bytes
T := VTT (Value);
S.B0 := T.B1;
S.B1 := T.B0;
return TTV (S);
end Swap_Bytes;
---------------------------------------------------------------------------
-- Swap bytes if host is little-endian, or no-op if it's big-endian
function To_Big (Value : Short_Type) return Short_Type is
begin -- To_Big
if System_Byte_Order /= High_Order_First then
return Swap_Bytes (Value);
else
return Value;
end if;
end To_Big;
---------------------------------------------------------------------------
-- Swap bytes if host is big-endian, or no-op if it's little-endian
function To_Little (Value : Short_Type) return Short_Type is
begin -- To_Little
if System_Byte_Order /= Low_Order_First then
return Swap_Bytes (Value);
else
return Value;
end if;
end To_Little;
---------------------------------------------------------------------------
-- Swap the bytes, no matter the host ordering
procedure Swap_Bytes (Value : in out Short_Type) is
S : Two_Bytes;
T : Two_Bytes;
function VTT is new Ada.Unchecked_Conversion (Short_Type, Two_Bytes);
function TTV is new Ada.Unchecked_Conversion (Two_Bytes, Short_Type);
begin -- Swap_Bytes
T := VTT (Value);
S.B0 := T.B1;
S.B1 := T.B0;
Value := TTV (S);
end Swap_Bytes;
---------------------------------------------------------------------------
-- Swap bytes if host is little-endian, or no-op if it's big-endian
procedure To_Big (Value : in out Short_Type) is
begin -- To_Big
if System_Byte_Order /= High_Order_First then
Swap_Bytes (Value);
end if;
end To_Big;
---------------------------------------------------------------------------
-- Swap bytes if host is big-endian, or no-op if it's little-endian
procedure To_Little (Value : in out Short_Type) is
begin -- To_Little
if System_Byte_Order /= Low_Order_First then
Swap_Bytes (Value);
end if;
end To_Little;
---------------------------------------------------------------------------
end Lumen.Binary.Endian.Shorts;
|
with
aIDE.GUI,
aIDE.Editor.of_subtype_indication,
AdaM.a_Type.enumeration_literal,
glib.Error,
gtk.Builder,
gtk.Handlers;
with Ada.Text_IO; use Ada.Text_IO;
package body aIDE.Editor.of_array_type
is
use Gtk.Builder,
Glib,
glib.Error;
function on_type_name_Entry_leave (the_Entry : access Gtk_Entry_Record'Class;
Target : in AdaM.a_Type.array_type.view) return Boolean
is
the_Text : constant String := the_Entry.Get_Text;
begin
Target.Name_is (the_Text);
return False;
end on_type_name_Entry_leave;
function on_first_Entry_leave (the_Entry : access Gtk_Entry_Record'Class;
Target : in AdaM.a_Type.array_type.view) return Boolean
is
the_Text : constant String := the_Entry.Get_Text;
begin
Target.index_Indication.First_is (the_Text);
return False;
end on_first_Entry_leave;
function on_last_Entry_leave (the_Entry : access Gtk_Entry_Record'Class;
Target : in AdaM.a_Type.array_type.view) return Boolean
is
the_Text : constant String := the_Entry.Get_Text;
begin
Target.index_Indication.Last_is (the_Text);
return False;
end on_last_Entry_leave;
procedure on_index_type_Button_clicked (the_Entry : access Gtk_Button_Record'Class;
the_Editor : in aIDE.Editor.of_array_type.view) -- return Boolean
is
-- the_Text : constant String := the_Entry.get_Text;
begin
aIDE.GUI.show_types_Palette (Invoked_by => the_Entry.all'Access,
Target => the_Editor.Target.index_Indication.main_Type);
-- Target.Name_is (the_Text);
-- return False;
end on_index_type_Button_clicked;
procedure on_element_type_Button_clicked (the_Entry : access Gtk_Button_Record'Class;
the_Editor : in aIDE.Editor.of_array_type.view) -- return Boolean
is
-- the_Text : constant String := the_Entry.get_Text;
begin
aIDE.GUI.show_types_Palette (Invoked_by => the_Entry.all'Access,
Target => the_Editor.Target.component_Indication.main_Type);
end on_element_type_Button_clicked;
procedure on_rid_Button_clicked (the_Button : access Gtk_Button_Record'Class;
the_Editor : in aIDE.Editor.of_array_type.view)
is
pragma Unreferenced (the_Editor);
begin
the_Button.get_Parent.destroy;
end on_rid_Button_clicked;
package Entry_return_Callbacks is new Gtk.Handlers.User_Return_Callback (Gtk_Entry_Record,
Boolean,
AdaM.a_Type.array_type.view);
package Button_Callbacks is new Gtk.Handlers.User_Callback (Gtk_Button_Record,
aIDE.Editor.of_array_type.view);
function on_unconstrained_Label_clicked (the_Label : access Gtk_Label_Record'Class;
Self : in aIDE.Editor.of_array_type.view) return Boolean
is
pragma Unreferenced (the_Label);
begin
Self.Target.is_Constrained;
Self.freshen;
return False;
end on_unconstrained_Label_clicked;
function on_constrained_Label_clicked (the_Label : access Gtk_Label_Record'Class;
Self : in aIDE.Editor.of_array_type.view) return Boolean
is
pragma Unreferenced (the_Label);
begin
Self.Target.is_Constrained (Now => False);
Self.freshen;
return False;
end on_constrained_Label_clicked;
package Label_return_Callbacks is new Gtk.Handlers.User_Return_Callback (Gtk_Label_Record,
Boolean,
aIDE.Editor.of_array_type.view);
package body Forge
is
function to_Editor (the_Target : in AdaM.a_Type.array_type.view) return View
is
use AdaM,
Glib;
Self : constant Editor.of_array_type.view := new Editor.of_array_type.item;
the_Builder : Gtk_Builder;
Error : aliased GError;
Result : Guint;
pragma Unreferenced (Result);
begin
Self.Target := the_Target;
Gtk_New (the_Builder);
Result := the_Builder.Add_From_File ("glade/editor/array_type_editor.glade", Error'Access);
if Error /= null then
raise Program_Error with "Error: adam.Editor.of_enumeration_type ~ " & Get_Message (Error);
end if;
Self.top_Box := gtk_Box (the_Builder.get_Object ("top_Box"));
Self.type_name_Entry := Gtk_Entry (the_Builder.get_Object ("type_name_Entry"));
Self.index_Box := gtk_Box (the_Builder.get_Object ("index_Box"));
Self.component_Box := gtk_Box (the_Builder.get_Object ("component_Box"));
-- Self.index_type_Button := Gtk_Button (the_Builder.get_Object ("index_type_Button"));
--
-- Self.unconstrained_Label := Gtk_Label (the_Builder.get_Object ("unconstrained_Label"));
-- Self. constrained_Label := Gtk_Label (the_Builder.get_Object ( "constrained_Label"));
--
-- Self.first_Entry := Gtk_Entry (the_Builder.get_Object ("first_Entry"));
-- Self. last_Entry := Gtk_Entry (the_Builder.get_Object ( "last_Entry"));
-- Self.element_type_Button := Gtk_Button (the_Builder.get_Object ("element_type_Button"));
Self.rid_Button := gtk_Button (the_Builder.get_Object ("rid_Button"));
Self.type_name_Entry.Set_Text (+Self.Target.Name);
Entry_return_Callbacks.connect (Self.type_name_Entry,
"focus-out-event",
on_type_name_Entry_leave'Access,
the_Target);
declare
indication_Editor : constant aIDE.Editor.of_subtype_indication.view
:= aIDE.Editor.of_subtype_indication.Forge.to_Editor (the_Target => Self.Target.index_Indication.all'Access,
is_in_unconstrained_Array => not Self.Target.is_Constrained);
begin
Self.index_Box.pack_Start (indication_Editor.top_Widget);
end;
declare
indication_Editor : constant aIDE.Editor.of_subtype_indication.view
:= aIDE.Editor.of_subtype_indication.Forge.to_Editor (the_Target => Self.Target.component_Indication.all'Access,
is_in_unconstrained_Array => False);
begin
Self.component_Box.pack_Start (indication_Editor.top_Widget);
end;
-- Self.first_Entry.set_Text (Self.Target.index_Indication.First);
--
-- Entry_return_Callbacks.connect (Self.first_Entry,
-- "focus-out-event",
-- on_first_Entry_leave'Access,
-- the_Target);
--
-- Self.last_Entry.set_Text (Self.Target.index_Indication.Last);
--
-- Entry_return_Callbacks.connect (Self.last_Entry,
-- "focus-out-event",
-- on_last_Entry_leave'Access,
-- the_Target);
--
--
--
-- Self.index_type_Button.set_Label (+Self.Target.index_Indication.main_Type.Name);
--
-- button_Callbacks.connect (Self.index_type_Button,
-- "clicked",
-- on_index_type_Button_clicked'Access,
-- Self);
-- Self.element_type_Button.set_Label (+Self.Target.element_Indication.main_Type.Name);
--
-- button_Callbacks.connect (Self.element_type_Button,
-- "clicked",
-- on_element_type_Button_clicked'Access,
-- Self);
Button_Callbacks.Connect (Self.rid_Button,
"clicked",
on_rid_Button_clicked'Access,
Self);
-- Label_return_Callbacks.Connect (Self.unconstrained_Label,
-- "button-release-event",
-- on_unconstrained_Label_clicked'Access,
-- Self);
--
-- Label_return_Callbacks.Connect (Self.constrained_Label,
-- "button-release-event",
-- on_constrained_Label_clicked'Access,
-- Self);
Self.freshen;
return Self;
end to_Editor;
end Forge;
procedure destroy_Callback (Widget : not null access Gtk.Widget.Gtk_Widget_Record'Class)
is
begin
Widget.destroy;
end destroy_Callback;
overriding
procedure freshen (Self : in out Item)
is
use gtk.Widget;
-- the_Literals : AdaM.a_Type.enumeration_literal.vector renames Self.Target.Literals;
-- literal_Editor : aIDE.Editor.of_enumeration_literal.view;
begin
-- if Self.Target.is_Constrained
-- then
-- Self.unconstrained_Label.hide;
-- Self. constrained_Label.show;
-- Self.first_Entry.show;
-- Self.last_Entry.show;
-- else
-- Self.first_Entry.hide;
-- Self.last_Entry.hide;
-- Self. constrained_Label.hide;
-- Self.unconstrained_Label.show;
-- end if;
null;
-- Self.first_Entry.set_Text (Self.Target.First);
-- Self.last_Entry .set_Text (Self.Target.Last);
-- Self.literals_Box.Foreach (destroy_Callback'Access);
-- for Each of the_Literals
-- loop
-- literal_Editor := Editor.of_enumeration_literal.Forge.to_Editor (Each,
-- targets_Parent => Self.Target.all'Access);
-- Self.literals_Box.pack_Start (literal_Editor.top_Widget);
-- end loop;
end freshen;
overriding
function top_Widget (Self : in Item) return gtk.Widget.Gtk_Widget
is
begin
return gtk.Widget.Gtk_Widget (Self.top_Box);
end top_Widget;
end aIDE.Editor.of_array_type;
|
package FLTK.Devices is
type Device is new Wrapper with private;
private
type Device is new Wrapper with null record;
end FLTK.Devices;
|
------ WHILE / LOOP / FOR
procedure Hello is
a: Integer;
b: Float ;
c: Boolean;
function uno(a,b:in Integer) return Integer is
begin
Put(one);
for I in 1..1 loop
Get(a);
end loop;
return True;
end uno;
begin
b := 2.0;
c := True;
while (n > 3) loop
if (a>3) or (a<0) then
exit when (a = 2);
end if;
a := a +1;
end loop;
end Hello;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.Visitors.UML_Iterators;
with AMF.Visitors.UML_Visitors;
with League.Strings.Internals;
with Matreshka.Internals.Strings;
package body AMF.Internals.UML_Use_Cases is
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UML_Use_Case_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then
AMF.Visitors.UML_Visitors.UML_Visitor'Class
(Visitor).Enter_Use_Case
(AMF.UML.Use_Cases.UML_Use_Case_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UML_Use_Case_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then
AMF.Visitors.UML_Visitors.UML_Visitor'Class
(Visitor).Leave_Use_Case
(AMF.UML.Use_Cases.UML_Use_Case_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UML_Use_Case_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.UML_Iterators.UML_Iterator'Class then
AMF.Visitors.UML_Iterators.UML_Iterator'Class
(Iterator).Visit_Use_Case
(Visitor,
AMF.UML.Use_Cases.UML_Use_Case_Access (Self),
Control);
end if;
end Visit_Element;
----------------
-- Get_Extend --
----------------
overriding function Get_Extend
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Extends.Collections.Set_Of_UML_Extend is
begin
return
AMF.UML.Extends.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Extend
(Self.Element)));
end Get_Extend;
-------------------------
-- Get_Extension_Point --
-------------------------
overriding function Get_Extension_Point
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Extension_Points.Collections.Set_Of_UML_Extension_Point is
begin
return
AMF.UML.Extension_Points.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Extension_Point
(Self.Element)));
end Get_Extension_Point;
-----------------
-- Get_Include --
-----------------
overriding function Get_Include
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Includes.Collections.Set_Of_UML_Include is
begin
return
AMF.UML.Includes.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Include
(Self.Element)));
end Get_Include;
-----------------
-- Get_Subject --
-----------------
overriding function Get_Subject
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Subject
(Self.Element)));
end Get_Subject;
-----------------------------
-- Get_Classifier_Behavior --
-----------------------------
overriding function Get_Classifier_Behavior
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Behaviors.UML_Behavior_Access is
begin
return
AMF.UML.Behaviors.UML_Behavior_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Classifier_Behavior
(Self.Element)));
end Get_Classifier_Behavior;
-----------------------------
-- Set_Classifier_Behavior --
-----------------------------
overriding procedure Set_Classifier_Behavior
(Self : not null access UML_Use_Case_Proxy;
To : AMF.UML.Behaviors.UML_Behavior_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Classifier_Behavior
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Classifier_Behavior;
-------------------------------
-- Get_Interface_Realization --
-------------------------------
overriding function Get_Interface_Realization
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Interface_Realizations.Collections.Set_Of_UML_Interface_Realization is
begin
return
AMF.UML.Interface_Realizations.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Interface_Realization
(Self.Element)));
end Get_Interface_Realization;
------------------------
-- Get_Owned_Behavior --
------------------------
overriding function Get_Owned_Behavior
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Behaviors.Collections.Set_Of_UML_Behavior is
begin
return
AMF.UML.Behaviors.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Behavior
(Self.Element)));
end Get_Owned_Behavior;
-------------------
-- Get_Attribute --
-------------------
overriding function Get_Attribute
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property is
begin
return
AMF.UML.Properties.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Attribute
(Self.Element)));
end Get_Attribute;
---------------------------
-- Get_Collaboration_Use --
---------------------------
overriding function Get_Collaboration_Use
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Collaboration_Uses.Collections.Set_Of_UML_Collaboration_Use is
begin
return
AMF.UML.Collaboration_Uses.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Collaboration_Use
(Self.Element)));
end Get_Collaboration_Use;
-----------------
-- Get_Feature --
-----------------
overriding function Get_Feature
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature is
begin
return
AMF.UML.Features.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Feature
(Self.Element)));
end Get_Feature;
-----------------
-- Get_General --
-----------------
overriding function Get_General
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_General
(Self.Element)));
end Get_General;
------------------------
-- Get_Generalization --
------------------------
overriding function Get_Generalization
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Generalizations.Collections.Set_Of_UML_Generalization is
begin
return
AMF.UML.Generalizations.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Generalization
(Self.Element)));
end Get_Generalization;
--------------------------
-- Get_Inherited_Member --
--------------------------
overriding function Get_Inherited_Member
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Inherited_Member
(Self.Element)));
end Get_Inherited_Member;
---------------------
-- Get_Is_Abstract --
---------------------
overriding function Get_Is_Abstract
(Self : not null access constant UML_Use_Case_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Abstract
(Self.Element);
end Get_Is_Abstract;
---------------------------------
-- Get_Is_Final_Specialization --
---------------------------------
overriding function Get_Is_Final_Specialization
(Self : not null access constant UML_Use_Case_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Final_Specialization
(Self.Element);
end Get_Is_Final_Specialization;
---------------------------------
-- Set_Is_Final_Specialization --
---------------------------------
overriding procedure Set_Is_Final_Specialization
(Self : not null access UML_Use_Case_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Final_Specialization
(Self.Element, To);
end Set_Is_Final_Specialization;
----------------------------------
-- Get_Owned_Template_Signature --
----------------------------------
overriding function Get_Owned_Template_Signature
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access is
begin
return
AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Template_Signature
(Self.Element)));
end Get_Owned_Template_Signature;
----------------------------------
-- Set_Owned_Template_Signature --
----------------------------------
overriding procedure Set_Owned_Template_Signature
(Self : not null access UML_Use_Case_Proxy;
To : AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Owned_Template_Signature
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owned_Template_Signature;
------------------------
-- Get_Owned_Use_Case --
------------------------
overriding function Get_Owned_Use_Case
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case is
begin
return
AMF.UML.Use_Cases.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Use_Case
(Self.Element)));
end Get_Owned_Use_Case;
--------------------------
-- Get_Powertype_Extent --
--------------------------
overriding function Get_Powertype_Extent
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Generalization_Sets.Collections.Set_Of_UML_Generalization_Set is
begin
return
AMF.UML.Generalization_Sets.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Powertype_Extent
(Self.Element)));
end Get_Powertype_Extent;
------------------------------
-- Get_Redefined_Classifier --
------------------------------
overriding function Get_Redefined_Classifier
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefined_Classifier
(Self.Element)));
end Get_Redefined_Classifier;
------------------------
-- Get_Representation --
------------------------
overriding function Get_Representation
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access is
begin
return
AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Representation
(Self.Element)));
end Get_Representation;
------------------------
-- Set_Representation --
------------------------
overriding procedure Set_Representation
(Self : not null access UML_Use_Case_Proxy;
To : AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Representation
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Representation;
----------------------
-- Get_Substitution --
----------------------
overriding function Get_Substitution
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Substitutions.Collections.Set_Of_UML_Substitution is
begin
return
AMF.UML.Substitutions.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Substitution
(Self.Element)));
end Get_Substitution;
----------------------------
-- Get_Template_Parameter --
----------------------------
overriding function Get_Template_Parameter
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access is
begin
return
AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Template_Parameter
(Self.Element)));
end Get_Template_Parameter;
----------------------------
-- Set_Template_Parameter --
----------------------------
overriding procedure Set_Template_Parameter
(Self : not null access UML_Use_Case_Proxy;
To : AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Template_Parameter;
------------------
-- Get_Use_Case --
------------------
overriding function Get_Use_Case
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case is
begin
return
AMF.UML.Use_Cases.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Use_Case
(Self.Element)));
end Get_Use_Case;
------------------------
-- Get_Element_Import --
------------------------
overriding function Get_Element_Import
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import is
begin
return
AMF.UML.Element_Imports.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Element_Import
(Self.Element)));
end Get_Element_Import;
-------------------------
-- Get_Imported_Member --
-------------------------
overriding function Get_Imported_Member
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
return
AMF.UML.Packageable_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Imported_Member
(Self.Element)));
end Get_Imported_Member;
----------------
-- Get_Member --
----------------
overriding function Get_Member
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Member
(Self.Element)));
end Get_Member;
----------------------
-- Get_Owned_Member --
----------------------
overriding function Get_Owned_Member
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Member
(Self.Element)));
end Get_Owned_Member;
--------------------
-- Get_Owned_Rule --
--------------------
overriding function Get_Owned_Rule
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint is
begin
return
AMF.UML.Constraints.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Rule
(Self.Element)));
end Get_Owned_Rule;
------------------------
-- Get_Package_Import --
------------------------
overriding function Get_Package_Import
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import is
begin
return
AMF.UML.Package_Imports.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Package_Import
(Self.Element)));
end Get_Package_Import;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is
begin
return
AMF.UML.Dependencies.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Client_Dependency
(Self.Element)));
end Get_Client_Dependency;
-------------------------
-- Get_Name_Expression --
-------------------------
overriding function Get_Name_Expression
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access is
begin
return
AMF.UML.String_Expressions.UML_String_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Name_Expression
(Self.Element)));
end Get_Name_Expression;
-------------------------
-- Set_Name_Expression --
-------------------------
overriding procedure Set_Name_Expression
(Self : not null access UML_Use_Case_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Name_Expression
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Name_Expression;
-------------------
-- Get_Namespace --
-------------------
overriding function Get_Namespace
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
return
AMF.UML.Namespaces.UML_Namespace_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Namespace
(Self.Element)));
end Get_Namespace;
------------------------
-- Get_Qualified_Name --
------------------------
overriding function Get_Qualified_Name
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.UML_Attributes.Internal_Get_Qualified_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Qualified_Name;
-----------------
-- Get_Package --
-----------------
overriding function Get_Package
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Packages.UML_Package_Access is
begin
return
AMF.UML.Packages.UML_Package_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Package
(Self.Element)));
end Get_Package;
-----------------
-- Set_Package --
-----------------
overriding procedure Set_Package
(Self : not null access UML_Use_Case_Proxy;
To : AMF.UML.Packages.UML_Package_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Package
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Package;
-----------------------------------
-- Get_Owning_Template_Parameter --
-----------------------------------
overriding function Get_Owning_Template_Parameter
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is
begin
return
AMF.UML.Template_Parameters.UML_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owning_Template_Parameter
(Self.Element)));
end Get_Owning_Template_Parameter;
-----------------------------------
-- Set_Owning_Template_Parameter --
-----------------------------------
overriding procedure Set_Owning_Template_Parameter
(Self : not null access UML_Use_Case_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Owning_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owning_Template_Parameter;
----------------------------
-- Get_Template_Parameter --
----------------------------
overriding function Get_Template_Parameter
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is
begin
return
AMF.UML.Template_Parameters.UML_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Template_Parameter
(Self.Element)));
end Get_Template_Parameter;
----------------------------
-- Set_Template_Parameter --
----------------------------
overriding procedure Set_Template_Parameter
(Self : not null access UML_Use_Case_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Template_Parameter;
----------------------------------
-- Get_Owned_Template_Signature --
----------------------------------
overriding function Get_Owned_Template_Signature
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Template_Signatures.UML_Template_Signature_Access is
begin
return
AMF.UML.Template_Signatures.UML_Template_Signature_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Template_Signature
(Self.Element)));
end Get_Owned_Template_Signature;
----------------------------------
-- Set_Owned_Template_Signature --
----------------------------------
overriding procedure Set_Owned_Template_Signature
(Self : not null access UML_Use_Case_Proxy;
To : AMF.UML.Template_Signatures.UML_Template_Signature_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Owned_Template_Signature
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owned_Template_Signature;
--------------------------
-- Get_Template_Binding --
--------------------------
overriding function Get_Template_Binding
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Template_Bindings.Collections.Set_Of_UML_Template_Binding is
begin
return
AMF.UML.Template_Bindings.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Template_Binding
(Self.Element)));
end Get_Template_Binding;
-----------------
-- Get_Is_Leaf --
-----------------
overriding function Get_Is_Leaf
(Self : not null access constant UML_Use_Case_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Leaf
(Self.Element);
end Get_Is_Leaf;
-----------------
-- Set_Is_Leaf --
-----------------
overriding procedure Set_Is_Leaf
(Self : not null access UML_Use_Case_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Leaf
(Self.Element, To);
end Set_Is_Leaf;
---------------------------
-- Get_Redefined_Element --
---------------------------
overriding function Get_Redefined_Element
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element is
begin
return
AMF.UML.Redefinable_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefined_Element
(Self.Element)));
end Get_Redefined_Element;
------------------------------
-- Get_Redefinition_Context --
------------------------------
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefinition_Context
(Self.Element)));
end Get_Redefinition_Context;
----------------------------
-- All_Included_Use_Cases --
----------------------------
overriding function All_Included_Use_Cases
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Included_Use_Cases unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.All_Included_Use_Cases";
return All_Included_Use_Cases (Self);
end All_Included_Use_Cases;
------------------
-- All_Features --
------------------
overriding function All_Features
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Features unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.All_Features";
return All_Features (Self);
end All_Features;
-----------------
-- Conforms_To --
-----------------
overriding function Conforms_To
(Self : not null access constant UML_Use_Case_Proxy;
Other : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Conforms_To unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Conforms_To";
return Conforms_To (Self, Other);
end Conforms_To;
-------------
-- General --
-------------
overriding function General
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "General unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.General";
return General (Self);
end General;
-----------------------
-- Has_Visibility_Of --
-----------------------
overriding function Has_Visibility_Of
(Self : not null access constant UML_Use_Case_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Has_Visibility_Of unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Has_Visibility_Of";
return Has_Visibility_Of (Self, N);
end Has_Visibility_Of;
-------------
-- Inherit --
-------------
overriding function Inherit
(Self : not null access constant UML_Use_Case_Proxy;
Inhs : AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inherit unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Inherit";
return Inherit (Self, Inhs);
end Inherit;
-------------------------
-- Inheritable_Members --
-------------------------
overriding function Inheritable_Members
(Self : not null access constant UML_Use_Case_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inheritable_Members unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Inheritable_Members";
return Inheritable_Members (Self, C);
end Inheritable_Members;
----------------------
-- Inherited_Member --
----------------------
overriding function Inherited_Member
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inherited_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Inherited_Member";
return Inherited_Member (Self);
end Inherited_Member;
-----------------
-- Is_Template --
-----------------
overriding function Is_Template
(Self : not null access constant UML_Use_Case_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Template unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Is_Template";
return Is_Template (Self);
end Is_Template;
-------------------------
-- May_Specialize_Type --
-------------------------
overriding function May_Specialize_Type
(Self : not null access constant UML_Use_Case_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "May_Specialize_Type unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.May_Specialize_Type";
return May_Specialize_Type (Self, C);
end May_Specialize_Type;
------------------------
-- Exclude_Collisions --
------------------------
overriding function Exclude_Collisions
(Self : not null access constant UML_Use_Case_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Exclude_Collisions unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Exclude_Collisions";
return Exclude_Collisions (Self, Imps);
end Exclude_Collisions;
-------------------------
-- Get_Names_Of_Member --
-------------------------
overriding function Get_Names_Of_Member
(Self : not null access constant UML_Use_Case_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Get_Names_Of_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Get_Names_Of_Member";
return Get_Names_Of_Member (Self, Element);
end Get_Names_Of_Member;
--------------------
-- Import_Members --
--------------------
overriding function Import_Members
(Self : not null access constant UML_Use_Case_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Import_Members unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Import_Members";
return Import_Members (Self, Imps);
end Import_Members;
---------------------
-- Imported_Member --
---------------------
overriding function Imported_Member
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Imported_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Imported_Member";
return Imported_Member (Self);
end Imported_Member;
---------------------------------
-- Members_Are_Distinguishable --
---------------------------------
overriding function Members_Are_Distinguishable
(Self : not null access constant UML_Use_Case_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Members_Are_Distinguishable unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Members_Are_Distinguishable";
return Members_Are_Distinguishable (Self);
end Members_Are_Distinguishable;
------------------
-- Owned_Member --
------------------
overriding function Owned_Member
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Owned_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Owned_Member";
return Owned_Member (Self);
end Owned_Member;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.All_Owning_Packages";
return All_Owning_Packages (Self);
end All_Owning_Packages;
-----------------------------
-- Is_Distinguishable_From --
-----------------------------
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Use_Case_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Is_Distinguishable_From";
return Is_Distinguishable_From (Self, N, Ns);
end Is_Distinguishable_From;
---------------
-- Namespace --
---------------
overriding function Namespace
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Namespace";
return Namespace (Self);
end Namespace;
-----------------
-- Conforms_To --
-----------------
overriding function Conforms_To
(Self : not null access constant UML_Use_Case_Proxy;
Other : AMF.UML.Types.UML_Type_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Conforms_To unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Conforms_To";
return Conforms_To (Self, Other);
end Conforms_To;
------------------------
-- Is_Compatible_With --
------------------------
overriding function Is_Compatible_With
(Self : not null access constant UML_Use_Case_Proxy;
P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Compatible_With unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Is_Compatible_With";
return Is_Compatible_With (Self, P);
end Is_Compatible_With;
---------------------------
-- Is_Template_Parameter --
---------------------------
overriding function Is_Template_Parameter
(Self : not null access constant UML_Use_Case_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Template_Parameter unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Is_Template_Parameter";
return Is_Template_Parameter (Self);
end Is_Template_Parameter;
----------------------------
-- Parameterable_Elements --
----------------------------
overriding function Parameterable_Elements
(Self : not null access constant UML_Use_Case_Proxy)
return AMF.UML.Parameterable_Elements.Collections.Set_Of_UML_Parameterable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Parameterable_Elements unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Parameterable_Elements";
return Parameterable_Elements (Self);
end Parameterable_Elements;
------------------------
-- Is_Consistent_With --
------------------------
overriding function Is_Consistent_With
(Self : not null access constant UML_Use_Case_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Consistent_With unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Is_Consistent_With";
return Is_Consistent_With (Self, Redefinee);
end Is_Consistent_With;
-----------------------------------
-- Is_Redefinition_Context_Valid --
-----------------------------------
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Use_Case_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Redefinition_Context_Valid unimplemented");
raise Program_Error with "Unimplemented procedure UML_Use_Case_Proxy.Is_Redefinition_Context_Valid";
return Is_Redefinition_Context_Valid (Self, Redefined);
end Is_Redefinition_Context_Valid;
end AMF.Internals.UML_Use_Cases;
|
with AUnit.Assertions; use AUnit.Assertions;
package body Day.Test is
procedure Test_Part1 (T : in out AUnit.Test_Cases.Test_Case'Class) is
pragma Unreferenced (T);
orbits : constant Orbit_List.Vector := load_orbits("test1.txt");
count : constant Orbit_Checksum := orbit_count_checksum(orbits);
begin
Assert(count = 42, "Wrong orbit checksum, expected 42, got " & Orbit_Checksum'IMAGE(count));
end Test_Part1;
procedure Test_Part2 (T : in out AUnit.Test_Cases.Test_Case'Class) is
pragma Unreferenced (T);
-- orbits : constant Orbit_List.Vector := load_orbits("input.txt");
begin
-- Assert(orbit_count_checksum(orbits) = 0, "Wrong orbit checksum");
null;
end Test_Part2;
function Name (T : Test) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("Test Day package");
end Name;
procedure Register_Tests (T : in out Test) is
use AUnit.Test_Cases.Registration;
begin
Register_Routine (T, Test_Part1'Access, "Test Part 1");
Register_Routine (T, Test_Part2'Access, "Test Part 2");
end Register_Tests;
end Day.Test;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P P R I N T --
-- --
-- B o d y --
-- --
-- Copyright (C) 2008-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 Atree; use Atree;
with Einfo; use Einfo;
with Namet; use Namet;
with Nlists; use Nlists;
with Opt; use Opt;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Snames; use Snames;
with Uintp; use Uintp;
package body Pprint is
List_Name_Count : Integer := 0;
-- Counter used to prevent infinite recursion while computing name of
-- complex expressions.
----------------------
-- Expression_Image --
----------------------
function Expression_Image
(Expr : Node_Id;
Default : String) return String
is
From_Source : constant Boolean :=
Comes_From_Source (Expr)
and then not Opt.Debug_Generated_Code;
Append_Paren : Boolean := False;
Left : Node_Id := Original_Node (Expr);
Right : Node_Id := Original_Node (Expr);
function Expr_Name
(Expr : Node_Id;
Take_Prefix : Boolean := True;
Expand_Type : Boolean := True) return String;
-- Return string corresponding to Expr. If no string can be extracted,
-- return "...". If Take_Prefix is True, go back to prefix when needed,
-- otherwise only consider the right-hand side of an expression. If
-- Expand_Type is True and Expr is a type, try to expand Expr (an
-- internally generated type) into a user understandable name.
Max_List : constant := 3;
-- Limit number of list elements to dump
Max_Expr_Elements : constant := 24;
-- Limit number of elements in an expression for use by Expr_Name
Num_Elements : Natural := 0;
-- Current number of elements processed by Expr_Name
function List_Name
(List : Node_Id;
Add_Space : Boolean := True;
Add_Paren : Boolean := True) return String;
-- Return a string corresponding to List
---------------
-- List_Name --
---------------
function List_Name
(List : Node_Id;
Add_Space : Boolean := True;
Add_Paren : Boolean := True) return String
is
function Internal_List_Name
(List : Node_Id;
First : Boolean := True;
Add_Space : Boolean := True;
Add_Paren : Boolean := True;
Num : Natural := 1) return String;
-- ??? what does this do
------------------------
-- Internal_List_Name --
------------------------
function Internal_List_Name
(List : Node_Id;
First : Boolean := True;
Add_Space : Boolean := True;
Add_Paren : Boolean := True;
Num : Natural := 1) return String
is
function Prepend (S : String) return String;
-- ??? what does this do
-------------
-- Prepend --
-------------
function Prepend (S : String) return String is
begin
if Add_Space then
if Add_Paren then
return " (" & S;
else
return ' ' & S;
end if;
elsif Add_Paren then
return '(' & S;
else
return S;
end if;
end Prepend;
-- Start of processing for Internal_List_Name
begin
if not Present (List) then
if First or else not Add_Paren then
return "";
else
return ")";
end if;
elsif Num > Max_List then
if Add_Paren then
return ", ...)";
else
return ", ...";
end if;
end if;
-- ??? the Internal_List_Name calls can be factored out
if First then
return Prepend (Expr_Name (List)
& Internal_List_Name
(List => Next (List),
First => False,
Add_Paren => Add_Paren,
Num => Num + 1));
else
return ", " & Expr_Name (List)
& Internal_List_Name
(List => Next (List),
First => False,
Add_Paren => Add_Paren,
Num => Num + 1);
end if;
end Internal_List_Name;
-- Start of processing for List_Name
begin
-- Prevent infinite recursion by limiting depth to 3
if List_Name_Count > 3 then
return "...";
end if;
List_Name_Count := List_Name_Count + 1;
declare
Result : constant String :=
Internal_List_Name
(List => List,
Add_Space => Add_Space,
Add_Paren => Add_Paren);
begin
List_Name_Count := List_Name_Count - 1;
return Result;
end;
end List_Name;
---------------
-- Expr_Name --
---------------
function Expr_Name
(Expr : Node_Id;
Take_Prefix : Boolean := True;
Expand_Type : Boolean := True) return String
is
begin
Num_Elements := Num_Elements + 1;
if Num_Elements > Max_Expr_Elements then
return "...";
end if;
case Nkind (Expr) is
when N_Defining_Identifier
| N_Identifier
=>
return Ident_Image (Expr, Expression_Image.Expr, Expand_Type);
when N_Character_Literal =>
declare
Char : constant Int :=
UI_To_Int (Char_Literal_Value (Expr));
begin
if Char in 32 .. 127 then
return "'" & Character'Val (Char) & "'";
else
UI_Image (Char_Literal_Value (Expr));
return
"'\" & UI_Image_Buffer (1 .. UI_Image_Length) & "'";
end if;
end;
when N_Integer_Literal =>
UI_Image (Intval (Expr));
return UI_Image_Buffer (1 .. UI_Image_Length);
when N_Real_Literal =>
return Real_Image (Realval (Expr));
when N_String_Literal =>
return String_Image (Strval (Expr));
when N_Allocator =>
return "new " & Expr_Name (Expression (Expr));
when N_Aggregate =>
if Present (Sinfo.Expressions (Expr)) then
return
List_Name
(List => First (Sinfo.Expressions (Expr)),
Add_Space => False);
-- Do not return empty string for (others => <>) aggregate
-- of a componentless record type. At least one caller (the
-- recursive call below in the N_Qualified_Expression case)
-- is not prepared to deal with a zero-length result.
elsif Null_Record_Present (Expr)
or else not Present (First (Component_Associations (Expr)))
then
return ("(null record)");
else
return
List_Name
(List => First (Component_Associations (Expr)),
Add_Space => False,
Add_Paren => False);
end if;
when N_Extension_Aggregate =>
return "(" & Expr_Name (Ancestor_Part (Expr)) & " with "
& List_Name
(List => First (Sinfo.Expressions (Expr)),
Add_Space => False,
Add_Paren => False) & ")";
when N_Attribute_Reference =>
if Take_Prefix then
declare
Id : constant Attribute_Id :=
Get_Attribute_Id (Attribute_Name (Expr));
Str : constant String :=
Expr_Name (Prefix (Expr)) & "'"
& Get_Name_String (Attribute_Name (Expr));
N : Node_Id;
Ranges : List_Id;
begin
if (Id = Attribute_First or else Id = Attribute_Last)
and then Str (Str'First) = '$'
then
N := Associated_Node_For_Itype (Etype (Prefix (Expr)));
if Present (N) then
if Nkind (N) = N_Full_Type_Declaration then
N := Type_Definition (N);
end if;
if Nkind (N) = N_Subtype_Declaration then
Ranges :=
Constraints
(Constraint (Subtype_Indication (N)));
if List_Length (Ranges) = 1
and then
Nkind_In
(First (Ranges),
N_Range,
N_Real_Range_Specification,
N_Signed_Integer_Type_Definition)
then
if Id = Attribute_First then
return
Expression_Image
(Low_Bound (First (Ranges)), Str);
else
return
Expression_Image
(High_Bound (First (Ranges)), Str);
end if;
end if;
end if;
end if;
end if;
return Str;
end;
else
return "'" & Get_Name_String (Attribute_Name (Expr));
end if;
when N_Explicit_Dereference =>
-- Return "Foo" instead of "Parameter_Block.Foo.all"
if Hide_Parameter_Blocks
and then Nkind (Prefix (Expr)) = N_Selected_Component
and then Present (Etype (Prefix (Expr)))
and then Is_Access_Type (Etype (Prefix (Expr)))
and then Is_Param_Block_Component_Type (Etype (Prefix (Expr)))
then
return Expr_Name (Selector_Name (Prefix (Expr)));
elsif Take_Prefix then
return Expr_Name (Prefix (Expr)) & ".all";
else
return ".all";
end if;
when N_Expanded_Name
| N_Selected_Component
=>
if Take_Prefix then
return
Expr_Name (Prefix (Expr)) & "." &
Expr_Name (Selector_Name (Expr));
else
return "." & Expr_Name (Selector_Name (Expr));
end if;
when N_Component_Association =>
return "("
& List_Name
(List => First (Choices (Expr)),
Add_Space => False,
Add_Paren => False)
& " => " & Expr_Name (Expression (Expr)) & ")";
when N_If_Expression =>
declare
N : constant Node_Id := First (Sinfo.Expressions (Expr));
begin
return
"if " & Expr_Name (N) & " then "
& Expr_Name (Next (N)) & " else "
& Expr_Name (Next (Next (N)));
end;
when N_Qualified_Expression =>
declare
Mark : constant String :=
Expr_Name
(Subtype_Mark (Expr), Expand_Type => False);
Str : constant String := Expr_Name (Expression (Expr));
begin
if Str (Str'First) = '(' and then Str (Str'Last) = ')' then
return Mark & "'" & Str;
else
return Mark & "'(" & Str & ")";
end if;
end;
when N_Expression_With_Actions
| N_Unchecked_Expression
=>
return Expr_Name (Expression (Expr));
when N_Raise_Constraint_Error =>
if Present (Condition (Expr)) then
return
"[constraint_error when "
& Expr_Name (Condition (Expr)) & "]";
else
return "[constraint_error]";
end if;
when N_Raise_Program_Error =>
if Present (Condition (Expr)) then
return
"[program_error when "
& Expr_Name (Condition (Expr)) & "]";
else
return "[program_error]";
end if;
when N_Range =>
return
Expr_Name (Low_Bound (Expr)) & ".." &
Expr_Name (High_Bound (Expr));
when N_Slice =>
return
Expr_Name (Prefix (Expr)) & " (" &
Expr_Name (Discrete_Range (Expr)) & ")";
when N_And_Then =>
return
Expr_Name (Left_Opnd (Expr)) & " and then " &
Expr_Name (Right_Opnd (Expr));
when N_In =>
return
Expr_Name (Left_Opnd (Expr)) & " in " &
Expr_Name (Right_Opnd (Expr));
when N_Not_In =>
return
Expr_Name (Left_Opnd (Expr)) & " not in " &
Expr_Name (Right_Opnd (Expr));
when N_Or_Else =>
return
Expr_Name (Left_Opnd (Expr)) & " or else " &
Expr_Name (Right_Opnd (Expr));
when N_Op_And =>
return
Expr_Name (Left_Opnd (Expr)) & " and " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Or =>
return
Expr_Name (Left_Opnd (Expr)) & " or " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Xor =>
return
Expr_Name (Left_Opnd (Expr)) & " xor " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Eq =>
return
Expr_Name (Left_Opnd (Expr)) & " = " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Ne =>
return
Expr_Name (Left_Opnd (Expr)) & " /= " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Lt =>
return
Expr_Name (Left_Opnd (Expr)) & " < " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Le =>
return
Expr_Name (Left_Opnd (Expr)) & " <= " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Gt =>
return
Expr_Name (Left_Opnd (Expr)) & " > " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Ge =>
return
Expr_Name (Left_Opnd (Expr)) & " >= " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Add =>
return
Expr_Name (Left_Opnd (Expr)) & " + " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Subtract =>
return
Expr_Name (Left_Opnd (Expr)) & " - " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Multiply =>
return
Expr_Name (Left_Opnd (Expr)) & " * " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Divide =>
return
Expr_Name (Left_Opnd (Expr)) & " / " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Mod =>
return
Expr_Name (Left_Opnd (Expr)) & " mod " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Rem =>
return
Expr_Name (Left_Opnd (Expr)) & " rem " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Expon =>
return
Expr_Name (Left_Opnd (Expr)) & " ** " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Shift_Left =>
return
Expr_Name (Left_Opnd (Expr)) & " << " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Shift_Right | N_Op_Shift_Right_Arithmetic =>
return
Expr_Name (Left_Opnd (Expr)) & " >> " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Concat =>
return
Expr_Name (Left_Opnd (Expr)) & " & " &
Expr_Name (Right_Opnd (Expr));
when N_Op_Plus =>
return "+" & Expr_Name (Right_Opnd (Expr));
when N_Op_Minus =>
return "-" & Expr_Name (Right_Opnd (Expr));
when N_Op_Abs =>
return "abs " & Expr_Name (Right_Opnd (Expr));
when N_Op_Not =>
return "not (" & Expr_Name (Right_Opnd (Expr)) & ")";
when N_Parameter_Association =>
return Expr_Name (Explicit_Actual_Parameter (Expr));
when N_Type_Conversion =>
-- Most conversions are not very interesting (used inside
-- expanded checks to convert to larger ranges), so skip them.
return Expr_Name (Expression (Expr));
when N_Unchecked_Type_Conversion =>
-- Only keep the type conversion in complex cases
if not Is_Scalar_Type (Etype (Expr))
or else not Is_Scalar_Type (Etype (Expression (Expr)))
or else Is_Modular_Integer_Type (Etype (Expr)) /=
Is_Modular_Integer_Type (Etype (Expression (Expr)))
then
return Expr_Name (Subtype_Mark (Expr)) &
"(" & Expr_Name (Expression (Expr)) & ")";
else
return Expr_Name (Expression (Expr));
end if;
when N_Indexed_Component =>
if Take_Prefix then
return
Expr_Name (Prefix (Expr))
& List_Name (First (Sinfo.Expressions (Expr)));
else
return List_Name (First (Sinfo.Expressions (Expr)));
end if;
when N_Function_Call =>
-- If Default = "", it means we're expanding the name of
-- a gnat temporary (and not really a function call), so add
-- parentheses around function call to mark it specially.
if Default = "" then
return '('
& Expr_Name (Name (Expr))
& List_Name (First (Sinfo.Parameter_Associations (Expr)))
& ')';
else
return
Expr_Name (Name (Expr))
& List_Name
(First (Sinfo.Parameter_Associations (Expr)));
end if;
when N_Null =>
return "null";
when N_Others_Choice =>
return "others";
when others =>
return "...";
end case;
end Expr_Name;
-- Start of processing for Expression_Name
begin
if not From_Source then
declare
S : constant String := Expr_Name (Expr);
begin
if S = "..." then
return Default;
else
return S;
end if;
end;
end if;
-- Compute left (start) and right (end) slocs for the expression
-- Consider using Sinput.Sloc_Range instead, except that it does not
-- work properly currently???
loop
case Nkind (Left) is
when N_And_Then
| N_Binary_Op
| N_Membership_Test
| N_Or_Else
=>
Left := Original_Node (Left_Opnd (Left));
when N_Attribute_Reference
| N_Expanded_Name
| N_Explicit_Dereference
| N_Indexed_Component
| N_Reference
| N_Selected_Component
| N_Slice
=>
Left := Original_Node (Prefix (Left));
when N_Defining_Program_Unit_Name
| N_Designator
| N_Function_Call
=>
Left := Original_Node (Name (Left));
when N_Range =>
Left := Original_Node (Low_Bound (Left));
when N_Type_Conversion =>
Left := Original_Node (Subtype_Mark (Left));
-- For any other item, quit loop
when others =>
exit;
end case;
end loop;
loop
case Nkind (Right) is
when N_And_Then
| N_Membership_Test
| N_Op
| N_Or_Else
=>
Right := Original_Node (Right_Opnd (Right));
when N_Expanded_Name
| N_Selected_Component
=>
Right := Original_Node (Selector_Name (Right));
when N_Designator =>
Right := Original_Node (Identifier (Right));
when N_Defining_Program_Unit_Name =>
Right := Original_Node (Defining_Identifier (Right));
when N_Range =>
Right := Original_Node (High_Bound (Right));
when N_Parameter_Association =>
Right := Original_Node (Explicit_Actual_Parameter (Right));
when N_Indexed_Component =>
Right := Original_Node (Last (Sinfo.Expressions (Right)));
Append_Paren := True;
when N_Function_Call =>
if Present (Sinfo.Parameter_Associations (Right)) then
declare
Rover : Node_Id;
Found : Boolean;
begin
-- Avoid source position confusion associated with
-- parameters for which Comes_From_Source is False.
Rover := First (Sinfo.Parameter_Associations (Right));
Found := False;
while Present (Rover) loop
if Comes_From_Source (Original_Node (Rover)) then
Right := Original_Node (Rover);
Append_Paren := True;
Found := True;
end if;
Next (Rover);
end loop;
-- Quit loop if no Comes_From_Source parameters
exit when not Found;
end;
-- Quit loop if no parameters
else
exit;
end if;
when N_Quantified_Expression =>
Right := Original_Node (Condition (Right));
-- For all other items, quit the loop
when others =>
exit;
end case;
end loop;
declare
Scn : Source_Ptr := Original_Location (Sloc (Left));
End_Sloc : constant Source_Ptr :=
Original_Location (Sloc (Right));
Src : constant Source_Buffer_Ptr :=
Source_Text (Get_Source_File_Index (Scn));
begin
if Scn > End_Sloc then
return Default;
end if;
declare
Buffer : String (1 .. Natural (End_Sloc - Scn));
Index : Natural := 0;
Skipping_Comment : Boolean := False;
Underscore : Boolean := False;
begin
if Right /= Expr then
while Scn < End_Sloc loop
case Src (Scn) is
when ' '
| ASCII.HT
=>
if not Skipping_Comment and then not Underscore then
Underscore := True;
Index := Index + 1;
Buffer (Index) := ' ';
end if;
-- CR/LF/FF is the end of any comment
when ASCII.CR
| ASCII.FF
| ASCII.LF
=>
Skipping_Comment := False;
when others =>
Underscore := False;
if not Skipping_Comment then
-- Ignore comment
if Src (Scn) = '-' and then Src (Scn + 1) = '-' then
Skipping_Comment := True;
else
Index := Index + 1;
Buffer (Index) := Src (Scn);
end if;
end if;
end case;
Scn := Scn + 1;
end loop;
end if;
if Index < 1 then
declare
S : constant String := Expr_Name (Right);
begin
if S = "..." then
return Default;
else
return S;
end if;
end;
elsif Append_Paren then
return Buffer (1 .. Index) & Expr_Name (Right, False) & ')';
else
return Buffer (1 .. Index) & Expr_Name (Right, False);
end if;
end;
end;
end Expression_Image;
end Pprint;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013-2014, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
pragma Ada_2012;
private with Ada.Finalization;
limited with League.JSON.Documents;
limited with League.JSON.Values;
with League.Holders;
private with Matreshka.JSON_Types;
package League.JSON.Arrays is
pragma Preelaborate;
type JSON_Array is tagged private
with Iterator_Element => League.JSON.Values.JSON_Value,
Constant_Indexing => Element;
pragma Preelaborable_Initialization (JSON_Array);
Empty_JSON_Array : constant JSON_Array;
procedure Append
(Self : in out JSON_Array'Class; Value : League.JSON.Values.JSON_Value);
-- Inserts value at the end of the array.
procedure Delete (Self : in out JSON_Array'Class; Index : Positive);
-- Removes the value at index position Index. Index must be a valid index
-- position in the array.
procedure Delete_First (Self : in out JSON_Array'Class);
-- Removes the first item in the array.
procedure Delete_Last (Self : in out JSON_Array'Class);
-- Removes the last item in the array.
function Element
(Self : JSON_Array'Class;
Index : Positive) return League.JSON.Values.JSON_Value;
-- Returns a JSON_Value representing the value for index Index.
function First_Element
(Self : JSON_Array'Class) return League.JSON.Values.JSON_Value;
-- Returns the first value stored in the array.
procedure Insert
(Self : in out JSON_Array'Class;
Index : Positive;
Value : League.JSON.Values.JSON_Value);
-- Inserts value at index position Index in the array. If Index is 1, the
-- value is prepended to the array. If Index is large when Length, the
-- value is appended to the array.
function Is_Empty (Self : JSON_Array'Class) return Boolean;
-- Returns true if the object is empty.
function Last_Element
(Self : JSON_Array'Class) return League.JSON.Values.JSON_Value;
-- Returns the last value stored in the array.
function Length (Self : JSON_Array'Class) return Natural;
-- Returns the number of values stored in the array.
procedure Prepend
(Self : in out JSON_Array'Class; Value : League.JSON.Values.JSON_Value);
-- Inserts value at the beginning of the array.
procedure Replace
(Self : in out JSON_Array'Class;
Index : Positive;
Value : League.JSON.Values.JSON_Value);
-- Replaces the item at index position Index with Value. Index must be a
-- valid index position in the array.
function Take
(Self : in out JSON_Array'Class;
Index : Positive) return League.JSON.Values.JSON_Value;
-- Removes the item at index position Index and returns it. Index must be a
-- valid index position in the array.
function To_JSON_Value
(Self : JSON_Array'Class) return League.JSON.Values.JSON_Value;
-- Converts JSON_Array into JSON_Value.
function To_JSON_Document
(Self : JSON_Array'Class) return League.JSON.Documents.JSON_Document;
-- Converts JSON_Array into JSON_Document.
function First
(Self : aliased JSON_Array)
return League.Holders.Iterable_Holder_Cursors.Cursor'Class;
-- Return cursor used in iterable holders
private
type JSON_Array is new Ada.Finalization.Controlled with record
Data : Matreshka.JSON_Types.Shared_JSON_Array_Access
:= Matreshka.JSON_Types.Empty_Shared_JSON_Array'Access;
end record;
overriding procedure Adjust (Self : in out JSON_Array);
overriding procedure Finalize (Self : in out JSON_Array);
Empty_JSON_Array : constant JSON_Array
:= (Ada.Finalization.Controlled with
Data => Matreshka.JSON_Types.Empty_Shared_JSON_Array'Access);
end League.JSON.Arrays;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ B O O L --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
package System.Val_Bool is
pragma Preelaborate;
function Value_Boolean (Str : String) return Boolean;
-- Computes Boolean'Value (Str)
end System.Val_Bool;
|
-- { dg-do compile }
-- { dg-options "-gnatd.h" }
with Concat1_Pkg; use Concat1_Pkg;
package Concat1 is
C : constant Natural := Id_For ("_" & Image_Of);
end Concat1;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Named_Elements;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces;
with AMF.UML.Packages.Collections;
with AMF.UML.Parameter_Sets;
with AMF.UML.Parameters.Collections;
with AMF.UML.String_Expressions;
with AMF.Visitors;
package AMF.Internals.UML_Parameter_Sets is
type UML_Parameter_Set_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Parameter_Sets.UML_Parameter_Set with null record;
overriding function Get_Condition
(Self : not null access constant UML_Parameter_Set_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of ParameterSet::condition.
--
-- Constraint that should be satisfied for the owner of the parameters in
-- an input parameter set to start execution using the values provided for
-- those parameters, or the owner of the parameters in an output parameter
-- set to end execution providing the values for those parameters, if all
-- preconditions and conditions on input parameter sets were satisfied.
overriding function Get_Parameter
(Self : not null access constant UML_Parameter_Set_Proxy)
return AMF.UML.Parameters.Collections.Set_Of_UML_Parameter;
-- Getter of ParameterSet::parameter.
--
-- Parameters in the parameter set.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Parameter_Set_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Parameter_Set_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Parameter_Set_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Parameter_Set_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Parameter_Set_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function All_Owning_Packages
(Self : not null access constant UML_Parameter_Set_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Parameter_Set_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Parameter_Set_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding procedure Enter_Element
(Self : not null access constant UML_Parameter_Set_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Parameter_Set_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Parameter_Set_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Parameter_Sets;
|
---------------------------------------------------------------------------------
-- Copyright 2004-2005 © Luke A. Guest
--
-- This code is to be used for tutorial purposes only.
-- You may not redistribute this code in any form without my express permission.
---------------------------------------------------------------------------------
with SDL.Types; use SDL.Types;
with SDL.Keysym; use SDL.Keysym;
with SDL.Video; use SDL.Video;
with SDL.Timer;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Camera;
with Vector3;
with Matrix3x3;
with Matrix4x4;
use type Matrix3x3.Object;
use type Matrix4x4.Object;
use type Vector3.Object;
package Example is
procedure PrintGLInfo;
procedure PrintUsage;
procedure CalculateFPS;
function Initialise return Boolean;
procedure Uninitialise;
procedure Update;--(Ticks : in Integer);
procedure Draw;
function GetTitle return String;
function GetWidth return Integer;
function GetHeight return Integer;
function GetBitsPerPixel return Integer;
procedure SetLastTickCount(Ticks : in Integer);
procedure SetSurface(Surface : in SDL.Video.Surface_Ptr);
function GetSurface return SDL.Video.Surface_Ptr;
procedure SetKey(Key : in SDL.Keysym.Key; Down : in Boolean);
procedure SetActive(Active : in Boolean);
function IsActive return Boolean;
procedure SetQuit(Quit : in Boolean);
function Quit return Boolean;
private
type KeysArray is array (SDL.Keysym.K_FIRST .. SDL.Keysym.K_LAST) of Boolean;
Title : String := "Bounding Volume in Ada/SDL";
Width : Integer := 640;
Height : Integer := 480;
BitsPerPixel : Integer := 16;
IsFullScreen : Boolean := False;
Keys : KeysArray := (others => False);
IsVisible : Boolean := False;
LastTickCount : Integer := 0;
ScreenSurface : SDL.Video.Surface_Ptr := null;
AppActive : Boolean := True;
AppQuit : Boolean := False;
HaveCVA : Boolean := False;
UseCVA : Boolean := True;
PressedF2 : Boolean := False;
PressedF3 : Boolean := False;
PressedF4 : Boolean := False;
PressedF5 : Boolean := False;
PressedL : Boolean := False;
PressedC : Boolean := False;
PressedS : Boolean := False;
PressedW : Boolean := False;
LightingOn : Boolean := True;
CameraMoving : Boolean := False;
SmoothShadingOn : Boolean := True;
WireframeOn : Boolean := False;
AABBs_On : Boolean := False;
OBBs_On : Boolean := False;
Spheres_On : Boolean := False;
XSpeed : Float := 0.0;
YSpeed : Float := 0.0;
LastElapsedTime : Float := 0.0;
FrameCount : Integer := 0;
FPS : Float := 0.0;
ViewCamera : Camera.Object := Camera.Create(0.0, 0.0, 6.0, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0);
end Example;
|
with Ada.Command_Line;
with Ada.Text_IO;
with ZMQ;
procedure HWServer is
function Main return Ada.Command_Line.Exit_Status
is
Context : constant ZMQ.Context_Type := ZMQ.New_Context;
Responder : constant ZMQ.Socket_Type'Class := Context.New_Socket (ZMQ.ZMQ_REP);
begin
Responder.Bind ("tcp://*:5555");
loop
declare
Dummy : String := Responder.Recv;
begin
Ada.Text_IO.Put_Line ("Received hello");
delay 1.0;
Responder.Send ("World");
end;
end loop;
return 0;
end Main;
begin
Ada.Command_Line.Set_Exit_Status (Main);
end HWServer;
|
w←1 2 3 1 2 3 4 1
((⍳⍨w)=⍳⍴w)/w
1 2 3 4
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . C A L E N D A R . T I M E _ I O --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1999-2001 Ada Core Technologies, 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, 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. --
-- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This package augments standard Ada.Text_IO with facilities for input
-- and output of time values in standardized format.
package GNAT.Calendar.Time_IO is
Picture_Error : exception;
type Picture_String is new String;
-- This is a string to describe date and time output format. The string is
-- a set of standard character and special tag that are replaced by the
-- corresponding values. It follows the GNU Date specification. Here are
-- the recognized directives :
--
-- % a literal %
-- n a newline
-- t a horizontal tab
--
-- Time fields:
--
-- %H hour (00..23)
-- %I hour (01..12)
-- %k hour ( 0..23)
-- %l hour ( 1..12)
-- %M minute (00..59)
-- %p locale's AM or PM
-- %r time, 12-hour (hh:mm:ss [AP]M)
-- %s seconds since 1970-01-01 00:00:00 UTC
-- (a nonstandard extension)
-- %S second (00..59)
-- %T time, 24-hour (hh:mm:ss)
--
-- Date fields:
--
-- %a locale's abbreviated weekday name (Sun..Sat)
-- %A locale's full weekday name, variable length
-- (Sunday..Saturday)
-- %b locale's abbreviated month name (Jan..Dec)
-- %B locale's full month name, variable length
-- (January..December)
-- %c locale's date and time (Sat Nov 04 12:02:33 EST 1989)
-- %d day of month (01..31)
-- %D date (mm/dd/yy)
-- %h same as %b
-- %j day of year (001..366)
-- %m month (01..12)
-- %U week number of year with Sunday as first day of week
-- (00..53)
-- %w day of week (0..6) with 0 corresponding to Sunday
-- %W week number of year with Monday as first day of week
-- (00..53)
-- %x locale's date representation (mm/dd/yy)
-- %y last two digits of year (00..99)
-- %Y year (1970...)
--
-- By default, date pads numeric fields with zeroes. GNU date
-- recognizes the following nonstandard numeric modifiers:
--
-- - (hyphen) do not pad the field
-- _ (underscore) pad the field with spaces
ISO_Date : constant Picture_String;
-- This format follow the ISO 8601 standard. The format is "YYYY-MM-DD",
-- four digits year, month and day number separated by minus.
US_Date : constant Picture_String;
-- This format is the common US date format: "MM/DD/YY",
-- month and day number, two digits year separated by slashes.
European_Date : constant Picture_String;
-- This format is the common European date format: "DD/MM/YY",
-- day and month number, two digits year separated by slashes.
function Image
(Date : Ada.Calendar.Time;
Picture : Picture_String)
return String;
-- Return Date as a string with format Picture.
-- raise Picture_Error if picture string is wrong
procedure Put_Time
(Date : Ada.Calendar.Time;
Picture : Picture_String);
-- Put Date with format Picture.
-- raise Picture_Error if picture string is wrong
private
ISO_Date : constant Picture_String := "%Y-%m-%d";
US_Date : constant Picture_String := "%m/%d/%y";
European_Date : constant Picture_String := "%d/%m/%y";
end GNAT.Calendar.Time_IO;
|
--
-- Copyright 2018 The wookey project team <wookey@ssi.gouv.fr>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
with ewok.tasks_shared; use ewok.tasks_shared;
with ewok.devices_shared;
with ewok.ipc;
with ewok.exported.dma;
with ewok.dma_shared;
with ewok.mpu;
with soc;
with soc.layout;
package ewok.tasks
with spark_mode => off
is
subtype t_task_name is string (1 .. 10);
type t_task_state is (
-- No task in this slot
TASK_STATE_EMPTY,
-- Task can be elected by the scheduler with its standard priority
-- or an ISR is ready for execution
TASK_STATE_RUNNABLE,
-- Force the scheduler to choose that task
TASK_STATE_FORCED,
-- Pending syscall. Task can't be scheduled.
TASK_STATE_SVC_BLOCKED,
-- An ISR is finished
TASK_STATE_ISR_DONE,
-- Task currently has nothing to do, not schedulable
TASK_STATE_IDLE,
-- Task is sleeping
TASK_STATE_SLEEPING,
-- Task is deeply sleeping
TASK_STATE_SLEEPING_DEEP,
-- Task has generated an exception (memory fault, etc.), not
-- schedulable anymore
TASK_STATE_FAULT,
-- Task has return from its main() function. Yet its ISR handlers can
-- still be executed if needed
TASK_STATE_FINISHED,
-- Task has emitted a blocking send(target) and is waiting for that
-- the EndPoint shared with the receiver gets ready
TASK_STATE_IPC_SEND_BLOCKED,
-- Task has emitted a blocking recv(target) and is waiting for a
-- send()
TASK_STATE_IPC_RECV_BLOCKED,
-- Task has emitted a blocking send(target) and is waiting recv()
-- acknowledgement from the target task
TASK_STATE_IPC_WAIT_ACK,
-- Task has entered in a critical section. Related ISRs can't be executed
TASK_STATE_LOCKED);
type t_task_type is
(-- Kernel task
TASK_TYPE_KERNEL,
-- User task, being executed in user mode, with restricted access
TASK_TYPE_USER);
type t_main_context is record
frame_a : ewok.t_stack_frame_access;
end record;
type t_isr_context is record
entry_point : system_address;
device_id : ewok.devices_shared.t_device_id;
sched_policy : ewok.tasks_shared.t_scheduling_post_isr;
frame_a : ewok.t_stack_frame_access;
end record;
--
-- Tasks
--
MAX_DEVS_PER_TASK : constant := 10;
MAX_DMAS_PER_TASK : constant := 8;
MAX_INTERRUPTS_PER_TASK : constant := 8;
MAX_DMA_SHM_PER_TASK : constant := 4;
type t_registered_dma_index_list is array (unsigned_32 range <>) of
ewok.dma_shared.t_user_dma_index;
type t_dma_shm_info_list is array (unsigned_32 range <>) of
ewok.exported.dma.t_dma_shm_info;
type t_device_id_list is array (unsigned_8 range <>) of
ewok.devices_shared.t_device_id;
type t_task is record
name : t_task_name;
entry_point : system_address;
ttype : t_task_type;
mode : t_task_mode;
id : ewok.tasks_shared.t_task_id;
slot : unsigned_8; -- 1: first slot (0: unused)
num_slots : unsigned_8;
prio : unsigned_8;
#if CONFIG_KERNEL_DOMAIN
domain : unsigned_8;
#end if;
#if CONFIG_KERNEL_SCHED_DEBUG
count : unsigned_32;
force_count : unsigned_32;
isr_count : unsigned_32;
#end if;
#if CONFIG_KERNEL_DMA_ENABLE
num_dma_shms : unsigned_32 range 0 .. MAX_DMA_SHM_PER_TASK;
dma_shm : t_dma_shm_info_list (1 .. MAX_DMA_SHM_PER_TASK);
num_dma_id : unsigned_32 range 0 .. MAX_DMAS_PER_TASK;
dma_id : t_registered_dma_index_list (1 .. MAX_DMAS_PER_TASK);
#end if;
num_devs : unsigned_8 range 0 .. MAX_DEVS_PER_TASK;
num_devs_mounted : unsigned_8 range 0 .. ewok.mpu.MAX_DEVICE_REGIONS;
device_id : t_device_id_list (1 .. MAX_DEVS_PER_TASK);
mounted_device : t_device_id_list (ewok.mpu.device_regions'range);
init_done : boolean;
data_slot_start : system_address;
data_slot_end : system_address;
txt_slot_start : system_address;
txt_slot_end : system_address;
stack_bottom : system_address;
stack_top : system_address;
stack_size : unsigned_16;
state : t_task_state;
isr_state : t_task_state;
ipc_endpoints : ewok.ipc.t_endpoints (ewok.tasks_shared.t_task_id'range);
ctx : aliased t_main_context;
isr_ctx : aliased t_isr_context;
end record;
type t_task_access is access all t_task;
type t_task_array is array (t_task_id range <>) of aliased t_task;
-------------
-- Globals --
-------------
-- The list of the running tasks
tasks_list : t_task_array (ID_APP1 .. ID_KERNEL);
softirq_task_name : aliased t_task_name := "SOFTIRQ" & " ";
idle_task_name : aliased t_task_name := "IDLE" & " ";
---------------
-- Functions --
---------------
pragma assertion_policy (pre => IGNORE, post => IGNORE, assert => IGNORE);
procedure idle_task with no_return;
procedure finished_task with no_return;
-- create various task's stack
-- preconditions :
-- Here we check that generated headers, defining stack address and
-- program counter of various stack are valid for the currently
-- supported SoC. This is a sanitizing function for generated files.
procedure create_stack
(sp : in system_address;
pc : in system_address;
params : in ewok.t_parameters;
frame_a : out ewok.t_stack_frame_access)
with
-- precondition 1 : stack pointer must be in RAM
pre =>
(
(sp >= soc.layout.USER_RAM_BASE and
sp <= (soc.layout.USER_RAM_BASE + soc.layout.USER_RAM_SIZE)) or
(sp >= soc.layout.KERNEL_RAM_BASE and
sp <= (soc.layout.KERNEL_RAM_BASE + soc.layout.KERNEL_RAM_SIZE))
) and (
-- precondition 2 : program counter must be in flash
pc >= soc.layout.FLASH_BASE and
pc <= soc.layout.FLASH_BASE + soc.layout.FLASH_SIZE
),
global => ( in_out => tasks_list );
procedure set_default_values (tsk : out t_task);
procedure init_softirq_task;
procedure init_idle_task;
procedure init_apps;
function is_real_user (id : ewok.tasks_shared.t_task_id) return boolean;
function get_task (id : ewok.tasks_shared.t_task_id)
return t_task_access
with inline;
#if CONFIG_KERNEL_DOMAIN
function get_domain (id : in ewok.tasks_shared.t_task_id)
return unsigned_8
with inline;
#end if;
function get_task_id (name : t_task_name)
return ewok.tasks_shared.t_task_id;
procedure set_state
(id : ewok.tasks_shared.t_task_id;
mode : t_task_mode;
state : t_task_state)
with inline;
function get_state
(id : ewok.tasks_shared.t_task_id;
mode : t_task_mode)
return t_task_state
with inline;
function get_mode
(id : in ewok.tasks_shared.t_task_id)
return t_task_mode
with
inline,
global => null;
procedure set_mode
(id : in ewok.tasks_shared.t_task_id;
mode : in ewok.tasks_shared.t_task_mode)
with
inline,
global => ( in_out => tasks_list );
function is_ipc_waiting
(id : in ewok.tasks_shared.t_task_id)
return boolean;
-- Set return value inside a syscall
-- Note: mode must be defined as a task can do a syscall while in ISR mode
-- or in THREAD mode
procedure set_return_value
(id : in ewok.tasks_shared.t_task_id;
mode : in t_task_mode;
val : in unsigned_32)
with inline;
procedure task_init
with
convention => c,
export => true,
external_name => "task_init",
global => null;
function is_init_done
(id : ewok.tasks_shared.t_task_id)
return boolean;
procedure append_device
(id : in ewok.tasks_shared.t_task_id;
dev_id : in ewok.devices_shared.t_device_id;
descriptor : out unsigned_8;
success : out boolean)
with
post => (if success = false then
descriptor = 0
else
descriptor > 0 and
descriptor < tasks_list(id).device_id'last
);
procedure remove_device
(id : in ewok.tasks_shared.t_task_id;
dev_id : in ewok.devices_shared.t_device_id;
success : out boolean);
function is_mounted
(id : in ewok.tasks_shared.t_task_id;
dev_id : in ewok.devices_shared.t_device_id)
return boolean;
procedure mount_device
(id : in ewok.tasks_shared.t_task_id;
dev_id : in ewok.devices_shared.t_device_id;
success : out boolean);
procedure unmount_device
(id : in ewok.tasks_shared.t_task_id;
dev_id : in ewok.devices_shared.t_device_id;
success : out boolean);
end ewok.tasks;
|
with
Interfaces.C.Strings,
System;
use type
Interfaces.C.Strings.chars_ptr,
System.Address;
package body FLTK.Widgets.Inputs.Integer is
procedure int_input_set_draw_hook
(W, D : in System.Address);
pragma Import (C, int_input_set_draw_hook, "int_input_set_draw_hook");
pragma Inline (int_input_set_draw_hook);
procedure int_input_set_handle_hook
(W, H : in System.Address);
pragma Import (C, int_input_set_handle_hook, "int_input_set_handle_hook");
pragma Inline (int_input_set_handle_hook);
function new_fl_int_input
(X, Y, W, H : in Interfaces.C.int;
Text : in Interfaces.C.char_array)
return System.Address;
pragma Import (C, new_fl_int_input, "new_fl_int_input");
pragma Inline (new_fl_int_input);
procedure free_fl_int_input
(F : in System.Address);
pragma Import (C, free_fl_int_input, "free_fl_int_input");
pragma Inline (free_fl_int_input);
procedure fl_int_input_draw
(W : in System.Address);
pragma Import (C, fl_int_input_draw, "fl_int_input_draw");
pragma Inline (fl_int_input_draw);
function fl_int_input_handle
(W : in System.Address;
E : in Interfaces.C.int)
return Interfaces.C.int;
pragma Import (C, fl_int_input_handle, "fl_int_input_handle");
pragma Inline (fl_int_input_handle);
procedure Finalize
(This : in out Integer_Input) is
begin
if This.Void_Ptr /= System.Null_Address and then
This in Integer_Input'Class
then
free_fl_int_input (This.Void_Ptr);
This.Void_Ptr := System.Null_Address;
end if;
Finalize (Input (This));
end Finalize;
package body Forge is
function Create
(X, Y, W, H : in Standard.Integer;
Text : in String)
return Integer_Input is
begin
return This : Integer_Input do
This.Void_Ptr := new_fl_int_input
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.To_C (Text));
fl_widget_set_user_data
(This.Void_Ptr,
Widget_Convert.To_Address (This'Unchecked_Access));
int_input_set_draw_hook (This.Void_Ptr, Draw_Hook'Address);
int_input_set_handle_hook (This.Void_Ptr, Handle_Hook'Address);
end return;
end Create;
end Forge;
function Get_Value
(This : in Integer_Input)
return Standard.Integer
is
Ptr : Interfaces.C.Strings.chars_ptr := fl_input_get_value (This.Void_Ptr);
begin
if Ptr = Interfaces.C.Strings.Null_Ptr then
return 0;
else
return Standard.Integer'Value (Interfaces.C.Strings.Value (Ptr));
end if;
end Get_Value;
procedure Draw
(This : in out Integer_Input) is
begin
fl_int_input_draw (This.Void_Ptr);
end Draw;
function Handle
(This : in out Integer_Input;
Event : in Event_Kind)
return Event_Outcome is
begin
return Event_Outcome'Val
(fl_int_input_handle (This.Void_Ptr, Event_Kind'Pos (Event)));
end Handle;
end FLTK.Widgets.Inputs.Integer;
|
------------------------------------------------------------------------------
-- --
-- tiled-code-gen --
-- --
-- Copyright (C) 2018 Fabien Chouteau --
-- --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Command_Line;
with Ada.Text_IO;
with Ada.Directories; use Ada.Directories;
with TCG.Palette;
with TCG.Maps;
with TCG.Maps.Render;
with TCG.Maps.List;
with TCG.Outputs.PDF;
with TCG.Outputs.GESTE;
with TCG.Outputs.LibGBA;
with TCG.Outputs.RSTE;
with TCG.Tilesets;
use TCG;
with GNAT.Command_Line; use GNAT.Command_Line;
with GNAT.Strings; use GNAT.Strings;
with GNATCOLL.Utils; use GNATCOLL.Utils;
procedure Tiled_Code_Gen is
List : Maps.List.List;
Config : Command_Line_Configuration;
PDF_Enabled : aliased Boolean;
GESTE_Enabled : aliased Boolean;
RSTE_Enabled : aliased Boolean;
GBA_Enabled : aliased Boolean;
BMP_Enabled : aliased Boolean;
Source_Out_Dir : aliased String_Access := new String'("src");
Doc_Out_Dir : aliased String_Access := new String'("doc");
Color_Format_Str : aliased String_Access := new String'("RGB565");
Color_Format : Palette.Output_Color_Format;
Root_Package : aliased String_Access := new String'("Game_Assets");
Tileset : Tilesets.Tileset_Id := Tilesets.Invalid_Tileset;
use type Tilesets.Tileset_Id;
begin
declare
begin
Define_Switch
(Config, PDF_Enabled'Access, "-p",
Long_Switch => "--pdf",
Help => "Generate PDF documentation");
Define_Switch
(Config, GESTE_Enabled'Access, "-g",
Long_Switch => "--geste",
Help => "Generate code for GEneric Sprite and Tile Engine");
Define_Switch
(Config, RSTE_Enabled'Access, "",
Long_Switch => "--rste",
Help => "Generate code for Rust Sprite and Tile Engine");
Define_Switch
(Config, GBA_Enabled'Access, "",
Long_Switch => "--libgba",
Help => "Generate code for Rust Sprite and Tile Engine");
Define_Switch
(Config, BMP_Enabled'Access, "-b",
Long_Switch => "--bmp",
Help => "Generate bitmap images of the maps");
Define_Switch
(Config, Root_Package'Access, "-r:",
Long_Switch => "--root-package-name=",
Help => "Name of the root package of generated sources (default: " &
Root_Package.all & ")");
Define_Switch
(Config, Source_Out_Dir'Access, "-o:",
Long_Switch => "--source-out-dir=",
Help => "Output directory for the generated sources (default: " &
Source_Out_Dir .all & ")");
Define_Switch
(Config, Doc_Out_Dir'Access, "-d:",
Long_Switch => "--doc-out-dir=",
Help => "Output directory for the generated documentation " &
"(default: " & Doc_Out_Dir.all & ")");
Define_Switch
(Config, Color_Format_Str'Access, "-f:",
Long_Switch => "--color-format=",
Help => "Color format used in generated sources (" &
Palette.Supported_Formats & ") (default: " &
Color_Format_Str.all & ")");
Set_Usage
(Config,
"[switches] maps (.tmx) or tilesets (.tsx)",
"Tiled-Code-Gen, a code generator for Tiled the map editor");
Getopt (Config);
exception
when GNAT.Command_Line.Invalid_Switch =>
Ada.Command_Line.Set_Exit_Status (1);
return;
when GNAT.Command_Line.Exit_From_Command_Line =>
return;
end;
-- Checking output color format
if Palette.Format_Supported (Color_Format_Str.all) then
Color_Format := Palette.Convert (Color_Format_Str.all);
else
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error,
"Unsuported color format: " & Color_Format_Str.all);
Ada.Command_Line.Set_Exit_Status (1);
return;
end if;
-- Processing each Tiled maps
loop
declare
Arg : constant String := Get_Argument (Do_Expansion => True);
begin
exit when Arg'Length = 0;
if Ends_With (Arg, ".tmx") then
List.Append (TCG.Maps.Load (Arg, Base_Name (Arg)));
elsif Ends_With (Arg, ".tsx") then
Tileset := Tilesets.Load (Arg);
Tilesets.Fill_Master_Tileset (Tileset);
else
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error,
"Unknown file format: '" & Arg & "'");
end if;
end;
end loop;
if List.Is_Empty and then Tileset = Tilesets.Invalid_Tileset then
Display_Help (Config);
return;
end if;
for Map of List loop
TCG.Maps.Fill_Master_Tileset (Map);
end loop;
if GESTE_Enabled then
Outputs.GESTE.Gen_GESTE_Source (Directory => Source_Out_Dir.all,
Root_Package_Name => Root_Package.all,
Format => Color_Format,
Map_List => List);
end if;
if GBA_Enabled then
Outputs.LibGBA.Gen_LibGBA_Source
(Directory => Source_Out_Dir.all,
Root_Package_Name => Root_Package.all,
Map_List => List);
end if;
if RSTE_Enabled then
Outputs.RSTE.Gen_RSTE_Source (Directory => Source_Out_Dir.all,
Root_Module_Name => Root_Package.all,
Format => Color_Format,
Map_List => List);
end if;
if PDF_Enabled then
Outputs.PDF.Gen_PDF_Doc (Doc_Out_Dir.all, "doc.pdf", List);
end if;
if BMP_Enabled then
for M of List loop
TCG.Maps.Render.To_BMP
(M,
Path => Compose (Doc_Out_Dir.all, Maps.Name (M) & ".bmp"),
Background => (255, 255, 255, 255));
end loop;
end if;
if not GESTE_Enabled
and then
not GBA_Enabled
and then
not PDF_Enabled
and then
not BMP_Enabled
then
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error, "Warning: no generator enabled.");
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error, "Use --help to see the list of options.");
end if;
end Tiled_Code_Gen;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ U N B O U N D E D . W I D E _ H A S H --
-- --
-- S p e c --
-- --
-- This specification is adapted from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
with Ada.Containers;
function Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash
(Key : Unbounded_Wide_Wide_String) return Containers.Hash_Type;
pragma Preelaborate (Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash);
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with xcb.xcb_request_error_t;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_alloc_error_t is
-- Item
--
subtype Item is xcb.xcb_request_error_t.Item;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_alloc_error_t.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_alloc_error_t.Item,
Element_Array => xcb.xcb_alloc_error_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_alloc_error_t.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_alloc_error_t.Pointer,
Element_Array => xcb.xcb_alloc_error_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_alloc_error_t;
|
-- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired)
--
-- Copyright William A. Whitaker (1936–2010)
--
-- This is a free program, which means it is proper to copy it and pass
-- it on to your friends. Consider it a developmental item for which
-- there is no charge. However, just for form, it is Copyrighted
-- (c). Permission is hereby freely given for any and all use of program
-- and data. You can sell it as your own, but at least tell me.
--
-- This version is distributed without obligation, but the developer
-- would appreciate comments and suggestions.
--
-- All Parts of the WORDS system, source code and data files, are made freely
-- available to anyone who wishes to use them, for whatever purpose.
with Latin_Utils.Strings_Package; use Latin_Utils.Strings_Package;
with Latin_Utils.Inflections_Package; use Latin_Utils.Inflections_Package;
with Latin_Utils.Dictionary_Package; use Latin_Utils.Dictionary_Package;
function Support_Utils.Dictionary_Form (De : Dictionary_Entry) return String is
Null_Ox : constant String (1 .. 24) := (others => ' ');
Ox : array (1 .. 4) of String (1 .. 24) := (others => Null_Ox);
Form : String (1 .. 100) := (others => ' ');
Fst : constant array (Which_Type range 1 .. 5) of String (1 .. 3) :=
("1st", "2nd", "3rd", "4th", "5th");
Not_Found : exception;
function Add (Stem, Infl : String) return String is
begin
return Head (Trim (Stem) & Trim (Infl), 24);
end Add;
procedure Add_Up (Factor : String) is
begin
Form := Head (Trim (Form) & Trim (Factor), 100);
end Add_Up;
procedure Add_To (Factor : String) is
begin
Form := Head (Trim (Form) & Factor, 100);
end Add_To;
begin
--DICTIONARY_ENTRY_IO.PUT (DE);
-- So I can call with a NULL_DICTIONARY_ENTRY and not bomb
if De = Null_Dictionary_Entry then
return "";
end if;
if De.Part.Pofs = Prep then
return Trim (De.Stems (1)) & " " &
Part_Of_Speech_Type'Image (De.Part.Pofs) &
" " & Case_Type'Image (De.Part.Prep.Obj);
end if;
if De.Stems (2 .. 4) = (Null_Stem_Type, Null_Stem_Type, Null_Stem_Type) and
not (((De.Part.Pofs = N) and then (De.Part.N.Decl.Which = 9)) or
((De.Part.Pofs = Adj) and then
((De.Part.Adj.Decl.Which = 9) or
(De.Part.Adj.Co = Comp or De.Part.Adj.Co = Super))) or
((De.Part.Pofs = V) and then (De.Part.V.Con = (9, 8))) or
((De.Part.Pofs = V) and then (De.Part.V.Con = (9, 9))))
then
return Trim (De.Stems (1)) & " " &
Part_Of_Speech_Type'Image (De.Part.Pofs);
-- For UNIQUES, CONJ, INTERJ, . ..
end if;
if De.Part.Pofs = N then
case De.Part.N.Decl.Which is
-- First declension noun
when 1 =>
case De.Part.N.Decl.Var is
when 1 =>
Ox (1) := Add (De.Stems (1), "a");
Ox (2) := Add (De.Stems (2), "ae");
-- Greek nouns
when 6 =>
Ox (1) := Add (De.Stems (1), "e");
Ox (2) := Add (De.Stems (2), "es");
when 7 =>
Ox (1) := Add (De.Stems (1), "es");
Ox (2) := Add (De.Stems (2), "ae");
when 8 =>
Ox (1) := Add (De.Stems (1), "as");
Ox (2) := Add (De.Stems (2), "ae");
when others => null;
end case;
-- Second declension noun
when 2 =>
case De.Part.N.Decl.Var is
when 1 =>
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (2), "i");
when 2 =>
Ox (1) := Add (De.Stems (1), "um");
Ox (2) := Add (De.Stems (2), "i");
when 3 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "i");
when 4 =>
if De.Part.N.Gender = N then
Ox (1) := Add (De.Stems (1), "um");
else
Ox (1) := Add (De.Stems (1), "us");
end if;
Ox (2) := Add (De.Stems (2), "(i)");
when 5 =>
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (2), "");
when 6 =>
Ox (1) := Add (De.Stems (1), "os");
Ox (2) := Add (De.Stems (2), "i");
when 7 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "yos/i");
when 8 =>
Ox (1) := Add (De.Stems (1), "on");
Ox (2) := Add (De.Stems (2), "i");
when 9 =>
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (2), "i");
when others => null;
end case;
-- Third declension noun
when 3 =>
Ox (1) := Add (De.Stems (1), "");
if (De.Part.N.Decl.Var = 7) or
(De.Part.N.Decl.Var = 9)
then
Ox (2) := Add (De.Stems (2), "os/is");
else
Ox (2) := Add (De.Stems (2), "is");
end if;
-- Fourth declension noun
when 4 =>
case De.Part.N.Decl.Var is
when 1 =>
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (2), "us");
when 2 =>
Ox (1) := Add (De.Stems (1), "u");
Ox (2) := Add (De.Stems (2), "us");
when 3 =>
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (2), "u");
when 4 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "u");
when others => null;
end case;
-- Fifth decelnsion noun
when 5 =>
Ox (1) := Add (De.Stems (1), "es");
Ox (2) := Add (De.Stems (2), "ei");
when 9 =>
case De.Part.N.Decl.Var is
when 8 =>
Ox (1) := Add (De.Stems (1), ".");
Ox (2) := Add (Null_Ox, "abb.");
when 9 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (Null_Ox, "undeclined");
when others => null;
end case;
when others =>
raise Not_Found;
end case;
elsif De.Part.Pofs = Pron then
case De.Part.Pron.Decl.Which is
-- Proximal demonstrative pronoun (hic, haec, hoc)
when 3 =>
Ox (1) := Add (De.Stems (1), "ic");
Ox (2) := Add (De.Stems (1), "aec");
if De.Part.Pron.Decl.Var = 1 then
Ox (3) := Add (De.Stems (1), "oc");
elsif De.Part.Pron.Decl.Var = 2 then
Ox (3) := Add (De.Stems (1), "uc");
end if;
when 4 =>
if De.Part.Pron.Decl.Var = 1 then
Ox (1) := Add (De.Stems (1), "s");
Ox (2) := Add (De.Stems (2), "a");
Ox (3) := Add (De.Stems (1), "d");
elsif De.Part.Pron.Decl.Var = 2 then
Ox (1) := Add (De.Stems (1), "dem");
Ox (2) := Add (De.Stems (2), "adem");
Ox (3) := Add (De.Stems (1), "dem");
end if;
-- Distal (ille, illa, illud) and medial (iste, ista, istud)
-- demonstrative pronoun
when 6 =>
Ox (1) := Add (De.Stems (1), "e");
Ox (2) := Add (De.Stems (1), "a");
if De.Part.Pron.Decl.Var = 1 then
Ox (3) := Add (De.Stems (1), "ud");
elsif De.Part.Pron.Decl.Var = 2 then
Ox (3) := Add (De.Stems (1), "um");
end if;
when 9 =>
if De.Part.Pron.Decl.Var = 8 then
Ox (1) := Add (De.Stems (1), ".");
Ox (2) := Add (Null_Ox, "abb.");
elsif De.Part.Pron.Decl.Var = 9 then
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (Null_Ox, "undeclined");
end if;
when others =>
raise Not_Found;
end case;
elsif De.Part.Pofs = Adj then
--TEXT_IO.NEW_LINE;
--DICTIONARY_ENTRY_IO.PUT (DE);
--TEXT_IO.NEW_LINE;
case De.Part.Adj.Co is
when Comp =>
Ox (1) := Add (De.Stems (1), "or");
Ox (2) := Add (De.Stems (1), "or");
Ox (3) := Add (De.Stems (1), "us");
when Super =>
Ox (1) := Add (De.Stems (1), "mus");
Ox (2) := Add (De.Stems (1), "ma");
Ox (3) := Add (De.Stems (1), "mum");
when Pos =>
-- First declension adjective
if De.Part.Adj.Decl.Which = 1 then
case De.Part.Adj.Decl.Var is
when 1 =>
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (2), "a");
Ox (3) := Add (De.Stems (2), "um");
when 2 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "a");
Ox (3) := Add (De.Stems (2), "um");
when 3 =>
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (2), "a");
Ox (3) := Add (De.Stems (2), "um (gen -ius)");
when 4 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "a");
Ox (3) := Add (De.Stems (2), "um");
when 5 =>
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (2), "a");
Ox (3) := Add (De.Stems (2), "ud");
when others =>
raise Not_Found;
end case;
-- Second declension adjective
elsif De.Part.Adj.Decl.Which = 2 then
case De.Part.Adj.Decl.Var is
when 1 =>
Ox (1) := Add (Null_Ox, "-");
Ox (2) := Add (De.Stems (1), "e");
Ox (3) := Add (Null_Ox, "-");
when 2 =>
Ox (1) := Add (Null_Ox, "-");
Ox (2) := Add (Null_Ox, "a");
Ox (3) := Add (Null_Ox, "-");
when 3 =>
Ox (1) := Add (De.Stems (1), "es");
Ox (2) := Add (De.Stems (1), "es");
Ox (3) := Add (De.Stems (1), "es");
when 6 =>
Ox (1) := Add (De.Stems (1), "os");
Ox (2) := Add (De.Stems (1), "os");
Ox (3) := Add (Null_Ox, "-");
when 7 =>
Ox (1) := Add (De.Stems (1), "os");
Ox (2) := Add (Null_Ox, "-");
Ox (3) := Add (Null_Ox, "-");
when 8 =>
Ox (1) := Add (Null_Ox, "-");
Ox (2) := Add (Null_Ox, "-");
Ox (3) := Add (De.Stems (2), "on");
when others => null;
end case;
-- Third declension adjective
elsif De.Part.Adj.Decl.Which = 3 then
case De.Part.Adj.Decl.Var is
when 1 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (Null_Ox, "(gen.)");
Ox (3) := Add (De.Stems (2), "is");
when 2 =>
Ox (1) := Add (De.Stems (1), "is");
Ox (2) := Add (De.Stems (2), "is");
Ox (3) := Add (De.Stems (2), "e");
when 3 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "is");
Ox (3) := Add (De.Stems (2), "e");
when 6 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (Null_Ox, "(gen.)");
Ox (3) := Add (De.Stems (2), "os");
when others => null;
end case;
elsif De.Part.Adj.Decl = (9, 8) then
Ox (1) := Add (De.Stems (1), ".");
Ox (2) := Add (Null_Ox, "abb.");
elsif De.Part.Adj.Decl = (9, 9) then
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (Null_Ox, "undeclined");
else
raise Not_Found;
end if;
when X =>
case De.Part.Adj.Decl.Which is
when 1 =>
if De.Part.Adj.Decl.Var = 1 then
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (2), "a -um");
Ox (3) := Add (De.Stems (3), "or -or -us");
Ox (4) := Add (De.Stems (4), "mus -a -um");
elsif De.Part.Adj.Decl.Var = 2 then
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "a -um");
Ox (3) := Add (De.Stems (3), "or -or -us");
Ox (4) := Add (De.Stems (4), "mus -a -um");
end if;
when 3 =>
case De.Part.Adj.Decl.Var is
when 1 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "is (gen.)");
Ox (3) := Add (De.Stems (3), "or -or -us");
Ox (4) := Add (De.Stems (4), "mus -a -um");
when 2 =>
Ox (1) := Add (De.Stems (1), "is");
Ox (2) := Add (De.Stems (2), "e");
Ox (3) := Add (De.Stems (3), "or -or -us");
Ox (4) := Add (De.Stems (4), "mus -a -um");
when 3 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "is -e");
Ox (3) := Add (De.Stems (3), "or -or -us");
Ox (4) := Add (De.Stems (4), "mus -a -um");
when others => null;
end case;
when 9 =>
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (Null_Ox, "undeclined");
Ox (3) := Add (De.Stems (3), "or -or -us");
Ox (4) := Add (De.Stems (4), "mus -a -um");
when others =>
raise Not_Found;
end case;
end case;
elsif (De.Part.Pofs = Adv) and then (De.Part.Adv.Co = X) then
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "");
Ox (3) := Add (De.Stems (3), "");
elsif De.Part.Pofs = V then
if De.Part.V.Kind = Dep then -- all DEP
Ox (3) := Add (Null_Ox, "DEP"); -- Flag for later use
Ox (4) := Add (De.Stems (4), "us sum");
case De.Part.V.Con.Which is
when 1 =>
Ox (1) := Add (De.Stems (1), "or");
Ox (2) := Add (De.Stems (2), "ari");
when 2 =>
Ox (1) := Add (De.Stems (1), "eor");
Ox (2) := Add (De.Stems (2), "eri");
when 3 =>
Ox (1) := Add (De.Stems (1), "or");
-- Would be wrong for 3 3, but no 3 3 DEP
if De.Part.V.Con.Var = 4 then
Ox (2) := Add (De.Stems (2), "iri");
else
Ox (2) := Add (De.Stems (2), "i");
end if;
when others =>
raise Not_Found;
end case; -- all DEP handled
elsif De.Part.V.Kind = Perfdef then -- all PERFDEF handled
Ox (1) := Add (De.Stems (3), "i");
Ox (2) := Add (De.Stems (3), "isse");
Ox (3) := Add (De.Stems (4), "us");
Ox (4) := Null_Ox; -- Flag for later use
elsif De.Part.V.Kind = Impers and then
((De.Stems (1)(1 .. 3) = "zzz") and -- Recognize as PERFDEF IMPERS
(De.Stems (2)(1 .. 3) = "zzz"))
then
Ox (1) := Add (De.Stems (3), "it");
Ox (2) := Add (De.Stems (3), "isse");
Ox (3) := Add (De.Stems (4), "us est");
-- OX (4) := ADD (NULL_OX, "PERFDEF");
else -- Not DEP/PERFDEF/IMPERS
if De.Part.V.Kind = Impers then
case De.Part.V.Con.Which is
when 1 =>
Ox (1) := Add (De.Stems (1), "at");
when 2 =>
Ox (1) := Add (De.Stems (1), "et");
when 3 =>
if De.Part.V.Con.Var = 2 then
Ox (1) := Add (De.Stems (1), "t");
else
if De.Stems (1)(Trim (De.Stems (1))'Last) = 'i' then
Ox (1) := Add (De.Stems (1), "t");
else
Ox (1) := Add (De.Stems (1), "it");
end if;
end if;
when 5 =>
if De.Part.V.Con.Var = 1 then
Ox (1) := Add (De.Stems (1), "est");
end if;
when 7 =>
if De.Part.V.Con.Var = 1 or
De.Part.V.Con.Var = 2
then
Ox (1) := Add (De.Stems (1), "t");
end if;
when others => null;
end case;
else
-- OX 1
if De.Part.V.Con.Which = 2 then
Ox (1) := Add (De.Stems (1), "eo");
elsif De.Part.V.Con.Which = 5 then
Ox (1) := Add (De.Stems (1), "um");
elsif De.Part.V.Con = (7, 2) then
Ox (1) := Add (De.Stems (1), "am");
else
Ox (1) := Add (De.Stems (1), "o");
end if;
end if;
-- OX 2
case De.Part.V.Con.Which is
when 1 =>
Ox (2) := Add (De.Stems (2), "are");
when 2 =>
Ox (2) := Add (De.Stems (2), "ere");
when 3 =>
case De.Part.V.Con.Var is
when 2 =>
Ox (2) := Add (De.Stems (2), "re");
when 3 =>
-- Special case for fio, fieri: it follows the usual
-- conjugation everywhere except for present infinitive
if Trim (De.Stems (2)) = "f" then
Ox (2) := Add (De.Stems (2), "ieri");
else
Ox (2) := Add (De.Stems (2), "eri");
end if;
when 4 =>
Ox (2) := Add (De.Stems (2), "ire");
when others =>
Ox (2) := Add (De.Stems (2), "ere");
end case;
-- elsif DE.PART.V.CON.WHICH = 4 then
-- OX (2) := ADD (DE.STEMS (2), "ire");
when 5 =>
if De.Part.V.Con.Var = 1 then
Ox (2) := Add (De.Stems (2), "esse");
elsif De.Part.V.Con.Var = 2 then
Ox (2) := Add (De.Stems (1), "e"); -- tricky, but it is 1
end if;
when 6 =>
if De.Part.V.Con.Var = 1 then
Ox (2) := Add (De.Stems (2), "re");
elsif De.Part.V.Con.Var = 2 then
Ox (2) := Add (De.Stems (2), "le");
end if;
when 7 =>
if De.Part.V.Con.Var = 3 then
Ox (2) := Add (De.Stems (2), "se");
end if;
when 8 =>
case De.Part.V.Con.Var is
when 1 =>
Ox (2) := Add (De.Stems (2), "are");
when 2 =>
Ox (2) := Add (De.Stems (2), "ere");
when 3 =>
Ox (2) := Add (De.Stems (2), "ere");
when 4 =>
Ox (2) := Add (De.Stems (2), "ire");
when others =>
Ox (2) := Add (De.Stems (2), "ere");
end case;
when 9 =>
if De.Part.V.Con.Var = 8 then
Ox (1) := Add (De.Stems (1), ".");
Ox (2) := Add (Null_Ox, "abb.");
elsif De.Part.V.Con.Var = 9 then
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (Null_Ox, "undeclined");
end if;
when others => null;
end case; -- OX (2) handled
-- OX 3 & 4
if De.Part.V.Kind = Impers then
if Ox (3)(1 .. 7) /= "PERFDEF" then
Ox (3) := Add (De.Stems (3), "it");
end if;
Ox (4) := Add (De.Stems (4), "us est");
elsif De.Part.V.Kind = Semidep then -- Finalization correction
Ox (4) := Add (De.Stems (4), "us sum");
elsif De.Part.V.Con = (5, 1) then
Ox (3) := Add (De.Stems (3), "i");
Ox (4) := Add (De.Stems (4), "urus");
elsif De.Part.V.Con.Which = 8 then
Ox (3) := Add ("", "additional");
Ox (4) := Add ("", "forms");
elsif De.Part.V.Con.Which = 9 then
Ox (3) := Add (Null_Ox, "BLANK"); -- Flag for later use
Ox (4) := Add (Null_Ox, "BLANK"); -- Flag for later use
else
Ox (3) := Add (De.Stems (3), "i");
Ox (4) := Add (De.Stems (4), "us");
end if; -- OX (3 & 4) handled
end if; -- On V KIND
if De.Part.V.Con = (6, 1) then -- Finalization correction
Ox (3) := Add (Ox (3), " (ii)");
end if;
elsif (De.Part.Pofs = Num) and then (De.Part.Num.Sort = X) then
if De.Part.Num.Decl.Which = 1 then
case De.Part.Num.Decl.Var is
when 1 =>
Ox (1) := Add (De.Stems (1), "us -a -um");
Ox (2) := Add (De.Stems (2), "us -a -um");
Ox (3) := Add (De.Stems (3), "i -ae -a");
Ox (4) := Add (De.Stems (4), "");
when 2 =>
Ox (1) := Add (De.Stems (1), "o -ae o");
Ox (2) := Add (De.Stems (2), "us -a -um");
Ox (3) := Add (De.Stems (3), "i -ae -a");
Ox (4) := Add (De.Stems (4), "");
when 3 =>
Ox (1) := Add (De.Stems (1), "es -es -ia");
Ox (2) := Add (De.Stems (2), "us -a -um");
Ox (3) := Add (De.Stems (3), "i -ae -a");
Ox (4) := Add (De.Stems (4), "");
when 4 =>
Ox (1) := Add (De.Stems (1), "i -ae -a");
Ox (2) := Add (De.Stems (2), "us -a -um");
Ox (3) := Add (De.Stems (3), "i -ae -a");
Ox (4) := Add (De.Stems (4), "ie (n)s");
when others => null;
end case;
elsif De.Part.Num.Decl.Which = 2 then
Ox (1) := Add (De.Stems (1), "");
Ox (2) := Add (De.Stems (2), "us -a -um");
Ox (3) := Add (De.Stems (3), "i -ae -a");
Ox (4) := Add (De.Stems (4), "ie (n)s");
end if;
elsif (De.Part.Pofs = Num) and then (De.Part.Num.Sort = Card) then
if De.Part.Num.Decl.Which = 1 then
case De.Part.Num.Decl.Var is
when 1 =>
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (1), "a");
Ox (3) := Add (De.Stems (1), "um");
when 2 =>
Ox (1) := Add (De.Stems (1), "o");
Ox (2) := Add (De.Stems (1), "ae");
Ox (3) := Add (De.Stems (1), "o");
when 3 =>
Ox (1) := Add (De.Stems (1), "es");
Ox (2) := Add (De.Stems (1), "es");
Ox (3) := Add (De.Stems (1), "ia");
when 4 =>
Ox (1) := Add (De.Stems (1), "i");
Ox (2) := Add (De.Stems (1), "ae");
Ox (3) := Add (De.Stems (1), "a");
when others => null;
end case;
elsif De.Part.Num.Decl.Which = 2 then
Ox (1) := Add (De.Stems (1), "");
end if;
elsif (De.Part.Pofs = Num) and then (De.Part.Num.Sort = Ord) then
Ox (1) := Add (De.Stems (1), "us");
Ox (2) := Add (De.Stems (1), "a");
Ox (3) := Add (De.Stems (1), "um");
elsif (De.Part.Pofs = Num) and then (De.Part.Num.Sort = Dist) then
Ox (1) := Add (De.Stems (1), "i");
Ox (2) := Add (De.Stems (1), "ae");
Ox (3) := Add (De.Stems (1), "a");
else
Ox (1) := Add (De.Stems (1), "");
end if; -- On PART
--TEXT_IO.PUT_LINE (OX (1) & "+" & OX (2) & "+" & OX (3) & "+" & OX (4));
-- Now clean up and Output
-- Several flags have been set which modify OX's
if Ox (1)(1 .. 3) = "zzz" then
Add_Up (" - ");
elsif Ox (1) /= Null_Ox then
Add_Up (Trim (Ox (1)));
end if;
if Ox (2)(1 .. 3) = "zzz" then
Add_Up (", - ");
elsif Ox (2) /= Null_Ox then
Add_Up (", " & Trim (Ox (2)));
end if;
if Ox (3)(1 .. 3) = "zzz" then
Add_Up (", - ");
elsif Ox (3)(1 .. 3) = "DEP" then
null;
elsif Ox (3)(1 .. 7) = "PERFDEF" then
null;
elsif Ox (3)(1 .. 5) = "BLANK" then
null;
elsif Ox (3) /= Null_Ox then
Add_Up (", " & Trim (Ox (3)));
end if;
if Ox (4)(1 .. 3) = "zzz" then
Add_Up (", - ");
elsif Ox (4)(1 .. 5) = "BLANK" then
null;
elsif Ox (4) /= Null_Ox then
Add_Up (", " & Trim (Ox (4)));
end if;
Add_To (" " & Part_Of_Speech_Type'Image (De.Part.Pofs) & " ");
if De.Part.Pofs = N then
-- For DICTPAGE
if De.Part.N.Decl.Which in 1 .. 5 and
De.Part.N.Decl.Var in 1 .. 5
then
Add_To (" (" & Fst (De.Part.N.Decl.Which) & ")");
end if;
Add_To (" " & Gender_Type'Image (De.Part.N.Gender) & " ");
end if;
if De.Part.Pofs = V then
-- For DICTPAGE
if De.Part.V.Con.Which in 1 .. 3 then
if De.Part.V.Con.Var = 1 then
Add_To (" (" & Fst (De.Part.V.Con.Which) & ")");
elsif De.Part.V.Con = (3, 4) then
Add_To (" (" & Fst (4) & ")");
end if;
end if;
if De.Part.V.Kind in Gen .. Perfdef then
Add_To (" " & Verb_Kind_Type'Image (De.Part.V.Kind) & " ");
end if;
end if;
--TEXT_IO.PUT_LINE (">>>>" & TRIM (FORM));
return Trim (Form);
exception
when Not_Found =>
return "";
when others =>
return "";
end Support_Utils.Dictionary_Form;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.