CombinedText stringlengths 4 3.42M |
|---|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A D A . E X C E P T I O N S --
-- --
-- B o d y --
-- --
-- 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 body Ada.Exceptions is
procedure Last_Chance_Handler (Msg : System.Address; Line : Integer);
pragma Import (C, Last_Chance_Handler, "__gnat_last_chance_handler");
pragma No_Return (Last_Chance_Handler);
Empty_C_String : aliased constant String := (1 => ASCII.NUL);
procedure Call_Last_Chance_Handler_With_Message (Message : String);
pragma No_Return (Call_Last_Chance_Handler_With_Message);
-- Convert an exception message string to a NUL terminated C string and
-- call the last chance handler.
procedure Call_Last_Chance_Handler_With_Message (Message : String) is
C_Message : String (1 .. 80);
-- A fixed length string is used to aid gnatstack analysis of the
-- procedure.
begin
if Message'Length >= C_Message'Length then
-- Truncate the message
C_Message (1 .. 79) :=
Message (Message'First .. Message'First + 78);
C_Message (80) := ASCII.NUL;
else
C_Message (1 .. Message'Length) := Message;
C_Message (Message'Length + 1) := ASCII.NUL;
end if;
Last_Chance_Handler (C_Message'Address, 0);
end Call_Last_Chance_Handler_With_Message;
---------------------
-- Raise_Exception --
---------------------
procedure Raise_Exception (E : Exception_Id; Message : String := "") is
pragma Unreferenced (E);
-- Exception ID E is unused as raised exception go directly to the
-- last chance handler on the ZFP runtime. Note it is essential
-- for E to be unreferenced here to ensure the compiler removes
-- references to Standard defined exceptions when it inlines this
-- procedure, as these exceptions are located in the Standard library
-- which is not part of ZFP runtime library.
begin
-- The last chance handler requires a NUL terminated C string as the Msg
-- parameter.
if Message'Length = 0 then
-- Pass a NUL character to the last chance handler in the case of no
-- message.
Last_Chance_Handler (Empty_C_String'Address, 0);
else
-- While the compiler is efficient and passes NUL terminated literals
-- to this procedure, users who directly call are not likely to be
-- as thoughtful due to the String interface. Consequently we may
-- need to append NUL to the Message. Since this procedure is inlined
-- and NUL appending requires the stack, a seperate procedure is used
-- to ensure the caller's stack is not unduly bloated.
Call_Last_Chance_Handler_With_Message (Message);
end if;
end Raise_Exception;
end Ada.Exceptions;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A U N I T . M E M O R Y --
-- --
-- S p e c --
-- --
-- --
-- Copyright (C) 2008-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. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT is maintained by AdaCore (http://www.adacore.com) --
-- --
------------------------------------------------------------------------------
-- Provides the memory handling mechanism used by AUnit. This allows in
-- particular AUnit to use dynamic allocation even on limited run-times that
-- do not provide memory management.
-- See also AUnit.Memory.Utils that provides an easy to use allocator for
-- complex objects.
with System;
package AUnit.Memory is
type size_t is mod 2 ** Standard'Address_Size;
function AUnit_Alloc (Size : size_t) return System.Address;
procedure AUnit_Free (Obj : System.Address);
private
pragma Inline (AUnit_Alloc);
pragma Inline (AUnit_Free);
end AUnit.Memory;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- SYSTEM.TASKING.PROTECTED_OBJECTS.SINGLE_ENTRY --
-- --
-- B o d y --
-- --
-- Copyright (C) 1998-2016, 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. --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- Turn off subprogram ordering check, since restricted GNARLI subprograms are
-- gathered together at end.
-- This package provides an optimized version of Protected_Objects.Operations
-- and Protected_Objects.Entries making the following assumptions:
-- PO has only one entry
-- There is only one caller at a time (No_Entry_Queue)
-- There is no dynamic priority support (No_Dynamic_Priorities)
-- No Abort Statements
-- (No_Abort_Statements, Max_Asynchronous_Select_Nesting => 0)
-- PO are at library level
-- No Requeue
-- None of the tasks will terminate (no need for finalization)
-- This interface is intended to be used in the ravenscar and restricted
-- profiles, the compiler is responsible for ensuring that the conditions
-- mentioned above are respected, except for the No_Entry_Queue restriction
-- that is checked dynamically in this package, since the check cannot be
-- performed at compile time, and is relatively cheap (see PO_Do_Or_Queue,
-- Service_Entry).
pragma Polling (Off);
-- Turn off polling, we do not want polling to take place during tasking
-- operations. It can cause infinite loops and other problems.
pragma Suppress (All_Checks);
-- Why is this required ???
with Ada.Exceptions;
with System.Task_Primitives.Operations;
with System.Parameters;
package body System.Tasking.Protected_Objects.Single_Entry is
package STPO renames System.Task_Primitives.Operations;
use Parameters;
-----------------------
-- Local Subprograms --
-----------------------
procedure Send_Program_Error (Entry_Call : Entry_Call_Link);
pragma Inline (Send_Program_Error);
-- Raise Program_Error in the caller of the specified entry call
--------------------------
-- Entry Calls Handling --
--------------------------
procedure Wakeup_Entry_Caller (Entry_Call : Entry_Call_Link);
pragma Inline (Wakeup_Entry_Caller);
-- This is called at the end of service of an entry call, to abort the
-- caller if he is in an abortable part, and to wake up the caller if he
-- is on Entry_Caller_Sleep. Call it holding the lock of Entry_Call.Self.
procedure Wait_For_Completion (Entry_Call : Entry_Call_Link);
pragma Inline (Wait_For_Completion);
-- This procedure suspends the calling task until the specified entry call
-- has either been completed or cancelled. On exit, the call will not be
-- queued. This waits for calls on protected entries.
-- Call this only when holding Self_ID locked.
procedure Check_Exception
(Self_ID : Task_Id;
Entry_Call : Entry_Call_Link);
pragma Inline (Check_Exception);
-- Raise any pending exception from the Entry_Call. This should be called
-- at the end of every compiler interface procedure that implements an
-- entry call. The caller should not be holding any locks, or there will
-- be deadlock.
procedure PO_Do_Or_Queue
(Object : Protection_Entry_Access;
Entry_Call : Entry_Call_Link);
-- This procedure executes or queues an entry call, depending on the status
-- of the corresponding barrier. The specified object is assumed locked.
---------------------
-- Check_Exception --
---------------------
procedure Check_Exception
(Self_ID : Task_Id;
Entry_Call : Entry_Call_Link)
is
pragma Warnings (Off, Self_ID);
procedure Internal_Raise (X : Ada.Exceptions.Exception_Id);
pragma Import (C, Internal_Raise, "__gnat_raise_with_msg");
use type Ada.Exceptions.Exception_Id;
E : constant Ada.Exceptions.Exception_Id :=
Entry_Call.Exception_To_Raise;
begin
if E /= Ada.Exceptions.Null_Id then
Internal_Raise (E);
end if;
end Check_Exception;
------------------------
-- Send_Program_Error --
------------------------
procedure Send_Program_Error (Entry_Call : Entry_Call_Link) is
Caller : constant Task_Id := Entry_Call.Self;
begin
Entry_Call.Exception_To_Raise := Program_Error'Identity;
if Single_Lock then
STPO.Lock_RTS;
end if;
STPO.Write_Lock (Caller);
Wakeup_Entry_Caller (Entry_Call);
STPO.Unlock (Caller);
if Single_Lock then
STPO.Unlock_RTS;
end if;
end Send_Program_Error;
-------------------------
-- Wait_For_Completion --
-------------------------
procedure Wait_For_Completion (Entry_Call : Entry_Call_Link) is
Self_Id : constant Task_Id := Entry_Call.Self;
begin
Self_Id.Common.State := Entry_Caller_Sleep;
STPO.Sleep (Self_Id, Entry_Caller_Sleep);
Self_Id.Common.State := Runnable;
end Wait_For_Completion;
-------------------------
-- Wakeup_Entry_Caller --
-------------------------
-- This is called at the end of service of an entry call, to abort the
-- caller if he is in an abortable part, and to wake up the caller if it
-- is on Entry_Caller_Sleep. It assumes that the call is already off-queue.
-- (This enforces the rule that a task must be off-queue if its state is
-- Done or Cancelled.) Call it holding the lock of Entry_Call.Self.
-- The caller is waiting on Entry_Caller_Sleep, in Wait_For_Completion.
procedure Wakeup_Entry_Caller
(Entry_Call : Entry_Call_Link)
is
Caller : constant Task_Id := Entry_Call.Self;
begin
pragma Assert
(Caller.Common.State /= Terminated and then
Caller.Common.State /= Unactivated);
Entry_Call.State := Done;
STPO.Wakeup (Caller, Entry_Caller_Sleep);
end Wakeup_Entry_Caller;
-----------------------
-- Restricted GNARLI --
-----------------------
--------------------------------------------
-- Exceptional_Complete_Single_Entry_Body --
--------------------------------------------
procedure Exceptional_Complete_Single_Entry_Body
(Object : Protection_Entry_Access;
Ex : Ada.Exceptions.Exception_Id)
is
begin
Object.Call_In_Progress.Exception_To_Raise := Ex;
end Exceptional_Complete_Single_Entry_Body;
---------------------------------
-- Initialize_Protection_Entry --
---------------------------------
procedure Initialize_Protection_Entry
(Object : Protection_Entry_Access;
Ceiling_Priority : Integer;
Compiler_Info : System.Address;
Entry_Body : Entry_Body_Access)
is
begin
Initialize_Protection (Object.Common'Access, Ceiling_Priority);
Object.Compiler_Info := Compiler_Info;
Object.Call_In_Progress := null;
Object.Entry_Body := Entry_Body;
Object.Entry_Queue := null;
end Initialize_Protection_Entry;
----------------
-- Lock_Entry --
----------------
-- Compiler interface only
-- Do not call this procedure from within the run-time system.
procedure Lock_Entry (Object : Protection_Entry_Access) is
begin
Lock (Object.Common'Access);
end Lock_Entry;
--------------------------
-- Lock_Read_Only_Entry --
--------------------------
-- Compiler interface only
-- Do not call this procedure from within the runtime system
procedure Lock_Read_Only_Entry (Object : Protection_Entry_Access) is
begin
Lock_Read_Only (Object.Common'Access);
end Lock_Read_Only_Entry;
--------------------
-- PO_Do_Or_Queue --
--------------------
procedure PO_Do_Or_Queue
(Object : Protection_Entry_Access;
Entry_Call : Entry_Call_Link)
is
Barrier_Value : Boolean;
begin
-- When the Action procedure for an entry body returns, it must be
-- completed (having called [Exceptional_]Complete_Entry_Body).
Barrier_Value := Object.Entry_Body.Barrier (Object.Compiler_Info, 1);
if Barrier_Value then
if Object.Call_In_Progress /= null then
-- This violates the No_Entry_Queue restriction, send
-- Program_Error to the caller.
Send_Program_Error (Entry_Call);
return;
end if;
Object.Call_In_Progress := Entry_Call;
Object.Entry_Body.Action
(Object.Compiler_Info, Entry_Call.Uninterpreted_Data, 1);
Object.Call_In_Progress := null;
if Single_Lock then
STPO.Lock_RTS;
end if;
STPO.Write_Lock (Entry_Call.Self);
Wakeup_Entry_Caller (Entry_Call);
STPO.Unlock (Entry_Call.Self);
if Single_Lock then
STPO.Unlock_RTS;
end if;
else
pragma Assert (Entry_Call.Mode = Simple_Call);
if Object.Entry_Queue /= null then
-- This violates the No_Entry_Queue restriction, send
-- Program_Error to the caller.
Send_Program_Error (Entry_Call);
return;
else
Object.Entry_Queue := Entry_Call;
end if;
end if;
exception
when others =>
Send_Program_Error (Entry_Call);
end PO_Do_Or_Queue;
----------------------------
-- Protected_Single_Count --
----------------------------
function Protected_Count_Entry (Object : Protection_Entry) return Natural is
begin
if Object.Entry_Queue /= null then
return 1;
else
return 0;
end if;
end Protected_Count_Entry;
---------------------------------
-- Protected_Single_Entry_Call --
---------------------------------
procedure Protected_Single_Entry_Call
(Object : Protection_Entry_Access;
Uninterpreted_Data : System.Address)
is
Self_Id : constant Task_Id := STPO.Self;
Entry_Call : Entry_Call_Record renames Self_Id.Entry_Calls (1);
begin
-- If pragma Detect_Blocking is active then Program_Error must be
-- raised if this potentially blocking operation is called from a
-- protected action.
if Detect_Blocking
and then Self_Id.Common.Protected_Action_Nesting > 0
then
raise Program_Error with "potentially blocking operation";
end if;
Lock_Entry (Object);
Entry_Call.Mode := Simple_Call;
Entry_Call.State := Now_Abortable;
Entry_Call.Uninterpreted_Data := Uninterpreted_Data;
Entry_Call.Exception_To_Raise := Ada.Exceptions.Null_Id;
PO_Do_Or_Queue (Object, Entry_Call'Access);
Unlock_Entry (Object);
-- The call is either `Done' or not. It cannot be cancelled since there
-- is no ATC construct.
pragma Assert (Entry_Call.State /= Cancelled);
if Entry_Call.State /= Done then
if Single_Lock then
STPO.Lock_RTS;
end if;
STPO.Write_Lock (Self_Id);
Wait_For_Completion (Entry_Call'Access);
STPO.Unlock (Self_Id);
if Single_Lock then
STPO.Unlock_RTS;
end if;
end if;
Check_Exception (Self_Id, Entry_Call'Access);
end Protected_Single_Entry_Call;
-----------------------------------
-- Protected_Single_Entry_Caller --
-----------------------------------
function Protected_Single_Entry_Caller
(Object : Protection_Entry) return Task_Id
is
begin
return Object.Call_In_Progress.Self;
end Protected_Single_Entry_Caller;
-------------------
-- Service_Entry --
-------------------
procedure Service_Entry (Object : Protection_Entry_Access) is
Entry_Call : constant Entry_Call_Link := Object.Entry_Queue;
Caller : Task_Id;
begin
if Entry_Call /= null
and then Object.Entry_Body.Barrier (Object.Compiler_Info, 1)
then
Object.Entry_Queue := null;
if Object.Call_In_Progress /= null then
-- Violation of No_Entry_Queue restriction, raise exception
Send_Program_Error (Entry_Call);
Unlock_Entry (Object);
return;
end if;
Object.Call_In_Progress := Entry_Call;
Object.Entry_Body.Action
(Object.Compiler_Info, Entry_Call.Uninterpreted_Data, 1);
Object.Call_In_Progress := null;
Caller := Entry_Call.Self;
Unlock_Entry (Object);
if Single_Lock then
STPO.Lock_RTS;
end if;
STPO.Write_Lock (Caller);
Wakeup_Entry_Caller (Entry_Call);
STPO.Unlock (Caller);
if Single_Lock then
STPO.Unlock_RTS;
end if;
else
-- Just unlock the entry
Unlock_Entry (Object);
end if;
exception
when others =>
Send_Program_Error (Entry_Call);
Unlock_Entry (Object);
end Service_Entry;
------------------
-- Unlock_Entry --
------------------
procedure Unlock_Entry (Object : Protection_Entry_Access) is
begin
Unlock (Object.Common'Access);
end Unlock_Entry;
end System.Tasking.Protected_Objects.Single_Entry;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2018 onox <denkpadje@gmail.com>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
package Orka.Rendering.Buffers.Mapped.Unsynchronized is
pragma Preelaborate;
type Unsynchronized_Mapped_Buffer is new Mapped_Buffer with private;
function Create_Buffer
(Kind : Orka.Types.Element_Type;
Length : Natural;
Mode : IO_Mode) return Unsynchronized_Mapped_Buffer
with Post => Create_Buffer'Result.Length = Length;
procedure Map (Object : in out Unsynchronized_Mapped_Buffer)
with Pre => not Object.Mapped,
Post => Object.Mapped;
procedure Unmap (Object : in out Unsynchronized_Mapped_Buffer)
with Pre => Object.Mapped,
Post => not Object.Mapped;
function Mapped (Object : in out Unsynchronized_Mapped_Buffer) return Boolean;
function Buffer (Object : in out Unsynchronized_Mapped_Buffer) return Buffers.Buffer
with Pre => not Object.Mapped;
private
type Unsynchronized_Mapped_Buffer is new Mapped_Buffer with null record;
end Orka.Rendering.Buffers.Mapped.Unsynchronized;
|
------------------------------------------------------------------------------
-- --
-- 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 DOM.Core;
with TCG.Tilesets;
private with Ada.Containers.Vectors;
package TCG.Object_Groups is
type Object_Kind is (Rectangle_Obj, Point_Obj, Ellipse_Obj,
Polygon_Obj, Tile_Obj, Text_Obj);
type Point is record
X, Y : Float;
end record;
type Polygon is array (Positive range <>) of Point;
type Polygon_Access is access all Polygon;
type String_Access is access all String;
type Object (Kind : Object_Kind := Rectangle_Obj)
is record
Name : String_Access;
Id : Natural;
Pt : Point;
Width, Height : Float;
Points : Polygon_Access;
Str : String_Access;
Flip_Vertical : Boolean;
Flip_Horizontal : Boolean;
Tile_Id : TCG.Tilesets.Map_Tile_Id;
end record;
type Object_Group_Id is new Integer;
type Object_Group is private;
No_Layer : constant Object_Group;
function Load (Root : DOM.Core.Node) return Object_Group;
function Name (This : Object_Group) return String
with Pre => This /= No_Layer;
function Id (This : Object_Group) return Object_Group_Id
with Pre => This /= No_Layer;
function Length (This : Object_Group) return Natural;
function First_Index (This : Object_Group) return Natural
with Pre => This /= No_Layer and then Length (This) /= 0;
function Last_Index (This : Object_Group) return Natural
with Pre => This /= No_Layer and then Length (This) /= 0;
function Get_Object (This : Object_Group;
Index : Natural)
return Object
with Pre => This /= No_Layer
and then Length (This) /= 0
and then Index in First_Index (This) .. Last_Index (This);
private
package Object_Vector_Package is new Ada.Containers.Vectors
(Natural, Object);
type Group_Data is record
Name : String_Access := null;
Id : Object_Group_Id;
Objects : Object_Vector_Package.Vector;
end record;
type Object_Group is access all Group_Data;
No_Layer : constant Object_Group := null;
end TCG.Object_Groups;
|
-------------------------------------------------------------------------------
-- Copyright (c) 2016 Daniel King
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to
-- deal in the Software without restriction, including without limitation the
-- rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
-- sell copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
-- IN THE SOFTWARE.
-------------------------------------------------------------------------------
with AUnit.Test_Fixtures;
package Verhoeff_Tests
is
type Test is new AUnit.Test_Fixtures.Test_Fixture with null record;
procedure Test_Case_1(T : in out Test);
procedure Test_Case_2(T : in out Test);
procedure Test_Symmetry(T : in out Test);
procedure Test_Empty(T : in out Test);
end Verhoeff_Tests;
|
-- linear/geographical conversions
generic
type Real is digits <>;
package Unit_Conversion_Utilities is
type Unit_Converter is tagged private;
procedure Initialize
(This : out Unit_Converter;
LatitudeInit_Rad : Real;
LongitudeInit_rad : Real);
-- FROM LAT/LONG TO NORTH/EAST
procedure Convert_LatLong_Degrees_To_NorthEast_Meters
(This : in out Unit_Converter;
Latitude_Deg : Real;
Longitude_Deg : Real;
North : out Real;
East : out Real);
-- FROM NORTH/EAST TO LAT/LONG
-- ...
-- const double m_dRadiusEquatorial_m{6378135.0};
dRadiusEquatorial_m : constant := 6_378_135.0;
-- const double m_dFlattening{3.352810664724998e-003};
dFlattening : constant := 3.352810664724998e-003;
-- const double m_dEccentricitySquared{6.694379990096503e-003};
dEccentricitySquared : constant := 6.694379990096503e-003;
private
type Unit_Converter is tagged record
-- static double m_dLatitudeInitial_rad;
m_dLatitudeInitial_rad : Real;
-- static double m_dLongitudeInitial_rad;
m_dLongitudeInitial_rad : Real;
-- static double m_dRadiusMeridional_m;
m_dRadiusMeridional_m : Real;
-- static double m_dRadiusTransverse_m;
m_dRadiusTransverse_m : Real;
-- static double m_dRadiusSmallCircleLatitude_m;
m_dRadiusSmallCircleLatitude_m : Real;
-- Static Bool M_BInitialized;
Initialized : Boolean := False;
end record;
end Unit_Conversion_Utilities;
|
pragma Warnings (Off);
pragma Ada_95;
with System;
with System.Parameters;
with System.Secondary_Stack;
package ada_main is
gnat_argc : Integer;
gnat_argv : System.Address;
gnat_envp : System.Address;
pragma Import (C, gnat_argc);
pragma Import (C, gnat_argv);
pragma Import (C, gnat_envp);
gnat_exit_status : Integer;
pragma Import (C, gnat_exit_status);
GNAT_Version : constant String :=
"GNAT Version: Community 2020 (20200429-93)" & ASCII.NUL;
pragma Export (C, GNAT_Version, "__gnat_version");
Ada_Main_Program_Name : constant String := "_ada_prueba_complejos" & ASCII.NUL;
pragma Export (C, Ada_Main_Program_Name, "__gnat_ada_main_program_name");
procedure adainit;
pragma Export (C, adainit, "adainit");
procedure adafinal;
pragma Export (C, adafinal, "adafinal");
function main
(argc : Integer;
argv : System.Address;
envp : System.Address)
return Integer;
pragma Export (C, main, "main");
type Version_32 is mod 2 ** 32;
u00001 : constant Version_32 := 16#dd4ba3ae#;
pragma Export (C, u00001, "prueba_complejosB");
u00002 : constant Version_32 := 16#67c8d842#;
pragma Export (C, u00002, "system__standard_libraryB");
u00003 : constant Version_32 := 16#5741b5a5#;
pragma Export (C, u00003, "system__standard_libraryS");
u00004 : constant Version_32 := 16#76789da1#;
pragma Export (C, u00004, "adaS");
u00005 : constant Version_32 := 16#f9576a72#;
pragma Export (C, u00005, "ada__tagsB");
u00006 : constant Version_32 := 16#b6661f55#;
pragma Export (C, u00006, "ada__tagsS");
u00007 : constant Version_32 := 16#f34ff985#;
pragma Export (C, u00007, "ada__exceptionsB");
u00008 : constant Version_32 := 16#cfbb5cc5#;
pragma Export (C, u00008, "ada__exceptionsS");
u00009 : constant Version_32 := 16#35e1815f#;
pragma Export (C, u00009, "ada__exceptions__last_chance_handlerB");
u00010 : constant Version_32 := 16#cfec26ee#;
pragma Export (C, u00010, "ada__exceptions__last_chance_handlerS");
u00011 : constant Version_32 := 16#32a08138#;
pragma Export (C, u00011, "systemS");
u00012 : constant Version_32 := 16#ae860117#;
pragma Export (C, u00012, "system__soft_linksB");
u00013 : constant Version_32 := 16#4d9536d3#;
pragma Export (C, u00013, "system__soft_linksS");
u00014 : constant Version_32 := 16#59d61025#;
pragma Export (C, u00014, "system__secondary_stackB");
u00015 : constant Version_32 := 16#c30bb6bc#;
pragma Export (C, u00015, "system__secondary_stackS");
u00016 : constant Version_32 := 16#896564a3#;
pragma Export (C, u00016, "system__parametersB");
u00017 : constant Version_32 := 16#75f245f3#;
pragma Export (C, u00017, "system__parametersS");
u00018 : constant Version_32 := 16#ced09590#;
pragma Export (C, u00018, "system__storage_elementsB");
u00019 : constant Version_32 := 16#1f63cb3c#;
pragma Export (C, u00019, "system__storage_elementsS");
u00020 : constant Version_32 := 16#ce3e0e21#;
pragma Export (C, u00020, "system__soft_links__initializeB");
u00021 : constant Version_32 := 16#5697fc2b#;
pragma Export (C, u00021, "system__soft_links__initializeS");
u00022 : constant Version_32 := 16#41837d1e#;
pragma Export (C, u00022, "system__stack_checkingB");
u00023 : constant Version_32 := 16#bc1fead0#;
pragma Export (C, u00023, "system__stack_checkingS");
u00024 : constant Version_32 := 16#34742901#;
pragma Export (C, u00024, "system__exception_tableB");
u00025 : constant Version_32 := 16#0dc9c2c8#;
pragma Export (C, u00025, "system__exception_tableS");
u00026 : constant Version_32 := 16#ce4af020#;
pragma Export (C, u00026, "system__exceptionsB");
u00027 : constant Version_32 := 16#5ac3ecce#;
pragma Export (C, u00027, "system__exceptionsS");
u00028 : constant Version_32 := 16#69416224#;
pragma Export (C, u00028, "system__exceptions__machineB");
u00029 : constant Version_32 := 16#5c74e542#;
pragma Export (C, u00029, "system__exceptions__machineS");
u00030 : constant Version_32 := 16#aa0563fc#;
pragma Export (C, u00030, "system__exceptions_debugB");
u00031 : constant Version_32 := 16#2eed524e#;
pragma Export (C, u00031, "system__exceptions_debugS");
u00032 : constant Version_32 := 16#6c2f8802#;
pragma Export (C, u00032, "system__img_intB");
u00033 : constant Version_32 := 16#307b61fa#;
pragma Export (C, u00033, "system__img_intS");
u00034 : constant Version_32 := 16#39df8c17#;
pragma Export (C, u00034, "system__tracebackB");
u00035 : constant Version_32 := 16#6c825ffc#;
pragma Export (C, u00035, "system__tracebackS");
u00036 : constant Version_32 := 16#9ed49525#;
pragma Export (C, u00036, "system__traceback_entriesB");
u00037 : constant Version_32 := 16#32fb7748#;
pragma Export (C, u00037, "system__traceback_entriesS");
u00038 : constant Version_32 := 16#3f39e75e#;
pragma Export (C, u00038, "system__traceback__symbolicB");
u00039 : constant Version_32 := 16#46491211#;
pragma Export (C, u00039, "system__traceback__symbolicS");
u00040 : constant Version_32 := 16#179d7d28#;
pragma Export (C, u00040, "ada__containersS");
u00041 : constant Version_32 := 16#701f9d88#;
pragma Export (C, u00041, "ada__exceptions__tracebackB");
u00042 : constant Version_32 := 16#ae2d2db5#;
pragma Export (C, u00042, "ada__exceptions__tracebackS");
u00043 : constant Version_32 := 16#e865e681#;
pragma Export (C, u00043, "system__bounded_stringsB");
u00044 : constant Version_32 := 16#455da021#;
pragma Export (C, u00044, "system__bounded_stringsS");
u00045 : constant Version_32 := 16#7b499e82#;
pragma Export (C, u00045, "system__crtlS");
u00046 : constant Version_32 := 16#641e2245#;
pragma Export (C, u00046, "system__dwarf_linesB");
u00047 : constant Version_32 := 16#40ce1ea3#;
pragma Export (C, u00047, "system__dwarf_linesS");
u00048 : constant Version_32 := 16#5b4659fa#;
pragma Export (C, u00048, "ada__charactersS");
u00049 : constant Version_32 := 16#8f637df8#;
pragma Export (C, u00049, "ada__characters__handlingB");
u00050 : constant Version_32 := 16#3b3f6154#;
pragma Export (C, u00050, "ada__characters__handlingS");
u00051 : constant Version_32 := 16#4b7bb96a#;
pragma Export (C, u00051, "ada__characters__latin_1S");
u00052 : constant Version_32 := 16#e6d4fa36#;
pragma Export (C, u00052, "ada__stringsS");
u00053 : constant Version_32 := 16#96df1a3f#;
pragma Export (C, u00053, "ada__strings__mapsB");
u00054 : constant Version_32 := 16#1e526bec#;
pragma Export (C, u00054, "ada__strings__mapsS");
u00055 : constant Version_32 := 16#465aa89c#;
pragma Export (C, u00055, "system__bit_opsB");
u00056 : constant Version_32 := 16#0765e3a3#;
pragma Export (C, u00056, "system__bit_opsS");
u00057 : constant Version_32 := 16#6c6ff32a#;
pragma Export (C, u00057, "system__unsigned_typesS");
u00058 : constant Version_32 := 16#92f05f13#;
pragma Export (C, u00058, "ada__strings__maps__constantsS");
u00059 : constant Version_32 := 16#5ab55268#;
pragma Export (C, u00059, "interfacesS");
u00060 : constant Version_32 := 16#a0d3d22b#;
pragma Export (C, u00060, "system__address_imageB");
u00061 : constant Version_32 := 16#934c1c02#;
pragma Export (C, u00061, "system__address_imageS");
u00062 : constant Version_32 := 16#8631cc2e#;
pragma Export (C, u00062, "system__img_unsB");
u00063 : constant Version_32 := 16#f39bcfdd#;
pragma Export (C, u00063, "system__img_unsS");
u00064 : constant Version_32 := 16#20ec7aa3#;
pragma Export (C, u00064, "system__ioB");
u00065 : constant Version_32 := 16#ace27677#;
pragma Export (C, u00065, "system__ioS");
u00066 : constant Version_32 := 16#3080f2ca#;
pragma Export (C, u00066, "system__mmapB");
u00067 : constant Version_32 := 16#9ad4d587#;
pragma Export (C, u00067, "system__mmapS");
u00068 : constant Version_32 := 16#92d882c5#;
pragma Export (C, u00068, "ada__io_exceptionsS");
u00069 : constant Version_32 := 16#a8ba7b3b#;
pragma Export (C, u00069, "system__mmap__os_interfaceB");
u00070 : constant Version_32 := 16#8f4541b8#;
pragma Export (C, u00070, "system__mmap__os_interfaceS");
u00071 : constant Version_32 := 16#657efc5a#;
pragma Export (C, u00071, "system__os_libB");
u00072 : constant Version_32 := 16#d872da39#;
pragma Export (C, u00072, "system__os_libS");
u00073 : constant Version_32 := 16#ec4d5631#;
pragma Export (C, u00073, "system__case_utilB");
u00074 : constant Version_32 := 16#0d75376c#;
pragma Export (C, u00074, "system__case_utilS");
u00075 : constant Version_32 := 16#2a8e89ad#;
pragma Export (C, u00075, "system__stringsB");
u00076 : constant Version_32 := 16#52b6adad#;
pragma Export (C, u00076, "system__stringsS");
u00077 : constant Version_32 := 16#e49bce3e#;
pragma Export (C, u00077, "interfaces__cB");
u00078 : constant Version_32 := 16#dbc36ce0#;
pragma Export (C, u00078, "interfaces__cS");
u00079 : constant Version_32 := 16#c83ab8ef#;
pragma Export (C, u00079, "system__object_readerB");
u00080 : constant Version_32 := 16#f6d45c39#;
pragma Export (C, u00080, "system__object_readerS");
u00081 : constant Version_32 := 16#914b0305#;
pragma Export (C, u00081, "system__val_lliB");
u00082 : constant Version_32 := 16#5ece13c8#;
pragma Export (C, u00082, "system__val_lliS");
u00083 : constant Version_32 := 16#d2ae2792#;
pragma Export (C, u00083, "system__val_lluB");
u00084 : constant Version_32 := 16#01a17ec8#;
pragma Export (C, u00084, "system__val_lluS");
u00085 : constant Version_32 := 16#269742a9#;
pragma Export (C, u00085, "system__val_utilB");
u00086 : constant Version_32 := 16#9e0037c6#;
pragma Export (C, u00086, "system__val_utilS");
u00087 : constant Version_32 := 16#b578159b#;
pragma Export (C, u00087, "system__exception_tracesB");
u00088 : constant Version_32 := 16#167fa1a2#;
pragma Export (C, u00088, "system__exception_tracesS");
u00089 : constant Version_32 := 16#e1282880#;
pragma Export (C, u00089, "system__win32S");
u00090 : constant Version_32 := 16#8c33a517#;
pragma Export (C, u00090, "system__wch_conB");
u00091 : constant Version_32 := 16#29dda3ea#;
pragma Export (C, u00091, "system__wch_conS");
u00092 : constant Version_32 := 16#9721e840#;
pragma Export (C, u00092, "system__wch_stwB");
u00093 : constant Version_32 := 16#04cc8feb#;
pragma Export (C, u00093, "system__wch_stwS");
u00094 : constant Version_32 := 16#a831679c#;
pragma Export (C, u00094, "system__wch_cnvB");
u00095 : constant Version_32 := 16#266a1919#;
pragma Export (C, u00095, "system__wch_cnvS");
u00096 : constant Version_32 := 16#ece6fdb6#;
pragma Export (C, u00096, "system__wch_jisB");
u00097 : constant Version_32 := 16#a61a0038#;
pragma Export (C, u00097, "system__wch_jisS");
u00098 : constant Version_32 := 16#796f31f1#;
pragma Export (C, u00098, "system__htableB");
u00099 : constant Version_32 := 16#b66232d2#;
pragma Export (C, u00099, "system__htableS");
u00100 : constant Version_32 := 16#089f5cd0#;
pragma Export (C, u00100, "system__string_hashB");
u00101 : constant Version_32 := 16#143c59ac#;
pragma Export (C, u00101, "system__string_hashS");
u00102 : constant Version_32 := 16#f4e097a7#;
pragma Export (C, u00102, "ada__text_ioB");
u00103 : constant Version_32 := 16#03e83e15#;
pragma Export (C, u00103, "ada__text_ioS");
u00104 : constant Version_32 := 16#10558b11#;
pragma Export (C, u00104, "ada__streamsB");
u00105 : constant Version_32 := 16#67e31212#;
pragma Export (C, u00105, "ada__streamsS");
u00106 : constant Version_32 := 16#73d2d764#;
pragma Export (C, u00106, "interfaces__c_streamsB");
u00107 : constant Version_32 := 16#b1330297#;
pragma Export (C, u00107, "interfaces__c_streamsS");
u00108 : constant Version_32 := 16#ec9c64c3#;
pragma Export (C, u00108, "system__file_ioB");
u00109 : constant Version_32 := 16#95d1605d#;
pragma Export (C, u00109, "system__file_ioS");
u00110 : constant Version_32 := 16#86c56e5a#;
pragma Export (C, u00110, "ada__finalizationS");
u00111 : constant Version_32 := 16#95817ed8#;
pragma Export (C, u00111, "system__finalization_rootB");
u00112 : constant Version_32 := 16#7d52f2a8#;
pragma Export (C, u00112, "system__finalization_rootS");
u00113 : constant Version_32 := 16#cf3f1b90#;
pragma Export (C, u00113, "system__file_control_blockS");
u00114 : constant Version_32 := 16#a243569c#;
pragma Export (C, u00114, "complejosB");
u00115 : constant Version_32 := 16#983af4b6#;
pragma Export (C, u00115, "complejosS");
u00116 : constant Version_32 := 16#932a4690#;
pragma Export (C, u00116, "system__concat_4B");
u00117 : constant Version_32 := 16#4cc4aa18#;
pragma Export (C, u00117, "system__concat_4S");
u00118 : constant Version_32 := 16#2b70b149#;
pragma Export (C, u00118, "system__concat_3B");
u00119 : constant Version_32 := 16#39d0dd9d#;
pragma Export (C, u00119, "system__concat_3S");
u00120 : constant Version_32 := 16#fd83e873#;
pragma Export (C, u00120, "system__concat_2B");
u00121 : constant Version_32 := 16#300056e8#;
pragma Export (C, u00121, "system__concat_2S");
u00122 : constant Version_32 := 16#8f828546#;
pragma Export (C, u00122, "system__img_realB");
u00123 : constant Version_32 := 16#ad3b16aa#;
pragma Export (C, u00123, "system__img_realS");
u00124 : constant Version_32 := 16#36373acb#;
pragma Export (C, u00124, "system__fat_llfS");
u00125 : constant Version_32 := 16#1b28662b#;
pragma Export (C, u00125, "system__float_controlB");
u00126 : constant Version_32 := 16#d25cc204#;
pragma Export (C, u00126, "system__float_controlS");
u00127 : constant Version_32 := 16#54da27e6#;
pragma Export (C, u00127, "system__img_lluB");
u00128 : constant Version_32 := 16#25a6f3e9#;
pragma Export (C, u00128, "system__img_lluS");
u00129 : constant Version_32 := 16#62d0e74f#;
pragma Export (C, u00129, "system__powten_tableS");
u00130 : constant Version_32 := 16#eca5ecae#;
pragma Export (C, u00130, "system__memoryB");
u00131 : constant Version_32 := 16#6bdde70c#;
pragma Export (C, u00131, "system__memoryS");
-- BEGIN ELABORATION ORDER
-- ada%s
-- ada.characters%s
-- ada.characters.latin_1%s
-- interfaces%s
-- system%s
-- system.float_control%s
-- system.float_control%b
-- system.img_int%s
-- system.img_int%b
-- system.io%s
-- system.io%b
-- system.parameters%s
-- system.parameters%b
-- system.crtl%s
-- interfaces.c_streams%s
-- interfaces.c_streams%b
-- system.powten_table%s
-- system.storage_elements%s
-- system.storage_elements%b
-- system.stack_checking%s
-- system.stack_checking%b
-- system.string_hash%s
-- system.string_hash%b
-- system.htable%s
-- system.htable%b
-- system.strings%s
-- system.strings%b
-- system.traceback_entries%s
-- system.traceback_entries%b
-- system.unsigned_types%s
-- system.img_llu%s
-- system.img_llu%b
-- system.img_uns%s
-- system.img_uns%b
-- system.wch_con%s
-- system.wch_con%b
-- system.wch_jis%s
-- system.wch_jis%b
-- system.wch_cnv%s
-- system.wch_cnv%b
-- system.concat_2%s
-- system.concat_2%b
-- system.concat_3%s
-- system.concat_3%b
-- system.concat_4%s
-- system.concat_4%b
-- system.traceback%s
-- system.traceback%b
-- ada.characters.handling%s
-- system.case_util%s
-- system.os_lib%s
-- system.secondary_stack%s
-- system.standard_library%s
-- ada.exceptions%s
-- system.exceptions_debug%s
-- system.exceptions_debug%b
-- system.soft_links%s
-- system.val_lli%s
-- system.val_llu%s
-- system.val_util%s
-- system.val_util%b
-- system.wch_stw%s
-- system.wch_stw%b
-- ada.exceptions.last_chance_handler%s
-- ada.exceptions.last_chance_handler%b
-- ada.exceptions.traceback%s
-- ada.exceptions.traceback%b
-- system.address_image%s
-- system.address_image%b
-- system.bit_ops%s
-- system.bit_ops%b
-- system.bounded_strings%s
-- system.bounded_strings%b
-- system.case_util%b
-- system.exception_table%s
-- system.exception_table%b
-- ada.containers%s
-- ada.io_exceptions%s
-- ada.strings%s
-- ada.strings.maps%s
-- ada.strings.maps%b
-- ada.strings.maps.constants%s
-- interfaces.c%s
-- interfaces.c%b
-- system.exceptions%s
-- system.exceptions%b
-- system.exceptions.machine%s
-- system.exceptions.machine%b
-- system.win32%s
-- ada.characters.handling%b
-- system.exception_traces%s
-- system.exception_traces%b
-- system.memory%s
-- system.memory%b
-- system.mmap%s
-- system.mmap.os_interface%s
-- system.mmap.os_interface%b
-- system.mmap%b
-- system.object_reader%s
-- system.object_reader%b
-- system.dwarf_lines%s
-- system.dwarf_lines%b
-- system.os_lib%b
-- system.secondary_stack%b
-- system.soft_links.initialize%s
-- system.soft_links.initialize%b
-- system.soft_links%b
-- system.standard_library%b
-- system.traceback.symbolic%s
-- system.traceback.symbolic%b
-- ada.exceptions%b
-- system.val_lli%b
-- system.val_llu%b
-- ada.tags%s
-- ada.tags%b
-- ada.streams%s
-- ada.streams%b
-- system.fat_llf%s
-- system.file_control_block%s
-- system.finalization_root%s
-- system.finalization_root%b
-- ada.finalization%s
-- system.file_io%s
-- system.file_io%b
-- system.img_real%s
-- system.img_real%b
-- ada.text_io%s
-- ada.text_io%b
-- complejos%s
-- complejos%b
-- prueba_complejos%b
-- END ELABORATION ORDER
end ada_main;
|
-----------------------------------------------------------------------
-- awa-tags-modules-tests -- Unit tests for tags service
-- Copyright (C) 2013 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Tests;
with AWA.Tests;
package AWA.Tags.Modules.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new AWA.Tests.Test with record
Manager : AWA.Tags.Modules.Tag_Module_Access;
end record;
-- Test tag creation.
procedure Test_Add_Tag (T : in out Test);
-- Test tag removal.
procedure Test_Remove_Tag (T : in out Test);
-- Test tag creation and removal.
procedure Test_Update_Tag (T : in out Test);
end AWA.Tags.Modules.Tests;
|
-- Copyright 2011-2014 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
begin
Dummy_Task.Start;
end Foo;
|
package Lto10_Pkg is
type U16 is mod 2 ** 16;
type Position is record
X, Y, Z : U16;
end record;
for Position'Size use 48;
type Pixel is record
Pos : Position;
end record;
pragma Pack (Pixel);
Minus_One : Integer := -1;
Pix : Pixel := (Pos => (X => 0, Y => 0, Z => 0));
end Lto10_Pkg;
|
-- Copyright (c) 1990 Regents of the University of California.
-- All rights reserved.
--
-- The primary authors of ayacc were David Taback and Deepak Tolani.
-- Enhancements were made by Ronald J. Schmalz.
--
-- Send requests for ayacc information to ayacc-info@ics.uci.edu
-- Send bug reports for ayacc to ayacc-bugs@ics.uci.edu
--
-- Redistribution and use in source and binary forms are permitted
-- provided that the above copyright notice and this paragraph are
-- duplicated in all such forms and that any documentation,
-- advertising materials, and other materials related to such
-- distribution and use acknowledge that the software was developed
-- by the University of California, Irvine. The name of the
-- University may not be used to endorse or promote products derived
-- from this software without specific prior written permission.
-- THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
-- IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
-- WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-- Module : options.ada
-- Component of : ayacc
-- Version : 1.2
-- Date : 11/21/86 12:31:39
-- SCCS File : disk21~/rschm/hasee/sccs/ayacc/sccs/sxoptions.ada
-- $Header: options.a,v 0.1 86/04/01 15:08:15 ada Exp $
-- $Log: options.a,v $
-- Revision 0.1 86/04/01 15:08:15 ada
-- This version fixes some minor bugs with empty grammars
-- and $$ expansion. It also uses vads5.1b enhancements
-- such as pragma inline.
--
--
-- Revision 0.0 86/02/19 18:37:34 ada
--
-- These files comprise the initial version of Ayacc
-- designed and implemented by David Taback and Deepak Tolani.
-- Ayacc has been compiled and tested under the Verdix Ada compiler
-- version 4.06 on a vax 11/750 running Unix 4.2BSD.
--
package Options is
procedure Set_Options(S: in String);
-- SET_OPTIONS sets the debug and verbose flags according
-- the the string S.
-- If S contains the characters 'v' or 'V', the verbose
-- option is set.
-- If S contains the charactars 'c' or 'C', the vebose conflicts
-- option is set.
-- If S contains the characters 'd' or 'D', the debug
-- option is set.
-- If S contains the characters 's' or 'S', the summary option
-- is set.
-- UMASS CODES :
-- If S contains the characters 'e' or 'E', the error recovery
-- extension option is set.
-- END OF UMASS CODES.
function Verbose return Boolean;
-- Returns TRUE if the verbose file is to be created.
function Verbose_Conflict return Boolean;
-- Returns TRUE if only the states involved in conflicts
-- are to printed.
function Debug return Boolean;
-- Returns TRUE if the YYPARSE procedure should generate
-- debugging output.
function Summary return Boolean;
-- Returns TRUE if a summary of statistics of the generated
-- parser should be printed.
function Interface_to_C return Boolean;
function Loud return Boolean;
-- Returns TRUE if Ayacc should output useless and annoying information
-- while it is running.
-- UMASS CODES :
function Error_Recovery_Extension return Boolean;
-- Returns TRUE if the codes of error recovery extension should
-- be generated.
-- END OF UMASS CODES.
Illegal_Option: exception;
end Options;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with System.Storage_Pools.Subpools;
with Program.Elements.Pragmas;
with Program.Elements.Defining_Names;
with Program.Elements.Defining_Identifiers;
with Program.Elements.Defining_Character_Literals;
with Program.Elements.Defining_Operator_Symbols;
with Program.Elements.Defining_Expanded_Names;
with Program.Elements.Type_Declarations;
with Program.Elements.Task_Type_Declarations;
with Program.Elements.Protected_Type_Declarations;
with Program.Elements.Subtype_Declarations;
with Program.Elements.Object_Declarations;
with Program.Elements.Single_Task_Declarations;
with Program.Elements.Single_Protected_Declarations;
with Program.Elements.Number_Declarations;
with Program.Elements.Enumeration_Literal_Specifications;
with Program.Elements.Discriminant_Specifications;
with Program.Elements.Component_Declarations;
with Program.Elements.Loop_Parameter_Specifications;
with Program.Elements.Generalized_Iterator_Specifications;
with Program.Elements.Element_Iterator_Specifications;
with Program.Elements.Procedure_Declarations;
with Program.Elements.Function_Declarations;
with Program.Elements.Parameter_Specifications;
with Program.Elements.Procedure_Body_Declarations;
with Program.Elements.Function_Body_Declarations;
with Program.Elements.Return_Object_Specifications;
with Program.Elements.Package_Declarations;
with Program.Elements.Package_Body_Declarations;
with Program.Elements.Object_Renaming_Declarations;
with Program.Elements.Exception_Renaming_Declarations;
with Program.Elements.Procedure_Renaming_Declarations;
with Program.Elements.Function_Renaming_Declarations;
with Program.Elements.Package_Renaming_Declarations;
with Program.Elements.Generic_Package_Renaming_Declarations;
with Program.Elements.Generic_Procedure_Renaming_Declarations;
with Program.Elements.Generic_Function_Renaming_Declarations;
with Program.Elements.Task_Body_Declarations;
with Program.Elements.Protected_Body_Declarations;
with Program.Elements.Entry_Declarations;
with Program.Elements.Entry_Body_Declarations;
with Program.Elements.Entry_Index_Specifications;
with Program.Elements.Procedure_Body_Stubs;
with Program.Elements.Function_Body_Stubs;
with Program.Elements.Package_Body_Stubs;
with Program.Elements.Task_Body_Stubs;
with Program.Elements.Protected_Body_Stubs;
with Program.Elements.Exception_Declarations;
with Program.Elements.Choice_Parameter_Specifications;
with Program.Elements.Generic_Package_Declarations;
with Program.Elements.Generic_Procedure_Declarations;
with Program.Elements.Generic_Function_Declarations;
with Program.Elements.Package_Instantiations;
with Program.Elements.Procedure_Instantiations;
with Program.Elements.Function_Instantiations;
with Program.Elements.Formal_Object_Declarations;
with Program.Elements.Formal_Type_Declarations;
with Program.Elements.Formal_Procedure_Declarations;
with Program.Elements.Formal_Function_Declarations;
with Program.Elements.Formal_Package_Declarations;
with Program.Elements.Definitions;
with Program.Elements.Subtype_Indications;
with Program.Elements.Constraints;
with Program.Elements.Component_Definitions;
with Program.Elements.Discrete_Ranges;
with Program.Elements.Discrete_Subtype_Indications;
with Program.Elements.Discrete_Range_Attribute_References;
with Program.Elements.Discrete_Simple_Expression_Ranges;
with Program.Elements.Unknown_Discriminant_Parts;
with Program.Elements.Known_Discriminant_Parts;
with Program.Elements.Record_Definitions;
with Program.Elements.Null_Components;
with Program.Elements.Variant_Parts;
with Program.Elements.Variants;
with Program.Elements.Others_Choices;
with Program.Elements.Anonymous_Access_To_Objects;
with Program.Elements.Anonymous_Access_To_Procedures;
with Program.Elements.Anonymous_Access_To_Functions;
with Program.Elements.Private_Type_Definitions;
with Program.Elements.Private_Extension_Definitions;
with Program.Elements.Incomplete_Type_Definitions;
with Program.Elements.Task_Definitions;
with Program.Elements.Protected_Definitions;
with Program.Elements.Formal_Type_Definitions;
with Program.Elements.Aspect_Specifications;
with Program.Elements.Real_Range_Specifications;
with Program.Elements.Expressions;
with Program.Elements.Numeric_Literals;
with Program.Elements.String_Literals;
with Program.Elements.Identifiers;
with Program.Elements.Operator_Symbols;
with Program.Elements.Character_Literals;
with Program.Elements.Explicit_Dereferences;
with Program.Elements.Infix_Operators;
with Program.Elements.Function_Calls;
with Program.Elements.Indexed_Components;
with Program.Elements.Slices;
with Program.Elements.Selected_Components;
with Program.Elements.Attribute_References;
with Program.Elements.Record_Aggregates;
with Program.Elements.Extension_Aggregates;
with Program.Elements.Array_Aggregates;
with Program.Elements.Short_Circuit_Operations;
with Program.Elements.Membership_Tests;
with Program.Elements.Null_Literals;
with Program.Elements.Parenthesized_Expressions;
with Program.Elements.Raise_Expressions;
with Program.Elements.Type_Conversions;
with Program.Elements.Qualified_Expressions;
with Program.Elements.Allocators;
with Program.Elements.Case_Expressions;
with Program.Elements.If_Expressions;
with Program.Elements.Quantified_Expressions;
with Program.Elements.Discriminant_Associations;
with Program.Elements.Record_Component_Associations;
with Program.Elements.Array_Component_Associations;
with Program.Elements.Parameter_Associations;
with Program.Elements.Formal_Package_Associations;
with Program.Elements.Null_Statements;
with Program.Elements.Assignment_Statements;
with Program.Elements.If_Statements;
with Program.Elements.Case_Statements;
with Program.Elements.Loop_Statements;
with Program.Elements.While_Loop_Statements;
with Program.Elements.For_Loop_Statements;
with Program.Elements.Block_Statements;
with Program.Elements.Exit_Statements;
with Program.Elements.Goto_Statements;
with Program.Elements.Call_Statements;
with Program.Elements.Simple_Return_Statements;
with Program.Elements.Extended_Return_Statements;
with Program.Elements.Accept_Statements;
with Program.Elements.Requeue_Statements;
with Program.Elements.Delay_Statements;
with Program.Elements.Terminate_Alternative_Statements;
with Program.Elements.Select_Statements;
with Program.Elements.Abort_Statements;
with Program.Elements.Raise_Statements;
with Program.Elements.Code_Statements;
with Program.Elements.Elsif_Paths;
with Program.Elements.Case_Paths;
with Program.Elements.Select_Paths;
with Program.Elements.Case_Expression_Paths;
with Program.Elements.Elsif_Expression_Paths;
with Program.Elements.Use_Clauses;
with Program.Elements.With_Clauses;
with Program.Elements.Component_Clauses;
with Program.Elements.Derived_Types;
with Program.Elements.Derived_Record_Extensions;
with Program.Elements.Enumeration_Types;
with Program.Elements.Signed_Integer_Types;
with Program.Elements.Modular_Types;
with Program.Elements.Root_Types;
with Program.Elements.Floating_Point_Types;
with Program.Elements.Ordinary_Fixed_Point_Types;
with Program.Elements.Decimal_Fixed_Point_Types;
with Program.Elements.Unconstrained_Array_Types;
with Program.Elements.Constrained_Array_Types;
with Program.Elements.Record_Types;
with Program.Elements.Interface_Types;
with Program.Elements.Object_Access_Types;
with Program.Elements.Procedure_Access_Types;
with Program.Elements.Function_Access_Types;
with Program.Elements.Formal_Private_Type_Definitions;
with Program.Elements.Formal_Derived_Type_Definitions;
with Program.Elements.Formal_Discrete_Type_Definitions;
with Program.Elements.Formal_Signed_Integer_Type_Definitions;
with Program.Elements.Formal_Modular_Type_Definitions;
with Program.Elements.Formal_Floating_Point_Definitions;
with Program.Elements.Formal_Ordinary_Fixed_Point_Definitions;
with Program.Elements.Formal_Decimal_Fixed_Point_Definitions;
with Program.Elements.Formal_Unconstrained_Array_Types;
with Program.Elements.Formal_Constrained_Array_Types;
with Program.Elements.Formal_Object_Access_Types;
with Program.Elements.Formal_Procedure_Access_Types;
with Program.Elements.Formal_Function_Access_Types;
with Program.Elements.Formal_Interface_Types;
with Program.Elements.Range_Attribute_References;
with Program.Elements.Simple_Expression_Ranges;
with Program.Elements.Digits_Constraints;
with Program.Elements.Delta_Constraints;
with Program.Elements.Index_Constraints;
with Program.Elements.Discriminant_Constraints;
with Program.Elements.Attribute_Definition_Clauses;
with Program.Elements.Enumeration_Representation_Clauses;
with Program.Elements.Record_Representation_Clauses;
with Program.Elements.At_Clauses;
with Program.Elements.Exception_Handlers;
with Program.Lexical_Elements;
with Program.Element_Vectors;
package Program.Implicit_Element_Factories is
pragma Preelaborate;
type Element_Factory (Subpool : not null System.Storage_Pools.Subpools
.Subpool_Handle) is tagged limited private;
not overriding function Create_Pragma
(Self : Element_Factory;
Name : not null Program.Elements.Identifiers
.Identifier_Access;
Arguments : Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Pragmas.Pragma_Access;
not overriding function Create_Defining_Identifier
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
not overriding function Create_Defining_Character_Literal
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Defining_Character_Literals
.Defining_Character_Literal_Access;
not overriding function Create_Defining_Operator_Symbol
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Defining_Operator_Symbols
.Defining_Operator_Symbol_Access;
not overriding function Create_Defining_Expanded_Name
(Self : Element_Factory;
Prefix : not null Program.Elements.Expressions
.Expression_Access;
Selector : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Defining_Expanded_Names
.Defining_Expanded_Name_Access;
not overriding function Create_Type_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Discriminant_Part : Program.Elements.Definitions.Definition_Access;
Definition : not null Program.Elements.Definitions
.Definition_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 not null Program.Elements.Type_Declarations
.Type_Declaration_Access;
not overriding function Create_Task_Type_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Discriminant_Part : Program.Elements.Known_Discriminant_Parts
.Known_Discriminant_Part_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Definition : not null Program.Elements.Task_Definitions
.Task_Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Task_Type_Declarations
.Task_Type_Declaration_Access;
not overriding function Create_Protected_Type_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Discriminant_Part : Program.Elements.Known_Discriminant_Parts
.Known_Discriminant_Part_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Definition : not null Program.Elements.Protected_Definitions
.Protected_Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Protected_Type_Declarations
.Protected_Type_Declaration_Access;
not overriding function Create_Subtype_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Subtype_Indication : not null Program.Elements.Subtype_Indications
.Subtype_Indication_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 not null Program.Elements.Subtype_Declarations
.Subtype_Declaration_Access;
not overriding function Create_Object_Declaration
(Self : Element_Factory;
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Object_Subtype : not null Program.Elements.Definitions
.Definition_Access;
Initialization_Expression : Program.Elements.Expressions
.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Aliased : Boolean := False;
Has_Constant : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Object_Declarations
.Object_Declaration_Access;
not overriding function Create_Single_Task_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Definition : not null Program.Elements.Task_Definitions
.Task_Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Single_Task_Declarations
.Single_Task_Declaration_Access;
not overriding function Create_Single_Protected_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Definition : not null Program.Elements.Protected_Definitions
.Protected_Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Single_Protected_Declarations
.Single_Protected_Declaration_Access;
not overriding function Create_Number_Declaration
(Self : Element_Factory;
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Number_Declarations
.Number_Declaration_Access;
not overriding function Create_Enumeration_Literal_Specification
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Enumeration_Literal_Specifications
.Enumeration_Literal_Specification_Access;
not overriding function Create_Discriminant_Specification
(Self : Element_Factory;
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Object_Subtype : not null Program.Elements.Element_Access;
Default_Expression : Program.Elements.Expressions.Expression_Access;
Has_Not_Null : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Discriminant_Specifications
.Discriminant_Specification_Access;
not overriding function Create_Component_Declaration
(Self : Element_Factory;
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Object_Subtype : not null Program.Elements.Component_Definitions
.Component_Definition_Access;
Default_Expression : 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 not null Program.Elements.Component_Declarations
.Component_Declaration_Access;
not overriding function Create_Loop_Parameter_Specification
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Definition : not null Program.Elements.Discrete_Ranges
.Discrete_Range_Access;
Has_Reverse : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Loop_Parameter_Specifications
.Loop_Parameter_Specification_Access;
not overriding function Create_Generalized_Iterator_Specification
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Iterator_Name : not null Program.Elements.Expressions
.Expression_Access;
Has_Reverse : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Generalized_Iterator_Specifications
.Generalized_Iterator_Specification_Access;
not overriding function Create_Element_Iterator_Specification
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Subtype_Indication : not null Program.Elements.Subtype_Indications
.Subtype_Indication_Access;
Iterable_Name : not null Program.Elements.Expressions
.Expression_Access;
Has_Reverse : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Element_Iterator_Specifications
.Element_Iterator_Specification_Access;
not overriding function Create_Procedure_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Has_Abstract : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Procedure_Declarations
.Procedure_Declaration_Access;
not overriding function Create_Function_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Result_Expression : Program.Elements.Parenthesized_Expressions
.Parenthesized_Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Has_Abstract : Boolean := False;
Has_Not_Null : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Function_Declarations
.Function_Declaration_Access;
not overriding function Create_Parameter_Specification
(Self : Element_Factory;
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Parameter_Subtype : not null Program.Elements.Element_Access;
Default_Expression : Program.Elements.Expressions.Expression_Access;
Has_Aliased : Boolean := False;
Has_In : Boolean := False;
Has_Out : Boolean := False;
Has_Not_Null : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Parameter_Specifications
.Parameter_Specification_Access;
not overriding function Create_Procedure_Body_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Declarations : Program.Element_Vectors.Element_Vector_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Exception_Handlers : Program.Elements.Exception_Handlers
.Exception_Handler_Vector_Access;
End_Name : Program.Elements.Expressions.Expression_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Procedure_Body_Declarations
.Procedure_Body_Declaration_Access;
not overriding function Create_Function_Body_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Declarations : Program.Element_Vectors.Element_Vector_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Exception_Handlers : Program.Elements.Exception_Handlers
.Exception_Handler_Vector_Access;
End_Name : Program.Elements.Expressions.Expression_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Has_Not_Null : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Function_Body_Declarations
.Function_Body_Declaration_Access;
not overriding function Create_Return_Object_Specification
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Object_Subtype : not null Program.Elements.Element_Access;
Expression : Program.Elements.Expressions.Expression_Access;
Has_Aliased : Boolean := False;
Has_Constant : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Return_Object_Specifications
.Return_Object_Specification_Access;
not overriding function Create_Package_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Visible_Declarations : Program.Element_Vectors.Element_Vector_Access;
Private_Declarations : Program.Element_Vectors.Element_Vector_Access;
End_Name : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Package_Declarations
.Package_Declaration_Access;
not overriding function Create_Package_Body_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Declarations : Program.Element_Vectors.Element_Vector_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Exception_Handlers : Program.Elements.Exception_Handlers
.Exception_Handler_Vector_Access;
End_Name : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Package_Body_Declarations
.Package_Body_Declaration_Access;
not overriding function Create_Object_Renaming_Declaration
(Self : Element_Factory;
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Object_Subtype : not null Program.Elements.Element_Access;
Renamed_Object : not null Program.Elements.Expressions
.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not_Null : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Object_Renaming_Declarations
.Object_Renaming_Declaration_Access;
not overriding function Create_Exception_Renaming_Declaration
(Self : Element_Factory;
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Renamed_Exception : 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 not null Program.Elements.Exception_Renaming_Declarations
.Exception_Renaming_Declaration_Access;
not overriding function Create_Procedure_Renaming_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Renamed_Procedure : Program.Elements.Expressions.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Procedure_Renaming_Declarations
.Procedure_Renaming_Declaration_Access;
not overriding function Create_Function_Renaming_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Renamed_Function : Program.Elements.Expressions.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Has_Not_Null : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Function_Renaming_Declarations
.Function_Renaming_Declaration_Access;
not overriding function Create_Package_Renaming_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Renamed_Package : 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 not null Program.Elements.Package_Renaming_Declarations
.Package_Renaming_Declaration_Access;
not overriding function Create_Generic_Package_Renaming_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Renamed_Package : 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 not null Program.Elements.Generic_Package_Renaming_Declarations
.Generic_Package_Renaming_Declaration_Access;
not overriding function Create_Generic_Procedure_Renaming_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Renamed_Procedure : 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 not null Program.Elements.Generic_Procedure_Renaming_Declarations
.Generic_Procedure_Renaming_Declaration_Access;
not overriding function Create_Generic_Function_Renaming_Declaration
(Self : Element_Factory;
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 not null Program.Elements.Generic_Function_Renaming_Declarations
.Generic_Function_Renaming_Declaration_Access;
not overriding function Create_Task_Body_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Declarations : Program.Element_Vectors.Element_Vector_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Exception_Handlers : Program.Elements.Exception_Handlers
.Exception_Handler_Vector_Access;
End_Name : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Task_Body_Declarations
.Task_Body_Declaration_Access;
not overriding function Create_Protected_Body_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Protected_Operations : not null Program.Element_Vectors
.Element_Vector_Access;
End_Name : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Protected_Body_Declarations
.Protected_Body_Declaration_Access;
not overriding function Create_Entry_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Entry_Family_Definition : Program.Elements.Discrete_Ranges
.Discrete_Range_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Entry_Declarations
.Entry_Declaration_Access;
not overriding function Create_Entry_Body_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Entry_Index : not null Program.Elements
.Entry_Index_Specifications.Entry_Index_Specification_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Entry_Barrier : not null Program.Elements.Expressions
.Expression_Access;
Declarations : Program.Element_Vectors.Element_Vector_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Exception_Handlers : Program.Elements.Exception_Handlers
.Exception_Handler_Vector_Access;
End_Name : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Entry_Body_Declarations
.Entry_Body_Declaration_Access;
not overriding function Create_Entry_Index_Specification
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Entry_Index_Subtype : not null Program.Elements.Discrete_Ranges
.Discrete_Range_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Entry_Index_Specifications
.Entry_Index_Specification_Access;
not overriding function Create_Procedure_Body_Stub
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Procedure_Body_Stubs
.Procedure_Body_Stub_Access;
not overriding function Create_Function_Body_Stub
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Has_Not_Null : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Function_Body_Stubs
.Function_Body_Stub_Access;
not overriding function Create_Package_Body_Stub
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_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 not null Program.Elements.Package_Body_Stubs
.Package_Body_Stub_Access;
not overriding function Create_Task_Body_Stub
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_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 not null Program.Elements.Task_Body_Stubs.Task_Body_Stub_Access;
not overriding function Create_Protected_Body_Stub
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_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 not null Program.Elements.Protected_Body_Stubs
.Protected_Body_Stub_Access;
not overriding function Create_Exception_Declaration
(Self : Element_Factory;
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_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 not null Program.Elements.Exception_Declarations
.Exception_Declaration_Access;
not overriding function Create_Choice_Parameter_Specification
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Choice_Parameter_Specifications
.Choice_Parameter_Specification_Access;
not overriding function Create_Generic_Package_Declaration
(Self : Element_Factory;
Formal_Parameters : Program.Element_Vectors.Element_Vector_Access;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Visible_Declarations : Program.Element_Vectors.Element_Vector_Access;
Private_Declarations : Program.Element_Vectors.Element_Vector_Access;
End_Name : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Generic_Package_Declarations
.Generic_Package_Declaration_Access;
not overriding function Create_Generic_Procedure_Declaration
(Self : Element_Factory;
Formal_Parameters : Program.Element_Vectors.Element_Vector_Access;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_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 not null Program.Elements.Generic_Procedure_Declarations
.Generic_Procedure_Declaration_Access;
not overriding function Create_Generic_Function_Declaration
(Self : Element_Factory;
Formal_Parameters : Program.Element_Vectors.Element_Vector_Access;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not_Null : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Generic_Function_Declarations
.Generic_Function_Declaration_Access;
not overriding function Create_Package_Instantiation
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Generic_Package_Name : not null Program.Elements.Expressions
.Expression_Access;
Parameters : Program.Elements.Parameter_Associations
.Parameter_Association_Vector_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 not null Program.Elements.Package_Instantiations
.Package_Instantiation_Access;
not overriding function Create_Procedure_Instantiation
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Generic_Procedure_Name : not null Program.Elements.Expressions
.Expression_Access;
Parameters : Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Procedure_Instantiations
.Procedure_Instantiation_Access;
not overriding function Create_Function_Instantiation
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Generic_Function_Name : not null Program.Elements.Expressions
.Expression_Access;
Parameters : Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Function_Instantiations
.Function_Instantiation_Access;
not overriding function Create_Formal_Object_Declaration
(Self : Element_Factory;
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Object_Subtype : not null Program.Elements.Element_Access;
Default_Expression : Program.Elements.Expressions.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_In : Boolean := False;
Has_Out : Boolean := False;
Has_Not_Null : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Object_Declarations
.Formal_Object_Declaration_Access;
not overriding function Create_Formal_Type_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Discriminant_Part : Program.Elements.Definitions.Definition_Access;
Definition : not null Program.Elements.Formal_Type_Definitions
.Formal_Type_Definition_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 not null Program.Elements.Formal_Type_Declarations
.Formal_Type_Declaration_Access;
not overriding function Create_Formal_Procedure_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Subprogram_Default : Program.Elements.Expressions.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Abstract : Boolean := False;
Has_Null : Boolean := False;
Has_Box : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Procedure_Declarations
.Formal_Procedure_Declaration_Access;
not overriding function Create_Formal_Function_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Subprogram_Default : Program.Elements.Expressions.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Has_Not_Null : Boolean := False;
Has_Abstract : Boolean := False;
Has_Box : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Function_Declarations
.Formal_Function_Declaration_Access;
not overriding function Create_Formal_Package_Declaration
(Self : Element_Factory;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Generic_Package_Name : not null Program.Elements.Expressions
.Expression_Access;
Parameters : Program.Elements.Formal_Package_Associations
.Formal_Package_Association_Vector_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 not null Program.Elements.Formal_Package_Declarations
.Formal_Package_Declaration_Access;
not overriding function Create_Subtype_Indication
(Self : Element_Factory;
Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
Constraint : Program.Elements.Constraints.Constraint_Access;
Has_Not_Null : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Subtype_Indications
.Subtype_Indication_Access;
not overriding function Create_Component_Definition
(Self : Element_Factory;
Subtype_Indication : not null Program.Elements.Element_Access;
Has_Aliased : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Component_Definitions
.Component_Definition_Access;
not overriding function Create_Discrete_Subtype_Indication
(Self : Element_Factory;
Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
Constraint : Program.Elements.Constraints
.Constraint_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False;
Is_Discrete_Subtype_Definition : Boolean := False)
return not null Program.Elements.Discrete_Subtype_Indications
.Discrete_Subtype_Indication_Access;
not overriding function Create_Discrete_Range_Attribute_Reference
(Self : Element_Factory;
Range_Attribute : not null Program.Elements
.Attribute_References.Attribute_Reference_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False;
Is_Discrete_Subtype_Definition : Boolean := False)
return not null Program.Elements.Discrete_Range_Attribute_References
.Discrete_Range_Attribute_Reference_Access;
not overriding function Create_Discrete_Simple_Expression_Range
(Self : Element_Factory;
Lower_Bound : not null Program.Elements.Expressions
.Expression_Access;
Upper_Bound : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False;
Is_Discrete_Subtype_Definition : Boolean := False)
return not null Program.Elements.Discrete_Simple_Expression_Ranges
.Discrete_Simple_Expression_Range_Access;
not overriding function Create_Unknown_Discriminant_Part
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Unknown_Discriminant_Parts
.Unknown_Discriminant_Part_Access;
not overriding function Create_Known_Discriminant_Part
(Self : Element_Factory;
Discriminants : Program.Elements.Discriminant_Specifications
.Discriminant_Specification_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Known_Discriminant_Parts
.Known_Discriminant_Part_Access;
not overriding function Create_Record_Definition
(Self : Element_Factory;
Components : not null Program.Element_Vectors
.Element_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Record_Definitions
.Record_Definition_Access;
not overriding function Create_Null_Component
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Null_Components.Null_Component_Access;
not overriding function Create_Variant_Part
(Self : Element_Factory;
Discriminant : not null Program.Elements.Identifiers
.Identifier_Access;
Variants : not null Program.Elements.Variants
.Variant_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Variant_Parts.Variant_Part_Access;
not overriding function Create_Variant
(Self : Element_Factory;
Choices : not null Program.Element_Vectors
.Element_Vector_Access;
Components : not null Program.Element_Vectors
.Element_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Variants.Variant_Access;
not overriding function Create_Others_Choice
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Others_Choices.Others_Choice_Access;
not overriding function Create_Anonymous_Access_To_Object
(Self : Element_Factory;
Subtype_Indication : not null Program.Elements.Subtype_Indications
.Subtype_Indication_Access;
Has_Not_Null : Boolean := False;
Has_All : Boolean := False;
Has_Constant : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Anonymous_Access_To_Objects
.Anonymous_Access_To_Object_Access;
not overriding function Create_Anonymous_Access_To_Procedure
(Self : Element_Factory;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Has_Not_Null : Boolean := False;
Has_Protected : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Anonymous_Access_To_Procedures
.Anonymous_Access_To_Procedure_Access;
not overriding function Create_Anonymous_Access_To_Function
(Self : Element_Factory;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Has_Not_Null : Boolean := False;
Has_Protected : Boolean := False;
Has_Not_Null_2 : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Anonymous_Access_To_Functions
.Anonymous_Access_To_Function_Access;
not overriding function Create_Private_Type_Definition
(Self : Element_Factory;
Has_Abstract : Boolean := False;
Has_Tagged : Boolean := False;
Has_Limited : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Private_Type_Definitions
.Private_Type_Definition_Access;
not overriding function Create_Private_Extension_Definition
(Self : Element_Factory;
Ancestor : not null Program.Elements.Subtype_Indications
.Subtype_Indication_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Has_Abstract : Boolean := False;
Has_Limited : Boolean := False;
Has_Synchronized : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Private_Extension_Definitions
.Private_Extension_Definition_Access;
not overriding function Create_Incomplete_Type_Definition
(Self : Element_Factory;
Has_Tagged : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Incomplete_Type_Definitions
.Incomplete_Type_Definition_Access;
not overriding function Create_Task_Definition
(Self : Element_Factory;
Visible_Declarations : Program.Element_Vectors.Element_Vector_Access;
Private_Declarations : Program.Element_Vectors.Element_Vector_Access;
End_Name : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Task_Definitions.Task_Definition_Access;
not overriding function Create_Protected_Definition
(Self : Element_Factory;
Visible_Declarations : Program.Element_Vectors.Element_Vector_Access;
Private_Declarations : Program.Element_Vectors.Element_Vector_Access;
End_Name : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Protected_Definitions
.Protected_Definition_Access;
not overriding function Create_Aspect_Specification
(Self : Element_Factory;
Aspect_Mark : not null Program.Elements.Expressions
.Expression_Access;
Aspect_Definition : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Aspect_Specifications
.Aspect_Specification_Access;
not overriding function Create_Real_Range_Specification
(Self : Element_Factory;
Lower_Bound : not null Program.Elements.Expressions
.Expression_Access;
Upper_Bound : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Real_Range_Specifications
.Real_Range_Specification_Access;
not overriding function Create_Numeric_Literal
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Numeric_Literals.Numeric_Literal_Access;
not overriding function Create_String_Literal
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.String_Literals.String_Literal_Access;
not overriding function Create_Identifier
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Identifiers.Identifier_Access;
not overriding function Create_Operator_Symbol
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Operator_Symbols.Operator_Symbol_Access;
not overriding function Create_Character_Literal
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Character_Literals
.Character_Literal_Access;
not overriding function Create_Explicit_Dereference
(Self : Element_Factory;
Prefix : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Explicit_Dereferences
.Explicit_Dereference_Access;
not overriding function Create_Infix_Operator
(Self : Element_Factory;
Left : Program.Elements.Expressions.Expression_Access;
Operator : not null Program.Elements.Operator_Symbols
.Operator_Symbol_Access;
Right : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Infix_Operators.Infix_Operator_Access;
not overriding function Create_Function_Call
(Self : Element_Factory;
Prefix : not null Program.Elements.Expressions
.Expression_Access;
Parameters : Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Function_Calls.Function_Call_Access;
not overriding function Create_Indexed_Component
(Self : Element_Factory;
Prefix : not null Program.Elements.Expressions
.Expression_Access;
Expressions : Program.Elements.Expressions
.Expression_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Indexed_Components
.Indexed_Component_Access;
not overriding function Create_Slice
(Self : Element_Factory;
Prefix : not null Program.Elements.Expressions
.Expression_Access;
Slice_Range : not null Program.Elements.Discrete_Ranges
.Discrete_Range_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Slices.Slice_Access;
not overriding function Create_Selected_Component
(Self : Element_Factory;
Prefix : not null Program.Elements.Expressions
.Expression_Access;
Selector : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Selected_Components
.Selected_Component_Access;
not overriding function Create_Attribute_Reference
(Self : Element_Factory;
Prefix : not null Program.Elements.Expressions
.Expression_Access;
Attribute_Designator : not null Program.Elements.Identifiers
.Identifier_Access;
Expressions : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Attribute_References
.Attribute_Reference_Access;
not overriding function Create_Record_Aggregate
(Self : Element_Factory;
Components : Program.Elements.Record_Component_Associations
.Record_Component_Association_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Record_Aggregates
.Record_Aggregate_Access;
not overriding function Create_Extension_Aggregate
(Self : Element_Factory;
Ancestor : not null Program.Elements.Expressions
.Expression_Access;
Components : Program.Elements.Record_Component_Associations
.Record_Component_Association_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Extension_Aggregates
.Extension_Aggregate_Access;
not overriding function Create_Array_Aggregate
(Self : Element_Factory;
Components : Program.Elements.Array_Component_Associations
.Array_Component_Association_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Array_Aggregates.Array_Aggregate_Access;
not overriding function Create_Short_Circuit_Operation
(Self : Element_Factory;
Left : not null Program.Elements.Expressions
.Expression_Access;
Right : not null Program.Elements.Expressions
.Expression_Access;
Has_And_Then : Boolean := False;
Has_Or_Else : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Short_Circuit_Operations
.Short_Circuit_Operation_Access;
not overriding function Create_Membership_Test
(Self : Element_Factory;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Choices : not null Program.Element_Vectors
.Element_Vector_Access;
Has_Not : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Membership_Tests.Membership_Test_Access;
not overriding function Create_Null_Literal
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Null_Literals.Null_Literal_Access;
not overriding function Create_Parenthesized_Expression
(Self : Element_Factory;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Parenthesized_Expressions
.Parenthesized_Expression_Access;
not overriding function Create_Raise_Expression
(Self : Element_Factory;
Exception_Name : not null Program.Elements.Expressions
.Expression_Access;
Associated_Message : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Raise_Expressions
.Raise_Expression_Access;
not overriding function Create_Type_Conversion
(Self : Element_Factory;
Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
Operand : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Type_Conversions.Type_Conversion_Access;
not overriding function Create_Qualified_Expression
(Self : Element_Factory;
Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
Operand : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Qualified_Expressions
.Qualified_Expression_Access;
not overriding function Create_Allocator
(Self : Element_Factory;
Subpool_Name : Program.Elements.Expressions.Expression_Access;
Subtype_Indication : Program.Elements.Subtype_Indications
.Subtype_Indication_Access;
Qualified_Expression : Program.Elements.Qualified_Expressions
.Qualified_Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Allocators.Allocator_Access;
not overriding function Create_Case_Expression
(Self : Element_Factory;
Selecting_Expression : not null Program.Elements.Expressions
.Expression_Access;
Paths : not null Program.Elements.Case_Expression_Paths
.Case_Expression_Path_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Case_Expressions.Case_Expression_Access;
not overriding function Create_If_Expression
(Self : Element_Factory;
Condition : not null Program.Elements.Expressions
.Expression_Access;
Then_Expression : not null Program.Elements.Expressions
.Expression_Access;
Elsif_Paths : Program.Elements.Elsif_Paths
.Elsif_Path_Vector_Access;
Else_Expression : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.If_Expressions.If_Expression_Access;
not overriding function Create_Quantified_Expression
(Self : Element_Factory;
Parameter : Program.Elements.Loop_Parameter_Specifications
.Loop_Parameter_Specification_Access;
Generalized_Iterator : Program.Elements
.Generalized_Iterator_Specifications
.Generalized_Iterator_Specification_Access;
Element_Iterator : Program.Elements.Element_Iterator_Specifications
.Element_Iterator_Specification_Access;
Predicate : not null Program.Elements.Expressions
.Expression_Access;
Has_All : Boolean := False;
Has_Some : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Quantified_Expressions
.Quantified_Expression_Access;
not overriding function Create_Discriminant_Association
(Self : Element_Factory;
Selector_Names : Program.Elements.Identifiers
.Identifier_Vector_Access;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Discriminant_Associations
.Discriminant_Association_Access;
not overriding function Create_Record_Component_Association
(Self : Element_Factory;
Choices : Program.Element_Vectors.Element_Vector_Access;
Expression : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Record_Component_Associations
.Record_Component_Association_Access;
not overriding function Create_Array_Component_Association
(Self : Element_Factory;
Choices : Program.Element_Vectors.Element_Vector_Access;
Expression : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Array_Component_Associations
.Array_Component_Association_Access;
not overriding function Create_Parameter_Association
(Self : Element_Factory;
Formal_Parameter : Program.Elements.Expressions.Expression_Access;
Actual_Parameter : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Parameter_Associations
.Parameter_Association_Access;
not overriding function Create_Formal_Package_Association
(Self : Element_Factory;
Formal_Parameter : Program.Elements.Expressions.Expression_Access;
Actual_Parameter : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Package_Associations
.Formal_Package_Association_Access;
not overriding function Create_Null_Statement
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Null_Statements.Null_Statement_Access;
not overriding function Create_Assignment_Statement
(Self : Element_Factory;
Variable_Name : not null Program.Elements.Expressions
.Expression_Access;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Assignment_Statements
.Assignment_Statement_Access;
not overriding function Create_If_Statement
(Self : Element_Factory;
Condition : not null Program.Elements.Expressions
.Expression_Access;
Then_Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Elsif_Paths : Program.Elements.Elsif_Paths
.Elsif_Path_Vector_Access;
Else_Statements : Program.Element_Vectors.Element_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.If_Statements.If_Statement_Access;
not overriding function Create_Case_Statement
(Self : Element_Factory;
Selecting_Expression : not null Program.Elements.Expressions
.Expression_Access;
Paths : not null Program.Elements.Case_Paths
.Case_Path_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Case_Statements.Case_Statement_Access;
not overriding function Create_Loop_Statement
(Self : Element_Factory;
Statement_Identifier : Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Loop_Statements.Loop_Statement_Access;
not overriding function Create_While_Loop_Statement
(Self : Element_Factory;
Statement_Identifier : Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Condition : not null Program.Elements.Expressions
.Expression_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.While_Loop_Statements
.While_Loop_Statement_Access;
not overriding function Create_For_Loop_Statement
(Self : Element_Factory;
Statement_Identifier : Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Loop_Parameter : Program.Elements.Loop_Parameter_Specifications
.Loop_Parameter_Specification_Access;
Generalized_Iterator : Program.Elements
.Generalized_Iterator_Specifications
.Generalized_Iterator_Specification_Access;
Element_Iterator : Program.Elements
.Element_Iterator_Specifications
.Element_Iterator_Specification_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.For_Loop_Statements
.For_Loop_Statement_Access;
not overriding function Create_Block_Statement
(Self : Element_Factory;
Statement_Identifier : Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Declarations : Program.Element_Vectors.Element_Vector_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Exception_Handlers : Program.Elements.Exception_Handlers
.Exception_Handler_Vector_Access;
End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Block_Statements.Block_Statement_Access;
not overriding function Create_Exit_Statement
(Self : Element_Factory;
Exit_Loop_Name : Program.Elements.Expressions.Expression_Access;
Condition : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Exit_Statements.Exit_Statement_Access;
not overriding function Create_Goto_Statement
(Self : Element_Factory;
Goto_Label : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Goto_Statements.Goto_Statement_Access;
not overriding function Create_Call_Statement
(Self : Element_Factory;
Called_Name : not null Program.Elements.Expressions
.Expression_Access;
Parameters : Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Call_Statements.Call_Statement_Access;
not overriding function Create_Simple_Return_Statement
(Self : Element_Factory;
Expression : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Simple_Return_Statements
.Simple_Return_Statement_Access;
not overriding function Create_Extended_Return_Statement
(Self : Element_Factory;
Return_Object : not null Program.Elements
.Return_Object_Specifications.Return_Object_Specification_Access;
Statements : Program.Element_Vectors.Element_Vector_Access;
Exception_Handlers : Program.Elements.Exception_Handlers
.Exception_Handler_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Extended_Return_Statements
.Extended_Return_Statement_Access;
not overriding function Create_Accept_Statement
(Self : Element_Factory;
Entry_Name : not null Program.Elements.Identifiers
.Identifier_Access;
Entry_Index : Program.Elements.Expressions.Expression_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Statements : Program.Element_Vectors.Element_Vector_Access;
Exception_Handlers : Program.Elements.Exception_Handlers
.Exception_Handler_Vector_Access;
End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Accept_Statements
.Accept_Statement_Access;
not overriding function Create_Requeue_Statement
(Self : Element_Factory;
Entry_Name : not null Program.Elements.Expressions
.Expression_Access;
Has_With_Abort : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Requeue_Statements
.Requeue_Statement_Access;
not overriding function Create_Delay_Statement
(Self : Element_Factory;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Delay_Statements.Delay_Statement_Access;
not overriding function Create_Terminate_Alternative_Statement
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Terminate_Alternative_Statements
.Terminate_Alternative_Statement_Access;
not overriding function Create_Select_Statement
(Self : Element_Factory;
Paths : not null Program.Elements.Select_Paths
.Select_Path_Vector_Access;
Then_Abort_Statements : Program.Element_Vectors.Element_Vector_Access;
Else_Statements : Program.Element_Vectors.Element_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Select_Statements
.Select_Statement_Access;
not overriding function Create_Abort_Statement
(Self : Element_Factory;
Aborted_Tasks : not null Program.Elements.Expressions
.Expression_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Abort_Statements.Abort_Statement_Access;
not overriding function Create_Raise_Statement
(Self : Element_Factory;
Raised_Exception : Program.Elements.Expressions.Expression_Access;
Associated_Message : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Raise_Statements.Raise_Statement_Access;
not overriding function Create_Code_Statement
(Self : Element_Factory;
Expression : not null Program.Elements.Qualified_Expressions
.Qualified_Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Code_Statements.Code_Statement_Access;
not overriding function Create_Elsif_Path
(Self : Element_Factory;
Condition : not null Program.Elements.Expressions
.Expression_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Elsif_Paths.Elsif_Path_Access;
not overriding function Create_Case_Path
(Self : Element_Factory;
Choices : not null Program.Element_Vectors
.Element_Vector_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Case_Paths.Case_Path_Access;
not overriding function Create_Select_Path
(Self : Element_Factory;
Guard : Program.Elements.Expressions.Expression_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Select_Paths.Select_Path_Access;
not overriding function Create_Case_Expression_Path
(Self : Element_Factory;
Choices : not null Program.Element_Vectors
.Element_Vector_Access;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Case_Expression_Paths
.Case_Expression_Path_Access;
not overriding function Create_Elsif_Expression_Path
(Self : Element_Factory;
Condition : not null Program.Elements.Expressions
.Expression_Access;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Elsif_Expression_Paths
.Elsif_Expression_Path_Access;
not overriding function Create_Use_Clause
(Self : Element_Factory;
Clause_Names : not null Program.Elements.Expressions
.Expression_Vector_Access;
Has_All : Boolean := False;
Has_Type : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Use_Clauses.Use_Clause_Access;
not overriding function Create_With_Clause
(Self : Element_Factory;
Clause_Names : not null Program.Elements.Expressions
.Expression_Vector_Access;
Has_Limited : Boolean := False;
Has_Private : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.With_Clauses.With_Clause_Access;
not overriding function Create_Component_Clause
(Self : Element_Factory;
Clause_Name : not null Program.Elements.Identifiers
.Identifier_Access;
Position : not null Program.Elements.Expressions
.Expression_Access;
Clause_Range : not null Program.Elements.Simple_Expression_Ranges
.Simple_Expression_Range_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Component_Clauses
.Component_Clause_Access;
not overriding function Create_Derived_Type
(Self : Element_Factory;
Parent : not null Program.Elements.Expressions
.Expression_Access;
Has_Abstract : Boolean := False;
Has_Limited : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Derived_Types.Derived_Type_Access;
not overriding function Create_Derived_Record_Extension
(Self : Element_Factory;
Parent : not null Program.Elements.Expressions
.Expression_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Record_Definition : not null Program.Elements.Definitions
.Definition_Access;
Has_Abstract : Boolean := False;
Has_Limited : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Derived_Record_Extensions
.Derived_Record_Extension_Access;
not overriding function Create_Enumeration_Type
(Self : Element_Factory;
Literals : not null Program.Elements
.Enumeration_Literal_Specifications
.Enumeration_Literal_Specification_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Enumeration_Types
.Enumeration_Type_Access;
not overriding function Create_Signed_Integer_Type
(Self : Element_Factory;
Lower_Bound : not null Program.Elements.Expressions
.Expression_Access;
Upper_Bound : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Signed_Integer_Types
.Signed_Integer_Type_Access;
not overriding function Create_Modular_Type
(Self : Element_Factory;
Modulus : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Modular_Types.Modular_Type_Access;
not overriding function Create_Root_Type
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Root_Types.Root_Type_Access;
not overriding function Create_Floating_Point_Type
(Self : Element_Factory;
Digits_Expression : not null Program.Elements.Expressions
.Expression_Access;
Real_Range : Program.Elements.Real_Range_Specifications
.Real_Range_Specification_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Floating_Point_Types
.Floating_Point_Type_Access;
not overriding function Create_Ordinary_Fixed_Point_Type
(Self : Element_Factory;
Delta_Expression : not null Program.Elements.Expressions
.Expression_Access;
Real_Range : not null Program.Elements.Real_Range_Specifications
.Real_Range_Specification_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Ordinary_Fixed_Point_Types
.Ordinary_Fixed_Point_Type_Access;
not overriding function Create_Decimal_Fixed_Point_Type
(Self : Element_Factory;
Delta_Expression : not null Program.Elements.Expressions
.Expression_Access;
Digits_Expression : not null Program.Elements.Expressions
.Expression_Access;
Real_Range : Program.Elements.Real_Range_Specifications
.Real_Range_Specification_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Decimal_Fixed_Point_Types
.Decimal_Fixed_Point_Type_Access;
not overriding function Create_Unconstrained_Array_Type
(Self : Element_Factory;
Index_Subtypes : not null Program.Elements.Expressions
.Expression_Vector_Access;
Component_Definition : not null Program.Elements.Component_Definitions
.Component_Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Unconstrained_Array_Types
.Unconstrained_Array_Type_Access;
not overriding function Create_Constrained_Array_Type
(Self : Element_Factory;
Index_Subtypes : not null Program.Elements.Discrete_Ranges
.Discrete_Range_Vector_Access;
Component_Definition : not null Program.Elements.Component_Definitions
.Component_Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Constrained_Array_Types
.Constrained_Array_Type_Access;
not overriding function Create_Record_Type
(Self : Element_Factory;
Record_Definition : not null Program.Elements.Definitions
.Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Record_Types.Record_Type_Access;
not overriding function Create_Interface_Type
(Self : Element_Factory;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Has_Limited : Boolean := False;
Has_Task : Boolean := False;
Has_Protected : Boolean := False;
Has_Synchronized : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Interface_Types.Interface_Type_Access;
not overriding function Create_Object_Access_Type
(Self : Element_Factory;
Subtype_Indication : not null Program.Elements.Subtype_Indications
.Subtype_Indication_Access;
Has_Not_Null : Boolean := False;
Has_All : Boolean := False;
Has_Constant : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Object_Access_Types
.Object_Access_Type_Access;
not overriding function Create_Procedure_Access_Type
(Self : Element_Factory;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Has_Not_Null : Boolean := False;
Has_Protected : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Procedure_Access_Types
.Procedure_Access_Type_Access;
not overriding function Create_Function_Access_Type
(Self : Element_Factory;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Has_Not_Null : Boolean := False;
Has_Protected : Boolean := False;
Has_Not_Null_2 : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Function_Access_Types
.Function_Access_Type_Access;
not overriding function Create_Formal_Private_Type_Definition
(Self : Element_Factory;
Has_Abstract : Boolean := False;
Has_Tagged : Boolean := False;
Has_Limited : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Private_Type_Definitions
.Formal_Private_Type_Definition_Access;
not overriding function Create_Formal_Derived_Type_Definition
(Self : Element_Factory;
Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Has_Abstract : Boolean := False;
Has_Limited : Boolean := False;
Has_Synchronized : Boolean := False;
Has_With_Private : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Derived_Type_Definitions
.Formal_Derived_Type_Definition_Access;
not overriding function Create_Formal_Discrete_Type_Definition
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Discrete_Type_Definitions
.Formal_Discrete_Type_Definition_Access;
not overriding function Create_Formal_Signed_Integer_Type_Definition
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Signed_Integer_Type_Definitions
.Formal_Signed_Integer_Type_Definition_Access;
not overriding function Create_Formal_Modular_Type_Definition
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Modular_Type_Definitions
.Formal_Modular_Type_Definition_Access;
not overriding function Create_Formal_Floating_Point_Definition
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Floating_Point_Definitions
.Formal_Floating_Point_Definition_Access;
not overriding function Create_Formal_Ordinary_Fixed_Point_Definition
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Ordinary_Fixed_Point_Definitions
.Formal_Ordinary_Fixed_Point_Definition_Access;
not overriding function Create_Formal_Decimal_Fixed_Point_Definition
(Self : Element_Factory;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Decimal_Fixed_Point_Definitions
.Formal_Decimal_Fixed_Point_Definition_Access;
not overriding function Create_Formal_Unconstrained_Array_Type
(Self : Element_Factory;
Index_Subtypes : not null Program.Elements.Expressions
.Expression_Vector_Access;
Component_Definition : not null Program.Elements.Component_Definitions
.Component_Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Unconstrained_Array_Types
.Formal_Unconstrained_Array_Type_Access;
not overriding function Create_Formal_Constrained_Array_Type
(Self : Element_Factory;
Index_Subtypes : not null Program.Elements.Discrete_Ranges
.Discrete_Range_Vector_Access;
Component_Definition : not null Program.Elements.Component_Definitions
.Component_Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Constrained_Array_Types
.Formal_Constrained_Array_Type_Access;
not overriding function Create_Formal_Object_Access_Type
(Self : Element_Factory;
Subtype_Indication : not null Program.Elements.Subtype_Indications
.Subtype_Indication_Access;
Has_Not_Null : Boolean := False;
Has_All : Boolean := False;
Has_Constant : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Object_Access_Types
.Formal_Object_Access_Type_Access;
not overriding function Create_Formal_Procedure_Access_Type
(Self : Element_Factory;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Has_Not_Null : Boolean := False;
Has_Protected : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Procedure_Access_Types
.Formal_Procedure_Access_Type_Access;
not overriding function Create_Formal_Function_Access_Type
(Self : Element_Factory;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Has_Not_Null : Boolean := False;
Has_Protected : Boolean := False;
Has_Not_Null_2 : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Function_Access_Types
.Formal_Function_Access_Type_Access;
not overriding function Create_Formal_Interface_Type
(Self : Element_Factory;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Has_Limited : Boolean := False;
Has_Task : Boolean := False;
Has_Protected : Boolean := False;
Has_Synchronized : Boolean := False;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Formal_Interface_Types
.Formal_Interface_Type_Access;
not overriding function Create_Range_Attribute_Reference
(Self : Element_Factory;
Range_Attribute : not null Program.Elements.Attribute_References
.Attribute_Reference_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Range_Attribute_References
.Range_Attribute_Reference_Access;
not overriding function Create_Simple_Expression_Range
(Self : Element_Factory;
Lower_Bound : not null Program.Elements.Expressions
.Expression_Access;
Upper_Bound : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Simple_Expression_Ranges
.Simple_Expression_Range_Access;
not overriding function Create_Digits_Constraint
(Self : Element_Factory;
Digits_Expression : not null Program.Elements.Expressions
.Expression_Access;
Real_Range_Constraint : Program.Elements.Constraints.Constraint_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Digits_Constraints
.Digits_Constraint_Access;
not overriding function Create_Delta_Constraint
(Self : Element_Factory;
Delta_Expression : not null Program.Elements.Expressions
.Expression_Access;
Real_Range_Constraint : Program.Elements.Constraints.Constraint_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Delta_Constraints
.Delta_Constraint_Access;
not overriding function Create_Index_Constraint
(Self : Element_Factory;
Ranges : not null Program.Elements.Discrete_Ranges
.Discrete_Range_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Index_Constraints
.Index_Constraint_Access;
not overriding function Create_Discriminant_Constraint
(Self : Element_Factory;
Discriminants : not null Program.Elements.Discriminant_Associations
.Discriminant_Association_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Discriminant_Constraints
.Discriminant_Constraint_Access;
not overriding function Create_Attribute_Definition_Clause
(Self : Element_Factory;
Name : not null Program.Elements.Expressions
.Expression_Access;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Attribute_Definition_Clauses
.Attribute_Definition_Clause_Access;
not overriding function Create_Enumeration_Representation_Clause
(Self : Element_Factory;
Name : not null Program.Elements.Expressions
.Expression_Access;
Expression : not null Program.Elements.Array_Aggregates
.Array_Aggregate_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Enumeration_Representation_Clauses
.Enumeration_Representation_Clause_Access;
not overriding function Create_Record_Representation_Clause
(Self : Element_Factory;
Name : not null Program.Elements.Expressions
.Expression_Access;
Mod_Clause_Expression : Program.Elements.Expressions.Expression_Access;
Component_Clauses : not null Program.Elements.Component_Clauses
.Component_Clause_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Record_Representation_Clauses
.Record_Representation_Clause_Access;
not overriding function Create_At_Clause
(Self : Element_Factory;
Name : not null Program.Elements.Identifiers
.Identifier_Access;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.At_Clauses.At_Clause_Access;
not overriding function Create_Exception_Handler
(Self : Element_Factory;
Choice_Parameter : Program.Elements.Choice_Parameter_Specifications
.Choice_Parameter_Specification_Access;
Choices : not null Program.Element_Vectors
.Element_Vector_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return not null Program.Elements.Exception_Handlers
.Exception_Handler_Access;
private
type Element_Factory (Subpool : not null System.Storage_Pools.Subpools
.Subpool_Handle) is tagged limited null record;
end Program.Implicit_Element_Factories;
|
-- FILE: oedipus.adb
-- LICENSE: MIT © 2021 Mae Morella
package body Oedipus is
function Create_Complex (A, B : in Float) return Complex is
C : Complex;
begin
C.Real := A;
C.Imaginary := B;
return C;
end Create_Complex;
function Get_Real (C : in Complex) return Float is
begin
return C.Real;
end Get_Real;
function Get_Imaginary (C : in Complex) return Float is
begin
return C.Imaginary;
end Get_Imaginary;
end Oedipus;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . S O F T _ L I N K S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
pragma Polling (Off);
-- We must turn polling off for this unit, because otherwise we get
-- an infinite loop from the code within the Poll routine itself.
with System.Machine_State_Operations; use System.Machine_State_Operations;
-- Used for Create_TSD, Destroy_TSD
with System.Parameters;
-- Used for Sec_Stack_Ratio
with System.Secondary_Stack;
package body System.Soft_Links is
package SST renames System.Secondary_Stack;
-- Allocate an exception stack for the main program to use.
-- We make sure that the stack has maximum alignment. Some systems require
-- this (e.g. Sun), and in any case it is a good idea for efficiency.
NT_Exc_Stack : array (0 .. 8192) of aliased Character;
for NT_Exc_Stack'Alignment use Standard'Maximum_Alignment;
NT_TSD : TSD;
--------------------
-- Abort_Defer_NT --
--------------------
procedure Abort_Defer_NT is
begin
null;
end Abort_Defer_NT;
----------------------
-- Abort_Handler_NT --
----------------------
procedure Abort_Handler_NT is
begin
null;
end Abort_Handler_NT;
----------------------
-- Abort_Undefer_NT --
----------------------
procedure Abort_Undefer_NT is
begin
null;
end Abort_Undefer_NT;
---------------------------
-- Check_Abort_Status_NT --
---------------------------
function Check_Abort_Status_NT return Integer is
begin
return Boolean'Pos (False);
end Check_Abort_Status_NT;
------------------------
-- Complete_Master_NT --
------------------------
procedure Complete_Master_NT is
begin
null;
end Complete_Master_NT;
----------------
-- Create_TSD --
----------------
procedure Create_TSD (New_TSD : in out TSD) is
use type Parameters.Size_Type;
SS_Ratio_Dynamic : constant Boolean :=
Parameters.Sec_Stack_Ratio = Parameters.Dynamic;
begin
if SS_Ratio_Dynamic then
SST.SS_Init
(New_TSD.Sec_Stack_Addr, SST.Default_Secondary_Stack_Size);
end if;
New_TSD.Machine_State_Addr :=
System.Address
(System.Machine_State_Operations.Allocate_Machine_State);
end Create_TSD;
-----------------------
-- Current_Master_NT --
-----------------------
function Current_Master_NT return Integer is
begin
return 0;
end Current_Master_NT;
-----------------
-- Destroy_TSD --
-----------------
procedure Destroy_TSD (Old_TSD : in out TSD) is
begin
SST.SS_Free (Old_TSD.Sec_Stack_Addr);
System.Machine_State_Operations.Free_Machine_State
(Machine_State (Old_TSD.Machine_State_Addr));
end Destroy_TSD;
---------------------
-- Enter_Master_NT --
---------------------
procedure Enter_Master_NT is
begin
null;
end Enter_Master_NT;
--------------------------
-- Get_Current_Excep_NT --
--------------------------
function Get_Current_Excep_NT return EOA is
begin
return NT_TSD.Current_Excep'Access;
end Get_Current_Excep_NT;
---------------------------
-- Get_Exc_Stack_Addr_NT --
---------------------------
function Get_Exc_Stack_Addr_NT return Address is
begin
return NT_TSD.Exc_Stack_Addr;
end Get_Exc_Stack_Addr_NT;
-----------------------------
-- Get_Exc_Stack_Addr_Soft --
-----------------------------
function Get_Exc_Stack_Addr_Soft return Address is
begin
return Get_Exc_Stack_Addr.all;
end Get_Exc_Stack_Addr_Soft;
------------------------
-- Get_GNAT_Exception --
------------------------
function Get_GNAT_Exception return Ada.Exceptions.Exception_Id is
begin
return Ada.Exceptions.Exception_Identity (Get_Current_Excep.all.all);
end Get_GNAT_Exception;
---------------------------
-- Get_Jmpbuf_Address_NT --
---------------------------
function Get_Jmpbuf_Address_NT return Address is
begin
return NT_TSD.Jmpbuf_Address;
end Get_Jmpbuf_Address_NT;
-----------------------------
-- Get_Jmpbuf_Address_Soft --
-----------------------------
function Get_Jmpbuf_Address_Soft return Address is
begin
return Get_Jmpbuf_Address.all;
end Get_Jmpbuf_Address_Soft;
-------------------------------
-- Get_Machine_State_Addr_NT --
-------------------------------
function Get_Machine_State_Addr_NT return Address is
begin
return NT_TSD.Machine_State_Addr;
end Get_Machine_State_Addr_NT;
---------------------------------
-- Get_Machine_State_Addr_Soft --
---------------------------------
function Get_Machine_State_Addr_Soft return Address is
begin
return Get_Machine_State_Addr.all;
end Get_Machine_State_Addr_Soft;
---------------------------
-- Get_Sec_Stack_Addr_NT --
---------------------------
function Get_Sec_Stack_Addr_NT return Address is
begin
return NT_TSD.Sec_Stack_Addr;
end Get_Sec_Stack_Addr_NT;
-----------------------------
-- Get_Sec_Stack_Addr_Soft --
-----------------------------
function Get_Sec_Stack_Addr_Soft return Address is
begin
return Get_Sec_Stack_Addr.all;
end Get_Sec_Stack_Addr_Soft;
-----------------------
-- Get_Stack_Info_NT --
-----------------------
function Get_Stack_Info_NT return Stack_Checking.Stack_Access is
begin
return NT_TSD.Pri_Stack_Info'Access;
end Get_Stack_Info_NT;
-------------------
-- Null_Adafinal --
-------------------
procedure Null_Adafinal is
begin
null;
end Null_Adafinal;
---------------------------
-- Set_Exc_Stack_Addr_NT --
---------------------------
procedure Set_Exc_Stack_Addr_NT (Self_ID : Address; Addr : Address) is
begin
NT_TSD.Exc_Stack_Addr := Addr;
end Set_Exc_Stack_Addr_NT;
-----------------------------
-- Set_Exc_Stack_Addr_Soft --
-----------------------------
procedure Set_Exc_Stack_Addr_Soft (Self_ID : Address; Addr : Address) is
begin
Set_Exc_Stack_Addr (Self_ID, Addr);
end Set_Exc_Stack_Addr_Soft;
---------------------------
-- Set_Jmpbuf_Address_NT --
---------------------------
procedure Set_Jmpbuf_Address_NT (Addr : Address) is
begin
NT_TSD.Jmpbuf_Address := Addr;
end Set_Jmpbuf_Address_NT;
procedure Set_Jmpbuf_Address_Soft (Addr : Address) is
begin
Set_Jmpbuf_Address (Addr);
end Set_Jmpbuf_Address_Soft;
-------------------------------
-- Set_Machine_State_Addr_NT --
-------------------------------
procedure Set_Machine_State_Addr_NT (Addr : Address) is
begin
NT_TSD.Machine_State_Addr := Addr;
end Set_Machine_State_Addr_NT;
---------------------------------
-- Set_Machine_State_Addr_Soft --
---------------------------------
procedure Set_Machine_State_Addr_Soft (Addr : Address) is
begin
Set_Machine_State_Addr (Addr);
end Set_Machine_State_Addr_Soft;
---------------------------
-- Set_Sec_Stack_Addr_NT --
---------------------------
procedure Set_Sec_Stack_Addr_NT (Addr : Address) is
begin
NT_TSD.Sec_Stack_Addr := Addr;
end Set_Sec_Stack_Addr_NT;
-----------------------------
-- Set_Sec_Stack_Addr_Soft --
-----------------------------
procedure Set_Sec_Stack_Addr_Soft (Addr : Address) is
begin
Set_Sec_Stack_Addr (Addr);
end Set_Sec_Stack_Addr_Soft;
------------------
-- Task_Lock_NT --
------------------
procedure Task_Lock_NT is
begin
null;
end Task_Lock_NT;
--------------------
-- Task_Unlock_NT --
--------------------
procedure Task_Unlock_NT is
begin
null;
end Task_Unlock_NT;
-------------------------
-- Update_Exception_NT --
-------------------------
procedure Update_Exception_NT (X : EO := Current_Target_Exception) is
begin
Ada.Exceptions.Save_Occurrence (NT_TSD.Current_Excep, X);
end Update_Exception_NT;
-------------------------
-- Package Elaboration --
-------------------------
begin
NT_TSD.Exc_Stack_Addr := NT_Exc_Stack (8192)'Address;
Ada.Exceptions.Save_Occurrence
(NT_TSD.Current_Excep, Ada.Exceptions.Null_Occurrence);
end System.Soft_Links;
|
------------------------------------------------------------------------------
-- A d a r u n - t i m e s p e c i f i c a t i o n --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of ada.ads file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with Ada.Calendar;
with Ada.IO_Exceptions;
package Ada.Directories is
-- Directory and file operations:
function Current_Directory return String;
procedure Set_Directory (Directory : in String);
procedure Create_Directory (New_Directory : in String;
Form : in String := "");
procedure Delete_Directory (Directory : in String);
procedure Create_Path (New_Directory : in String;
Form : in String := "");
procedure Delete_Tree (Directory : in String);
procedure Delete_File (Name : in String);
procedure Rename (Old_Name : in String;
New_Name : in String);
procedure Copy_File (Source_Name : in String;
Target_Name : in String;
Form : in String := "");
-- File and directory name operations:
function Full_Name (Name : in String) return String;
function Simple_Name (Name : in String) return String;
function Containing_Directory (Name : in String) return String;
function Extension (Name : in String) return String;
function Base_Name (Name : in String) return String;
function Compose (Containing_Directory : in String := "";
Name : in String;
Extension : in String := "")
return String;
-- File and directory queries:
type File_Kind is (Directory, Ordinary_File, Special_File);
type File_Size is range 0 .. implementation-defined;
function Exists (Name : in String) return Boolean;
function Kind (Name : in String) return File_Kind;
function Size (Name : in String) return File_Size;
function Modification_Time (Name : in String) return Ada.Calendar.Time;
-- Directory searching:
type Directory_Entry_Type is limited private;
type Filter_Type is array (File_Kind) of Boolean;
type Search_Type is limited private;
procedure Start_Search
(Search : in out Search_Type;
Directory : in String;
Pattern : in String;
Filter : in Filter_Type := (others => True));
procedure End_Search (Search : in out Search_Type);
function More_Entries (Search : in Search_Type) return Boolean;
procedure Get_Next_Entry (Search : in out Search_Type;
Directory_Entry : out Directory_Entry_Type);
procedure Search
(Directory : in String;
Pattern : in String;
Filter : in Filter_Type := (others => True);
Process : not null access procedure
(Directory_Entry : in Directory_Entry_Type));
-- Operations on Directory Entries:
function Simple_Name (Directory_Entry : in Directory_Entry_Type)
return String;
function Full_Name (Directory_Entry : in Directory_Entry_Type)
return String;
function Kind (Directory_Entry : in Directory_Entry_Type)
return File_Kind;
function Size (Directory_Entry : in Directory_Entry_Type)
return File_Size;
function Modification_Time (Directory_Entry : in Directory_Entry_Type)
return Ada.Calendar.Time;
Status_Error : exception renames Ada.IO_Exceptions.Status_Error;
Name_Error : exception renames Ada.IO_Exceptions.Name_Error;
Use_Error : exception renames Ada.IO_Exceptions.Use_Error;
Device_Error : exception renames Ada.IO_Exceptions.Device_Error;
private
pragma Import (Ada, Directory_Entry_Type);
pragma Import (Ada, Search_Type);
end Ada.Directories;
|
-- This package has been generated automatically by GNATtest.
-- You are allowed to add your code to the bodies of test routines.
-- Such changes will be kept during further regeneration of this file.
-- All code placed outside of test routine bodies will be lost. The
-- code intended to set up and tear down the test environment should be
-- placed into Tcl.Test_Data.
with AUnit.Assertions; use AUnit.Assertions;
with System.Assertions;
-- begin read only
-- id:2.2/00/
--
-- This section can be used to add with clauses if necessary.
--
-- end read only
with GNAT.Directory_Operations; use GNAT.Directory_Operations;
-- begin read only
-- end read only
package body Tcl.Test_Data.Tests is
-- begin read only
-- id:2.2/01/
--
-- This section can be used to add global variables and other elements.
--
-- end read only
-- begin read only
-- end read only
-- begin read only
procedure Wrap_Test_Tcl_Eval_6f41cd_5b9cd5
(Tcl_Script: String; Interpreter: Tcl_Interpreter := Get_Interpreter) is
begin
begin
pragma Assert
(Tcl_Script'Length > 0 and Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_Eval test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Eval
(Tcl_Script, Interpreter);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_Eval test commitment violated");
end;
end Wrap_Test_Tcl_Eval_6f41cd_5b9cd5;
-- end read only
-- begin read only
procedure Test_1_Tcl_Eval_test_tcl_eval(Gnattest_T: in out Test);
procedure Test_Tcl_Eval_6f41cd_5b9cd5(Gnattest_T: in out Test) renames
Test_1_Tcl_Eval_test_tcl_eval;
-- id:2.2/6f41cdb0dd725e03/Tcl_Eval/1/0/test_tcl_eval/
procedure Test_1_Tcl_Eval_test_tcl_eval(Gnattest_T: in out Test) is
procedure Tcl_Eval
(Tcl_Script: String;
Interpreter: Tcl_Interpreter := Get_Interpreter) renames
Wrap_Test_Tcl_Eval_6f41cd_5b9cd5;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Tcl_Eval("expr 2 + 2");
Assert(Tcl_Get_Result = "4", "Failed to evaluate Tcl code.");
-- begin read only
end Test_1_Tcl_Eval_test_tcl_eval;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Eval_aa3c35_916b02
(Tcl_Script: String; Interpreter: Tcl_Interpreter := Get_Interpreter)
return Tcl_String_Result is
begin
begin
pragma Assert
(Tcl_Script'Length > 0 and Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_Eval2 test requirement violated");
end;
declare
Test_Tcl_Eval_aa3c35_916b02_Result: constant Tcl_String_Result :=
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Eval
(Tcl_Script, Interpreter);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_Eval2 test commitment violated");
end;
return Test_Tcl_Eval_aa3c35_916b02_Result;
end;
end Wrap_Test_Tcl_Eval_aa3c35_916b02;
-- end read only
-- begin read only
procedure Test_2_Tcl_Eval_test_tcl_eval2(Gnattest_T: in out Test);
procedure Test_Tcl_Eval_aa3c35_916b02(Gnattest_T: in out Test) renames
Test_2_Tcl_Eval_test_tcl_eval2;
-- id:2.2/aa3c355d19bf848c/Tcl_Eval/0/0/test_tcl_eval2/
procedure Test_2_Tcl_Eval_test_tcl_eval2(Gnattest_T: in out Test) is
function Tcl_Eval
(Tcl_Script: String; Interpreter: Tcl_Interpreter := Get_Interpreter)
return Tcl_String_Result renames
Wrap_Test_Tcl_Eval_aa3c35_916b02;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Assert
(Tcl_Eval("expr 2 + 5").Result = "7",
"Failed to evaluate and get result of Tcl code.");
-- begin read only
end Test_2_Tcl_Eval_test_tcl_eval2;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Eval_991647_19bef1
(Tcl_Script: String; Interpreter: Tcl_Interpreter := Get_Interpreter)
return Tcl_Boolean_Result is
begin
begin
pragma Assert
(Tcl_Script'Length > 0 and Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_Eval3 test requirement violated");
end;
declare
Test_Tcl_Eval_991647_19bef1_Result: constant Tcl_Boolean_Result :=
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Eval
(Tcl_Script, Interpreter);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_Eval3 test commitment violated");
end;
return Test_Tcl_Eval_991647_19bef1_Result;
end;
end Wrap_Test_Tcl_Eval_991647_19bef1;
-- end read only
-- begin read only
procedure Test_3_Tcl_Eval_test_tcl_eval3(Gnattest_T: in out Test);
procedure Test_Tcl_Eval_991647_19bef1(Gnattest_T: in out Test) renames
Test_3_Tcl_Eval_test_tcl_eval3;
-- id:2.2/9916475f68961448/Tcl_Eval/0/0/test_tcl_eval3/
procedure Test_3_Tcl_Eval_test_tcl_eval3(Gnattest_T: in out Test) is
function Tcl_Eval
(Tcl_Script: String; Interpreter: Tcl_Interpreter := Get_Interpreter)
return Tcl_Boolean_Result renames
Wrap_Test_Tcl_Eval_991647_19bef1;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Assert
(not Tcl_Eval("info exists asdfervariable").Result,
"Failed to get boolean value of Tcl command.");
-- begin read only
end Test_3_Tcl_Eval_test_tcl_eval3;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Eval_a72eed_9dbc2f
(Tcl_Script: String; Interpreter: Tcl_Interpreter := Get_Interpreter)
return Tcl_Integer_Result is
begin
begin
pragma Assert
(Tcl_Script'Length > 0 and Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_Eval4 test requirement violated");
end;
declare
Test_Tcl_Eval_a72eed_9dbc2f_Result: constant Tcl_Integer_Result :=
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Eval
(Tcl_Script, Interpreter);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_Eval4 test commitment violated");
end;
return Test_Tcl_Eval_a72eed_9dbc2f_Result;
end;
end Wrap_Test_Tcl_Eval_a72eed_9dbc2f;
-- end read only
-- begin read only
procedure Test_4_Tcl_Eval_test_tcl_eval4(Gnattest_T: in out Test);
procedure Test_Tcl_Eval_a72eed_9dbc2f(Gnattest_T: in out Test) renames
Test_4_Tcl_Eval_test_tcl_eval4;
-- id:2.2/a72eedb15fa1e475/Tcl_Eval/0/0/test_tcl_eval4/
procedure Test_4_Tcl_Eval_test_tcl_eval4(Gnattest_T: in out Test) is
function Tcl_Eval
(Tcl_Script: String; Interpreter: Tcl_Interpreter := Get_Interpreter)
return Tcl_Integer_Result renames
Wrap_Test_Tcl_Eval_a72eed_9dbc2f;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Assert
(Tcl_Eval("expr 2 + 2").Result = 4,
"Failed to get Integer value of Tcl command.");
-- begin read only
end Test_4_Tcl_Eval_test_tcl_eval4;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Eval_629595_f7c23b
(Tcl_Script: String; Interpreter: Tcl_Interpreter := Get_Interpreter)
return Tcl_Float_Result is
begin
begin
pragma Assert
(Tcl_Script'Length > 0 and Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_Eval5 test requirement violated");
end;
declare
Test_Tcl_Eval_629595_f7c23b_Result: constant Tcl_Float_Result :=
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Eval
(Tcl_Script, Interpreter);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_Eval5 test commitment violated");
end;
return Test_Tcl_Eval_629595_f7c23b_Result;
end;
end Wrap_Test_Tcl_Eval_629595_f7c23b;
-- end read only
-- begin read only
procedure Test_5_Tcl_Eval_test_tcl_eval5(Gnattest_T: in out Test);
procedure Test_Tcl_Eval_629595_f7c23b(Gnattest_T: in out Test) renames
Test_5_Tcl_Eval_test_tcl_eval5;
-- id:2.2/629595d58c48dc53/Tcl_Eval/0/0/test_tcl_eval5/
procedure Test_5_Tcl_Eval_test_tcl_eval5(Gnattest_T: in out Test) is
function Tcl_Eval
(Tcl_Script: String; Interpreter: Tcl_Interpreter := Get_Interpreter)
return Tcl_Float_Result renames
Wrap_Test_Tcl_Eval_629595_f7c23b;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Assert
(Tcl_Eval("expr 2.5 + 2.2").Result = 4.7,
"Failed to get Float value of Tcl command.");
-- begin read only
end Test_5_Tcl_Eval_test_tcl_eval5;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Eval_File_54cee0_9ae206
(File_Name: String; Interpreter: Tcl_Interpreter := Get_Interpreter)
return Tcl_Results is
begin
begin
pragma Assert
(File_Name'Length > 0 and Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_Eval_File test requirement violated");
end;
declare
Test_Tcl_Eval_File_54cee0_9ae206_Result: constant Tcl_Results :=
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Eval_File
(File_Name, Interpreter);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_Eval_File test commitment violated");
end;
return Test_Tcl_Eval_File_54cee0_9ae206_Result;
end;
end Wrap_Test_Tcl_Eval_File_54cee0_9ae206;
-- end read only
-- begin read only
procedure Test_Tcl_Eval_File_test_tcl_eval_file(Gnattest_T: in out Test);
procedure Test_Tcl_Eval_File_54cee0_9ae206(Gnattest_T: in out Test) renames
Test_Tcl_Eval_File_test_tcl_eval_file;
-- id:2.2/54cee041219047c4/Tcl_Eval_File/1/0/test_tcl_eval_file/
procedure Test_Tcl_Eval_File_test_tcl_eval_file(Gnattest_T: in out Test) is
function Tcl_Eval_File
(File_Name: String; Interpreter: Tcl_Interpreter := Get_Interpreter)
return Tcl_Results renames
Wrap_Test_Tcl_Eval_File_54cee0_9ae206;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
if Tcl_Eval_File(".." & Dir_Separator & "test.tcl") = TCL_ERROR then
Assert(False, "Can't evaluate file as Tcl script.");
end if;
Assert(True, "This test can only crash.");
-- begin read only
end Test_Tcl_Eval_File_test_tcl_eval_file;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Get_Result_9a7ac3_b83d43
(Interpreter: Tcl_Interpreter := Get_Interpreter) return String is
begin
begin
pragma Assert(Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_GetResult test requirement violated");
end;
declare
Test_Tcl_Get_Result_9a7ac3_b83d43_Result: constant String :=
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Get_Result
(Interpreter);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_GetResult test commitment violated");
end;
return Test_Tcl_Get_Result_9a7ac3_b83d43_Result;
end;
end Wrap_Test_Tcl_Get_Result_9a7ac3_b83d43;
-- end read only
-- begin read only
procedure Test_1_Tcl_Get_Result_test_tcl_getresult(Gnattest_T: in out Test);
procedure Test_Tcl_Get_Result_9a7ac3_b83d43(Gnattest_T: in out Test) renames
Test_1_Tcl_Get_Result_test_tcl_getresult;
-- id:2.2/9a7ac36b6f9d677a/Tcl_Get_Result/1/0/test_tcl_getresult/
procedure Test_1_Tcl_Get_Result_test_tcl_getresult
(Gnattest_T: in out Test) is
function Tcl_Get_Result
(Interpreter: Tcl_Interpreter := Get_Interpreter) return String renames
Wrap_Test_Tcl_Get_Result_9a7ac3_b83d43;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Tcl_Set_Result("2");
Assert(Tcl_Get_Result = "2", "Failed to get Tcl result as String");
-- begin read only
end Test_1_Tcl_Get_Result_test_tcl_getresult;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Get_Result_8d4605_70ce85
(Interpreter: Tcl_Interpreter := Get_Interpreter) return Integer is
begin
begin
pragma Assert(Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_GetResult2 test requirement violated");
end;
declare
Test_Tcl_Get_Result_8d4605_70ce85_Result: constant Integer :=
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Get_Result
(Interpreter);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_GetResult2 test commitment violated");
end;
return Test_Tcl_Get_Result_8d4605_70ce85_Result;
end;
end Wrap_Test_Tcl_Get_Result_8d4605_70ce85;
-- end read only
-- begin read only
procedure Test_2_Tcl_Get_Result_test_tcl_getresult2
(Gnattest_T: in out Test);
procedure Test_Tcl_Get_Result_8d4605_70ce85(Gnattest_T: in out Test) renames
Test_2_Tcl_Get_Result_test_tcl_getresult2;
-- id:2.2/8d460597473cf5f0/Tcl_Get_Result/0/0/test_tcl_getresult2/
procedure Test_2_Tcl_Get_Result_test_tcl_getresult2
(Gnattest_T: in out Test) is
function Tcl_Get_Result
(Interpreter: Tcl_Interpreter := Get_Interpreter)
return Integer renames
Wrap_Test_Tcl_Get_Result_8d4605_70ce85;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Tcl_Set_Result("22");
Assert(Tcl_Get_Result = 22, "Failed to get Tcl result as Integer");
-- begin read only
end Test_2_Tcl_Get_Result_test_tcl_getresult2;
-- end read only
-- begin read only
function Wrap_Test_Tcl_Get_Result_040714_d18240
(Interpreter: Tcl_Interpreter := Get_Interpreter) return Float is
begin
begin
pragma Assert(Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_GetResult3 test requirement violated");
end;
declare
Test_Tcl_Get_Result_040714_d18240_Result: constant Float :=
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Get_Result
(Interpreter);
begin
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_GetResult3 test commitment violated");
end;
return Test_Tcl_Get_Result_040714_d18240_Result;
end;
end Wrap_Test_Tcl_Get_Result_040714_d18240;
-- end read only
-- begin read only
procedure Test_3_Tcl_Get_Result_test_tcl_getresult3
(Gnattest_T: in out Test);
procedure Test_Tcl_Get_Result_040714_d18240(Gnattest_T: in out Test) renames
Test_3_Tcl_Get_Result_test_tcl_getresult3;
-- id:2.2/040714248a32a2ad/Tcl_Get_Result/0/0/test_tcl_getresult3/
procedure Test_3_Tcl_Get_Result_test_tcl_getresult3
(Gnattest_T: in out Test) is
function Tcl_Get_Result
(Interpreter: Tcl_Interpreter := Get_Interpreter) return Float renames
Wrap_Test_Tcl_Get_Result_040714_d18240;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Tcl_Set_Result("2.2");
Assert(Tcl_Get_Result = 2.2, "Failed to get Tcl result as Float");
-- begin read only
end Test_3_Tcl_Get_Result_test_tcl_getresult3;
-- end read only
-- begin read only
procedure Wrap_Test_Tcl_Set_Result_2e8975_cb8f85
(Tcl_Result: String; Result_Type: Result_Types := Default_Result_Type;
Interpreter: Tcl_Interpreter := Get_Interpreter) is
begin
begin
pragma Assert
(Tcl_Result'Length > 0 and Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_SetResult test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Set_Result
(Tcl_Result, Result_Type, Interpreter);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_SetResult test commitment violated");
end;
end Wrap_Test_Tcl_Set_Result_2e8975_cb8f85;
-- end read only
-- begin read only
procedure Test_Tcl_Set_Result_test_tcl_setresult(Gnattest_T: in out Test);
procedure Test_Tcl_Set_Result_2e8975_cb8f85(Gnattest_T: in out Test) renames
Test_Tcl_Set_Result_test_tcl_setresult;
-- id:2.2/2e8975e68b3f48df/Tcl_Set_Result/1/0/test_tcl_setresult/
procedure Test_Tcl_Set_Result_test_tcl_setresult(Gnattest_T: in out Test) is
procedure Tcl_Set_Result
(Tcl_Result: String; Result_Type: Result_Types := Default_Result_Type;
Interpreter: Tcl_Interpreter := Get_Interpreter) renames
Wrap_Test_Tcl_Set_Result_2e8975_cb8f85;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Tcl_Set_Result("2");
Assert(Tcl_Get_Result = "2", "Failed to set Tcl result");
-- begin read only
end Test_Tcl_Set_Result_test_tcl_setresult;
-- end read only
-- begin read only
procedure Wrap_Test_Tcl_Update_7113e2_953c64
(Interpreter: Tcl_Interpreter := Get_Interpreter;
Idle_Tasks_Only: Boolean := False) is
begin
begin
pragma Assert(Interpreter /= Null_Interpreter);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"req_sloc(tcl.ads:0):Test_Tcl_Update test requirement violated");
end;
GNATtest_Generated.GNATtest_Standard.Tcl.Tcl_Update
(Interpreter, Idle_Tasks_Only);
begin
pragma Assert(True);
null;
exception
when System.Assertions.Assert_Failure =>
AUnit.Assertions.Assert
(False,
"ens_sloc(tcl.ads:0:):Test_Tcl_Update test commitment violated");
end;
end Wrap_Test_Tcl_Update_7113e2_953c64;
-- end read only
-- begin read only
procedure Test_Tcl_Update_test_tcl_update(Gnattest_T: in out Test);
procedure Test_Tcl_Update_7113e2_953c64(Gnattest_T: in out Test) renames
Test_Tcl_Update_test_tcl_update;
-- id:2.2/7113e27f42b016a5/Tcl_Update/1/0/test_tcl_update/
procedure Test_Tcl_Update_test_tcl_update(Gnattest_T: in out Test) is
procedure Tcl_Update
(Interpreter: Tcl_Interpreter := Get_Interpreter;
Idle_Tasks_Only: Boolean := False) renames
Wrap_Test_Tcl_Update_7113e2_953c64;
-- end read only
pragma Unreferenced(Gnattest_T);
begin
Tcl_Update;
Assert(True, "This test can only crash.");
-- begin read only
end Test_Tcl_Update_test_tcl_update;
-- end read only
-- begin read only
-- id:2.2/02/
--
-- This section can be used to add elaboration code for the global state.
--
begin
-- end read only
null;
-- begin read only
-- end read only
end Tcl.Test_Data.Tests;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2020 onox <denkpadje@gmail.com>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with AUnit.Test_Suites;
with AUnit.Test_Fixtures;
package Test_SIMD_FMA_Singles_Arithmetic is
function Suite return AUnit.Test_Suites.Access_Test_Suite;
private
type Test is new AUnit.Test_Fixtures.Test_Fixture with null record;
procedure Test_Multiply_Vector (Object : in out Test);
procedure Test_Multiply_Matrices (Object : in out Test);
end Test_SIMD_FMA_Singles_Arithmetic;
|
with Ada.Text_IO;
use Ada.Text_IO;
procedure main is
begin -- Bonjour
Put("Hello Master Falindir");
end main; |
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with System.Storage_Elements;
with Ada.Storage_IO;
package body Slim.Messages is
-----------------
-- Read_Fields --
-----------------
procedure Read_Fields
(Self : in out Base_Message'Class;
List : Field_Description_Array;
Data : League.Stream_Element_Vectors.Stream_Element_Vector)
is
use type Ada.Streams.Stream_Element_Offset;
generic
type Element is private;
procedure Read (Result : out Element);
Input : Ada.Streams.Stream_Element_Offset := 1;
----------
-- Read --
----------
procedure Read (Result : out Element) is
package IO is new Ada.Storage_IO (Element);
Buffer : IO.Buffer_Type;
begin
for J in reverse Buffer'Range loop
Buffer (J) := System.Storage_Elements.Storage_Element
(Data.Element (Input));
Input := Input + 1;
end loop;
IO.Read (Buffer, Result);
end Read;
procedure Read_8 is new Read (Interfaces.Unsigned_8);
procedure Read_16 is new Read (Interfaces.Unsigned_16);
procedure Read_32 is new Read (Interfaces.Unsigned_32);
procedure Read_64 is new Read (Interfaces.Unsigned_64);
Kind : Field_Kinds;
Fields : Field_Description_Array := List;
Index : Positive := Fields'First;
Counts : array (Field_Kinds) of Natural := (others => 0);
begin
while Index <= Fields'Last loop
Kind := Fields (Index).Kind;
Counts (Kind) := Counts (Kind) + 1;
case Kind is
when Uint_8_Field =>
Read_8 (Self.Data_8 (Counts (Kind)));
when Uint_16_Field =>
Read_16 (Self.Data_16 (Counts (Kind)));
when Uint_32_Field =>
Read_32 (Self.Data_32 (Counts (Kind)));
when Uint_64_Field =>
Read_64 (Self.Data_64 (Counts (Kind)));
when others =>
Self.Read_Custom_Field
(Index => Counts (Kind),
Input => Input,
Data => Data);
end case;
if Fields (Index).Count = 1 then
Index := Index + 1;
else
Fields (Index).Count := Fields (Index).Count - 1;
end if;
end loop;
end Read_Fields;
-----------
-- Slice --
-----------
procedure Slice
(Result : out Ada.Streams.Stream_Element_Array;
From : Ada.Streams.Stream_Element_Offset)
is
use type Ada.Streams.Stream_Element_Offset;
begin
for J in Result'Range loop
Result (J) := Data.Element (From + J - Result'First);
end loop;
end Slice;
------------------
-- Write_Fields --
------------------
procedure Write_Fields
(Self : Base_Message'Class;
List : Field_Description_Array;
Data : in out League.Stream_Element_Vectors.Stream_Element_Vector)
is
generic
type Element is private;
procedure Write (Result : Element);
-----------
-- Write --
-----------
procedure Write (Result : Element) is
package IO is new Ada.Storage_IO (Element);
Buffer : IO.Buffer_Type;
begin
IO.Write (Buffer, Result);
-- Use network byte order, so use 'reverse'
for J in reverse Buffer'Range loop
Data.Append (Ada.Streams.Stream_Element (Buffer (J)));
end loop;
end Write;
procedure Write_8 is new Write (Interfaces.Unsigned_8);
procedure Write_16 is new Write (Interfaces.Unsigned_16);
procedure Write_32 is new Write (Interfaces.Unsigned_32);
procedure Write_64 is new Write (Interfaces.Unsigned_64);
Kind : Field_Kinds;
Fields : Field_Description_Array := List;
Index : Positive := Fields'First;
Counts : array (Field_Kinds) of Natural := (others => 0);
begin
while Index <= Fields'Last loop
Kind := Fields (Index).Kind;
Counts (Kind) := Counts (Kind) + 1;
case Kind is
when Uint_8_Field =>
Write_8 (Self.Data_8 (Counts (Kind)));
when Uint_16_Field =>
Write_16 (Self.Data_16 (Counts (Kind)));
when Uint_32_Field =>
Write_32 (Self.Data_32 (Counts (Kind)));
when Uint_64_Field =>
Write_64 (Self.Data_64 (Counts (Kind)));
when others =>
Self.Write_Custom_Field
(Index => Counts (Kind),
Data => Data);
end case;
if Fields (Index).Count = 1 then
Index := Index + 1;
else
Fields (Index).Count := Fields (Index).Count - 1;
end if;
end loop;
end Write_Fields;
end Slim.Messages;
|
-- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../../License.txt
package AdaBase.Logger.Base.Screen is
type Screen_Logger is new Base_Logger and AIL.iLogger with private;
type Screen_Logger_access is access all Screen_Logger;
overriding
procedure reaction (listener : Screen_Logger);
private
type Screen_Logger is new Base_Logger and AIL.iLogger
with record
null;
end record;
end AdaBase.Logger.Base.Screen;
|
pragma License (Unrestricted);
-- extended unit specialized for Windows
with Ada.IO_Exceptions;
private with Ada.Finalization;
private with C.windef;
package System.Program.Dynamic_Linking is
-- Loading dynamic-link library.
pragma Preelaborate;
type Library is limited private;
-- subtype Open_Library is Library
-- with
-- Dynamic_Predicate => Is_Open (Open_Library),
-- Predicate_Failure => raise Status_Error;
function Is_Open (Lib : Library) return Boolean;
pragma Inline (Is_Open);
procedure Open (Lib : in out Library; Name : String);
function Open (Name : String) return Library;
procedure Close (Lib : in out Library);
function Import (
Lib : Library; -- Open_Library
Symbol : String)
return Address;
Status_Error : exception
renames Ada.IO_Exceptions.Status_Error;
Name_Error : exception
renames Ada.IO_Exceptions.Name_Error;
Use_Error : exception
renames Ada.IO_Exceptions.Use_Error;
Data_Error : exception
renames Ada.IO_Exceptions.Data_Error;
private
package Controlled is
type Library is limited private;
function Reference (Lib : Dynamic_Linking.Library)
return not null access C.windef.HMODULE;
pragma Inline (Reference);
private
type Library is
limited new Ada.Finalization.Limited_Controlled with
record
Handle : aliased C.windef.HMODULE := null;
end record;
overriding procedure Finalize (Object : in out Library);
end Controlled;
type Library is new Controlled.Library;
end System.Program.Dynamic_Linking;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M --
-- --
-- S p e c --
-- (GNU-Linux/s390 Version) --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package System is
pragma Pure;
-- Note that we take advantage of the implementation permission to make
-- this unit Pure instead of Preelaborable; see RM 13.7.1(15). In Ada
-- 2005, this is Pure in any case (AI-362).
pragma No_Elaboration_Code_All;
-- Allow the use of that restriction in units that WITH this unit
type Name is (SYSTEM_NAME_GNAT);
System_Name : constant Name := SYSTEM_NAME_GNAT;
-- System-Dependent Named Numbers
Min_Int : constant := Long_Long_Integer'First;
Max_Int : constant := Long_Long_Integer'Last;
Max_Binary_Modulus : constant := 2 ** Long_Long_Integer'Size;
Max_Nonbinary_Modulus : constant := Integer'Last;
Max_Base_Digits : constant := Long_Long_Float'Digits;
Max_Digits : constant := Long_Long_Float'Digits;
Max_Mantissa : constant := 63;
Fine_Delta : constant := 2.0 ** (-Max_Mantissa);
Tick : constant := 0.000_001;
-- Storage-related Declarations
type Address is private;
pragma Preelaborable_Initialization (Address);
Null_Address : constant Address;
Storage_Unit : constant := 8;
Word_Size : constant := Standard'Word_Size;
Memory_Size : constant := 2 ** Long_Integer'Size;
-- Address comparison
function "<" (Left, Right : Address) return Boolean;
function "<=" (Left, Right : Address) return Boolean;
function ">" (Left, Right : Address) return Boolean;
function ">=" (Left, Right : Address) return Boolean;
function "=" (Left, Right : Address) return Boolean;
pragma Import (Intrinsic, "<");
pragma Import (Intrinsic, "<=");
pragma Import (Intrinsic, ">");
pragma Import (Intrinsic, ">=");
pragma Import (Intrinsic, "=");
-- Other System-Dependent Declarations
type Bit_Order is (High_Order_First, Low_Order_First);
Default_Bit_Order : constant Bit_Order := High_Order_First;
pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning
-- Priority-related Declarations (RM D.1)
Max_Priority : constant Positive := 30;
Max_Interrupt_Priority : constant Positive := 31;
subtype Any_Priority is Integer range 0 .. 31;
subtype Priority is Any_Priority range 0 .. 30;
subtype Interrupt_Priority is Any_Priority range 31 .. 31;
Default_Priority : constant Priority := 15;
private
type Address is mod Memory_Size;
Null_Address : constant Address := 0;
--------------------------------------
-- System Implementation Parameters --
--------------------------------------
-- These parameters provide information about the target that is used
-- by the compiler. They are in the private part of System, where they
-- can be accessed using the special circuitry in the Targparm unit
-- whose source should be consulted for more detailed descriptions
-- of the individual switch values.
Backend_Divide_Checks : constant Boolean := False;
Backend_Overflow_Checks : constant Boolean := True;
Command_Line_Args : constant Boolean := True;
Configurable_Run_Time : constant Boolean := False;
Denorm : constant Boolean := True;
Duration_32_Bits : constant Boolean := False;
Exit_Status_Supported : constant Boolean := True;
Fractional_Fixed_Ops : constant Boolean := False;
Frontend_Layout : constant Boolean := False;
Machine_Overflows : constant Boolean := False;
Machine_Rounds : constant Boolean := True;
Preallocated_Stacks : constant Boolean := False;
Signed_Zeros : constant Boolean := True;
Stack_Check_Default : constant Boolean := False;
Stack_Check_Probes : constant Boolean := True;
Stack_Check_Limits : constant Boolean := False;
Support_Aggregates : constant Boolean := True;
Support_Composite_Assign : constant Boolean := True;
Support_Composite_Compare : constant Boolean := True;
Support_Long_Shifts : constant Boolean := True;
Always_Compatible_Rep : constant Boolean := False;
Suppress_Standard_Library : constant Boolean := False;
Use_Ada_Main_Program_Name : constant Boolean := False;
Frontend_Exceptions : constant Boolean := False;
ZCX_By_Default : constant Boolean := True;
end System;
|
------------------------------------------------------------------------------
-- --
-- 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_Substitutions is
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UML_Substitution_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_Substitution
(AMF.UML.Substitutions.UML_Substitution_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UML_Substitution_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_Substitution
(AMF.UML.Substitutions.UML_Substitution_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UML_Substitution_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_Substitution
(Visitor,
AMF.UML.Substitutions.UML_Substitution_Access (Self),
Control);
end if;
end Visit_Element;
------------------
-- Get_Contract --
------------------
overriding function Get_Contract
(Self : not null access constant UML_Substitution_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access is
begin
return
AMF.UML.Classifiers.UML_Classifier_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Contract
(Self.Element)));
end Get_Contract;
------------------
-- Set_Contract --
------------------
overriding procedure Set_Contract
(Self : not null access UML_Substitution_Proxy;
To : AMF.UML.Classifiers.UML_Classifier_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Contract
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Contract;
---------------------------------
-- Get_Substituting_Classifier --
---------------------------------
overriding function Get_Substituting_Classifier
(Self : not null access constant UML_Substitution_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access is
begin
return
AMF.UML.Classifiers.UML_Classifier_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Substituting_Classifier
(Self.Element)));
end Get_Substituting_Classifier;
---------------------------------
-- Set_Substituting_Classifier --
---------------------------------
overriding procedure Set_Substituting_Classifier
(Self : not null access UML_Substitution_Proxy;
To : AMF.UML.Classifiers.UML_Classifier_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Substituting_Classifier
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Substituting_Classifier;
-----------------
-- Get_Mapping --
-----------------
overriding function Get_Mapping
(Self : not null access constant UML_Substitution_Proxy)
return AMF.UML.Opaque_Expressions.UML_Opaque_Expression_Access is
begin
return
AMF.UML.Opaque_Expressions.UML_Opaque_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Mapping
(Self.Element)));
end Get_Mapping;
-----------------
-- Set_Mapping --
-----------------
overriding procedure Set_Mapping
(Self : not null access UML_Substitution_Proxy;
To : AMF.UML.Opaque_Expressions.UML_Opaque_Expression_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Mapping
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Mapping;
----------------
-- Get_Client --
----------------
overriding function Get_Client
(Self : not null access constant UML_Substitution_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_Client
(Self.Element)));
end Get_Client;
------------------
-- Get_Supplier --
------------------
overriding function Get_Supplier
(Self : not null access constant UML_Substitution_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_Supplier
(Self.Element)));
end Get_Supplier;
----------------
-- Get_Source --
----------------
overriding function Get_Source
(Self : not null access constant UML_Substitution_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Source
(Self.Element)));
end Get_Source;
----------------
-- Get_Target --
----------------
overriding function Get_Target
(Self : not null access constant UML_Substitution_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Target
(Self.Element)));
end Get_Target;
-------------------------
-- Get_Related_Element --
-------------------------
overriding function Get_Related_Element
(Self : not null access constant UML_Substitution_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Related_Element
(Self.Element)));
end Get_Related_Element;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant UML_Substitution_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_Substitution_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_Substitution_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_Substitution_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_Substitution_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_Owning_Template_Parameter --
-----------------------------------
overriding function Get_Owning_Template_Parameter
(Self : not null access constant UML_Substitution_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_Substitution_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_Substitution_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_Substitution_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;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant UML_Substitution_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_Substitution_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_Substitution_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_Substitution_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_Substitution_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_Substitution_Proxy.Namespace";
return Namespace (Self);
end Namespace;
------------------------
-- Is_Compatible_With --
------------------------
overriding function Is_Compatible_With
(Self : not null access constant UML_Substitution_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_Substitution_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_Substitution_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_Substitution_Proxy.Is_Template_Parameter";
return Is_Template_Parameter (Self);
end Is_Template_Parameter;
end AMF.Internals.UML_Substitutions;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . M U L T I W A Y _ T R E E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2021, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Iterator_Interfaces;
with Ada.Containers.Helpers;
private with Ada.Finalization;
private with Ada.Streams;
private with Ada.Strings.Text_Buffers;
generic
type Element_Type is private;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Multiway_Trees with
SPARK_Mode => Off
is
pragma Annotate (CodePeer, Skip_Analysis);
pragma Preelaborate;
pragma Remote_Types;
type Tree is tagged private
with Constant_Indexing => Constant_Reference,
Variable_Indexing => Reference,
Default_Iterator => Iterate,
Iterator_Element => Element_Type;
pragma Preelaborable_Initialization (Tree);
type Cursor is private;
pragma Preelaborable_Initialization (Cursor);
Empty_Tree : constant Tree;
No_Element : constant Cursor;
function Has_Element (Position : Cursor) return Boolean;
package Tree_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
function Equal_Subtree
(Left_Position : Cursor;
Right_Position : Cursor) return Boolean;
function "=" (Left, Right : Tree) return Boolean;
function Is_Empty (Container : Tree) return Boolean;
function Node_Count (Container : Tree) return Count_Type;
function Subtree_Node_Count (Position : Cursor) return Count_Type;
function Depth (Position : Cursor) return Count_Type;
function Is_Root (Position : Cursor) return Boolean;
function Is_Leaf (Position : Cursor) return Boolean;
function Root (Container : Tree) return Cursor;
procedure Clear (Container : in out Tree);
function Element (Position : Cursor) return Element_Type;
procedure Replace_Element
(Container : in out Tree;
Position : Cursor;
New_Item : Element_Type);
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
procedure Update_Element
(Container : in out Tree;
Position : Cursor;
Process : not null access procedure (Element : in out Element_Type));
type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
type Reference_Type
(Element : not null access Element_Type) is private
with Implicit_Dereference => Element;
function Constant_Reference
(Container : aliased Tree;
Position : Cursor) return Constant_Reference_Type;
pragma Inline (Constant_Reference);
function Reference
(Container : aliased in out Tree;
Position : Cursor) return Reference_Type;
pragma Inline (Reference);
procedure Assign (Target : in out Tree; Source : Tree);
function Copy (Source : Tree) return Tree;
procedure Move (Target : in out Tree; Source : in out Tree);
procedure Delete_Leaf
(Container : in out Tree;
Position : in out Cursor);
procedure Delete_Subtree
(Container : in out Tree;
Position : in out Cursor);
procedure Swap
(Container : in out Tree;
I, J : Cursor);
function Find
(Container : Tree;
Item : Element_Type) return Cursor;
-- This version of the AI:
-- 10-06-02 AI05-0136-1/07
-- declares Find_In_Subtree this way:
--
-- function Find_In_Subtree
-- (Container : Tree;
-- Item : Element_Type;
-- Position : Cursor) return Cursor;
--
-- It seems that the Container parameter is there by mistake, but we need
-- an official ruling from the ARG. ???
function Find_In_Subtree
(Position : Cursor;
Item : Element_Type) return Cursor;
-- This version of the AI:
-- 10-06-02 AI05-0136-1/07
-- declares Ancestor_Find this way:
--
-- function Ancestor_Find
-- (Container : Tree;
-- Item : Element_Type;
-- Position : Cursor) return Cursor;
--
-- It seems that the Container parameter is there by mistake, but we need
-- an official ruling from the ARG. ???
function Ancestor_Find
(Position : Cursor;
Item : Element_Type) return Cursor;
function Contains
(Container : Tree;
Item : Element_Type) return Boolean;
procedure Iterate
(Container : Tree;
Process : not null access procedure (Position : Cursor));
procedure Iterate_Subtree
(Position : Cursor;
Process : not null access procedure (Position : Cursor));
function Iterate (Container : Tree)
return Tree_Iterator_Interfaces.Forward_Iterator'Class;
function Iterate_Subtree (Position : Cursor)
return Tree_Iterator_Interfaces.Forward_Iterator'Class;
function Iterate_Children
(Container : Tree;
Parent : Cursor)
return Tree_Iterator_Interfaces.Reversible_Iterator'Class;
function Child_Count (Parent : Cursor) return Count_Type;
function Child_Depth (Parent, Child : Cursor) return Count_Type;
procedure Insert_Child
(Container : in out Tree;
Parent : Cursor;
Before : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Insert_Child
(Container : in out Tree;
Parent : Cursor;
Before : Cursor;
New_Item : Element_Type;
Position : out Cursor;
Count : Count_Type := 1);
procedure Insert_Child
(Container : in out Tree;
Parent : Cursor;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1);
procedure Prepend_Child
(Container : in out Tree;
Parent : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Append_Child
(Container : in out Tree;
Parent : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Delete_Children
(Container : in out Tree;
Parent : Cursor);
procedure Copy_Subtree
(Target : in out Tree;
Parent : Cursor;
Before : Cursor;
Source : Cursor);
procedure Splice_Subtree
(Target : in out Tree;
Parent : Cursor;
Before : Cursor;
Source : in out Tree;
Position : in out Cursor);
procedure Splice_Subtree
(Container : in out Tree;
Parent : Cursor;
Before : Cursor;
Position : Cursor);
procedure Splice_Children
(Target : in out Tree;
Target_Parent : Cursor;
Before : Cursor;
Source : in out Tree;
Source_Parent : Cursor);
procedure Splice_Children
(Container : in out Tree;
Target_Parent : Cursor;
Before : Cursor;
Source_Parent : Cursor);
function Parent (Position : Cursor) return Cursor;
function First_Child (Parent : Cursor) return Cursor;
function First_Child_Element (Parent : Cursor) return Element_Type;
function Last_Child (Parent : Cursor) return Cursor;
function Last_Child_Element (Parent : Cursor) return Element_Type;
function Next_Sibling (Position : Cursor) return Cursor;
function Previous_Sibling (Position : Cursor) return Cursor;
procedure Next_Sibling (Position : in out Cursor);
procedure Previous_Sibling (Position : in out Cursor);
-- This version of the AI:
-- 10-06-02 AI05-0136-1/07
-- declares Iterate_Children this way:
--
-- procedure Iterate_Children
-- (Container : Tree;
-- Parent : Cursor;
-- Process : not null access procedure (Position : Cursor));
--
-- It seems that the Container parameter is there by mistake, but we need
-- an official ruling from the ARG. ???
procedure Iterate_Children
(Parent : Cursor;
Process : not null access procedure (Position : Cursor));
procedure Reverse_Iterate_Children
(Parent : Cursor;
Process : not null access procedure (Position : Cursor));
private
-- A node of this multiway tree comprises an element and a list of children
-- (that are themselves trees). The root node is distinguished because it
-- contains only children: it does not have an element itself.
-- This design feature puts two design goals in tension with one another:
-- (1) treat the root node the same as any other node
-- (2) not declare any objects of type Element_Type unnecessarily
-- To satisfy (1), we could simply declare the Root node of the tree
-- using the normal Tree_Node_Type, but that would mean that (2) is not
-- satisfied. To resolve the tension (in favor of (2)), we declare the
-- component Root as having a different node type, without an Element
-- component (thus satisfying goal (2)) but otherwise identical to a normal
-- node, and then use Unchecked_Conversion to convert an access object
-- designating the Root node component to the access type designating a
-- normal, non-root node (thus satisfying goal (1)). We make an explicit
-- check for Root when there is any attempt to manipulate the Element
-- component of the node (a check required by the RM anyway).
-- In order to be explicit about node (and pointer) representation, we
-- specify that the respective node types have convention C, to ensure
-- that the layout of the components of the node records is the same,
-- thus guaranteeing that (unchecked) conversions between access types
-- designating each kind of node type is a meaningful conversion.
use Ada.Containers.Helpers;
package Implementation is new Generic_Implementation;
use Implementation;
type Tree_Node_Type;
type Tree_Node_Access is access all Tree_Node_Type;
pragma Convention (C, Tree_Node_Access);
pragma No_Strict_Aliasing (Tree_Node_Access);
-- The above-mentioned Unchecked_Conversion is a violation of the normal
-- aliasing rules.
type Children_Type is record
First : Tree_Node_Access;
Last : Tree_Node_Access;
end record;
-- See the comment above. This declaration must exactly match the
-- declaration of Root_Node_Type (except for the Element component).
type Tree_Node_Type is record
Parent : Tree_Node_Access;
Prev : Tree_Node_Access;
Next : Tree_Node_Access;
Children : Children_Type;
Element : aliased Element_Type;
end record;
pragma Convention (C, Tree_Node_Type);
-- See the comment above. This declaration must match the declaration of
-- Tree_Node_Type (except for the Element component).
type Root_Node_Type is record
Parent : Tree_Node_Access;
Prev : Tree_Node_Access;
Next : Tree_Node_Access;
Children : Children_Type;
end record;
pragma Convention (C, Root_Node_Type);
for Root_Node_Type'Alignment use Standard'Maximum_Alignment;
-- The alignment has to be large enough to allow Root_Node to Tree_Node
-- access value conversions, and Tree_Node_Type's alignment may be bumped
-- up by the Element component.
use Ada.Finalization;
-- The Count component of type Tree represents the number of nodes that
-- have been (dynamically) allocated. It does not include the root node
-- itself. As implementors, we decide to cache this value, so that the
-- selector function Node_Count can execute in O(1) time, in order to be
-- consistent with the behavior of the Length selector function for other
-- standard container library units. This does mean, however, that the
-- two-container forms for Splice_XXX (that move subtrees across tree
-- containers) will execute in O(n) time, because we must count the number
-- of nodes in the subtree(s) that get moved. (We resolve the tension
-- between Node_Count and Splice_XXX in favor of Node_Count, under the
-- assumption that Node_Count is the more common operation).
type Tree is new Controlled with record
Root : aliased Root_Node_Type;
TC : aliased Tamper_Counts;
Count : Count_Type := 0;
end record with Put_Image => Put_Image;
procedure Put_Image
(S : in out Ada.Strings.Text_Buffers.Root_Buffer_Type'Class; V : Tree);
overriding procedure Adjust (Container : in out Tree);
overriding procedure Finalize (Container : in out Tree) renames Clear;
use Ada.Streams;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Tree);
for Tree'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Tree);
for Tree'Read use Read;
type Tree_Access is access all Tree;
for Tree_Access'Storage_Size use 0;
type Cursor is record
Container : Tree_Access;
Node : Tree_Node_Access;
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Position : Cursor);
for Cursor'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Position : out Cursor);
for Cursor'Read use Read;
subtype Reference_Control_Type is Implementation.Reference_Control_Type;
-- It is necessary to rename this here, so that the compiler can find it
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type);
for Constant_Reference_Type'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type);
for Constant_Reference_Type'Write use Write;
type Reference_Type
(Element : not null access Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type);
for Reference_Type'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type);
for Reference_Type'Write use Write;
-- Three operations are used to optimize in the expansion of "for ... of"
-- loops: the Next(Cursor) procedure in the visible part, and the following
-- Pseudo_Reference and Get_Element_Access functions. See Exp_Ch5 for
-- details.
function Pseudo_Reference
(Container : aliased Tree'Class) return Reference_Control_Type;
pragma Inline (Pseudo_Reference);
-- Creates an object of type Reference_Control_Type pointing to the
-- container, and increments the Lock. Finalization of this object will
-- decrement the Lock.
type Element_Access is access all Element_Type with
Storage_Size => 0;
function Get_Element_Access
(Position : Cursor) return not null Element_Access;
-- Returns a pointer to the element designated by Position.
Empty_Tree : constant Tree := (Controlled with others => <>);
No_Element : constant Cursor := (others => <>);
end Ada.Containers.Multiway_Trees;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T L S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with ALI; use ALI;
with ALI.Util; use ALI.Util;
with Binderr; use Binderr;
with Butil; use Butil;
with Csets;
with Fname; use Fname;
with Gnatvsn; use Gnatvsn;
with GNAT.OS_Lib; use GNAT.OS_Lib;
with Namet; use Namet;
with Opt; use Opt;
with Osint; use Osint;
with Output; use Output;
with Prj; use Prj;
with Prj.Pars; use Prj.Pars;
with Prj.Env;
with Prj.Ext; use Prj.Ext;
with Prj.Util; use Prj.Util;
with Snames; use Snames;
with Stringt; use Stringt;
with Types; use Types;
procedure Gnatls is
pragma Ident (Gnat_Version_String);
Max_Column : constant := 80;
type File_Status is (
OK, -- matching timestamp
Checksum_OK, -- only matching checksum
Not_Found, -- file not found on source PATH
Not_Same, -- neither checksum nor timestamp matching
Not_First_On_PATH); -- matching file hidden by Not_Same file on path
type Dir_Data;
type Dir_Ref is access Dir_Data;
type Dir_Data is record
Value : String_Access;
Next : Dir_Ref;
end record;
First_Source_Dir : Dir_Ref;
Last_Source_Dir : Dir_Ref;
-- The list of source directories from the command line.
-- These directories are added using Osint.Add_Src_Search_Dir
-- after those of the GNAT Project File, if any.
First_Lib_Dir : Dir_Ref;
Last_Lib_Dir : Dir_Ref;
-- The list of object directories from the command line.
-- These directories are added using Osint.Add_Lib_Search_Dir
-- after those of the GNAT Project File, if any.
Main_File : File_Name_Type;
Ali_File : File_Name_Type;
Text : Text_Buffer_Ptr;
Id : ALI_Id;
Next_Arg : Positive;
Too_Long : Boolean := False;
-- When True, lines are too long for multi-column output and each
-- item of information is on a different line.
Project_File : String_Access;
Project : Prj.Project_Id;
Current_Verbosity : Prj.Verbosity := Prj.Default;
Selective_Output : Boolean := False;
Print_Usage : Boolean := False;
Print_Unit : Boolean := True;
Print_Source : Boolean := True;
Print_Object : Boolean := True;
-- Flags controlling the form of the outpout
Dependable : Boolean := False; -- flag -d
Also_Predef : Boolean := False;
Unit_Start : Integer;
Unit_End : Integer;
Source_Start : Integer;
Source_End : Integer;
Object_Start : Integer;
Object_End : Integer;
-- Various column starts and ends
Spaces : constant String (1 .. Max_Column) := (others => ' ');
-----------------------
-- Local Subprograms --
-----------------------
procedure Add_Lib_Dir (Dir : String; And_Save : Boolean);
-- Add an object directory, using Osint.Add_Lib_Search_Dir
-- if And_Save is False or keeping in the list First_Lib_Dir,
-- Last_Lib_Dir if And_Save is True.
procedure Add_Source_Dir (Dir : String; And_Save : Boolean);
-- Add a source directory, using Osint.Add_Src_Search_Dir
-- if And_Save is False or keeping in the list First_Source_Dir,
-- Last_Source_Dir if And_Save is True.
procedure Find_General_Layout;
-- Determine the structure of the output (multi columns or not, etc)
procedure Find_Status
(FS : in out File_Name_Type;
Stamp : Time_Stamp_Type;
Checksum : Word;
Status : out File_Status);
-- Determine the file status (Status) of the file represented by FS
-- with the expected Stamp and checksum given as argument. FS will be
-- updated to the full file name if available.
function Corresponding_Sdep_Entry (A : ALI_Id; U : Unit_Id) return Sdep_Id;
-- Give the Sdep entry corresponding to the unit U in ali record A.
function Index (Char : Character; Str : String) return Natural;
-- Returns the first occurrence of Char in Str.
-- Returns 0 if Char is not in Str.
procedure Output_Object (O : File_Name_Type);
-- Print out the name of the object when requested
procedure Output_Source (Sdep_I : Sdep_Id);
-- Print out the name and status of the source corresponding to this
-- sdep entry
procedure Output_Status (FS : File_Status; Verbose : Boolean);
-- Print out FS either in a coded form if verbose is false or in an
-- expanded form otherwise.
procedure Output_Unit (U_Id : Unit_Id);
-- Print out information on the unit when requested
procedure Reset_Print;
-- Reset Print flags properly when selective output is chosen
procedure Scan_Ls_Arg (Argv : String; And_Save : Boolean);
-- Scan and process lser specific arguments. Argv is a single argument.
procedure Usage;
-- Print usage message.
-----------------
-- Add_Lib_Dir --
-----------------
procedure Add_Lib_Dir (Dir : String; And_Save : Boolean) is
begin
if And_Save then
if First_Lib_Dir = null then
First_Lib_Dir :=
new Dir_Data'
(Value => new String'(Dir),
Next => null);
Last_Lib_Dir := First_Lib_Dir;
else
Last_Lib_Dir.Next :=
new Dir_Data'
(Value => new String'(Dir),
Next => null);
Last_Lib_Dir := Last_Lib_Dir.Next;
end if;
else
Add_Lib_Search_Dir (Dir);
end if;
end Add_Lib_Dir;
-- -----------------
-- Add_Source_Dir --
--------------------
procedure Add_Source_Dir (Dir : String; And_Save : Boolean) is
begin
if And_Save then
if First_Source_Dir = null then
First_Source_Dir :=
new Dir_Data'
(Value => new String'(Dir),
Next => null);
Last_Source_Dir := First_Source_Dir;
else
Last_Source_Dir.Next :=
new Dir_Data'
(Value => new String'(Dir),
Next => null);
Last_Source_Dir := Last_Source_Dir.Next;
end if;
else
Add_Src_Search_Dir (Dir);
end if;
end Add_Source_Dir;
------------------------------
-- Corresponding_Sdep_Entry --
------------------------------
function Corresponding_Sdep_Entry
(A : ALI_Id;
U : Unit_Id)
return Sdep_Id
is
begin
for D in ALIs.Table (A).First_Sdep .. ALIs.Table (A).Last_Sdep loop
if Sdep.Table (D).Sfile = Units.Table (U).Sfile then
return D;
end if;
end loop;
Error_Msg_Name_1 := Units.Table (U).Uname;
Error_Msg_Name_2 := ALIs.Table (A).Afile;
Write_Eol;
Error_Msg ("wrong ALI format, can't find dependency line for & in %");
Exit_Program (E_Fatal);
-- Not needed since we exit the program but avoids compiler warning
raise Program_Error;
end Corresponding_Sdep_Entry;
-------------------------
-- Find_General_Layout --
-------------------------
procedure Find_General_Layout is
Max_Unit_Length : Integer := 11;
Max_Src_Length : Integer := 11;
Max_Obj_Length : Integer := 11;
Len : Integer;
FS : File_Name_Type;
begin
-- Compute maximum of each column
for Id in ALIs.First .. ALIs.Last loop
Get_Name_String (Units.Table (ALIs.Table (Id).First_Unit).Uname);
if Also_Predef or else not Is_Internal_Unit then
if Print_Unit then
Len := Name_Len - 1;
Max_Unit_Length := Integer'Max (Max_Unit_Length, Len);
end if;
if Print_Source then
FS := Full_Source_Name (ALIs.Table (Id).Sfile);
if FS = No_File then
Get_Name_String (ALIs.Table (Id).Sfile);
Name_Len := Name_Len + 13;
else
Get_Name_String (FS);
end if;
Max_Src_Length := Integer'Max (Max_Src_Length, Name_Len + 1);
end if;
if Print_Object then
Get_Name_String (ALIs.Table (Id).Ofile_Full_Name);
Max_Obj_Length := Integer'Max (Max_Obj_Length, Name_Len + 1);
end if;
end if;
end loop;
-- Verify is output is not wider than maximum number of columns
Too_Long := Verbose_Mode or else
(Max_Unit_Length + Max_Src_Length + Max_Obj_Length) > Max_Column;
-- Set start and end of columns.
Object_Start := 1;
Object_End := Object_Start - 1;
if Print_Object then
Object_End := Object_Start + Max_Obj_Length;
end if;
Unit_Start := Object_End + 1;
Unit_End := Unit_Start - 1;
if Print_Unit then
Unit_End := Unit_Start + Max_Unit_Length;
end if;
Source_Start := Unit_End + 1;
if Source_Start > Spaces'Last then
Source_Start := Spaces'Last;
end if;
Source_End := Source_Start - 1;
if Print_Source then
Source_End := Source_Start + Max_Src_Length;
end if;
end Find_General_Layout;
-----------------
-- Find_Status --
-----------------
procedure Find_Status
(FS : in out File_Name_Type;
Stamp : Time_Stamp_Type;
Checksum : Word;
Status : out File_Status)
is
Tmp1 : File_Name_Type;
Tmp2 : File_Name_Type;
begin
Tmp1 := Full_Source_Name (FS);
if Tmp1 = No_File then
Status := Not_Found;
elsif File_Stamp (Tmp1) = Stamp then
FS := Tmp1;
Status := OK;
elsif Checksums_Match (Get_File_Checksum (FS), Checksum) then
FS := Tmp1;
Status := Checksum_OK;
else
Tmp2 := Matching_Full_Source_Name (FS, Stamp);
if Tmp2 = No_File then
Status := Not_Same;
FS := Tmp1;
else
Status := Not_First_On_PATH;
FS := Tmp2;
end if;
end if;
end Find_Status;
-----------
-- Index --
-----------
function Index (Char : Character; Str : String) return Natural is
begin
for Index in Str'Range loop
if Str (Index) = Char then
return Index;
end if;
end loop;
return 0;
end Index;
-------------------
-- Output_Object --
-------------------
procedure Output_Object (O : File_Name_Type) is
Object_Name : String_Access;
begin
if Print_Object then
Get_Name_String (O);
Object_Name := To_Host_File_Spec (Name_Buffer (1 .. Name_Len));
Write_Str (Object_Name.all);
if Print_Source or else Print_Unit then
if Too_Long then
Write_Eol;
Write_Str (" ");
else
Write_Str (Spaces
(Object_Start + Object_Name'Length .. Object_End));
end if;
end if;
end if;
end Output_Object;
-------------------
-- Output_Source --
-------------------
procedure Output_Source (Sdep_I : Sdep_Id) is
Stamp : constant Time_Stamp_Type := Sdep.Table (Sdep_I).Stamp;
Checksum : constant Word := Sdep.Table (Sdep_I).Checksum;
FS : File_Name_Type := Sdep.Table (Sdep_I).Sfile;
Status : File_Status;
Object_Name : String_Access;
begin
if Print_Source then
Find_Status (FS, Stamp, Checksum, Status);
Get_Name_String (FS);
Object_Name := To_Host_File_Spec (Name_Buffer (1 .. Name_Len));
if Verbose_Mode then
Write_Str (" Source => ");
Write_Str (Object_Name.all);
if not Too_Long then
Write_Str
(Spaces (Source_Start + Object_Name'Length .. Source_End));
end if;
Output_Status (Status, Verbose => True);
Write_Eol;
Write_Str (" ");
else
if not Selective_Output then
Output_Status (Status, Verbose => False);
end if;
Write_Str (Object_Name.all);
end if;
end if;
end Output_Source;
-------------------
-- Output_Status --
-------------------
procedure Output_Status (FS : File_Status; Verbose : Boolean) is
begin
if Verbose then
case FS is
when OK =>
Write_Str (" unchanged");
when Checksum_OK =>
Write_Str (" slightly modified");
when Not_Found =>
Write_Str (" file not found");
when Not_Same =>
Write_Str (" modified");
when Not_First_On_PATH =>
Write_Str (" unchanged version not first on PATH");
end case;
else
case FS is
when OK =>
Write_Str (" OK ");
when Checksum_OK =>
Write_Str (" MOK ");
when Not_Found =>
Write_Str (" ??? ");
when Not_Same =>
Write_Str (" DIF ");
when Not_First_On_PATH =>
Write_Str (" HID ");
end case;
end if;
end Output_Status;
-----------------
-- Output_Unit --
-----------------
procedure Output_Unit (U_Id : Unit_Id) is
Kind : Character;
U : Unit_Record renames Units.Table (U_Id);
begin
if Print_Unit then
Get_Name_String (U.Uname);
Kind := Name_Buffer (Name_Len);
Name_Len := Name_Len - 2;
if not Verbose_Mode then
Write_Str (Name_Buffer (1 .. Name_Len));
else
Write_Str ("Unit => ");
Write_Eol; Write_Str (" Name => ");
Write_Str (Name_Buffer (1 .. Name_Len));
Write_Eol; Write_Str (" Kind => ");
if Units.Table (U_Id).Unit_Kind = 'p' then
Write_Str ("package ");
else
Write_Str ("subprogram ");
end if;
if Kind = 's' then
Write_Str ("spec");
else
Write_Str ("body");
end if;
end if;
if Verbose_Mode then
if U.Preelab or
U.No_Elab or
U.Pure or
U.Elaborate_Body or
U.Remote_Types or
U.Shared_Passive or
U.RCI or
U.Predefined
then
Write_Eol; Write_Str (" Flags =>");
if U.Preelab then
Write_Str (" Preelaborable");
end if;
if U.No_Elab then
Write_Str (" No_Elab_Code");
end if;
if U.Pure then
Write_Str (" Pure");
end if;
if U.Elaborate_Body then
Write_Str (" Elaborate Body");
end if;
if U.Remote_Types then
Write_Str (" Remote_Types");
end if;
if U.Shared_Passive then
Write_Str (" Shared_Passive");
end if;
if U.Predefined then
Write_Str (" Predefined");
end if;
if U.RCI then
Write_Str (" Remote_Call_Interface");
end if;
end if;
end if;
if Print_Source then
if Too_Long then
Write_Eol; Write_Str (" ");
else
Write_Str (Spaces (Unit_Start + Name_Len + 1 .. Unit_End));
end if;
end if;
end if;
end Output_Unit;
-----------------
-- Reset_Print --
-----------------
procedure Reset_Print is
begin
if not Selective_Output then
Selective_Output := True;
Print_Source := False;
Print_Object := False;
Print_Unit := False;
end if;
end Reset_Print;
-------------------
-- Scan_Ls_Arg --
-------------------
procedure Scan_Ls_Arg (Argv : String; And_Save : Boolean) is
begin
pragma Assert (Argv'First = 1);
if Argv'Length = 0 then
return;
end if;
if Argv (1) = Switch_Character or else Argv (1) = '-' then
if Argv'Length = 1 then
Fail ("switch character cannot be followed by a blank");
-- -I-
elsif Argv (2 .. Argv'Last) = "I-" then
Opt.Look_In_Primary_Dir := False;
-- Forbid -?- or -??- where ? is any character
elsif (Argv'Length = 3 and then Argv (3) = '-')
or else (Argv'Length = 4 and then Argv (4) = '-')
then
Fail ("Trailing ""-"" at the end of ", Argv, " forbidden.");
-- -Idir
elsif Argv (2) = 'I' then
Add_Source_Dir (Argv (3 .. Argv'Last), And_Save);
Add_Lib_Dir (Argv (3 .. Argv'Last), And_Save);
-- -aIdir (to gcc this is like a -I switch)
elsif Argv'Length >= 3 and then Argv (2 .. 3) = "aI" then
Add_Source_Dir (Argv (4 .. Argv'Last), And_Save);
-- -aOdir
elsif Argv'Length >= 3 and then Argv (2 .. 3) = "aO" then
Add_Lib_Dir (Argv (4 .. Argv'Last), And_Save);
-- -aLdir (to gnatbind this is like a -aO switch)
elsif Argv'Length >= 3 and then Argv (2 .. 3) = "aL" then
Add_Lib_Dir (Argv (4 .. Argv'Last), And_Save);
-- -vPx
elsif Argv'Length = 4 and then Argv (2 .. 3) = "vP" then
case Argv (4) is
when '0' =>
Current_Verbosity := Prj.Default;
when '1' =>
Current_Verbosity := Prj.Medium;
when '2' =>
Current_Verbosity := Prj.High;
when others =>
null;
end case;
-- -Pproject_file
elsif Argv'Length >= 3 and then Argv (2) = 'P' then
if Project_File /= null then
Fail (Argv & ": second project file forbidden (first is """ &
Project_File.all & """)");
else
Project_File := new String'(Argv (3 .. Argv'Last));
end if;
-- -Xexternal=value
elsif Argv'Length >= 5 and then Argv (2) = 'X' then
declare
Equal_Pos : constant Natural :=
Index ('=', Argv (3 .. Argv'Last));
begin
if Equal_Pos >= 4 and then
Equal_Pos /= Argv'Last then
Add (External_Name => Argv (3 .. Equal_Pos - 1),
Value => Argv (Equal_Pos + 1 .. Argv'Last));
else
Fail (Argv & " is not a valid external assignment.");
end if;
end;
elsif Argv (2 .. Argv'Last) = "nostdinc" then
Opt.No_Stdinc := True;
elsif Argv'Length = 2 then
case Argv (2) is
when 'a' => Also_Predef := True;
when 'h' => Print_Usage := True;
when 'u' => Reset_Print; Print_Unit := True;
when 's' => Reset_Print; Print_Source := True;
when 'o' => Reset_Print; Print_Object := True;
when 'v' => Verbose_Mode := True;
when 'd' => Dependable := True;
when others => null;
end case;
end if;
-- If not a switch it must be a file name
else
Set_Main_File_Name (Argv);
end if;
end Scan_Ls_Arg;
-----------
-- Usage --
-----------
procedure Usage is
procedure Write_Switch_Char;
-- Write two spaces followed by appropriate switch character
procedure Write_Switch_Char is
begin
Write_Str (" ");
Write_Char (Switch_Character);
end Write_Switch_Char;
-- Start of processing for Usage
begin
-- Usage line
Write_Str ("Usage: ");
Osint.Write_Program_Name;
Write_Str (" switches [list of object files]");
Write_Eol;
Write_Eol;
-- GNATLS switches
Write_Str ("switches:");
Write_Eol;
-- Line for -a
Write_Switch_Char;
Write_Str ("a also output relevant predefined units");
Write_Eol;
-- Line for -u
Write_Switch_Char;
Write_Str ("u output only relevant unit names");
Write_Eol;
-- Line for -h
Write_Switch_Char;
Write_Str ("h output this help message");
Write_Eol;
-- Line for -s
Write_Switch_Char;
Write_Str ("s output only relevant source names");
Write_Eol;
-- Line for -o
Write_Switch_Char;
Write_Str ("o output only relevant object names");
Write_Eol;
-- Line for -d
Write_Switch_Char;
Write_Str ("d output sources on which specified units depend");
Write_Eol;
-- Line for -v
Write_Switch_Char;
Write_Str ("v verbose output, full path and unit information");
Write_Eol;
Write_Eol;
-- Line for -aI switch
Write_Switch_Char;
Write_Str ("aIdir specify source files search path");
Write_Eol;
-- Line for -aO switch
Write_Switch_Char;
Write_Str ("aOdir specify object files search path");
Write_Eol;
-- Line for -I switch
Write_Switch_Char;
Write_Str ("Idir like -aIdir -aOdir");
Write_Eol;
-- Line for -I- switch
Write_Switch_Char;
Write_Str ("I- do not look for sources & object files");
Write_Str (" in the default directory");
Write_Eol;
-- Line for -vPx
Write_Switch_Char;
Write_Str ("vPx verbosity for project file (0, 1 or 2)");
Write_Eol;
-- Line for -Pproject_file
Write_Switch_Char;
Write_Str ("Pprj use a project file prj");
Write_Eol;
-- Line for -Xexternal=value
Write_Switch_Char;
Write_Str ("Xext=val specify an external value.");
Write_Eol;
-- Line for -nostdinc
Write_Switch_Char;
Write_Str ("nostdinc do not look for source files");
Write_Str (" in the system default directory");
Write_Eol;
-- File Status explanation
Write_Eol;
Write_Str (" file status can be:");
Write_Eol;
for ST in File_Status loop
Write_Str (" ");
Output_Status (ST, Verbose => False);
Write_Str (" ==> ");
Output_Status (ST, Verbose => True);
Write_Eol;
end loop;
end Usage;
-- Start of processing for Gnatls
begin
Osint.Initialize (Binder);
Namet.Initialize;
Csets.Initialize;
Snames.Initialize;
Prj.Initialize;
-- Use low level argument routines to avoid dragging in the secondary stack
Next_Arg := 1;
Scan_Args : while Next_Arg < Arg_Count loop
declare
Next_Argv : String (1 .. Len_Arg (Next_Arg));
begin
Fill_Arg (Next_Argv'Address, Next_Arg);
Scan_Ls_Arg (Next_Argv, And_Save => True);
end;
Next_Arg := Next_Arg + 1;
end loop Scan_Args;
-- If a switch -P is used, parse the project file
if Project_File /= null then
Prj.Pars.Set_Verbosity (To => Current_Verbosity);
Prj.Pars.Parse
(Project => Project,
Project_File_Name => Project_File.all);
if Project = Prj.No_Project then
Fail ("""" & Project_File.all & """ processing failed");
end if;
-- Add the source directories and the object directories
-- to the searched directories.
declare
procedure Register_Source_Dirs is new
Prj.Env.For_All_Source_Dirs (Add_Src_Search_Dir);
procedure Register_Object_Dirs is new
Prj.Env.For_All_Object_Dirs (Add_Lib_Search_Dir);
begin
Register_Source_Dirs (Project);
Register_Object_Dirs (Project);
end;
-- Check if a package gnatls is in the project file and if there is
-- there is one, get the switches, if any, and scan them.
declare
Data : Prj.Project_Data := Prj.Projects.Table (Project);
Pkg : Prj.Package_Id :=
Prj.Util.Value_Of
(Name => Name_Gnatls,
In_Packages => Data.Decl.Packages);
Element : Package_Element;
Switches : Prj.Variable_Value;
Current : Prj.String_List_Id;
The_String : String_Element;
begin
if Pkg /= No_Package then
Element := Packages.Table (Pkg);
Switches :=
Prj.Util.Value_Of
(Variable_Name => Name_Switches,
In_Variables => Element.Decl.Attributes);
case Switches.Kind is
when Prj.Undefined =>
null;
when Prj.Single =>
if String_Length (Switches.Value) > 0 then
String_To_Name_Buffer (Switches.Value);
Scan_Ls_Arg
(Name_Buffer (1 .. Name_Len),
And_Save => False);
end if;
when Prj.List =>
Current := Switches.Values;
while Current /= Prj.Nil_String loop
The_String := String_Elements.Table (Current);
if String_Length (The_String.Value) > 0 then
String_To_Name_Buffer (The_String.Value);
Scan_Ls_Arg
(Name_Buffer (1 .. Name_Len),
And_Save => False);
end if;
Current := The_String.Next;
end loop;
end case;
end if;
end;
end if;
-- Add the source and object directories specified on the
-- command line, if any, to the searched directories.
while First_Source_Dir /= null loop
Add_Src_Search_Dir (First_Source_Dir.Value.all);
First_Source_Dir := First_Source_Dir.Next;
end loop;
while First_Lib_Dir /= null loop
Add_Lib_Search_Dir (First_Lib_Dir.Value.all);
First_Lib_Dir := First_Lib_Dir.Next;
end loop;
-- Finally, add the default directories.
Osint.Add_Default_Search_Dirs;
if Verbose_Mode then
-- WARNING: the output of gnatls -v is used during the compilation
-- and installation of GLADE to recreate sdefault.adb and locate
-- the libgnat.a to use. Any change in the output of gnatls -v must
-- be synchronized with the GLADE Dist/config.sdefault shell script.
Write_Eol;
Write_Str ("GNATLS ");
Write_Str (Gnat_Version_String);
Write_Str (" Copyright 1997-2001 Free Software Foundation, Inc.");
Write_Eol;
Write_Eol;
Write_Str ("Source Search Path:");
Write_Eol;
for J in 1 .. Nb_Dir_In_Src_Search_Path loop
Write_Str (" ");
if Dir_In_Src_Search_Path (J)'Length = 0 then
Write_Str ("<Current_Directory>");
else
Write_Str (To_Host_Dir_Spec
(Dir_In_Src_Search_Path (J).all, True).all);
end if;
Write_Eol;
end loop;
Write_Eol;
Write_Eol;
Write_Str ("Object Search Path:");
Write_Eol;
for J in 1 .. Nb_Dir_In_Obj_Search_Path loop
Write_Str (" ");
if Dir_In_Obj_Search_Path (J)'Length = 0 then
Write_Str ("<Current_Directory>");
else
Write_Str (To_Host_Dir_Spec
(Dir_In_Obj_Search_Path (J).all, True).all);
end if;
Write_Eol;
end loop;
Write_Eol;
end if;
-- Output usage information when requested
if Print_Usage then
Usage;
end if;
if not More_Lib_Files then
if not Print_Usage and then not Verbose_Mode then
Usage;
end if;
Exit_Program (E_Fatal);
end if;
Initialize_ALI;
Initialize_ALI_Source;
-- Print out all library for which no ALI files can be located
while More_Lib_Files loop
Main_File := Next_Main_Lib_File;
Ali_File := Full_Lib_File_Name (Lib_File_Name (Main_File));
if Ali_File = No_File then
Write_Str ("Can't find library info for ");
Get_Decoded_Name_String (Main_File);
Write_Char ('"');
Write_Str (Name_Buffer (1 .. Name_Len));
Write_Char ('"');
Write_Eol;
else
Ali_File := Strip_Directory (Ali_File);
if Get_Name_Table_Info (Ali_File) = 0 then
Text := Read_Library_Info (Ali_File, True);
Id :=
Scan_ALI
(Ali_File, Text, Ignore_ED => False, Err => False);
Free (Text);
end if;
end if;
end loop;
Find_General_Layout;
for Id in ALIs.First .. ALIs.Last loop
declare
Last_U : Unit_Id;
begin
Get_Name_String (Units.Table (ALIs.Table (Id).First_Unit).Uname);
if Also_Predef or else not Is_Internal_Unit then
Output_Object (ALIs.Table (Id).Ofile_Full_Name);
-- In verbose mode print all main units in the ALI file, otherwise
-- just print the first one to ease columnwise printout
if Verbose_Mode then
Last_U := ALIs.Table (Id).Last_Unit;
else
Last_U := ALIs.Table (Id).First_Unit;
end if;
for U in ALIs.Table (Id).First_Unit .. Last_U loop
if U /= ALIs.Table (Id).First_Unit
and then Selective_Output
and then Print_Unit
then
Write_Eol;
end if;
Output_Unit (U);
-- Output source now, unless if it will be done as part of
-- outputing dependencies.
if not (Dependable and then Print_Source) then
Output_Source (Corresponding_Sdep_Entry (Id, U));
end if;
end loop;
-- Print out list of dependable units
if Dependable and then Print_Source then
if Verbose_Mode then
Write_Str ("depends upon");
Write_Eol;
Write_Str (" ");
else
Write_Eol;
end if;
for D in
ALIs.Table (Id).First_Sdep .. ALIs.Table (Id).Last_Sdep
loop
if Also_Predef
or else not Is_Internal_File_Name (Sdep.Table (D).Sfile)
then
if Verbose_Mode then
Write_Str (" ");
Output_Source (D);
elsif Too_Long then
Write_Str (" ");
Output_Source (D);
Write_Eol;
else
Write_Str (Spaces (1 .. Source_Start - 2));
Output_Source (D);
Write_Eol;
end if;
end if;
end loop;
end if;
Write_Eol;
end if;
end;
end loop;
-- All done. Set proper exit status.
Namet.Finalize;
Exit_Program (E_Success);
end Gnatls;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . W W D _ C H A R --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routine used for Character'Wide_[Wide_]Width
package System.WWd_Char is
pragma Pure;
function Wide_Width_Character (Lo, Hi : Character) return Natural;
-- Compute Wide_Width attribute for non-static type derived from
-- Character. The arguments are the low and high bounds for the type.
function Wide_Wide_Width_Character (Lo, Hi : Character) return Natural;
-- Compute Wide_Wide_Width attribute for non-static type derived from
-- Character. The arguments are the low and high bounds for the type.
end System.WWd_Char;
|
package body STM32.CORDIC is
-------------------------
-- Set_CORDIC_Function --
-------------------------
procedure Set_CORDIC_Function
(This : in out CORDIC_Coprocessor;
Value : CORDIC_Function)
is
begin
This.CSR.FUNC := Value'Enum_Rep;
end Set_CORDIC_Function;
-------------------------
-- Get_CORDIC_Function --
-------------------------
function Get_CORDIC_Function (This : CORDIC_Coprocessor)
return CORDIC_Function
is
begin
return CORDIC_Function'Val (This.CSR.FUNC);
end Get_CORDIC_Function;
--------------------------
-- Set_CORDIC_Precision --
--------------------------
procedure Set_CORDIC_Precision
(This : in out CORDIC_Coprocessor;
Value : CORDIC_Iterations)
is
begin
This.CSR.PRECISION := Value'Enum_Rep;
end Set_CORDIC_Precision;
-------------------------------
-- Set_CORDIC_Scaling_Factor --
-------------------------------
procedure Set_CORDIC_Scaling_Factor
(This : in out CORDIC_Coprocessor;
Value : UInt3)
is
begin
This.CSR.SCALE := Value;
end Set_CORDIC_Scaling_Factor;
--------------------------
-- Set_CORDIC_Data_Size --
--------------------------
procedure Set_CORDIC_Data_Size
(This : in out CORDIC_Coprocessor;
Value : CORDIC_Data_Size)
is
begin
This.CSR.ARGSIZE := Value = Data_16_Bit;
This.CSR.RESSIZE := Value = Data_16_Bit;
end Set_CORDIC_Data_Size;
--------------------------
-- Get_CORDIC_Data_Size --
--------------------------
function Get_CORDIC_Data_Size
(This : CORDIC_Coprocessor)
return CORDIC_Data_Size
is
begin
return (if This.CSR.ARGSIZE then Data_16_Bit else Data_32_Bit);
end Get_CORDIC_Data_Size;
---------------------------------
-- Set_CORDIC_Arguments_Number --
---------------------------------
procedure Set_CORDIC_Arguments_Number
(This : in out CORDIC_Coprocessor;
Value : CORDIC_Arguments_Number)
is
begin
This.CSR.NARGS := Value = Two_32_Bit;
end Set_CORDIC_Arguments_Number;
---------------------------------
-- Get_CORDIC_Arguments_Number --
---------------------------------
function Get_CORDIC_Arguments_Number
(This : CORDIC_Coprocessor)
return CORDIC_Arguments_Number
is
begin
return (if This.CSR.NARGS then Two_32_Bit else One_32_Bit);
end Get_CORDIC_Arguments_Number;
-------------------------------
-- Set_CORDIC_Results_Number --
-------------------------------
procedure Set_CORDIC_Results_Number
(This : in out CORDIC_Coprocessor;
Value : CORDIC_Arguments_Number)
is
begin
This.CSR.NRES := Value = Two_32_Bit;
end Set_CORDIC_Results_Number;
-------------------------------
-- Get_CORDIC_Results_Number --
-------------------------------
function Get_CORDIC_Results_Number
(This : CORDIC_Coprocessor)
return CORDIC_Arguments_Number
is
begin
return (if This.CSR.NRES then Two_32_Bit else One_32_Bit);
end Get_CORDIC_Results_Number;
-----------------------------------
-- Configure_CORDIC_Coprocesssor --
-----------------------------------
procedure Configure_CORDIC_Coprocessor
(This : in out CORDIC_Coprocessor;
Operation : CORDIC_Function;
Precision : CORDIC_Iterations := Iteration_20;
Scaling : UInt3 := 0;
Data_Size : CORDIC_Data_Size)
is
begin
This.CSR.FUNC := Operation'Enum_Rep;
This.CSR.PRECISION := Precision'Enum_Rep;
This.CSR.SCALE := Scaling;
This.CSR.ARGSIZE := Data_Size = Data_16_Bit;
This.CSR.RESSIZE := Data_Size = Data_16_Bit;
case Operation is
when Cosine | Sine | Phase | Modulus =>
case Data_Size is
when Data_32_Bit =>
This.CSR.NARGS := True; -- Two_32_Bit Arguments
This.CSR.NRES := True; -- Two_32_Bit Results
when Data_16_Bit =>
This.CSR.NARGS := False; -- One_32_Bit Argument
This.CSR.NRES := False; -- One_32_Bit Result
end case;
when Hyperbolic_Cosine | Hyperbolic_Sine =>
case Data_Size is
when Data_32_Bit =>
This.CSR.NARGS := False; -- One_32_Bit Argument
This.CSR.NRES := True; -- Two_32_Bit Results
when Data_16_Bit =>
This.CSR.NARGS := False; -- One_32_Bit Argument
This.CSR.NRES := False; -- One_32_Bit Result
end case;
when Arctangent | Hyperbolic_Arctangent | Natural_Logarithm | Square_Root =>
case Data_Size is
when Data_32_Bit =>
This.CSR.NARGS := False; -- One_32_Bit Argument
This.CSR.NRES := False; -- One_32_Bit Result
when Data_16_Bit =>
This.CSR.NARGS := False; -- One_32_Bit Argument
This.CSR.NRES := False; -- One_32_Bit Result
end case;
end case;
end Configure_CORDIC_Coprocessor;
---------------------
-- Get_CORDIC_Data --
---------------------
function Get_CORDIC_Data (This : CORDIC_Coprocessor) return UInt32 is
begin
return This.RDATA;
end Get_CORDIC_Data;
------------
-- Status --
------------
function Status
(This : CORDIC_Coprocessor;
Flag : CORDIC_Status) return Boolean
is
begin
case Flag is
when Result_Ready =>
return This.CSR.RRDY;
end case;
end Status;
-------------------
-- Set_Interrupt --
-------------------
procedure Set_Interrupt
(This : in out CORDIC_Coprocessor;
Enable : Boolean)
is
begin
This.CSR.IEN := Enable;
end Set_Interrupt;
-----------------------
-- Interrupt_Enabled --
-----------------------
function Interrupt_Enabled
(This : CORDIC_Coprocessor) return Boolean
is
begin
return This.CSR.IEN;
end Interrupt_Enabled;
-------------
-- Set_DMA --
-------------
procedure Set_DMA
(This : in out CORDIC_Coprocessor;
DMA : CORDIC_DMA;
Enable : Boolean)
is
begin
case DMA is
when Read_DMA =>
This.CSR.DMAREN := Enable;
when Write_DMA =>
This.CSR.DMAWEN := Enable;
end case;
end Set_DMA;
-----------------
-- DMA_Enabled --
-----------------
function DMA_Enabled
(This : CORDIC_Coprocessor;
DMA : CORDIC_DMA)
return Boolean
is
begin
case DMA is
when Read_DMA =>
return This.CSR.DMAREN;
when Write_DMA =>
return This.CSR.DMAWEN;
end case;
end DMA_Enabled;
end STM32.CORDIC;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Compilation_Units;
with Program.Compilation_Unit_Vectors;
with Program.Library_Items;
limited with Program.Library_Unit_Declarations;
package Program.Library_Unit_Bodies is
pragma Pure;
type Library_Unit_Body is limited interface
and Program.Library_Items.Library_Item;
-- A library_unit_body is a compilation unit that is the subprogram or
-- package body.
--
-- A unit interpreted only as the completion of a subprogram, or a unit
-- interpreted as both the declaration and body of a library subprogram.
-- Reference Manual 10.1.4(4)
type Library_Unit_Body_Access is access all Library_Unit_Body'Class
with Storage_Size => 0;
not overriding function Corresponding_Declaration
(Self : access Library_Unit_Body)
return Program.Library_Unit_Declarations.Library_Unit_Declaration_Access
is abstract;
-- Returns the corresponding library_unit_declaration, if any, for the
-- library_unit_body. The corresponding library unit is the unit upon
-- which the library_unit_body depends semantically.
--
-- Returns null for library_unit_body arguments that do not have a
-- corresponding library unit contained in the Context.
not overriding function Subunits (Self : access Library_Unit_Body)
return Program.Compilation_Unit_Vectors.Compilation_Unit_Vector_Access
is abstract;
-- with Post'Class =>
-- (Subunits'Result.Is_Empty
-- or else (for all X in Subunits'Result.Each_Unit => X.Unit.Is_Subunit));
-- Returns a complete list of subunit values, with one value for each body
-- stub that appears in the given Library_Unit_Body. Returns an empty list
-- if the parent unit does not contain any body stubs.
end Program.Library_Unit_Bodies;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . B B . B O A R D _ S U P P O R T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1999-2002 Universidad Politecnica de Madrid --
-- Copyright (C) 2003-2005 The European Space Agency --
-- Copyright (C) 2003-2018, 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. --
-- --
-- The port of GNARL to bare board targets was initially developed by the --
-- Real-Time Systems Group at the Technical University of Madrid. --
-- --
------------------------------------------------------------------------------
with System.Machine_Code;
with System.BB.CPU_Primitives;
with System.BB.Board_Parameters;
with Interfaces.NRF51; use Interfaces.NRF51;
with Interfaces.NRF51.RTC; use Interfaces.NRF51.RTC;
with Interfaces.NRF51.CLOCK; use Interfaces.NRF51.CLOCK;
package body System.BB.Board_Support is
use CPU_Primitives, BB.Interrupts, Machine_Code, Time;
package BBOPA renames System.BB.Board_Parameters;
Interrupt_Request_Vector : constant Vector_Id := 16;
-- See vector definitions in ARMv7-M version of System.BB.CPU_Primitives.
-- Defined by ARMv7-M specifications.
Alarm_Time : Time.Timer_Interval;
pragma Volatile (Alarm_Time);
pragma Export (C, Alarm_Time, "__gnat_alarm_time");
Alarm_Interrupt_ID : constant Interrupt_ID := 11;
-------------------
-- RTC0 Handling --
-------------------
Tick_Period : constant Time.Timer_Interval :=
BBOPA.Clock_Frequency / (32_768 / (BBOPA.RTC_Prescaler + 1));
Next_Tick_Time : Timer_Interval with Volatile;
-- Time when systick will expire. This gives the high digits of the time
----------------------------------------------
-- New Vectored Interrupt Controller (NVIC) --
----------------------------------------------
NVIC_Base : constant := 16#E000_E000#;
-- Nested Vectored Interrupt Controller (NVIC) base.
NVIC_ISER0 : constant Address := NVIC_Base + 16#100#;
-- Writing a bit mask to this register enables the corresponding interrupts
type PRI is mod 2**8;
-- Type for ARMv7-M interrupt priorities. Note that 0 is the highest
-- priority, which is reserved for the kernel and has no corresponding
-- Interrupt_Priority value, and 255 is the lowest. We assume the PRIGROUP
-- setting is such that the 4 most significant bits determine the priority
-- group used for preemption. However, if less bits are implemented, this
-- should still work.
function To_PRI (P : Integer) return PRI is
(if P not in Interrupt_Priority then 0
else PRI (Interrupt_Priority'Last - P + 1) * 16);
-- Return the BASEPRI mask for the given Ada priority. Note that the zero
-- value here means no mask, so no interrupts are masked.
function To_Priority (P : PRI) return Interrupt_Priority is
(if P = 0 then Interrupt_Priority'Last
else (Interrupt_Priority'Last - Any_Priority'Base (P / 16) + 1));
-- Given an ARM interrupt priority (PRI value), determine the Ada priority
-- While the value 0 is reserved for the kernel and has no Ada priority
-- that represents it, Interrupt_Priority'Last is closest.
IP : array (0 .. Interrupt_ID'Last) of PRI
with Volatile, Address => 16#E000_E400#;
-- Local utility functions
procedure Enable_Interrupt_Request
(Interrupt : Interrupt_ID;
Prio : Interrupt_Priority);
-- Enable interrupt requests for the given interrupt
procedure Interrupt_Handler;
-- Low-level interrupt handlers
----------------------
-- Initialize_Board --
----------------------
procedure Initialize_Board is
begin
-- Mask interrupts
Disable_Interrupts;
-- Timer --
-- Configure the low frequency clock required for RTC0
CLOCK_Periph.LFCLKSRC.SRC := Rc; -- Use internal RC oscillator
-- Start the low frequency clock
CLOCK_Periph.TASKS_LFCLKSTART := 1;
-- Wait until the low frequency clock is started
while CLOCK_Periph.EVENTS_LFCLKSTARTED = 0 loop
null;
end loop;
-- We run the counter at 32.768KHz
RTC0_Periph.PRESCALER.PRESCALER := BBOPA.RTC_Prescaler;
RTC0_Periph.INTENSET.TICK := Set;
RTC0_Periph.EVTENSET.TICK := Set;
Next_Tick_Time := Tick_Period;
Time.Set_Alarm (Timer_Interval'Last);
Time.Clear_Alarm_Interrupt;
-- We do not start the timer until the handler is ready to receive the
-- interrupt, i.e. in Install_Alarm_Handler.
-- Interrupts --
Install_Trap_Handler
(Interrupt_Handler'Address, Interrupt_Request_Vector);
end Initialize_Board;
package body Time is
Upper_Alarm_Handler : BB.Interrupts.Interrupt_Handler := null;
procedure Pre_Alarm_Handler (Id : Interrupt_ID);
-----------------------
-- Pre_Alarm_Handler --
-----------------------
procedure Pre_Alarm_Handler (Id : Interrupt_ID) is
begin
Next_Tick_Time := Next_Tick_Time + Tick_Period;
pragma Assert (Upper_Alarm_Handler /= null);
Upper_Alarm_Handler (Id);
end Pre_Alarm_Handler;
------------------------
-- Max_Timer_Interval --
------------------------
function Max_Timer_Interval return Timer_Interval is (2**32 - 1);
----------------
-- Read_Clock --
----------------
function Read_Clock return BB.Time.Time is
PRIMASK : Word;
Res : Timer_Interval;
begin
-- As several registers and variables need to be read or modified, do
-- it atomically.
Asm ("mrs %0, PRIMASK",
Outputs => Word'Asm_Output ("=&r", PRIMASK),
Volatile => True);
Asm ("msr PRIMASK, %0",
Inputs => Word'Asm_Input ("r", 1),
Volatile => True);
Res := Next_Tick_Time;
-- Restore interrupt mask
Asm ("msr PRIMASK, %0",
Inputs => Word'Asm_Input ("r", PRIMASK),
Volatile => True);
return BB.Time.Time (Res);
end Read_Clock;
---------------------------
-- Clear_Alarm_Interrupt --
---------------------------
procedure Clear_Alarm_Interrupt is
begin
RTC0_Periph.EVENTS_TICK := 0;
end Clear_Alarm_Interrupt;
---------------
-- Set_Alarm --
---------------
procedure Set_Alarm (Ticks : Timer_Interval) is
Now : constant Timer_Interval := Timer_Interval (Read_Clock);
begin
-- As we will have periodic interrupts for alarms regardless, the
-- only thing to do is force an interrupt if the alarm has already
-- expired.
Alarm_Time :=
Now + Timer_Interval'Min (Timer_Interval'Last / 2, Ticks);
-- FIXME: We can't do that with RTC0
-- if Ticks = 0 then
-- ICSR := ICSR_Pend_ST_Set;
-- end if;
end Set_Alarm;
---------------------------
-- Install_Alarm_Handler --
---------------------------
procedure Install_Alarm_Handler
(Handler : BB.Interrupts.Interrupt_Handler) is
begin
pragma Assert (Upper_Alarm_Handler = null);
Upper_Alarm_Handler := Handler;
BB.Interrupts.Attach_Handler
(Pre_Alarm_Handler'Access,
Alarm_Interrupt_ID,
Interrupt_Priority'Last);
-- Clear pending timer interrupt if any
Time.Clear_Alarm_Interrupt;
-- Now that the interrupt handler is attached, we can start the timer
RTC0_Periph.TASKS_START := 1;
end Install_Alarm_Handler;
end Time;
package body Multiprocessors is separate;
-----------------------
-- Interrupt_Handler --
-----------------------
procedure Interrupt_Handler is
Id : Interrupt_ID;
Res : Word;
PRIMASK : Word;
begin
Asm ("mrs %0, PRIMASK",
Outputs => Word'Asm_Output ("=&r", PRIMASK),
Volatile => True);
Asm ("msr PRIMASK, %0",
Inputs => Word'Asm_Input ("r", 1),
Volatile => True);
-- The exception number is read from the IPSR
Asm ("mrs %0, ipsr",
Word'Asm_Output ("=r", Res),
Volatile => True);
Res := Res and 16#FF#;
-- Convert it to IRQ number by substracting 16 (number of cpu
-- exceptions).
Id := Interrupt_ID'Base (Res) - 16;
Interrupt_Wrapper (Id);
-- Restore interrupt mask
Asm ("msr PRIMASK, %0",
Inputs => Word'Asm_Input ("r", PRIMASK),
Volatile => True);
end Interrupt_Handler;
------------------------------
-- Enable_Interrupt_Request --
------------------------------
procedure Enable_Interrupt_Request
(Interrupt : Interrupt_ID;
Prio : Interrupt_Priority)
is
begin
if Interrupt = Alarm_Interrupt_ID then
-- Consistency check with Priority_Of_Interrupt
pragma Assert (Prio = Interrupt_Priority'Last);
Time.Clear_Alarm_Interrupt;
end if;
declare
pragma Assert (Interrupt >= 0);
IRQ : constant Natural := Interrupt;
Regofs : constant Natural := IRQ / 32;
Regbit : constant Word := 2** (IRQ mod 32);
NVIC_ISER : array (0 .. 15) of Word
with Volatile, Address => NVIC_ISER0;
-- Many NVIC registers use 16 words of 32 bits each to serve as a
-- bitmap for all interrupt channels. Regofs indicates register
-- offset (0 .. 15), and Regbit indicates the mask required for
-- addressing the bit.
begin
NVIC_ISER (Regofs) := Regbit;
end;
end Enable_Interrupt_Request;
package body Interrupts is
-------------------------------
-- Install_Interrupt_Handler --
-------------------------------
procedure Install_Interrupt_Handler
(Interrupt : Interrupt_ID;
Prio : Interrupt_Priority)
is
begin
if Interrupt /= Alarm_Interrupt_ID then
IP (Interrupt) := To_PRI (Prio);
end if;
Enable_Interrupt_Request (Interrupt, Prio);
end Install_Interrupt_Handler;
---------------------------
-- Priority_Of_Interrupt --
---------------------------
function Priority_Of_Interrupt
(Interrupt : Interrupt_ID) return Any_Priority
is
(if Interrupt = Alarm_Interrupt_ID then Interrupt_Priority'Last
else To_Priority (IP (Interrupt)));
----------------
-- Power_Down --
----------------
procedure Power_Down is
begin
Asm ("wfi", Volatile => True);
end Power_Down;
--------------------------
-- Set_Current_Priority --
--------------------------
procedure Set_Current_Priority (Priority : Integer) is
begin
-- Writing a 0 to BASEPRI disables interrupt masking, while values
-- 15 .. 1 correspond to interrupt priorities 255 .. 241 in that
-- order.
Asm ("msr BASEPRI, %0",
Inputs => PRI'Asm_Input ("r", To_PRI (Priority)),
Volatile => True);
end Set_Current_Priority;
end Interrupts;
end System.BB.Board_Support;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.Defining_Expanded_Names is
function Create
(Prefix : not null Program.Elements.Expressions.Expression_Access;
Dot_Token : not null Program.Lexical_Elements.Lexical_Element_Access;
Selector : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access)
return Defining_Expanded_Name is
begin
return Result : Defining_Expanded_Name :=
(Prefix => Prefix, Dot_Token => Dot_Token, Selector => Selector,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Prefix : not null Program.Elements.Expressions
.Expression_Access;
Selector : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Defining_Expanded_Name is
begin
return Result : Implicit_Defining_Expanded_Name :=
(Prefix => Prefix, Selector => Selector,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Prefix
(Self : Base_Defining_Expanded_Name)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Prefix;
end Prefix;
overriding function Selector
(Self : Base_Defining_Expanded_Name)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access is
begin
return Self.Selector;
end Selector;
overriding function Dot_Token
(Self : Defining_Expanded_Name)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Dot_Token;
end Dot_Token;
overriding function Image (Self : Defining_Expanded_Name) return Text is
begin
return Self.Dot_Token.Image;
end Image;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Defining_Expanded_Name)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Defining_Expanded_Name)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Defining_Expanded_Name)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
overriding function Image
(Self : Implicit_Defining_Expanded_Name)
return Text is
pragma Unreferenced (Self);
begin
return "";
end Image;
procedure Initialize
(Self : aliased in out Base_Defining_Expanded_Name'Class) is
begin
Set_Enclosing_Element (Self.Prefix, Self'Unchecked_Access);
Set_Enclosing_Element (Self.Selector, Self'Unchecked_Access);
null;
end Initialize;
overriding function Is_Defining_Expanded_Name_Element
(Self : Base_Defining_Expanded_Name)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Defining_Expanded_Name_Element;
overriding function Is_Defining_Name_Element
(Self : Base_Defining_Expanded_Name)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Defining_Name_Element;
overriding procedure Visit
(Self : not null access Base_Defining_Expanded_Name;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Defining_Expanded_Name (Self);
end Visit;
overriding function To_Defining_Expanded_Name_Text
(Self : aliased in out Defining_Expanded_Name)
return Program.Elements.Defining_Expanded_Names
.Defining_Expanded_Name_Text_Access is
begin
return Self'Unchecked_Access;
end To_Defining_Expanded_Name_Text;
overriding function To_Defining_Expanded_Name_Text
(Self : aliased in out Implicit_Defining_Expanded_Name)
return Program.Elements.Defining_Expanded_Names
.Defining_Expanded_Name_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Defining_Expanded_Name_Text;
end Program.Nodes.Defining_Expanded_Names;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- XML Processor --
-- --
-- Examples Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with League.Strings;
with XML.SAX.Attributes;
with XML.SAX.Content_Handlers;
with XML.SAX.Declaration_Handlers;
with XML.SAX.DTD_Handlers;
with XML.SAX.Entity_Resolvers;
with XML.SAX.Error_Handlers;
with XML.SAX.Input_Sources;
with XML.SAX.Lexical_Handlers;
with XML.SAX.Locators;
with XML.SAX.Parse_Exceptions;
package Events_Printers is
type Events_Printer is limited
new XML.SAX.Content_Handlers.SAX_Content_Handler
and XML.SAX.Declaration_Handlers.SAX_Declaration_Handler
and XML.SAX.DTD_Handlers.SAX_DTD_Handler
and XML.SAX.Entity_Resolvers.SAX_Entity_Resolver
and XML.SAX.Error_Handlers.SAX_Error_Handler
and XML.SAX.Lexical_Handlers.SAX_Lexical_Handler with
record
Locator : XML.SAX.Locators.SAX_Locator;
end record;
-- GNAT GPL 2010: compiler is unable to compile declaration of this type
-- when it is declared as private.
overriding procedure Characters
(Self : in out Events_Printer;
Text : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure Comment
(Self : in out Events_Printer;
Text : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure End_Element
(Self : in out Events_Printer;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Qualified_Name : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure End_Prefix_Mapping
(Self : in out Events_Printer;
Prefix : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure Error
(Self : in out Events_Printer;
Occurrence : XML.SAX.Parse_Exceptions.SAX_Parse_Exception;
Success : in out Boolean);
overriding function Error_String
(Self : Events_Printer)
return League.Strings.Universal_String;
overriding procedure External_Entity_Declaration
(Self : in out Events_Printer;
Name : League.Strings.Universal_String;
Public_Id : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure Fatal_Error
(Self : in out Events_Printer;
Occurrence : XML.SAX.Parse_Exceptions.SAX_Parse_Exception);
overriding procedure Ignorable_Whitespace
(Self : in out Events_Printer;
Text : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure Internal_Entity_Declaration
(Self : in out Events_Printer;
Name : League.Strings.Universal_String;
Value : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure Processing_Instruction
(Self : in out Events_Printer;
Target : League.Strings.Universal_String;
Data : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure Resolve_Entity
(Self : in out Events_Printer;
Name : League.Strings.Universal_String;
Public_Id : League.Strings.Universal_String;
Base_URI : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Source : out XML.SAX.Input_Sources.SAX_Input_Source_Access;
Success : in out Boolean);
overriding procedure Set_Document_Locator
(Self : in out Events_Printer;
Locator : XML.SAX.Locators.SAX_Locator);
overriding procedure Start_Element
(Self : in out Events_Printer;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Qualified_Name : League.Strings.Universal_String;
Attributes : XML.SAX.Attributes.SAX_Attributes;
Success : in out Boolean);
overriding procedure Start_Prefix_Mapping
(Self : in out Events_Printer;
Prefix : League.Strings.Universal_String;
Namespace_URI : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure Unparsed_Entity_Declaration
(Self : in out Events_Printer;
Name : League.Strings.Universal_String;
Public_Id : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Notation_Name : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure Warning
(Self : in out Events_Printer;
Occurrence : XML.SAX.Parse_Exceptions.SAX_Parse_Exception;
Success : in out Boolean);
end Events_Printers;
|
package ACO.Protocols.Network_Management.Slaves is
type Slave
(Id : ACO.Messages.Node_Nr;
Od : not null access ACO.OD.Object_Dictionary'Class)
is new NMT with private;
private
type Slave
(Id : ACO.Messages.Node_Nr;
Od : not null access ACO.OD.Object_Dictionary'Class)
is new NMT (Id, Od) with null record;
end ACO.Protocols.Network_Management.Slaves;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with HAL; use HAL;
with HAL.Time;
package MicroBit.Time is
subtype Time_Ms is UInt64;
function Clock return Time_Ms;
procedure Delay_Ms (Milliseconds : UInt64);
procedure Sleep (Milliseconds : UInt64) renames Delay_Ms;
function Tick_Period return Time_Ms;
type Tick_Callback is access procedure;
function Tick_Subscriber (Callback : not null Tick_Callback) return Boolean;
-- Return True if callback is already a tick event subscriber
function Tick_Subscribe (Callback : not null Tick_Callback) return Boolean
with Pre => not Tick_Subscriber (Callback),
Post => (if Tick_Subscribe'Result then Tick_Subscriber (Callback));
-- Subscribe a callback to the tick event. The function return True on
-- success, False if there's no more room for subscribers.
function Tick_Unsubscribe (Callback : not null Tick_Callback) return Boolean
with Pre => Tick_Subscriber (Callback),
Post => (if Tick_Unsubscribe'Result then not Tick_Subscriber (Callback));
-- Unsubscribe a callback to the tick event. The function return True on
-- success, False if the callback was not a subscriber.
function HAL_Delay return not null HAL.Time.Any_Delays;
private
type MB_Delays is new HAL.Time.Delays with null record;
overriding
procedure Delay_Microseconds (This : in out MB_Delays;
Us : Integer);
overriding
procedure Delay_Milliseconds (This : in out MB_Delays;
Ms : Integer);
overriding
procedure Delay_Seconds (This : in out MB_Delays;
S : Integer);
end MicroBit.Time;
|
-- Copyright 2012-2017 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
function Ident (I : Integer) return Integer is
begin
return I;
end Ident;
procedure Do_Nothing (A : System.Address) is
begin
null;
end Do_Nothing;
end Pck;
|
-------------------------------------------------------------------------------
-- 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.
-------------------------------------------------------------------------------
package LSC.AES_Generic.CBC
is
pragma Pure;
generic
type Plaintext_Index_Type is (<>);
type Plaintext_Elem_Type is (<>);
type Plaintext_Type is array (Plaintext_Index_Type range <>) of Plaintext_Elem_Type;
type Ciphertext_Index_Type is (<>);
type Ciphertext_Elem_Type is (<>);
type Ciphertext_Type is array (Ciphertext_Index_Type range <>) of Ciphertext_Elem_Type;
procedure Decrypt (Ciphertext : Ciphertext_Type;
IV : Ciphertext_Type;
Key : AES_Generic.Dec_Key_Type;
Plaintext : out Plaintext_Type)
with
Pre => Ciphertext'Length > 0 and
Ciphertext'Length mod 16 = 0 and
Plaintext'Length >= Ciphertext'Length and
IV'Length = 16;
-- Decrypt @Ciphertext to @Plaintext using @IV and @Key in CBC mode
generic
type Plaintext_Index_Type is (<>);
type Plaintext_Elem_Type is (<>);
type Plaintext_Type is array (Plaintext_Index_Type range <>) of Plaintext_Elem_Type;
type Ciphertext_Index_Type is (<>);
type Ciphertext_Elem_Type is (<>);
type Ciphertext_Type is array (Ciphertext_Index_Type range <>) of Ciphertext_Elem_Type;
procedure Encrypt (Plaintext : Plaintext_Type;
IV : Ciphertext_Type;
Key : AES_Generic.Enc_Key_Type;
Ciphertext : out Ciphertext_Type)
with
Pre => Plaintext'Length > 0 and
Plaintext'Length mod 16 = 0 and
Ciphertext'Length >= Plaintext'Length and
IV'Length = 16;
-- Encrypt @Plaintext to @Ciphertext using @IV and @Key in CBC mode
end LSC.AES_Generic.CBC;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2017, 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 Matreshka.Internals.Strings;
package AMF.Internals.Tables.MOF_String_Data_00 is
-- "value"
MS_0000 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 5,
Length => 5,
Value =>
(16#0076#, 16#0061#, 16#006C#, 16#0075#,
16#0065#,
others => 16#0000#),
others => <>);
-- "element"
MS_0001 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 7,
Length => 7,
Value =>
(16#0065#, 16#006C#, 16#0065#, 16#006D#,
16#0065#, 16#006E#, 16#0074#,
others => 16#0000#),
others => <>);
-- "A_element_tag"
MS_0002 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 13,
Length => 13,
Value =>
(16#0041#, 16#005F#, 16#0065#, 16#006C#,
16#0065#, 16#006D#, 16#0065#, 16#006E#,
16#0074#, 16#005F#, 16#0074#, 16#0061#,
16#0067#,
others => 16#0000#),
others => <>);
-- "http://www.omg.org/spec/MOF/20110701"
MS_0003 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 39,
Unused => 36,
Length => 36,
Value =>
(16#0068#, 16#0074#, 16#0074#, 16#0070#,
16#003A#, 16#002F#, 16#002F#, 16#0077#,
16#0077#, 16#0077#, 16#002E#, 16#006F#,
16#006D#, 16#0067#, 16#002E#, 16#006F#,
16#0072#, 16#0067#, 16#002F#, 16#0073#,
16#0070#, 16#0065#, 16#0063#, 16#002F#,
16#004D#, 16#004F#, 16#0046#, 16#002F#,
16#0032#, 16#0030#, 16#0031#, 16#0031#,
16#0030#, 16#0037#, 16#0030#, 16#0031#,
others => 16#0000#),
others => <>);
-- "mofext"
MS_0004 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 6,
Length => 6,
Value =>
(16#006D#, 16#006F#, 16#0066#, 16#0065#,
16#0078#, 16#0074#,
others => 16#0000#),
others => <>);
-- "Tag"
MS_0005 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0054#, 16#0061#, 16#0067#,
others => 16#0000#),
others => <>);
-- "MOF"
MS_0006 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#004D#, 16#004F#, 16#0046#,
others => 16#0000#),
others => <>);
-- "tagOwner"
MS_0007 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#0074#, 16#0061#, 16#0067#, 16#004F#,
16#0077#, 16#006E#, 16#0065#, 16#0072#,
others => 16#0000#),
others => <>);
-- "name"
MS_0008 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 4,
Length => 4,
Value =>
(16#006E#, 16#0061#, 16#006D#, 16#0065#,
others => 16#0000#),
others => <>);
-- "tag"
MS_0009 : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 7,
Unused => 3,
Length => 3,
Value =>
(16#0074#, 16#0061#, 16#0067#,
others => 16#0000#),
others => <>);
-- "A_ownedTag_tagOwner"
MS_000A : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 19,
Length => 19,
Value =>
(16#0041#, 16#005F#, 16#006F#, 16#0077#,
16#006E#, 16#0065#, 16#0064#, 16#0054#,
16#0061#, 16#0067#, 16#005F#, 16#0074#,
16#0061#, 16#0067#, 16#004F#, 16#0077#,
16#006E#, 16#0065#, 16#0072#,
others => 16#0000#),
others => <>);
-- "ownedTag"
MS_000B : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 15,
Unused => 8,
Length => 8,
Value =>
(16#006F#, 16#0077#, 16#006E#, 16#0065#,
16#0064#, 16#0054#, 16#0061#, 16#0067#,
others => 16#0000#),
others => <>);
-- "org.omg.xmi.nsPrefix"
MS_000C : aliased Matreshka.Internals.Strings.Shared_String
:= (Capacity => 23,
Unused => 20,
Length => 20,
Value =>
(16#006F#, 16#0072#, 16#0067#, 16#002E#,
16#006F#, 16#006D#, 16#0067#, 16#002E#,
16#0078#, 16#006D#, 16#0069#, 16#002E#,
16#006E#, 16#0073#, 16#0050#, 16#0072#,
16#0065#, 16#0066#, 16#0069#, 16#0078#,
others => 16#0000#),
others => <>);
end AMF.Internals.Tables.MOF_String_Data_00;
|
-- ////////////////////////////////////////////////////////////
-- //
-- // SFML - Simple and Fast Multimedia Library
-- // Copyright (C) 2007-2009 Laurent Gomila (laurent.gom@gmail.com)
-- //
-- // This software is provided 'as-is', without any express or implied warranty.
-- // In no event will the authors be held liable for any damages arising from the use of this software.
-- //
-- // Permission is granted to anyone to use this software for any purpose,
-- // including commercial applications, and to alter it and redistribute it freely,
-- // subject to the following restrictions:
-- //
-- // 1. The origin of this software must not be misrepresented;
-- // you must not claim that you wrote the original software.
-- // If you use this software in a product, an acknowledgment
-- // in the product documentation would be appreciated but is not required.
-- //
-- // 2. Altered source versions must be plainly marked as such,
-- // and must not be misrepresented as being the original software.
-- //
-- // 3. This notice may not be removed or altered from any source distribution.
-- //
-- ////////////////////////////////////////////////////////////
-- ////////////////////////////////////////////////////////////
-- // Headers
-- ////////////////////////////////////////////////////////////
with Sf.Config;
package Sf.Network.IPAddress is
use Sf.Config;
-- ////////////////////////////////////////////////////////////
-- /// sfIPAddress provides easy manipulation of IP v4 addresses
-- ////////////////////////////////////////////////////////////
type sfAddress_Array is array (0 .. 15) of aliased sfInt8;
type sfIPAddress is record
Address : sfAddress_Array;
end record;
-- ////////////////////////////////////////////////////////////
-- /// Construct an address from a string
-- ///
-- /// \param String : IP address ("xxx.xxx.xxx.xxx") or network name
-- ///
-- /// \return Resulting address
-- ///
-- ////////////////////////////////////////////////////////////
function sfIPAddress_FromString (Str : String) return sfIPAddress;
-- ////////////////////////////////////////////////////////////
-- /// Construct an address from 4 bytes
-- ///
-- /// \param Byte0 : First byte of the address
-- /// \param Byte1 : Second byte of the address
-- /// \param Byte2 : Third byte of the address
-- /// \param Byte3 : Fourth byte of the address
-- ///
-- /// \return Resulting address
-- ///
-- ////////////////////////////////////////////////////////////
function sfIPAddress_FromBytes
(Byte0 : sfUint8;
Byte1 : sfUint8;
Byte2 : sfUint8;
Byte3 : sfUint8)
return sfIPAddress;
-- ////////////////////////////////////////////////////////////
-- /// Construct the address from a 32-bits integer
-- ///
-- /// \param Address : 4 bytes of the address packed into a 32-bits integer
-- ///
-- ////////////////////////////////////////////////////////////
function sfIPAddress_FromInteger (Address : sfUint32) return sfIPAddress;
-- ////////////////////////////////////////////////////////////
-- /// Tell if an address is a valid one
-- ///
-- /// \param Address : Address to check
-- ///
-- /// \return sfTrue if address has a valid syntax
-- ///
-- ////////////////////////////////////////////////////////////
function sfIPAddress_IsValid (Address : sfIPAddress) return sfBool;
-- ////////////////////////////////////////////////////////////
-- /// Get a string representation of an address
-- ///
-- /// \param Address : Address to convert
-- /// \param String : Char array to fill (size must be >= 16)
-- ///
-- ////////////////////////////////////////////////////////////
procedure sfIPAddress_ToString (Address : sfIPAddress; Str : out String);
-- ////////////////////////////////////////////////////////////
-- /// Get an integer representation of the address
-- ///
-- /// \param Address : Address to convert
-- ///
-- /// \return 32-bits integer containing the 4 bytes of the address, in system endianness
-- ///
-- ////////////////////////////////////////////////////////////
function sfIPAddress_ToInteger (Address : sfIPAddress) return sfUint32;
-- ////////////////////////////////////////////////////////////
-- /// Get the computer's local IP address (from the LAN point of view)
-- ///
-- /// \return Local IP address
-- ///
-- ////////////////////////////////////////////////////////////
function sfIPAddress_GetLocalAddress return sfIPAddress;
-- ////////////////////////////////////////////////////////////
-- /// Get the computer's public IP address (from the web point of view).
-- /// The only way to get a public address is to ask it to a
-- /// distant website ; as a consequence, this function may be
-- /// very slow -- use it as few as possible !
-- ///
-- /// \param Timeout : Maximum time to wait, in seconds (use 0 for no timeout)
-- ///
-- /// \return Public IP address
-- ///
-- ////////////////////////////////////////////////////////////
function sfIPAddress_GetPublicAddress (Timeout : Float) return sfIPAddress;
-- ////////////////////////////////////////////////////////////
-- /// Get the computer's loopback address
-- ///
-- /// \return Local host IP address (127.0.0.1, or "localhost")
-- ///
-- ////////////////////////////////////////////////////////////
function sfIPAddress_LocalHost return sfIPAddress;
private
pragma Convention (C, sfAddress_Array);
pragma Convention (C_Pass_By_Copy, sfIPAddress);
pragma Import (C, sfIPAddress_FromBytes, "sfIPAddress_FromBytes");
pragma Import (C, sfIPAddress_FromInteger, "sfIPAddress_FromInteger");
pragma Import (C, sfIPAddress_IsValid, "sfIPAddress_IsValid");
pragma Import (C, sfIPAddress_ToInteger, "sfIPAddress_ToInteger");
pragma Import (C, sfIPAddress_GetLocalAddress, "sfIPAddress_GetLocalAddress");
pragma Import (C, sfIPAddress_GetPublicAddress, "sfIPAddress_GetPublicAddress");
pragma Import (C, sfIPAddress_LocalHost, "sfIPAddress_LocalHost");
end Sf.Network.IPAddress;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . W W D _ E N U M --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.WCh_StW; use System.WCh_StW;
with System.WCh_Con; use System.WCh_Con;
with Ada.Unchecked_Conversion;
package body System.WWd_Enum is
-----------------------------------
-- Wide_Wide_Width_Enumeration_8 --
-----------------------------------
function Wide_Wide_Width_Enumeration_8
(Names : String;
Indexes : System.Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method) return Natural
is
W : Natural;
type Natural_8 is range 0 .. 2 ** 7 - 1;
type Index_Table is array (Natural) of Natural_8;
type Index_Table_Ptr is access Index_Table;
function To_Index_Table_Ptr is
new Ada.Unchecked_Conversion (System.Address, Index_Table_Ptr);
IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
begin
W := 0;
for J in Lo .. Hi loop
declare
S : constant String :=
Names (Natural (IndexesT (J)) ..
Natural (IndexesT (J + 1)) - 1);
WS : Wide_Wide_String (1 .. S'Length);
L : Natural;
begin
String_To_Wide_Wide_String (S, WS, L, EM);
W := Natural'Max (W, L);
end;
end loop;
return W;
end Wide_Wide_Width_Enumeration_8;
------------------------------------
-- Wide_Wide_Width_Enumeration_16 --
------------------------------------
function Wide_Wide_Width_Enumeration_16
(Names : String;
Indexes : System.Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method) return Natural
is
W : Natural;
type Natural_16 is range 0 .. 2 ** 15 - 1;
type Index_Table is array (Natural) of Natural_16;
type Index_Table_Ptr is access Index_Table;
function To_Index_Table_Ptr is
new Ada.Unchecked_Conversion (System.Address, Index_Table_Ptr);
IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
begin
W := 0;
for J in Lo .. Hi loop
declare
S : constant String :=
Names (Natural (IndexesT (J)) ..
Natural (IndexesT (J + 1)) - 1);
WS : Wide_Wide_String (1 .. S'Length);
L : Natural;
begin
String_To_Wide_Wide_String (S, WS, L, EM);
W := Natural'Max (W, L);
end;
end loop;
return W;
end Wide_Wide_Width_Enumeration_16;
------------------------------------
-- Wide_Wide_Width_Enumeration_32 --
------------------------------------
function Wide_Wide_Width_Enumeration_32
(Names : String;
Indexes : System.Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method) return Natural
is
W : Natural;
type Natural_32 is range 0 .. 2 ** 31 - 1;
type Index_Table is array (Natural) of Natural_32;
type Index_Table_Ptr is access Index_Table;
function To_Index_Table_Ptr is
new Ada.Unchecked_Conversion (System.Address, Index_Table_Ptr);
IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
begin
W := 0;
for J in Lo .. Hi loop
declare
S : constant String :=
Names (Natural (IndexesT (J)) ..
Natural (IndexesT (J + 1)) - 1);
WS : Wide_Wide_String (1 .. S'Length);
L : Natural;
begin
String_To_Wide_Wide_String (S, WS, L, EM);
W := Natural'Max (W, L);
end;
end loop;
return W;
end Wide_Wide_Width_Enumeration_32;
------------------------------
-- Wide_Width_Enumeration_8 --
------------------------------
function Wide_Width_Enumeration_8
(Names : String;
Indexes : System.Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method) return Natural
is
W : Natural;
type Natural_8 is range 0 .. 2 ** 7 - 1;
type Index_Table is array (Natural) of Natural_8;
type Index_Table_Ptr is access Index_Table;
function To_Index_Table_Ptr is
new Ada.Unchecked_Conversion (System.Address, Index_Table_Ptr);
IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
begin
W := 0;
for J in Lo .. Hi loop
declare
S : constant String :=
Names (Natural (IndexesT (J)) ..
Natural (IndexesT (J + 1)) - 1);
WS : Wide_String (1 .. S'Length);
L : Natural;
begin
String_To_Wide_String (S, WS, L, EM);
W := Natural'Max (W, L);
end;
end loop;
return W;
end Wide_Width_Enumeration_8;
-------------------------------
-- Wide_Width_Enumeration_16 --
-------------------------------
function Wide_Width_Enumeration_16
(Names : String;
Indexes : System.Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method) return Natural
is
W : Natural;
type Natural_16 is range 0 .. 2 ** 15 - 1;
type Index_Table is array (Natural) of Natural_16;
type Index_Table_Ptr is access Index_Table;
function To_Index_Table_Ptr is
new Ada.Unchecked_Conversion (System.Address, Index_Table_Ptr);
IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
begin
W := 0;
for J in Lo .. Hi loop
declare
S : constant String :=
Names (Natural (IndexesT (J)) ..
Natural (IndexesT (J + 1)) - 1);
WS : Wide_String (1 .. S'Length);
L : Natural;
begin
String_To_Wide_String (S, WS, L, EM);
W := Natural'Max (W, L);
end;
end loop;
return W;
end Wide_Width_Enumeration_16;
-------------------------------
-- Wide_Width_Enumeration_32 --
-------------------------------
function Wide_Width_Enumeration_32
(Names : String;
Indexes : System.Address;
Lo, Hi : Natural;
EM : WC_Encoding_Method) return Natural
is
W : Natural;
type Natural_32 is range 0 .. 2 ** 31 - 1;
type Index_Table is array (Natural) of Natural_32;
type Index_Table_Ptr is access Index_Table;
function To_Index_Table_Ptr is
new Ada.Unchecked_Conversion (System.Address, Index_Table_Ptr);
IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
begin
W := 0;
for J in Lo .. Hi loop
declare
S : constant String :=
Names (Natural (IndexesT (J)) ..
Natural (IndexesT (J + 1)) - 1);
WS : Wide_String (1 .. S'Length);
L : Natural;
begin
String_To_Wide_String (S, WS, L, EM);
W := Natural'Max (W, L);
end;
end loop;
return W;
end Wide_Width_Enumeration_32;
end System.WWd_Enum;
|
------------------------------------------------------------------------------
-- --
-- Ada binding for OpenGL/WebGL --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2018-2020, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with OpenGL;
with Interfaces.C.Strings;
with System;
package GLEW is
pragma Preelaborate;
type GLuint is new Interfaces.Unsigned_32;
type GLuint_Array is array (Positive range <>) of GLuint
with Convention => C;
type GLint_Array is array (Positive range <>) of OpenGL.GLint
with Convention => C;
type glewGenBuffers is access procedure
(n : OpenGL.GLsizei;
buffers : access GLuint) with Convention => C;
glGenBuffers : glewGenBuffers
with Import, Convention => C, External_Name => "__glewGenBuffers";
type glewBufferData is access procedure
(target : OpenGL.GLenum;
size : Interfaces.C.ptrdiff_t;
data : System.Address;
buffer : GLuint) with Convention => C;
glBufferData : glewBufferData
with Import, Convention => C, External_Name => "__glewBufferData";
type glewBindBuffer is access procedure
(target : OpenGL.GLenum;
buffer : GLuint) with Convention => C;
glBindBuffer : glewBindBuffer
with Import, Convention => C, External_Name => "__glewBindBuffer";
type glewCreateShader is access function
(shaderType : OpenGL.GLenum) return GLuint with Convention => C;
glCreateShader : glewCreateShader
with Import, Convention => C, External_Name => "__glewCreateShader";
type glewShaderSource is access procedure
(shader : GLuint;
count : OpenGL.GLsizei;
string : Interfaces.C.Strings.chars_ptr_array;
length : GLint_Array) with Convention => C;
glShaderSource : glewShaderSource
with Import, Convention => C, External_Name => "__glewShaderSource";
type glewCompileShader is access procedure (shader : GLuint)
with Convention => C;
glCompileShader : glewCompileShader
with Import, Convention => C, External_Name => "__glewCompileShader";
type glewGetShaderiv is access procedure
(shader : GLuint;
pname : OpenGL.GLenum;
params : access OpenGL.GLint) with Convention => C;
glGetShaderiv : glewGetShaderiv
with Import, Convention => C, External_Name => "__glewGetShaderiv";
type glewDeleteShader is access procedure (shader : GLuint)
with Convention => C;
glDeleteShader : glewDeleteShader
with Import, Convention => C, External_Name => "__glewDeleteShader";
type glewGetShaderInfoLog is access procedure
(shader : GLuint;
maxLength : OpenGL.GLsizei;
length : access OpenGL.GLsizei;
infoLog : out Interfaces.C.char_array)
with Convention => C;
glGetShaderInfoLog : glewGetShaderInfoLog
with Import, Convention => C, External_Name => "__glewGetShaderInfoLog";
type glewAttachShader is access procedure
(program : GLuint;
shader : GLuint)
with Convention => C;
glAttachShader : glewAttachShader
with Import, Convention => C, External_Name => "__glewAttachShader";
type glewGetAttribLocation is access function
(program : GLuint;
name : Interfaces.C.char_array) return OpenGL.GLint
with Convention => C;
glGetAttribLocation : glewGetAttribLocation
with Import, Convention => C, External_Name => "__glewGetAttribLocation";
type glewUseProgram is access procedure (program : GLuint)
with Convention => C;
glUseProgram : glewUseProgram
with Import, Convention => C, External_Name => "__glewUseProgram";
type glewCreateProgram is access function return GLuint
with Convention => C;
glCreateProgram : glewCreateProgram
with Import, Convention => C, External_Name => "__glewCreateProgram";
type glewDisableVertexAttribArray is access procedure (index : GLuint)
with Convention => C;
glDisableVertexAttribArray : glewDisableVertexAttribArray
with Import, Convention => C,
External_Name => "__glewDisableVertexAttribArray";
type glewEnableVertexAttribArray is access procedure (index : GLuint)
with Convention => C;
glEnableVertexAttribArray : glewEnableVertexAttribArray
with Import, Convention => C,
External_Name => "__glewEnableVertexAttribArray";
type glewGetProgramiv is access procedure
(program : GLuint;
pname : OpenGL.GLenum;
params : access OpenGL.GLint) with Convention => C;
glGetProgramiv : glewGetProgramiv
with Import, Convention => C, External_Name => "__glewGetProgramiv";
type glewLinkProgram is access procedure (index : GLuint)
with Convention => C;
glLinkProgram : glewLinkProgram
with Import, Convention => C, External_Name => "__glewLinkProgram";
type glewVertexAttribPointer is access procedure
(index : GLuint;
size : OpenGL.GLint;
kind : OpenGL.GLenum;
normalized : OpenGL.GLint;
stride : OpenGL.GLsizei;
pointer : System.Address)
with Convention => C;
glVertexAttribPointer : glewVertexAttribPointer
with Import, Convention => C, External_Name => "__glewVertexAttribPointer";
type glewVertexAttrib1f is access procedure
(index : GLuint;
v0 : OpenGL.GLfloat)
with Convention => C;
glVertexAttrib1f : glewVertexAttrib1f
with Import, Convention => C, External_Name => "__glewVertexAttrib1f";
type glewVertexAttrib2f is access procedure
(index : GLuint;
v0 : OpenGL.GLfloat;
v1 : OpenGL.GLfloat)
with Convention => C;
glVertexAttrib2f : glewVertexAttrib2f
with Import, Convention => C, External_Name => "__glewVertexAttrib2f";
type glewVertexAttrib3f is access procedure
(index : GLuint;
v0 : OpenGL.GLfloat;
v1 : OpenGL.GLfloat;
v2 : OpenGL.GLfloat)
with Convention => C;
glVertexAttrib3f : glewVertexAttrib3f
with Import, Convention => C, External_Name => "__glewVertexAttrib3f";
type glewVertexAttrib4f is access procedure
(index : GLuint;
v0 : OpenGL.GLfloat;
v1 : OpenGL.GLfloat;
v2 : OpenGL.GLfloat;
v4 : OpenGL.GLfloat)
with Convention => C;
glVertexAttrib4f : glewVertexAttrib4f
with Import, Convention => C, External_Name => "__glewVertexAttrib4f";
type glewVertexAttrib2fv is access procedure
(index : GLuint;
v : OpenGL.GLfloat_Matrix_2x2)
with Convention => C;
glVertexAttrib2fv : glewVertexAttrib2fv
with Import, Convention => C, External_Name => "__glewVertexAttrib2fv";
type glewVertexAttrib3fv is access procedure
(index : GLuint;
v : OpenGL.GLfloat_Matrix_3x3)
with Convention => C;
glVertexAttrib3fv : glewVertexAttrib3fv
with Import, Convention => C, External_Name => "__glewVertexAttrib3fv";
type glewVertexAttrib4fv is access procedure
(index : GLuint;
v : OpenGL.GLfloat_Matrix_4x4)
with Convention => C;
glVertexAttrib4fv : glewVertexAttrib4fv
with Import, Convention => C, External_Name => "__glewVertexAttrib4fv";
type glewUniform1i is access procedure
(index : OpenGL.GLint;
v0 : OpenGL.GLint)
with Convention => C;
glUniform1i : glewUniform1i
with Import, Convention => C, External_Name => "__glewUniform1i";
type glewUniform1f is access procedure
(index : OpenGL.GLint;
v0 : OpenGL.GLfloat)
with Convention => C;
glUniform1f : glewUniform1f
with Import, Convention => C, External_Name => "__glewUniform1f";
type glewUniform2f is access procedure
(index : OpenGL.GLint;
v0 : OpenGL.GLfloat;
v1 : OpenGL.GLfloat)
with Convention => C;
glUniform2f : glewUniform2f
with Import, Convention => C, External_Name => "__glewUniform2f";
type glewUniform3f is access procedure
(index : OpenGL.GLint;
v0 : OpenGL.GLfloat;
v1 : OpenGL.GLfloat;
v2 : OpenGL.GLfloat)
with Convention => C;
glUniform3f : glewUniform3f
with Import, Convention => C, External_Name => "__glewUniform3f";
type glewUniform4f is access procedure
(index : OpenGL.GLint;
v0 : OpenGL.GLfloat;
v1 : OpenGL.GLfloat;
v2 : OpenGL.GLfloat;
v4 : OpenGL.GLfloat)
with Convention => C;
glUniform4f : glewUniform4f
with Import, Convention => C, External_Name => "__glewUniform4f";
type glewUniformMatrix2fv is access procedure
(index : OpenGL.GLint;
count : OpenGL.GLsizei;
transpose : OpenGL.GLint;
v : OpenGL.GLfloat_Matrix_2x2)
with Convention => C;
glUniformMatrix2fv : glewUniformMatrix2fv
with Import, Convention => C, External_Name => "__glewUniformMatrix2fv";
type glewUniformMatrix3fv is access procedure
(index : OpenGL.GLint;
count : OpenGL.GLsizei;
transpose : OpenGL.GLint;
v : OpenGL.GLfloat_Matrix_3x3)
with Convention => C;
glUniformMatrix3fv : glewUniformMatrix3fv
with Import, Convention => C, External_Name => "__glewUniformMatrix3fv";
type glewUniformMatrix4fv is access procedure
(index : OpenGL.GLint;
count : OpenGL.GLsizei;
transpose : OpenGL.GLint;
v : OpenGL.GLfloat_Matrix_4x4)
with Convention => C;
glUniformMatrix4fv : glewUniformMatrix4fv
with Import, Convention => C, External_Name => "__glewUniformMatrix4fv";
type glewGetUniformLocation is access function
(program : GLuint;
name : Interfaces.C.char_array) return OpenGL.GLint
with Convention => C;
glGetUniformLocation : glewGetUniformLocation
with Import, Convention => C, External_Name => "__glewGetUniformLocation";
type glewActiveTexture is access procedure (texture : OpenGL.GLenum)
with Convention => C;
glActiveTexture : glewActiveTexture
with Import, Convention => C, External_Name => "__glewActiveTexture";
procedure glClear
(mask : OpenGL.Clear_Buffer_Mask)
with Import, Convention => C, External_Name => "glClear";
procedure glDrawArrays
(mode : OpenGL.GLenum;
first : OpenGL.GLint;
count : OpenGL.GLsizei)
with Import, Convention => C, External_Name => "glDrawArrays";
procedure glDrawElements
(mode : OpenGL.GLenum;
count : OpenGL.GLsizei;
tipe : OpenGL.GLenum;
offset : System.Address)
with Import, Convention => C, External_Name => "glDrawElements";
procedure glEnable(cap : OpenGL.GLenum)
with Import, Convention => C, External_Name => "glEnable";
procedure glDisable(cap : OpenGL.GLenum)
with Import, Convention => C, External_Name => "glDisable";
procedure glBlendFunc
(sfactor : OpenGL.GLenum;
dfactor : OpenGL.GLenum)
with Import, Convention => C, External_Name => "glBlendFunc";
procedure glClearColor
(red, green, blue, alpha : OpenGL.GLclampf)
with Import, Convention => C, External_Name => "glClearColor";
procedure glClearDepth (depth : OpenGL.GLdouble)
with Import, Convention => C, External_Name => "glClearDepth";
procedure glDepthFunc (func : OpenGL.GLenum)
with Import, Convention => C, External_Name => "glDepthFunc";
procedure glFinish
with Import, Convention => C, External_Name => "glFinish";
procedure glFlush
with Import, Convention => C, External_Name => "glFlush";
procedure glViewport
(x, y : OpenGL.GLint;
width, height : OpenGL.GLsizei)
with Import, Convention => C, External_Name => "glViewport";
procedure glBindTexture
(target : OpenGL.GLenum;
texture : GLuint)
with Import, Convention => C, External_Name => "glBindTexture";
procedure glGenTextures
(n : OpenGL.GLsizei;
textures : access GLuint)
with Import, Convention => C, External_Name => "glGenTextures";
procedure glDeleteTextures
(n : OpenGL.GLsizei;
textures : access GLuint)
with Import, Convention => C, External_Name => "glDeleteTextures";
procedure glTexImage2D
(target : OpenGL.GLenum;
level : OpenGL.GLint;
internalformat : OpenGL.GLenum;
width : OpenGL.GLsizei;
height : OpenGL.GLsizei;
border : OpenGL.GLint;
format : OpenGL.GLenum;
tipe : OpenGL.GLenum;
data : System.Address)
with Import, Convention => C, External_Name => "glTexImage2D";
procedure glTexParameteri
(target : OpenGL.GLenum;
pname : OpenGL.GLenum;
param : OpenGL.GLint)
with Import, Convention => C, External_Name => "glTexParameteri";
ARRAY_BUFFER : constant := 16#8892#;
ELEMENT_ARRAY_BUFFER : constant := 16#8893#;
STATIC_DRAW : constant := 16#88E4#;
FRAGMENT_SHADER : constant := 16#8B30#;
VERTEX_SHADER : constant := 16#8B31#;
COMPILE_STATUS : constant := 16#8B81#;
LINK_STATUS : constant := 16#8B82#;
end GLEW;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- A D A --
-- --
-- S p e c --
-- --
-- $Revision: 2 $ --
-- --
-- This specification is adapted from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
package Ada is
pragma Pure (Ada);
end Ada;
|
with System;
with Interfaces;
with TLSF.Config;
package TLSF.Block.Types with SPARK_Mode, Pure, Preelaborate is
use TLSF.Config;
use Interfaces;
type Size is new Natural range 0 .. 2 ** Max_Block_Size_Log2-1
with Size => Max_Block_Size_Log2;
type Size_Bits is mod 2**Size'Size;
type Address is new Size;
type Address_Bits is mod 2**Address'Size;
Address_Null : constant Address := 0;
subtype Valid_Address is Address
with Predicate => (Valid_Address /= Address_Null);
function To_Size_Bits (S : Size) return Size_Bits
with
Global => null,
Pure_Function,
Post => Size(To_Size_Bits'Result) = S;
function To_Address_Bits (A : Address) return Address_Bits
with
Global => null,
Pure_Function,
Post => Address(To_Address_Bits'Result) = A;
Align_Mask : constant := (2 ** Align_Size_Log2) - 1;
Quantum : constant := Align_Mask + 1;
function Is_Aligned (Val : Size) return Boolean
with
Global => null,
Pure_Function,
Contract_Cases =>
( (Size_Bits(Val) and Align_Mask) = 0 => Is_Aligned'Result = True,
others => Is_Aligned'Result = False);
function Is_Aligned (Val : Address) return Boolean
with
Global => null,
Pure_Function,
Contract_Cases =>
( (Address_Bits(Val) and Align_Mask) = 0 => Is_Aligned'Result = True,
others => Is_Aligned'Result = False);
subtype Aligned_Size is Size with
Predicate => Is_Aligned(Aligned_Size);
subtype Aligned_Address is Address with
Predicate => Is_Aligned(Aligned_Address);
function Round_Size_Up (S : Size) return Aligned_Size
with
Global => null,
Pure_Function,
Pre => S <= Size'Last - Align_Mask,
Post => Is_Aligned(Round_Size_Up'Result);
function Round_Address_Up (A : Address) return Aligned_Address
with
Global => null,
Pure_Function,
Pre => A <= Address'Last - Align_Mask,
Post => Is_Aligned(Round_Address_Up'Result);
function "+" (A: Aligned_Address; S: Aligned_Size) return Aligned_Address
with
Global => null,
Pure_Function,
Pre => Integer(A) + Integer(S) in 0 .. Integer(Address'Last),
Post =>
Is_Aligned("+"'Result)
and "+"'Result = Aligned_Address(Integer(A) + Integer(S));
function "+" (L, R : Aligned_Size) return Aligned_Size
with
Global => null,
Pure_Function,
Pre => Integer(L) + Integer(R) in 0 .. Integer(Address'Last),
Post =>
Is_Aligned ("+"'Result)
and "+"'Result = Aligned_Size (Integer (L) + Integer (R));
-- To is not inclusive, ie [From, To)
function "-" (To, From : Aligned_Address) return Aligned_Size
with
Global => null,
Pure_Function,
Pre => To >= From,
Post => Is_Aligned ("-"'Result)
and "-"'Result = Aligned_Size (Integer (To) - Integer (From));
-- address space for blocks
type Address_Space is record
First : Aligned_Address := Quantum;
Last : Aligned_Address := Address'Last - (Quantum - 1);
end record
with Predicate =>
First >= Quantum and then
Last <= Address'Last - (Quantum - 1) and then
Last > First;
type Status is (Free, Occupied)
with Size => 1;
-- Free: block is free
-- Occupied: block in use
-- Absent: block is absent (previous of the first
-- block or next of the last)
type Free_Blocks_List is
record
Prev_Address : Aligned_Address := Address_Null;
Next_Address : Aligned_Address := Address_Null;
end record
with Pack,
Predicate => ((Prev_Address = 0 and then Next_Address = 0) or else
(Prev_Address /=0 and then Next_Address /= 0));
type Block_Header (Status : Types.Status := Free) is
record
Prev_Block_Address : Aligned_Address := Address_Null;
Size : Aligned_Size := 0;
case Status is
when Free => Free_List : Free_Blocks_List;
when Occupied => null;
end case;
end record
with Pack;
subtype Block_Header_Occupied is Block_Header(Status => Occupied);
subtype Block_Header_Free is Block_Header(Status => Free);
pragma Assert ((Size_Bits'(Small_Block_Size) and Align_Mask) = 0);
Block_Header_Size : constant Size := Small_Block_Size;
-- Size(Block_Header'Max_Size_In_Storage_Elements);
Block_Header_Occupied_Size : constant Size := Small_Block_Size;
-- Size(Block_Header_Occupied'Max_Size_In_Storage_Elements);
Block_Header_Free_Size : constant Size := Small_Block_Size;
-- Size(Block_Header_Free'Max_Size_In_Storage_Elements);
Empty_Free_List : constant Free_Blocks_List :=
Free_Blocks_List'(Address_Null, Address_Null);
pragma Assert (Small_Block_Size >= Block_Header_Size);
-- should be >= Block_Header max size in storage elements
pragma Assert (Block_Header_Free_Size >= Block_Header_Occupied_Size);
-- Predicates
function Is_Free_List_Empty (Free_List : Free_Blocks_List)
return Boolean
is (Free_List = Empty_Free_List);
function Is_Block_Free (Block : Block_Header) return Boolean
is (Block.Status = Free);
function Is_Block_Occupied (Block : Block_Header) return Boolean
is (Block.Status = Occupied);
function Is_Block_Linked_To_Free_List (Block : Block_Header_Free) return Boolean
is (Block.Free_List.Prev_Address /= Address_Null and then
Block.Free_List.Next_Address /= Address_Null)
with Pre => Is_Block_Free (Block),
Post => (if not Is_Free_List_Empty (Block.Free_List)
then Is_Block_Linked_To_Free_List'Result = True
else Is_Block_Linked_To_Free_List'Result = False);
-- Contract_Cases => (not Is_Free_List_Empty(Block.Free_List)
-- => Is_Block_Linked_To_Free_List'Result = True,
-- others
-- => Is_Block_Linked_To_Free_List'Result = False);
function Is_Block_Last_In_Free_List (Block: Block_Header) return Boolean
is (Block.Free_List /= Empty_Free_List and then
Block.Free_List.Prev_Address = Block.Free_List.Next_Address)
with Pre => Is_Block_Free(Block),
Post => (if Block.Free_List /= Empty_Free_List and then
Block.Free_List.Prev_Address = Block.Free_List.Next_Address
then Is_Block_Last_In_Free_List'Result = True
else Is_Block_Last_In_Free_List'Result = False);
-- Contract_Cases =>
-- (Block.Free_List /= Empty_Free_List and then
-- Block.Free_List.Prev_Address = Block.Free_List.Next_Address
-- => Is_Block_Last_In_Free_List'Result = True,
-- others => Is_Block_Last_In_Free_List'Result = False);
--
function Changed_Only_Links_For_Free_List (Block_Old, Block_New : Block_Header)
return Boolean
is
(Is_Block_Free(Block_Old) and then
Is_Block_Free(Block_New) and then
Block_New.Prev_Block_Address = Block_Old.Prev_Block_Address and then
Block_New.Size = Block_Old.Size);
-- Calculation of levels
type First_Level_Index is new Natural range SL_Index_Count_Log2 .. FL_Index_Max;
type Second_Level_Index is new Natural range 0 .. SL_Index_Count - 1;
pragma Assert (Second_Level_Index'Last =
(2 ** Natural(First_Level_Index'First)) - 1);
type Level_Index is
record
First_Level : First_Level_Index;
Second_Level : Second_Level_Index;
end record;
function Calculate_Levels_Indices
(S : Size_Bits)
return Level_Index
with
Pure_Function,
Pre => S >= Size_Bits(Small_Block_Size);
function Is_Same_Size_Class(S1, S2: Size) return Boolean
with
Pre =>
S1 >= Small_Block_Size and then
S2 >= Small_Block_Size,
Contract_Cases =>
(Calculate_Levels_Indices(Size_Bits(S1)) =
Calculate_Levels_Indices(Size_Bits(S2)) =>
Is_Same_Size_Class'Result = True,
others =>
Is_Same_Size_Class'Result = False);
end TLSF.Block.Types;
|
pragma License (Unrestricted);
-- Ada 2012
with Ada.Characters.Conversions;
with Ada.Strings.Generic_Less_Case_Insensitive;
function Ada.Strings.Less_Case_Insensitive is
new Generic_Less_Case_Insensitive (
Character,
String,
Characters.Conversions.Get);
-- pragma Pure (Ada.Strings.Less_Case_Insensitive);
pragma Preelaborate (Ada.Strings.Less_Case_Insensitive); -- use maps
|
--
-- Copyright 2018 The wookey project team <wookey@ssi.gouv.fr>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
with soc.layout;
with soc.gpio;
with system;
package soc.syscfg
with spark_mode => on
is
--------------------------------------------------
-- SYSCFG memory remap register (SYSCFG_MEMRMP) --
--------------------------------------------------
type t_SYSCFG_MEMRMP is record
MEM_MODE : bits_3;
reserved_3_7 : bits_5;
FB_MODE : bit;
reserved_9 : bit;
SWP_FMC : bits_2;
reserved_12_15 : bits_4;
reserved_16_31 : unsigned_16;
end record
with volatile_full_access, size => 32;
for t_SYSCFG_MEMRMP use record
MEM_MODE at 0 range 0 .. 2;
reserved_3_7 at 0 range 3 .. 7;
FB_MODE at 0 range 8 .. 8;
reserved_9 at 0 range 9 .. 9;
SWP_FMC at 0 range 10 .. 11;
reserved_12_15 at 0 range 12 .. 15;
reserved_16_31 at 0 range 16 .. 31;
end record;
----------------------------------------------------------------
-- SYSCFG peripheral mode configuration register (SYSCFG_PMC) --
----------------------------------------------------------------
type t_SYSCFG_PMC is record
reserved_0_15 : unsigned_16;
ADC1DC2 : bit;
ADC2DC2 : bit;
ADC3DC2 : bit;
reserved_19_22 : bits_4;
MII_RMII_SEL : bit;
reserved_24_31 : byte;
end record
with volatile_full_access, size => 32;
for t_SYSCFG_PMC use record
reserved_0_15 at 0 range 0 .. 15;
ADC1DC2 at 0 range 16 .. 16;
ADC2DC2 at 0 range 17 .. 17;
ADC3DC2 at 0 range 18 .. 18;
reserved_19_22 at 0 range 19 .. 22;
MII_RMII_SEL at 0 range 23 .. 23;
reserved_24_31 at 0 range 24 .. 31;
end record;
------------------------------------------------------------------------
-- SYSCFG external interrupt configuration registers (SYSCFG_EXTICRx) --
------------------------------------------------------------------------
type t_exticr_list is
array (soc.gpio.t_gpio_pin_index range <>) of soc.gpio.t_gpio_port_index
with pack;
type t_SYSCFG_EXTICR1 is record
exti : t_exticr_list (0 .. 3);
reserved : short;
end record
with pack, size => 32, volatile_full_access;
type t_SYSCFG_EXTICR2 is record
exti : t_exticr_list (4 .. 7);
reserved : short;
end record
with pack, size => 32, volatile_full_access;
type t_SYSCFG_EXTICR3 is record
exti : t_exticr_list (8 .. 11);
reserved : short;
end record
with pack, size => 32, volatile_full_access;
type t_SYSCFG_EXTICR4 is record
exti : t_exticr_list (12 .. 15);
reserved : short;
end record
with pack, size => 32, volatile_full_access;
-------------------------------------------------------
-- Compensation cell control register (SYSCFG_CMPCR) --
-------------------------------------------------------
type t_SYSCFG_CMPCR is record
CMP_PD : bit;
reserved_1_6 : bits_6;
READY : bit;
reserved_8_15 : byte;
reserved_16_31 : unsigned_16;
end record
with volatile_full_access, size => 32;
for t_SYSCFG_CMPCR use record
CMP_PD at 0 range 0 .. 0;
reserved_1_6 at 0 range 1 .. 6;
READY at 0 range 7 .. 7;
reserved_8_15 at 0 range 8 .. 15;
reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------------
-- SYSCFG peripheral --
-----------------------
type t_SYSCFG_periph is record
MEMRMP : t_SYSCFG_MEMRMP;
PMC : t_SYSCFG_PMC;
EXTICR1 : t_SYSCFG_EXTICR1;
EXTICR2 : t_SYSCFG_EXTICR2;
EXTICR3 : t_SYSCFG_EXTICR3;
EXTICR4 : t_SYSCFG_EXTICR4;
CMPCR : t_SYSCFG_CMPCR;
end record
with volatile;
for t_SYSCFG_periph use record
MEMRMP at 16#00# range 0 .. 31;
PMC at 16#04# range 0 .. 31;
EXTICR1 at 16#08# range 0 .. 31;
EXTICR2 at 16#0C# range 0 .. 31;
EXTICR3 at 16#10# range 0 .. 31;
EXTICR4 at 16#14# range 0 .. 31;
CMPCR at 16#20# range 0 .. 31;
end record;
SYSCFG : t_SYSCFG_periph
with
import,
volatile,
address => system'to_address (soc.layout.SYSCFG_BASE); -- 0x40013800
procedure get_exti_port
(pin : in soc.gpio.t_gpio_pin_index;
port : out soc.gpio.t_gpio_port_index);
procedure set_exti_port
(pin : in soc.gpio.t_gpio_pin_index;
port : in soc.gpio.t_gpio_port_index);
end soc.syscfg;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . S H A 5 1 2 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2009-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package implements the SHA-512 secure hash function as described in
-- FIPS PUB 180-3. The complete text of FIPS PUB 180-3 can be found at:
-- http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf
-- See the declaration of GNAT.Secure_Hashes.H in g-sechas.ads for complete
-- documentation.
with GNAT.Secure_Hashes.SHA2_Common;
with GNAT.Secure_Hashes.SHA2_64;
with System;
package GNAT.SHA512 is new GNAT.Secure_Hashes.H
(Block_Words => GNAT.Secure_Hashes.SHA2_Common.Block_Words,
State_Words => 8,
Hash_Words => 8,
Hash_Bit_Order => System.High_Order_First,
Hash_State => GNAT.Secure_Hashes.SHA2_64.Hash_State,
Initial_State => GNAT.Secure_Hashes.SHA2_64.SHA512_Init_State,
Transform => GNAT.Secure_Hashes.SHA2_64.Transform);
|
generic
type Item is private;
type View is access all Item;
pool_Size : Positive := 5_000;
package lace.fast_Pool
is
function new_Item return View;
procedure free (Self : in out View);
end lace.fast_Pool;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Forms.Form_User_Data --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998-2014,2018 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control:
-- $Revision: 1.16 $
-- Binding Version 01.00
------------------------------------------------------------------------------
-- |
-- |=====================================================================
-- | man page form__userptr.3x
-- |=====================================================================
-- |
with Terminal_Interface.Curses.Aux; use Terminal_Interface.Curses.Aux;
package body Terminal_Interface.Curses.Forms.Form_User_Data is
-- |
-- |
-- |
procedure Set_User_Data (Frm : Form;
Data : User_Access)
is
function Set_Form_Userptr (Frm : Form;
Data : User_Access) return Eti_Error;
pragma Import (C, Set_Form_Userptr, "set_form_userptr");
begin
Eti_Exception (Set_Form_Userptr (Frm, Data));
end Set_User_Data;
-- |
-- |
-- |
function Get_User_Data (Frm : Form) return User_Access
is
function Form_Userptr (Frm : Form) return User_Access;
pragma Import (C, Form_Userptr, "form_userptr");
begin
return Form_Userptr (Frm);
end Get_User_Data;
procedure Get_User_Data (Frm : Form;
Data : out User_Access)
is
begin
Data := Get_User_Data (Frm);
end Get_User_Data;
end Terminal_Interface.Curses.Forms.Form_User_Data;
|
package STM32GD.USART is
pragma Preelaborate;
type USART_Instance is (USART_1, USART_2, USART_6);
end STM32GD.USART;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . M D 5 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2009-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package implements the MD5 Message-Digest Algorithm as described in
-- RFC 1321. The complete text of RFC 1321 can be found at:
-- http://www.ietf.org/rfc/rfc1321.txt
-- See the declaration of GNAT.Secure_Hashes.H in g-sechas.ads for complete
-- documentation.
with GNAT.Secure_Hashes.MD5;
with System;
package GNAT.MD5 is new GNAT.Secure_Hashes.H
(Block_Words => GNAT.Secure_Hashes.MD5.Block_Words,
State_Words => 4,
Hash_Words => 4,
Hash_Bit_Order => System.Low_Order_First,
Hash_State => GNAT.Secure_Hashes.MD5.Hash_State,
Initial_State => GNAT.Secure_Hashes.MD5.Initial_State,
Transform => GNAT.Secure_Hashes.MD5.Transform);
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ C H A R --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Val_Util; use System.Val_Util;
package body System.Val_Char is
---------------------
-- Value_Character --
---------------------
function Value_Character (Str : String) return Character is
F : Natural;
L : Natural;
S : String (Str'Range) := Str;
begin
Normalize_String (S, F, L);
-- Accept any single character enclosed in quotes
if L - F = 2 and then S (F) = ''' and then S (L) = ''' then
return Character'Val (Character'Pos (S (F + 1)));
-- Check control character cases
else
for C in Character'Val (16#00#) .. Character'Val (16#1F#) loop
if S (F .. L) = Character'Image (C) then
return 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 C;
end if;
end loop;
if S (F .. L) = "SOFT_HYPHEN" then
return Character'Val (16#AD#);
end if;
Bad_Value (Str);
end if;
end Value_Character;
end System.Val_Char;
|
Pragma Ada_2012;
with Connection_Types;
use Connection_Types;
Function Connection_Combinations return Partial_Board;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . G E N E R I C _ M K S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-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. --
-- --
------------------------------------------------------------------------------
-- Defines the MKS dimension system which is the SI system of units
-- Some other prefixes of this system are defined in a child package (see
-- System.Dim.Generic_Mks.Generic_Other_Prefixes) in order to avoid too many
-- constant declarations in this package.
-- The dimension terminology is defined in System.Dim package
with Ada.Numerics;
generic
type Float_Type is digits <>;
package System.Dim.Generic_Mks is
e : constant := Ada.Numerics.e;
Pi : constant := Ada.Numerics.Pi;
-- Dimensioned type Mks_Type
type Mks_Type is new Float_Type
with
Dimension_System => (
(Unit_Name => Meter, Unit_Symbol => 'm', Dim_Symbol => 'L'),
(Unit_Name => Kilogram, Unit_Symbol => "kg", Dim_Symbol => 'M'),
(Unit_Name => Second, Unit_Symbol => 's', Dim_Symbol => 'T'),
(Unit_Name => Ampere, Unit_Symbol => 'A', Dim_Symbol => 'I'),
(Unit_Name => Kelvin, Unit_Symbol => 'K', Dim_Symbol => '@'),
(Unit_Name => Mole, Unit_Symbol => "mol", Dim_Symbol => 'N'),
(Unit_Name => Candela, Unit_Symbol => "cd", Dim_Symbol => 'J'));
-- SI Base dimensioned subtypes
subtype Length is Mks_Type
with
Dimension => (Symbol => 'm',
Meter => 1,
others => 0);
subtype Mass is Mks_Type
with
Dimension => (Symbol => "kg",
Kilogram => 1,
others => 0);
subtype Time is Mks_Type
with
Dimension => (Symbol => 's',
Second => 1,
others => 0);
subtype Electric_Current is Mks_Type
with
Dimension => (Symbol => 'A',
Ampere => 1,
others => 0);
subtype Thermodynamic_Temperature is Mks_Type
with
Dimension => (Symbol => 'K',
Kelvin => 1,
others => 0);
subtype Amount_Of_Substance is Mks_Type
with
Dimension => (Symbol => "mol",
Mole => 1,
others => 0);
subtype Luminous_Intensity is Mks_Type
with
Dimension => (Symbol => "cd",
Candela => 1,
others => 0);
-- Initialize SI Base unit values
-- Turn off the all the dimension warnings for these basic assignments
-- since otherwise we would get complaints about assigning dimensionless
-- values to dimensioned subtypes (we can't assign 1.0*m to m).
pragma Warnings (Off, "*assumed to be*");
m : constant Length := 1.0;
kg : constant Mass := 1.0;
s : constant Time := 1.0;
A : constant Electric_Current := 1.0;
K : constant Thermodynamic_Temperature := 1.0;
mol : constant Amount_Of_Substance := 1.0;
cd : constant Luminous_Intensity := 1.0;
pragma Warnings (On, "*assumed to be*");
-- SI Derived dimensioned subtypes
subtype Absorbed_Dose is Mks_Type
with
Dimension => (Symbol => "Gy",
Meter => 2,
Second => -2,
others => 0);
subtype Angle is Mks_Type
with
Dimension => (Symbol => "rad",
others => 0);
subtype Area is Mks_Type
with
Dimension => (
Meter => 2,
others => 0);
subtype Catalytic_Activity is Mks_Type
with
Dimension => (Symbol => "kat",
Second => -1,
Mole => 1,
others => 0);
subtype Celsius_Temperature is Mks_Type
with
Dimension => (Symbol => "°C",
Kelvin => 1,
others => 0);
subtype Electric_Capacitance is Mks_Type
with
Dimension => (Symbol => 'F',
Meter => -2,
Kilogram => -1,
Second => 4,
Ampere => 2,
others => 0);
subtype Electric_Charge is Mks_Type
with
Dimension => (Symbol => 'C',
Second => 1,
Ampere => 1,
others => 0);
subtype Electric_Conductance is Mks_Type
with
Dimension => (Symbol => 'S',
Meter => -2,
Kilogram => -1,
Second => 3,
Ampere => 2,
others => 0);
subtype Electric_Potential_Difference is Mks_Type
with
Dimension => (Symbol => 'V',
Meter => 2,
Kilogram => 1,
Second => -3,
Ampere => -1,
others => 0);
-- Note the type punning below. The Symbol is a single "ohm" character
-- encoded in UTF-8 (ce a9 in hexadecimal), but this file is not compiled
-- with -gnatW8, so we're treating the string literal as a two-character
-- String.
subtype Electric_Resistance is Mks_Type
with
Dimension => (Symbol => "Ω",
Meter => 2,
Kilogram => 1,
Second => -3,
Ampere => -2,
others => 0);
subtype Energy is Mks_Type
with
Dimension => (Symbol => 'J',
Meter => 2,
Kilogram => 1,
Second => -2,
others => 0);
subtype Equivalent_Dose is Mks_Type
with
Dimension => (Symbol => "Sv",
Meter => 2,
Second => -2,
others => 0);
subtype Force is Mks_Type
with
Dimension => (Symbol => 'N',
Meter => 1,
Kilogram => 1,
Second => -2,
others => 0);
subtype Frequency is Mks_Type
with
Dimension => (Symbol => "Hz",
Second => -1,
others => 0);
subtype Illuminance is Mks_Type
with
Dimension => (Symbol => "lx",
Meter => -2,
Candela => 1,
others => 0);
subtype Inductance is Mks_Type
with
Dimension => (Symbol => 'H',
Meter => 2,
Kilogram => 1,
Second => -2,
Ampere => -2,
others => 0);
subtype Luminous_Flux is Mks_Type
with
Dimension => (Symbol => "lm",
Candela => 1,
others => 0);
subtype Magnetic_Flux is Mks_Type
with
Dimension => (Symbol => "Wb",
Meter => 2,
Kilogram => 1,
Second => -2,
Ampere => -1,
others => 0);
subtype Magnetic_Flux_Density is Mks_Type
with
Dimension => (Symbol => 'T',
Kilogram => 1,
Second => -2,
Ampere => -1,
others => 0);
subtype Power is Mks_Type
with
Dimension => (Symbol => 'W',
Meter => 2,
Kilogram => 1,
Second => -3,
others => 0);
subtype Pressure is Mks_Type
with
Dimension => (Symbol => "Pa",
Meter => -1,
Kilogram => 1,
Second => -2,
others => 0);
subtype Radioactivity is Mks_Type
with
Dimension => (Symbol => "Bq",
Second => -1,
others => 0);
subtype Solid_Angle is Mks_Type
with
Dimension => (Symbol => "sr",
others => 0);
subtype Speed is Mks_Type
with
Dimension => (
Meter => 1,
Second => -1,
others => 0);
subtype Volume is Mks_Type
with
Dimension => (
Meter => 3,
others => 0);
-- Initialize derived dimension values
-- Turn off the all the dimension warnings for these basic assignments
-- since otherwise we would get complaints about assigning dimensionless
-- values to dimensioned subtypes.
pragma Warnings (Off, "*assumed to be*");
rad : constant Angle := 1.0;
sr : constant Solid_Angle := 1.0;
Hz : constant Frequency := 1.0;
N : constant Force := 1.0;
Pa : constant Pressure := 1.0;
J : constant Energy := 1.0;
W : constant Power := 1.0;
C : constant Electric_Charge := 1.0;
V : constant Electric_Potential_Difference := 1.0;
F : constant Electric_Capacitance := 1.0;
Ohm : constant Electric_Resistance := 1.0;
Si : constant Electric_Conductance := 1.0;
Wb : constant Magnetic_Flux := 1.0;
T : constant Magnetic_Flux_Density := 1.0;
H : constant Inductance := 1.0;
dC : constant Celsius_Temperature := 273.15;
lm : constant Luminous_Flux := 1.0;
lx : constant Illuminance := 1.0;
Bq : constant Radioactivity := 1.0;
Gy : constant Absorbed_Dose := 1.0;
Sv : constant Equivalent_Dose := 1.0;
kat : constant Catalytic_Activity := 1.0;
-- SI prefixes for Meter
um : constant Length := 1.0E-06; -- micro (u)
mm : constant Length := 1.0E-03; -- milli
cm : constant Length := 1.0E-02; -- centi
dm : constant Length := 1.0E-01; -- deci
dam : constant Length := 1.0E+01; -- deka
hm : constant Length := 1.0E+02; -- hecto
km : constant Length := 1.0E+03; -- kilo
Mem : constant Length := 1.0E+06; -- mega
-- SI prefixes for Kilogram
ug : constant Mass := 1.0E-09; -- micro (u)
mg : constant Mass := 1.0E-06; -- milli
cg : constant Mass := 1.0E-05; -- centi
dg : constant Mass := 1.0E-04; -- deci
g : constant Mass := 1.0E-03; -- gram
dag : constant Mass := 1.0E-02; -- deka
hg : constant Mass := 1.0E-01; -- hecto
Meg : constant Mass := 1.0E+03; -- mega
-- SI prefixes for Second
us : constant Time := 1.0E-06; -- micro (u)
ms : constant Time := 1.0E-03; -- milli
cs : constant Time := 1.0E-02; -- centi
ds : constant Time := 1.0E-01; -- deci
das : constant Time := 1.0E+01; -- deka
hs : constant Time := 1.0E+02; -- hecto
ks : constant Time := 1.0E+03; -- kilo
Mes : constant Time := 1.0E+06; -- mega
-- Other constants for Second
min : constant Time := 60.0 * s;
hour : constant Time := 60.0 * min;
day : constant Time := 24.0 * hour;
year : constant Time := 365.25 * day;
-- SI prefixes for Ampere
mA : constant Electric_Current := 1.0E-03; -- milli
cA : constant Electric_Current := 1.0E-02; -- centi
dA : constant Electric_Current := 1.0E-01; -- deci
daA : constant Electric_Current := 1.0E+01; -- deka
hA : constant Electric_Current := 1.0E+02; -- hecto
kA : constant Electric_Current := 1.0E+03; -- kilo
MeA : constant Electric_Current := 1.0E+06; -- mega
pragma Warnings (On, "*assumed to be*");
end System.Dim.Generic_Mks;
|
-----------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P A R . C H 4 --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- Turn off subprogram body ordering check. Subprograms are in order
-- by RM section rather than alphabetical
with Stringt; use Stringt;
separate (Par)
package body Ch4 is
-- Attributes that cannot have arguments
Is_Parameterless_Attribute : constant Attribute_Class_Array :=
(Attribute_Base => True,
Attribute_Body_Version => True,
Attribute_Class => True,
Attribute_External_Tag => True,
Attribute_Img => True,
Attribute_Loop_Entry => True,
Attribute_Old => True,
Attribute_Result => True,
Attribute_Stub_Type => True,
Attribute_Version => True,
Attribute_Type_Key => True,
others => False);
-- This map contains True for parameterless attributes that return a string
-- or a type. For those attributes, a left parenthesis after the attribute
-- should not be analyzed as the beginning of a parameters list because it
-- may denote a slice operation (X'Img (1 .. 2)) or a type conversion
-- (X'Class (Y)).
-- Note: Loop_Entry is in this list because, although it can take an
-- optional argument (the loop name), we can't distinguish that at parse
-- time from the case where no loop name is given and a legitimate index
-- expression is present. So we parse the argument as an indexed component
-- and the semantic analysis sorts out this syntactic ambiguity based on
-- the type and form of the expression.
-- Note that this map designates the minimum set of attributes where a
-- construct in parentheses that is not an argument can appear right
-- after the attribute. For attributes like 'Size, we do not put them
-- in the map. If someone writes X'Size (3), that's illegal in any case,
-- but we get a better error message by parsing the (3) as an illegal
-- argument to the attribute, rather than some meaningless junk that
-- follows the attribute.
-----------------------
-- Local Subprograms --
-----------------------
function P_Aggregate_Or_Paren_Expr return Node_Id;
function P_Allocator return Node_Id;
function P_Case_Expression_Alternative return Node_Id;
function P_Iterated_Component_Association return Node_Id;
function P_Record_Or_Array_Component_Association return Node_Id;
function P_Factor return Node_Id;
function P_Primary return Node_Id;
function P_Relation return Node_Id;
function P_Term return Node_Id;
function P_Declare_Expression return Node_Id;
function P_Reduction_Attribute_Reference (S : Node_Id)
return Node_Id;
function P_Binary_Adding_Operator return Node_Kind;
function P_Logical_Operator return Node_Kind;
function P_Multiplying_Operator return Node_Kind;
function P_Relational_Operator return Node_Kind;
function P_Unary_Adding_Operator return Node_Kind;
procedure Bad_Range_Attribute (Loc : Source_Ptr);
-- Called to place complaint about bad range attribute at the given
-- source location. Terminates by raising Error_Resync.
procedure Check_Bad_Exp;
-- Called after scanning a**b, posts error if ** detected
procedure P_Membership_Test (N : Node_Id);
-- N is the node for a N_In or N_Not_In node whose right operand has not
-- yet been processed. It is called just after scanning out the IN keyword.
-- On return, either Right_Opnd or Alternatives is set, as appropriate.
function P_Range_Attribute_Reference (Prefix_Node : Node_Id) return Node_Id;
-- Scan a range attribute reference. The caller has scanned out the
-- prefix. The current token is known to be an apostrophe and the
-- following token is known to be RANGE.
function P_Case_Expression return Node_Id;
-- Scans out a case expression. Called with Token pointing to the CASE
-- keyword, and returns pointing to the terminating right parent,
-- semicolon, or comma, but does not consume this terminating token.
function P_Unparen_Cond_Expr_Etc return Node_Id;
-- This function is called with Token pointing to IF, CASE, FOR, or
-- DECLARE, in a context that allows a conditional (if or case) expression,
-- a quantified expression, an iterated component association, or a declare
-- expression, if it is surrounded by parentheses. If not surrounded by
-- parentheses, the expression is still returned, but an error message is
-- issued.
-------------------------
-- Bad_Range_Attribute --
-------------------------
procedure Bad_Range_Attribute (Loc : Source_Ptr) is
begin
Error_Msg ("range attribute cannot be used in expression!", Loc);
Resync_Expression;
end Bad_Range_Attribute;
-------------------
-- Check_Bad_Exp --
-------------------
procedure Check_Bad_Exp is
begin
if Token = Tok_Double_Asterisk then
Error_Msg_SC ("parenthesization required for '*'*");
Scan; -- past **
Discard_Junk_Node (P_Primary);
Check_Bad_Exp;
end if;
end Check_Bad_Exp;
--------------------------
-- 4.1 Name (also 6.4) --
--------------------------
-- NAME ::=
-- DIRECT_NAME | EXPLICIT_DEREFERENCE
-- | INDEXED_COMPONENT | SLICE
-- | SELECTED_COMPONENT | ATTRIBUTE
-- | TYPE_CONVERSION | FUNCTION_CALL
-- | CHARACTER_LITERAL | TARGET_NAME
-- DIRECT_NAME ::= IDENTIFIER | OPERATOR_SYMBOL
-- PREFIX ::= NAME | IMPLICIT_DEREFERENCE
-- EXPLICIT_DEREFERENCE ::= NAME . all
-- IMPLICIT_DEREFERENCE ::= NAME
-- INDEXED_COMPONENT ::= PREFIX (EXPRESSION {, EXPRESSION})
-- SLICE ::= PREFIX (DISCRETE_RANGE)
-- SELECTED_COMPONENT ::= PREFIX . SELECTOR_NAME
-- SELECTOR_NAME ::= IDENTIFIER | CHARACTER_LITERAL | OPERATOR_SYMBOL
-- ATTRIBUTE_REFERENCE ::= PREFIX ' ATTRIBUTE_DESIGNATOR
-- ATTRIBUTE_DESIGNATOR ::=
-- IDENTIFIER [(static_EXPRESSION)]
-- | access | delta | digits
-- FUNCTION_CALL ::=
-- function_NAME
-- | function_PREFIX ACTUAL_PARAMETER_PART
-- ACTUAL_PARAMETER_PART ::=
-- (PARAMETER_ASSOCIATION {,PARAMETER_ASSOCIATION})
-- PARAMETER_ASSOCIATION ::=
-- [formal_parameter_SELECTOR_NAME =>] EXPLICIT_ACTUAL_PARAMETER
-- EXPLICIT_ACTUAL_PARAMETER ::= EXPRESSION | variable_NAME
-- TARGET_NAME ::= @ (AI12-0125-3: abbreviation for LHS)
-- Note: syntactically a procedure call looks just like a function call,
-- so this routine is in practice used to scan out procedure calls as well.
-- On return, Expr_Form is set to either EF_Name or EF_Simple_Name
-- Error recovery: can raise Error_Resync
-- Note: if on return Token = Tok_Apostrophe, then the apostrophe must be
-- followed by either a left paren (qualified expression case), or by
-- range (range attribute case). All other uses of apostrophe (i.e. all
-- other attributes) are handled in this routine.
-- Error recovery: can raise Error_Resync
function P_Name return Node_Id is
Scan_State : Saved_Scan_State;
Name_Node : Node_Id;
Prefix_Node : Node_Id;
Ident_Node : Node_Id;
Expr_Node : Node_Id;
Range_Node : Node_Id;
Arg_Node : Node_Id;
Arg_List : List_Id := No_List; -- kill junk warning
Attr_Name : Name_Id := No_Name; -- kill junk warning
begin
-- Case of not a name
if Token not in Token_Class_Name then
-- If it looks like start of expression, complain and scan expression
if Token in Token_Class_Literal
or else Token = Tok_Left_Paren
then
Error_Msg_SC ("name expected");
return P_Expression;
-- Otherwise some other junk, not much we can do
else
Error_Msg_AP ("name expected");
raise Error_Resync;
end if;
end if;
-- Loop through designators in qualified name
-- AI12-0125 : target_name
if Token = Tok_At_Sign then
Scan_Reserved_Identifier (Force_Msg => False);
if Present (Current_Assign_Node) then
Set_Has_Target_Names (Current_Assign_Node);
end if;
end if;
Name_Node := Token_Node;
loop
Scan; -- past designator
exit when Token /= Tok_Dot;
Save_Scan_State (Scan_State); -- at dot
Scan; -- past dot
-- If we do not have another designator after the dot, then join
-- the normal circuit to handle a dot extension (may be .all or
-- character literal case). Otherwise loop back to scan the next
-- designator.
if Token not in Token_Class_Desig then
goto Scan_Name_Extension_Dot;
else
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Selected_Component, Prev_Token_Ptr);
Set_Prefix (Name_Node, Prefix_Node);
Set_Selector_Name (Name_Node, Token_Node);
end if;
end loop;
-- We have now scanned out a qualified designator. If the last token is
-- an operator symbol, then we certainly do not have the Snam case, so
-- we can just use the normal name extension check circuit
if Prev_Token = Tok_Operator_Symbol then
goto Scan_Name_Extension;
end if;
-- We have scanned out a qualified simple name, check for name
-- extension. Note that we know there is no dot here at this stage,
-- so the only possible cases of name extension are apostrophe followed
-- by '(' or '['.
if Token = Tok_Apostrophe then
Save_Scan_State (Scan_State); -- at apostrophe
Scan; -- past apostrophe
-- Qualified expression in Ada 2012 mode (treated as a name)
if Ada_Version >= Ada_2012
and then Token in Tok_Left_Paren | Tok_Left_Bracket
then
goto Scan_Name_Extension_Apostrophe;
-- If left paren not in Ada 2012, then it is not part of the name,
-- since qualified expressions are not names in prior versions of
-- Ada, so return with Token backed up to point to the apostrophe.
-- The treatment for the range attribute is similar (we do not
-- consider x'range to be a name in this grammar).
elsif Token = Tok_Left_Paren or else Token = Tok_Range then
Restore_Scan_State (Scan_State); -- to apostrophe
Expr_Form := EF_Simple_Name;
return Name_Node;
-- Otherwise we have the case of a name extended by an attribute
else
goto Scan_Name_Extension_Apostrophe;
end if;
-- Check case of qualified simple name extended by a left parenthesis
elsif Token = Tok_Left_Paren then
Scan; -- past left paren
goto Scan_Name_Extension_Left_Paren;
-- Otherwise the qualified simple name is not extended, so return
else
Expr_Form := EF_Simple_Name;
return Name_Node;
end if;
-- Loop scanning past name extensions. A label is used for control
-- transfer for this loop for ease of interfacing with the finite state
-- machine in the parenthesis scanning circuit, and also to allow for
-- passing in control to the appropriate point from the above code.
<<Scan_Name_Extension>>
-- Character literal used as name cannot be extended. Also this
-- cannot be a call, since the name for a call must be a designator.
-- Return in these cases, or if there is no name extension
if Token not in Token_Class_Namext
or else Prev_Token = Tok_Char_Literal
then
Expr_Form := EF_Name;
return Name_Node;
end if;
-- Merge here when we know there is a name extension
<<Scan_Name_Extension_OK>>
if Token = Tok_Left_Paren then
Scan; -- past left paren
goto Scan_Name_Extension_Left_Paren;
elsif Token = Tok_Apostrophe then
Save_Scan_State (Scan_State); -- at apostrophe
Scan; -- past apostrophe
goto Scan_Name_Extension_Apostrophe;
else -- Token = Tok_Dot
Save_Scan_State (Scan_State); -- at dot
Scan; -- past dot
goto Scan_Name_Extension_Dot;
end if;
-- Case of name extended by dot (selection), dot is already skipped
-- and the scan state at the point of the dot is saved in Scan_State.
<<Scan_Name_Extension_Dot>>
-- Explicit dereference case
if Token = Tok_All then
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Explicit_Dereference, Token_Ptr);
Set_Prefix (Name_Node, Prefix_Node);
Scan; -- past ALL
goto Scan_Name_Extension;
-- Selected component case
elsif Token in Token_Class_Name then
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Selected_Component, Prev_Token_Ptr);
Set_Prefix (Name_Node, Prefix_Node);
Set_Selector_Name (Name_Node, Token_Node);
Scan; -- past selector
goto Scan_Name_Extension;
-- Reserved identifier as selector
elsif Is_Reserved_Identifier then
Scan_Reserved_Identifier (Force_Msg => False);
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Selected_Component, Prev_Token_Ptr);
Set_Prefix (Name_Node, Prefix_Node);
Set_Selector_Name (Name_Node, Token_Node);
Scan; -- past identifier used as selector
goto Scan_Name_Extension;
-- If dot is at end of line and followed by nothing legal,
-- then assume end of name and quit (dot will be taken as
-- an incorrect form of some other punctuation by our caller).
elsif Token_Is_At_Start_Of_Line then
Restore_Scan_State (Scan_State);
return Name_Node;
-- Here if nothing legal after the dot
else
Error_Msg_AP ("selector expected");
raise Error_Resync;
end if;
-- Here for an apostrophe as name extension. The scan position at the
-- apostrophe has already been saved, and the apostrophe scanned out.
<<Scan_Name_Extension_Apostrophe>>
Scan_Apostrophe : declare
function Apostrophe_Should_Be_Semicolon return Boolean;
-- Checks for case where apostrophe should probably be
-- a semicolon, and if so, gives appropriate message,
-- resets the scan pointer to the apostrophe, changes
-- the current token to Tok_Semicolon, and returns True.
-- Otherwise returns False.
------------------------------------
-- Apostrophe_Should_Be_Semicolon --
------------------------------------
function Apostrophe_Should_Be_Semicolon return Boolean is
begin
if Token_Is_At_Start_Of_Line then
Restore_Scan_State (Scan_State); -- to apostrophe
Error_Msg_SC ("|""''"" should be "";""");
Token := Tok_Semicolon;
return True;
else
return False;
end if;
end Apostrophe_Should_Be_Semicolon;
-- Start of processing for Scan_Apostrophe
begin
-- Check for qualified expression case in Ada 2012 mode
if Ada_Version >= Ada_2012
and then Token in Tok_Left_Paren | Tok_Left_Bracket
then
Name_Node := P_Qualified_Expression (Name_Node);
goto Scan_Name_Extension;
-- If range attribute after apostrophe, then return with Token
-- pointing to the apostrophe. Note that in this case the prefix
-- need not be a simple name (cases like A.all'range). Similarly
-- if there is a left paren after the apostrophe, then we also
-- return with Token pointing to the apostrophe (this is the
-- aggregate case, or some error case).
elsif Token = Tok_Range or else Token = Tok_Left_Paren then
Restore_Scan_State (Scan_State); -- to apostrophe
Expr_Form := EF_Name;
return Name_Node;
-- Here for cases where attribute designator is an identifier
elsif Token = Tok_Identifier then
Attr_Name := Token_Name;
if not Is_Attribute_Name (Attr_Name) then
if Apostrophe_Should_Be_Semicolon then
Expr_Form := EF_Name;
return Name_Node;
-- Here for a bad attribute name
else
Signal_Bad_Attribute;
Scan; -- past bad identifier
if Token = Tok_Left_Paren then
Scan; -- past left paren
loop
Discard_Junk_Node (P_Expression_If_OK);
exit when not Comma_Present;
end loop;
T_Right_Paren;
end if;
return Error;
end if;
end if;
if Style_Check then
Style.Check_Attribute_Name (False);
end if;
-- Here for case of attribute designator is not an identifier
else
if Token = Tok_Delta then
Attr_Name := Name_Delta;
elsif Token = Tok_Digits then
Attr_Name := Name_Digits;
elsif Token = Tok_Access then
Attr_Name := Name_Access;
elsif Token = Tok_Mod and then Ada_Version >= Ada_95 then
Attr_Name := Name_Mod;
elsif Apostrophe_Should_Be_Semicolon then
Expr_Form := EF_Name;
return Name_Node;
else
Error_Msg_AP ("attribute designator expected");
raise Error_Resync;
end if;
if Style_Check then
Style.Check_Attribute_Name (True);
end if;
end if;
-- We come here with an OK attribute scanned, and corresponding
-- Attribute identifier node stored in Ident_Node.
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Attribute_Reference, Prev_Token_Ptr);
Scan; -- past attribute designator
Set_Prefix (Name_Node, Prefix_Node);
Set_Attribute_Name (Name_Node, Attr_Name);
-- Scan attribute arguments/designator. We skip this if we know
-- that the attribute cannot have an argument (see documentation
-- of Is_Parameterless_Attribute for further details).
if Token = Tok_Left_Paren
and then not
Is_Parameterless_Attribute (Get_Attribute_Id (Attr_Name))
then
-- Attribute Update contains an array or record association
-- list which provides new values for various components or
-- elements. The list is parsed as an aggregate, and we get
-- better error handling by knowing that in the parser.
if Attr_Name = Name_Update then
Set_Expressions (Name_Node, New_List);
Append (P_Aggregate, Expressions (Name_Node));
-- All other cases of parsing attribute arguments
else
Set_Expressions (Name_Node, New_List);
Scan; -- past left paren
loop
declare
Expr : constant Node_Id := P_Expression_If_OK;
Rnam : Node_Id;
begin
-- Case of => for named notation
if Token = Tok_Arrow then
-- Named notation allowed only for the special
-- case of System'Restriction_Set (No_Dependence =>
-- unit_NAME), in which case construct a parameter
-- assocation node and append to the arguments.
if Attr_Name = Name_Restriction_Set
and then Nkind (Expr) = N_Identifier
and then Chars (Expr) = Name_No_Dependence
then
Scan; -- past arrow
Rnam := P_Name;
Append_To (Expressions (Name_Node),
Make_Parameter_Association (Sloc (Rnam),
Selector_Name => Expr,
Explicit_Actual_Parameter => Rnam));
exit;
-- For all other cases named notation is illegal
else
Error_Msg_SC
("named parameters not permitted "
& "for attributes");
Scan; -- past junk arrow
end if;
-- Here for normal case (not => for named parameter)
else
-- Special handling for 'Image in Ada 2012, where
-- the attribute can be parameterless and its value
-- can be the prefix of a slice. Rewrite name as a
-- slice, Expr is its low bound.
if Token = Tok_Dot_Dot
and then Attr_Name = Name_Image
and then Ada_Version >= Ada_2012
then
Set_Expressions (Name_Node, No_List);
Prefix_Node := Name_Node;
Name_Node :=
New_Node (N_Slice, Sloc (Prefix_Node));
Set_Prefix (Name_Node, Prefix_Node);
Range_Node := New_Node (N_Range, Token_Ptr);
Set_Low_Bound (Range_Node, Expr);
Scan; -- past ..
Expr_Node := P_Expression;
Check_Simple_Expression (Expr_Node);
Set_High_Bound (Range_Node, Expr_Node);
Set_Discrete_Range (Name_Node, Range_Node);
T_Right_Paren;
goto Scan_Name_Extension;
else
Append (Expr, Expressions (Name_Node));
exit when not Comma_Present;
end if;
end if;
end;
end loop;
T_Right_Paren;
end if;
end if;
goto Scan_Name_Extension;
end Scan_Apostrophe;
-- Here for left parenthesis extending name (left paren skipped)
<<Scan_Name_Extension_Left_Paren>>
-- We now have to scan through a list of items, terminated by a
-- right parenthesis. The scan is handled by a finite state
-- machine. The possibilities are:
-- (discrete_range)
-- This is a slice. This case is handled in LP_State_Init
-- (expression, expression, ..)
-- This is interpreted as an indexed component, i.e. as a
-- case of a name which can be extended in the normal manner.
-- This case is handled by LP_State_Name or LP_State_Expr.
-- Note: if and case expressions (without an extra level of
-- parentheses) are permitted in this context).
-- (..., identifier => expression , ...)
-- If there is at least one occurrence of identifier => (but
-- none of the other cases apply), then we have a call.
-- Test for Id => case
if Token = Tok_Identifier then
Save_Scan_State (Scan_State); -- at Id
Scan; -- past Id
-- Test for => (allow := as an error substitute)
if Token = Tok_Arrow or else Token = Tok_Colon_Equal then
Restore_Scan_State (Scan_State); -- to Id
Arg_List := New_List;
goto LP_State_Call;
else
Restore_Scan_State (Scan_State); -- to Id
end if;
end if;
-- Here we have an expression after all
Expr_Node := P_Expression_Or_Range_Attribute_If_OK;
-- Check cases of discrete range for a slice
-- First possibility: Range_Attribute_Reference
if Expr_Form = EF_Range_Attr then
Range_Node := Expr_Node;
-- Second possibility: Simple_expression .. Simple_expression
elsif Token = Tok_Dot_Dot then
Check_Simple_Expression (Expr_Node);
Range_Node := New_Node (N_Range, Token_Ptr);
Set_Low_Bound (Range_Node, Expr_Node);
Scan; -- past ..
Expr_Node := P_Expression;
Check_Simple_Expression (Expr_Node);
Set_High_Bound (Range_Node, Expr_Node);
-- Third possibility: Type_name range Range
elsif Token = Tok_Range then
if Expr_Form /= EF_Simple_Name then
Error_Msg_SC ("subtype mark must precede RANGE");
raise Error_Resync;
end if;
Range_Node := P_Subtype_Indication (Expr_Node);
-- Otherwise we just have an expression. It is true that we might
-- have a subtype mark without a range constraint but this case
-- is syntactically indistinguishable from the expression case.
else
Arg_List := New_List;
goto LP_State_Expr;
end if;
-- Fall through here with unmistakable Discrete range scanned,
-- which means that we definitely have the case of a slice. The
-- Discrete range is in Range_Node.
if Token = Tok_Comma then
Error_Msg_SC ("slice cannot have more than one dimension");
raise Error_Resync;
elsif Token /= Tok_Right_Paren then
if Token = Tok_Arrow then
-- This may be an aggregate that is missing a qualification
Error_Msg_SC
("context of aggregate must be a qualified expression");
raise Error_Resync;
else
T_Right_Paren;
raise Error_Resync;
end if;
else
Scan; -- past right paren
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Slice, Sloc (Prefix_Node));
Set_Prefix (Name_Node, Prefix_Node);
Set_Discrete_Range (Name_Node, Range_Node);
-- An operator node is legal as a prefix to other names,
-- but not for a slice.
if Nkind (Prefix_Node) = N_Operator_Symbol then
Error_Msg_N ("illegal prefix for slice", Prefix_Node);
end if;
-- If we have a name extension, go scan it
if Token in Token_Class_Namext then
goto Scan_Name_Extension_OK;
-- Otherwise return (a slice is a name, but is not a call)
else
Expr_Form := EF_Name;
return Name_Node;
end if;
end if;
-- In LP_State_Expr, we have scanned one or more expressions, and
-- so we have a call or an indexed component which is a name. On
-- entry we have the expression just scanned in Expr_Node and
-- Arg_List contains the list of expressions encountered so far
<<LP_State_Expr>>
Append (Expr_Node, Arg_List);
if Token = Tok_Arrow then
Error_Msg
("expect identifier in parameter association", Sloc (Expr_Node));
Scan; -- past arrow
elsif not Comma_Present then
T_Right_Paren;
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Indexed_Component, Sloc (Prefix_Node));
Set_Prefix (Name_Node, Prefix_Node);
Set_Expressions (Name_Node, Arg_List);
goto Scan_Name_Extension;
end if;
-- Comma present (and scanned out), test for identifier => case
-- Test for identifier => case
if Token = Tok_Identifier then
Save_Scan_State (Scan_State); -- at Id
Scan; -- past Id
-- Test for => (allow := as error substitute)
if Token = Tok_Arrow or else Token = Tok_Colon_Equal then
Restore_Scan_State (Scan_State); -- to Id
goto LP_State_Call;
-- Otherwise it's just an expression after all, so backup
else
Restore_Scan_State (Scan_State); -- to Id
end if;
end if;
-- Here we have an expression after all, so stay in this state
Expr_Node := P_Expression_If_OK;
goto LP_State_Expr;
-- LP_State_Call corresponds to the situation in which at least one
-- instance of Id => Expression has been encountered, so we know that
-- we do not have a name, but rather a call. We enter it with the
-- scan pointer pointing to the next argument to scan, and Arg_List
-- containing the list of arguments scanned so far.
<<LP_State_Call>>
-- Test for case of Id => Expression (named parameter)
if Token = Tok_Identifier then
Save_Scan_State (Scan_State); -- at Id
Ident_Node := Token_Node;
Scan; -- past Id
-- Deal with => (allow := as incorrect substitute)
if Token = Tok_Arrow or else Token = Tok_Colon_Equal then
Arg_Node := New_Node (N_Parameter_Association, Prev_Token_Ptr);
Set_Selector_Name (Arg_Node, Ident_Node);
T_Arrow;
Set_Explicit_Actual_Parameter (Arg_Node, P_Expression);
Append (Arg_Node, Arg_List);
-- If a comma follows, go back and scan next entry
if Comma_Present then
goto LP_State_Call;
-- Otherwise we have the end of a call
else
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Function_Call, Sloc (Prefix_Node));
Set_Name (Name_Node, Prefix_Node);
Set_Parameter_Associations (Name_Node, Arg_List);
T_Right_Paren;
if Token in Token_Class_Namext then
goto Scan_Name_Extension_OK;
-- This is a case of a call which cannot be a name
else
Expr_Form := EF_Name;
return Name_Node;
end if;
end if;
-- Not named parameter: Id started an expression after all
else
Restore_Scan_State (Scan_State); -- to Id
end if;
end if;
-- Here if entry did not start with Id => which means that it
-- is a positional parameter, which is not allowed, since we
-- have seen at least one named parameter already.
Error_Msg_SC
("positional parameter association " &
"not allowed after named one");
Expr_Node := P_Expression_If_OK;
-- Leaving the '>' in an association is not unusual, so suggest
-- a possible fix.
if Nkind (Expr_Node) = N_Op_Eq then
Error_Msg_N ("\maybe `='>` was intended", Expr_Node);
end if;
-- We go back to scanning out expressions, so that we do not get
-- multiple error messages when several positional parameters
-- follow a named parameter.
goto LP_State_Expr;
-- End of treatment for name extensions starting with left paren
-- End of loop through name extensions
end P_Name;
-- This function parses a restricted form of Names which are either
-- designators, or designators preceded by a sequence of prefixes
-- that are direct names.
-- Error recovery: cannot raise Error_Resync
function P_Function_Name return Node_Id is
Designator_Node : Node_Id;
Prefix_Node : Node_Id;
Selector_Node : Node_Id;
Dot_Sloc : Source_Ptr := No_Location;
begin
-- Prefix_Node is set to the gathered prefix so far, Empty means that
-- no prefix has been scanned. This allows us to build up the result
-- in the required right recursive manner.
Prefix_Node := Empty;
-- Loop through prefixes
loop
Designator_Node := Token_Node;
if Token not in Token_Class_Desig then
return P_Identifier; -- let P_Identifier issue the error message
else -- Token in Token_Class_Desig
Scan; -- past designator
exit when Token /= Tok_Dot;
end if;
-- Here at a dot, with token just before it in Designator_Node
if No (Prefix_Node) then
Prefix_Node := Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
Prefix_Node := Selector_Node;
end if;
Dot_Sloc := Token_Ptr;
Scan; -- past dot
end loop;
-- Fall out of the loop having just scanned a designator
if No (Prefix_Node) then
return Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
return Selector_Node;
end if;
exception
when Error_Resync =>
return Error;
end P_Function_Name;
-- This function parses a restricted form of Names which are either
-- identifiers, or identifiers preceded by a sequence of prefixes
-- that are direct names.
-- Error recovery: cannot raise Error_Resync
function P_Qualified_Simple_Name return Node_Id is
Designator_Node : Node_Id;
Prefix_Node : Node_Id;
Selector_Node : Node_Id;
Dot_Sloc : Source_Ptr := No_Location;
begin
-- Prefix node is set to the gathered prefix so far, Empty means that
-- no prefix has been scanned. This allows us to build up the result
-- in the required right recursive manner.
Prefix_Node := Empty;
-- Loop through prefixes
loop
Designator_Node := Token_Node;
if Token = Tok_Identifier then
Scan; -- past identifier
exit when Token /= Tok_Dot;
elsif Token not in Token_Class_Desig then
return P_Identifier; -- let P_Identifier issue the error message
else
Scan; -- past designator
if Token /= Tok_Dot then
Error_Msg_SP ("identifier expected");
return Error;
end if;
end if;
-- Here at a dot, with token just before it in Designator_Node
if No (Prefix_Node) then
Prefix_Node := Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
Prefix_Node := Selector_Node;
end if;
Dot_Sloc := Token_Ptr;
Scan; -- past dot
end loop;
-- Fall out of the loop having just scanned an identifier
if No (Prefix_Node) then
return Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
return Selector_Node;
end if;
exception
when Error_Resync =>
return Error;
end P_Qualified_Simple_Name;
-- This procedure differs from P_Qualified_Simple_Name only in that it
-- raises Error_Resync if any error is encountered. It only returns after
-- scanning a valid qualified simple name.
-- Error recovery: can raise Error_Resync
function P_Qualified_Simple_Name_Resync return Node_Id is
Designator_Node : Node_Id;
Prefix_Node : Node_Id;
Selector_Node : Node_Id;
Dot_Sloc : Source_Ptr := No_Location;
begin
Prefix_Node := Empty;
-- Loop through prefixes
loop
Designator_Node := Token_Node;
if Token = Tok_Identifier then
Scan; -- past identifier
exit when Token /= Tok_Dot;
elsif Token not in Token_Class_Desig then
Discard_Junk_Node (P_Identifier); -- to issue the error message
raise Error_Resync;
else
Scan; -- past designator
if Token /= Tok_Dot then
Error_Msg_SP ("identifier expected");
raise Error_Resync;
end if;
end if;
-- Here at a dot, with token just before it in Designator_Node
if No (Prefix_Node) then
Prefix_Node := Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
Prefix_Node := Selector_Node;
end if;
Dot_Sloc := Token_Ptr;
Scan; -- past period
end loop;
-- Fall out of the loop having just scanned an identifier
if No (Prefix_Node) then
return Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
return Selector_Node;
end if;
end P_Qualified_Simple_Name_Resync;
----------------------
-- 4.1 Direct_Name --
----------------------
-- Parsed by P_Name and other functions in section 4.1
-----------------
-- 4.1 Prefix --
-----------------
-- Parsed by P_Name (4.1)
-------------------------------
-- 4.1 Explicit Dereference --
-------------------------------
-- Parsed by P_Name (4.1)
-------------------------------
-- 4.1 Implicit_Dereference --
-------------------------------
-- Parsed by P_Name (4.1)
----------------------------
-- 4.1 Indexed Component --
----------------------------
-- Parsed by P_Name (4.1)
----------------
-- 4.1 Slice --
----------------
-- Parsed by P_Name (4.1)
-----------------------------
-- 4.1 Selected_Component --
-----------------------------
-- Parsed by P_Name (4.1)
------------------------
-- 4.1 Selector Name --
------------------------
-- Parsed by P_Name (4.1)
------------------------------
-- 4.1 Attribute Reference --
------------------------------
-- Parsed by P_Name (4.1)
-------------------------------
-- 4.1 Attribute Designator --
-------------------------------
-- Parsed by P_Name (4.1)
--------------------------------------
-- 4.1.4 Range Attribute Reference --
--------------------------------------
-- RANGE_ATTRIBUTE_REFERENCE ::= PREFIX ' RANGE_ATTRIBUTE_DESIGNATOR
-- RANGE_ATTRIBUTE_DESIGNATOR ::= range [(static_EXPRESSION)]
-- In the grammar, a RANGE attribute is simply a name, but its use is
-- highly restricted, so in the parser, we do not regard it as a name.
-- Instead, P_Name returns without scanning the 'RANGE part of the
-- attribute, and the caller uses the following function to construct
-- a range attribute in places where it is appropriate.
-- Note that RANGE here is treated essentially as an identifier,
-- rather than a reserved word.
-- The caller has parsed the prefix, i.e. a name, and Token points to
-- the apostrophe. The token after the apostrophe is known to be RANGE
-- at this point. The prefix node becomes the prefix of the attribute.
-- Error_Recovery: Cannot raise Error_Resync
function P_Range_Attribute_Reference
(Prefix_Node : Node_Id)
return Node_Id
is
Attr_Node : Node_Id;
begin
Attr_Node := New_Node (N_Attribute_Reference, Token_Ptr);
Set_Prefix (Attr_Node, Prefix_Node);
Scan; -- past apostrophe
if Style_Check then
Style.Check_Attribute_Name (True);
end if;
Set_Attribute_Name (Attr_Node, Name_Range);
Scan; -- past RANGE
if Token = Tok_Left_Paren then
Scan; -- past left paren
Set_Expressions (Attr_Node, New_List (P_Expression_If_OK));
T_Right_Paren;
end if;
return Attr_Node;
end P_Range_Attribute_Reference;
-------------------------------------
-- P_Reduction_Attribute_Reference --
-------------------------------------
function P_Reduction_Attribute_Reference (S : Node_Id)
return Node_Id
is
Attr_Node : Node_Id;
Attr_Name : Name_Id;
begin
Attr_Name := Token_Name;
Scan; -- past Reduce
Attr_Node := New_Node (N_Attribute_Reference, Token_Ptr);
Set_Attribute_Name (Attr_Node, Attr_Name);
if Attr_Name /= Name_Reduce then
Error_Msg ("reduce attribute expected", Prev_Token_Ptr);
end if;
Set_Prefix (Attr_Node, S);
Set_Expressions (Attr_Node, New_List);
T_Left_Paren;
Append (P_Name, Expressions (Attr_Node));
T_Comma;
Append (P_Expression, Expressions (Attr_Node));
T_Right_Paren;
return Attr_Node;
end P_Reduction_Attribute_Reference;
---------------------------------------
-- 4.1.4 Range Attribute Designator --
---------------------------------------
-- Parsed by P_Range_Attribute_Reference (4.4)
---------------------------------------------
-- 4.1.4 (2) Reduction_Attribute_Reference --
---------------------------------------------
-- parsed by P_Reduction_Attribute_Reference
--------------------
-- 4.3 Aggregate --
--------------------
-- AGGREGATE ::= RECORD_AGGREGATE | EXTENSION_AGGREGATE | ARRAY_AGGREGATE
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3), except in the case where
-- an aggregate is known to be required (code statement, extension
-- aggregate), in which cases this routine performs the necessary check
-- that we have an aggregate rather than a parenthesized expression
-- Error recovery: can raise Error_Resync
function P_Aggregate return Node_Id is
Aggr_Sloc : constant Source_Ptr := Token_Ptr;
Aggr_Node : constant Node_Id := P_Aggregate_Or_Paren_Expr;
begin
if Nkind (Aggr_Node) /= N_Aggregate
and then
Nkind (Aggr_Node) /= N_Extension_Aggregate
and then Ada_Version < Ada_2020
then
Error_Msg
("aggregate may not have single positional component", Aggr_Sloc);
return Error;
else
return Aggr_Node;
end if;
end P_Aggregate;
------------------------------------------------
-- 4.3 Aggregate or Parenthesized Expression --
------------------------------------------------
-- This procedure parses out either an aggregate or a parenthesized
-- expression (these two constructs are closely related, since a
-- parenthesized expression looks like an aggregate with a single
-- positional component).
-- AGGREGATE ::=
-- RECORD_AGGREGATE | EXTENSION_AGGREGATE | ARRAY_AGGREGATE
-- RECORD_AGGREGATE ::= (RECORD_COMPONENT_ASSOCIATION_LIST)
-- RECORD_COMPONENT_ASSOCIATION_LIST ::=
-- RECORD_COMPONENT_ASSOCIATION {, RECORD_COMPONENT_ASSOCIATION}
-- | null record
-- RECORD_COMPONENT_ASSOCIATION ::=
-- [COMPONENT_CHOICE_LIST =>] EXPRESSION
-- COMPONENT_CHOICE_LIST ::=
-- component_SELECTOR_NAME {| component_SELECTOR_NAME}
-- | others
-- EXTENSION_AGGREGATE ::=
-- (ANCESTOR_PART with RECORD_COMPONENT_ASSOCIATION_LIST)
-- ANCESTOR_PART ::= EXPRESSION | SUBTYPE_MARK
-- ARRAY_AGGREGATE ::=
-- POSITIONAL_ARRAY_AGGREGATE | NAMED_ARRAY_AGGREGATE
-- POSITIONAL_ARRAY_AGGREGATE ::=
-- (EXPRESSION, EXPRESSION {, EXPRESSION})
-- | (EXPRESSION {, EXPRESSION}, others => EXPRESSION)
-- | (EXPRESSION {, EXPRESSION}, others => <>)
-- NAMED_ARRAY_AGGREGATE ::=
-- (ARRAY_COMPONENT_ASSOCIATION {, ARRAY_COMPONENT_ASSOCIATION})
-- PRIMARY ::= (EXPRESSION);
-- Error recovery: can raise Error_Resync
-- Note: POSITIONAL_ARRAY_AGGREGATE rule has been extended to give support
-- to Ada 2005 limited aggregates (AI-287)
function P_Aggregate_Or_Paren_Expr return Node_Id is
Aggregate_Node : Node_Id;
Expr_List : List_Id;
Assoc_List : List_Id;
Expr_Node : Node_Id;
Lparen_Sloc : Source_Ptr;
Scan_State : Saved_Scan_State;
procedure Box_Error;
-- Called if <> is encountered as positional aggregate element. Issues
-- error message and sets Expr_Node to Error.
function Is_Quantified_Expression return Boolean;
-- The presence of iterated component associations requires a one
-- token lookahead to distinguish it from quantified expressions.
---------------
-- Box_Error --
---------------
procedure Box_Error is
begin
if Ada_Version < Ada_2005 then
Error_Msg_SC ("box in aggregate is an Ada 2005 extension");
end if;
-- Ada 2005 (AI-287): The box notation is allowed only with named
-- notation because positional notation might be error prone. For
-- example, in "(X, <>, Y, <>)", there is no type associated with
-- the boxes, so you might not be leaving out the components you
-- thought you were leaving out.
Error_Msg_SC ("(Ada 2005) box only allowed with named notation");
Scan; -- past box
Expr_Node := Error;
end Box_Error;
------------------------------
-- Is_Quantified_Expression --
------------------------------
function Is_Quantified_Expression return Boolean is
Maybe : Boolean;
Scan_State : Saved_Scan_State;
begin
Save_Scan_State (Scan_State);
Scan; -- past FOR
Maybe := Token = Tok_All or else Token = Tok_Some;
Restore_Scan_State (Scan_State); -- to FOR
return Maybe;
end Is_Quantified_Expression;
Start_Token : constant Token_Type := Token;
-- Used to prevent mismatches (...] and [...)
-- Start of processing for P_Aggregate_Or_Paren_Expr
begin
Lparen_Sloc := Token_Ptr;
if Token = Tok_Left_Bracket then
Scan;
-- Special case for null aggregate in Ada 2020
if Token = Tok_Right_Bracket then
Scan; -- past ]
Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc);
Set_Expressions (Aggregate_Node, New_List);
Set_Is_Homogeneous_Aggregate (Aggregate_Node);
return Aggregate_Node;
end if;
else
T_Left_Paren;
end if;
-- Note on parentheses count. For cases like an if expression, the
-- parens here really count as real parentheses for the paren count,
-- so we adjust the paren count accordingly after scanning the expr.
-- If expression
if Token = Tok_If then
Expr_Node := P_If_Expression;
T_Right_Paren;
Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1);
return Expr_Node;
-- Case expression
elsif Token = Tok_Case then
Expr_Node := P_Case_Expression;
T_Right_Paren;
Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1);
return Expr_Node;
-- Quantified expression
elsif Token = Tok_For and then Is_Quantified_Expression then
Expr_Node := P_Quantified_Expression;
T_Right_Paren;
Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1);
return Expr_Node;
-- Note: the mechanism used here of rescanning the initial expression
-- is distinctly unpleasant, but it saves a lot of fiddling in scanning
-- out the discrete choice list.
-- Deal with expression and extension aggregates first
elsif Token /= Tok_Others then
Save_Scan_State (Scan_State); -- at start of expression
-- Deal with (NULL RECORD)
if Token = Tok_Null then
Scan; -- past NULL
if Token = Tok_Record then
Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc);
Set_Null_Record_Present (Aggregate_Node, True);
Scan; -- past RECORD
T_Right_Paren;
return Aggregate_Node;
else
Restore_Scan_State (Scan_State); -- to NULL that must be expr
end if;
elsif Token = Tok_For then
Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc);
Expr_Node := P_Iterated_Component_Association;
goto Aggregate;
end if;
-- Scan expression, handling box appearing as positional argument
if Token = Tok_Box then
Box_Error;
else
Expr_Node := P_Expression_Or_Range_Attribute_If_OK;
end if;
-- Extension or Delta aggregate
if Token = Tok_With then
if Nkind (Expr_Node) = N_Attribute_Reference
and then Attribute_Name (Expr_Node) = Name_Range
then
Bad_Range_Attribute (Sloc (Expr_Node));
return Error;
end if;
if Ada_Version = Ada_83 then
Error_Msg_SC ("(Ada 83) extension aggregate not allowed");
end if;
Scan; -- past WITH
if Token = Tok_Delta then
Scan; -- past DELTA
Aggregate_Node := New_Node (N_Delta_Aggregate, Lparen_Sloc);
Set_Expression (Aggregate_Node, Expr_Node);
Expr_Node := Empty;
goto Aggregate;
else
Aggregate_Node := New_Node (N_Extension_Aggregate, Lparen_Sloc);
Set_Ancestor_Part (Aggregate_Node, Expr_Node);
end if;
-- Deal with WITH NULL RECORD case
if Token = Tok_Null then
Save_Scan_State (Scan_State); -- at NULL
Scan; -- past NULL
if Token = Tok_Record then
Scan; -- past RECORD
Set_Null_Record_Present (Aggregate_Node, True);
T_Right_Paren;
return Aggregate_Node;
else
Restore_Scan_State (Scan_State); -- to NULL that must be expr
end if;
end if;
if Token /= Tok_Others then
Save_Scan_State (Scan_State);
Expr_Node := P_Expression;
else
Expr_Node := Empty;
end if;
-- Expression
elsif Token = Tok_Right_Paren or else Token in Token_Class_Eterm then
if Nkind (Expr_Node) = N_Attribute_Reference
and then Attribute_Name (Expr_Node) = Name_Range
then
Error_Msg
("|parentheses not allowed for range attribute", Lparen_Sloc);
Scan; -- past right paren
return Expr_Node;
end if;
-- Bump paren count of expression
if Expr_Node /= Error then
Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1);
end if;
T_Right_Paren; -- past right paren (error message if none)
return Expr_Node;
-- Normal aggregate
else
Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc);
end if;
-- Others
else
Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc);
Expr_Node := Empty;
end if;
-- Prepare to scan list of component associations
<<Aggregate>>
Expr_List := No_List; -- don't set yet, maybe all named entries
Assoc_List := No_List; -- don't set yet, maybe all positional entries
-- This loop scans through component associations. On entry to the
-- loop, an expression has been scanned at the start of the current
-- association unless initial token was OTHERS, in which case
-- Expr_Node is set to Empty.
loop
-- Deal with others association first. This is a named association
if No (Expr_Node) then
if No (Assoc_List) then
Assoc_List := New_List;
end if;
Append (P_Record_Or_Array_Component_Association, Assoc_List);
-- Improper use of WITH
elsif Token = Tok_With then
Error_Msg_SC ("WITH must be preceded by single expression in " &
"extension aggregate");
raise Error_Resync;
-- Range attribute can only appear as part of a discrete choice list
elsif Nkind (Expr_Node) = N_Attribute_Reference
and then Attribute_Name (Expr_Node) = Name_Range
and then Token /= Tok_Arrow
and then Token /= Tok_Vertical_Bar
then
Bad_Range_Attribute (Sloc (Expr_Node));
return Error;
-- Assume positional case if comma, right paren, or literal or
-- identifier or OTHERS follows (the latter cases are missing
-- comma cases). Also assume positional if a semicolon follows,
-- which can happen if there are missing parens.
-- In Ada_2012 and Ada_2020 an iterated association can appear.
elsif Nkind (Expr_Node) in
N_Iterated_Component_Association | N_Iterated_Element_Association
then
if No (Assoc_List) then
Assoc_List := New_List (Expr_Node);
else
Append_To (Assoc_List, Expr_Node);
end if;
elsif Token = Tok_Comma
or else Token = Tok_Right_Paren
or else Token = Tok_Others
or else Token in Token_Class_Lit_Or_Name
or else Token = Tok_Semicolon
then
if Present (Assoc_List) then
Error_Msg_BC -- CODEFIX
("""='>"" expected (positional association cannot follow "
& "named association)");
end if;
if No (Expr_List) then
Expr_List := New_List;
end if;
Append (Expr_Node, Expr_List);
-- Check for aggregate followed by left parent, maybe missing comma
elsif Nkind (Expr_Node) = N_Aggregate
and then Token = Tok_Left_Paren
then
T_Comma;
if No (Expr_List) then
Expr_List := New_List;
end if;
Append (Expr_Node, Expr_List);
elsif Token = Tok_Right_Bracket then
if No (Expr_List) then
Expr_List := New_List;
end if;
Append (Expr_Node, Expr_List);
exit;
-- Anything else is assumed to be a named association
else
Restore_Scan_State (Scan_State); -- to start of expression
if No (Assoc_List) then
Assoc_List := New_List;
end if;
Append (P_Record_Or_Array_Component_Association, Assoc_List);
end if;
exit when not Comma_Present;
-- If we are at an expression terminator, something is seriously
-- wrong, so let's get out now, before we start eating up stuff
-- that doesn't belong to us.
if Token in Token_Class_Eterm and then Token /= Tok_For then
Error_Msg_AP
("expecting expression or component association");
exit;
end if;
-- Deal with misused box
if Token = Tok_Box then
Box_Error;
-- Otherwise initiate for reentry to top of loop by scanning an
-- initial expression, unless the first token is OTHERS or FOR,
-- which indicates an iterated component association.
elsif Token = Tok_Others then
Expr_Node := Empty;
elsif Token = Tok_For then
Expr_Node := P_Iterated_Component_Association;
else
Save_Scan_State (Scan_State); -- at start of expression
Expr_Node := P_Expression_Or_Range_Attribute_If_OK;
end if;
end loop;
-- All component associations (positional and named) have been scanned.
-- Scan ] or ) based on Start_Token.
case Start_Token is
when Tok_Left_Bracket =>
Set_Component_Associations (Aggregate_Node, Assoc_List);
Set_Is_Homogeneous_Aggregate (Aggregate_Node);
T_Right_Bracket;
if Token = Tok_Apostrophe then
Scan;
if Token = Tok_Identifier then
return P_Reduction_Attribute_Reference (Aggregate_Node);
end if;
end if;
when Tok_Left_Paren =>
T_Right_Paren;
when others => raise Program_Error;
end case;
if Nkind (Aggregate_Node) /= N_Delta_Aggregate then
Set_Expressions (Aggregate_Node, Expr_List);
end if;
Set_Component_Associations (Aggregate_Node, Assoc_List);
return Aggregate_Node;
end P_Aggregate_Or_Paren_Expr;
------------------------------------------------
-- 4.3 Record or Array Component Association --
------------------------------------------------
-- RECORD_COMPONENT_ASSOCIATION ::=
-- [COMPONENT_CHOICE_LIST =>] EXPRESSION
-- | COMPONENT_CHOICE_LIST => <>
-- COMPONENT_CHOICE_LIST =>
-- component_SELECTOR_NAME {| component_SELECTOR_NAME}
-- | others
-- ARRAY_COMPONENT_ASSOCIATION ::=
-- DISCRETE_CHOICE_LIST => EXPRESSION
-- | DISCRETE_CHOICE_LIST => <>
-- | ITERATED_COMPONENT_ASSOCIATION
-- Note: this routine only handles the named cases, including others.
-- Cases where the component choice list is not present have already
-- been handled directly.
-- Error recovery: can raise Error_Resync
-- Note: RECORD_COMPONENT_ASSOCIATION and ARRAY_COMPONENT_ASSOCIATION
-- rules have been extended to give support to Ada 2005 limited
-- aggregates (AI-287)
function P_Record_Or_Array_Component_Association return Node_Id is
Assoc_Node : Node_Id;
begin
-- A loop indicates an iterated_component_association
if Token = Tok_For then
return P_Iterated_Component_Association;
end if;
Assoc_Node := New_Node (N_Component_Association, Token_Ptr);
Set_Choices (Assoc_Node, P_Discrete_Choice_List);
Set_Sloc (Assoc_Node, Token_Ptr);
TF_Arrow;
if Token = Tok_Box then
-- Ada 2005(AI-287): The box notation is used to indicate the
-- default initialization of aggregate components
if Ada_Version < Ada_2005 then
Error_Msg_SP
("component association with '<'> is an Ada 2005 extension");
Error_Msg_SP ("\unit must be compiled with -gnat05 switch");
end if;
Set_Box_Present (Assoc_Node);
Scan; -- Past box
else
Set_Expression (Assoc_Node, P_Expression);
end if;
return Assoc_Node;
end P_Record_Or_Array_Component_Association;
-----------------------------
-- 4.3.1 Record Aggregate --
-----------------------------
-- Case of enumeration aggregate is parsed by P_Aggregate (4.3)
-- All other cases are parsed by P_Aggregate_Or_Paren_Expr (4.3)
----------------------------------------------
-- 4.3.1 Record Component Association List --
----------------------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
----------------------------------
-- 4.3.1 Component Choice List --
----------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
--------------------------------
-- 4.3.1 Extension Aggregate --
--------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
--------------------------
-- 4.3.1 Ancestor Part --
--------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
----------------------------
-- 4.3.1 Array Aggregate --
----------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
---------------------------------------
-- 4.3.1 Positional Array Aggregate --
---------------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
----------------------------------
-- 4.3.1 Named Array Aggregate --
----------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
----------------------------------------
-- 4.3.1 Array Component Association --
----------------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
---------------------
-- 4.4 Expression --
---------------------
-- This procedure parses EXPRESSION or CHOICE_EXPRESSION
-- EXPRESSION ::=
-- RELATION {LOGICAL_OPERATOR RELATION}
-- CHOICE_EXPRESSION ::=
-- CHOICE_RELATION {LOGICAL_OPERATOR CHOICE_RELATION}
-- LOGICAL_OPERATOR ::= and | and then | or | or else | xor
-- On return, Expr_Form indicates the categorization of the expression
-- EF_Range_Attr is not a possible value (if a range attribute is found,
-- an error message is given, and Error is returned).
-- Error recovery: cannot raise Error_Resync
function P_Expression return Node_Id is
Logical_Op : Node_Kind;
Prev_Logical_Op : Node_Kind;
Op_Location : Source_Ptr;
Node1 : Node_Id;
Node2 : Node_Id;
begin
Node1 := P_Relation;
if Token in Token_Class_Logop then
Prev_Logical_Op := N_Empty;
loop
Op_Location := Token_Ptr;
Logical_Op := P_Logical_Operator;
if Prev_Logical_Op /= N_Empty and then
Logical_Op /= Prev_Logical_Op
then
Error_Msg
("mixed logical operators in expression", Op_Location);
Prev_Logical_Op := N_Empty;
else
Prev_Logical_Op := Logical_Op;
end if;
Node2 := Node1;
Node1 := New_Op_Node (Logical_Op, Op_Location);
Set_Left_Opnd (Node1, Node2);
Set_Right_Opnd (Node1, P_Relation);
-- Check for case of errant comma or semicolon
if Token = Tok_Comma or else Token = Tok_Semicolon then
declare
Com : constant Boolean := Token = Tok_Comma;
Scan_State : Saved_Scan_State;
Logop : Node_Kind;
begin
Save_Scan_State (Scan_State); -- at comma/semicolon
Scan; -- past comma/semicolon
-- Check for AND THEN or OR ELSE after comma/semicolon. We
-- do not deal with AND/OR because those cases get mixed up
-- with the select alternatives case.
if Token = Tok_And or else Token = Tok_Or then
Logop := P_Logical_Operator;
Restore_Scan_State (Scan_State); -- to comma/semicolon
if Logop in N_And_Then | N_Or_Else then
Scan; -- past comma/semicolon
if Com then
Error_Msg_SP -- CODEFIX
("|extra "","" ignored");
else
Error_Msg_SP -- CODEFIX
("|extra "";"" ignored");
end if;
else
Restore_Scan_State (Scan_State); -- to comma/semicolon
end if;
else
Restore_Scan_State (Scan_State); -- to comma/semicolon
end if;
end;
end if;
exit when Token not in Token_Class_Logop;
end loop;
Expr_Form := EF_Non_Simple;
end if;
if Token = Tok_Apostrophe then
Bad_Range_Attribute (Token_Ptr);
return Error;
else
return Node1;
end if;
end P_Expression;
-- This function is identical to the normal P_Expression, except that it
-- also permits the appearance of a case, conditional, or quantified
-- expression if the call immediately follows a left paren, and followed
-- by a right parenthesis. These forms are allowed if these conditions
-- are not met, but an error message will be issued.
function P_Expression_If_OK return Node_Id is
begin
-- Case of conditional, case or quantified expression
if Token = Tok_Case
or else Token = Tok_If
or else Token = Tok_For
or else Token = Tok_Declare
then
return P_Unparen_Cond_Expr_Etc;
-- Normal case, not case/conditional/quantified expression
else
return P_Expression;
end if;
end P_Expression_If_OK;
-- This function is identical to the normal P_Expression, except that it
-- checks that the expression scan did not stop on a right paren. It is
-- called in all contexts where a right parenthesis cannot legitimately
-- follow an expression.
-- Error recovery: cannot raise Error_Resync
function P_Expression_No_Right_Paren return Node_Id is
Expr : constant Node_Id := P_Expression;
begin
Ignore (Tok_Right_Paren);
return Expr;
end P_Expression_No_Right_Paren;
----------------------------------------
-- 4.4 Expression_Or_Range_Attribute --
----------------------------------------
-- EXPRESSION ::=
-- RELATION {and RELATION} | RELATION {and then RELATION}
-- | RELATION {or RELATION} | RELATION {or else RELATION}
-- | RELATION {xor RELATION}
-- RANGE_ATTRIBUTE_REFERENCE ::= PREFIX ' RANGE_ATTRIBUTE_DESIGNATOR
-- RANGE_ATTRIBUTE_DESIGNATOR ::= range [(static_EXPRESSION)]
-- On return, Expr_Form indicates the categorization of the expression
-- and EF_Range_Attr is one of the possibilities.
-- Error recovery: cannot raise Error_Resync
-- In the grammar, a RANGE attribute is simply a name, but its use is
-- highly restricted, so in the parser, we do not regard it as a name.
-- Instead, P_Name returns without scanning the 'RANGE part of the
-- attribute, and P_Expression_Or_Range_Attribute handles the range
-- attribute reference. In the normal case where a range attribute is
-- not allowed, an error message is issued by P_Expression.
function P_Expression_Or_Range_Attribute return Node_Id is
Logical_Op : Node_Kind;
Prev_Logical_Op : Node_Kind;
Op_Location : Source_Ptr;
Node1 : Node_Id;
Node2 : Node_Id;
Attr_Node : Node_Id;
begin
Node1 := P_Relation;
if Token = Tok_Apostrophe then
Attr_Node := P_Range_Attribute_Reference (Node1);
Expr_Form := EF_Range_Attr;
return Attr_Node;
elsif Token in Token_Class_Logop then
Prev_Logical_Op := N_Empty;
loop
Op_Location := Token_Ptr;
Logical_Op := P_Logical_Operator;
if Prev_Logical_Op /= N_Empty and then
Logical_Op /= Prev_Logical_Op
then
Error_Msg
("mixed logical operators in expression", Op_Location);
Prev_Logical_Op := N_Empty;
else
Prev_Logical_Op := Logical_Op;
end if;
Node2 := Node1;
Node1 := New_Op_Node (Logical_Op, Op_Location);
Set_Left_Opnd (Node1, Node2);
Set_Right_Opnd (Node1, P_Relation);
exit when Token not in Token_Class_Logop;
end loop;
Expr_Form := EF_Non_Simple;
end if;
if Token = Tok_Apostrophe then
Bad_Range_Attribute (Token_Ptr);
return Error;
else
return Node1;
end if;
end P_Expression_Or_Range_Attribute;
-- Version that allows a non-parenthesized case, conditional, or quantified
-- expression if the call immediately follows a left paren, and followed
-- by a right parenthesis. These forms are allowed if these conditions
-- are not met, but an error message will be issued.
function P_Expression_Or_Range_Attribute_If_OK return Node_Id is
begin
-- Case of conditional, case or quantified expression
if Token = Tok_Case
or else Token = Tok_If
or else Token = Tok_For
or else Token = Tok_Declare
then
return P_Unparen_Cond_Expr_Etc;
-- Normal case, not one of the above expression types
else
return P_Expression_Or_Range_Attribute;
end if;
end P_Expression_Or_Range_Attribute_If_OK;
-------------------
-- 4.4 Relation --
-------------------
-- This procedure scans both relations and choice relations
-- CHOICE_RELATION ::=
-- SIMPLE_EXPRESSION [RELATIONAL_OPERATOR SIMPLE_EXPRESSION]
-- RELATION ::=
-- SIMPLE_EXPRESSION [not] in MEMBERSHIP_CHOICE_LIST
-- | RAISE_EXPRESSION
-- MEMBERSHIP_CHOICE_LIST ::=
-- MEMBERSHIP_CHOICE {'|' MEMBERSHIP CHOICE}
-- MEMBERSHIP_CHOICE ::=
-- CHOICE_EXPRESSION | RANGE | SUBTYPE_MARK
-- RAISE_EXPRESSION ::= raise exception_NAME [with string_EXPRESSION]
-- On return, Expr_Form indicates the categorization of the expression
-- Note: if Token = Tok_Apostrophe on return, then Expr_Form is set to
-- EF_Simple_Name and the following token is RANGE (range attribute case).
-- Error recovery: cannot raise Error_Resync. If an error occurs within an
-- expression, then tokens are scanned until either a non-expression token,
-- a right paren (not matched by a left paren) or a comma, is encountered.
function P_Relation return Node_Id is
Node1, Node2 : Node_Id;
Optok : Source_Ptr;
begin
-- First check for raise expression
if Token = Tok_Raise then
Expr_Form := EF_Non_Simple;
return P_Raise_Expression;
end if;
-- All other cases
Node1 := P_Simple_Expression;
if Token not in Token_Class_Relop then
return Node1;
else
-- Here we have a relational operator following. If so then scan it
-- out. Note that the assignment symbol := is treated as a relational
-- operator to improve the error recovery when it is misused for =.
-- P_Relational_Operator also parses the IN and NOT IN operations.
Optok := Token_Ptr;
Node2 := New_Op_Node (P_Relational_Operator, Optok);
Set_Left_Opnd (Node2, Node1);
-- Case of IN or NOT IN
if Prev_Token = Tok_In then
P_Membership_Test (Node2);
-- Case of relational operator (= /= < <= > >=)
else
Set_Right_Opnd (Node2, P_Simple_Expression);
end if;
Expr_Form := EF_Non_Simple;
if Token in Token_Class_Relop then
Error_Msg_SC ("unexpected relational operator");
raise Error_Resync;
end if;
return Node2;
end if;
-- If any error occurs, then scan to the next expression terminator symbol
-- or comma or right paren at the outer (i.e. current) parentheses level.
-- The flags are set to indicate a normal simple expression.
exception
when Error_Resync =>
Resync_Expression;
Expr_Form := EF_Simple;
return Error;
end P_Relation;
----------------------------
-- 4.4 Simple Expression --
----------------------------
-- SIMPLE_EXPRESSION ::=
-- [UNARY_ADDING_OPERATOR] TERM {BINARY_ADDING_OPERATOR TERM}
-- On return, Expr_Form indicates the categorization of the expression
-- Note: if Token = Tok_Apostrophe on return, then Expr_Form is set to
-- EF_Simple_Name and the following token is RANGE (range attribute case).
-- Error recovery: cannot raise Error_Resync. If an error occurs within an
-- expression, then tokens are scanned until either a non-expression token,
-- a right paren (not matched by a left paren) or a comma, is encountered.
-- Note: P_Simple_Expression is called only internally by higher level
-- expression routines. In cases in the grammar where a simple expression
-- is required, the approach is to scan an expression, and then post an
-- appropriate error message if the expression obtained is not simple. This
-- gives better error recovery and treatment.
function P_Simple_Expression return Node_Id is
Scan_State : Saved_Scan_State;
Node1 : Node_Id;
Node2 : Node_Id;
Tokptr : Source_Ptr;
function At_Start_Of_Attribute return Boolean;
-- Tests if we have quote followed by attribute name, if so, return True
-- otherwise return False.
---------------------------
-- At_Start_Of_Attribute --
---------------------------
function At_Start_Of_Attribute return Boolean is
begin
if Token /= Tok_Apostrophe then
return False;
else
declare
Scan_State : Saved_Scan_State;
begin
Save_Scan_State (Scan_State);
Scan; -- past quote
if Token = Tok_Identifier
and then Is_Attribute_Name (Chars (Token_Node))
then
Restore_Scan_State (Scan_State);
return True;
else
Restore_Scan_State (Scan_State);
return False;
end if;
end;
end if;
end At_Start_Of_Attribute;
-- Start of processing for P_Simple_Expression
begin
-- Check for cases starting with a name. There are two reasons for
-- special casing. First speed things up by catching a common case
-- without going through several routine layers. Second the caller must
-- be informed via Expr_Form when the simple expression is a name.
if Token in Token_Class_Name then
Node1 := P_Name;
-- Deal with apostrophe cases
if Token = Tok_Apostrophe then
Save_Scan_State (Scan_State); -- at apostrophe
Scan; -- past apostrophe
-- If qualified expression, scan it out and fall through
if Token = Tok_Left_Paren then
Node1 := P_Qualified_Expression (Node1);
Expr_Form := EF_Simple;
-- If range attribute, then we return with Token pointing to the
-- apostrophe. Note: avoid the normal error check on exit. We
-- know that the expression really is complete in this case.
else -- Token = Tok_Range then
Restore_Scan_State (Scan_State); -- to apostrophe
Expr_Form := EF_Simple_Name;
return Node1;
end if;
end if;
-- If an expression terminator follows, the previous processing
-- completely scanned out the expression (a common case), and
-- left Expr_Form set appropriately for returning to our caller.
if Token in Token_Class_Sterm then
null;
-- If we do not have an expression terminator, then complete the
-- scan of a simple expression. This code duplicates the code
-- found in P_Term and P_Factor.
else
if Token = Tok_Double_Asterisk then
if Style_Check then
Style.Check_Exponentiation_Operator;
end if;
Node2 := New_Op_Node (N_Op_Expon, Token_Ptr);
Scan; -- past **
Set_Left_Opnd (Node2, Node1);
Set_Right_Opnd (Node2, P_Primary);
Check_Bad_Exp;
Node1 := Node2;
end if;
loop
exit when Token not in Token_Class_Mulop;
Tokptr := Token_Ptr;
Node2 := New_Op_Node (P_Multiplying_Operator, Tokptr);
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past operator
Set_Left_Opnd (Node2, Node1);
Set_Right_Opnd (Node2, P_Factor);
Node1 := Node2;
end loop;
loop
exit when Token not in Token_Class_Binary_Addop;
Tokptr := Token_Ptr;
Node2 := New_Op_Node (P_Binary_Adding_Operator, Tokptr);
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past operator
Set_Left_Opnd (Node2, Node1);
Set_Right_Opnd (Node2, P_Term);
Node1 := Node2;
end loop;
Expr_Form := EF_Simple;
end if;
-- Cases where simple expression does not start with a name
else
-- Scan initial sign and initial Term
if Token in Token_Class_Unary_Addop then
Tokptr := Token_Ptr;
Node1 := New_Op_Node (P_Unary_Adding_Operator, Tokptr);
if Style_Check then
Style.Check_Unary_Plus_Or_Minus (Inside_Depends);
end if;
Scan; -- past operator
Set_Right_Opnd (Node1, P_Term);
else
Node1 := P_Term;
end if;
-- In the following, we special-case a sequence of concatenations of
-- string literals, such as "aaa" & "bbb" & ... & "ccc", with nothing
-- else mixed in. For such a sequence, we return a tree representing
-- "" & "aaabbb...ccc" (a single concatenation). This is done only if
-- the number of concatenations is large. If semantic analysis
-- resolves the "&" to a predefined one, then this folding gives the
-- right answer. Otherwise, semantic analysis will complain about a
-- capacity-exceeded error. The purpose of this trick is to avoid
-- creating a deeply nested tree, which would cause deep recursion
-- during semantics, causing stack overflow. This way, we can handle
-- enormous concatenations in the normal case of predefined "&". We
-- first build up the normal tree, and then rewrite it if
-- appropriate.
declare
Num_Concats_Threshold : constant Positive := 1000;
-- Arbitrary threshold value to enable optimization
First_Node : constant Node_Id := Node1;
Is_Strlit_Concat : Boolean;
-- True iff we've parsed a sequence of concatenations of string
-- literals, with nothing else mixed in.
Num_Concats : Natural;
-- Number of "&" operators if Is_Strlit_Concat is True
begin
Is_Strlit_Concat :=
Nkind (Node1) = N_String_Literal
and then Token = Tok_Ampersand;
Num_Concats := 0;
-- Scan out sequence of terms separated by binary adding operators
loop
exit when Token not in Token_Class_Binary_Addop;
Tokptr := Token_Ptr;
Node2 := New_Op_Node (P_Binary_Adding_Operator, Tokptr);
if Style_Check and then not Debug_Flag_Dot_QQ then
Style.Check_Binary_Operator;
end if;
Scan; -- past operator
Set_Left_Opnd (Node2, Node1);
Node1 := P_Term;
Set_Right_Opnd (Node2, Node1);
-- Check if we're still concatenating string literals
Is_Strlit_Concat :=
Is_Strlit_Concat
and then Nkind (Node2) = N_Op_Concat
and then Nkind (Node1) = N_String_Literal;
if Is_Strlit_Concat then
Num_Concats := Num_Concats + 1;
end if;
Node1 := Node2;
end loop;
-- If we have an enormous series of concatenations of string
-- literals, rewrite as explained above. The Is_Folded_In_Parser
-- flag tells semantic analysis that if the "&" is not predefined,
-- the folded value is wrong.
if Is_Strlit_Concat
and then Num_Concats >= Num_Concats_Threshold
then
declare
Empty_String_Val : String_Id;
-- String_Id for ""
Strlit_Concat_Val : String_Id;
-- Contains the folded value (which will be correct if the
-- "&" operators are the predefined ones).
Cur_Node : Node_Id;
-- For walking up the tree
New_Node : Node_Id;
-- Folded node to replace Node1
Loc : constant Source_Ptr := Sloc (First_Node);
begin
-- Walk up the tree starting at the leftmost string literal
-- (First_Node), building up the Strlit_Concat_Val as we
-- go. Note that we do not use recursion here -- the whole
-- point is to avoid recursively walking that enormous tree.
Start_String;
Store_String_Chars (Strval (First_Node));
Cur_Node := Parent (First_Node);
while Present (Cur_Node) loop
pragma Assert (Nkind (Cur_Node) = N_Op_Concat and then
Nkind (Right_Opnd (Cur_Node)) = N_String_Literal);
Store_String_Chars (Strval (Right_Opnd (Cur_Node)));
Cur_Node := Parent (Cur_Node);
end loop;
Strlit_Concat_Val := End_String;
-- Create new folded node, and rewrite result with a concat-
-- enation of an empty string literal and the folded node.
Start_String;
Empty_String_Val := End_String;
New_Node :=
Make_Op_Concat (Loc,
Make_String_Literal (Loc, Empty_String_Val),
Make_String_Literal (Loc, Strlit_Concat_Val,
Is_Folded_In_Parser => True));
Rewrite (Node1, New_Node);
end;
end if;
end;
-- All done, we clearly do not have name or numeric literal so this
-- is a case of a simple expression which is some other possibility.
Expr_Form := EF_Simple;
end if;
-- Come here at end of simple expression, where we do a couple of
-- special checks to improve error recovery.
-- Special test to improve error recovery. If the current token is a
-- period, then someone is trying to do selection on something that is
-- not a name, e.g. a qualified expression.
if Token = Tok_Dot then
Error_Msg_SC ("prefix for selection is not a name");
-- If qualified expression, comment and continue, otherwise something
-- is pretty nasty so do an Error_Resync call.
if Ada_Version < Ada_2012
and then Nkind (Node1) = N_Qualified_Expression
then
Error_Msg_SC ("\would be legal in Ada 2012 mode");
else
raise Error_Resync;
end if;
end if;
-- Special test to improve error recovery: If the current token is
-- not the first token on a line (as determined by checking the
-- previous token position with the start of the current line),
-- then we insist that we have an appropriate terminating token.
-- Consider the following two examples:
-- 1) if A nad B then ...
-- 2) A := B
-- C := D
-- In the first example, we would like to issue a binary operator
-- expected message and resynchronize to the then. In the second
-- example, we do not want to issue a binary operator message, so
-- that instead we will get the missing semicolon message. This
-- distinction is of course a heuristic which does not always work,
-- but in practice it is quite effective.
-- Note: the one case in which we do not go through this circuit is
-- when we have scanned a range attribute and want to return with
-- Token pointing to the apostrophe. The apostrophe is not normally
-- an expression terminator, and is not in Token_Class_Sterm, but
-- in this special case we know that the expression is complete.
if not Token_Is_At_Start_Of_Line
and then Token not in Token_Class_Sterm
then
-- Normally the right error message is indeed that we expected a
-- binary operator, but in the case of being between a right and left
-- paren, e.g. in an aggregate, a more likely error is missing comma.
if Prev_Token = Tok_Right_Paren and then Token = Tok_Left_Paren then
T_Comma;
-- And if we have a quote, we may have a bad attribute
elsif At_Start_Of_Attribute then
Error_Msg_SC ("prefix of attribute must be a name");
if Ada_Version >= Ada_2012 then
Error_Msg_SC ("\qualify expression to turn it into a name");
end if;
-- Normal case for binary operator expected message
else
Error_Msg_AP ("binary operator expected");
end if;
raise Error_Resync;
else
return Node1;
end if;
-- If any error occurs, then scan to next expression terminator symbol
-- or comma, right paren or vertical bar at the outer (i.e. current) paren
-- level. Expr_Form is set to indicate a normal simple expression.
exception
when Error_Resync =>
Resync_Expression;
Expr_Form := EF_Simple;
return Error;
end P_Simple_Expression;
-----------------------------------------------
-- 4.4 Simple Expression or Range Attribute --
-----------------------------------------------
-- SIMPLE_EXPRESSION ::=
-- [UNARY_ADDING_OPERATOR] TERM {BINARY_ADDING_OPERATOR TERM}
-- RANGE_ATTRIBUTE_REFERENCE ::= PREFIX ' RANGE_ATTRIBUTE_DESIGNATOR
-- RANGE_ATTRIBUTE_DESIGNATOR ::= range [(static_EXPRESSION)]
-- Error recovery: cannot raise Error_Resync
function P_Simple_Expression_Or_Range_Attribute return Node_Id is
Sexpr : Node_Id;
Attr_Node : Node_Id;
begin
-- We don't just want to roar ahead and call P_Simple_Expression
-- here, since we want to handle the case of a parenthesized range
-- attribute cleanly.
if Token = Tok_Left_Paren then
declare
Lptr : constant Source_Ptr := Token_Ptr;
Scan_State : Saved_Scan_State;
begin
Save_Scan_State (Scan_State);
Scan; -- past left paren
Sexpr := P_Simple_Expression;
if Token = Tok_Apostrophe then
Attr_Node := P_Range_Attribute_Reference (Sexpr);
Expr_Form := EF_Range_Attr;
if Token = Tok_Right_Paren then
Scan; -- scan past right paren if present
end if;
Error_Msg ("parentheses not allowed for range attribute", Lptr);
return Attr_Node;
end if;
Restore_Scan_State (Scan_State);
end;
end if;
-- Here after dealing with parenthesized range attribute
Sexpr := P_Simple_Expression;
if Token = Tok_Apostrophe then
Attr_Node := P_Range_Attribute_Reference (Sexpr);
Expr_Form := EF_Range_Attr;
return Attr_Node;
else
return Sexpr;
end if;
end P_Simple_Expression_Or_Range_Attribute;
---------------
-- 4.4 Term --
---------------
-- TERM ::= FACTOR {MULTIPLYING_OPERATOR FACTOR}
-- Error recovery: can raise Error_Resync
function P_Term return Node_Id is
Node1, Node2 : Node_Id;
Tokptr : Source_Ptr;
begin
Node1 := P_Factor;
loop
exit when Token not in Token_Class_Mulop;
Tokptr := Token_Ptr;
Node2 := New_Op_Node (P_Multiplying_Operator, Tokptr);
if Style_Check and then not Debug_Flag_Dot_QQ then
Style.Check_Binary_Operator;
end if;
Scan; -- past operator
Set_Left_Opnd (Node2, Node1);
Set_Right_Opnd (Node2, P_Factor);
Node1 := Node2;
end loop;
return Node1;
end P_Term;
-----------------
-- 4.4 Factor --
-----------------
-- FACTOR ::= PRIMARY [** PRIMARY] | abs PRIMARY | not PRIMARY
-- Error recovery: can raise Error_Resync
function P_Factor return Node_Id is
Node1 : Node_Id;
Node2 : Node_Id;
begin
if Token = Tok_Abs then
Node1 := New_Op_Node (N_Op_Abs, Token_Ptr);
if Style_Check then
Style.Check_Abs_Not;
end if;
Scan; -- past ABS
Set_Right_Opnd (Node1, P_Primary);
return Node1;
elsif Token = Tok_Not then
Node1 := New_Op_Node (N_Op_Not, Token_Ptr);
if Style_Check then
Style.Check_Abs_Not;
end if;
Scan; -- past NOT
Set_Right_Opnd (Node1, P_Primary);
return Node1;
else
Node1 := P_Primary;
if Token = Tok_Double_Asterisk then
Node2 := New_Op_Node (N_Op_Expon, Token_Ptr);
Scan; -- past **
Set_Left_Opnd (Node2, Node1);
Set_Right_Opnd (Node2, P_Primary);
Check_Bad_Exp;
return Node2;
else
return Node1;
end if;
end if;
end P_Factor;
------------------
-- 4.4 Primary --
------------------
-- PRIMARY ::=
-- NUMERIC_LITERAL | null
-- | STRING_LITERAL | AGGREGATE
-- | NAME | QUALIFIED_EXPRESSION
-- | ALLOCATOR | (EXPRESSION) | QUANTIFIED_EXPRESSION
-- | REDUCTION_ATTRIBUTE_REFERENCE
-- Error recovery: can raise Error_Resync
function P_Primary return Node_Id is
Scan_State : Saved_Scan_State;
Node1 : Node_Id;
Lparen : constant Boolean := Prev_Token = Tok_Left_Paren;
-- Remember if previous token is a left parenthesis. This is used to
-- deal with checking whether IF/CASE/FOR expressions appearing as
-- primaries require extra parenthesization.
begin
-- The loop runs more than once only if misplaced pragmas are found
-- or if a misplaced unary minus is skipped.
loop
case Token is
-- Name token can start a name, call or qualified expression, all
-- of which are acceptable possibilities for primary. Note also
-- that string literal is included in name (as operator symbol)
-- and type conversion is included in name (as indexed component).
when Tok_Char_Literal
| Tok_Identifier
| Tok_Operator_Symbol
=>
Node1 := P_Name;
-- All done unless apostrophe follows
if Token /= Tok_Apostrophe then
return Node1;
-- Apostrophe following means that we have either just parsed
-- the subtype mark of a qualified expression, or the prefix
-- or a range attribute.
else -- Token = Tok_Apostrophe
Save_Scan_State (Scan_State); -- at apostrophe
Scan; -- past apostrophe
-- If range attribute, then this is always an error, since
-- the only legitimate case (where the scanned expression is
-- a qualified simple name) is handled at the level of the
-- Simple_Expression processing. This case corresponds to a
-- usage such as 3 + A'Range, which is always illegal.
if Token = Tok_Range then
Restore_Scan_State (Scan_State); -- to apostrophe
Bad_Range_Attribute (Token_Ptr);
return Error;
-- If left paren, then we have a qualified expression.
-- Note that P_Name guarantees that in this case, where
-- Token = Tok_Apostrophe on return, the only two possible
-- tokens following the apostrophe are left paren and
-- RANGE, so we know we have a left paren here.
else -- Token = Tok_Left_Paren
return P_Qualified_Expression (Node1);
end if;
end if;
-- Numeric or string literal
when Tok_Integer_Literal
| Tok_Real_Literal
| Tok_String_Literal
=>
Node1 := Token_Node;
Scan; -- past number
return Node1;
-- Left paren, starts aggregate or parenthesized expression
when Tok_Left_Paren =>
declare
Expr : constant Node_Id := P_Aggregate_Or_Paren_Expr;
begin
if Nkind (Expr) = N_Attribute_Reference
and then Attribute_Name (Expr) = Name_Range
then
Bad_Range_Attribute (Sloc (Expr));
end if;
return Expr;
end;
when Tok_Left_Bracket =>
return P_Aggregate;
-- Allocator
when Tok_New =>
return P_Allocator;
-- Null
when Tok_Null =>
Scan; -- past NULL
return New_Node (N_Null, Prev_Token_Ptr);
-- Pragma, not allowed here, so just skip past it
when Tok_Pragma =>
P_Pragmas_Misplaced;
-- Deal with IF (possible unparenthesized if expression)
when Tok_If =>
-- If this looks like a real if, defined as an IF appearing at
-- the start of a new line, then we consider we have a missing
-- operand. If in Ada 2012 and the IF is not properly indented
-- for a statement, we prefer to issue a message about an ill-
-- parenthesized if expression.
if Token_Is_At_Start_Of_Line
and then not
(Ada_Version >= Ada_2012
and then Style_Check_Indentation /= 0
and then Start_Column rem Style_Check_Indentation /= 0)
then
Error_Msg_AP ("missing operand");
return Error;
-- If this looks like an if expression, then treat it that way
-- with an error message if not explicitly surrounded by
-- parentheses.
elsif Ada_Version >= Ada_2012 then
Node1 := P_If_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg
("if expression must be parenthesized", Sloc (Node1));
end if;
return Node1;
-- Otherwise treat as misused identifier
else
return P_Identifier;
end if;
-- Deal with CASE (possible unparenthesized case expression)
when Tok_Case =>
-- If this looks like a real case, defined as a CASE appearing
-- the start of a new line, then we consider we have a missing
-- operand. If in Ada 2012 and the CASE is not properly
-- indented for a statement, we prefer to issue a message about
-- an ill-parenthesized case expression.
if Token_Is_At_Start_Of_Line
and then not
(Ada_Version >= Ada_2012
and then Style_Check_Indentation /= 0
and then Start_Column rem Style_Check_Indentation /= 0)
then
Error_Msg_AP ("missing operand");
return Error;
-- If this looks like a case expression, then treat it that way
-- with an error message if not within parentheses.
elsif Ada_Version >= Ada_2012 then
Node1 := P_Case_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg
("case expression must be parenthesized", Sloc (Node1));
end if;
return Node1;
-- Otherwise treat as misused identifier
else
return P_Identifier;
end if;
-- For [all | some] indicates a quantified expression
when Tok_For =>
if Token_Is_At_Start_Of_Line then
Error_Msg_AP ("misplaced loop");
return Error;
elsif Ada_Version >= Ada_2012 then
Save_Scan_State (Scan_State);
Scan; -- past FOR
if Token = Tok_All or else Token = Tok_Some then
Restore_Scan_State (Scan_State); -- To FOR
Node1 := P_Quantified_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg
("quantified expression must be parenthesized",
Sloc (Node1));
end if;
else
Restore_Scan_State (Scan_State); -- To FOR
Node1 := P_Iterated_Component_Association;
end if;
return Node1;
-- Otherwise treat as misused identifier
else
return P_Identifier;
end if;
-- Minus may well be an improper attempt at a unary minus. Give
-- a message, skip the minus and keep going.
when Tok_Minus =>
Error_Msg_SC ("parentheses required for unary minus");
Scan; -- past minus
when Tok_At_Sign => -- AI12-0125 : target_name
if Ada_Version < Ada_2020 then
Error_Msg_SC ("target name is an Ada 202x feature");
Error_Msg_SC ("\compile with -gnat2020");
end if;
Node1 := P_Name;
return Node1;
-- Anything else is illegal as the first token of a primary, but
-- we test for some common errors, to improve error messages.
when others =>
if Is_Reserved_Identifier then
return P_Identifier;
elsif Prev_Token = Tok_Comma then
Error_Msg_SP -- CODEFIX
("|extra "","" ignored");
raise Error_Resync;
else
Error_Msg_AP ("missing operand");
raise Error_Resync;
end if;
end case;
end loop;
end P_Primary;
-------------------------------
-- 4.4 Quantified_Expression --
-------------------------------
-- QUANTIFIED_EXPRESSION ::=
-- for QUANTIFIER LOOP_PARAMETER_SPECIFICATION => PREDICATE |
-- for QUANTIFIER ITERATOR_SPECIFICATION => PREDICATE
function P_Quantified_Expression return Node_Id is
I_Spec : Node_Id;
Node1 : Node_Id;
begin
Error_Msg_Ada_2012_Feature ("quantified expression", Token_Ptr);
Scan; -- past FOR
Node1 := New_Node (N_Quantified_Expression, Prev_Token_Ptr);
if Token = Tok_All then
Set_All_Present (Node1);
elsif Token /= Tok_Some then
Error_Msg_AP ("missing quantifier");
raise Error_Resync;
end if;
Scan; -- past ALL or SOME
I_Spec := P_Loop_Parameter_Specification;
if Nkind (I_Spec) = N_Loop_Parameter_Specification then
Set_Loop_Parameter_Specification (Node1, I_Spec);
else
Set_Iterator_Specification (Node1, I_Spec);
end if;
if Token = Tok_Arrow then
Scan;
Set_Condition (Node1, P_Expression);
return Node1;
else
Error_Msg_AP ("missing arrow");
raise Error_Resync;
end if;
end P_Quantified_Expression;
---------------------------
-- 4.5 Logical Operator --
---------------------------
-- LOGICAL_OPERATOR ::= and | or | xor
-- Note: AND THEN and OR ELSE are also treated as logical operators
-- by the parser (even though they are not operators semantically)
-- The value returned is the appropriate Node_Kind code for the operator
-- On return, Token points to the token following the scanned operator.
-- The caller has checked that the first token is a legitimate logical
-- operator token (i.e. is either XOR, AND, OR).
-- Error recovery: cannot raise Error_Resync
function P_Logical_Operator return Node_Kind is
begin
if Token = Tok_And then
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past AND
if Token = Tok_Then then
Scan; -- past THEN
return N_And_Then;
else
return N_Op_And;
end if;
elsif Token = Tok_Or then
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past OR
if Token = Tok_Else then
Scan; -- past ELSE
return N_Or_Else;
else
return N_Op_Or;
end if;
else -- Token = Tok_Xor
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past XOR
return N_Op_Xor;
end if;
end P_Logical_Operator;
------------------------------
-- 4.5 Relational Operator --
------------------------------
-- RELATIONAL_OPERATOR ::= = | /= | < | <= | > | >=
-- The value returned is the appropriate Node_Kind code for the operator.
-- On return, Token points to the operator token, NOT past it.
-- The caller has checked that the first token is a legitimate relational
-- operator token (i.e. is one of the operator tokens listed above).
-- Error recovery: cannot raise Error_Resync
function P_Relational_Operator return Node_Kind is
Op_Kind : Node_Kind;
Relop_Node : constant array (Token_Class_Relop) of Node_Kind :=
(Tok_Less => N_Op_Lt,
Tok_Equal => N_Op_Eq,
Tok_Greater => N_Op_Gt,
Tok_Not_Equal => N_Op_Ne,
Tok_Greater_Equal => N_Op_Ge,
Tok_Less_Equal => N_Op_Le,
Tok_In => N_In,
Tok_Not => N_Not_In,
Tok_Box => N_Op_Ne);
begin
if Token = Tok_Box then
Error_Msg_SC -- CODEFIX
("|""'<'>"" should be ""/=""");
end if;
Op_Kind := Relop_Node (Token);
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past operator token
-- Deal with NOT IN, if previous token was NOT, we must have IN now
if Prev_Token = Tok_Not then
-- Style check, for NOT IN, we require one space between NOT and IN
if Style_Check and then Token = Tok_In then
Style.Check_Not_In;
end if;
T_In;
end if;
return Op_Kind;
end P_Relational_Operator;
---------------------------------
-- 4.5 Binary Adding Operator --
---------------------------------
-- BINARY_ADDING_OPERATOR ::= + | - | &
-- The value returned is the appropriate Node_Kind code for the operator.
-- On return, Token points to the operator token (NOT past it).
-- The caller has checked that the first token is a legitimate adding
-- operator token (i.e. is one of the operator tokens listed above).
-- Error recovery: cannot raise Error_Resync
function P_Binary_Adding_Operator return Node_Kind is
Addop_Node : constant array (Token_Class_Binary_Addop) of Node_Kind :=
(Tok_Ampersand => N_Op_Concat,
Tok_Minus => N_Op_Subtract,
Tok_Plus => N_Op_Add);
begin
return Addop_Node (Token);
end P_Binary_Adding_Operator;
--------------------------------
-- 4.5 Unary Adding Operator --
--------------------------------
-- UNARY_ADDING_OPERATOR ::= + | -
-- The value returned is the appropriate Node_Kind code for the operator.
-- On return, Token points to the operator token (NOT past it).
-- The caller has checked that the first token is a legitimate adding
-- operator token (i.e. is one of the operator tokens listed above).
-- Error recovery: cannot raise Error_Resync
function P_Unary_Adding_Operator return Node_Kind is
Addop_Node : constant array (Token_Class_Unary_Addop) of Node_Kind :=
(Tok_Minus => N_Op_Minus,
Tok_Plus => N_Op_Plus);
begin
return Addop_Node (Token);
end P_Unary_Adding_Operator;
-------------------------------
-- 4.5 Multiplying Operator --
-------------------------------
-- MULTIPLYING_OPERATOR ::= * | / | mod | rem
-- The value returned is the appropriate Node_Kind code for the operator.
-- On return, Token points to the operator token (NOT past it).
-- The caller has checked that the first token is a legitimate multiplying
-- operator token (i.e. is one of the operator tokens listed above).
-- Error recovery: cannot raise Error_Resync
function P_Multiplying_Operator return Node_Kind is
Mulop_Node : constant array (Token_Class_Mulop) of Node_Kind :=
(Tok_Asterisk => N_Op_Multiply,
Tok_Mod => N_Op_Mod,
Tok_Rem => N_Op_Rem,
Tok_Slash => N_Op_Divide);
begin
return Mulop_Node (Token);
end P_Multiplying_Operator;
--------------------------------------
-- 4.5 Highest Precedence Operator --
--------------------------------------
-- Parsed by P_Factor (4.4)
-- Note: this rule is not in fact used by the grammar at any point
--------------------------
-- 4.6 Type Conversion --
--------------------------
-- Parsed by P_Primary as a Name (4.1)
-------------------------------
-- 4.7 Qualified Expression --
-------------------------------
-- QUALIFIED_EXPRESSION ::=
-- SUBTYPE_MARK ' (EXPRESSION) | SUBTYPE_MARK ' AGGREGATE
-- The caller has scanned the name which is the Subtype_Mark parameter
-- and scanned past the single quote following the subtype mark. The
-- caller has not checked that this name is in fact appropriate for
-- a subtype mark name (i.e. it is a selected component or identifier).
-- Error_Recovery: cannot raise Error_Resync
function P_Qualified_Expression (Subtype_Mark : Node_Id) return Node_Id is
Qual_Node : Node_Id;
begin
Qual_Node := New_Node (N_Qualified_Expression, Prev_Token_Ptr);
Set_Subtype_Mark (Qual_Node, Check_Subtype_Mark (Subtype_Mark));
Set_Expression (Qual_Node, P_Aggregate_Or_Paren_Expr);
return Qual_Node;
end P_Qualified_Expression;
--------------------
-- 4.8 Allocator --
--------------------
-- ALLOCATOR ::=
-- new [SUBPOOL_SPECIFICATION] SUBTYPE_INDICATION
-- | new [SUBPOOL_SPECIFICATION] QUALIFIED_EXPRESSION
--
-- SUBPOOL_SPECIFICATION ::= (subpool_handle_NAME)
-- The caller has checked that the initial token is NEW
-- Error recovery: can raise Error_Resync
function P_Allocator return Node_Id is
Alloc_Node : Node_Id;
Type_Node : Node_Id;
Null_Exclusion_Present : Boolean;
begin
Alloc_Node := New_Node (N_Allocator, Token_Ptr);
T_New;
-- Scan subpool_specification if present (Ada 2012 (AI05-0111-3))
-- Scan Null_Exclusion if present (Ada 2005 (AI-231))
if Token = Tok_Left_Paren then
Scan; -- past (
Set_Subpool_Handle_Name (Alloc_Node, P_Name);
T_Right_Paren;
Error_Msg_Ada_2012_Feature
("|subpool specification",
Sloc (Subpool_Handle_Name (Alloc_Node)));
end if;
Null_Exclusion_Present := P_Null_Exclusion;
Set_Null_Exclusion_Present (Alloc_Node, Null_Exclusion_Present);
Type_Node := P_Subtype_Mark_Resync;
if Token = Tok_Apostrophe then
Scan; -- past apostrophe
Set_Expression (Alloc_Node, P_Qualified_Expression (Type_Node));
else
Set_Expression
(Alloc_Node,
P_Subtype_Indication (Type_Node, Null_Exclusion_Present));
-- AI05-0104: An explicit null exclusion is not allowed for an
-- allocator without initialization. In previous versions of the
-- language it just raises constraint error.
if Ada_Version >= Ada_2012 and then Null_Exclusion_Present then
Error_Msg_N
("an allocator with a subtype indication "
& "cannot have a null exclusion", Alloc_Node);
end if;
end if;
return Alloc_Node;
end P_Allocator;
-----------------------
-- P_Case_Expression --
-----------------------
function P_Case_Expression return Node_Id is
Loc : constant Source_Ptr := Token_Ptr;
Case_Node : Node_Id;
Save_State : Saved_Scan_State;
begin
Error_Msg_Ada_2012_Feature ("|case expression", Token_Ptr);
Scan; -- past CASE
Case_Node :=
Make_Case_Expression (Loc,
Expression => P_Expression_No_Right_Paren,
Alternatives => New_List);
T_Is;
-- We now have scanned out CASE expression IS, scan alternatives
loop
T_When;
Append_To (Alternatives (Case_Node), P_Case_Expression_Alternative);
-- Missing comma if WHEN (more alternatives present)
if Token = Tok_When then
T_Comma;
-- A semicolon followed by "when" is probably meant to be a comma
elsif Token = Tok_Semicolon then
Save_Scan_State (Save_State);
Scan; -- past the semicolon
if Token /= Tok_When then
Restore_Scan_State (Save_State);
exit;
end if;
Error_Msg_SP -- CODEFIX
("|"";"" should be "",""");
-- If comma/WHEN, skip comma and we have another alternative
elsif Token = Tok_Comma then
Save_Scan_State (Save_State);
Scan; -- past comma
if Token /= Tok_When then
Restore_Scan_State (Save_State);
exit;
end if;
-- If no comma or WHEN, definitely done
else
exit;
end if;
end loop;
-- If we have an END CASE, diagnose as not needed
if Token = Tok_End then
Error_Msg_SC ("`END CASE` not allowed at end of case expression");
Scan; -- past END
if Token = Tok_Case then
Scan; -- past CASE;
end if;
end if;
-- Return the Case_Expression node
return Case_Node;
end P_Case_Expression;
-----------------------------------
-- P_Case_Expression_Alternative --
-----------------------------------
-- CASE_STATEMENT_ALTERNATIVE ::=
-- when DISCRETE_CHOICE_LIST =>
-- EXPRESSION
-- The caller has checked that and scanned past the initial WHEN token
-- Error recovery: can raise Error_Resync
function P_Case_Expression_Alternative return Node_Id is
Case_Alt_Node : Node_Id;
begin
Case_Alt_Node := New_Node (N_Case_Expression_Alternative, Token_Ptr);
Set_Discrete_Choices (Case_Alt_Node, P_Discrete_Choice_List);
TF_Arrow;
Set_Expression (Case_Alt_Node, P_Expression);
return Case_Alt_Node;
end P_Case_Expression_Alternative;
--------------------------------------
-- P_Iterated_Component_Association --
--------------------------------------
-- ITERATED_COMPONENT_ASSOCIATION ::=
-- for DEFINING_IDENTIFIER in DISCRETE_CHOICE_LIST => EXPRESSION
-- for ITERATOR_SPECIFICATION => EXPRESSION
function P_Iterated_Component_Association return Node_Id is
Assoc_Node : Node_Id;
Choice : Node_Id;
Id : Node_Id;
Iter_Spec : Node_Id;
Loop_Spec : Node_Id;
State : Saved_Scan_State;
-- Start of processing for P_Iterated_Component_Association
begin
Scan; -- past FOR
Save_Scan_State (State);
-- A lookahead is necessary to differentiate between the
-- Ada 2012 form with a choice list, and the Ada 202x element
-- iterator form, recognized by the presence of "OF". Other
-- disambiguation requires context and is done during semantic
-- analysis. Note that "for X in E" is syntactically ambiguous:
-- if E is a subtype indication this is a loop parameter spec,
-- while if E a name it is an iterator_specification, and the
-- disambiguation takes place during semantic analysis.
-- In addition, if "use" is present after the specification,
-- this is an Iterated_Element_Association that carries a
-- key_expression, and we generate the appropriate node.
Id := P_Defining_Identifier;
Assoc_Node :=
New_Node (N_Iterated_Component_Association, Prev_Token_Ptr);
if Token = Tok_In then
Set_Defining_Identifier (Assoc_Node, Id);
T_In;
Set_Discrete_Choices (Assoc_Node, P_Discrete_Choice_List);
if Token = Tok_Use then
-- Ada_2020 Key-expression is present, rewrite node as an
-- iterated_Element_Awwoiation.
Scan; -- past USE
Loop_Spec :=
New_Node (N_Loop_Parameter_Specification, Prev_Token_Ptr);
Set_Defining_Identifier (Loop_Spec, Id);
Choice := First (Discrete_Choices (Assoc_Node));
if Present (Next (Choice)) then
Error_Msg_N ("expect loop parameter specification", Choice);
end if;
Remove (Choice);
Set_Discrete_Subtype_Definition (Loop_Spec, Choice);
Assoc_Node :=
New_Node (N_Iterated_Element_Association, Prev_Token_Ptr);
Set_Loop_Parameter_Specification (Assoc_Node, Loop_Spec);
Set_Key_Expression (Assoc_Node, P_Expression);
end if;
TF_Arrow;
Set_Expression (Assoc_Node, P_Expression);
elsif Ada_Version >= Ada_2020
and then Token = Tok_Of
then
Restore_Scan_State (State);
Scan; -- past OF
Set_Defining_Identifier (Assoc_Node, Id);
Iter_Spec := P_Iterator_Specification (Id);
Set_Iterator_Specification (Assoc_Node, Iter_Spec);
if Token = Tok_Use then
Scan; -- past USE
-- This is an iterated_elenent_qssociation.
Assoc_Node :=
New_Node (N_Iterated_Element_Association, Prev_Token_Ptr);
Set_Iterator_Specification (Assoc_Node, Iter_Spec);
Set_Key_Expression (Assoc_Node, P_Expression);
end if;
TF_Arrow;
Set_Expression (Assoc_Node, P_Expression);
end if;
if Ada_Version < Ada_2020 then
Error_Msg_SC ("iterated component is an Ada 202x feature");
Error_Msg_SC ("\compile with -gnat2020");
end if;
return Assoc_Node;
end P_Iterated_Component_Association;
---------------------
-- P_If_Expression --
---------------------
-- IF_EXPRESSION ::=
-- if CONDITION then DEPENDENT_EXPRESSION
-- {elsif CONDITION then DEPENDENT_EXPRESSION}
-- [else DEPENDENT_EXPRESSION]
-- DEPENDENT_EXPRESSION ::= EXPRESSION
function P_If_Expression return Node_Id is
function P_If_Expression_Internal
(Loc : Source_Ptr;
Cond : Node_Id) return Node_Id;
-- This is the internal recursive routine that does all the work, it is
-- recursive since it is used to process ELSIF parts, which internally
-- are N_If_Expression nodes with the Is_Elsif flag set. The calling
-- sequence is like the outer function except that the caller passes
-- the conditional expression (scanned using P_Expression), and the
-- scan pointer points just past this expression. Loc points to the
-- IF or ELSIF token.
------------------------------
-- P_If_Expression_Internal --
------------------------------
function P_If_Expression_Internal
(Loc : Source_Ptr;
Cond : Node_Id) return Node_Id
is
Exprs : constant List_Id := New_List;
Expr : Node_Id;
State : Saved_Scan_State;
Eptr : Source_Ptr;
begin
-- All cases except where we are at right paren
if Token /= Tok_Right_Paren then
TF_Then;
Append_To (Exprs, P_Condition (Cond));
Append_To (Exprs, P_Expression);
-- Case of right paren (missing THEN phrase). Note that we know this
-- is the IF case, since the caller dealt with this possibility in
-- the ELSIF case.
else
Error_Msg_BC ("missing THEN phrase");
Append_To (Exprs, P_Condition (Cond));
end if;
-- We now have scanned out IF expr THEN expr
-- Check for common error of semicolon before the ELSE
if Token = Tok_Semicolon then
Save_Scan_State (State);
Scan; -- past semicolon
if Token = Tok_Else or else Token = Tok_Elsif then
Error_Msg_SP -- CODEFIX
("|extra "";"" ignored");
else
Restore_Scan_State (State);
end if;
end if;
-- Scan out ELSIF sequence if present
if Token = Tok_Elsif then
Eptr := Token_Ptr;
Scan; -- past ELSIF
Expr := P_Expression;
-- If we are at a right paren, we assume the ELSIF should be ELSE
if Token = Tok_Right_Paren then
Error_Msg ("ELSIF should be ELSE", Eptr);
Append_To (Exprs, Expr);
-- Otherwise we have an OK ELSIF
else
Expr := P_If_Expression_Internal (Eptr, Expr);
Set_Is_Elsif (Expr);
Append_To (Exprs, Expr);
end if;
-- Scan out ELSE phrase if present
elsif Token = Tok_Else then
-- Scan out ELSE expression
Scan; -- Past ELSE
Append_To (Exprs, P_Expression);
-- Skip redundant ELSE parts
while Token = Tok_Else loop
Error_Msg_SC ("only one ELSE part is allowed");
Scan; -- past ELSE
Discard_Junk_Node (P_Expression);
end loop;
-- Two expression case (implied True, filled in during semantics)
else
null;
end if;
-- If we have an END IF, diagnose as not needed
if Token = Tok_End then
Error_Msg_SC ("`END IF` not allowed at end of if expression");
Scan; -- past END
if Token = Tok_If then
Scan; -- past IF;
end if;
end if;
-- Return the If_Expression node
return Make_If_Expression (Loc, Expressions => Exprs);
end P_If_Expression_Internal;
-- Local variables
Loc : constant Source_Ptr := Token_Ptr;
If_Expr : Node_Id;
-- Start of processing for P_If_Expression
begin
Error_Msg_Ada_2012_Feature ("|if expression", Token_Ptr);
Scan; -- past IF
Inside_If_Expression := Inside_If_Expression + 1;
If_Expr := P_If_Expression_Internal (Loc, P_Expression);
Inside_If_Expression := Inside_If_Expression - 1;
return If_Expr;
end P_If_Expression;
--------------------------
-- P_Declare_Expression --
--------------------------
-- DECLARE_EXPRESSION ::=
-- DECLARE {DECLARE_ITEM}
-- begin BODY_EXPRESSION
-- DECLARE_ITEM ::= OBJECT_DECLARATION
-- | OBJECT_RENAMING_DECLARATION
function P_Declare_Expression return Node_Id is
Loc : constant Source_Ptr := Token_Ptr;
begin
Scan; -- past DECLARE
declare
Actions : constant List_Id := P_Basic_Declarative_Items
(Declare_Expression => True);
-- Most declarative items allowed by P_Basic_Declarative_Items are
-- illegal; semantic analysis will deal with that.
begin
if Token = Tok_Begin then
Scan;
else
Error_Msg_SC -- CODEFIX
("BEGIN expected!");
end if;
declare
Expression : constant Node_Id := P_Expression;
Result : constant Node_Id :=
Make_Expression_With_Actions (Loc, Actions, Expression);
begin
if Ada_Version < Ada_2020 then
Error_Msg ("declare_expression is an Ada 2020 feature", Loc);
end if;
return Result;
end;
end;
end P_Declare_Expression;
-----------------------
-- P_Membership_Test --
-----------------------
-- MEMBERSHIP_CHOICE_LIST ::= MEMBERSHIP_CHOICE {'|' MEMBERSHIP_CHOICE}
-- MEMBERSHIP_CHOICE ::= CHOICE_EXPRESSION | range | subtype_mark
procedure P_Membership_Test (N : Node_Id) is
Alt : constant Node_Id :=
P_Range_Or_Subtype_Mark
(Allow_Simple_Expression => (Ada_Version >= Ada_2012));
begin
-- Set case
if Token = Tok_Vertical_Bar then
Error_Msg_Ada_2012_Feature ("set notation", Token_Ptr);
Set_Alternatives (N, New_List (Alt));
Set_Right_Opnd (N, Empty);
-- Loop to accumulate alternatives
while Token = Tok_Vertical_Bar loop
Scan; -- past vertical bar
Append_To
(Alternatives (N),
P_Range_Or_Subtype_Mark (Allow_Simple_Expression => True));
end loop;
-- Not set case
else
Set_Right_Opnd (N, Alt);
Set_Alternatives (N, No_List);
end if;
end P_Membership_Test;
-----------------------------
-- P_Unparen_Cond_Expr_Etc --
-----------------------------
function P_Unparen_Cond_Expr_Etc return Node_Id is
Lparen : constant Boolean := Prev_Token = Tok_Left_Paren;
Result : Node_Id;
Scan_State : Saved_Scan_State;
begin
-- Case expression
if Token = Tok_Case then
Result := P_Case_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg_N ("case expression must be parenthesized!", Result);
end if;
-- If expression
elsif Token = Tok_If then
Result := P_If_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg_N ("if expression must be parenthesized!", Result);
end if;
-- Quantified expression or iterated component association
elsif Token = Tok_For then
Save_Scan_State (Scan_State);
Scan; -- past FOR
if Token = Tok_All or else Token = Tok_Some then
Restore_Scan_State (Scan_State);
Result := P_Quantified_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg_N
("quantified expression must be parenthesized!", Result);
end if;
else
-- If no quantifier keyword, this is an iterated component in
-- an aggregate.
Restore_Scan_State (Scan_State);
Result := P_Iterated_Component_Association;
end if;
-- Declare expression
elsif Token = Tok_Declare then
Result := P_Declare_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg_N ("declare expression must be parenthesized!", Result);
end if;
-- No other possibility should exist (caller was supposed to check)
else
raise Program_Error;
end if;
-- Return expression (possibly after having given message)
return Result;
end P_Unparen_Cond_Expr_Etc;
end Ch4;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
package body Program.Nodes.Function_Declarations is
function Create
(Not_Token : Program.Lexical_Elements.Lexical_Element_Access;
Overriding_Token : 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;
Left_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Right_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access;
Return_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Not_Token_2 : Program.Lexical_Elements.Lexical_Element_Access;
Null_Token : Program.Lexical_Elements.Lexical_Element_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Is_Token : Program.Lexical_Elements.Lexical_Element_Access;
Result_Expression : Program.Elements.Parenthesized_Expressions
.Parenthesized_Expression_Access;
Abstract_Token : Program.Lexical_Elements.Lexical_Element_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 Function_Declaration is
begin
return Result : Function_Declaration :=
(Not_Token => Not_Token, Overriding_Token => Overriding_Token,
Function_Token => Function_Token, Name => Name,
Left_Bracket_Token => Left_Bracket_Token, Parameters => Parameters,
Right_Bracket_Token => Right_Bracket_Token,
Return_Token => Return_Token, Not_Token_2 => Not_Token_2,
Null_Token => Null_Token, Result_Subtype => Result_Subtype,
Is_Token => Is_Token, Result_Expression => Result_Expression,
Abstract_Token => Abstract_Token, With_Token => With_Token,
Aspects => Aspects, Semicolon_Token => Semicolon_Token,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Parameters : Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access;
Result_Subtype : not null Program.Elements.Element_Access;
Result_Expression : Program.Elements.Parenthesized_Expressions
.Parenthesized_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;
Has_Not : Boolean := False;
Has_Overriding : Boolean := False;
Has_Abstract : Boolean := False;
Has_Not_Null : Boolean := False)
return Implicit_Function_Declaration is
begin
return Result : Implicit_Function_Declaration :=
(Name => Name, Parameters => Parameters,
Result_Subtype => Result_Subtype,
Result_Expression => Result_Expression, Aspects => Aspects,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Has_Not => Has_Not,
Has_Overriding => Has_Overriding, Has_Abstract => Has_Abstract,
Has_Not_Null => Has_Not_Null, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Name
(Self : Base_Function_Declaration)
return not null Program.Elements.Defining_Names.Defining_Name_Access is
begin
return Self.Name;
end Name;
overriding function Parameters
(Self : Base_Function_Declaration)
return Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access is
begin
return Self.Parameters;
end Parameters;
overriding function Result_Subtype
(Self : Base_Function_Declaration)
return not null Program.Elements.Element_Access is
begin
return Self.Result_Subtype;
end Result_Subtype;
overriding function Result_Expression
(Self : Base_Function_Declaration)
return Program.Elements.Parenthesized_Expressions
.Parenthesized_Expression_Access is
begin
return Self.Result_Expression;
end Result_Expression;
overriding function Aspects
(Self : Base_Function_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access is
begin
return Self.Aspects;
end Aspects;
overriding function Not_Token
(Self : Function_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Not_Token;
end Not_Token;
overriding function Overriding_Token
(Self : Function_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Overriding_Token;
end Overriding_Token;
overriding function Function_Token
(Self : Function_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Function_Token;
end Function_Token;
overriding function Left_Bracket_Token
(Self : Function_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Left_Bracket_Token;
end Left_Bracket_Token;
overriding function Right_Bracket_Token
(Self : Function_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Right_Bracket_Token;
end Right_Bracket_Token;
overriding function Return_Token
(Self : Function_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Return_Token;
end Return_Token;
overriding function Not_Token_2
(Self : Function_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Not_Token_2;
end Not_Token_2;
overriding function Null_Token
(Self : Function_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Null_Token;
end Null_Token;
overriding function Is_Token
(Self : Function_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Is_Token;
end Is_Token;
overriding function Abstract_Token
(Self : Function_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Abstract_Token;
end Abstract_Token;
overriding function With_Token
(Self : Function_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.With_Token;
end With_Token;
overriding function Semicolon_Token
(Self : Function_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Semicolon_Token;
end Semicolon_Token;
overriding function Has_Not (Self : Function_Declaration) return Boolean is
begin
return Self.Not_Token.Assigned;
end Has_Not;
overriding function Has_Overriding
(Self : Function_Declaration)
return Boolean is
begin
return Self.Overriding_Token.Assigned;
end Has_Overriding;
overriding function Has_Abstract
(Self : Function_Declaration)
return Boolean is
begin
return Self.Abstract_Token.Assigned;
end Has_Abstract;
overriding function Has_Not_Null
(Self : Function_Declaration)
return Boolean is
begin
return Self.Null_Token.Assigned;
end Has_Not_Null;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Function_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Function_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Function_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
overriding function Has_Not
(Self : Implicit_Function_Declaration)
return Boolean is
begin
return Self.Has_Not;
end Has_Not;
overriding function Has_Overriding
(Self : Implicit_Function_Declaration)
return Boolean is
begin
return Self.Has_Overriding;
end Has_Overriding;
overriding function Has_Abstract
(Self : Implicit_Function_Declaration)
return Boolean is
begin
return Self.Has_Abstract;
end Has_Abstract;
overriding function Has_Not_Null
(Self : Implicit_Function_Declaration)
return Boolean is
begin
return Self.Has_Not_Null;
end Has_Not_Null;
procedure Initialize (Self : in out Base_Function_Declaration'Class) is
begin
Set_Enclosing_Element (Self.Name, Self'Unchecked_Access);
for Item in Self.Parameters.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
Set_Enclosing_Element (Self.Result_Subtype, Self'Unchecked_Access);
if Self.Result_Expression.Assigned then
Set_Enclosing_Element (Self.Result_Expression, Self'Unchecked_Access);
end if;
for Item in Self.Aspects.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
null;
end Initialize;
overriding function Is_Function_Declaration
(Self : Base_Function_Declaration)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Function_Declaration;
overriding function Is_Declaration
(Self : Base_Function_Declaration)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Declaration;
overriding procedure Visit
(Self : not null access Base_Function_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Function_Declaration (Self);
end Visit;
overriding function To_Function_Declaration_Text
(Self : in out Function_Declaration)
return Program.Elements.Function_Declarations
.Function_Declaration_Text_Access is
begin
return Self'Unchecked_Access;
end To_Function_Declaration_Text;
overriding function To_Function_Declaration_Text
(Self : in out Implicit_Function_Declaration)
return Program.Elements.Function_Declarations
.Function_Declaration_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Function_Declaration_Text;
end Program.Nodes.Function_Declarations;
|
-----------------------------------------------------------------------
-- awa-votes-beans -- Beans for module votes
-- Copyright (C) 2013, 2015 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Util.Beans.Basic;
with AWA.Votes.Modules;
with AWA.Votes.Models;
-- === Vote Beans ===
-- The <tt>Vote_Bean</tt> is a bean intended to be used in presentation files (XHTML facelet
-- files) to vote for an item. The managed bean can be easily configured in the application XML
-- configuration file. The <b>permission</b> and <b>entity_type</b> are the two properties
-- that should be defined in the configuration. The <b>permission</b> is the name of the
-- permission that must be used to verify that the user is allowed to vote for the item.
-- The <b>entity_type</b> is the name of the entity (table name) used by the item.
-- The example below defines the bean <tt>questionVote</tt> defined by the question module.
--
-- <managed-bean>
-- <description>The vote bean that allows to vote for a question.</description>
-- <managed-bean-name>questionVote</managed-bean-name>
-- <managed-bean-class>AWA.Votes.Beans.Votes_Bean</managed-bean-class>
-- <managed-bean-scope>request</managed-bean-scope>
-- <managed-property>
-- <property-name>permission</property-name>
-- <property-class>String</property-class>
-- <value>answer-create</value>
-- </managed-property>
-- <managed-property>
-- <property-name>entity_type</property-name>
-- <property-class>String</property-class>
-- <value>awa_question</value>
-- </managed-property>
-- </managed-bean>
--
-- The vote concerns entities for the <tt>awa_question</tt> entity table.
-- The permission <tt>answer-create</tt> is used to verify that the vote is allowed.
--
-- [images/awa_votes_bean.png]
--
-- The managed bean defines three operations that can be called: <tt>vote_up</tt>,
-- <tt>vote_down</tt> and <tt>vote</tt> to setup specific ratings.
package AWA.Votes.Beans is
type Vote_Bean is new AWA.Votes.Models.Vote_Bean with private;
type Vote_Bean_Access is access all Vote_Bean'Class;
-- Action to vote up.
overriding
procedure Vote_Up (Bean : in out Vote_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Action to vote down.
overriding
procedure Vote_Down (Bean : in out Vote_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Action to vote.
overriding
procedure Vote (Bean : in out Vote_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Create the Votes_Bean bean instance.
function Create_Vote_Bean (Module : in AWA.Votes.Modules.Vote_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
private
type Vote_Bean is new AWA.Votes.Models.Vote_Bean with record
Module : AWA.Votes.Modules.Vote_Module_Access := null;
end record;
end AWA.Votes.Beans;
|
with Opt48_Pkg2; use Opt48_Pkg2;
package Opt48_Pkg1 is
function Get_Z return Rec;
end Opt48_Pkg1;
|
with Extraction.Node_Edge_Types;
with Extraction.Utilities;
package body Extraction.Primitive_Subps is
use type LAL.Analysis_Unit;
use type LALCO.Ada_Node_Kind_Type;
procedure Extract_Nodes
(Node : LAL.Ada_Node'Class; Graph : Graph_Operations.Graph_Context)
is
begin
if Utilities.Is_Relevant_Basic_Decl (Node)
and then Node.Kind = LALCO.Ada_Type_Decl
then
declare
Type_Decl : constant LAL.Type_Decl := Node.As_Type_Decl;
Primitives : constant LAL.Basic_Decl_Array :=
Type_Decl.P_Get_Primitives;
begin
-- Add non-standard subprograms that are primitive
-- even if external.
for Basic_Decl of Primitives loop
if Basic_Decl.Unit /= Basic_Decl.P_Standard_Unit then
Graph.Write_Node (Basic_Decl);
end if;
end loop;
end;
end if;
end Extract_Nodes;
procedure Extract_Edges
(Node : LAL.Ada_Node'Class; Graph : Graph_Operations.Graph_Context)
is
begin
if Utilities.Is_Relevant_Basic_Decl (Node)
and then Node.Kind = LALCO.Ada_Type_Decl
then
declare
Type_Decl : constant LAL.Type_Decl := Node.As_Type_Decl;
Primitives : constant LAL.Basic_Decl_Array :=
Type_Decl.P_Get_Primitives;
begin
for Basic_Decl of Primitives loop
if Basic_Decl.Unit /= Basic_Decl.P_Standard_Unit then
Graph.Write_Edge
(Basic_Decl, Type_Decl,
Node_Edge_Types.Edge_Type_Is_Primitive_Subprogram_Of);
end if;
end loop;
end;
end if;
end Extract_Edges;
end Extraction.Primitive_Subps;
|
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);
p : constant Program := load_file("test1.txt");
t1 : constant Long_Integer := sum_memory(p);
begin
Assert(t1 = 165, "Wrong number, expected 165, got" & Long_Integer'IMAGE(t1));
end Test_Part1;
procedure Test_Part2 (T : in out AUnit.Test_Cases.Test_Case'Class) is
pragma Unreferenced (T);
p : constant Program := load_file("test2.txt");
t1 : constant Long_Integer := sum_memory_v2(p);
begin
Assert(t1 = 208, "Wrong number, expected 208, got" & Long_Integer'IMAGE(t1));
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 RUNTIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 8 --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1999 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.Storage_Elements;
with System.Unsigned_Types;
with Unchecked_Conversion;
package body System.Pack_48 is
subtype Ofs is System.Storage_Elements.Storage_Offset;
subtype Uns is System.Unsigned_Types.Unsigned;
subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7;
use type System.Storage_Elements.Storage_Offset;
use type System.Unsigned_Types.Unsigned;
type Cluster is record
E0, E1, E2, E3, E4, E5, E6, E7 : Bits_48;
end record;
for Cluster use record
E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1;
E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1;
E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1;
E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1;
E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1;
E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1;
E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1;
E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1;
end record;
for Cluster'Size use Bits * 8;
for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment,
1 +
1 * Boolean'Pos (Bits mod 2 = 0) +
2 * Boolean'Pos (Bits mod 4 = 0));
-- Use maximum possible alignment, given the bit field size, since this
-- will result in the most efficient code possible for the field.
type Cluster_Ref is access Cluster;
function To_Ref is new
Unchecked_Conversion (System.Address, Cluster_Ref);
-- The following declarations are for the case where the address
-- passed to GetU_48 or SetU_48 is not guaranteed to be aligned.
-- These routines are used when the packed array is itself a
-- component of a packed record, and therefore may not be aligned.
type ClusterU is new Cluster;
for ClusterU'Alignment use 1;
type ClusterU_Ref is access ClusterU;
function To_Ref is new
Unchecked_Conversion (System.Address, ClusterU_Ref);
------------
-- Get_48 --
------------
function Get_48 (Arr : System.Address; N : Natural) return Bits_48 is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end Get_48;
-------------
-- GetU_48 --
-------------
function GetU_48 (Arr : System.Address; N : Natural) return Bits_48 is
C : constant ClusterU_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end GetU_48;
------------
-- Set_48 --
------------
procedure Set_48 (Arr : System.Address; N : Natural; E : Bits_48) is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end Set_48;
-------------
-- SetU_48 --
-------------
procedure SetU_48 (Arr : System.Address; N : Natural; E : Bits_48) is
C : constant ClusterU_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end SetU_48;
end System.Pack_48;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . R E G P A T --
-- --
-- S p e c --
-- --
-- Copyright (C) 1986 by University of Toronto. --
-- Copyright (C) 1996-2006, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package implements roughly the same set of regular expressions as
-- are available in the Perl or Python programming languages.
-- This is an extension of the original V7 style regular expression library
-- written in C by Henry Spencer. Apart from the translation to Ada, the
-- interface has been considerably changed to use the Ada String type
-- instead of C-style nul-terminated strings.
------------------------------------------------------------
-- Summary of Pattern Matching Packages in GNAT Hierarchy --
------------------------------------------------------------
-- There are three related packages that perform pattern maching functions.
-- the following is an outline of these packages, to help you determine
-- which is best for your needs.
-- GNAT.Regexp (files g-regexp.ads/g-regexp.adb)
-- This is a simple package providing Unix-style regular expression
-- matching with the restriction that it matches entire strings. It
-- is particularly useful for file name matching, and in particular
-- it provides "globbing patterns" that are useful in implementing
-- unix or DOS style wild card matching for file names.
-- GNAT.Regpat (files g-regpat.ads/g-regpat.adb)
-- This is a more complete implementation of Unix-style regular
-- expressions, copied from the Perl regular expression engine,
-- written originally in C by Henry Spencer. It is functionally the
-- same as that library.
-- GNAT.Spitbol.Patterns (files g-spipat.ads/g-spipat.adb)
-- This is a completely general pattern matching package based on the
-- pattern language of SNOBOL4, as implemented in SPITBOL. The pattern
-- language is modeled on context free grammars, with context sensitive
-- extensions that provide full (type 0) computational capabilities.
package GNAT.Regpat is
pragma Preelaborate;
-- The grammar is the following:
-- regexp ::= expr
-- ::= ^ expr -- anchor at the beginning of string
-- ::= expr $ -- anchor at the end of string
-- expr ::= term
-- ::= term | term -- alternation (term or term ...)
-- term ::= item
-- ::= item item ... -- concatenation (item then item)
-- item ::= elmt -- match elmt
-- ::= elmt * -- zero or more elmt's
-- ::= elmt + -- one or more elmt's
-- ::= elmt ? -- matches elmt or nothing
-- ::= elmt *? -- zero or more times, minimum number
-- ::= elmt +? -- one or more times, minimum number
-- ::= elmt ?? -- zero or one time, minimum number
-- ::= elmt { num } -- matches elmt exactly num times
-- ::= elmt { num , } -- matches elmt at least num times
-- ::= elmt { num , num2 } -- matches between num and num2 times
-- ::= elmt { num }? -- matches elmt exactly num times
-- ::= elmt { num , }? -- matches elmt at least num times
-- non-greedy version
-- ::= elmt { num , num2 }? -- matches between num and num2 times
-- non-greedy version
-- elmt ::= nchr -- matches given character
-- ::= [range range ...] -- matches any character listed
-- ::= [^ range range ...] -- matches any character not listed
-- ::= . -- matches any single character
-- -- except newlines
-- ::= ( expr ) -- parens used for grouping
-- ::= \ num -- reference to num-th parenthesis
-- range ::= char - char -- matches chars in given range
-- ::= nchr
-- ::= [: posix :] -- any character in the POSIX range
-- ::= [:^ posix :] -- not in the POSIX range
-- posix ::= alnum -- alphanumeric characters
-- ::= alpha -- alphabetic characters
-- ::= ascii -- ascii characters (0 .. 127)
-- ::= cntrl -- control chars (0..31, 127..159)
-- ::= digit -- digits ('0' .. '9')
-- ::= graph -- graphic chars (32..126, 160..255)
-- ::= lower -- lower case characters
-- ::= print -- printable characters (32..127)
-- ::= punct -- printable, except alphanumeric
-- ::= space -- space characters
-- ::= upper -- upper case characters
-- ::= word -- alphanumeric characters
-- ::= xdigit -- hexadecimal chars (0..9, a..f)
-- char ::= any character, including special characters
-- ASCII.NUL is not supported.
-- nchr ::= any character except \()[].*+?^ or \char to match char
-- \n means a newline (ASCII.LF)
-- \t means a tab (ASCII.HT)
-- \r means a return (ASCII.CR)
-- \b matches the empty string at the beginning or end of a
-- word. A word is defined as a set of alphanumerical
-- characters (see \w below).
-- \B matches the empty string only when *not* at the
-- beginning or end of a word.
-- \d matches any digit character ([0-9])
-- \D matches any non digit character ([^0-9])
-- \s matches any white space character. This is equivalent
-- to [ \t\n\r\f\v] (tab, form-feed, vertical-tab,...
-- \S matches any non-white space character.
-- \w matches any alphanumeric character or underscore.
-- This include accented letters, as defined in the
-- package Ada.Characters.Handling.
-- \W matches any non-alphanumeric character.
-- \A match the empty string only at the beginning of the
-- string, whatever flags are used for Compile (the
-- behavior of ^ can change, see Regexp_Flags below).
-- \G match the empty string only at the end of the
-- string, whatever flags are used for Compile (the
-- behavior of $ can change, see Regexp_Flags below).
-- ... ::= is used to indication repetition (one or more terms)
-- Embedded newlines are not matched by the ^ operator.
-- It is possible to retrieve the substring matched a parenthesis
-- expression. Although the depth of parenthesis is not limited in the
-- regexp, only the first 9 substrings can be retrieved.
-- The highest value possible for the arguments to the curly operator ({})
-- are given by the constant Max_Curly_Repeat below.
-- The operators '*', '+', '?' and '{}' always match the longest possible
-- substring. They all have a non-greedy version (with an extra ? after the
-- operator), which matches the shortest possible substring.
-- For instance:
-- regexp="<.*>" string="<h1>title</h1>" matches="<h1>title</h1>"
-- regexp="<.*?>" string="<h1>title</h1>" matches="<h1>"
--
-- '{' and '}' are only considered as special characters if they appear
-- in a substring that looks exactly like '{n}', '{n,m}' or '{n,}', where
-- n and m are digits. No space is allowed. In other contexts, the curly
-- braces will simply be treated as normal characters.
-- Compiling Regular Expressions
-- =============================
-- To use this package, you first need to compile the regular expression
-- (a string) into a byte-code program, in a Pattern_Matcher structure.
-- This first step checks that the regexp is valid, and optimizes the
-- matching algorithms of the second step.
-- Two versions of the Compile subprogram are given: one in which this
-- package will compute itself the best possible size to allocate for the
-- byte code; the other where you must allocate enough memory yourself. An
-- exception is raised if there is not enough memory.
-- declare
-- Regexp : String := "a|b";
-- Matcher : Pattern_Matcher := Compile (Regexp);
-- -- The size for matcher is automatically allocated
-- Matcher2 : Pattern_Matcher (1000);
-- -- Some space is allocated directly.
-- begin
-- Compile (Matcher2, Regexp);
-- ...
-- end;
-- Note that the second version is significantly faster, since with the
-- first version the regular expression has in fact to be compiled twice
-- (first to compute the size, then to generate the byte code).
-- Note also that you cannot use the function version of Compile if you
-- specify the size of the Pattern_Matcher, since the discriminants will
-- most probably be different and you will get a Constraint_Error
-- Matching Strings
-- ================
-- Once the regular expression has been compiled, you can use it as often
-- as needed to match strings.
-- Several versions of the Match subprogram are provided, with different
-- parameters and return results.
-- See the description under each of these subprograms
-- Here is a short example showing how to get the substring matched by
-- the first parenthesis pair.
-- declare
-- Matches : Match_Array (0 .. 1);
-- Regexp : String := "a(b|c)d";
-- Str : String := "gacdg";
-- begin
-- Match (Compile (Regexp), Str, Matches);
-- return Str (Matches (1).First .. Matches (1).Last);
-- -- returns 'c'
-- end;
-- Finding all occurrences
-- =======================
-- Finding all the occurrences of a regular expression in a string cannot
-- be done by simply passing a slice of the string. This wouldn't work for
-- anchored regular expressions (the ones starting with "^" or ending with
-- "$").
-- Instead, you need to use the last parameter to Match (Data_First), as in
-- the following loop:
-- declare
-- Str : String :=
-- "-- first line" & ASCII.LF & "-- second line";
-- Matches : Match_array (0 .. 0);
-- Regexp : Pattern_Matcher := Compile ("^--", Multiple_Lines);
-- Current : Natural := Str'First;
-- begin
-- loop
-- Match (Regexp, Str, Matches, Current);
-- exit when Matches (0) = No_Match;
--
-- -- Process the match at position Matches (0).First
--
-- Current := Matches (0).Last + 1;
-- end loop;
-- end;
-- String Substitution
-- ===================
-- No subprogram is currently provided for string substitution.
-- However, this is easy to simulate with the parenthesis groups, as
-- shown below.
-- This example swaps the first two words of the string:
-- declare
-- Regexp : String := "([a-z]+) +([a-z]+)";
-- Str : String := " first second third ";
-- Matches : Match_Array (0 .. 2);
-- begin
-- Match (Compile (Regexp), Str, Matches);
-- return Str (Str'First .. Matches (1).First - 1)
-- & Str (Matches (2).First .. Matches (2).Last)
-- & " "
-- & Str (Matches (1).First .. Matches (1).Last)
-- & Str (Matches (2).Last + 1 .. Str'Last);
-- -- returns " second first third "
-- end;
---------------
-- Constants --
---------------
Expression_Error : exception;
-- This exception is raised when trying to compile an invalid regular
-- expression. All subprograms taking an expression as parameter may raise
-- Expression_Error.
Max_Paren_Count : constant := 255;
-- Maximum number of parenthesis in a regular expression. This is limited
-- by the size of a Character, as found in the byte-compiled version of
-- regular expressions.
Max_Curly_Repeat : constant := 32767;
-- Maximum number of repetition for the curly operator. The digits in the
-- {n}, {n,} and {n,m } operators cannot be higher than this constant,
-- since they have to fit on two characters in the byte-compiled version of
-- regular expressions.
Max_Program_Size : constant := 2**15 - 1;
-- Maximum size that can be allocated for a program
type Program_Size is range 0 .. Max_Program_Size;
for Program_Size'Size use 16;
-- Number of bytes allocated for the byte-compiled version of a regular
-- expression. The size required depends on the complexity of the regular
-- expression in a complex manner that is undocumented (other than in the
-- body of the Compile procedure). Normally the size is automatically set
-- and the programmer need not be concerned about it. There are two
-- exceptions to this. First in the calls to Match, it is possible to
-- specify a non-zero size that is known to be large enough. This can
-- slightly increase the efficiency by avoiding a copy. Second, in the case
-- of calling compile, it is possible using the procedural form of Compile
-- to use a single Pattern_Matcher variable for several different
-- expressions by setting its size sufficiently large.
Auto_Size : constant := 0;
-- Used in calls to Match to indicate that the Size should be set to
-- a value appropriate to the expression being used automatically.
type Regexp_Flags is mod 256;
for Regexp_Flags'Size use 8;
-- Flags that can be given at compile time to specify default
-- properties for the regular expression.
No_Flags : constant Regexp_Flags;
Case_Insensitive : constant Regexp_Flags;
-- The automaton is optimized so that the matching is done in a case
-- insensitive manner (upper case characters and lower case characters
-- are all treated the same way).
Single_Line : constant Regexp_Flags;
-- Treat the Data we are matching as a single line. This means that
-- ^ and $ will ignore \n (unless Multiple_Lines is also specified),
-- and that '.' will match \n.
Multiple_Lines : constant Regexp_Flags;
-- Treat the Data as multiple lines. This means that ^ and $ will also
-- match on internal newlines (ASCII.LF), in addition to the beginning
-- and end of the string.
--
-- This can be combined with Single_Line.
-----------------
-- Match_Array --
-----------------
subtype Match_Count is Natural range 0 .. Max_Paren_Count;
type Match_Location is record
First : Natural := 0;
Last : Natural := 0;
end record;
type Match_Array is array (Match_Count range <>) of Match_Location;
-- The substring matching a given pair of parenthesis. Index 0 is the whole
-- substring that matched the full regular expression.
--
-- For instance, if your regular expression is something like: "a(b*)(c+)",
-- then Match_Array(1) will be the indexes of the substring that matched
-- "b*" and Match_Array(2) will be the substring that matched "c+".
--
-- The number of parenthesis groups that can be retrieved is unlimited, and
-- all the Match subprograms below can use a Match_Array of any size.
-- Indexes that do not have any matching parenthesis are set to No_Match.
No_Match : constant Match_Location := (First => 0, Last => 0);
-- The No_Match constant is (0, 0) to differentiate between matching a null
-- string at position 1, which uses (1, 0) and no match at all.
---------------------------------
-- Pattern_Matcher Compilation --
---------------------------------
-- The subprograms here are used to precompile regular expressions for use
-- in subsequent Match calls. Precompilation improves efficiency if the
-- same regular expression is to be used in more than one Match call.
type Pattern_Matcher (Size : Program_Size) is private;
-- Type used to represent a regular expression compiled into byte code
Never_Match : constant Pattern_Matcher;
-- A regular expression that never matches anything
function Compile
(Expression : String;
Flags : Regexp_Flags := No_Flags) return Pattern_Matcher;
-- Compile a regular expression into internal code
--
-- Raises Expression_Error if Expression is not a legal regular expression
--
-- The appropriate size is calculated automatically to correspond to the
-- provided expression. This is the normal default method of compilation.
-- Note that it is generally not possible to assign the result of two
-- different calls to this Compile function to the same Pattern_Matcher
-- variable, since the sizes will differ.
--
-- Flags is the default value to use to set properties for Expression
-- (e.g. case sensitivity,...).
procedure Compile
(Matcher : out Pattern_Matcher;
Expression : String;
Final_Code_Size : out Program_Size;
Flags : Regexp_Flags := No_Flags);
-- Compile a regular expression into into internal code
-- This procedure is significantly faster than the Compile function since
-- it avoids the extra step of precomputing the required size.
--
-- However, it requires the user to provide a Pattern_Matcher variable
-- whose size is preset to a large enough value. One advantage of this
-- approach, in addition to the improved efficiency, is that the same
-- Pattern_Matcher variable can be used to hold the compiled code for
-- several different regular expressions by setting a size that is large
-- enough to accomodate all possibilities.
--
-- In this version of the procedure call, the actual required code size is
-- returned. Also if Matcher.Size is zero on entry, then the resulting code
-- is not stored. A call with Matcher.Size set to Auto_Size can thus be
-- used to determine the space required for compiling the given regular
-- expression.
--
-- This function raises Storage_Error if Matcher is too small to hold
-- the resulting code (i.e. Matcher.Size has too small a value).
--
-- Expression_Error is raised if the string Expression does not contain
-- a valid regular expression.
--
-- Flags is the default value to use to set properties for Expression (case
-- sensitivity,...).
procedure Compile
(Matcher : out Pattern_Matcher;
Expression : String;
Flags : Regexp_Flags := No_Flags);
-- -- Same procedure as above, expect it does not return the final
-- -- program size, and Matcher.Size cannot be Auto_Size.
function Paren_Count (Regexp : Pattern_Matcher) return Match_Count;
pragma Inline (Paren_Count);
-- Return the number of parenthesis pairs in Regexp.
--
-- This is the maximum index that will be filled if a Match_Array is
-- used as an argument to Match.
--
-- Thus, if you want to be sure to get all the parenthesis, you should
-- do something like:
--
-- declare
-- Regexp : Pattern_Matcher := Compile ("a(b*)(c+)");
-- Matched : Match_Array (0 .. Paren_Count (Regexp));
-- begin
-- Match (Regexp, "a string", Matched);
-- end;
-------------
-- Quoting --
-------------
function Quote (Str : String) return String;
-- Return a version of Str so that every special character is quoted.
-- The resulting string can be used in a regular expression to match
-- exactly Str, whatever character was present in Str.
--------------
-- Matching --
--------------
-- The Match subprograms are given a regular expression in string
-- form, and perform the corresponding match. The following parameters
-- are present in all forms of the Match call.
-- Expression contains the regular expression to be matched as a string
-- Data contains the string to be matched
-- Data_First is the lower bound for the match, i.e. Data (Data_First)
-- will be the first character to be examined. If Data_First is set to
-- the special value of -1 (the default), then the first character to
-- be examined is Data (Data_First). However, the regular expression
-- character ^ (start of string) still refers to the first character
-- of the full string (Data (Data'First)), which is why there is a
-- separate mechanism for specifying Data_First.
-- Data_Last is the upper bound for the match, i.e. Data (Data_Last)
-- will be the last character to be examined. If Data_Last is set to
-- the special value of Positive'Last (the default), then the last
-- character to be examined is Data (Data_Last). However, the regular
-- expression character $ (end of string) still refers to the last
-- character of the full string (Data (Data'Last)), which is why there
-- is a separate mechanism for specifying Data_Last.
-- Note: the use of Data_First and Data_Last is not equivalent to
-- simply passing a slice as Expression because of the handling of
-- regular expression characters ^ and $.
-- Size is the size allocated for the compiled byte code. Normally
-- this is defaulted to Auto_Size which means that the appropriate
-- size is allocated automatically. It is possible to specify an
-- explicit size, which must be sufficiently large. This slightly
-- increases the efficiency by avoiding the extra step of computing
-- the appropriate size.
-- The following exceptions can be raised in calls to Match
--
-- Storage_Error is raised if a non-zero value is given for Size
-- and it is too small to hold the compiled byte code.
--
-- Expression_Error is raised if the given expression is not a legal
-- regular expression.
procedure Match
(Expression : String;
Data : String;
Matches : out Match_Array;
Size : Program_Size := Auto_Size;
Data_First : Integer := -1;
Data_Last : Positive := Positive'Last);
-- This version returns the result of the match stored in Match_Array.
-- At most Matches'Length parenthesis are returned.
function Match
(Expression : String;
Data : String;
Size : Program_Size := Auto_Size;
Data_First : Integer := -1;
Data_Last : Positive := Positive'Last) return Natural;
-- This version returns the position where Data matches, or if there is
-- no match, then the value Data'First - 1.
function Match
(Expression : String;
Data : String;
Size : Program_Size := Auto_Size;
Data_First : Integer := -1;
Data_Last : Positive := Positive'Last) return Boolean;
-- This version returns True if the match succeeds, False otherwise
------------------------------------------------
-- Matching a Pre-Compiled Regular Expression --
------------------------------------------------
-- The following functions are significantly faster if you need to reuse
-- the same regular expression multiple times, since you only have to
-- compile it once. For these functions you must first compile the
-- expression with a call to Compile as previously described.
-- The parameters Data, Data_First and Data_Last are as described
-- in the previous section.
function Match
(Self : Pattern_Matcher;
Data : String;
Data_First : Integer := -1;
Data_Last : Positive := Positive'Last) return Natural;
-- Match Data using the given pattern matcher. Returns the position
-- where Data matches, or (Data'First - 1) if there is no match.
function Match
(Self : Pattern_Matcher;
Data : String;
Data_First : Integer := -1;
Data_Last : Positive := Positive'Last) return Boolean;
-- Return True if Data matches using the given pattern matcher
pragma Inline (Match);
-- All except the last one below
procedure Match
(Self : Pattern_Matcher;
Data : String;
Matches : out Match_Array;
Data_First : Integer := -1;
Data_Last : Positive := Positive'Last);
-- Match Data using the given pattern matcher and store result in Matches.
-- The expression matches if Matches (0) /= No_Match. The lower bound of
-- Matches is required to be zero.
--
-- At most Matches'Length parenthesis are returned
-----------
-- Debug --
-----------
procedure Dump (Self : Pattern_Matcher);
-- Dump the compiled version of the regular expression matched by Self
--------------------------
-- Private Declarations --
--------------------------
private
subtype Pointer is Program_Size;
-- The Pointer type is used to point into Program_Data
-- Note that the pointer type is not necessarily 2 bytes
-- although it is stored in the program using 2 bytes
type Program_Data is array (Pointer range <>) of Character;
Program_First : constant := 1;
-- The "internal use only" fields in regexp are present to pass info from
-- compile to execute that permits the execute phase to run lots faster on
-- simple cases. They are:
-- First character that must begin a match or ASCII.Nul
-- Anchored true iff match must start at beginning of line
-- Must_Have pointer to string that match must include or null
-- Must_Have_Length length of Must_Have string
-- First and Anchored permit very fast decisions on suitable starting
-- points for a match, cutting down the work a lot. Must_Have permits fast
-- rejection of lines that cannot possibly match.
-- The Must_Have tests are costly enough that Optimize supplies a Must_Have
-- only if the r.e. contains something potentially expensive (at present,
-- the only such thing detected is * or at the start of the r.e., which can
-- involve a lot of backup). The length is supplied because the test in
-- Execute needs it and Optimize is computing it anyway.
-- The initialization is meant to fail-safe in case the user of this
-- package tries to use an uninitialized matcher. This takes advantage
-- of the knowledge that ASCII.Nul translates to the end-of-program (EOP)
-- instruction code of the state machine.
No_Flags : constant Regexp_Flags := 0;
Case_Insensitive : constant Regexp_Flags := 1;
Single_Line : constant Regexp_Flags := 2;
Multiple_Lines : constant Regexp_Flags := 4;
type Pattern_Matcher (Size : Pointer) is record
First : Character := ASCII.NUL; -- internal use only
Anchored : Boolean := False; -- internal use only
Must_Have : Pointer := 0; -- internal use only
Must_Have_Length : Natural := 0; -- internal use only
Paren_Count : Natural := 0; -- # paren groups
Flags : Regexp_Flags := No_Flags;
Program : Program_Data (Program_First .. Size) :=
(others => ASCII.NUL);
end record;
Never_Match : constant Pattern_Matcher :=
(0, ASCII.NUL, False, 0, 0, 0, No_Flags, (others => ASCII.NUL));
end GNAT.Regpat;
|
with Extraction.Utilities;
private package Extraction.Node_Edge_Types is
-- Node names.
function Get_Node_Name
(File : VFS.Virtual_File; Directory_Prefix : VFS.Virtual_File)
return String;
function Get_Node_Name
(Project : GPR.Project_Type; Directory_Prefix : VFS.Virtual_File)
return String;
function Get_Node_Name
(Analysis_Unit : LAL.Analysis_Unit; Directory_Prefix : VFS.Virtual_File)
return String;
function Get_Node_Name
(Defining_Name : LAL.Defining_Name; Basic_Decl : LAL.Basic_Decl'Class;
Directory_Prefix : VFS.Virtual_File) return String;
-- Node attributes.
Node_Attribute_Fully_Qualified_Name : constant SU.Unbounded_String :=
+"fullyQualifiedName";
Node_Attribute_Is_Formal_Parameter : constant SU.Unbounded_String :=
+"isFormalParameter";
Node_Attribute_Is_Main_Program : constant SU.Unbounded_String :=
+"isMainProgram";
Node_Attribute_Relative_Name : constant SU.Unbounded_String :=
+"relativeName";
Node_Attribute_Source_Location : constant SU.Unbounded_String :=
+"sourceLocation";
function Node_Attributes return GW.Attribute_Definition_Sets.Map;
function Get_Node_Attributes
(File : VFS.Virtual_File; Directory_Prefix : VFS.Virtual_File)
return GW.Attribute_Value_Sets.Map;
function Get_Node_Attributes
(Project : GPR.Project_Type) return GW.Attribute_Value_Sets.Map;
function Get_Node_Attributes
(Defining_Name : LAL.Defining_Name; Basic_Decl : LAL.Basic_Decl;
Context : Utilities.Project_Context) return GW.Attribute_Value_Sets.Map;
-- Node types.
-- File and directory types.
Node_Type_File : constant GW.Node_Type := "File";
Node_Type_Directory : constant GW.Node_Type := "Directory";
-- File subtypes.
Node_Type_Unknown_File_Type : constant GW.Node_Subtype := "";
Node_Type_Ada_Body_File : constant GW.Node_Subtype := "AdaBodyFile";
Node_Type_Ada_Specification_File : constant GW.Node_Subtype :=
"AdaSpecificationFile";
Node_Type_C_Header_File : constant GW.Node_Subtype :=
"CHeaderFile"; -- Contained in projects, but not analyzed.
Node_Type_C_Source_File : constant GW.Node_Subtype :=
"CSourceFile"; -- Contained in projects, but not analyzed.
Node_Type_Gnat_Project_File : constant GW.Node_Subtype := "GnatProjectFile";
-- Project types.
Node_Type_Gnat_Project : constant GW.Node_Type := "GnatProject";
-- Declarations.
Node_Type_Ada_Declaration : constant GW.Node_Type := "AdaDeclaration";
-- Declaration subtypes.
Node_Type_Ada_Component_Declaration : constant GW.Node_Subtype :=
"AdaComponentDeclaration";
Node_Type_Ada_Discriminant_Declaration : constant GW.Node_Subtype :=
"AdaDiscriminantDeclaration";
Node_Type_Ada_Entry_Declaration : constant GW.Node_Subtype :=
"AdaEntryDeclaration";
Node_Type_Ada_Enum_Literal_Declaration : constant GW.Node_Subtype :=
"AdaEnumLiteralDeclaration";
Node_Type_Ada_Exception_Declaration : constant GW.Node_Subtype :=
"AdaExceptionDeclaration";
Node_Type_Ada_Number_Declaration : constant GW.Node_Subtype :=
"AdaNumberDeclaration";
Node_Type_Ada_Object_Declaration : constant GW.Node_Subtype :=
"AdaObjectDeclaration";
Node_Type_Ada_Package_Declaration : constant GW.Node_Subtype :=
"AdaPackageDeclaration";
Node_Type_Ada_Protected_Declaration : constant GW.Node_Subtype :=
"AdaProtectedDeclaration";
Node_Type_Ada_Subprogram_Declaration : constant GW.Node_Subtype :=
"AdaSubprogramDeclaration";
Node_Type_Ada_Task_Declaration : constant GW.Node_Subtype :=
"AdaTaskDeclaration";
Node_Type_Ada_Type_Declaration : constant GW.Node_Subtype :=
"AdaTypeDeclaration";
function Get_File_Subtype (File : VFS.Virtual_File) return GW.Node_Subtype;
function Get_Decl_Subtype (Decl : LAL.Basic_Decl) return GW.Node_Subtype;
-- Edge attributes.
Edge_Attribute_Has_Access_Type : constant SU.Unbounded_String :=
+"hasAccessType";
Edge_Attribute_Has_Array_Type : constant SU.Unbounded_String :=
+"hasArrayType";
Edge_Attribute_Is_Dispatching : constant SU.Unbounded_String :=
+"isDispatching";
function Edge_Attributes return GW.Attribute_Definition_Sets.Map;
function Get_Edge_Attributes
(Expr : LAL.Expr'Class) return GW.Attribute_Value_Sets.Map;
function Get_Edge_Attributes
(Type_Expr : LAL.Type_Expr'Class; Can_Have_Array_Type : Boolean)
return GW.Attribute_Value_Sets.Map;
-- Edge types.
-- Declaration-related and project-related.
Edge_Type_Contains : constant GW.Edge_Type := "Contains";
-- For declaration nesting and file in project/directory containment.
Edge_Type_Derives_From : constant GW.Edge_Type := "DerivesFrom";
-- For type derivations and project extensions.
Edge_Type_Imports : constant GW.Edge_Type := "Imports";
-- For `with` clauses and project imports.
Edge_Type_Source : constant GW.Edge_Type := "Source";
-- Source of a declaration or project.
-- Project-related.
Edge_Type_Compiles : constant GW.Edge_Type := "Compiles";
-- Declaration-related.
Edge_Type_Instantiates : constant GW.Edge_Type := "Instantiates";
Edge_Type_Is_Implemented_By : constant GW.Edge_Type := "IsImplementedBy";
Edge_Type_Is_Overridden_By : constant GW.Edge_Type := "IsOverriddenBy";
Edge_Type_Is_Parent_Of : constant GW.Edge_Type := "IsParentOf";
-- For child packages and their parents.
Edge_Type_Is_Primitive_Subprogram_Of : constant GW.Edge_Type :=
"IsPrimitiveSubprogramOf";
Edge_Type_References : constant GW.Edge_Type := "References";
Edge_Type_Renames : constant GW.Edge_Type := "Renames";
-- Call-related.
Edge_Type_Calls : constant GW.Edge_Type := "Calls";
-- Type-related.
Edge_Type_Has_Parameter_Of_Type : constant GW.Edge_Type :=
"HasParameterOfType";
Edge_Type_Has_Return_Of_Type : constant GW.Edge_Type := "HasReturnOfType";
Edge_Type_Has_Type : constant GW.Edge_Type := "HasType";
end Extraction.Node_Edge_Types;
|
with AUnit.Test_Cases;
package Tc is
type Test_Case is new AUnit.Test_Cases.Test_Case with null record;
function Name (Test : Test_Case) return AUnit.Message_String;
procedure Register_Tests (Test : in out Test_Case);
end tc;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T A G S --
-- --
-- B o d y --
-- --
-- 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. --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- GBADA: Stripped-down version for low-footprint runtime --
------------------------------------------------------------------------------
with System.Storage_Elements; use System.Storage_Elements;
package body Ada.Tags is
-----------------------
-- Local Subprograms --
-----------------------
function Is_Primary_DT (T : Tag) return Boolean;
-- Given a tag returns True if it has the signature of a primary dispatch
-- table. This is Inline_Always since it is called from other Inline_
-- Always subprograms where we want no out of line code to be generated.
function IW_Membership
(Descendant_TSD : Type_Specific_Data_Ptr;
T : Tag) return Boolean;
-- Subsidiary function of IW_Membership and CW_Membership which factorizes
-- the functionality needed to check if a given descendant implements an
-- interface tag T.
function Length (Str : Cstring_Ptr) return Natural;
-- Length of string represented by the given pointer (treating the string
-- as a C-style string, which is Nul terminated). See comment in body
-- explaining why we cannot use the normal strlen built-in.
function OSD (T : Tag) return Object_Specific_Data_Ptr;
-- Ada 2005 (AI-251): Given a pointer T to a secondary dispatch table,
-- retrieve the address of the record containing the Object Specific
-- Data table.
function SSD (T : Tag) return Select_Specific_Data_Ptr;
-- Ada 2005 (AI-251): Given a pointer T to a dispatch Table, retrieves the
-- address of the record containing the Select Specific Data in T's TSD.
pragma Inline_Always (Is_Primary_DT);
pragma Inline_Always (OSD);
pragma Inline_Always (SSD);
-- Disable warnings on possible aliasing problem
function To_Dispatch_Table_Ptr is
new Ada.Unchecked_Conversion (Tag, Dispatch_Table_Ptr);
function To_Dispatch_Table_Ptr is
new Ada.Unchecked_Conversion (System.Address, Dispatch_Table_Ptr);
function To_Object_Specific_Data_Ptr is
new Ada.Unchecked_Conversion (System.Address, Object_Specific_Data_Ptr);
function To_Tag_Ptr is
new Ada.Unchecked_Conversion (System.Address, Tag_Ptr);
-------------------------------
-- Inline_Always Subprograms --
-------------------------------
-- Inline_always subprograms must be placed before their first call to
-- avoid defeating the frontend inlining mechanism and thus ensure the
-- generation of their correct debug info.
-----------------
-- Is_Abstract --
-----------------
function Is_Abstract (T : Tag) return Boolean is
TSD_Ptr : Addr_Ptr;
TSD : Type_Specific_Data_Ptr;
begin
if T = No_Tag then
raise Tag_Error;
end if;
TSD_Ptr := To_Addr_Ptr (To_Address (T) - DT_Typeinfo_Ptr_Size);
TSD := To_Type_Specific_Data_Ptr (TSD_Ptr.all);
return TSD.Is_Abstract;
end Is_Abstract;
-------------------
-- Is_Primary_DT --
-------------------
function Is_Primary_DT (T : Tag) return Boolean is
begin
return DT (T).Signature = Primary_DT;
end Is_Primary_DT;
---------
-- OSD --
---------
function OSD (T : Tag) return Object_Specific_Data_Ptr is
OSD_Ptr : constant Addr_Ptr :=
To_Addr_Ptr (To_Address (T) - DT_Typeinfo_Ptr_Size);
begin
return To_Object_Specific_Data_Ptr (OSD_Ptr.all);
end OSD;
---------
-- SSD --
---------
function SSD (T : Tag) return Select_Specific_Data_Ptr is
TSD_Ptr : constant Addr_Ptr :=
To_Addr_Ptr (To_Address (T) - DT_Typeinfo_Ptr_Size);
TSD : constant Type_Specific_Data_Ptr :=
To_Type_Specific_Data_Ptr (TSD_Ptr.all);
begin
return TSD.SSD;
end SSD;
------------------
-- Base_Address --
------------------
function Base_Address (This : System.Address) return System.Address is
begin
return This + Offset_To_Top (This);
end Base_Address;
--------------
-- Displace --
--------------
function Displace (This : System.Address; T : Tag) return System.Address is
Iface_Table : Interface_Data_Ptr;
Obj_Base : System.Address;
Obj_DT : Dispatch_Table_Ptr;
Obj_DT_Tag : Tag;
begin
if System."=" (This, System.Null_Address) then
return System.Null_Address;
end if;
Obj_Base := Base_Address (This);
Obj_DT_Tag := To_Tag_Ptr (Obj_Base).all;
Obj_DT := DT (To_Tag_Ptr (Obj_Base).all);
Iface_Table := To_Type_Specific_Data_Ptr (Obj_DT.TSD).Interfaces_Table;
if Iface_Table /= null then
for Id in 1 .. Iface_Table.Nb_Ifaces loop
if Iface_Table.Ifaces_Table (Id).Iface_Tag = T then
-- Case of Static value of Offset_To_Top
if Iface_Table.Ifaces_Table (Id).Static_Offset_To_Top then
Obj_Base := Obj_Base -
Iface_Table.Ifaces_Table (Id).Offset_To_Top_Value;
-- Otherwise call the function generated by the expander to
-- provide the value.
else
Obj_Base := Obj_Base -
Iface_Table.Ifaces_Table (Id).Offset_To_Top_Func.all
(Obj_Base);
end if;
return Obj_Base;
end if;
end loop;
end if;
-- Check if T is an immediate ancestor. This is required to handle
-- conversion of class-wide interfaces to tagged types.
if CW_Membership (Obj_DT_Tag, T) then
return Obj_Base;
end if;
-- If the object does not implement the interface we must raise CE
raise Constraint_Error with "invalid interface conversion";
end Displace;
--------
-- DT --
--------
function DT (T : Tag) return Dispatch_Table_Ptr is
Offset : constant SSE.Storage_Offset :=
To_Dispatch_Table_Ptr (T).Prims_Ptr'Position;
begin
return To_Dispatch_Table_Ptr (To_Address (T) - Offset);
end DT;
-------------------
-- IW_Membership --
-------------------
function IW_Membership
(Descendant_TSD : Type_Specific_Data_Ptr;
T : Tag) return Boolean
is
Iface_Table : Interface_Data_Ptr;
begin
Iface_Table := Descendant_TSD.Interfaces_Table;
if Iface_Table /= null then
for Id in 1 .. Iface_Table.Nb_Ifaces loop
if Iface_Table.Ifaces_Table (Id).Iface_Tag = T then
return True;
end if;
end loop;
end if;
-- Look for the tag in the ancestor tags table. This is required for:
-- Iface_CW in Typ'Class
for Id in 0 .. Descendant_TSD.Idepth loop
if Descendant_TSD.Tags_Table (Id) = T then
return True;
end if;
end loop;
return False;
end IW_Membership;
-------------------
-- IW_Membership --
-------------------
-- Canonical implementation of Classwide Membership corresponding to:
-- Obj in Iface'Class
-- Each dispatch table contains a table with the tags of all the
-- implemented interfaces.
-- Obj is in Iface'Class if Iface'Tag is found in the table of interfaces
-- that are contained in the dispatch table referenced by Obj'Tag.
function IW_Membership (This : System.Address; T : Tag) return Boolean is
Obj_Base : System.Address;
Obj_DT : Dispatch_Table_Ptr;
Obj_TSD : Type_Specific_Data_Ptr;
begin
Obj_Base := Base_Address (This);
Obj_DT := DT (To_Tag_Ptr (Obj_Base).all);
Obj_TSD := To_Type_Specific_Data_Ptr (Obj_DT.TSD);
return IW_Membership (Obj_TSD, T);
end IW_Membership;
-------------------
-- CW_Membership --
-------------------
-- Canonical implementation of Classwide Membership corresponding to:
-- Obj in Typ'Class
-- Each dispatch table contains a reference to a table of ancestors (stored
-- in the first part of the Tags_Table) and a count of the level of
-- inheritance "Idepth".
-- Obj is in Typ'Class if Typ'Tag is in the table of ancestors that are
-- contained in the dispatch table referenced by Obj'Tag . Knowing the
-- level of inheritance of both types, this can be computed in constant
-- time by the formula:
-- TSD (Obj'tag).Tags_Table (TSD (Obj'tag).Idepth - TSD (Typ'tag).Idepth)
-- = Typ'tag
function CW_Membership (Obj_Tag : Tag; Typ_Tag : Tag) return Boolean is
Obj_TSD_Ptr : constant Addr_Ptr :=
To_Addr_Ptr (To_Address (Obj_Tag) - DT_Typeinfo_Ptr_Size);
Typ_TSD_Ptr : constant Addr_Ptr :=
To_Addr_Ptr (To_Address (Typ_Tag) - DT_Typeinfo_Ptr_Size);
Obj_TSD : constant Type_Specific_Data_Ptr :=
To_Type_Specific_Data_Ptr (Obj_TSD_Ptr.all);
Typ_TSD : constant Type_Specific_Data_Ptr :=
To_Type_Specific_Data_Ptr (Typ_TSD_Ptr.all);
Pos : constant Integer := Obj_TSD.Idepth - Typ_TSD.Idepth;
begin
return (Pos >= 0 and then Obj_TSD.Tags_Table (Pos) = Typ_Tag);
end CW_Membership;
-- Given the tag of an object and the tag associated to a type, return
-- true if Obj is in Typ'Class.
-------------------
-- Expanded_Name --
-------------------
function Expanded_Name (T : Tag) return String is
Result : Cstring_Ptr;
TSD_Ptr : Addr_Ptr;
TSD : Type_Specific_Data_Ptr;
begin
if T = No_Tag then
raise Tag_Error;
end if;
TSD_Ptr := To_Addr_Ptr (To_Address (T) - DT_Typeinfo_Ptr_Size);
TSD := To_Type_Specific_Data_Ptr (TSD_Ptr.all);
Result := TSD.Expanded_Name;
return Result (1 .. Length (Result));
end Expanded_Name;
------------------
-- External_Tag --
------------------
function External_Tag (T : Tag) return String is
Result : Cstring_Ptr;
TSD_Ptr : Addr_Ptr;
TSD : Type_Specific_Data_Ptr;
begin
if T = No_Tag then
raise Tag_Error;
end if;
TSD_Ptr := To_Addr_Ptr (To_Address (T) - DT_Typeinfo_Ptr_Size);
TSD := To_Type_Specific_Data_Ptr (TSD_Ptr.all);
Result := TSD.External_Tag;
return Result (1 .. Length (Result));
end External_Tag;
---------------------
-- Get_Entry_Index --
---------------------
function Get_Entry_Index (T : Tag; Position : Positive) return Positive is
begin
return SSD (T).SSD_Table (Position).Index;
end Get_Entry_Index;
----------------------
-- Get_Prim_Op_Kind --
----------------------
function Get_Prim_Op_Kind
(T : Tag;
Position : Positive) return Prim_Op_Kind
is
begin
return SSD (T).SSD_Table (Position).Kind;
end Get_Prim_Op_Kind;
----------------------
-- Get_Offset_Index --
----------------------
function Get_Offset_Index
(T : Tag;
Position : Positive) return Positive
is
begin
if Is_Primary_DT (T) then
return Position;
else
return OSD (T).OSD_Table (Position);
end if;
end Get_Offset_Index;
---------------------
-- Get_Tagged_Kind --
---------------------
function Get_Tagged_Kind (T : Tag) return Tagged_Kind is
begin
return DT (T).Tag_Kind;
end Get_Tagged_Kind;
-----------------------------
-- Interface_Ancestor_Tags --
-----------------------------
function Interface_Ancestor_Tags (T : Tag) return Tag_Array is
TSD_Ptr : constant Addr_Ptr :=
To_Addr_Ptr (To_Address (T) - DT_Typeinfo_Ptr_Size);
TSD : constant Type_Specific_Data_Ptr :=
To_Type_Specific_Data_Ptr (TSD_Ptr.all);
Iface_Table : constant Interface_Data_Ptr := TSD.Interfaces_Table;
begin
if Iface_Table = null then
declare
Table : Tag_Array (1 .. 0);
begin
return Table;
end;
else
declare
Table : Tag_Array (1 .. Iface_Table.Nb_Ifaces);
begin
for J in 1 .. Iface_Table.Nb_Ifaces loop
Table (J) := Iface_Table.Ifaces_Table (J).Iface_Tag;
end loop;
return Table;
end;
end if;
end Interface_Ancestor_Tags;
---------------------------------
-- Is_Descendant_At_Same_Level --
---------------------------------
function Is_Descendant_At_Same_Level
(Descendant : Tag;
Ancestor : Tag) return Boolean
is
begin
if Descendant = Ancestor then
return True;
else
declare
D_TSD_Ptr : constant Addr_Ptr :=
To_Addr_Ptr (To_Address (Descendant) - DT_Typeinfo_Ptr_Size);
A_TSD_Ptr : constant Addr_Ptr :=
To_Addr_Ptr (To_Address (Ancestor) - DT_Typeinfo_Ptr_Size);
D_TSD : constant Type_Specific_Data_Ptr :=
To_Type_Specific_Data_Ptr (D_TSD_Ptr.all);
A_TSD : constant Type_Specific_Data_Ptr :=
To_Type_Specific_Data_Ptr (A_TSD_Ptr.all);
begin
return
D_TSD.Access_Level = A_TSD.Access_Level
and then (CW_Membership (Descendant, Ancestor)
or else IW_Membership (D_TSD, Ancestor));
end;
end if;
end Is_Descendant_At_Same_Level;
------------
-- Length --
------------
-- Note: This unit is used in the Ravenscar runtime library, so it cannot
-- depend on System.CTRL. Furthermore, this happens on CPUs where the GCC
-- intrinsic strlen may not be available, so we need to recode our own Ada
-- version here.
function Length (Str : Cstring_Ptr) return Natural is
Len : Integer;
begin
Len := 1;
while Str (Len) /= ASCII.NUL loop
Len := Len + 1;
end loop;
return Len - 1;
end Length;
-------------------
-- Offset_To_Top --
-------------------
function Offset_To_Top
(This : System.Address) return SSE.Storage_Offset
is
Tag_Size : constant SSE.Storage_Count :=
SSE.Storage_Count (1 * (Standard'Address_Size / System.Storage_Unit));
type Storage_Offset_Ptr is access SSE.Storage_Offset;
function To_Storage_Offset_Ptr is
new Unchecked_Conversion (System.Address, Storage_Offset_Ptr);
Curr_DT : Dispatch_Table_Ptr;
begin
Curr_DT := DT (To_Tag_Ptr (This).all);
-- See the documentation of Dispatch_Table_Wrapper.Offset_To_Top
if Curr_DT.Offset_To_Top = SSE.Storage_Offset'Last then
-- The parent record type has variable-size components, so the
-- instance-specific offset is stored in the tagged record, right
-- after the reference to Curr_DT (which is a secondary dispatch
-- table).
return To_Storage_Offset_Ptr (This + Tag_Size).all;
else
-- The offset is compile-time known, so it is simply stored in the
-- Offset_To_Top field.
return Curr_DT.Offset_To_Top;
end if;
end Offset_To_Top;
------------------------
-- Needs_Finalization --
------------------------
function Needs_Finalization (T : Tag) return Boolean is
TSD_Ptr : constant Addr_Ptr :=
To_Addr_Ptr (To_Address (T) - DT_Typeinfo_Ptr_Size);
TSD : constant Type_Specific_Data_Ptr :=
To_Type_Specific_Data_Ptr (TSD_Ptr.all);
begin
return TSD.Needs_Finalization;
end Needs_Finalization;
-----------------
-- Parent_Size --
-----------------
function Parent_Size
(Obj : System.Address;
T : Tag) return SSE.Storage_Count
is
Parent_Slot : constant Positive := 1;
-- The tag of the parent is always in the first slot of the table of
-- ancestor tags.
TSD_Ptr : constant Addr_Ptr :=
To_Addr_Ptr (To_Address (T) - DT_Typeinfo_Ptr_Size);
TSD : constant Type_Specific_Data_Ptr :=
To_Type_Specific_Data_Ptr (TSD_Ptr.all);
-- Pointer to the TSD
Parent_Tag : constant Tag := TSD.Tags_Table (Parent_Slot);
Parent_TSD_Ptr : constant Addr_Ptr :=
To_Addr_Ptr (To_Address (Parent_Tag) - DT_Typeinfo_Ptr_Size);
Parent_TSD : constant Type_Specific_Data_Ptr :=
To_Type_Specific_Data_Ptr (Parent_TSD_Ptr.all);
begin
-- Here we compute the size of the _parent field of the object
return SSE.Storage_Count (Parent_TSD.Size_Func.all (Obj));
end Parent_Size;
----------------
-- Parent_Tag --
----------------
function Parent_Tag (T : Tag) return Tag is
TSD_Ptr : Addr_Ptr;
TSD : Type_Specific_Data_Ptr;
begin
if T = No_Tag then
raise Tag_Error;
end if;
TSD_Ptr := To_Addr_Ptr (To_Address (T) - DT_Typeinfo_Ptr_Size);
TSD := To_Type_Specific_Data_Ptr (TSD_Ptr.all);
-- The Parent_Tag of a root-level tagged type is defined to be No_Tag.
-- The first entry in the Ancestors_Tags array will be null for such
-- a type, but it's better to be explicit about returning No_Tag in
-- this case.
if TSD.Idepth = 0 then
return No_Tag;
else
return TSD.Tags_Table (1);
end if;
end Parent_Tag;
-------------------------------
-- Register_Interface_Offset --
-------------------------------
procedure Register_Interface_Offset
(Prim_T : Tag;
Interface_T : Tag;
Is_Static : Boolean;
Offset_Value : SSE.Storage_Offset;
Offset_Func : Offset_To_Top_Function_Ptr)
is
Prim_DT : constant Dispatch_Table_Ptr := DT (Prim_T);
Iface_Table : constant Interface_Data_Ptr :=
To_Type_Specific_Data_Ptr (Prim_DT.TSD).Interfaces_Table;
begin
-- Save Offset_Value in the table of interfaces of the primary DT.
-- This data will be used by the subprogram "Displace" to give support
-- to backward abstract interface type conversions.
-- Register the offset in the table of interfaces
if Iface_Table /= null then
for Id in 1 .. Iface_Table.Nb_Ifaces loop
if Iface_Table.Ifaces_Table (Id).Iface_Tag = Interface_T then
if Is_Static or else Offset_Value = 0 then
Iface_Table.Ifaces_Table (Id).Static_Offset_To_Top := True;
Iface_Table.Ifaces_Table (Id).Offset_To_Top_Value :=
Offset_Value;
else
Iface_Table.Ifaces_Table (Id).Static_Offset_To_Top := False;
Iface_Table.Ifaces_Table (Id).Offset_To_Top_Func :=
Offset_Func;
end if;
return;
end if;
end loop;
end if;
-- If we arrive here there is some error in the run-time data structure
raise Program_Error;
end Register_Interface_Offset;
-------------------
-- Secondary_Tag --
-------------------
function Secondary_Tag (T, Iface : Tag) return Tag is
Iface_Table : Interface_Data_Ptr;
Obj_DT : Dispatch_Table_Ptr;
begin
if not Is_Primary_DT (T) then
raise Program_Error;
end if;
Obj_DT := DT (T);
Iface_Table := To_Type_Specific_Data_Ptr (Obj_DT.TSD).Interfaces_Table;
if Iface_Table /= null then
for Id in 1 .. Iface_Table.Nb_Ifaces loop
if Iface_Table.Ifaces_Table (Id).Iface_Tag = Iface then
return Iface_Table.Ifaces_Table (Id).Secondary_DT;
end if;
end loop;
end if;
-- If the object does not implement the interface we must raise CE
raise Constraint_Error with "invalid interface conversion";
end Secondary_Tag;
---------------------
-- Set_Entry_Index --
---------------------
procedure Set_Entry_Index
(T : Tag;
Position : Positive;
Value : Positive)
is
begin
SSD (T).SSD_Table (Position).Index := Value;
end Set_Entry_Index;
-------------------------------
-- Set_Dynamic_Offset_To_Top --
-------------------------------
procedure Set_Dynamic_Offset_To_Top
(This : System.Address;
Prim_T : Tag;
Interface_T : Tag;
Offset_Value : SSE.Storage_Offset;
Offset_Func : Offset_To_Top_Function_Ptr)
is
Sec_Base : System.Address;
Sec_DT : Dispatch_Table_Ptr;
begin
-- Save the offset to top field in the secondary dispatch table
if Offset_Value /= 0 then
Sec_Base := This - Offset_Value;
Sec_DT := DT (To_Tag_Ptr (Sec_Base).all);
Sec_DT.Offset_To_Top := SSE.Storage_Offset'Last;
end if;
Register_Interface_Offset
(Prim_T, Interface_T, False, Offset_Value, Offset_Func);
end Set_Dynamic_Offset_To_Top;
----------------------
-- Set_Prim_Op_Kind --
----------------------
procedure Set_Prim_Op_Kind
(T : Tag;
Position : Positive;
Value : Prim_Op_Kind)
is
begin
SSD (T).SSD_Table (Position).Kind := Value;
end Set_Prim_Op_Kind;
end Ada.Tags;
|
-- { dg-do compile }
-- { dg-options "-g -gnatVa" }
with Unchecked_Conversion;
procedure Unchecked_Convert7 is
type BPA is array (1 .. 23) of Boolean;
pragma Pack (BPA);
for BPA'Size use 23;
subtype Byte is Natural range 0 .. 255;
type R is
record
S : Boolean;
E : Byte;
F : BPA;
end record;
for R use
record
S at 0 range 0 .. 0;
E at 0 range 1 .. 8;
F at 0 range 9 .. 31;
end record;
for R'Size use 32;
function Conversion
is new Unchecked_Conversion (Source => R, Target => Float);
F : Float := Conversion (R'(False, Byte'Last, (others => False)));
begin
null;
end;
|
-- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <reznikmm@gmail.com>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
generic
type Float_Type is digits <>;
package Ada.Numerics.Generic_Elementary_Functions is
pragma Pure (Generic_Elementary_Functions);
function Sqrt
(X : Float_Type'Base) return Float_Type'Base;
function Log
(X : Float_Type'Base) return Float_Type'Base;
function Log
(X, Base : Float_Type'Base) return Float_Type'Base;
function Exp
(X : Float_Type'Base) return Float_Type'Base;
function "**" (Left, Right : Float_Type'Base) return Float_Type'Base;
function Sin
(X : Float_Type'Base) return Float_Type'Base;
function Sin
(X, Cycle : Float_Type'Base) return Float_Type'Base;
function Cos
(X : Float_Type'Base) return Float_Type'Base;
function Cos
(X, Cycle : Float_Type'Base) return Float_Type'Base;
function Tan
(X : Float_Type'Base) return Float_Type'Base;
function Tan
(X, Cycle : Float_Type'Base) return Float_Type'Base;
function Cot
(X : Float_Type'Base) return Float_Type'Base;
function Cot
(X, Cycle : Float_Type'Base) return Float_Type'Base;
function Arcsin
(X : Float_Type'Base) return Float_Type'Base;
function Arcsin
(X, Cycle : Float_Type'Base) return Float_Type'Base;
function Arccos
(X : Float_Type'Base) return Float_Type'Base;
function Arccos
(X, Cycle : Float_Type'Base) return Float_Type'Base;
function Arctan (Y : Float_Type'Base;
X : Float_Type'Base := 1.0)
return Float_Type'Base;
function Arctan (Y : Float_Type'Base;
X : Float_Type'Base := 1.0;
Cycle : Float_Type'Base) return Float_Type'Base;
function Arccot (X : Float_Type'Base;
Y : Float_Type'Base := 1.0)
return Float_Type'Base;
function Arccot (X : Float_Type'Base;
Y : Float_Type'Base := 1.0;
Cycle : Float_Type'Base) return Float_Type'Base;
function Sinh
(X : Float_Type'Base) return Float_Type'Base;
function Cosh
(X : Float_Type'Base) return Float_Type'Base;
function Tanh
(X : Float_Type'Base) return Float_Type'Base;
function Coth
(X : Float_Type'Base) return Float_Type'Base;
function Arcsinh
(X : Float_Type'Base) return Float_Type'Base;
function Arccosh
(X : Float_Type'Base) return Float_Type'Base;
function Arctanh
(X : Float_Type'Base) return Float_Type'Base;
function Arccoth
(X : Float_Type'Base) return Float_Type'Base;
end Ada.Numerics.Generic_Elementary_Functions;
|
-----------------------------------------------------------------------
-- dynamo -- Ada Code Generator
-- Copyright (C) 2009, 2010, 2011, 2012, 2015, 2017, 2020 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with GNAT.Command_Line; use GNAT.Command_Line;
with GNAT.Traceback.Symbolic;
with Sax.Readers;
with Ada.Text_IO;
with Ada.Strings.Unbounded;
with Ada.Exceptions;
with Ada.Directories;
with Ada.Command_Line;
with Ada.Environment_Variables;
with Util.Files;
with Util.Log.Loggers;
with Util.Systems.Os;
with Util.Commands;
with Gen.Utils.GNAT;
with Gen.Generator;
with Gen.Commands;
with Gen.Configs;
procedure Dynamo is
use Ada;
use Ada.Strings.Unbounded;
use Ada.Directories;
use Ada.Command_Line;
use Gen.Commands;
procedure Set_Config_Directory (Path : in String;
Silent : in Boolean := False);
procedure Print_Configuration (Generator : in Gen.Generator.Handler);
-- Print environment variable setup
procedure Print_Environment (Generator : in Gen.Generator.Handler;
C_Env : in Boolean := False);
function Get_Installation_Directory return String;
Out_Dir : Unbounded_String;
Config_Dir : Unbounded_String;
Template_Dir : Unbounded_String;
Status : Exit_Status := Success;
Debug : Boolean := False;
Print_Config : Boolean := False;
Print_Env : Boolean := False;
Print_CEnv : Boolean := False;
First : Natural := 0;
-- ------------------------------
-- Print information about dynamo configuration
-- ------------------------------
procedure Print_Configuration (Generator : in Gen.Generator.Handler) is
begin
Ada.Text_IO.Put_Line ("Dynamo version : " & Gen.Configs.VERSION);
Ada.Text_IO.Put_Line ("Config directory : " & Generator.Get_Config_Directory);
Ada.Text_IO.Put_Line ("UML directory : "
& Generator.Get_Parameter (Gen.Configs.GEN_UML_DIR));
Ada.Text_IO.Put_Line ("Templates directory : "
& Generator.Get_Parameter (Gen.Configs.GEN_TEMPLATES_DIRS));
Ada.Text_IO.Put_Line ("GNAT project directory : "
& Generator.Get_Parameter (Gen.Configs.GEN_GNAT_PROJECT_DIRS));
end Print_Configuration;
-- ------------------------------
-- Print environment variable setup
-- ------------------------------
procedure Print_Environment (Generator : in Gen.Generator.Handler;
C_Env : in Boolean := False) is
begin
if C_Env then
Ada.Text_IO.Put ("setenv " & Gen.Utils.GNAT.ADA_PROJECT_PATH_NAME & " """);
else
Ada.Text_IO.Put ("export " & Gen.Utils.GNAT.ADA_PROJECT_PATH_NAME & "=""");
end if;
if Ada.Environment_Variables.Exists (Gen.Utils.GNAT.ADA_PROJECT_PATH_NAME) then
Ada.Text_IO.Put (Ada.Environment_Variables.Value (Gen.Utils.GNAT.ADA_PROJECT_PATH_NAME));
Ada.Text_IO.Put (Util.Systems.Os.Path_Separator);
end if;
Ada.Text_IO.Put_Line (Generator.Get_Parameter (Gen.Configs.GEN_GNAT_PROJECT_DIRS) & """");
end Print_Environment;
-- ------------------------------
-- Verify and set the configuration path
-- ------------------------------
procedure Set_Config_Directory (Path : in String;
Silent : in Boolean := False) is
Log_Path : constant String := Ada.Directories.Compose (Path, "log4j.properties");
begin
-- Ignore if the config directory was already set.
if Length (Config_Dir) > 0 then
return;
end if;
-- Check that we can read some configuration file.
if not Ada.Directories.Exists (Log_Path) then
if not Silent then
Ada.Text_IO.Put_Line ("Invalid config directory: " & Path);
Status := Failure;
end if;
return;
end if;
-- Configure the logs
Util.Log.Loggers.Initialize (Log_Path);
Config_Dir := To_Unbounded_String (Path);
end Set_Config_Directory;
function Get_Installation_Directory return String is
Name : constant String := Ada.Command_Line.Command_Name;
Path : constant String := Ada.Directories.Containing_Directory (Name);
begin
if Path = "." then
return ".";
else
return Ada.Directories.Containing_Directory (Path);
end if;
end Get_Installation_Directory;
begin
Initialize_Option_Scan (Stop_At_First_Non_Switch => True, Section_Delimiters => "targs");
-- Parse the command line
loop
case Getopt ("* v d e E o: t: c:") is
when ASCII.NUL => exit;
when 'o' =>
Out_Dir := To_Unbounded_String (Parameter & "/");
First := First + 1;
when 't' =>
Template_Dir := To_Unbounded_String (Parameter & "/");
First := First + 1;
when 'c' =>
Set_Config_Directory (Parameter);
First := First + 1;
when 'e' =>
Print_Env := True;
when 'E' =>
Print_CEnv := True;
when 'd' =>
Debug := True;
when 'v' =>
Print_Config := True;
when '*' =>
exit;
when others =>
null;
end case;
First := First + 1;
end loop;
if Length (Config_Dir) = 0 then
declare
Dir : constant String := Get_Installation_Directory;
begin
Set_Config_Directory (Compose (Dir, "config"), True);
Set_Config_Directory (Util.Files.Compose (Dir, "share/dynamo/base"), True);
Set_Config_Directory (Gen.Configs.CONFIG_DIR, True);
end;
end if;
if Status /= Success then
Gen.Commands.Short_Help_Usage;
Ada.Command_Line.Set_Exit_Status (Status);
return;
end if;
if Ada.Command_Line.Argument_Count = 0 then
Gen.Commands.Short_Help_Usage;
Set_Exit_Status (Failure);
return;
end if;
declare
use type Gen.Commands.Command_Access;
Args : Util.Commands.Default_Argument_List (First + 1);
Cmd_Name : constant String := Full_Switch;
Cmd : Gen.Commands.Command_Access;
Generator : Gen.Generator.Handler;
begin
if Length (Out_Dir) > 0 then
Gen.Generator.Set_Result_Directory (Generator, To_String (Out_Dir));
end if;
if Length (Template_Dir) > 0 then
Gen.Generator.Set_Template_Directory (Generator, Template_Dir);
end if;
Gen.Generator.Initialize (Generator, Config_Dir, Debug);
if Print_Config then
Print_Configuration (Generator);
return;
elsif Print_Env then
Print_Environment (Generator, False);
return;
elsif Print_CEnv then
Print_Environment (Generator, True);
return;
end if;
Cmd := Gen.Commands.Driver.Find_Command (Cmd_Name);
-- Check that the command exists.
if Cmd = null then
if Cmd_Name'Length > 0 then
Ada.Text_IO.Put_Line ("Invalid command: '" & Cmd_Name & "'");
end if;
Gen.Commands.Short_Help_Usage;
Set_Exit_Status (Failure);
return;
end if;
Cmd.Execute (Cmd_Name, Args, Generator);
Ada.Command_Line.Set_Exit_Status (Gen.Generator.Get_Status (Generator));
end;
exception
when E : Invalid_Switch =>
Ada.Text_IO.Put_Line ("Invalid option: " & Ada.Exceptions.Exception_Message (E));
Gen.Commands.Short_Help_Usage;
Ada.Command_Line.Set_Exit_Status (2);
when E : Gen.Generator.Fatal_Error =>
Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Message (E));
Ada.Command_Line.Set_Exit_Status (1);
when E : Sax.Readers.XML_Fatal_Error =>
Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Message (E));
Ada.Command_Line.Set_Exit_Status (1);
when E : others =>
Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Message (E));
Ada.Text_IO.Put_Line (GNAT.Traceback.Symbolic.Symbolic_Traceback (E));
Ada.Command_Line.Set_Exit_Status (1);
end Dynamo;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . T T Y --
-- --
-- S p e c --
-- --
-- Copyright (C) 2002-2020, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides control over pseudo terminals (ttys)
-- This package is only supported on unix systems. See function TTY_Supported
-- to test dynamically whether other functions of this package can be called.
with System;
with GNAT.OS_Lib;
package GNAT.TTY is
type TTY_Handle is private;
-- Handle for a tty descriptor
function TTY_Supported return Boolean;
-- If True, the other functions of this package can be called. Otherwise,
-- all functions in this package will raise Program_Error if called.
procedure Allocate_TTY (Handle : out TTY_Handle);
-- Allocate a new tty
procedure Reset_TTY (Handle : TTY_Handle);
-- Reset settings of a given tty
procedure Close_TTY (Handle : in out TTY_Handle);
-- Close a given tty
function TTY_Name (Handle : TTY_Handle) return String;
-- Return the external name of a tty. The name depends on the tty handling
-- on the given target. It will typically look like: "/dev/ptya1"
function TTY_Descriptor
(Handle : TTY_Handle) return GNAT.OS_Lib.File_Descriptor;
-- Return the low level descriptor associated with Handle
private
type TTY_Handle is record
Handle : System.Address := System.Null_Address;
end record;
end GNAT.TTY;
|
-- basic_counters.ads
-- Basic non-task safe counters for use with smart_ptrs
-- Copyright (c) 2016, James Humphry
--
-- 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.
pragma Profile (No_Implementation_Extensions);
with Counters_Spec;
package Basic_Counters is
type Counter is record
SP_Count : Natural;
WP_Count : Natural;
end record;
type Counter_Ptr is access Counter;
function Make_New_Counter return Counter_Ptr;
procedure Deallocate_If_Unused (C : in out Counter_Ptr) with Inline;
function Use_Count (C : in Counter) return Natural is
(C.SP_Count) with Inline;
procedure Check_Increment_Use_Count (C : in out Counter) with Inline;
procedure Decrement_Use_Count (C : in out Counter) with Inline;
function Weak_Ptr_Count (C : in Counter) return Natural is
(C.WP_Count) with Inline;
procedure Increment_Weak_Ptr_Count (C : in out Counter) with Inline;
procedure Decrement_Weak_Ptr_Count (C : in out Counter) with Inline;
package Basic_Counters_Spec is new Counters_Spec(Counter => Counter,
Counter_Ptr => Counter_Ptr);
end Basic_Counters;
|
-- CE2410A.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 END_OF_FILE RAISES MODE_ERROR WHEN THE CURRENT
-- MODE IS OUT_FILE.
-- 1) CHECK NON-TEMPORARY FILES.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- CREATE WITH OUT_FILE MODE FOR DIRECT FILES.
-- HISTORY:
-- ABW 08/20/82
-- SPS 09/16/82
-- SPS 11/09/82
-- JBG 02/22/84 CHANGED TO .ADA TEST
-- EG 11/02/84
-- EG 05/16/85
-- GMT 08/05/87 REVISED EXCEPTION HANDLING AND MOVED THE CASE FOR
-- TEMPORARY FILES INTO CE2410B.ADA.
WITH REPORT; USE REPORT;
WITH DIRECT_IO;
PROCEDURE CE2410A IS
PACKAGE DIR IS NEW DIRECT_IO (INTEGER);
USE DIR;
FILE1 : FILE_TYPE;
INT : INTEGER := IDENT_INT (18);
BOOL : BOOLEAN;
INCOMPLETE : EXCEPTION;
BEGIN
TEST ("CE2410A", "CHECK THAT END_OF_FILE RAISES MODE_ERROR WHEN " &
"THE CURRENT MODE IS OUT_FILE AND THE FILE IS " &
"A NON-TEMPORARY FILE.");
BEGIN
CREATE (FILE1, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR | NAME_ERROR =>
NOT_APPLICABLE ("CREATE WITH MODE OUT_FILE NOT " &
"SUPPORTED FOR DIRECT FILES - 1");
RAISE INCOMPLETE;
END;
BEGIN
BOOL := END_OF_FILE (FILE1);
FAILED ("MODE_ERROR NOT RAISED ON END_OF_FILE - 2");
EXCEPTION
WHEN MODE_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED ON " &
"END_OF_FILE - 3");
END;
BEGIN
DELETE (FILE1);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
RESULT ;
EXCEPTION
WHEN INCOMPLETE =>
RESULT;
END CE2410A ;
|
-- Copyright (C) 2019 Thierry Rascle <thierr26@free.fr>
-- MIT license. Please refer to the LICENSE file.
with Ada.Calendar.Formatting;
package body Apsepp.Calendar is
----------------------------------------------------------------------------
Unknown_Time_Zone_Cached_Avail : Boolean := False;
Unknown_Time_Zone_Cached : Boolean;
function Unknown_Time_zone return Boolean is
begin
if not Unknown_Time_Zone_Cached_Avail then
declare
UTC_Time_Offset_Ret : Time_Offset;
pragma Unreferenced (UTC_Time_Offset_Ret);
begin
UTC_Time_Offset_Ret := UTC_Time_Offset;
Unknown_Time_Zone_Cached := False;
exception
when Unknown_Zone_Error => Unknown_Time_Zone_Cached := True;
end;
Unknown_Time_Zone_Cached_Avail := True;
end if;
return Unknown_Time_Zone_Cached;
end Unknown_Time_zone;
----------------------------------------------------------------------------
function To_ISO_8601
(Date : Time;
Time_Zone : Time_Offset := Default_Time_Offset;
Include_Time_Fraction : Boolean := False) return String is
use Formatting;
Negative_Offset : constant Boolean := Time_Zone < 0;
Abs_Offset : constant Time_Offset := (if Negative_Offset then
-Time_Zone
else
Time_Zone);
-----------------------------------------------------
function Abs_Offset_Image return String is
Img : constant String := Image (Duration (Abs_Offset) * 60);
Ret : String (1 .. 6) := (1 => (if Negative_Offset then
'-'
else
'+'),
others => <>);
begin
Ret(2 .. 6) := Img(Img'First .. Img'First + 4);
return Ret;
end Abs_Offset_Image;
-----------------------------------------------------
Img : String := Image (Date, Include_Time_Fraction, Time_Zone)
& (if Time_Zone = 0 then
"Z"
else
Abs_Offset_Image);
begin
Img(11) := 'T';
return Img;
end To_ISO_8601;
----------------------------------------------------------------------------
end Apsepp.Calendar;
|
-----------------------------------------------------------------------
-- html.forms -- ASF HTML Form Components
-- Copyright (C) 2010, 2011, 2012, 2013, 2014, 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 ASF.Components.Holders;
with ASF.Components.Html.Text;
with ASF.Validators;
with ASF.Events.Faces;
with EL.Objects;
with EL.Expressions;
package ASF.Components.Html.Forms is
-- A UIComponent can have several validators. To keep the implementation light and
-- simple, a fixed array is used. Most components will have one or two validators.
-- Define the number of validators per component (UIInput).
MAX_VALIDATORS_PER_COMPONENT : constant Positive := 5;
-- Message displayed when the submitted value is required but is empty.
REQUIRED_MESSAGE_ID : constant String := "asf.faces.component.UIInput.REQUIRED";
-- ------------------------------
-- Form Component
-- ------------------------------
type UIForm is new UIHtmlComponent with private;
type UIForm_Access is access all UIForm'Class;
-- Check whether the form is submitted.
function Is_Submitted (UI : in UIForm) return Boolean;
-- Called during the <b>Apply Request</b> phase to indicate that this
-- form is submitted.
procedure Set_Submitted (UI : in out UIForm);
-- Get the action URL to set on the HTML form
function Get_Action (UI : in UIForm;
Context : in Faces_Context'Class) return String;
overriding
procedure Encode_Begin (UI : in UIForm;
Context : in out Faces_Context'Class);
overriding
procedure Encode_End (UI : in UIForm;
Context : in out Faces_Context'Class);
overriding
procedure Decode (UI : in out UIForm;
Context : in out Faces_Context'Class);
overriding
procedure Process_Decodes (UI : in out UIForm;
Context : in out Faces_Context'Class);
-- ------------------------------
-- Input Component
-- ------------------------------
type UIInput is new Text.UIOutput and Holders.Editable_Value_Holder with private;
type UIInput_Access is access all UIInput'Class;
-- Check if this component has the required attribute set.
function Is_Required (UI : in UIInput;
Context : in Faces_Context'Class) return Boolean;
-- Find the form component which contains the input component.
-- Returns null if the input is not within a form component.
function Get_Form (UI : in UIInput) return UIForm_Access;
-- Get the value of the component. If the component has a submitted value, returns it.
-- If the component has a local value which is not null, returns it.
-- Otherwise, if we have a Value_Expression evaluate and returns the value.
overriding
function Get_Value (UI : in UIInput) return EL.Objects.Object;
-- Convert the string into a value. If a converter is specified on the component,
-- use it to convert the value.
function Convert_Value (UI : in UIInput;
Value : in String;
Context : in Faces_Context'Class) return EL.Objects.Object;
-- Get the input parameter from the submitted context. This operation is called by
-- <tt>Process_Decodes</tt> to retrieve the request parameter associated with the component.
function Get_Parameter (UI : in UIInput;
Context : in Faces_Context'Class) return String;
-- Set the input component as a password field.
procedure Set_Secret (UI : in out UIInput;
Value : in Boolean);
-- Render the input element.
procedure Render_Input (UI : in UIInput;
Context : in out Faces_Context'Class;
Write_Id : in Boolean := True);
overriding
procedure Encode_Begin (UI : in UIInput;
Context : in out Faces_Context'Class);
overriding
procedure Process_Decodes (UI : in out UIInput;
Context : in out Faces_Context'Class);
-- Perform the component tree processing required by the <b>Process Validations</b>
-- phase of the request processing lifecycle for all facets of this component,
-- all children of this component, and this component itself, as follows:
-- <ul>
-- <li>If this component <b>rendered</b> property is false, skip further processing.
-- <li>Call the <b>Process_Validators</b> of all facets and children.
-- <ul>
procedure Process_Validators (UI : in out UIInput;
Context : in out Faces_Context'Class);
overriding
procedure Process_Updates (UI : in out UIInput;
Context : in out Faces_Context'Class);
-- Validate the submitted value.
-- <ul>
-- <li>Retreive the submitted value
-- <li>If the value is null, exit without further processing.
-- <li>Validate the value by calling <b>Validate_Value</b>
-- </ul>
procedure Validate (UI : in out UIInput;
Context : in out Faces_Context'Class);
-- Set the <b>valid</b> property:
-- <ul>
-- <li>If the <b>required</b> property is true, ensure the
-- value is not empty
-- <li>Call the <b>Validate</b> procedure on each validator
-- registered on this component.
-- <li>Set the <b>valid</b> property if all validator passed.
-- </ul>
procedure Validate_Value (UI : in out UIInput;
Value : in EL.Objects.Object;
Context : in out Faces_Context'Class);
-- Add the validator to be used on the component. The ASF implementation limits
-- to 5 the number of validators that can be set on a component (See UIInput).
-- The validator instance will be freed when the editable value holder is deleted
-- unless <b>Shared</b> is true.
overriding
procedure Add_Validator (UI : in out UIInput;
Validator : in ASF.Validators.Validator_Access;
Shared : in Boolean := False);
-- Delete the UI input instance.
overriding
procedure Finalize (UI : in out UIInput);
-- ------------------------------
-- InputTextarea Component
-- ------------------------------
type UIInputTextarea is new UIInput with private;
type UIInputTextarea_Access is access all UIInputTextarea'Class;
-- Render the textarea element.
overriding
procedure Render_Input (UI : in UIInputTextarea;
Context : in out Faces_Context'Class;
Write_Id : in Boolean := True);
-- ------------------------------
-- Input_Hidden Component
-- ------------------------------
type UIInput_Hidden is new UIInput with private;
type UIInput_Hidden_Access is access all UIInput_Hidden'Class;
-- Render the inputHidden element.
overriding
procedure Render_Input (UI : in UIInput_Hidden;
Context : in out Faces_Context'Class;
Write_Id : in Boolean := True);
-- ------------------------------
-- InputFile Component
-- ------------------------------
type UIInput_File is new UIInput with private;
type UIInput_File_Access is access all UIInput_File'Class;
-- Render the input file element.
overriding
procedure Render_Input (UI : in UIInput_File;
Context : in out Faces_Context'Class;
Write_Id : in Boolean := True);
-- Validate the submitted file.
-- <ul>
-- <li>Retreive the submitted value
-- <li>If the value is null, exit without further processing.
-- <li>Validate the value by calling <b>Validate_Value</b>
-- </ul>
overriding
procedure Validate (UI : in out UIInput_File;
Context : in out Faces_Context'Class);
overriding
procedure Process_Updates (UI : in out UIInput_File;
Context : in out Faces_Context'Class);
-- ------------------------------
-- Button Component
-- ------------------------------
type UICommand is new UIHtmlComponent with private;
overriding
procedure Encode_Begin (UI : in UICommand;
Context : in out Faces_Context'Class);
-- Get the value to write on the output.
function Get_Value (UI : in UICommand) return EL.Objects.Object;
-- Set the value to write on the output.
procedure Set_Value (UI : in out UICommand;
Value : in EL.Objects.Object);
-- Get the action method expression to invoke if the command is pressed.
function Get_Action_Expression (UI : in UICommand;
Context : in Faces_Context'Class)
return EL.Expressions.Method_Expression;
overriding
procedure Process_Decodes (UI : in out UICommand;
Context : in out Faces_Context'Class);
-- Broadcast the event to the event listeners installed on this component.
-- Listeners are called in the order in which they were added.
overriding
procedure Broadcast (UI : in out UICommand;
Event : not null access ASF.Events.Faces.Faces_Event'Class;
Context : in out Faces_Context'Class);
private
type Validator is record
Validator : ASF.Validators.Validator_Access := null;
Shared : Boolean := False;
end record;
type Validator_Array is array (1 .. MAX_VALIDATORS_PER_COMPONENT) of Validator;
type UIInput is new Text.UIOutput and Holders.Editable_Value_Holder with record
Submitted_Value : EL.Objects.Object;
Is_Valid : Boolean := False;
Is_Secret : Boolean := False;
Validators : Validator_Array;
end record;
type UIInputTextarea is new UIInput with record
Rows : Natural;
Cols : Natural;
end record;
type UIInput_Hidden is new UIInput with null record;
type UIInput_File is new UIInput with null record;
type UICommand is new UIHtmlComponent with record
Value : EL.Objects.Object;
end record;
type UIForm is new UIHtmlComponent with record
Is_Submitted : Boolean := False;
end record;
end ASF.Components.Html.Forms;
|
--
-- Copyright 2018 The wookey project team <wookey@ssi.gouv.fr>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
with soc.rcc;
-- About SPARK:
-- In this driver implementation, there is no such
-- complex algorithmic requiring effective SPARK prove,
-- as the package body is only composed on registers
-- fields setters and getters. Using SPARK in this
-- package body would be mostly useless in this very
-- case
package body soc.gpio
with spark_mode => off
is
-- Here we choose to use local accessors instead of
-- a full switch case, in order to:
-- 1) reduce the generated asm
-- 2) avoid writting errors in switch/case write which
-- can't be detected through SPARK rules
type t_GPIO_port_access is access all t_GPIO_port;
GPIOx : constant array (t_gpio_port_index) of t_GPIO_port_access :=
(GPIOA'access, GPIOB'access, GPIOC'access, GPIOD'access, GPIOE'access,
GPIOF'access, GPIOG'access, GPIOH'access, GPIOI'access);
-- FIXME - Should be in soc.rcc package
procedure enable_clock
(port : in t_gpio_port_index)
is
begin
case port is
when GPIO_PA => soc.rcc.RCC.AHB1ENR.GPIOAEN := true;
when GPIO_PB => soc.rcc.RCC.AHB1ENR.GPIOBEN := true;
when GPIO_PC => soc.rcc.RCC.AHB1ENR.GPIOCEN := true;
when GPIO_PD => soc.rcc.RCC.AHB1ENR.GPIODEN := true;
when GPIO_PE => soc.rcc.RCC.AHB1ENR.GPIOEEN := true;
when GPIO_PF => soc.rcc.RCC.AHB1ENR.GPIOFEN := true;
when GPIO_PG => soc.rcc.RCC.AHB1ENR.GPIOGEN := true;
when GPIO_PH => soc.rcc.RCC.AHB1ENR.GPIOHEN := true;
when GPIO_PI => soc.rcc.RCC.AHB1ENR.GPIOIEN := true;
end case;
end enable_clock;
procedure set_mode
(port : in t_gpio_port_index;
pin : in t_gpio_pin_index;
mode : in t_pin_mode)
with
refined_global => (output => (gpio_a, gpio_b, gpio_c,
gpio_d, gpio_e, gpio_f,
gpio_g, gpio_h, gpio_i))
is
begin
GPIOx(port).all.MODER.pin(pin) := mode;
end set_mode;
procedure set_type
(port : in t_gpio_port_index;
pin : in t_gpio_pin_index;
otype : in t_pin_output_type)
with
refined_global => (output => (gpio_a, gpio_b, gpio_c,
gpio_d, gpio_e, gpio_f,
gpio_g, gpio_h, gpio_i))
is
begin
GPIOx(port).all.OTYPER.pin(pin) := otype;
end set_type;
procedure set_speed
(port : in t_gpio_port_index;
pin : in t_gpio_pin_index;
ospeed : in t_pin_output_speed)
with
refined_global => (output => (gpio_a, gpio_b, gpio_c,
gpio_d, gpio_e, gpio_f,
gpio_g, gpio_h, gpio_i))
is
begin
GPIOx(port).all.OSPEEDR.pin(pin) := ospeed;
end set_speed;
procedure set_pupd
(port : in t_gpio_port_index;
pin : in t_gpio_pin_index;
pupd : in t_pin_pupd)
with
refined_global => (output => (gpio_a, gpio_b, gpio_c,
gpio_d, gpio_e, gpio_f,
gpio_g, gpio_h, gpio_i))
is
begin
GPIOx(port).all.PUPDR.pin(pin) := pupd;
end set_pupd;
procedure set_bsr_r
(port : in t_gpio_port_index;
pin : in t_gpio_pin_index;
bsr_r : in types.bit)
with
refined_global => (output => (gpio_a, gpio_b, gpio_c,
gpio_d, gpio_e, gpio_f,
gpio_g, gpio_h, gpio_i))
is
begin
GPIOx(port).all.BSRR.BR(pin) := bsr_r;
end set_bsr_r;
procedure set_bsr_s
(port : in t_gpio_port_index;
pin : in t_gpio_pin_index;
bsr_s : in types.bit)
with
refined_global => (output => (gpio_a, gpio_b, gpio_c,
gpio_d, gpio_e, gpio_f,
gpio_g, gpio_h, gpio_i))
is
begin
GPIOx(port).all.BSRR.BS(pin) := bsr_s;
end set_bsr_s;
procedure set_lck
(port : in t_gpio_port_index;
pin : in t_gpio_pin_index;
lck : in t_pin_lock)
with
refined_global => (output => (gpio_a, gpio_b, gpio_c,
gpio_d, gpio_e, gpio_f,
gpio_g, gpio_h, gpio_i))
is
begin
GPIOx(port).all.LCKR.pin(pin) := lck;
end set_lck;
procedure set_af
(port : in t_gpio_port_index;
pin : in t_gpio_pin_index;
af : in t_pin_alt_func)
with
refined_global => (output => (gpio_a, gpio_b, gpio_c,
gpio_d, gpio_e, gpio_f,
gpio_g, gpio_h, gpio_i))
is
begin
if pin < 8 then
GPIOx(port).all.AFRL.pin(pin) := af;
else
GPIOx(port).all.AFRH.pin(pin) := af;
end if;
end set_af;
procedure write_pin
(port : in t_gpio_port_index;
pin : in t_gpio_pin_index;
value : in bit)
with
refined_global => (in_out => (gpio_a, gpio_b, gpio_c,
gpio_d, gpio_e, gpio_f,
gpio_g, gpio_h, gpio_i))
is
begin
GPIOx(port).all.ODR.pin (pin) := value;
end write_pin;
procedure read_pin
(port : in t_gpio_port_index;
pin : in t_gpio_pin_index;
value : out bit)
with
refined_global => (in_out => (gpio_a, gpio_b, gpio_c,
gpio_d, gpio_e, gpio_f,
gpio_g, gpio_h, gpio_i))
is
begin
value := GPIOx(port).all.IDR.pin (pin);
end read_pin;
end soc.gpio;
|
-- Copyright 2015,2016,2017 Steven Stewart-Gallus
--
-- 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 Interfaces;
package body Linted.Windows is
package Storage_Elements renames System.Storage_Elements;
use type Interfaces.Unsigned_32;
use type Storage_Elements.Storage_Offset;
procedure From_Storage (S : Storage; W : out Window) is
begin
W :=
Window
(Interfaces.Unsigned_32 (S (1)) or
Interfaces.Shift_Left (Interfaces.Unsigned_32 (S (2)), 8) or
Interfaces.Shift_Left (Interfaces.Unsigned_32 (S (3)), 16) or
Interfaces.Shift_Left (Interfaces.Unsigned_32 (S (4)), 24));
end From_Storage;
end Linted.Windows;
|
-------------------------------------------------------------------------
-- GL.Buffer.general - a generic for producing the various types of openGL vertex buffer objects.
--
-- Copyright (c) Rod Kay 2007
-- AUSTRALIA
-- Permission granted to use this software, without any warranty,
-- for any purpose, provided this copyright note remains attached
-- and unmodified if sources are distributed further.
-------------------------------------------------------------------------
with Interfaces.C.Pointers;
generic
type base_Object is new GL.Buffer.Object with private;
type Index is mod <>;
type Element is private;
type Element_Array is array (Index range <>) of aliased Element;
package GL.Buffer.general is
pragma Elaborate_Body;
type General_Object is new base_Object with private;
function To_Buffer (From : access Element_Array; Usage : VBO_Usage) return General_Object;
procedure Set (Self : in out General_Object;
Set_Position : Positive := 1; -- tbd : make this raise 'constraint_Error' instead of openGL_Error, when bounds are violated.
To : Element_Array);
function Get (Self : access General_Object) return Element_Array;
-- buffer memory map
--
type memory_Map is abstract tagged private;
procedure Release (Self : memory_Map);
--
-- 'release' must be called to release the buffers data back to the GL server.
--
-- May raise Corrupt_Buffer if the Buffer has become corrupt since the data
-- was initially mapped. This can occur for system - specific reasons that affect the availability of graphics memory,
-- such as screen mode changes. In such situations, the data store contents are undefined, and an application
-- reinitialize the data store.
--
Corrupt_Buffer : exception;
type read_only_Map is new memory_Map with private;
function Map (Self : access General_Object) return read_only_Map'Class;
function Get (Self : read_only_Map; Get_Position : Index) return Element;
function Get (Self : read_only_Map; Get_Position : Index; Count : Positive) return Element_Array;
type write_only_Map is new memory_Map with private;
function Map (Self : access General_Object) return write_only_Map'Class;
procedure Set (Self : write_only_Map; Set_Position : Index; To : access Element);
procedure Set (Self : write_only_Map; Set_Position : Index; To : Element);
type read_write_Map is new memory_Map with private;
function Map (Self : access General_Object) return read_write_Map'Class;
function Get (Self : read_write_Map; Get_Position : Index) return Element;
function Get (Self : read_write_Map; Get_Position : Index; Count : Positive) return Element_Array;
procedure Set (Self : read_write_Map; Set_Position : Index; To : access Element);
procedure Set (Self : read_write_Map; Set_Position : Index; To : Element);
private
type General_Object is new base_Object with null record;
default_Terminator : Element; -- no 'i.c.Pointers' subprogram is called which uses this, so a default 'Element' should suffice.
pragma Warnings (Off, """default_Terminator"" may be referenced before it has a value");
package Element_Pointers is new interfaces.C.Pointers (Index, Element, Element_Array, default_Terminator);
pragma Warnings (On, """default_Terminator"" may be referenced before it has a value");
type memory_Map is abstract tagged
record
vbo_Target : GL.VBO_Target;
Data : Element_Pointers.Pointer;
Last : Index;
end record;
type read_only_Map is new memory_Map with null record;
type write_only_Map is new memory_Map with null record;
type read_write_Map is new memory_Map with null record;
end GL.Buffer.general;
|
-- with Ada.Text_IO; -- Debug.
with Ada.Unchecked_Deallocation,
Ada.Strings.Fixed,
Ada.Characters.Handling;
package body ARM_Database is
--
-- Ada reference manual formatter (ARM_Form).
--
-- This package contains the database to store items for non-normative
-- appendixes.
--
-- ---------------------------------------
-- Copyright 2000, 2004, 2005, 2006, 2009, 2011, 2012
-- AXE Consultants. All rights reserved.
-- P.O. Box 1512, Madison WI 53701
-- E-Mail: randy@rrsoftware.com
--
-- ARM_Form is free software: you can redistribute it and/or modify
-- it under the terms of the GNU General Public License version 3
-- as published by the Free Software Foundation.
--
-- AXE CONSULTANTS MAKES THIS TOOL AND SOURCE CODE AVAILABLE ON AN "AS IS"
-- BASIS AND MAKES NO WARRANTY, EXPRESS OR IMPLIED, AS TO THE ACCURACY,
-- CAPABILITY, EFFICIENCY, MERCHANTABILITY, OR FUNCTIONING OF THIS TOOL.
-- IN NO EVENT WILL AXE CONSULTANTS BE LIABLE FOR ANY GENERAL,
-- CONSEQUENTIAL, INDIRECT, INCIDENTAL, EXEMPLARY, OR SPECIAL DAMAGES,
-- EVEN IF AXE CONSULTANTS HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
-- DAMAGES.
--
-- A copy of the GNU General Public License is available in the file
-- gpl-3-0.txt in the standard distribution of the ARM_Form tool.
-- Otherwise, see <http://www.gnu.org/licenses/>.
--
-- If the GPLv3 license is not satisfactory for your needs, a commercial
-- use license is available for this tool. Contact Randy at AXE Consultants
-- for more information.
--
-- ---------------------------------------
--
-- Edit History:
--
-- 5/16/00 - RLB - Created package.
-- 8/28/00 - RLB - Added revision info to database.
-- 10/28/04 - RLB - Added Inserted_Normal_Number change kind.
-- 11/02/04 - RLB - Added Deleted_Inserted_Number change kind.
-- 12/06/04 - RLB - Added Revised_Inserted_Number change kind.
-- 12/14/04 - RLB - Made the hang item bigger.
-- 1/19/05 - RLB - Added Added_Version.
-- 10/17/05 - RLB - Fixed indexing of the Glossary.
-- 10/18/06 - RLB - Added No_Deleted_Paragraph_Messages to Report.
-- 11/30/09 - RLB - Made the hang item bigger again (to make room to
-- handle commands like @ChgAdded).
-- 10/18/11 - RLB - Changed to GPLv3 license.
-- 10/20/11 - RLB - Added Initial_Version parameter.
-- 3/19/12 - RLB - Added code to suppress indexing of deleted glossary items.
type String_Ptr is access String;
type Item is record
Next : Item_List;
Sort_Key : String(1 .. 50);
Hang : String(1 .. 75);
Hang_Len : Natural;
Text : String_Ptr;
Change_Kind : Paragraph_Change_Kind_Type;
Version : Character;
Initial_Version : Character;
end record;
procedure Free is new Ada.Unchecked_Deallocation (Item, Item_List);
procedure Free is new Ada.Unchecked_Deallocation (String, String_Ptr);
procedure Create (Database_Object : in out Database_Type) is
-- Initialize a database object.
begin
Database_Object.Is_Valid := True;
Database_Object.List := null;
Database_Object.Item_Count := 0;
end Create;
procedure Destroy (Database_Object : in out Database_Type) is
-- Destroy a database object, freeing any resources used.
Temp : Item_List;
begin
if not Database_Object.Is_Valid then
raise Not_Valid_Error;
end if;
while Database_Object.List /= null loop
Temp := Database_Object.List;
Database_Object.List := Temp.Next;
Free (Temp.Text);
Free (Temp);
end loop;
Database_Object.Is_Valid := False;
end Destroy;
procedure Insert (Database_Object : in out Database_Type;
Sort_Key : in String;
Hang_Item : in String;
Text : in String;
Change_Kind : in Paragraph_Change_Kind_Type := ARM_Database.None;
Version : in Character := '0';
Initial_Version : in Character := '0') is
-- Insert an item into the database object.
-- Sort_Key is the string on which this item will be sorted (if it
-- is sorted). Hang_Item is the item which hangs out for the item
-- in the report (if any). Text is the text for the item; the text
-- may include formatting codes. Change_Kind and Version are the
-- revision status for this item. Initial_Version is the version of
-- the initial text for this item.
Temp_Item : Item;
begin
if not Database_Object.Is_Valid then
raise Not_Valid_Error;
end if;
Ada.Strings.Fixed.Move (Target => Temp_Item.Sort_Key,
Source => Ada.Characters.Handling.To_Lower(Sort_Key),
Drop => Ada.Strings.Right,
Pad => ' ');
Ada.Strings.Fixed.Move (Target => Temp_Item.Hang,
Source => Hang_Item,
Drop => Ada.Strings.Error,
Pad => ' ');
Temp_Item.Hang_Len := Hang_Item'Length;
-- Note: If this second item doesn't fit, we error so we can make
-- the size larger.
Temp_Item.Text := new String'(Text);
Temp_Item.Change_Kind := Change_Kind;
Temp_Item.Version := Version;
Temp_Item.Initial_Version := Initial_Version;
Temp_Item.Next := Database_Object.List;
Database_Object.List := new Item'(Temp_Item);
Database_Object.Item_Count := Database_Object.Item_Count + 1;
end Insert;
--generic
-- with procedure Format_Text (Text : in String;
-- Text_Name : in String);
procedure Report (Database_Object : in out Database_Type;
In_Format : in Format_Type;
Sorted : in Boolean;
Added_Version : Character := '0';
No_Deleted_Paragraph_Messages : in Boolean := False) is
-- Output the items with the appropriate format to the
-- "Format_Text" routine. "Format_Text" allows all commands
-- for the full formatter. (Text_Name is an identifying name
-- for error messages). This is an added list for Added_Version
-- ('0' meaning it is not added); in that case, use normal numbers
-- for items with a version less than or equal to Added_Version.
-- (This is intended to be used to output the items to
-- appropriate Format and Output objects; but we can't do that
-- directly because that would make this unit recursive with
-- ARM_Format.
-- No paragraphs will be have deleted paragraph messages if
-- No_Deleted_Paragraph_Messages is True.
Temp : Item_List;
function Change_if_Needed (Item : in Item_List) return String is
begin
-- Note: In the report, we always decide inserted/not inserted
-- as determined by the initial version number, and not the
-- original class.
case Item.Change_Kind is
when None => return "";
when Inserted | Inserted_Normal_Number =>
if Item.Initial_Version <= Added_Version then
return "@ChgRef{Version=[" & Item.Version &
"],Kind=[AddedNormal]}";
else
return "@ChgRef{Version=[" & Item.Version &
"],Kind=[Added]}";
end if;
when Revised | Revised_Inserted_Number =>
if Item.Initial_Version <= Added_Version then
return "@ChgRef{Version=[" & Item.Version &
"],Kind=[Revised]}";
else
return "@ChgRef{Version=[" & Item.Version &
"],Kind=[RevisedAdded]}";
end if;
when Deleted | Deleted_Inserted_Number =>
if Item.Initial_Version <= Added_Version then
if No_Deleted_Paragraph_Messages then
return "@ChgRef{Version=[" & Item.Version &
"],Kind=[DeletedNoDelMsg]}";
else
return "@ChgRef{Version=[" & Item.Version &
"],Kind=[Deleted]}";
end if;
else
if No_Deleted_Paragraph_Messages then
return "@ChgRef{Version=[" & Item.Version &
"],Kind=[DeletedAddedNoDelMsg]}";
else
return "@ChgRef{Version=[" & Item.Version &
"],Kind=[DeletedAdded]}";
end if;
end if;
when Deleted_No_Delete_Message |
Deleted_Inserted_Number_No_Delete_Message =>
if Item.Initial_Version <= Added_Version then
return "@ChgRef{Version=[" & Item.Version &
"],Kind=[DeletedNoDelMsg]}";
else
return "@ChgRef{Version=[" & Item.Version &
"],Kind=[DeletedAddedNoDelMsg]}";
end if;
end case;
end Change_if_Needed;
begin
if not Database_Object.Is_Valid then
raise Not_Valid_Error;
end if;
if Sorted then
declare
Items : array (1..Database_Object.Item_Count) of Item_List;
begin
-- Load the items:
Temp := Database_Object.List;
for I in Items'range loop
Items(I) := Temp;
Temp := Temp.Next;
end loop;
-- Sort the items array (use an insertion sort because it is
-- stable):
declare
Left : Natural; -- Left sorting stop
begin
for Right In Items'First+1 .. Items'Last loop -- Right sorting stop
Temp := Items(Right);
Left := Right - 1;
while Temp.Sort_Key <= Items(Left).Sort_Key loop -- Switch items
Items(Left + 1) := Items(Left);
Left := Left - 1;
exit when Left = 0;
end loop;
Items(Left + 1) := Temp;
end loop;
end;
-- Relink the items in the sorted order:
for I in Items'First .. Items'Last - 1 loop
Items(I).Next := Items(I+1);
end loop;
if Items'Length > 0 then
Items(Items'Last).Next := null;
Database_Object.List := Items(1);
else
Database_Object.List := null;
end if;
end;
end if;
case In_Format is
when Hanging_List =>
Format_Text ("@begin(description)" & Ascii.LF, "Prefix");
Temp := Database_Object.List;
while Temp /= null loop
--** Debug:
--Ada.Text_IO.Put_Line ("^^ " & Paragraph_Change_Kind_Type'Image(Temp.Change_Kind) &
-- " for " & Temp.Hang(1..Temp.Hang_Len) & " ref=" & Change_if_Needed (Temp));
--Ada.Text_IO.Put_Line (" " & Change_if_Needed (Temp) &
--Temp.Hang(1..Temp.Hang_Len) & "@\" &
--Temp.Text.all & Ascii.LF & Ascii.LF);
Format_Text (Change_if_Needed (Temp) &
Temp.Hang(1..Temp.Hang_Len) & "@\" &
Temp.Text.all & Ascii.LF & Ascii.LF, Temp.Sort_Key);
Temp := Temp.Next;
end loop;
Format_Text ("@end(description)" & Ascii.LF, "Suffix");
when Bullet_List =>
Format_Text ("@begin(itemize)" & Ascii.LF, "Prefix");
Temp := Database_Object.List;
while Temp /= null loop
Format_Text (Change_if_Needed (Temp) &
Temp.Text.all & Ascii.LF & Ascii.LF, Temp.Sort_Key);
Temp := Temp.Next;
end loop;
Format_Text ("@end(itemize)" & Ascii.LF, "Suffix");
when Normal_List =>
Format_Text ("@begin(intro)" & Ascii.LF, "Prefix");
Temp := Database_Object.List;
while Temp /= null loop
Format_Text (Change_if_Needed (Temp) &
Temp.Text.all & Ascii.LF & Ascii.LF, Temp.Sort_Key);
Temp := Temp.Next;
end loop;
Format_Text ("@end(intro)" & Ascii.LF, "Suffix");
when Normal_Indexed_List =>
Format_Text ("@begin(intro)" & Ascii.LF, "Prefix");
Temp := Database_Object.List;
while Temp /= null loop
case Temp.Change_Kind is
when None |
Inserted | Inserted_Normal_Number |
Revised | Revised_Inserted_Number =>
--** Debug:
--Ada.Text_IO.Put_Line("Format " & Change_if_Needed (Temp) &
-- "@defn{" & Ada.Strings.Fixed.Trim (Temp.Sort_Key, Ada.Strings.Right) & "}" & Ascii.LF &
-- Temp.Text.all);
-- Index this item.
Format_Text (Change_if_Needed (Temp) &
"@defn{" & Ada.Strings.Fixed.Trim (Temp.Sort_Key, Ada.Strings.Right) & "}" & Ascii.LF &
Temp.Text.all & Ascii.LF & Ascii.LF, Temp.Sort_Key);
when Deleted | Deleted_Inserted_Number |
Deleted_No_Delete_Message |
Deleted_Inserted_Number_No_Delete_Message =>
--** Debug:
--Ada.Text_IO.Put_Line("Format " & Change_if_Needed (Temp) & Ascii.LF &
-- Temp.Text.all);
-- Don't index deleted items.
Format_Text (Change_if_Needed (Temp) & Ascii.LF &
Temp.Text.all & Ascii.LF & Ascii.LF, Temp.Sort_Key);
end case;
Temp := Temp.Next;
end loop;
Format_Text ("@end(intro)" & Ascii.LF, "Suffix");
end case;
end Report;
end ARM_Database;
|
pragma Ada_2012;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
limited with bits_types_struct_timeval_h;
limited with bits_types_struct_timespec_h;
limited with bits_types_u_sigset_t_h;
package sys_select_h is
-- unsupported macro: FD_SETSIZE __FD_SETSIZE
-- unsupported macro: NFDBITS __NFDBITS
-- arg-macro: procedure FD_SET (fd, fdsetp)
-- __FD_SET (fd, fdsetp)
-- arg-macro: procedure FD_CLR (fd, fdsetp)
-- __FD_CLR (fd, fdsetp)
-- arg-macro: procedure FD_ISSET (fd, fdsetp)
-- __FD_ISSET (fd, fdsetp)
-- arg-macro: procedure FD_ZERO (fdsetp)
-- __FD_ZERO (fdsetp)
-- `fd_set' type and related macros, and `select'/`pselect' declarations.
-- Copyright (C) 1996-2021 Free Software Foundation, Inc.
-- This file is part of the GNU C Library.
-- The GNU C Library is free software; you can redistribute it and/or
-- modify it under the terms of the GNU Lesser General Public
-- License as published by the Free Software Foundation; either
-- version 2.1 of the License, or (at your option) any later version.
-- The GNU C Library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- Lesser General Public License for more details.
-- You should have received a copy of the GNU Lesser General Public
-- License along with the GNU C Library; if not, see
-- <https://www.gnu.org/licenses/>.
-- POSIX 1003.1g: 6.2 Select from File Descriptor Sets <sys/select.h>
-- Get definition of needed basic types.
-- Get __FD_* definitions.
-- Get sigset_t.
-- Get definition of timer specification structures.
-- The fd_set member is required to be an array of longs.
subtype uu_fd_mask is long; -- /usr/include/sys/select.h:49
-- Some versions of <linux/posix_types.h> define this macros.
-- It's easier to assume 8-bit bytes than to get CHAR_BIT.
-- fd_set for select and pselect.
-- XPG4.2 requires this member name. Otherwise avoid the name
-- from the global namespace.
-- skipped anonymous struct anon_2
type fd_set_array947 is array (0 .. 15) of aliased uu_fd_mask;
type fd_set is record
fds_bits : aliased fd_set_array947; -- /usr/include/sys/select.h:64
end record
with Convention => C_Pass_By_Copy; -- /usr/include/sys/select.h:70
-- Maximum number of file descriptors in `fd_set'.
-- Sometimes the fd_set member is assumed to have this type.
subtype fd_mask is uu_fd_mask; -- /usr/include/sys/select.h:77
-- Number of bits per word of `fd_set' (some code assumes this is 32).
-- Access macros for `fd_set'.
-- Check the first NFDS descriptors each in READFDS (if not NULL) for read
-- readiness, in WRITEFDS (if not NULL) for write readiness, and in EXCEPTFDS
-- (if not NULL) for exceptional conditions. If TIMEOUT is not NULL, time out
-- after waiting the interval specified therein. Returns the number of ready
-- descriptors, or -1 for errors.
-- This function is a cancellation point and therefore not marked with
-- __THROW.
function c_select
(uu_nfds : int;
uu_readfds : access fd_set;
uu_writefds : access fd_set;
uu_exceptfds : access fd_set;
uu_timeout : access bits_types_struct_timeval_h.timeval) return int -- /usr/include/sys/select.h:101
with Import => True,
Convention => C,
External_Name => "select";
-- Same as above only that the TIMEOUT value is given with higher
-- resolution and a sigmask which is been set temporarily. This version
-- should be used.
-- This function is a cancellation point and therefore not marked with
-- __THROW.
function pselect
(uu_nfds : int;
uu_readfds : access fd_set;
uu_writefds : access fd_set;
uu_exceptfds : access fd_set;
uu_timeout : access constant bits_types_struct_timespec_h.timespec;
uu_sigmask : access constant bits_types_u_sigset_t_h.uu_sigset_t) return int -- /usr/include/sys/select.h:113
with Import => True,
Convention => C,
External_Name => "pselect";
-- Define some inlines helping to catch common problems.
end sys_select_h;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with swig;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_get_minmax_reply_t is
-- Item
--
type Item is record
response_type : aliased Interfaces.Unsigned_8;
pad0 : aliased Interfaces.Unsigned_8;
sequence : aliased Interfaces.Unsigned_16;
length : aliased Interfaces.Unsigned_32;
pad1 : aliased swig.int8_t_Array (0 .. 23);
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_glx_get_minmax_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_minmax_reply_t.Item,
Element_Array => xcb.xcb_glx_get_minmax_reply_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_glx_get_minmax_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_minmax_reply_t.Pointer,
Element_Array => xcb.xcb_glx_get_minmax_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_minmax_reply_t;
|
-- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <reznikmm@gmail.com>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
generic procedure Unchecked_Deallocation renames Ada.Unchecked_Deallocation;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S T A N D --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992,1993,1994,1995 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System; use System;
with Tree_IO; use Tree_IO;
package body Stand is
---------------
-- Tree_Read --
---------------
procedure Tree_Read is
begin
Tree_Read_Data (Standard_Entity'Address,
Standard_Entity_Array_Type'Size / Storage_Unit);
Tree_Read_Int (Int (Standard_Package_Node));
Tree_Read_Int (Int (Last_Standard_Node_Id));
Tree_Read_Int (Int (Last_Standard_List_Id));
Tree_Read_Int (Int (Standard_Void_Type));
Tree_Read_Int (Int (Standard_Exception_Type));
Tree_Read_Int (Int (Standard_A_String));
Tree_Read_Int (Int (Any_Id));
Tree_Read_Int (Int (Any_Type));
Tree_Read_Int (Int (Any_Access));
Tree_Read_Int (Int (Any_Array));
Tree_Read_Int (Int (Any_Boolean));
Tree_Read_Int (Int (Any_Character));
Tree_Read_Int (Int (Any_Composite));
Tree_Read_Int (Int (Any_Discrete));
Tree_Read_Int (Int (Any_Fixed));
Tree_Read_Int (Int (Any_Integer));
Tree_Read_Int (Int (Any_Numeric));
Tree_Read_Int (Int (Any_Real));
Tree_Read_Int (Int (Any_Scalar));
Tree_Read_Int (Int (Any_String));
Tree_Read_Int (Int (Universal_Integer));
Tree_Read_Int (Int (Universal_Real));
Tree_Read_Int (Int (Universal_Fixed));
Tree_Read_Int (Int (Standard_Integer_8));
Tree_Read_Int (Int (Standard_Integer_16));
Tree_Read_Int (Int (Standard_Integer_32));
Tree_Read_Int (Int (Standard_Integer_64));
Tree_Read_Int (Int (Abort_Signal));
Tree_Read_Int (Int (Standard_Op_Rotate_Left));
Tree_Read_Int (Int (Standard_Op_Rotate_Right));
Tree_Read_Int (Int (Standard_Op_Shift_Left));
Tree_Read_Int (Int (Standard_Op_Shift_Right));
Tree_Read_Int (Int (Standard_Op_Shift_Right_Arithmetic));
end Tree_Read;
----------------
-- Tree_Write --
----------------
procedure Tree_Write is
begin
Tree_Write_Data (Standard_Entity'Address,
Standard_Entity_Array_Type'Size / Storage_Unit);
Tree_Write_Int (Int (Standard_Package_Node));
Tree_Write_Int (Int (Last_Standard_Node_Id));
Tree_Write_Int (Int (Last_Standard_List_Id));
Tree_Write_Int (Int (Standard_Void_Type));
Tree_Write_Int (Int (Standard_Exception_Type));
Tree_Write_Int (Int (Standard_A_String));
Tree_Write_Int (Int (Any_Id));
Tree_Write_Int (Int (Any_Type));
Tree_Write_Int (Int (Any_Access));
Tree_Write_Int (Int (Any_Array));
Tree_Write_Int (Int (Any_Boolean));
Tree_Write_Int (Int (Any_Character));
Tree_Write_Int (Int (Any_Composite));
Tree_Write_Int (Int (Any_Discrete));
Tree_Write_Int (Int (Any_Fixed));
Tree_Write_Int (Int (Any_Integer));
Tree_Write_Int (Int (Any_Numeric));
Tree_Write_Int (Int (Any_Real));
Tree_Write_Int (Int (Any_Scalar));
Tree_Write_Int (Int (Any_String));
Tree_Write_Int (Int (Universal_Integer));
Tree_Write_Int (Int (Universal_Real));
Tree_Write_Int (Int (Universal_Fixed));
Tree_Write_Int (Int (Standard_Integer_8));
Tree_Write_Int (Int (Standard_Integer_16));
Tree_Write_Int (Int (Standard_Integer_32));
Tree_Write_Int (Int (Standard_Integer_64));
Tree_Write_Int (Int (Abort_Signal));
Tree_Write_Int (Int (Standard_Op_Rotate_Left));
Tree_Write_Int (Int (Standard_Op_Rotate_Right));
Tree_Write_Int (Int (Standard_Op_Shift_Left));
Tree_Write_Int (Int (Standard_Op_Shift_Right));
Tree_Write_Int (Int (Standard_Op_Shift_Right_Arithmetic));
end Tree_Write;
end Stand;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Matreshka.JSON_Types;
package League.JSON.Arrays.Internals is
pragma Preelaborate;
function Internal
(Self : League.JSON.Arrays.JSON_Array)
return not null Matreshka.JSON_Types.Shared_JSON_Array_Access;
function Create
(Data : not null Matreshka.JSON_Types.Shared_JSON_Array_Access)
return League.JSON.Arrays.JSON_Array;
end League.JSON.Arrays.Internals;
|
--------------------------------------------------------------------------------
-- 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.
--------------------------------------------------------------------------------
with Vulkan.Math.GenDMatrix;
with Vulkan.Math.Dvec4;
use Vulkan.Math.GenDMatrix;
use Vulkan.Math.Dvec4;
--------------------------------------------------------------------------------
--< @group Vulkan Math Basic Types
--------------------------------------------------------------------------------
--< @summary
--< This package provides a single precision floating point matrix with 2 rows
--< and 4 columns.
--------------------------------------------------------------------------------
package Vulkan.Math.Dmat2x4 is
pragma Preelaborate;
pragma Pure;
--< A 2x3 matrix of single-precision floating point numbers.
subtype Vkm_Dmat2x4 is Vkm_Dmat(
last_row_index => 1, last_column_index => 3);
----------------------------------------------------------------------------
--< @summary
--< Constructor for Vkm_Dmat2x4 type.
--<
--< @description
--< Construct a 2x3 matrix with each component set to zero.
--<
--< @return
--< A 2x3 matrix.
----------------------------------------------------------------------------
function Make_Dmat2x4 return Vkm_Dmat2x4 is
(GDM.Make_GenMatrix(cN => 3, rN => 1)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Constructor for Vkm_Dmat2x4 type.
--<
--< @description
--< Construct a 2x3 matrix with each component set to a different value.
--<
--< | value1 value3 value5 value7 |
--< | value2 value4 value6 value8 |
--<
--< @param value1
--< The first value to set for the matrix.
--<
--< @param value2
--< The second value to set for the matrix.
--<
--< @param value3
--< The third value to set for the matrix.
--<
--< @param value4
--< The fourth value to set for the matrix.
--<
--< @param value5
--< The fifth value to set for the matrix.
--<
--< @param value6
--< The sixth value to set for the matrix.
--<
--< @param value7
--< The seventh value to set for the matrix.
--<
--< @param value8
--< The eighth value to set for the matrix.
--<
--< @return
--< A 2x4 matrix.
----------------------------------------------------------------------------
function Make_Dmat2x4 (
value1, value2, value3, value4,
value5, value6, value7, value8 : in Vkm_Double) return Vkm_Dmat2x4 is
(GDM.Make_GenMatrix(
cN => 3, rN => 1,
c0r0_val => value1, c0r1_val => value5,
c1r0_val => value2, c1r1_val => value6,
c2r0_val => value3, c2r1_val => value7,
c3r0_val => value4, c3r1_val => value8)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Constructor for Vkm_Dmat2x4 type.
--<
--< @description
--< Construct a 2x4 matrix with each row set to the value of a 4 dimmensional
--< vector.
--<
--< | value1.x value1.y value1.z value1.w |
--< | value2.x value2.y value2.z value2.w |
--<
--< @param value1
--< The first value to set for the matrix.
--<
--< @param value2
--< The second value to set for the matrix.
--<
--< @return
--< A 2x4 matrix.
----------------------------------------------------------------------------
function Make_Dmat2x4 (
value1, value2 : in Vkm_Dvec4) return Vkm_Dmat2x4 is
(GDM.Make_GenMatrix(
cN => 3, rN => 1,
c0r0_val => value1.x, c0r1_val => value2.x,
c1r0_val => value1.y, c1r1_val => value2.y,
c2r0_val => value1.z, c2r1_val => value2.z,
c3r0_val => value1.w, c3r1_val => value2.w)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Constructor for Vkm_Dmat2x4 type.
--<
--< @description
--< Construct a 2x3 matrix using values from an existing matrix.
--<
--< If the provided matrix has dimmensions that are not the same as this
--< matrix, the corresponding element in the 4x4 identity matrix is used for
--< out of bounds accesses.
--<
--< @param value1
--< The submatrix to extract values from.
--<
--< @return
--< A 2x4 matrix.
----------------------------------------------------------------------------
function Make_Dmat2x4 (
value1 : in Vkm_Dmat) return Vkm_Dmat2x4 is
(GDM.Make_GenMatrix(
cN => 3, rN => 1,
c0r0_val => value1.c0r0, c0r1_val => value1.c0r1,
c1r0_val => value1.c1r0, c1r1_val => value1.c1r1,
c2r0_val => value1.c2r0, c2r1_val => value1.c2r1,
c3r0_val => value1.c3r0, c3r1_val => value1.c3r1)) with Inline;
end Vulkan.Math.Dmat2x4;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 1 9 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
package body System.Pack_19 is
subtype Bit_Order is System.Bit_Order;
Reverse_Bit_Order : constant Bit_Order :=
Bit_Order'Val (1 - Bit_Order'Pos (System.Default_Bit_Order));
subtype Ofs is System.Storage_Elements.Storage_Offset;
subtype Uns is System.Unsigned_Types.Unsigned;
subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7;
use type System.Storage_Elements.Storage_Offset;
use type System.Unsigned_Types.Unsigned;
type Cluster is record
E0, E1, E2, E3, E4, E5, E6, E7 : Bits_19;
end record;
for Cluster use record
E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1;
E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1;
E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1;
E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1;
E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1;
E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1;
E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1;
E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1;
end record;
for Cluster'Size use Bits * 8;
for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment,
1 +
1 * Boolean'Pos (Bits mod 2 = 0) +
2 * Boolean'Pos (Bits mod 4 = 0));
-- Use maximum possible alignment, given the bit field size, since this
-- will result in the most efficient code possible for the field.
type Cluster_Ref is access Cluster;
type Rev_Cluster is new Cluster
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_Cluster_Ref is access Rev_Cluster;
------------
-- Get_19 --
------------
function Get_19
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_19
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => return RC.E0;
when 1 => return RC.E1;
when 2 => return RC.E2;
when 3 => return RC.E3;
when 4 => return RC.E4;
when 5 => return RC.E5;
when 6 => return RC.E6;
when 7 => return RC.E7;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end if;
end Get_19;
------------
-- Set_19 --
------------
procedure Set_19
(Arr : System.Address;
N : Natural;
E : Bits_19;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => RC.E0 := E;
when 1 => RC.E1 := E;
when 2 => RC.E2 := E;
when 3 => RC.E3 := E;
when 4 => RC.E4 := E;
when 5 => RC.E5 := E;
when 6 => RC.E6 := E;
when 7 => RC.E7 := E;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end if;
end Set_19;
end System.Pack_19;
|
pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Strings;
package SDL_SDL_error_h is
-- arg-macro: procedure SDL_OutOfMemory ()
-- SDL_Error(SDL_ENOMEM)
-- arg-macro: procedure SDL_Unsupported ()
-- SDL_Error(SDL_UNSUPPORTED)
procedure SDL_SetError (fmt : Interfaces.C.Strings.chars_ptr -- , ...
); -- ../include/SDL/SDL_error.h:43
pragma Import (C, SDL_SetError, "SDL_SetError");
function SDL_GetError return Interfaces.C.Strings.chars_ptr; -- ../include/SDL/SDL_error.h:44
pragma Import (C, SDL_GetError, "SDL_GetError");
procedure SDL_ClearError; -- ../include/SDL/SDL_error.h:45
pragma Import (C, SDL_ClearError, "SDL_ClearError");
type SDL_errorcode is
(SDL_ENOMEM,
SDL_EFREAD,
SDL_EFWRITE,
SDL_EFSEEK,
SDL_UNSUPPORTED,
SDL_LASTERROR);
pragma Convention (C, SDL_errorcode); -- ../include/SDL/SDL_error.h:62
procedure SDL_Error (code : SDL_errorcode); -- ../include/SDL/SDL_error.h:63
pragma Import (C, SDL_Error, "SDL_Error");
end SDL_SDL_error_h;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>checkAxis_2</name>
<ret_bitwidth>64</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>edge_p1_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>_a</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>edge_p1_y</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_a</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>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>edge_p1_z</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_a</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>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>edge_p2_x</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_b</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>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>edge_p2_y</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_b</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>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>edge_p2_z</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_b</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>242</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>edge_p2_z_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second class_id="11" tracking_level="0" version="0">
<count>3</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>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>255</item>
<item>256</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>edge_p2_y_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>257</item>
<item>258</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>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>edge_p2_x_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>259</item>
<item>260</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>10</id>
<name>edge_p1_z_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>261</item>
<item>262</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>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>edge_p1_y_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>263</item>
<item>264</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>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>edge_p1_x_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>265</item>
<item>266</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>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>tmp_19_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>267</item>
<item>268</item>
</oprand_edges>
<opcode>fsub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</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>14</id>
<name>tmp_21_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>269</item>
<item>270</item>
</oprand_edges>
<opcode>fsub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</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>15</id>
<name>tmp_24_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>271</item>
<item>272</item>
</oprand_edges>
<opcode>fsub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</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>16</id>
<name>bitcast_ln49</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>273</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>trunc_ln49</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>274</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>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>bitcast_ln49_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>275</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>trunc_ln49_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>276</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>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>icmp_ln49_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>277</item>
<item>279</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>icmp_ln49_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>280</item>
<item>281</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>tmp_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>282</item>
<item>283</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>tmp_8</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>284</item>
<item>285</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>bitcast_ln50</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>286</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>trunc_ln50</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>287</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>bitcast_ln50_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>288</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>trunc_ln50_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>289</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>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>icmp_ln50_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>290</item>
<item>291</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>icmp_ln50_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>292</item>
<item>293</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp_s</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>294</item>
<item>295</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_6</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>296</item>
<item>297</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>bitcast_ln51</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>298</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>trunc_ln51</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>299</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>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>bitcast_ln51_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>300</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>trunc_ln51_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>301</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>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>icmp_ln51_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>302</item>
<item>303</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>icmp_ln51_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>304</item>
<item>305</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp_7</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>306</item>
<item>307</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>tmp_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>308</item>
<item>309</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>_ln92</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>92</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>310</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.46</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>collisions_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>collisions</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>312</item>
<item>313</item>
<item>314</item>
<item>315</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>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>k_assign</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>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>317</item>
<item>318</item>
<item>319</item>
<item>320</item>
</oprand_edges>
<opcode>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>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>zext_ln92</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>92</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>321</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>icmp_ln92</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>92</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>322</item>
<item>324</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.98</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>325</item>
<item>327</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.76</m_delay>
<m_topoIndex>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>_ln92</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>92</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>328</item>
<item>329</item>
<item>330</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="_47">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>R_z</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>plane</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>331</item>
</oprand_edges>
<opcode>sitofp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.08</m_delay>
<m_topoIndex>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>PR_z</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>14</lineNumber>
<contextFuncName>vector</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>63</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>vector</second>
</first>
<second>14</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>agg.result.z</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>332</item>
<item>333</item>
</oprand_edges>
<opcode>fsub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>64</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>tmp_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>22</lineNumber>
<contextFuncName>crossProduct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>crossProduct</second>
</first>
<second>22</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>67</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>334</item>
<item>336</item>
</oprand_edges>
<opcode>fmul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.43</m_delay>
<m_topoIndex>65</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>bitcast_ln22</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>22</lineNumber>
<contextFuncName>crossProduct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>crossProduct</second>
</first>
<second>22</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>67</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>337</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>66</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>xor_ln22</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>22</lineNumber>
<contextFuncName>crossProduct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>crossProduct</second>
</first>
<second>22</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>67</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>338</item>
<item>340</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.80</m_delay>
<m_topoIndex>67</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>bitcast_ln22_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>22</lineNumber>
<contextFuncName>crossProduct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>crossProduct</second>
</first>
<second>22</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>67</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>341</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>68</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>norm_y</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>22</lineNumber>
<contextFuncName>crossProduct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>crossProduct</second>
</first>
<second>22</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>67</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>agg.result.x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>342</item>
<item>343</item>
</oprand_edges>
<opcode>fsub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>69</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_i9_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>30</lineNumber>
<contextFuncName>dotProduct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>dotProduct</second>
</first>
<second>30</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>70</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>344</item>
<item>345</item>
</oprand_edges>
<opcode>fmul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.43</m_delay>
<m_topoIndex>70</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>tmp_28_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>30</lineNumber>
<contextFuncName>dotProduct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>dotProduct</second>
</first>
<second>30</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>70</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>346</item>
<item>347</item>
</oprand_edges>
<opcode>fadd</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>73</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>dot</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>30</lineNumber>
<contextFuncName>dotProduct</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>dotProduct</second>
</first>
<second>30</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>70</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>dot</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>348</item>
<item>349</item>
</oprand_edges>
<opcode>fadd</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>77</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>tmp_i11_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>350</item>
<item>351</item>
</oprand_edges>
<opcode>fmul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.43</m_delay>
<m_topoIndex>71</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>tmp_i12_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>352</item>
<item>353</item>
</oprand_edges>
<opcode>fmul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.43</m_delay>
<m_topoIndex>72</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>tmp_15_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>354</item>
<item>355</item>
</oprand_edges>
<opcode>fadd</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>74</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>tmp_17_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>356</item>
<item>357</item>
</oprand_edges>
<opcode>fadd</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>78</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>tmp_18_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>358</item>
<item>359</item>
</oprand_edges>
<opcode>fsub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>80</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>tmp_20_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>360</item>
<item>361</item>
</oprand_edges>
<opcode>fmul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.43</m_delay>
<m_topoIndex>75</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>tmp_22_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>362</item>
<item>363</item>
</oprand_edges>
<opcode>fmul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.43</m_delay>
<m_topoIndex>76</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>tmp_23_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>364</item>
<item>365</item>
</oprand_edges>
<opcode>fadd</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>79</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>tmp_26_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</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>366</item>
<item>367</item>
</oprand_edges>
<opcode>fadd</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>81</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>T</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>34</lineNumber>
<contextFuncName>paramT</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>73</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>paramT</second>
</first>
<second>34</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>T</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>368</item>
<item>369</item>
</oprand_edges>
<opcode>fdiv</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>7.19</m_delay>
<m_topoIndex>82</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>tmp_i14_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>pointOfIntersection</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>76</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOfIntersection</second>
</first>
<second>40</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>370</item>
<item>371</item>
</oprand_edges>
<opcode>fmul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.43</m_delay>
<m_topoIndex>83</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>POI_x</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>pointOfIntersection</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>76</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOfIntersection</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>agg.result.x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>372</item>
<item>373</item>
</oprand_edges>
<opcode>fadd</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>86</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>tmp_12_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>pointOfIntersection</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>76</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOfIntersection</second>
</first>
<second>40</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>374</item>
<item>375</item>
</oprand_edges>
<opcode>fmul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.43</m_delay>
<m_topoIndex>84</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>POI_y</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>pointOfIntersection</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>76</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOfIntersection</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>agg.result.y</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>376</item>
<item>377</item>
</oprand_edges>
<opcode>fadd</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>87</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>tmp_14_i_i</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>pointOfIntersection</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>76</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOfIntersection</second>
</first>
<second>40</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>378</item>
<item>379</item>
</oprand_edges>
<opcode>fmul</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.43</m_delay>
<m_topoIndex>85</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>POI_z</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>pointOfIntersection</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>93</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>lineIntersectsPlane</second>
</first>
<second>76</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOfIntersection</second>
</first>
<second>40</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>agg.result.z</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>380</item>
<item>381</item>
</oprand_edges>
<opcode>fadd</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.58</m_delay>
<m_topoIndex>88</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>tmp</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>383</item>
<item>384</item>
<item>386</item>
<item>388</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>tmp_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>389</item>
<item>390</item>
<item>391</item>
<item>392</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>icmp_ln49</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>393</item>
<item>395</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>or_ln49</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>396</item>
<item>397</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>icmp_ln49_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>398</item>
<item>399</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>or_ln49_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>400</item>
<item>401</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>and_ln49</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>402</item>
<item>403</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>and_ln49_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>404</item>
<item>405</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>89</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>p_a</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_a</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>406</item>
<item>407</item>
<item>408</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.80</m_delay>
<m_topoIndex>90</m_topoIndex>
<m_clusterGroupNumber>2</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>bitcast_ln49_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>409</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>101</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>tmp_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>410</item>
<item>411</item>
<item>412</item>
<item>413</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>102</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>trunc_ln49_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>414</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>103</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>p_Val2_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>val</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>415</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>104</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>tmp_V</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>416</item>
<item>417</item>
<item>418</item>
<item>419</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>105</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>tmp_V_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>420</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>106</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>icmp_ln49_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>421</item>
<item>422</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>107</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>icmp_ln49_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>423</item>
<item>424</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>108</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>or_ln49_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>425</item>
<item>426</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>153</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>icmp_ln49_6</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>427</item>
<item>428</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>109</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>icmp_ln49_7</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>429</item>
<item>430</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>154</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>or_ln49_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>431</item>
<item>432</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.80</m_delay>
<m_topoIndex>155</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>and_ln49_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>433</item>
<item>434</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>156</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>tmp_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>435</item>
<item>436</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>110</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>and_ln49_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>437</item>
<item>438</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>157</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>and_ln49_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>439</item>
<item>440</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>91</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>p_a_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_a</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>441</item>
<item>442</item>
<item>443</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.80</m_delay>
<m_topoIndex>92</m_topoIndex>
<m_clusterGroupNumber>4</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>bitcast_ln49_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>444</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>111</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>tmp_9</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>445</item>
<item>446</item>
<item>447</item>
<item>448</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>112</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_101">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name>trunc_ln49_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>449</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>113</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>105</id>
<name>icmp_ln49_8</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>450</item>
<item>451</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>114</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name>icmp_ln49_9</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>452</item>
<item>453</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>115</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name>or_ln49_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>454</item>
<item>455</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>158</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>108</id>
<name>and_ln49_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>456</item>
<item>457</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>159</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_106">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name>tmp_10</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>458</item>
<item>459</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>116</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_107">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>and_ln49_6</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</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>460</item>
<item>461</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>160</m_topoIndex>
<m_clusterGroupNumber>5</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_108">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>tmp_11</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>462</item>
<item>463</item>
<item>464</item>
<item>465</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_109">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name>tmp_12</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>466</item>
<item>467</item>
<item>468</item>
<item>469</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_110">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name>icmp_ln50</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>470</item>
<item>471</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_111">
<Value>
<Obj>
<type>0</type>
<id>114</id>
<name>or_ln50</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>472</item>
<item>473</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_112">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name>icmp_ln50_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>474</item>
<item>475</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_113">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name>or_ln50_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>476</item>
<item>477</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>54</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_114">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name>and_ln50</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>478</item>
<item>479</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>55</m_topoIndex>
<m_clusterGroupNumber>6</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_115">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name>and_ln50_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>480</item>
<item>481</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>93</m_topoIndex>
<m_clusterGroupNumber>7</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_116">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name>p_a_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_a</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>482</item>
<item>483</item>
<item>484</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.80</m_delay>
<m_topoIndex>94</m_topoIndex>
<m_clusterGroupNumber>7</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_117">
<Value>
<Obj>
<type>0</type>
<id>120</id>
<name>bitcast_ln50_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>485</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>117</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_118">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name>tmp_13</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>486</item>
<item>487</item>
<item>488</item>
<item>489</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>118</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_119">
<Value>
<Obj>
<type>0</type>
<id>122</id>
<name>trunc_ln50_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>490</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>119</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_120">
<Value>
<Obj>
<type>0</type>
<id>123</id>
<name>p_Val2_s</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>val</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>491</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>161</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_121">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name>tmp_V_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>492</item>
<item>493</item>
<item>494</item>
<item>495</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>162</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_122">
<Value>
<Obj>
<type>0</type>
<id>125</id>
<name>tmp_V_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>496</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>163</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_123">
<Value>
<Obj>
<type>0</type>
<id>126</id>
<name>icmp_ln50_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>497</item>
<item>498</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>120</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_124">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name>icmp_ln50_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>499</item>
<item>500</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>121</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_125">
<Value>
<Obj>
<type>0</type>
<id>128</id>
<name>or_ln50_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>501</item>
<item>502</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>164</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_126">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>icmp_ln50_6</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>503</item>
<item>504</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>165</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_127">
<Value>
<Obj>
<type>0</type>
<id>130</id>
<name>icmp_ln50_7</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>505</item>
<item>506</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>166</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_128">
<Value>
<Obj>
<type>0</type>
<id>131</id>
<name>or_ln50_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>507</item>
<item>508</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.80</m_delay>
<m_topoIndex>167</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_129">
<Value>
<Obj>
<type>0</type>
<id>132</id>
<name>and_ln50_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>509</item>
<item>510</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>168</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_130">
<Value>
<Obj>
<type>0</type>
<id>133</id>
<name>tmp_14</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>511</item>
<item>512</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>122</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_131">
<Value>
<Obj>
<type>0</type>
<id>134</id>
<name>and_ln50_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>513</item>
<item>514</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>169</m_topoIndex>
<m_clusterGroupNumber>8</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_132">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name>xor_ln50</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>515</item>
<item>517</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>170</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_133">
<Value>
<Obj>
<type>0</type>
<id>136</id>
<name>and_ln50_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</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>518</item>
<item>519</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>95</m_topoIndex>
<m_clusterGroupNumber>10</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_134">
<Value>
<Obj>
<type>0</type>
<id>137</id>
<name>p_a_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_a</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>520</item>
<item>521</item>
<item>522</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.80</m_delay>
<m_topoIndex>96</m_topoIndex>
<m_clusterGroupNumber>10</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_135">
<Value>
<Obj>
<type>0</type>
<id>138</id>
<name>tmp_15</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>523</item>
<item>524</item>
<item>525</item>
<item>526</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>56</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_136">
<Value>
<Obj>
<type>0</type>
<id>139</id>
<name>tmp_16</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>527</item>
<item>528</item>
<item>529</item>
<item>530</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>57</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_137">
<Value>
<Obj>
<type>0</type>
<id>140</id>
<name>icmp_ln51</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>531</item>
<item>532</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>58</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_138">
<Value>
<Obj>
<type>0</type>
<id>141</id>
<name>or_ln51</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>533</item>
<item>534</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>59</m_topoIndex>
<m_clusterGroupNumber>11</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_139">
<Value>
<Obj>
<type>0</type>
<id>142</id>
<name>icmp_ln51_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>535</item>
<item>536</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>60</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_140">
<Value>
<Obj>
<type>0</type>
<id>143</id>
<name>or_ln51_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>537</item>
<item>538</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>61</m_topoIndex>
<m_clusterGroupNumber>11</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_141">
<Value>
<Obj>
<type>0</type>
<id>144</id>
<name>and_ln51</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>539</item>
<item>540</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>62</m_topoIndex>
<m_clusterGroupNumber>11</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_142">
<Value>
<Obj>
<type>0</type>
<id>145</id>
<name>and_ln51_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>541</item>
<item>542</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>97</m_topoIndex>
<m_clusterGroupNumber>12</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_143">
<Value>
<Obj>
<type>0</type>
<id>146</id>
<name>p_a_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_a</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>543</item>
<item>544</item>
<item>545</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.80</m_delay>
<m_topoIndex>98</m_topoIndex>
<m_clusterGroupNumber>12</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_144">
<Value>
<Obj>
<type>0</type>
<id>147</id>
<name>and_ln51_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>546</item>
<item>547</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>99</m_topoIndex>
<m_clusterGroupNumber>13</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_145">
<Value>
<Obj>
<type>0</type>
<id>148</id>
<name>p_a_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_a</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>548</item>
<item>549</item>
<item>550</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.80</m_delay>
<m_topoIndex>100</m_topoIndex>
<m_clusterGroupNumber>13</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_146">
<Value>
<Obj>
<type>0</type>
<id>149</id>
<name>bitcast_ln51_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>551</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>123</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_147">
<Value>
<Obj>
<type>0</type>
<id>150</id>
<name>tmp_17</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>552</item>
<item>553</item>
<item>554</item>
<item>555</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>124</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_148">
<Value>
<Obj>
<type>0</type>
<id>151</id>
<name>trunc_ln51_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>556</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>125</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_149">
<Value>
<Obj>
<type>0</type>
<id>152</id>
<name>bitcast_ln51_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>557</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>126</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_150">
<Value>
<Obj>
<type>0</type>
<id>153</id>
<name>tmp_18</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>558</item>
<item>559</item>
<item>560</item>
<item>561</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>127</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_151">
<Value>
<Obj>
<type>0</type>
<id>154</id>
<name>trunc_ln51_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>562</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>128</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_152">
<Value>
<Obj>
<type>0</type>
<id>155</id>
<name>icmp_ln51_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>563</item>
<item>564</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>129</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_153">
<Value>
<Obj>
<type>0</type>
<id>156</id>
<name>icmp_ln51_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>565</item>
<item>566</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>130</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_154">
<Value>
<Obj>
<type>0</type>
<id>157</id>
<name>or_ln51_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>567</item>
<item>568</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>171</m_topoIndex>
<m_clusterGroupNumber>14</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_155">
<Value>
<Obj>
<type>0</type>
<id>158</id>
<name>icmp_ln51_6</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>569</item>
<item>570</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>131</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_156">
<Value>
<Obj>
<type>0</type>
<id>159</id>
<name>icmp_ln51_7</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>571</item>
<item>572</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>132</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_157">
<Value>
<Obj>
<type>0</type>
<id>160</id>
<name>or_ln51_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>573</item>
<item>574</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>133</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_158">
<Value>
<Obj>
<type>0</type>
<id>161</id>
<name>and_ln51_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>575</item>
<item>576</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>172</m_topoIndex>
<m_clusterGroupNumber>14</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_159">
<Value>
<Obj>
<type>0</type>
<id>162</id>
<name>tmp_19</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>577</item>
<item>578</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>134</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_160">
<Value>
<Obj>
<type>0</type>
<id>163</id>
<name>and_ln51_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>579</item>
<item>580</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>173</m_topoIndex>
<m_clusterGroupNumber>14</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_161">
<Value>
<Obj>
<type>0</type>
<id>164</id>
<name>and_ln49_7</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>581</item>
<item>582</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>174</m_topoIndex>
<m_clusterGroupNumber>3</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_162">
<Value>
<Obj>
<type>0</type>
<id>165</id>
<name>xor_ln49</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>49</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>49</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>583</item>
<item>584</item>
</oprand_edges>
<opcode>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.80</m_delay>
<m_topoIndex>175</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_163">
<Value>
<Obj>
<type>0</type>
<id>166</id>
<name>or_ln50_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>585</item>
<item>586</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>176</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_164">
<Value>
<Obj>
<type>0</type>
<id>167</id>
<name>or_ln50_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>50</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>587</item>
<item>588</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>177</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_165">
<Value>
<Obj>
<type>0</type>
<id>168</id>
<name>bitcast_ln51_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>589</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>135</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_166">
<Value>
<Obj>
<type>0</type>
<id>169</id>
<name>tmp_20</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>590</item>
<item>591</item>
<item>592</item>
<item>593</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>136</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_167">
<Value>
<Obj>
<type>0</type>
<id>170</id>
<name>trunc_ln51_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>594</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>137</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_168">
<Value>
<Obj>
<type>0</type>
<id>171</id>
<name>icmp_ln51_8</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>595</item>
<item>596</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>138</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_169">
<Value>
<Obj>
<type>0</type>
<id>172</id>
<name>icmp_ln51_9</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>597</item>
<item>598</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>139</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_170">
<Value>
<Obj>
<type>0</type>
<id>173</id>
<name>or_ln51_4</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>599</item>
<item>600</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>178</m_topoIndex>
<m_clusterGroupNumber>15</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_171">
<Value>
<Obj>
<type>0</type>
<id>174</id>
<name>and_ln51_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>601</item>
<item>602</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>179</m_topoIndex>
<m_clusterGroupNumber>15</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_172">
<Value>
<Obj>
<type>0</type>
<id>175</id>
<name>tmp_21</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>603</item>
<item>604</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>140</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_173">
<Value>
<Obj>
<type>0</type>
<id>176</id>
<name>and_ln51_6</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>605</item>
<item>606</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>180</m_topoIndex>
<m_clusterGroupNumber>15</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_174">
<Value>
<Obj>
<type>0</type>
<id>177</id>
<name>and_ln51_7</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>607</item>
<item>608</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>181</m_topoIndex>
<m_clusterGroupNumber>14</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_175">
<Value>
<Obj>
<type>0</type>
<id>178</id>
<name>bitcast_ln51_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>609</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>141</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_176">
<Value>
<Obj>
<type>0</type>
<id>179</id>
<name>tmp_22</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>610</item>
<item>611</item>
<item>612</item>
<item>613</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>142</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_177">
<Value>
<Obj>
<type>0</type>
<id>180</id>
<name>trunc_ln51_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>614</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>143</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_178">
<Value>
<Obj>
<type>0</type>
<id>181</id>
<name>icmp_ln51_10</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>615</item>
<item>616</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.31</m_delay>
<m_topoIndex>144</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_179">
<Value>
<Obj>
<type>0</type>
<id>182</id>
<name>icmp_ln51_11</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>617</item>
<item>618</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.02</m_delay>
<m_topoIndex>145</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_180">
<Value>
<Obj>
<type>0</type>
<id>183</id>
<name>or_ln51_5</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>619</item>
<item>620</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>182</m_topoIndex>
<m_clusterGroupNumber>16</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_181">
<Value>
<Obj>
<type>0</type>
<id>184</id>
<name>and_ln51_8</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>621</item>
<item>622</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>183</m_topoIndex>
<m_clusterGroupNumber>16</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_182">
<Value>
<Obj>
<type>0</type>
<id>185</id>
<name>tmp_23</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>623</item>
<item>624</item>
</oprand_edges>
<opcode>fcmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>4.19</m_delay>
<m_topoIndex>146</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_183">
<Value>
<Obj>
<type>0</type>
<id>186</id>
<name>and_ln51_9</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>625</item>
<item>626</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>184</m_topoIndex>
<m_clusterGroupNumber>16</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_184">
<Value>
<Obj>
<type>0</type>
<id>187</id>
<name>and_ln51_10</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>627</item>
<item>628</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>185</m_topoIndex>
<m_clusterGroupNumber>15</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_185">
<Value>
<Obj>
<type>0</type>
<id>188</id>
<name>or_ln51_6</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>629</item>
<item>630</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>186</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_186">
<Value>
<Obj>
<type>0</type>
<id>189</id>
<name>and_ln51_11</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>631</item>
<item>632</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>187</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_187">
<Value>
<Obj>
<type>0</type>
<id>190</id>
<name>and_ln51_12</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>51</lineNumber>
<contextFuncName>pointOnSegment</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>pointOnSegment</second>
</first>
<second>51</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>633</item>
<item>634</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>188</m_topoIndex>
<m_clusterGroupNumber>9</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_188">
<Value>
<Obj>
<type>0</type>
<id>191</id>
<name>p_Result_s</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>316</lineNumber>
<contextFuncName>fp_struct</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>13</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first>
<second>fp_struct</second>
</first>
<second>316</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>636</item>
<item>637</item>
<item>639</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>189</m_topoIndex>
<m_clusterGroupNumber>17</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_189">
<Value>
<Obj>
<type>0</type>
<id>192</id>
<name>mantissa_V</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>15</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>15</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>mantissa.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>25</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>641</item>
<item>642</item>
<item>643</item>
<item>645</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>190</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_190">
<Value>
<Obj>
<type>0</type>
<id>193</id>
<name>zext_ln682</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>15</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>15</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>79</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>646</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>191</m_topoIndex>
<m_clusterGroupNumber>18</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_191">
<Value>
<Obj>
<type>0</type>
<id>194</id>
<name>zext_ln339</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>339</lineNumber>
<contextFuncName>expv</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first>
<second>expv</second>
</first>
<second>339</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>647</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>147</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_192">
<Value>
<Obj>
<type>0</type>
<id>195</id>
<name>add_ln339</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>339</lineNumber>
<contextFuncName>expv</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first>
<second>expv</second>
</first>
<second>339</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sh</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>649</item>
<item>650</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.30</m_delay>
<m_topoIndex>148</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_193">
<Value>
<Obj>
<type>0</type>
<id>196</id>
<name>isNeg</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>isNeg</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>652</item>
<item>653</item>
<item>655</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>149</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_194">
<Value>
<Obj>
<type>0</type>
<id>197</id>
<name>sub_ln1311</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</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>657</item>
<item>658</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.30</m_delay>
<m_topoIndex>150</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_195">
<Value>
<Obj>
<type>0</type>
<id>198</id>
<name>sext_ln1311</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>659</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>151</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_196">
<Value>
<Obj>
<type>0</type>
<id>199</id>
<name>ush</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sh</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>660</item>
<item>661</item>
<item>662</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.72</m_delay>
<m_topoIndex>152</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_197">
<Value>
<Obj>
<type>0</type>
<id>200</id>
<name>sext_ln1311_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</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>663</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>192</m_topoIndex>
<m_clusterGroupNumber>18</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_198">
<Value>
<Obj>
<type>0</type>
<id>201</id>
<name>sext_ln1311_4</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>25</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>664</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>193</m_topoIndex>
<m_clusterGroupNumber>18</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_199">
<Value>
<Obj>
<type>0</type>
<id>202</id>
<name>zext_ln1287</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>79</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>665</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>194</m_topoIndex>
<m_clusterGroupNumber>18</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_200">
<Value>
<Obj>
<type>0</type>
<id>203</id>
<name>r_V</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>25</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>666</item>
<item>667</item>
</oprand_edges>
<opcode>lshr</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>195</m_topoIndex>
<m_clusterGroupNumber>18</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_201">
<Value>
<Obj>
<type>0</type>
<id>204</id>
<name>r_V_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>79</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>668</item>
<item>669</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>196</m_topoIndex>
<m_clusterGroupNumber>18</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_202">
<Value>
<Obj>
<type>0</type>
<id>205</id>
<name>tmp_27</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>21</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</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>671</item>
<item>672</item>
<item>674</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>197</m_topoIndex>
<m_clusterGroupNumber>18</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_203">
<Value>
<Obj>
<type>0</type>
<id>206</id>
<name>zext_ln662</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>21</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</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>675</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>198</m_topoIndex>
<m_clusterGroupNumber>18</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_204">
<Value>
<Obj>
<type>0</type>
<id>207</id>
<name>tmp_24</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>21</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>677</item>
<item>678</item>
<item>679</item>
<item>681</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>199</m_topoIndex>
<m_clusterGroupNumber>18</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_205">
<Value>
<Obj>
<type>0</type>
<id>208</id>
<name>p_Val2_4</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>682</item>
<item>683</item>
<item>684</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>2.96</m_delay>
<m_topoIndex>200</m_topoIndex>
<m_clusterGroupNumber>18</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_206">
<Value>
<Obj>
<type>0</type>
<id>209</id>
<name>result_V_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>59</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>59</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>result.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>686</item>
<item>687</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>201</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_207">
<Value>
<Obj>
<type>0</type>
<id>210</id>
<name>p_Val2_5</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>59</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>59</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>688</item>
<item>689</item>
<item>690</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>202</m_topoIndex>
<m_clusterGroupNumber>17</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_208">
<Value>
<Obj>
<type>0</type>
<id>211</id>
<name>p_Result_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>316</lineNumber>
<contextFuncName>fp_struct</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>13</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first>
<second>fp_struct</second>
</first>
<second>316</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>691</item>
<item>692</item>
<item>693</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>203</m_topoIndex>
<m_clusterGroupNumber>17</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_209">
<Value>
<Obj>
<type>0</type>
<id>212</id>
<name>mantissa_V_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>15</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>15</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>mantissa.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>25</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>694</item>
<item>695</item>
<item>696</item>
<item>697</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>204</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_210">
<Value>
<Obj>
<type>0</type>
<id>213</id>
<name>zext_ln682_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>15</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>15</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>79</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>698</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>205</m_topoIndex>
<m_clusterGroupNumber>19</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_211">
<Value>
<Obj>
<type>0</type>
<id>214</id>
<name>zext_ln339_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>339</lineNumber>
<contextFuncName>expv</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first>
<second>expv</second>
</first>
<second>339</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>699</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>206</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_212">
<Value>
<Obj>
<type>0</type>
<id>215</id>
<name>add_ln339_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>339</lineNumber>
<contextFuncName>expv</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first>
<second>expv</second>
</first>
<second>339</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sh</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>700</item>
<item>701</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.30</m_delay>
<m_topoIndex>207</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_213">
<Value>
<Obj>
<type>0</type>
<id>216</id>
<name>isNeg_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>isNeg</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>702</item>
<item>703</item>
<item>704</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>208</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_214">
<Value>
<Obj>
<type>0</type>
<id>217</id>
<name>sub_ln1311_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</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>705</item>
<item>706</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.30</m_delay>
<m_topoIndex>209</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_215">
<Value>
<Obj>
<type>0</type>
<id>218</id>
<name>sext_ln1311_2</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>707</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>210</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_216">
<Value>
<Obj>
<type>0</type>
<id>219</id>
<name>ush_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sh</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>708</item>
<item>709</item>
<item>710</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.72</m_delay>
<m_topoIndex>211</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_217">
<Value>
<Obj>
<type>0</type>
<id>220</id>
<name>sext_ln1311_3</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</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>711</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>212</m_topoIndex>
<m_clusterGroupNumber>19</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_218">
<Value>
<Obj>
<type>0</type>
<id>221</id>
<name>sext_ln1311_5</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>25</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>712</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>213</m_topoIndex>
<m_clusterGroupNumber>19</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_219">
<Value>
<Obj>
<type>0</type>
<id>222</id>
<name>zext_ln1287_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>79</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>713</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>214</m_topoIndex>
<m_clusterGroupNumber>19</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_220">
<Value>
<Obj>
<type>0</type>
<id>223</id>
<name>r_V_2</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>25</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>714</item>
<item>715</item>
</oprand_edges>
<opcode>lshr</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>215</m_topoIndex>
<m_clusterGroupNumber>19</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_221">
<Value>
<Obj>
<type>0</type>
<id>224</id>
<name>r_V_3</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>79</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>716</item>
<item>717</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>216</m_topoIndex>
<m_clusterGroupNumber>19</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_222">
<Value>
<Obj>
<type>0</type>
<id>225</id>
<name>tmp_31</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>21</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</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>718</item>
<item>719</item>
<item>720</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>217</m_topoIndex>
<m_clusterGroupNumber>19</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_223">
<Value>
<Obj>
<type>0</type>
<id>226</id>
<name>zext_ln662_1</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>21</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>55</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>721</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>218</m_topoIndex>
<m_clusterGroupNumber>19</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_224">
<Value>
<Obj>
<type>0</type>
<id>227</id>
<name>tmp_25</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>21</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>21</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>55</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>723</item>
<item>724</item>
<item>725</item>
<item>727</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>219</m_topoIndex>
<m_clusterGroupNumber>19</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_225">
<Value>
<Obj>
<type>0</type>
<id>228</id>
<name>select_ln1312</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>18</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>18</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>55</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>728</item>
<item>729</item>
<item>730</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>2.96</m_delay>
<m_topoIndex>220</m_topoIndex>
<m_clusterGroupNumber>19</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_226">
<Value>
<Obj>
<type>0</type>
<id>229</id>
<name>trunc_ln82</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</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>731</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>221</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_227">
<Value>
<Obj>
<type>0</type>
<id>230</id>
<name>sub_ln82</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</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>733</item>
<item>734</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.84</m_delay>
<m_topoIndex>222</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_228">
<Value>
<Obj>
<type>0</type>
<id>231</id>
<name>trunc_ln82_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</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>735</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>223</m_topoIndex>
<m_clusterGroupNumber>17</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_229">
<Value>
<Obj>
<type>0</type>
<id>232</id>
<name>select_ln59</name>
<fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName>
<fileDirectory>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory>
<lineNumber>59</lineNumber>
<contextFuncName>generic_cast_IEEE754&lt;int, 6, float&gt;</contextFuncName>
<inlineStackInfo>
<count>2</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
</second>
</item>
<item>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, 6, float&gt;</second>
</first>
<second>59</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first>
<second>generic_cast_IEEE754&lt;int, float&gt;</second>
</first>
<second>117</second>
</item>
<item>
<first>
<first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first>
<second>__hls_fptosi_float_i32</second>
</first>
<second>51</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>736</item>
<item>737</item>
<item>738</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>224</m_topoIndex>
<m_clusterGroupNumber>17</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_230">
<Value>
<Obj>
<type>0</type>
<id>233</id>
<name>shl_ln</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>740</item>
<item>741</item>
<item>743</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>225</m_topoIndex>
<m_clusterGroupNumber>17</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_231">
<Value>
<Obj>
<type>0</type>
<id>234</id>
<name>trunc_ln82_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>744</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>227</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_232">
<Value>
<Obj>
<type>0</type>
<id>235</id>
<name>shl_ln82_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</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>746</item>
<item>747</item>
<item>749</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>228</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_233">
<Value>
<Obj>
<type>0</type>
<id>236</id>
<name>zext_ln82</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</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>750</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>229</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_234">
<Value>
<Obj>
<type>0</type>
<id>237</id>
<name>add_ln82</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</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>751</item>
<item>752</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>226</m_topoIndex>
<m_clusterGroupNumber>17</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_235">
<Value>
<Obj>
<type>0</type>
<id>238</id>
<name>add_ln82_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</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>753</item>
<item>754</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>230</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_236">
<Value>
<Obj>
<type>0</type>
<id>239</id>
<name>zext_ln97</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>97</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</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>755</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>231</m_topoIndex>
<m_clusterGroupNumber>20</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_237">
<Value>
<Obj>
<type>0</type>
<id>240</id>
<name>shl_ln97</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>97</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>97</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>757</item>
<item>758</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>232</m_topoIndex>
<m_clusterGroupNumber>20</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_238">
<Value>
<Obj>
<type>0</type>
<id>241</id>
<name>add_ln82_2</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>760</item>
<item>761</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.76</m_delay>
<m_topoIndex>233</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_239">
<Value>
<Obj>
<type>0</type>
<id>242</id>
<name>tmp_26</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</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>763</item>
<item>764</item>
<item>765</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>234</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_240">
<Value>
<Obj>
<type>0</type>
<id>243</id>
<name>sext_ln82</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</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>766</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>235</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_241">
<Value>
<Obj>
<type>0</type>
<id>244</id>
<name>add_ln82_3</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>shiftAmount</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>98</second>
</item>
<item>
<first>
<first>src/honeybee.c</first>
<second>shiftAmount</second>
</first>
<second>82</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>767</item>
<item>768</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.89</m_delay>
<m_topoIndex>236</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_242">
<Value>
<Obj>
<type>0</type>
<id>245</id>
<name>zext_ln98</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>98</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>769</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>237</m_topoIndex>
<m_clusterGroupNumber>20</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_243">
<Value>
<Obj>
<type>0</type>
<id>246</id>
<name>shl_ln98</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>98</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>770</item>
<item>771</item>
</oprand_edges>
<opcode>shl</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>238</m_topoIndex>
<m_clusterGroupNumber>20</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_244">
<Value>
<Obj>
<type>0</type>
<id>247</id>
<name>or_ln98</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>98</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>772</item>
<item>773</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>239</m_topoIndex>
<m_clusterGroupNumber>20</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_245">
<Value>
<Obj>
<type>0</type>
<id>248</id>
<name>collisions</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>774</item>
<item>775</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>240</m_topoIndex>
<m_clusterGroupNumber>20</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_246">
<Value>
<Obj>
<type>0</type>
<id>249</id>
<name>collisions_1</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>96</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>776</item>
<item>777</item>
<item>778</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>2.93</m_delay>
<m_topoIndex>241</m_topoIndex>
<m_clusterGroupNumber>20</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_247">
<Value>
<Obj>
<type>0</type>
<id>250</id>
<name>_ln92</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>92</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>779</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>242</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_248">
<Value>
<Obj>
<type>0</type>
<id>252</id>
<name>_ln127</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>/mnt/hgfs/Thesis/HoneyBee</fileDirectory>
<lineNumber>127</lineNumber>
<contextFuncName>checkAxis</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>checkAxis</second>
</first>
<second>127</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>780</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>63</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>25</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_249">
<Value>
<Obj>
<type>2</type>
<id>278</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_250">
<Value>
<Obj>
<type>2</type>
<id>311</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="_251">
<Value>
<Obj>
<type>2</type>
<id>316</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_252">
<Value>
<Obj>
<type>2</type>
<id>323</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_253">
<Value>
<Obj>
<type>2</type>
<id>326</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_254">
<Value>
<Obj>
<type>2</type>
<id>335</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>1</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_255">
<Value>
<Obj>
<type>2</type>
<id>339</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>2147483648</content>
</item>
<item class_id_reference="16" object_id="_256">
<Value>
<Obj>
<type>2</type>
<id>385</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>23</content>
</item>
<item class_id_reference="16" object_id="_257">
<Value>
<Obj>
<type>2</type>
<id>387</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>30</content>
</item>
<item class_id_reference="16" object_id="_258">
<Value>
<Obj>
<type>2</type>
<id>394</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>255</content>
</item>
<item class_id_reference="16" object_id="_259">
<Value>
<Obj>
<type>2</type>
<id>516</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_260">
<Value>
<Obj>
<type>2</type>
<id>638</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="_261">
<Value>
<Obj>
<type>2</type>
<id>644</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="_262">
<Value>
<Obj>
<type>2</type>
<id>648</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<const_type>0</const_type>
<content>385</content>
</item>
<item class_id_reference="16" object_id="_263">
<Value>
<Obj>
<type>2</type>
<id>654</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_264">
<Value>
<Obj>
<type>2</type>
<id>656</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>127</content>
</item>
<item class_id_reference="16" object_id="_265">
<Value>
<Obj>
<type>2</type>
<id>673</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>24</content>
</item>
<item class_id_reference="16" object_id="_266">
<Value>
<Obj>
<type>2</type>
<id>680</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>55</content>
</item>
<item class_id_reference="16" object_id="_267">
<Value>
<Obj>
<type>2</type>
<id>685</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>0</content>
</item>
<item class_id_reference="16" object_id="_268">
<Value>
<Obj>
<type>2</type>
<id>726</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>78</content>
</item>
<item class_id_reference="16" object_id="_269">
<Value>
<Obj>
<type>2</type>
<id>732</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>30</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_270">
<Value>
<Obj>
<type>2</type>
<id>742</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_271">
<Value>
<Obj>
<type>2</type>
<id>748</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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_272">
<Value>
<Obj>
<type>2</type>
<id>756</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="_273">
<Value>
<Obj>
<type>2</type>
<id>759</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>7</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="_274">
<Obj>
<type>3</type>
<id>41</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>34</count>
<item_version>0</item_version>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_275">
<Obj>
<type>3</type>
<id>49</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>47</item>
<item>48</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_276">
<Obj>
<type>3</type>
<id>251</id>
<name>_ifconv</name>
<fileName></fileName>
<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>201</count>
<item_version>0</item_version>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>74</item>
<item>75</item>
<item>76</item>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>93</item>
<item>94</item>
<item>95</item>
<item>96</item>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</item>
<item>106</item>
<item>107</item>
<item>108</item>
<item>109</item>
<item>110</item>
<item>111</item>
<item>112</item>
<item>113</item>
<item>114</item>
<item>115</item>
<item>116</item>
<item>117</item>
<item>118</item>
<item>119</item>
<item>120</item>
<item>121</item>
<item>122</item>
<item>123</item>
<item>124</item>
<item>125</item>
<item>126</item>
<item>127</item>
<item>128</item>
<item>129</item>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
<item>134</item>
<item>135</item>
<item>136</item>
<item>137</item>
<item>138</item>
<item>139</item>
<item>140</item>
<item>141</item>
<item>142</item>
<item>143</item>
<item>144</item>
<item>145</item>
<item>146</item>
<item>147</item>
<item>148</item>
<item>149</item>
<item>150</item>
<item>151</item>
<item>152</item>
<item>153</item>
<item>154</item>
<item>155</item>
<item>156</item>
<item>157</item>
<item>158</item>
<item>159</item>
<item>160</item>
<item>161</item>
<item>162</item>
<item>163</item>
<item>164</item>
<item>165</item>
<item>166</item>
<item>167</item>
<item>168</item>
<item>169</item>
<item>170</item>
<item>171</item>
<item>172</item>
<item>173</item>
<item>174</item>
<item>175</item>
<item>176</item>
<item>177</item>
<item>178</item>
<item>179</item>
<item>180</item>
<item>181</item>
<item>182</item>
<item>183</item>
<item>184</item>
<item>185</item>
<item>186</item>
<item>187</item>
<item>188</item>
<item>189</item>
<item>190</item>
<item>191</item>
<item>192</item>
<item>193</item>
<item>194</item>
<item>195</item>
<item>196</item>
<item>197</item>
<item>198</item>
<item>199</item>
<item>200</item>
<item>201</item>
<item>202</item>
<item>203</item>
<item>204</item>
<item>205</item>
<item>206</item>
<item>207</item>
<item>208</item>
<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>221</item>
<item>222</item>
<item>223</item>
<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>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_277">
<Obj>
<type>3</type>
<id>253</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>252</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>461</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_278">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_279">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_280">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_281">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_282">
<id>264</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_283">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_284">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_285">
<id>268</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_286">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_287">
<id>270</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_288">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_289">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_290">
<id>273</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_291">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_292">
<id>275</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_293">
<id>276</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_294">
<id>277</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_295">
<id>279</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_296">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_297">
<id>281</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_298">
<id>282</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_299">
<id>283</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_300">
<id>284</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_301">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_302">
<id>286</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_303">
<id>287</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_304">
<id>288</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_305">
<id>289</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_306">
<id>290</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_307">
<id>291</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_308">
<id>292</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_309">
<id>293</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_310">
<id>294</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_311">
<id>295</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_312">
<id>296</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_313">
<id>297</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_314">
<id>298</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_315">
<id>299</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="_316">
<id>300</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_317">
<id>301</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_318">
<id>302</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_319">
<id>303</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_320">
<id>304</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_321">
<id>305</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_322">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_323">
<id>307</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_324">
<id>308</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_325">
<id>309</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_326">
<id>310</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_327">
<id>312</id>
<edge_type>1</edge_type>
<source_obj>311</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_328">
<id>313</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_329">
<id>314</id>
<edge_type>1</edge_type>
<source_obj>249</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_330">
<id>315</id>
<edge_type>2</edge_type>
<source_obj>251</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_331">
<id>317</id>
<edge_type>1</edge_type>
<source_obj>316</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_332">
<id>318</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_333">
<id>319</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_334">
<id>320</id>
<edge_type>2</edge_type>
<source_obj>251</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_335">
<id>321</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="_336">
<id>322</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_337">
<id>324</id>
<edge_type>1</edge_type>
<source_obj>323</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_338">
<id>325</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_339">
<id>327</id>
<edge_type>1</edge_type>
<source_obj>326</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_340">
<id>328</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_341">
<id>329</id>
<edge_type>2</edge_type>
<source_obj>251</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_342">
<id>330</id>
<edge_type>2</edge_type>
<source_obj>253</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_343">
<id>331</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_344">
<id>332</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_345">
<id>333</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_346">
<id>334</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_347">
<id>336</id>
<edge_type>1</edge_type>
<source_obj>335</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_348">
<id>337</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_349">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_350">
<id>340</id>
<edge_type>1</edge_type>
<source_obj>339</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_351">
<id>341</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_352">
<id>342</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_353">
<id>343</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_354">
<id>344</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="_355">
<id>345</id>
<edge_type>1</edge_type>
<source_obj>335</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_356">
<id>346</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_357">
<id>347</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_358">
<id>348</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_359">
<id>349</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_360">
<id>350</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_361">
<id>351</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_362">
<id>352</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_363">
<id>353</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_364">
<id>354</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_365">
<id>355</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="_366">
<id>356</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_367">
<id>357</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_368">
<id>358</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_369">
<id>359</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_370">
<id>360</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_371">
<id>361</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_372">
<id>362</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_373">
<id>363</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_374">
<id>364</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_375">
<id>365</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_376">
<id>366</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="_377">
<id>367</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_378">
<id>368</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_379">
<id>369</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="_380">
<id>370</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_381">
<id>371</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="_382">
<id>372</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_383">
<id>373</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_384">
<id>374</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_385">
<id>375</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_386">
<id>376</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_387">
<id>377</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_388">
<id>378</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_389">
<id>379</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_390">
<id>380</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_391">
<id>381</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_392">
<id>384</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_393">
<id>386</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_394">
<id>388</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_395">
<id>390</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_396">
<id>391</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_397">
<id>392</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_398">
<id>393</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_399">
<id>395</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_400">
<id>396</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_401">
<id>397</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_402">
<id>398</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_403">
<id>399</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_404">
<id>400</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_405">
<id>401</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_406">
<id>402</id>
<edge_type>1</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="_407">
<id>403</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_408">
<id>404</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_409">
<id>405</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_410">
<id>406</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="_411">
<id>407</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_412">
<id>408</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_413">
<id>409</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_414">
<id>411</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_415">
<id>412</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_416">
<id>413</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_417">
<id>414</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_418">
<id>415</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_419">
<id>417</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_420">
<id>418</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_421">
<id>419</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_422">
<id>420</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_423">
<id>421</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_424">
<id>422</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_425">
<id>423</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_426">
<id>424</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_427">
<id>425</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_428">
<id>426</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_429">
<id>427</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_430">
<id>428</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_431">
<id>429</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_432">
<id>430</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_433">
<id>431</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_434">
<id>432</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_435">
<id>433</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_436">
<id>434</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_437">
<id>435</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_438">
<id>436</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_439">
<id>437</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_440">
<id>438</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_441">
<id>439</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_442">
<id>440</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_443">
<id>441</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_444">
<id>442</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_445">
<id>443</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_446">
<id>444</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_447">
<id>446</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_448">
<id>447</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_449">
<id>448</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_450">
<id>449</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_451">
<id>450</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_452">
<id>451</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_453">
<id>452</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_454">
<id>453</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_455">
<id>454</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_456">
<id>455</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_457">
<id>456</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_458">
<id>457</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_459">
<id>458</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_460">
<id>459</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_461">
<id>460</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_462">
<id>461</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_463">
<id>463</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_464">
<id>464</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_465">
<id>465</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_466">
<id>467</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_467">
<id>468</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_468">
<id>469</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_469">
<id>470</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_470">
<id>471</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_471">
<id>472</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_472">
<id>473</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_473">
<id>474</id>
<edge_type>1</edge_type>
<source_obj>112</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_474">
<id>475</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_475">
<id>476</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_476">
<id>477</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_477">
<id>478</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_478">
<id>479</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_479">
<id>480</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_480">
<id>481</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_481">
<id>482</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_482">
<id>483</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_483">
<id>484</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_484">
<id>485</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_485">
<id>487</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_486">
<id>488</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_487">
<id>489</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_488">
<id>490</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_489">
<id>491</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_490">
<id>493</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_491">
<id>494</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_492">
<id>495</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_493">
<id>496</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_494">
<id>497</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_495">
<id>498</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_496">
<id>499</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_497">
<id>500</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_498">
<id>501</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_499">
<id>502</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_500">
<id>503</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_501">
<id>504</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_502">
<id>505</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_503">
<id>506</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_504">
<id>507</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_505">
<id>508</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_506">
<id>509</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_507">
<id>510</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_508">
<id>511</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_509">
<id>512</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_510">
<id>513</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_511">
<id>514</id>
<edge_type>1</edge_type>
<source_obj>133</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_512">
<id>515</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_513">
<id>517</id>
<edge_type>1</edge_type>
<source_obj>516</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_514">
<id>518</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_515">
<id>519</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_516">
<id>520</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_517">
<id>521</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_518">
<id>522</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_519">
<id>524</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_520">
<id>525</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_521">
<id>526</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_522">
<id>528</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_523">
<id>529</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_524">
<id>530</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_525">
<id>531</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_526">
<id>532</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_527">
<id>533</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_528">
<id>534</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_529">
<id>535</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_530">
<id>536</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_531">
<id>537</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_532">
<id>538</id>
<edge_type>1</edge_type>
<source_obj>142</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_533">
<id>539</id>
<edge_type>1</edge_type>
<source_obj>141</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_534">
<id>540</id>
<edge_type>1</edge_type>
<source_obj>143</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_535">
<id>541</id>
<edge_type>1</edge_type>
<source_obj>144</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_536">
<id>542</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_537">
<id>543</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_538">
<id>544</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_539">
<id>545</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_540">
<id>546</id>
<edge_type>1</edge_type>
<source_obj>144</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_541">
<id>547</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_542">
<id>548</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_543">
<id>549</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_544">
<id>550</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_545">
<id>551</id>
<edge_type>1</edge_type>
<source_obj>148</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_546">
<id>553</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_547">
<id>554</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_548">
<id>555</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_549">
<id>556</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_550">
<id>557</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>152</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_551">
<id>559</id>
<edge_type>1</edge_type>
<source_obj>152</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_552">
<id>560</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_553">
<id>561</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_554">
<id>562</id>
<edge_type>1</edge_type>
<source_obj>152</source_obj>
<sink_obj>154</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_555">
<id>563</id>
<edge_type>1</edge_type>
<source_obj>150</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_556">
<id>564</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_557">
<id>565</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>156</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_558">
<id>566</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>156</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_559">
<id>567</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>157</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_560">
<id>568</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>157</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_561">
<id>569</id>
<edge_type>1</edge_type>
<source_obj>153</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_562">
<id>570</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_563">
<id>571</id>
<edge_type>1</edge_type>
<source_obj>154</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_564">
<id>572</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_565">
<id>573</id>
<edge_type>1</edge_type>
<source_obj>159</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_566">
<id>574</id>
<edge_type>1</edge_type>
<source_obj>158</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_567">
<id>575</id>
<edge_type>1</edge_type>
<source_obj>157</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_568">
<id>576</id>
<edge_type>1</edge_type>
<source_obj>160</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_569">
<id>577</id>
<edge_type>1</edge_type>
<source_obj>148</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_570">
<id>578</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_571">
<id>579</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_572">
<id>580</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_573">
<id>581</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_574">
<id>582</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_575">
<id>583</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>165</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_576">
<id>584</id>
<edge_type>1</edge_type>
<source_obj>516</source_obj>
<sink_obj>165</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_577">
<id>585</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_578">
<id>586</id>
<edge_type>1</edge_type>
<source_obj>165</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_579">
<id>587</id>
<edge_type>1</edge_type>
<source_obj>165</source_obj>
<sink_obj>167</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_580">
<id>588</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>167</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_581">
<id>589</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_582">
<id>591</id>
<edge_type>1</edge_type>
<source_obj>168</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_583">
<id>592</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_584">
<id>593</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_585">
<id>594</id>
<edge_type>1</edge_type>
<source_obj>168</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_586">
<id>595</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>171</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_587">
<id>596</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>171</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_588">
<id>597</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_589">
<id>598</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_590">
<id>599</id>
<edge_type>1</edge_type>
<source_obj>172</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_591">
<id>600</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_592">
<id>601</id>
<edge_type>1</edge_type>
<source_obj>173</source_obj>
<sink_obj>174</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_593">
<id>602</id>
<edge_type>1</edge_type>
<source_obj>160</source_obj>
<sink_obj>174</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_594">
<id>603</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_595">
<id>604</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_596">
<id>605</id>
<edge_type>1</edge_type>
<source_obj>174</source_obj>
<sink_obj>176</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_597">
<id>606</id>
<edge_type>1</edge_type>
<source_obj>175</source_obj>
<sink_obj>176</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_598">
<id>607</id>
<edge_type>1</edge_type>
<source_obj>163</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_599">
<id>608</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_600">
<id>609</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_601">
<id>611</id>
<edge_type>1</edge_type>
<source_obj>178</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_602">
<id>612</id>
<edge_type>1</edge_type>
<source_obj>385</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_603">
<id>613</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_604">
<id>614</id>
<edge_type>1</edge_type>
<source_obj>178</source_obj>
<sink_obj>180</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_605">
<id>615</id>
<edge_type>1</edge_type>
<source_obj>179</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_606">
<id>616</id>
<edge_type>1</edge_type>
<source_obj>394</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_607">
<id>617</id>
<edge_type>1</edge_type>
<source_obj>180</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_608">
<id>618</id>
<edge_type>1</edge_type>
<source_obj>278</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_609">
<id>619</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>183</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_610">
<id>620</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>183</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_611">
<id>621</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>184</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_612">
<id>622</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>184</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_613">
<id>623</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>185</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_614">
<id>624</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>185</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_615">
<id>625</id>
<edge_type>1</edge_type>
<source_obj>184</source_obj>
<sink_obj>186</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_616">
<id>626</id>
<edge_type>1</edge_type>
<source_obj>185</source_obj>
<sink_obj>186</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_617">
<id>627</id>
<edge_type>1</edge_type>
<source_obj>176</source_obj>
<sink_obj>187</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_618">
<id>628</id>
<edge_type>1</edge_type>
<source_obj>186</source_obj>
<sink_obj>187</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_619">
<id>629</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>188</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_620">
<id>630</id>
<edge_type>1</edge_type>
<source_obj>187</source_obj>
<sink_obj>188</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_621">
<id>631</id>
<edge_type>1</edge_type>
<source_obj>188</source_obj>
<sink_obj>189</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_622">
<id>632</id>
<edge_type>1</edge_type>
<source_obj>166</source_obj>
<sink_obj>189</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_623">
<id>633</id>
<edge_type>1</edge_type>
<source_obj>189</source_obj>
<sink_obj>190</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_624">
<id>634</id>
<edge_type>1</edge_type>
<source_obj>177</source_obj>
<sink_obj>190</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_625">
<id>637</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>191</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_626">
<id>639</id>
<edge_type>1</edge_type>
<source_obj>638</source_obj>
<sink_obj>191</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_627">
<id>642</id>
<edge_type>1</edge_type>
<source_obj>516</source_obj>
<sink_obj>192</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_628">
<id>643</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>192</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_629">
<id>645</id>
<edge_type>1</edge_type>
<source_obj>644</source_obj>
<sink_obj>192</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_630">
<id>646</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>193</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_631">
<id>647</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>194</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_632">
<id>649</id>
<edge_type>1</edge_type>
<source_obj>648</source_obj>
<sink_obj>195</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_633">
<id>650</id>
<edge_type>1</edge_type>
<source_obj>194</source_obj>
<sink_obj>195</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_634">
<id>653</id>
<edge_type>1</edge_type>
<source_obj>195</source_obj>
<sink_obj>196</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_635">
<id>655</id>
<edge_type>1</edge_type>
<source_obj>654</source_obj>
<sink_obj>196</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_636">
<id>657</id>
<edge_type>1</edge_type>
<source_obj>656</source_obj>
<sink_obj>197</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_637">
<id>658</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>197</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_638">
<id>659</id>
<edge_type>1</edge_type>
<source_obj>197</source_obj>
<sink_obj>198</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_639">
<id>660</id>
<edge_type>1</edge_type>
<source_obj>196</source_obj>
<sink_obj>199</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_640">
<id>661</id>
<edge_type>1</edge_type>
<source_obj>198</source_obj>
<sink_obj>199</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_641">
<id>662</id>
<edge_type>1</edge_type>
<source_obj>195</source_obj>
<sink_obj>199</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_642">
<id>663</id>
<edge_type>1</edge_type>
<source_obj>199</source_obj>
<sink_obj>200</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_643">
<id>664</id>
<edge_type>1</edge_type>
<source_obj>199</source_obj>
<sink_obj>201</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_644">
<id>665</id>
<edge_type>1</edge_type>
<source_obj>200</source_obj>
<sink_obj>202</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_645">
<id>666</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>203</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_646">
<id>667</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>203</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_647">
<id>668</id>
<edge_type>1</edge_type>
<source_obj>193</source_obj>
<sink_obj>204</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_648">
<id>669</id>
<edge_type>1</edge_type>
<source_obj>202</source_obj>
<sink_obj>204</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_649">
<id>672</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>205</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_650">
<id>674</id>
<edge_type>1</edge_type>
<source_obj>673</source_obj>
<sink_obj>205</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_651">
<id>675</id>
<edge_type>1</edge_type>
<source_obj>205</source_obj>
<sink_obj>206</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_652">
<id>678</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>207</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_653">
<id>679</id>
<edge_type>1</edge_type>
<source_obj>673</source_obj>
<sink_obj>207</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_654">
<id>681</id>
<edge_type>1</edge_type>
<source_obj>680</source_obj>
<sink_obj>207</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_655">
<id>682</id>
<edge_type>1</edge_type>
<source_obj>196</source_obj>
<sink_obj>208</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_656">
<id>683</id>
<edge_type>1</edge_type>
<source_obj>206</source_obj>
<sink_obj>208</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_657">
<id>684</id>
<edge_type>1</edge_type>
<source_obj>207</source_obj>
<sink_obj>208</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_658">
<id>686</id>
<edge_type>1</edge_type>
<source_obj>685</source_obj>
<sink_obj>209</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_659">
<id>687</id>
<edge_type>1</edge_type>
<source_obj>208</source_obj>
<sink_obj>209</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_660">
<id>688</id>
<edge_type>1</edge_type>
<source_obj>191</source_obj>
<sink_obj>210</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_661">
<id>689</id>
<edge_type>1</edge_type>
<source_obj>209</source_obj>
<sink_obj>210</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_662">
<id>690</id>
<edge_type>1</edge_type>
<source_obj>208</source_obj>
<sink_obj>210</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_663">
<id>692</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>211</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_664">
<id>693</id>
<edge_type>1</edge_type>
<source_obj>638</source_obj>
<sink_obj>211</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_665">
<id>695</id>
<edge_type>1</edge_type>
<source_obj>516</source_obj>
<sink_obj>212</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_666">
<id>696</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>212</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_667">
<id>697</id>
<edge_type>1</edge_type>
<source_obj>644</source_obj>
<sink_obj>212</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_668">
<id>698</id>
<edge_type>1</edge_type>
<source_obj>212</source_obj>
<sink_obj>213</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_669">
<id>699</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>214</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_670">
<id>700</id>
<edge_type>1</edge_type>
<source_obj>648</source_obj>
<sink_obj>215</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_671">
<id>701</id>
<edge_type>1</edge_type>
<source_obj>214</source_obj>
<sink_obj>215</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_672">
<id>703</id>
<edge_type>1</edge_type>
<source_obj>215</source_obj>
<sink_obj>216</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_673">
<id>704</id>
<edge_type>1</edge_type>
<source_obj>654</source_obj>
<sink_obj>216</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_674">
<id>705</id>
<edge_type>1</edge_type>
<source_obj>656</source_obj>
<sink_obj>217</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_675">
<id>706</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>217</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_676">
<id>707</id>
<edge_type>1</edge_type>
<source_obj>217</source_obj>
<sink_obj>218</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_677">
<id>708</id>
<edge_type>1</edge_type>
<source_obj>216</source_obj>
<sink_obj>219</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_678">
<id>709</id>
<edge_type>1</edge_type>
<source_obj>218</source_obj>
<sink_obj>219</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_679">
<id>710</id>
<edge_type>1</edge_type>
<source_obj>215</source_obj>
<sink_obj>219</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_680">
<id>711</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>220</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_681">
<id>712</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>221</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_682">
<id>713</id>
<edge_type>1</edge_type>
<source_obj>220</source_obj>
<sink_obj>222</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_683">
<id>714</id>
<edge_type>1</edge_type>
<source_obj>212</source_obj>
<sink_obj>223</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_684">
<id>715</id>
<edge_type>1</edge_type>
<source_obj>221</source_obj>
<sink_obj>223</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_685">
<id>716</id>
<edge_type>1</edge_type>
<source_obj>213</source_obj>
<sink_obj>224</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_686">
<id>717</id>
<edge_type>1</edge_type>
<source_obj>222</source_obj>
<sink_obj>224</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_687">
<id>719</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>225</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_688">
<id>720</id>
<edge_type>1</edge_type>
<source_obj>673</source_obj>
<sink_obj>225</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_689">
<id>721</id>
<edge_type>1</edge_type>
<source_obj>225</source_obj>
<sink_obj>226</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_690">
<id>724</id>
<edge_type>1</edge_type>
<source_obj>224</source_obj>
<sink_obj>227</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_691">
<id>725</id>
<edge_type>1</edge_type>
<source_obj>673</source_obj>
<sink_obj>227</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_692">
<id>727</id>
<edge_type>1</edge_type>
<source_obj>726</source_obj>
<sink_obj>227</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_693">
<id>728</id>
<edge_type>1</edge_type>
<source_obj>216</source_obj>
<sink_obj>228</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_694">
<id>729</id>
<edge_type>1</edge_type>
<source_obj>226</source_obj>
<sink_obj>228</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_695">
<id>730</id>
<edge_type>1</edge_type>
<source_obj>227</source_obj>
<sink_obj>228</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_696">
<id>731</id>
<edge_type>1</edge_type>
<source_obj>228</source_obj>
<sink_obj>229</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_697">
<id>733</id>
<edge_type>1</edge_type>
<source_obj>732</source_obj>
<sink_obj>230</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_698">
<id>734</id>
<edge_type>1</edge_type>
<source_obj>229</source_obj>
<sink_obj>230</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_699">
<id>735</id>
<edge_type>1</edge_type>
<source_obj>228</source_obj>
<sink_obj>231</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_700">
<id>736</id>
<edge_type>1</edge_type>
<source_obj>211</source_obj>
<sink_obj>232</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_701">
<id>737</id>
<edge_type>1</edge_type>
<source_obj>230</source_obj>
<sink_obj>232</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_702">
<id>738</id>
<edge_type>1</edge_type>
<source_obj>231</source_obj>
<sink_obj>232</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_703">
<id>741</id>
<edge_type>1</edge_type>
<source_obj>232</source_obj>
<sink_obj>233</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_704">
<id>743</id>
<edge_type>1</edge_type>
<source_obj>742</source_obj>
<sink_obj>233</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_705">
<id>744</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>234</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_706">
<id>747</id>
<edge_type>1</edge_type>
<source_obj>234</source_obj>
<sink_obj>235</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_707">
<id>749</id>
<edge_type>1</edge_type>
<source_obj>748</source_obj>
<sink_obj>235</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_708">
<id>750</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>236</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_709">
<id>751</id>
<edge_type>1</edge_type>
<source_obj>233</source_obj>
<sink_obj>237</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_710">
<id>752</id>
<edge_type>1</edge_type>
<source_obj>210</source_obj>
<sink_obj>237</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_711">
<id>753</id>
<edge_type>1</edge_type>
<source_obj>237</source_obj>
<sink_obj>238</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_712">
<id>754</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>238</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_713">
<id>755</id>
<edge_type>1</edge_type>
<source_obj>238</source_obj>
<sink_obj>239</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_714">
<id>757</id>
<edge_type>1</edge_type>
<source_obj>756</source_obj>
<sink_obj>240</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_715">
<id>758</id>
<edge_type>1</edge_type>
<source_obj>239</source_obj>
<sink_obj>240</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_716">
<id>760</id>
<edge_type>1</edge_type>
<source_obj>759</source_obj>
<sink_obj>241</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_717">
<id>761</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>241</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_718">
<id>764</id>
<edge_type>1</edge_type>
<source_obj>241</source_obj>
<sink_obj>242</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_719">
<id>765</id>
<edge_type>1</edge_type>
<source_obj>748</source_obj>
<sink_obj>242</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_720">
<id>766</id>
<edge_type>1</edge_type>
<source_obj>242</source_obj>
<sink_obj>243</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_721">
<id>767</id>
<edge_type>1</edge_type>
<source_obj>237</source_obj>
<sink_obj>244</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_722">
<id>768</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>244</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_723">
<id>769</id>
<edge_type>1</edge_type>
<source_obj>244</source_obj>
<sink_obj>245</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_724">
<id>770</id>
<edge_type>1</edge_type>
<source_obj>756</source_obj>
<sink_obj>246</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_725">
<id>771</id>
<edge_type>1</edge_type>
<source_obj>245</source_obj>
<sink_obj>246</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_726">
<id>772</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>247</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_727">
<id>773</id>
<edge_type>1</edge_type>
<source_obj>246</source_obj>
<sink_obj>247</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_728">
<id>774</id>
<edge_type>1</edge_type>
<source_obj>247</source_obj>
<sink_obj>248</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_729">
<id>775</id>
<edge_type>1</edge_type>
<source_obj>240</source_obj>
<sink_obj>248</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_730">
<id>776</id>
<edge_type>1</edge_type>
<source_obj>190</source_obj>
<sink_obj>249</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_731">
<id>777</id>
<edge_type>1</edge_type>
<source_obj>248</source_obj>
<sink_obj>249</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_732">
<id>778</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>249</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_733">
<id>779</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>250</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_734">
<id>780</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>252</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_735">
<id>787</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_736">
<id>788</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>253</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_737">
<id>789</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>251</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_738">
<id>790</id>
<edge_type>2</edge_type>
<source_obj>251</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>1</is_back_edge>
</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="_739">
<mId>1</mId>
<mTag>checkAxis.2</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>212</mMinLatency>
<mMaxLatency>212</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_740">
<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>41</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>3</mMinLatency>
<mMaxLatency>3</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_741">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>251</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>4</mMinTripCount>
<mMaxTripCount>4</mMaxTripCount>
<mMinLatency>208</mMinLatency>
<mMaxLatency>208</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_742">
<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>253</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</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>242</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>7</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>3</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>3</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>3</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>4</first>
<second>3</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>8</first>
<second>3</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>12</first>
<second>2</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>15</first>
<second>3</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>19</first>
<second>2</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>22</first>
<second>3</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>26</first>
<second>3</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>19</first>
<second>2</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>19</first>
<second>2</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>22</first>
<second>3</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>26</first>
<second>3</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>30</first>
<second>3</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>23</first>
<second>2</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>23</first>
<second>2</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>26</first>
<second>3</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>30</first>
<second>3</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>34</first>
<second>11</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>46</first>
<second>2</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>49</first>
<second>3</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>46</first>
<second>2</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>49</first>
<second>3</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>46</first>
<second>2</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>49</first>
<second>3</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>53</first>
<second>1</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>53</first>
<second>1</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>126</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>127</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>128</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>129</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>130</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>132</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>133</first>
<second>
<first>53</first>
<second>1</second>
</second>
</item>
<item>
<first>134</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>137</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>138</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>139</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>140</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>141</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>142</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>143</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>144</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>145</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>146</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>147</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>148</first>
<second>
<first>49</first>
<second>0</second>
</second>
</item>
<item>
<first>149</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>150</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>151</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>152</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>153</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>154</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>155</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>156</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>157</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>158</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>159</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>160</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>161</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>162</first>
<second>
<first>53</first>
<second>1</second>
</second>
</item>
<item>
<first>163</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>164</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>165</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>166</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>167</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>168</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>169</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>170</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>171</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>172</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>173</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>174</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>175</first>
<second>
<first>53</first>
<second>1</second>
</second>
</item>
<item>
<first>176</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>177</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>178</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>179</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>180</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>181</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>182</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>183</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>184</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>185</first>
<second>
<first>53</first>
<second>1</second>
</second>
</item>
<item>
<first>186</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>187</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>188</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>189</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>190</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>191</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>192</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>193</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>194</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>195</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>196</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>197</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>198</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>199</first>
<second>
<first>53</first>
<second>0</second>
</second>
</item>
<item>
<first>200</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>201</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>202</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>203</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>204</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>205</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>206</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>207</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>208</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>209</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>210</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>211</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>212</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>213</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>214</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>215</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>216</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>217</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>218</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>219</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>220</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>221</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>222</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>223</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>224</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>225</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>226</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>227</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>228</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>229</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>230</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>231</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>232</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>233</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>234</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>235</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>236</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>237</first>
<second>
<first>54</first>
<second>0</second>
</second>
</item>
<item>
<first>238</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>239</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>240</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>241</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>242</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>243</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>244</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>245</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>246</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>247</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>248</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>249</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>250</first>
<second>
<first>55</first>
<second>0</second>
</second>
</item>
<item>
<first>252</first>
<second>
<first>4</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>41</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>3</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>251</first>
<second>
<first>4</first>
<second>55</second>
</second>
</item>
<item>
<first>253</first>
<second>
<first>4</first>
<second>4</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 RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . O S _ I N T E R F A C E --
-- --
-- S p e c --
-- --
-- Copyright (C) 1991-1994, Florida State University --
-- Copyright (C) 1995-2006, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is a Solaris (native) version of this package
-- This package includes all direct interfaces to OS services
-- that are needed by children of System.
-- PLEASE DO NOT add any with-clauses to this package or remove the pragma
-- Preelaborate. This package is designed to be a bottom-level (leaf) package.
with Interfaces.C;
with Unchecked_Conversion;
package System.OS_Interface is
pragma Preelaborate;
pragma Linker_Options ("-lposix4");
pragma Linker_Options ("-lthread");
subtype int is Interfaces.C.int;
subtype short is Interfaces.C.short;
subtype long is Interfaces.C.long;
subtype unsigned is Interfaces.C.unsigned;
subtype unsigned_short is Interfaces.C.unsigned_short;
subtype unsigned_long is Interfaces.C.unsigned_long;
subtype unsigned_char is Interfaces.C.unsigned_char;
subtype plain_char is Interfaces.C.plain_char;
subtype size_t is Interfaces.C.size_t;
-----------
-- Errno --
-----------
function errno return int;
pragma Import (C, errno, "__get_errno");
EAGAIN : constant := 11;
EINTR : constant := 4;
EINVAL : constant := 22;
ENOMEM : constant := 12;
ETIME : constant := 62;
ETIMEDOUT : constant := 145;
-------------
-- Signals --
-------------
Max_Interrupt : constant := 45;
type Signal is new int range 0 .. Max_Interrupt;
for Signal'Size use int'Size;
SIGHUP : constant := 1; -- hangup
SIGINT : constant := 2; -- interrupt (rubout)
SIGQUIT : constant := 3; -- quit (ASCD FS)
SIGILL : constant := 4; -- illegal instruction (not reset)
SIGTRAP : constant := 5; -- trace trap (not reset)
SIGIOT : constant := 6; -- IOT instruction
SIGABRT : constant := 6; -- used by abort, replace SIGIOT in the future
SIGEMT : constant := 7; -- EMT instruction
SIGFPE : constant := 8; -- floating point exception
SIGKILL : constant := 9; -- kill (cannot be caught or ignored)
SIGBUS : constant := 10; -- bus error
SIGSEGV : constant := 11; -- segmentation violation
SIGSYS : constant := 12; -- bad argument to system call
SIGPIPE : constant := 13; -- write on a pipe with no one to read it
SIGALRM : constant := 14; -- alarm clock
SIGTERM : constant := 15; -- software termination signal from kill
SIGUSR1 : constant := 16; -- user defined signal 1
SIGUSR2 : constant := 17; -- user defined signal 2
SIGCLD : constant := 18; -- alias for SIGCHLD
SIGCHLD : constant := 18; -- child status change
SIGPWR : constant := 19; -- power-fail restart
SIGWINCH : constant := 20; -- window size change
SIGURG : constant := 21; -- urgent condition on IO channel
SIGPOLL : constant := 22; -- pollable event occurred
SIGIO : constant := 22; -- I/O possible (Solaris SIGPOLL alias)
SIGSTOP : constant := 23; -- stop (cannot be caught or ignored)
SIGTSTP : constant := 24; -- user stop requested from tty
SIGCONT : constant := 25; -- stopped process has been continued
SIGTTIN : constant := 26; -- background tty read attempted
SIGTTOU : constant := 27; -- background tty write attempted
SIGVTALRM : constant := 28; -- virtual timer expired
SIGPROF : constant := 29; -- profiling timer expired
SIGXCPU : constant := 30; -- CPU time limit exceeded
SIGXFSZ : constant := 31; -- filesize limit exceeded
SIGWAITING : constant := 32; -- process's lwps blocked (Solaris)
SIGLWP : constant := 33; -- used by thread library (Solaris)
SIGFREEZE : constant := 34; -- used by CPR (Solaris)
SIGTHAW : constant := 35; -- used by CPR (Solaris)
SIGCANCEL : constant := 36; -- thread cancellation signal (libthread)
type Signal_Set is array (Natural range <>) of Signal;
Unmasked : constant Signal_Set := (SIGTRAP, SIGLWP, SIGPROF);
-- Following signals should not be disturbed.
-- See c-posix-signals.c in FLORIST
Reserved : constant Signal_Set :=
(SIGKILL, SIGSTOP, SIGWAITING, SIGCANCEL, SIGTRAP, SIGSEGV);
type sigset_t is private;
function sigaddset (set : access sigset_t; sig : Signal) return int;
pragma Import (C, sigaddset, "sigaddset");
function sigdelset (set : access sigset_t; sig : Signal) return int;
pragma Import (C, sigdelset, "sigdelset");
function sigfillset (set : access sigset_t) return int;
pragma Import (C, sigfillset, "sigfillset");
function sigismember (set : access sigset_t; sig : Signal) return int;
pragma Import (C, sigismember, "sigismember");
function sigemptyset (set : access sigset_t) return int;
pragma Import (C, sigemptyset, "sigemptyset");
type union_type_3 is new String (1 .. 116);
type siginfo_t is record
si_signo : int;
si_code : int;
si_errno : int;
X_data : union_type_3;
end record;
pragma Convention (C, siginfo_t);
-- The types mcontext_t and gregset_t are part of the ucontext_t
-- information, which is specific to Solaris2.4 for SPARC
-- The ucontext_t info seems to be used by the handler
-- for SIGSEGV to decide whether it is a Storage_Error (stack overflow) or
-- a Constraint_Error (bad pointer). The original code that did this
-- is suspect, so it is not clear whether we really need this part of
-- the signal context information, or perhaps something else.
-- More analysis is needed, after which these declarations may need to
-- be changed.
FPE_INTDIV : constant := 1; -- integer divide by zero
FPE_INTOVF : constant := 2; -- integer overflow
FPE_FLTDIV : constant := 3; -- floating point divide by zero
FPE_FLTOVF : constant := 4; -- floating point overflow
FPE_FLTUND : constant := 5; -- floating point underflow
FPE_FLTRES : constant := 6; -- floating point inexact result
FPE_FLTINV : constant := 7; -- invalid floating point operation
FPE_FLTSUB : constant := 8; -- subscript out of range
type greg_t is new int;
type gregset_t is array (0 .. 18) of greg_t;
type union_type_2 is new String (1 .. 128);
type record_type_1 is record
fpu_fr : union_type_2;
fpu_q : System.Address;
fpu_fsr : unsigned;
fpu_qcnt : unsigned_char;
fpu_q_entrysize : unsigned_char;
fpu_en : unsigned_char;
end record;
pragma Convention (C, record_type_1);
type array_type_7 is array (Integer range 0 .. 20) of long;
type mcontext_t is record
gregs : gregset_t;
gwins : System.Address;
fpregs : record_type_1;
filler : array_type_7;
end record;
pragma Convention (C, mcontext_t);
type record_type_2 is record
ss_sp : System.Address;
ss_size : int;
ss_flags : int;
end record;
pragma Convention (C, record_type_2);
type array_type_8 is array (Integer range 0 .. 22) of long;
type ucontext_t is record
uc_flags : unsigned_long;
uc_link : System.Address;
uc_sigmask : sigset_t;
uc_stack : record_type_2;
uc_mcontext : mcontext_t;
uc_filler : array_type_8;
end record;
pragma Convention (C, ucontext_t);
type Signal_Handler is access procedure
(signo : Signal;
info : access siginfo_t;
context : access ucontext_t);
type union_type_1 is new plain_char;
type array_type_2 is array (Integer range 0 .. 1) of int;
type struct_sigaction is record
sa_flags : int;
sa_handler : System.Address;
sa_mask : sigset_t;
sa_resv : array_type_2;
end record;
pragma Convention (C, struct_sigaction);
type struct_sigaction_ptr is access all struct_sigaction;
SIG_BLOCK : constant := 1;
SIG_UNBLOCK : constant := 2;
SIG_SETMASK : constant := 3;
SIG_DFL : constant := 0;
SIG_IGN : constant := 1;
function sigaction
(sig : Signal;
act : struct_sigaction_ptr;
oact : struct_sigaction_ptr) return int;
pragma Import (C, sigaction, "sigaction");
----------
-- Time --
----------
type timespec is private;
type clockid_t is private;
CLOCK_REALTIME : constant clockid_t;
function clock_gettime
(clock_id : clockid_t; tp : access timespec) return int;
pragma Import (C, clock_gettime, "clock_gettime");
function clock_getres
(clock_id : clockid_t; res : access timespec) return int;
pragma Import (C, clock_getres, "clock_getres");
function To_Duration (TS : timespec) return Duration;
pragma Inline (To_Duration);
function To_Timespec (D : Duration) return timespec;
pragma Inline (To_Timespec);
type struct_timeval is private;
-- This is needed on systems that do not have clock_gettime()
-- but do have gettimeofday().
function To_Duration (TV : struct_timeval) return Duration;
pragma Inline (To_Duration);
function To_Timeval (D : Duration) return struct_timeval;
pragma Inline (To_Timeval);
-------------
-- Process --
-------------
type pid_t is private;
function kill (pid : pid_t; sig : Signal) return int;
pragma Import (C, kill, "kill");
function getpid return pid_t;
pragma Import (C, getpid, "getpid");
-------------
-- Threads --
-------------
type Thread_Body is access
function (arg : System.Address) return System.Address;
function Thread_Body_Access is new
Unchecked_Conversion (System.Address, Thread_Body);
THR_DETACHED : constant := 64;
THR_BOUND : constant := 1;
THR_NEW_LWP : constant := 2;
USYNC_THREAD : constant := 0;
type thread_t is new unsigned;
subtype Thread_Id is thread_t;
-- These types should be commented ???
function To_thread_t is new Unchecked_Conversion (Integer, thread_t);
type mutex_t is limited private;
type cond_t is limited private;
type thread_key_t is private;
function thr_create
(stack_base : System.Address;
stack_size : size_t;
start_routine : Thread_Body;
arg : System.Address;
flags : int;
new_thread : access thread_t) return int;
pragma Import (C, thr_create, "thr_create");
function thr_min_stack return size_t;
pragma Import (C, thr_min_stack, "thr_min_stack");
function thr_self return thread_t;
pragma Import (C, thr_self, "thr_self");
function mutex_init
(mutex : access mutex_t;
mtype : int;
arg : System.Address) return int;
pragma Import (C, mutex_init, "mutex_init");
function mutex_destroy (mutex : access mutex_t) return int;
pragma Import (C, mutex_destroy, "mutex_destroy");
function mutex_lock (mutex : access mutex_t) return int;
pragma Import (C, mutex_lock, "mutex_lock");
function mutex_unlock (mutex : access mutex_t) return int;
pragma Import (C, mutex_unlock, "mutex_unlock");
function cond_init
(cond : access cond_t;
ctype : int;
arg : int) return int;
pragma Import (C, cond_init, "cond_init");
function cond_wait
(cond : access cond_t; mutex : access mutex_t) return int;
pragma Import (C, cond_wait, "cond_wait");
function cond_timedwait
(cond : access cond_t;
mutex : access mutex_t;
abstime : access timespec) return int;
pragma Import (C, cond_timedwait, "cond_timedwait");
function cond_signal (cond : access cond_t) return int;
pragma Import (C, cond_signal, "cond_signal");
function cond_destroy (cond : access cond_t) return int;
pragma Import (C, cond_destroy, "cond_destroy");
function thr_setspecific
(key : thread_key_t; value : System.Address) return int;
pragma Import (C, thr_setspecific, "thr_setspecific");
function thr_getspecific
(key : thread_key_t;
value : access System.Address) return int;
pragma Import (C, thr_getspecific, "thr_getspecific");
function thr_keycreate
(key : access thread_key_t; destructor : System.Address) return int;
pragma Import (C, thr_keycreate, "thr_keycreate");
function thr_setprio (thread : thread_t; priority : int) return int;
pragma Import (C, thr_setprio, "thr_setprio");
procedure thr_exit (status : System.Address);
pragma Import (C, thr_exit, "thr_exit");
function thr_setconcurrency (new_level : int) return int;
pragma Import (C, thr_setconcurrency, "thr_setconcurrency");
function sigwait (set : access sigset_t; sig : access Signal) return int;
pragma Import (C, sigwait, "__posix_sigwait");
function thr_kill (thread : thread_t; sig : Signal) return int;
pragma Import (C, thr_kill, "thr_kill");
function thr_sigsetmask
(how : int;
set : access sigset_t;
oset : access sigset_t) return int;
pragma Import (C, thr_sigsetmask, "thr_sigsetmask");
function pthread_sigmask
(how : int;
set : access sigset_t;
oset : access sigset_t) return int;
pragma Import (C, pthread_sigmask, "thr_sigsetmask");
function thr_suspend (target_thread : thread_t) return int;
pragma Import (C, thr_suspend, "thr_suspend");
function thr_continue (target_thread : thread_t) return int;
pragma Import (C, thr_continue, "thr_continue");
procedure thr_yield;
pragma Import (C, thr_yield, "thr_yield");
---------
-- LWP --
---------
P_PID : constant := 0;
P_LWPID : constant := 8;
PC_GETCID : constant := 0;
PC_GETCLINFO : constant := 1;
PC_SETPARMS : constant := 2;
PC_GETPARMS : constant := 3;
PC_ADMIN : constant := 4;
PC_CLNULL : constant := -1;
RT_NOCHANGE : constant := -1;
RT_TQINF : constant := -2;
RT_TQDEF : constant := -3;
PC_CLNMSZ : constant := 16;
PC_VERSION : constant := 1;
type lwpid_t is new int;
type pri_t is new short;
type id_t is new long;
P_MYID : constant := -1;
-- the specified LWP or process is the current one.
type struct_pcinfo is record
pc_cid : id_t;
pc_clname : String (1 .. PC_CLNMSZ);
rt_maxpri : short;
end record;
pragma Convention (C, struct_pcinfo);
type struct_pcparms is record
pc_cid : id_t;
rt_pri : pri_t;
rt_tqsecs : long;
rt_tqnsecs : long;
end record;
pragma Convention (C, struct_pcparms);
function priocntl
(ver : int;
id_type : int;
id : lwpid_t;
cmd : int;
arg : System.Address) return Interfaces.C.long;
pragma Import (C, priocntl, "__priocntl");
function lwp_self return lwpid_t;
pragma Import (C, lwp_self, "_lwp_self");
type processorid_t is new int;
type processorid_t_ptr is access all processorid_t;
-- Constants for function processor_bind
PBIND_QUERY : constant processorid_t := -2;
-- the processor bindings are not changed.
PBIND_NONE : constant processorid_t := -1;
-- the processor bindings of the specified LWPs are cleared.
-- Flags for function p_online
PR_OFFLINE : constant int := 1;
-- processor is offline, as quiet as possible
PR_ONLINE : constant int := 2;
-- processor online
PR_STATUS : constant int := 3;
-- value passed to p_online to request status
function p_online (processorid : processorid_t; flag : int) return int;
pragma Import (C, p_online, "p_online");
function processor_bind
(id_type : int;
id : id_t;
proc_id : processorid_t;
obind : processorid_t_ptr) return int;
pragma Import (C, processor_bind, "processor_bind");
procedure pthread_init;
-- dummy procedure to share s-intman.adb with other Solaris targets.
private
type array_type_1 is array (0 .. 3) of unsigned_long;
type sigset_t is record
X_X_sigbits : array_type_1;
end record;
pragma Convention (C, sigset_t);
type pid_t is new long;
type time_t is new long;
type timespec is record
tv_sec : time_t;
tv_nsec : long;
end record;
pragma Convention (C, timespec);
type clockid_t is new int;
CLOCK_REALTIME : constant clockid_t := 0;
type struct_timeval is record
tv_sec : long;
tv_usec : long;
end record;
pragma Convention (C, struct_timeval);
type array_type_9 is array (0 .. 3) of unsigned_char;
type record_type_3 is record
flag : array_type_9;
Xtype : unsigned_long;
end record;
pragma Convention (C, record_type_3);
type mutex_t is record
flags : record_type_3;
lock : String (1 .. 8);
data : String (1 .. 8);
end record;
pragma Convention (C, mutex_t);
type cond_t is record
flag : array_type_9;
Xtype : unsigned_long;
data : String (1 .. 8);
end record;
pragma Convention (C, cond_t);
type thread_key_t is new unsigned;
end System.OS_Interface;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . L I B M _ P R E F I X --
-- --
-- S p e c --
-- --
-- Copyright (C) 2015-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. --
-- --
------------------------------------------------------------------------------
-- The is the Ada Cert Math specific version of s-libpre.ads.
package System.Libm_Prefix is
pragma Pure;
Prefix : constant String := "";
end System.Libm_Prefix;
|
-- This package has been generated automatically by GNATtest.
-- Do not edit any part of it, see GNATtest documentation for more details.
-- begin read only
with Gnattest_Generated;
package Ships.Crew.Test_Data.Tests is
type Test is new GNATtest_Generated.GNATtest_Standard.Ships.Crew.Test_Data
.Test with
null record;
procedure Test_GetSkillLevel_f7e690_420873(Gnattest_T: in out Test);
-- ships-crew.ads:34:4:GetSkillLevel:Test_GetSkillLevel
procedure Test_Death_af2fea_acf44b(Gnattest_T: in out Test);
-- ships-crew.ads:53:4:Death:Test_Death
procedure Test_DeleteMember_9fa01a_2b7835(Gnattest_T: in out Test);
-- ships-crew.ads:71:4:DeleteMember:Test_DeleteMember
procedure Test_FindMember_b270de_fa15b4(Gnattest_T: in out Test);
-- ships-crew.ads:87:4:FindMember:Test_FindMember
procedure Test_GiveOrders_fd3de0_56eedb(Gnattest_T: in out Test);
-- ships-crew.ads:108:4:GiveOrders:Test_GiveOrders
procedure Test_UpdateOrders_388ab3_cad1b0(Gnattest_T: in out Test);
-- ships-crew.ads:128:4:UpdateOrders:Test_UpdateOrders
procedure Test_UpdateMorale_5618e2_5147b1(Gnattest_T: in out Test);
-- ships-crew.ads:143:4:UpdateMorale:Test_UpdateMorale
end Ships.Crew.Test_Data.Tests;
-- end read only
|
-- 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/>.
-- Test Ada additions to core GDB evaluation.
with System;
with Text_IO; use Text_IO;
procedure P is
type Int is range System.Min_Int .. System.Max_Int;
X, Z : Int;
Y : Integer;
begin
X := 0;
-- Set X to 7 by disguised means lest a future optimizer interfere.
for I in 1 .. 7 loop
X := X + 1;
end loop;
Z := 1;
Y := 0;
while Z < Int'Last / X loop
Z := Z * X;
Y := Y + 1;
end loop;
Put_Line (Int'Image (X ** Y)); -- START
end P;
|
-- Copyright 2011-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 Dn; use Dn;
package body Pck is
procedure Hello is
procedure Nested is
I : Integer := 0;
begin
Do_Nothing (I'Address);
end Nested;
begin
Nested;
end Hello;
procedure There is
begin
null;
end There;
end Pck;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- M D L L . F I L E S --
-- --
-- S p e c --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Simple services used by GNATDLL to deal with Filename extension
package MDLL.Fil is
No_Ext : constant String := "";
-- Used to mark the absence of an extension
function Get_Ext (Filename : String) return String;
-- Return extension of Filename
function Is_Ali (Filename : String) return Boolean;
-- Test if Filename is an Ada library file (.ali)
function Is_Obj (Filename : String) return Boolean;
-- Test if Filename is an object file (.o or .obj)
function Ext_To
(Filename : String;
New_Ext : String := No_Ext)
return String;
-- Return Filename with the extension change to New_Ext
end MDLL.Fil;
|
-- Copyright 2012-2021 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
My_Global_Variable : Integer := 11;
procedure Do_Something (I : in out Integer);
end Pck;
|
with Ada.Strings.Unbounded;
with Simple_Logging;
package body CLIC.Config is
use Ada.Strings.Unbounded;
use TOML;
package Trace renames Simple_Logging;
function Image (F : TOML.Any_Float) return String;
----------------------
-- Import_Recursive --
----------------------
procedure Import_Recursive (This : in out Instance;
Table : TOML.TOML_Value;
Origin : String;
Check : Check_Import := null;
Prefix : String := "")
is
begin
if Table = No_TOML_Value
or else
Table.Kind /= TOML_Table
then
return;
end if;
for Ent of Iterate_On_Table (Table) loop
declare
Key : constant String :=
(if Prefix = "" then "" else Prefix & ".") &
To_String (Ent.Key);
begin
if not Is_Valid_Config_Key (Key) then
Trace.Error ("Invalid configuration key '" & Key & "' in " &
"'" & Origin & "'");
elsif Ent.Value.Kind = TOML_Table then
-- Recursive call on the table
Import_Recursive (This, Ent.Value, Origin, Check, Key);
else
Trace.Debug ("Load config key: '" & Key & "' = '" &
Ent.Value.Kind'Img & "'");
if Ent.Value.Kind not in TOML_String | TOML_Float |
TOML_Integer | TOML_Boolean
then
Trace.Error ("Invalid type '" & Ent.Value.Kind'Img &
"' for key '" & Key &
"' in configuration file '" &
Origin & "'");
Trace.Error ("'" & Key & "' is ignored");
elsif Check /= null and then not Check (Key, Ent.Value) then
Trace.Error ("'" & Key & "' is ignored");
else
-- Insert the config value, potentially replacing a previous
-- definition.
This.Config_Map.Include
(To_Unbounded_String (Key),
(Value => Ent.Value,
Origin => To_Unbounded_String (Origin)));
end if;
end if;
end;
end loop;
end Import_Recursive;
------------
-- Import --
------------
procedure Import (This : in out Instance;
Table : TOML.TOML_Value;
Origin : String;
Check : Check_Import := null)
is
begin
Import_Recursive (This, Table, Origin, Check);
end Import;
-------------
-- Defined --
-------------
function Defined (This : Instance;
Key : Config_Key)
return Boolean
is
begin
return This.Config_Map.Contains (+Key);
end Defined;
-------------------
-- Get_As_String --
-------------------
function Get_As_String (This : Instance;
Key : Config_Key)
return String
is
begin
if This.Defined (Key) then
return Image (This.Get (Key).Value);
else
return "";
end if;
end Get_As_String;
---------
-- Get --
---------
function Get (This : Instance; Key : Config_Key) return Config_Value is
begin
if This.Defined (Key) then
return This.Config_Map.Element (+Key);
else
return No_Config_Value;
end if;
end Get;
---------
-- Get --
---------
function Get (This : Instance;
Key : Config_Key;
Default : Boolean)
return Boolean
is
function Get_With_Default_Bool is new Get_With_Default_Gen
(Boolean, TOML_Boolean, "Boolean", TOML.As_Boolean, Boolean'Image);
begin
return Get_With_Default_Bool (This, Key, Default);
end Get;
---------
-- Get --
---------
function Get (This : Instance;
Key : Config_Key;
Default : String)
return String
is
function Id (Str : String) return String
is (Str);
function Get_With_Default_Str is new Get_With_Default_Gen
(String, TOML_String, "String", TOML.As_String, Id);
begin
return Get_With_Default_Str (This, Key, Default);
end Get;
---------
-- Get --
---------
function Get (This : Instance;
Key : Config_Key;
Default : TOML.Any_Integer)
return TOML.Any_Integer
is
function Get_With_Default_Int is new Get_With_Default_Gen
(TOML.Any_Integer, TOML_Integer, "Integer", TOML.As_Integer,
Any_Integer'Image);
begin
return Get_With_Default_Int (This, Key, Default);
end Get;
---------
-- Get --
---------
function Get (This : Instance;
Key : Config_Key;
Default : TOML.Any_Float)
return TOML.Any_Float
is
function Get_With_Default_Int is new Get_With_Default_Gen
(TOML.Any_Float, TOML_Float, "Float", TOML.As_Float, Image);
begin
return Get_With_Default_Int (This, Key, Default);
end Get;
-----------
-- Clear --
-----------
procedure Clear (This : in out Instance) is
begin
This.Config_Map.Clear;
end Clear;
--------------------------
-- Get_With_Default_Gen --
--------------------------
function Get_With_Default_Gen (This : Instance;
Key : Config_Key;
Default : Return_Type)
return Return_Type
is
Val : constant Config_Value := This.Get (Key);
begin
if Val.Value.Is_Null then
Trace.Detail ("Using default value for configuration '" & Key &
"': '" & Image (Default) & "'");
return Default;
elsif Val.Value.Kind /= Expected_TOML_Kind then
Trace.Error ("Invalid type ('" & Val.Value.Kind'Img &
"') for configuration '" & Key & "'");
Trace.Error ("in '" & To_String (Val.Origin) & "'");
Trace.Error (Type_Name & " expected");
Trace.Error ("Using default: '" & Image (Default) & "'");
return Default;
else
return TOML_As_Return_Type (Val.Value);
end if;
end Get_With_Default_Gen;
-------------------
-- To_TOML_Value --
-------------------
function To_TOML_Value (Str : String) return TOML.TOML_Value is
Result : constant TOML.Read_Result := TOML.Load_String ("key=" & Str);
begin
if not Result.Success
or else
Result.Value.Kind /= TOML_Table
or else
not Result.Value.Has ("key")
then
-- Conversion failed
-- Interpret as a string
return Create_String (Str);
else
return Result.Value.Get ("key");
end if;
end To_TOML_Value;
---------------------
-- No_Config_Value --
---------------------
function No_Config_Value return Config_Value
is (Value => TOML.No_TOML_Value,
Origin => Null_Unbounded_String);
-----------
-- Image --
-----------
function Image (F : TOML.Any_Float) return String is
begin
case F.Kind is
when Regular =>
return AAA.Strings.Trim (F.Value'Image);
when NaN | Infinity =>
return (if F.Positive then "" else "-") &
(if F.Kind = NaN then "nan" else "inf");
end case;
end Image;
-----------
-- Image --
-----------
function Image (Val : TOML.TOML_Value) return String is
begin
case Val.Kind is
when TOML_Boolean =>
return (if Val.As_Boolean then "true" else "false");
when TOML_Integer =>
return AAA.Strings.Trim (Val.As_Integer'Img);
when TOML_Float =>
return Image (Val.As_Float);
when TOML_String =>
return Val.As_String;
when others =>
return "";
end case;
end Image;
end CLIC.Config;
|
-----------------------------------------------------------------------
-- AUnit utils - Helper for writing unit tests
-- Copyright (C) 2009, 2010 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 Ahven.Framework;
with Util.Tests;
generic
type Test_Fixture is new Ahven.Framework.Test_Case with private;
Name : String := "Test";
package Util.Test_Caller is
type Test_Method is access procedure (T : in out Test_Fixture);
procedure Add_Test (Suite : in Util.Tests.Access_Test_Suite;
Test_Name : in String;
Method : in Test_Method);
end Util.Test_Caller;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M --
-- --
-- S p e c --
-- (GNU/Linux-SPARC Version) --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package System is
pragma Pure;
-- Note that we take advantage of the implementation permission to make
-- this unit Pure instead of Preelaborable; see RM 13.7.1(15). In Ada
-- 2005, this is Pure in any case (AI-362).
pragma No_Elaboration_Code_All;
-- Allow the use of that restriction in units that WITH this unit
type Name is (SYSTEM_NAME_GNAT);
System_Name : constant Name := SYSTEM_NAME_GNAT;
-- System-Dependent Named Numbers
Min_Int : constant := Long_Long_Integer'First;
Max_Int : constant := Long_Long_Integer'Last;
Max_Binary_Modulus : constant := 2 ** Long_Long_Integer'Size;
Max_Nonbinary_Modulus : constant := Integer'Last;
Max_Base_Digits : constant := Long_Long_Float'Digits;
Max_Digits : constant := Long_Long_Float'Digits;
Max_Mantissa : constant := 63;
Fine_Delta : constant := 2.0 ** (-Max_Mantissa);
Tick : constant := 0.000_001;
-- Storage-related Declarations
type Address is private;
pragma Preelaborable_Initialization (Address);
Null_Address : constant Address;
Storage_Unit : constant := 8;
Word_Size : constant := Standard'Word_Size;
Memory_Size : constant := 2 ** Word_Size;
-- Address comparison
function "<" (Left, Right : Address) return Boolean;
function "<=" (Left, Right : Address) return Boolean;
function ">" (Left, Right : Address) return Boolean;
function ">=" (Left, Right : Address) return Boolean;
function "=" (Left, Right : Address) return Boolean;
pragma Import (Intrinsic, "<");
pragma Import (Intrinsic, "<=");
pragma Import (Intrinsic, ">");
pragma Import (Intrinsic, ">=");
pragma Import (Intrinsic, "=");
-- Other System-Dependent Declarations
type Bit_Order is (High_Order_First, Low_Order_First);
Default_Bit_Order : constant Bit_Order := High_Order_First;
pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning
-- Priority-related Declarations (RM D.1)
Max_Priority : constant Positive := 30;
Max_Interrupt_Priority : constant Positive := 31;
subtype Any_Priority is Integer range 0 .. 31;
subtype Priority is Any_Priority range 0 .. 30;
subtype Interrupt_Priority is Any_Priority range 31 .. 31;
Default_Priority : constant Priority := 15;
private
type Address is mod Memory_Size;
Null_Address : constant Address := 0;
--------------------------------------
-- System Implementation Parameters --
--------------------------------------
-- These parameters provide information about the target that is used
-- by the compiler. They are in the private part of System, where they
-- can be accessed using the special circuitry in the Targparm unit
-- whose source should be consulted for more detailed descriptions
-- of the individual switch values.
Backend_Divide_Checks : constant Boolean := False;
Backend_Overflow_Checks : constant Boolean := True;
Command_Line_Args : constant Boolean := True;
Configurable_Run_Time : constant Boolean := False;
Denorm : constant Boolean := True;
Duration_32_Bits : constant Boolean := False;
Exit_Status_Supported : constant Boolean := True;
Fractional_Fixed_Ops : constant Boolean := False;
Frontend_Layout : constant Boolean := False;
Machine_Overflows : constant Boolean := False;
Machine_Rounds : constant Boolean := True;
Preallocated_Stacks : constant Boolean := False;
Signed_Zeros : constant Boolean := True;
Stack_Check_Default : constant Boolean := False;
Stack_Check_Probes : constant Boolean := True;
Stack_Check_Limits : constant Boolean := False;
Support_Aggregates : constant Boolean := True;
Support_Composite_Assign : constant Boolean := True;
Support_Composite_Compare : constant Boolean := True;
Support_Long_Shifts : constant Boolean := True;
Always_Compatible_Rep : constant Boolean := False;
Suppress_Standard_Library : constant Boolean := False;
Use_Ada_Main_Program_Name : constant Boolean := False;
Frontend_Exceptions : constant Boolean := False;
ZCX_By_Default : constant Boolean := True;
end System;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T B I N D --
-- --
-- S p e c --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Main program of GNAT binder
procedure Gnatbind;
|
with Unchecked_Deallocation;
package body Prot2_Pkg2 is
protected type Rec is
private
M : T;
end Rec;
protected body Rec is end;
procedure Create (B : out Id) is
begin
B := new Rec;
end;
procedure Delete (B : in out Id) is
procedure Free is new Unchecked_Deallocation(Object => Rec, Name => Id);
begin
Free (B);
end;
end Prot2_Pkg2;
|
-- with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Readable_Sequences.String_Sequences;
use Readable_Sequences;
package Protypo.Tokens is
use Ada.Strings.Unbounded;
subtype Token_Position is
Readable_Sequences.String_Sequences.Position_Type;
No_Position : constant Token_Position :=
Readable_Sequences.String_Sequences.No_Position;
function Image (X : Token_Position;
Full : Boolean := True) return String;
type Token_Class is
(Int,
Real,
Text,
Identifier,
Plus, Minus, Mult, Div,
Equal, Different,
Less_Than, Greater_Than,
Less_Or_Equal, Greater_Or_Equal,
Assign,
Dot,
Open_Parenthesis,
Close_Parenthesis,
Comma,
Label_Separator,
End_Of_Statement,
Kw_If,
Kw_Then,
Kw_Elsif,
Kw_Else,
Kw_Case,
Kw_When,
Kw_For,
Kw_While,
Kw_Loop,
Kw_Exit,
Kw_Function,
Kw_Procedure,
Kw_capture,
Kw_Begin,
Kw_Return,
Kw_End,
Kw_And,
Kw_Or,
Kw_Xor,
Kw_Not,
Kw_Mod,
Kw_In,
Kw_Is,
Kw_Of,
End_Of_Text);
subtype Valued_Token is Token_Class range Int .. Identifier;
subtype Unvalued_Token is Token_Class range Plus .. End_Of_Text;
subtype Not_Keyword is Unvalued_Token range Plus .. End_Of_Statement;
subtype Keyword_Tokens is Unvalued_Token range Kw_If .. Kw_Of;
subtype Logical_Operator is Unvalued_Token range Kw_And .. Kw_Xor;
subtype Rem_Operator is Unvalued_Token range Kw_Mod .. Kw_Mod;
subtype Comp_Operator is Unvalued_Token range Equal .. Greater_Or_Equal;
subtype Numeric_Operator is Unvalued_Token range Plus .. Div;
subtype Unary_Operator is Unvalued_Token
with Static_Predicate =>
Unary_Operator in Plus .. Minus | Kw_Not;
subtype Binary_Operator is Unvalued_Token
with Static_Predicate =>
Binary_Operator in Numeric_Operator | Comp_Operator | Logical_Operator | Rem_Operator;
type Token is private;
type Token_Builder is tagged private;
function Is_Position_Set (Builder : Token_Builder) return Boolean;
procedure Set_Position (Builder : in out Token_Builder;
Position : Token_Position)
with
Pre => not Builder.Is_Position_Set,
Post => Builder.Is_Position_Set;
procedure Clear_Position (Builder : in out Token_Builder)
with
Pre => Builder.Is_Position_Set,
Post => not Builder.Is_Position_Set;
function Peek_Position (Builder : Token_Builder) return Token_Position
with
Pre => Builder.Is_Position_Set;
function Make_Token (Builder : in out Token_Builder;
Class : Valued_Token;
Value : String)
return Token
with
Pre => Builder.Is_Position_Set,
Post => not Builder.Is_Position_Set;
function Make_Token (Builder : in out Token_Builder;
Class : Unvalued_Token)
return Token
with
Pre => Builder.Is_Position_Set,
Post => not Builder.Is_Position_Set;
function Make_Unanchored_Token (Class : Valued_Token;
Value : String)
return Token;
function Make_Unanchored_Token (Class : Unvalued_Token)
return Token;
function Class (Tk : Token) return Token_Class;
function Value (Tk : Token) return String
with Pre => Class (Tk) in Valued_Token;
function Image (Tk : Token) return String;
function Position (Tk : Token) return Token_Position;
function Line (Tk : Token) return Positive;
function Char (Tk : Token) return Positive;
private
use type String_Sequences.Position_Type;
type Token_Builder is tagged
record
Has_Position : Boolean := False;
Position : Token_Position;
end record;
function Peek_Position (Builder : Token_Builder) return Token_Position
is (Builder.Position);
type Token is
record
Class : Token_Class;
Value : Unbounded_String;
Position : Token_Position;
end record
with Dynamic_Predicate => (if Class in Unvalued_Token then Value = Null_Unbounded_String);
function Make_Unanchored_Token (Class : Unvalued_Token)
return Token
is ((Class => Class,
Value => Null_Unbounded_String,
Position => String_Sequences.No_Position));
function Make_Unanchored_Token (Class : Valued_Token;
Value : String)
return Token
is ((Class => Class,
Value => To_Unbounded_String (Value),
Position => String_Sequences.No_Position));
function Class (Tk : Token) return Token_Class
is (Tk.Class);
function Value (Tk : Token) return String
is (To_String (Tk.Value));
function Image (Tk : Token) return String
is (Token_Class'Image (Tk.Class)
& " "
& (if Tk.Class in Valued_Token then
"(" & To_String (Tk.Value) & ")"
else
""));
function Position (Tk : Token) return Token_Position
is (Tk.Position);
function Line (Tk : Token) return Positive
is (String_Sequences.Line (Tk.Position));
function Char (Tk : Token) return Positive
is (String_Sequences.Char (Tk.Position));
function Image (X : Token_Position;
Full : Boolean := True)
return String
is (String_Sequences.Image (X, Full));
end Protypo.Tokens;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 5 8 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 58
package System.Pack_58 is
pragma Preelaborate;
Bits : constant := 58;
type Bits_58 is mod 2 ** Bits;
for Bits_58'Size use Bits;
-- In all subprograms below, Rev_SSO is set True if the array has the
-- non-default scalar storage order.
function Get_58
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_58 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_58
(Arr : System.Address;
N : Natural;
E : Bits_58;
Rev_SSO : Boolean) with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
function GetU_58
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_58 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned. This version
-- is used when Arr may represent an unaligned address.
procedure SetU_58
(Arr : System.Address;
N : Natural;
E : Bits_58;
Rev_SSO : Boolean) with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value. This version
-- is used when Arr may represent an unaligned address
end System.Pack_58;
|
-- { dg-do run }
procedure Interface_Conv is
package Pkg is
type I1 is interface;
procedure Prim (X : I1) is null;
type I2 is interface;
procedure Prim (X : I2) is null;
type DT is new I1 and I2 with null record;
end Pkg;
use Pkg;
Obj : DT;
CW_3 : I2'Class := Obj;
CW_5 : I1'Class := I1'Class (CW_3); -- test
begin
null;
end;
|
with Ada.Text_IO;
procedure Euler8 is
Product_Size : constant Positive := 13;
type Product is range 0 .. 9 ** Product_Size;
package Product_IO is new Ada.Text_IO.Integer_IO(Product);
function String_Product(S: String) return Product is
Prod: Product := 1;
begin
for C of S loop
Prod := Prod * (Character'Pos(C) - Character'Pos('0'));
end loop;
return Prod;
end String_Product;
Line_Length: constant Positive := 50;
Number: String(1 .. 1000);
Append: Positive := Number'First;
Curr, Max: Product := 0;
begin
while not Ada.Text_IO.End_Of_File loop
Number(Append .. Append + Line_Length - 1) := Ada.Text_IO.Get_Line;
Append := Append + Line_Length;
end loop;
for I in Number'Range loop
exit when I + Product_Size - 1 > Number'Last;
Curr := String_Product(Number(I .. I + Product_Size - 1));
if Curr > Max then Max := Curr; end if;
end loop;
Product_IO.Put(Max);
end Euler8;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.