hexsha
stringlengths 40
40
| size
int64 3
1.05M
| ext
stringclasses 163
values | lang
stringclasses 53
values | max_stars_repo_path
stringlengths 3
945
| max_stars_repo_name
stringlengths 4
112
| max_stars_repo_head_hexsha
stringlengths 40
78
| max_stars_repo_licenses
sequencelengths 1
10
| max_stars_count
float64 1
191k
⌀ | max_stars_repo_stars_event_min_datetime
stringlengths 24
24
⌀ | max_stars_repo_stars_event_max_datetime
stringlengths 24
24
⌀ | max_issues_repo_path
stringlengths 3
945
| max_issues_repo_name
stringlengths 4
113
| max_issues_repo_head_hexsha
stringlengths 40
78
| max_issues_repo_licenses
sequencelengths 1
10
| max_issues_count
float64 1
116k
⌀ | max_issues_repo_issues_event_min_datetime
stringlengths 24
24
⌀ | max_issues_repo_issues_event_max_datetime
stringlengths 24
24
⌀ | max_forks_repo_path
stringlengths 3
945
| max_forks_repo_name
stringlengths 4
113
| max_forks_repo_head_hexsha
stringlengths 40
78
| max_forks_repo_licenses
sequencelengths 1
10
| max_forks_count
float64 1
105k
⌀ | max_forks_repo_forks_event_min_datetime
stringlengths 24
24
⌀ | max_forks_repo_forks_event_max_datetime
stringlengths 24
24
⌀ | content
stringlengths 3
1.05M
| avg_line_length
float64 1
966k
| max_line_length
int64 1
977k
| alphanum_fraction
float64 0
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
394c7b1c64a9896506207187e544c3bc1e8f1e73 | 18,621 | adb | Ada | orka/src/orka/implementation/orka-resources-textures-ktx.adb | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | orka/src/orka/implementation/orka-resources-textures-ktx.adb | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | orka/src/orka/implementation/orka-resources-textures-ktx.adb | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 4 | 2018-04-28T22:36:26.000Z | 2020-11-14T23:00:29.000Z | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2017 onox <[email protected]>
--
-- 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 System;
with Ada.Exceptions;
with Ada.Unchecked_Deallocation;
with GL.Low_Level.Enums;
with GL.Pixels.Extensions;
with GL.Types.Pointers;
with Orka.Jobs;
with Orka.KTX;
with Orka.Logging;
with Orka.OS;
with Orka.Strings;
package body Orka.Resources.Textures.KTX is
use all type Orka.Logging.Source;
use all type Orka.Logging.Severity;
package Messages is new Orka.Logging.Messages (Resource_Loader);
function Trim_Image (Value : Integer) return String is
(Orka.Strings.Trim (Integer'Image (Value)));
type KTX_Load_Job is new Jobs.Abstract_Job and Jobs.GPU_Job with record
Data : Loaders.Resource_Data;
Manager : Managers.Manager_Ptr;
end record;
overriding
procedure Execute
(Object : KTX_Load_Job;
Context : Jobs.Execution_Context'Class);
-----------------------------------------------------------------------------
function Read_Texture
(Bytes : Byte_Array_Pointers.Constant_Reference;
Path : String;
Start : Time) return GL.Objects.Textures.Texture
is
T1 : Time renames Start;
T2 : constant Time := Orka.OS.Monotonic_Clock;
use Ada.Streams;
use GL.Low_Level.Enums;
use type GL.Types.Size;
use type Time;
T3, T4, T5, T6 : Time;
begin
if not Orka.KTX.Valid_Identifier (Bytes) then
raise Texture_Load_Error with Path & " is not a KTX file";
end if;
declare
Header : constant Orka.KTX.Header := Orka.KTX.Get_Header (Bytes);
Levels : constant GL.Types.Size := GL.Types.Size'Max (1, Header.Mipmap_Levels);
Texture : GL.Objects.Textures.Texture (Header.Kind);
Width : constant GL.Types.Size := Header.Width;
Height : GL.Types.Size := Header.Height;
Depth : GL.Types.Size := Header.Depth;
begin
T3 := Orka.OS.Monotonic_Clock;
if not Header.Compressed
and then Header.Data_Type in GL.Pixels.Extensions.Packed_Data_Type
then
raise GL.Feature_Not_Supported_Exception with
"Packed data type " & Header.Data_Type'Image & " is not supported yet";
end if;
-- Allocate storage
case Header.Kind is
when Texture_2D_Array =>
Depth := Header.Array_Elements;
when Texture_1D_Array =>
Height := Header.Array_Elements;
pragma Assert (Depth = 0);
when Texture_Cube_Map_Array =>
-- For a cube map array, depth is the number of layer-faces
Depth := Header.Array_Elements * 6;
when Texture_3D =>
null;
when Texture_2D | Texture_Cube_Map =>
pragma Assert (Depth = 0);
when Texture_1D =>
if Header.Compressed then
raise Texture_Load_Error with Path & " has unknown 1D compressed format";
end if;
pragma Assert (Height = 0);
pragma Assert (Depth = 0);
when others =>
raise Program_Error;
end case;
if Header.Compressed then
Texture.Allocate_Storage (Levels, 1, Header.Compressed_Format,
Width, Height, Depth);
else
Texture.Allocate_Storage (Levels, 1, Header.Internal_Format,
Width, Height, Depth);
end if;
case Header.Kind is
when Texture_1D =>
Height := 1;
Depth := 1;
when Texture_1D_Array | Texture_2D =>
Depth := 1;
when Texture_2D_Array | Texture_3D =>
null;
when Texture_Cube_Map | Texture_Cube_Map_Array =>
-- Texture_Cube_Map uses 2D storage, but 3D load operation
-- according to table 8.15 of the OpenGL specification
-- For a cube map, depth is the number of faces, for
-- a cube map array, depth is the number of layer-faces
Depth := GL.Types.Size'Max (1, Header.Array_Elements) * 6;
when others =>
raise Program_Error;
end case;
T4 := Orka.OS.Monotonic_Clock;
-- TODO Handle KTXorientation key value pair
declare
procedure Iterate (Position : Orka.KTX.String_Maps.Cursor) is
begin
Messages.Log (Warning, "Metadata: " & Orka.KTX.String_Maps.Key (Position) &
" = " & Orka.KTX.String_Maps.Element (Position));
end Iterate;
begin
Orka.KTX.Get_Key_Value_Map (Bytes, Header.Bytes_Key_Value).Iterate (Iterate'Access);
end;
-- Upload texture data
declare
Image_Size_Index : Stream_Element_Offset
:= Orka.KTX.Get_Data_Offset (Bytes, Header.Bytes_Key_Value);
Cube_Map : constant Boolean := Header.Kind = Texture_Cube_Map;
begin
for Level in 0 .. Levels - 1 loop
declare
Face_Size : constant Natural := Orka.KTX.Get_Length (Bytes, Image_Size_Index);
-- If not Cube_Map, then Face_Size is the size of the whole level
Cube_Padding : constant Natural := 3 - ((Face_Size + 3) mod 4);
Image_Size : constant Natural
:= (if Cube_Map then (Face_Size + Cube_Padding) * 6 else Face_Size);
-- If Cube_Map then Levels = 1 so no need to add it to the expression
-- Compute size of the whole mipmap level
Mip_Padding : constant Natural := 3 - ((Image_Size + 3) mod 4);
Mipmap_Size : constant Natural := 4 + Image_Size + Mip_Padding;
Offset : constant Stream_Element_Offset := Image_Size_Index + 4;
pragma Assert
(Offset + Stream_Element_Offset (Image_Size) - 1 <= Bytes.Value'Last);
Image_Data : constant System.Address := Bytes (Offset)'Address;
Level_Width : constant GL.Types.Size := Texture.Width (Level);
Level_Height : constant GL.Types.Size := Texture.Height (Level);
Level_Depth : constant GL.Types.Size :=
(if Cube_Map then 6 else Texture.Depth (Level));
begin
if Header.Compressed then
Texture.Load_From_Data
(Level, 0, 0, 0, Level_Width, Level_Height, Level_Depth,
Header.Compressed_Format, GL.Types.Int (Image_Size), Image_Data);
else
declare
Original_Alignment : constant GL.Pixels.Alignment :=
GL.Pixels.Unpack_Alignment;
begin
GL.Pixels.Set_Unpack_Alignment (GL.Pixels.Words);
Texture.Load_From_Data (Level, 0, 0, 0,
Level_Width, Level_Height, Level_Depth,
Header.Format, Header.Data_Type, Image_Data);
GL.Pixels.Set_Unpack_Alignment (Original_Alignment);
end;
end if;
Image_Size_Index := Image_Size_Index + Stream_Element_Offset (Mipmap_Size);
end;
end loop;
end;
T5 := Orka.OS.Monotonic_Clock;
-- Generate a full mipmap pyramid if Mipmap_Levels = 0
if Header.Mipmap_Levels = 0 then
Texture.Generate_Mipmap;
end if;
T6 := Orka.OS.Monotonic_Clock;
Messages.Log (Info, "Loaded texture " & Path & " in " &
Logging.Trim (Logging.Image (T6 - T1)));
Messages.Log (Info, " dims: " &
Logging.Trim (Width'Image) & " × " &
Logging.Trim (Height'Image) & " × " &
Logging.Trim (Depth'Image) &
", mipmap levels:" & Levels'Image);
Messages.Log (Info, " size: " & Trim_Image (Bytes.Value'Length) & " bytes");
Messages.Log (Info, " kind: " & Header.Kind'Image);
if Header.Compressed then
Messages.Log (Info, " format: " & Header.Compressed_Format'Image);
else
Messages.Log (Info, " format: " & Header.Internal_Format'Image &
" (" & Trim_Image (Integer (GL.Pixels.Extensions.Components (Header.Format))) &
"x " & Header.Data_Type'Image & ")");
end if;
Messages.Log (Info, " statistics:");
Messages.Log (Info, " reading file: " & Logging.Image (T2 - T1));
Messages.Log (Info, " parsing header: " & Logging.Image (T3 - T2));
Messages.Log (Info, " storage: " & Logging.Image (T4 - T3));
Messages.Log (Info, " buffers: " & Logging.Image (T5 - T4));
if Header.Mipmap_Levels = 0 then
Messages.Log (Info, " generating mipmap:" & Logging.Image (T6 - T5));
end if;
return Texture;
end;
exception
when Error : Orka.KTX.Invalid_Enum_Error =>
declare
Message : constant String := Ada.Exceptions.Exception_Message (Error);
begin
raise Texture_Load_Error with Path & " has " & Message;
end;
end Read_Texture;
function Read_Texture
(Location : Locations.Location_Ptr;
Path : String) return GL.Objects.Textures.Texture
is
Start_Time : constant Time := Orka.OS.Monotonic_Clock;
begin
return Read_Texture (Location.Read_Data (Path).Get, Path, Start_Time);
end Read_Texture;
overriding
procedure Execute
(Object : KTX_Load_Job;
Context : Jobs.Execution_Context'Class)
is
Bytes : Byte_Array_Pointers.Constant_Reference := Object.Data.Bytes.Get;
Path : String renames SU.To_String (Object.Data.Path);
Resource : constant Texture_Ptr := new Texture'(others => <>);
begin
Resource.Texture.Replace_Element (Read_Texture (Bytes, Path, Object.Data.Start_Time));
-- Register resource at the resource manager
Object.Manager.Add_Resource (Path, Resource_Ptr (Resource));
end Execute;
-----------------------------------------------------------------------------
-- Loader --
-----------------------------------------------------------------------------
type KTX_Loader is limited new Loaders.Loader with record
Manager : Managers.Manager_Ptr;
end record;
overriding
function Extension (Object : KTX_Loader) return Loaders.Extension_String is ("ktx");
overriding
procedure Load
(Object : KTX_Loader;
Data : Loaders.Resource_Data;
Enqueue : not null access procedure (Element : Jobs.Job_Ptr);
Location : Locations.Location_Ptr)
is
Job : constant Jobs.Job_Ptr := new KTX_Load_Job'
(Jobs.Abstract_Job with
Data => Data,
Manager => Object.Manager);
begin
Enqueue (Job);
end Load;
function Create_Loader
(Manager : Managers.Manager_Ptr) return Loaders.Loader_Ptr
is (new KTX_Loader'(Manager => Manager));
-----------------------------------------------------------------------------
-- Writer --
-----------------------------------------------------------------------------
package Pointers is new GL.Objects.Textures.Texture_Pointers (Byte_Pointers);
procedure Write_Texture
(Texture : GL.Objects.Textures.Texture;
Location : Locations.Writable_Location_Ptr;
Path : String)
is
package Textures renames GL.Objects.Textures;
Format : GL.Pixels.Format := GL.Pixels.RGBA;
Data_Type : GL.Pixels.Data_Type := GL.Pixels.Float;
-- Note: unused if texture is compressed
Base_Level : constant := 0;
use Ada.Streams;
use all type GL.Low_Level.Enums.Texture_Kind;
use type GL.Types.Size;
Compressed : constant Boolean := Texture.Compressed;
Header : Orka.KTX.Header (Compressed);
function Convert
(Bytes : in out GL.Types.Pointers.UByte_Array_Access) return Byte_Array_Pointers.Pointer
is
Pointer : Byte_Array_Pointers.Pointer;
Result : constant Byte_Array_Access := new Byte_Array (1 .. Bytes'Length);
procedure Free is new Ada.Unchecked_Deallocation
(Object => GL.Types.UByte_Array, Name => GL.Types.Pointers.UByte_Array_Access);
begin
for Index in Bytes'Range loop
declare
Target_Index : constant Stream_Element_Offset
:= Stream_Element_Offset (Index - Bytes'First + 1);
begin
Result (Target_Index) := Stream_Element (Bytes (Index));
end;
end loop;
Free (Bytes);
Pointer.Set (Result);
return Pointer;
end Convert;
function Convert
(Bytes : in out Pointers.Element_Array_Access) return Byte_Array_Pointers.Pointer
is
Pointer : Byte_Array_Pointers.Pointer;
Result : constant Byte_Array_Access := new Byte_Array (1 .. Bytes'Length);
begin
Result.all := Bytes.all;
Pointers.Free (Bytes);
Pointer.Set (Result);
return Pointer;
end Convert;
function Get_Data
(Level : Textures.Mipmap_Level) return Byte_Array_Pointers.Pointer
is
Data : Pointers.Element_Array_Access;
begin
Data := Pointers.Get_Data (Texture, Level, 0, 0, 0,
Texture.Width (Level), Texture.Height (Level), Texture.Depth (Level),
Format, Data_Type);
return Convert (Data);
end Get_Data;
function Get_Compressed_Data
(Level : Textures.Mipmap_Level) return Byte_Array_Pointers.Pointer
is
Data : GL.Types.Pointers.UByte_Array_Access;
begin
Data := Textures.Get_Compressed_Data (Texture, Level, 0, 0, 0,
Texture.Width (Level), Texture.Height (Level), Texture.Depth (Level),
Texture.Compressed_Format);
return Convert (Data);
end Get_Compressed_Data;
T1, T2, T3, T4 : Duration;
begin
T1 := Orka.OS.Monotonic_Clock;
Header.Kind := Texture.Kind;
Header.Width := Texture.Width (Base_Level);
case Texture.Kind is
when Texture_3D =>
Header.Height := Texture.Height (Base_Level);
Header.Depth := Texture.Depth (Base_Level);
when Texture_2D | Texture_2D_Array | Texture_Cube_Map | Texture_Cube_Map_Array =>
Header.Height := Texture.Height (Base_Level);
Header.Depth := 0;
when Texture_1D | Texture_1D_Array =>
Header.Height := 0;
Header.Depth := 0;
when others =>
raise Program_Error;
end case;
case Texture.Kind is
when Texture_1D_Array =>
Header.Array_Elements := Texture.Height (Base_Level);
when Texture_2D_Array =>
Header.Array_Elements := Texture.Depth (Base_Level);
when Texture_Cube_Map_Array =>
Header.Array_Elements := Texture.Depth (Base_Level) / 6;
when Texture_1D | Texture_2D | Texture_3D | Texture_Cube_Map =>
Header.Array_Elements := 0;
when others =>
raise Program_Error;
end case;
Header.Mipmap_Levels := Texture.Mipmap_Levels;
Header.Bytes_Key_Value := 0;
if Compressed then
Header.Compressed_Format := Texture.Compressed_Format;
else
declare
Internal_Format : constant GL.Pixels.Internal_Format
:= Texture.Internal_Format;
begin
Format := GL.Pixels.Extensions.Texture_Format (Internal_Format);
Data_Type := GL.Pixels.Extensions.Texture_Data_Type (Internal_Format);
Header.Internal_Format := Internal_Format;
Header.Format := Format;
Header.Data_Type := Data_Type;
end;
end if;
T2 := Orka.OS.Monotonic_Clock;
declare
function Get_Level_Data
(Level : Textures.Mipmap_Level) return Byte_Array_Pointers.Pointer
is (if Compressed then Get_Compressed_Data (Level) else Get_Data (Level));
Bytes : constant Byte_Array_Pointers.Pointer
:= Orka.KTX.Create_KTX_Bytes (Header, Get_Level_Data'Access);
begin
T3 := Orka.OS.Monotonic_Clock;
Location.Write_Data (Path, Bytes.Get);
T4 := Orka.OS.Monotonic_Clock;
Messages.Log (Info, "Saved texture " & Path & " in " &
Logging.Trim (Logging.Image (+(T4 - T1))));
Messages.Log (Info, " dims: " &
Logging.Trim (Texture.Width (Base_Level)'Image) & " × " &
Logging.Trim (Texture.Height (Base_Level)'Image) & " × " &
Logging.Trim (Texture.Depth (Base_Level)'Image) &
", mipmap levels:" & Texture.Mipmap_Levels'Image);
Messages.Log (Info, " size: " & Trim_Image (Bytes.Get.Value'Length) & " bytes");
Messages.Log (Info, " kind: " & Texture.Kind'Image);
if Header.Compressed then
Messages.Log (Info, " format: " & Texture.Compressed_Format'Image);
else
Messages.Log (Info, " format: " & Texture.Internal_Format'Image &
" (" & Trim_Image (Integer (GL.Pixels.Extensions.Components (Header.Format))) &
"x " & Header.Data_Type'Image & ")");
end if;
Messages.Log (Info, " statistics:");
Messages.Log (Info, " creating header: " & Logging.Image (+(T2 - T1)));
Messages.Log (Info, " retrieving data: " & Logging.Image (+(T3 - T2)));
Messages.Log (Info, " writing file: " & Logging.Image (+(T4 - T3)));
end;
end Write_Texture;
end Orka.Resources.Textures.KTX;
| 38.47314 | 96 | 0.576929 |
39fbb54aa099c203825ac26f2ae2d98d3b50f425 | 10,061 | adb | Ada | src/util/spat-spark_files.adb | HeisenbugLtd/spat | c3ec2b7675a12bdbe5378862b1ec6b17805d5a6c | [
"WTFPL"
] | 20 | 2020-05-17T18:55:16.000Z | 2021-05-26T14:53:53.000Z | src/util/spat-spark_files.adb | selroc/spat | c3ec2b7675a12bdbe5378862b1ec6b17805d5a6c | [
"WTFPL"
] | 33 | 2020-04-03T13:08:50.000Z | 2020-10-17T04:26:34.000Z | src/util/spat-spark_files.adb | selroc/spat | c3ec2b7675a12bdbe5378862b1ec6b17805d5a6c | [
"WTFPL"
] | 4 | 2020-06-12T12:17:27.000Z | 2021-09-09T14:19:31.000Z | ------------------------------------------------------------------------------
-- Copyright (C) 2020 by Heisenbug Ltd. ([email protected])
--
-- This work is free. You can redistribute it and/or modify it under the
-- terms of the Do What The Fuck You Want To Public License, Version 2,
-- as published by Sam Hocevar. See the LICENSE file for more details.
------------------------------------------------------------------------------
pragma License (Unrestricted);
with Ada.Containers.Synchronized_Queue_Interfaces;
with Ada.Containers.Unbounded_Synchronized_Queues;
with Ada.Exceptions;
with Ada.IO_Exceptions;
with Ada.Text_IO;
with SPAT.Log;
with SPAT.Strings;
with System.Multiprocessors;
package body SPAT.Spark_Files is
---------------------------------------------------------------------------
-- Parallelization support.
--
-- Reading and parsing the JSON formatted .spark files can easily be
-- parallelized, there is no dependency between them.
---------------------------------------------------------------------------
package Worker_Tasks is
-- Just use the number of CPUs on the system.
Num_Workers : constant System.Multiprocessors.CPU :=
System.Multiprocessors.Number_Of_CPUs;
-- The tasks get an input file name and return the read JSON result.
-- To be able to map the file name and the corresponding result, we
-- merge them into a single result record type.
type Parse_Result is
record
Key : SPARK_File_Name;
Result : GNATCOLL.JSON.Read_Result;
end record;
package Implementation is
-- Needed queue (interface) instantiations for input and output types.
package File_Queue_Interface is new
Ada.Containers.Synchronized_Queue_Interfaces
(Element_Type => SPARK_File_Name);
package File_Queues is new
Ada.Containers.Unbounded_Synchronized_Queues
(Queue_Interfaces => File_Queue_Interface);
package Result_Queue_Interface is new
Ada.Containers.Synchronized_Queue_Interfaces
(Element_Type => Parse_Result);
package Result_Queues is new
Ada.Containers.Unbounded_Synchronized_Queues
(Queue_Interfaces => Result_Queue_Interface);
end Implementation;
-- Establish the input queue type. This one expects a file name to
-- parse and any instantiated worker tasks will pick it up from there.
Input_File_Queue : Implementation.File_Queues.Queue;
-- Establish the output queue type. Here you can pick up the parsing
-- results.
Result_Queue : Implementation.Result_Queues.Queue;
------------------------------------------------------------------------
-- Stop
--
-- Tell all worker tasks to terminate.
------------------------------------------------------------------------
procedure Stop;
end Worker_Tasks;
package body Worker_Tasks is
task type Parse_Task;
type Task_List is
array (System.Multiprocessors.CPU range <>) of Parse_Task;
Workers : Task_List (1 .. Num_Workers);
------------------------------------------------------------------------
-- Parse_File
------------------------------------------------------------------------
function Parse_File
(Name : in SPARK_File_Name) return GNATCOLL.JSON.Read_Result;
------------------------------------------------------------------------
-- Parse_File
------------------------------------------------------------------------
function Parse_File (Name : in SPARK_File_Name)
return GNATCOLL.JSON.Read_Result
is
JSON_File : Ada.Text_IO.File_Type;
File_Content : JSON_Data;
begin
Ada.Text_IO.Open (File => JSON_File,
Mode => Ada.Text_IO.In_File,
Name => To_String (Source => Name));
while not Ada.Text_IO.End_Of_File (File => JSON_File) loop
Ada.Strings.Unbounded.Append
(Source => File_Content,
New_Item => Ada.Text_IO.Get_Line (File => JSON_File));
end loop;
Ada.Text_IO.Close (File => JSON_File);
return GNATCOLL.JSON.Read (Strm => File_Content);
end Parse_File;
task body Parse_Task is
Element : SPARK_File_Name;
Result : Worker_Tasks.Parse_Result;
begin
Main_Loop :
loop
Input_File_Queue.Dequeue (Element => Element);
Result.Key := Element;
begin
Result.Result := Parse_File (Name => Element);
exception
when E : Ada.IO_Exceptions.Name_Error =>
Result.Result :=
GNATCOLL.JSON.Read_Result'
(Success => False,
Error =>
GNATCOLL.JSON.Parsing_Error'
(Line => 1,
Column => 1,
Message =>
To_Name (Ada.Exceptions.Exception_Message (E))));
end;
Result_Queue.Enqueue (New_Item => Result);
end loop Main_Loop;
end Parse_Task;
------------------------------------------------------------------------
-- Stop
------------------------------------------------------------------------
procedure Stop is
begin
for Worker of Workers loop
abort Worker;
end loop;
end Stop;
end Worker_Tasks;
---------------------------------------------------------------------------
-- Num_Workers
--
-- Report the number of tasks used for parallel file reads.
---------------------------------------------------------------------------
function Num_Workers return Positive is
(Positive (Worker_Tasks.Num_Workers));
Pending : constant GNATCOLL.JSON.Read_Result :=
GNATCOLL.JSON.Read_Result'
(Success => False,
Error =>
GNATCOLL.JSON.Parsing_Error'(Line => Positive'Last,
Column => Positive'Last,
Message => To_Name ("Queued...")));
---------------------------------------------------------------------------
-- Read
---------------------------------------------------------------------------
not overriding
procedure Read (This : in out T;
Names : in Strings.SPARK_File_Names)
is
use type File_Maps.Cursor;
begin
-- Clear any old remnants and reserve capacity for the number of
-- files we will be trying to add, so we avoid rehashing during
-- the loop.
This.Clear;
This.Reserve_Capacity (Capacity => Names.Length);
Run_Parsers :
declare
Num_Expected : Natural := 0; -- How many responses to expect.
begin
-- Queue input files to the worker tasks.
for Name of Names loop
if This.Find (Key => Name) = File_Maps.No_Element then
This.Insert (Key => Name,
New_Item => Pending);
-- Establish key/value pair. The actual value will be
-- established later, but we need the key in the table,
-- otherwise Find above will never find anything.
Log.Debug
(Message =>
"Queuing """ & To_String (Source => Name) & """...");
Num_Expected := Num_Expected + 1;
Worker_Tasks.Input_File_Queue.Enqueue (New_Item => Name);
else
-- Skip file, we already got that one.
--
-- TODO: Normally we shouldn't be too concerned about
-- duplicates. This check is a leftover from the times
-- when we still got these values from the command-line
-- which could have specified the same file more than
-- once.
Log.Warning
(Message =>
"Duplicate file """ & To_String (Source => Name) &
""" ignored.");
end if;
end loop;
-- Collect results.
Collect_Results :
declare
Result : Worker_Tasks.Parse_Result;
begin
Log.Debug (Message => "Picking up results...");
for i in 1 .. Num_Expected loop
Wait_Loop :
loop
select
Worker_Tasks.Result_Queue.Dequeue (Element => Result);
This.Replace (Key => Result.Key,
New_Item => Result.Result);
Log.Debug
(Message =>
"""" & To_String (Result.Key) & """..." &
(if Result.Result.Success
then "ok."
else "error."));
-- Actual error message will be done by caller.
exit Wait_Loop;
or
delay 10.0;
-- Inform the user if this is taking way too long...
Log.Warning (Message => "Ten seconds have passed.");
Log.Warning (Message => "Still waiting for results.");
Log.Warning (Message => "This is taking awfully long!?");
end select;
end loop Wait_Loop;
end loop;
end Collect_Results;
end Run_Parsers;
end Read;
---------------------------------------------------------------------------
-- Shutdown
---------------------------------------------------------------------------
procedure Shutdown is
begin
Worker_Tasks.Stop;
end Shutdown;
end SPAT.Spark_Files;
| 36.85348 | 81 | 0.473512 |
0ee0eafcb6c718cf4342802a1db7a3f0aab6bcdc | 1,324 | adb | Ada | ada/gps/src/sarge_test.adb | irieger/Sarge | bcd9fa49b813820a53a41838d329b346de89a3d6 | [
"BSD-3-Clause"
] | null | null | null | ada/gps/src/sarge_test.adb | irieger/Sarge | bcd9fa49b813820a53a41838d329b346de89a3d6 | [
"BSD-3-Clause"
] | null | null | null | ada/gps/src/sarge_test.adb | irieger/Sarge | bcd9fa49b813820a53a41838d329b346de89a3d6 | [
"BSD-3-Clause"
] | null | null | null | -- sarge_test.adb - Implementation file for the Sarge command line argument parser test.
-- Revision 0
-- Features:
-- -
-- Notes:
-- -
-- 2019/04/10, Maya Posch
with Sarge;
with Ada.Text_IO;
use Ada.Text_IO;
with Ada.Strings.Unbounded;
use Ada.Strings.Unbounded;
procedure Sarge_Test is
function "+"(S : in String) return Unbounded_String renames Ada.Strings.Unbounded.To_Unbounded_String;
begin
-- Create Sarge instance, set stuff, parse stuff.
Sarge.setArgument(+"h", +"help", +"Get help.", False);
Sarge.setArgument(+"k", +"kittens", +"K is for kittens. Everyone needs kittens in their life.", True);
Sarge.setArgument(+"n", +"number", +"Gimme a number. Any number.", True);
Sarge.setArgument(+"a", +"apple", +"Just an apple.", False);
Sarge.setArgument(+"b", +"bear", +"Look, it's a bear.", False);
Sarge.setDescription(+"Sarge command line argument parsing testing app. For demonstration purposes and testing.");
Sarge.setUsage(+"sarge_test <options>");
if Sarge.parseArguments /= True then
put_line("Couldn't parse arguments...");
return;
end if;
put_line("Number of flags found: " & Sarge.flagCount'Image);
if Sarge.exists(+"help") /= False then
Sarge.printHelp;
else
put_line("No help requested...");
end if;
--
end Sarge_Test;
| 26.48 | 117 | 0.672205 |
500d79646964717e1e117b849569b3644b469ab4 | 5,373 | ads | Ada | src/arch/socs/stm32f429/soc-syscfg.ads | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | 65 | 2018-09-26T09:10:11.000Z | 2022-01-30T21:17:37.000Z | src/arch/socs/stm32f429/soc-syscfg.ads | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | 22 | 2019-04-07T15:15:54.000Z | 2020-10-15T12:45:54.000Z | src/arch/socs/stm32f429/soc-syscfg.ads | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | 10 | 2018-09-27T09:43:08.000Z | 2021-01-29T22:50:17.000Z | --
-- Copyright 2018 The wookey project team <[email protected]>
-- - 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;
| 30.87931 | 79 | 0.549786 |
c5f2796f509b6209fb99d8d178d859b39fd5642f | 2,051 | ads | Ada | Source/ncurses.ads | bkold/Terminal-Chess | 65235b3db47d4ec02677873b4f6e2531e9f4ffba | [
"MIT"
] | null | null | null | Source/ncurses.ads | bkold/Terminal-Chess | 65235b3db47d4ec02677873b4f6e2531e9f4ffba | [
"MIT"
] | null | null | null | Source/ncurses.ads | bkold/Terminal-Chess | 65235b3db47d4ec02677873b4f6e2531e9f4ffba | [
"MIT"
] | null | null | null | package NCurses is
pragma Pure;
type Color is new Natural range 0..7;
type Color_Range is new Natural range 0..1000;
type Byte is mod 2**8 with Size=>8;
COLOR_BLACK : constant Color := 0;
COLOR_RED : constant Color := 1;
COLOR_GREEN : constant Color := 2;
COLOR_YELLOW : constant Color := 3;
COLOR_BLUE : constant Color := 4;
COLOR_MAGENTA : constant Color := 5;
COLOR_CYAN : constant Color := 6;
COLOR_WHITE : constant Color := 7;
procedure Start_Color_Init;
function Get_Input return Byte
with Import, Convention=>C, Link_Name=>"get_mouse_input";
procedure Start_Color
with Import, Convention=>C, Link_Name=>"start_color";
procedure Attribute_On (Pair : in Natural)
with Import, Convention=>C, Link_Name=>"attribute_on_c";
procedure Attribute_Off (Pair : in Natural)
with Import, Convention=>C, Link_Name=>"attribute_off_c";
procedure Attribute_On_Bold
with Import, Convention=>C, Link_Name=>"attribute_on_bold_c";
procedure Setup
with Import, Convention=>C, Link_Name=>"setup";
procedure Attribute_Off_Bold
with Import, Convention=>C, Link_Name=>"attribute_off_bold_c";
procedure Init_Color_Pair (Pair : in Natural; Color_1, Color_2 : in Color)
with Import, Convention=>C, Link_Name=>"init_pair_c";
procedure Init_Color (Color_Op : in Color; R, G, B : Color_Range)
with Import, Convention=>C, Link_Name=>"init_color";
procedure Move_Print_Window (Row, Col : in Natural; Item : in String)
with Import, Convention=>C, Link_Name=>"mvprintw";
procedure Print_Window (Item : in String)
with Import, Convention=>C, Link_Name=>"printw";
procedure Pretty_Print_Window (Item : in String) with Inline;
procedure Pretty_Print_Line_Window (Item : in String) with Inline;
procedure Init_Scr
with Import, Convention=>C, Link_Name=>"initscr";
procedure Refresh
with Import, Convention=>C, Link_Name=>"refresh";
procedure End_Win
with Import, Convention=>C, Link_Name=>"endwin";
procedure Clear
with Import, Convention=>C, Link_Name=>"clear";
pragma Linker_Options("-lncurses");
end NCurses; | 37.981481 | 75 | 0.74549 |
4a60ee72e8e93f4d6a5d4bb88590096ed991635d | 6,076 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-direio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-direio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-direio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I R E C T _ I O --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- This package contains the declaration of the control block used for
-- Direct_IO. This must be declared at the outer library level. It also
-- contains code that is shared between instances of Direct_IO.
with Interfaces.C_Streams;
with Ada.Streams;
with System.File_Control_Block;
with System.Storage_Elements;
package System.Direct_IO is
package FCB renames System.File_Control_Block;
type Operation is (Op_Read, Op_Write, Op_Other);
-- Type used to record last operation (to optimize sequential operations)
subtype Count is Interfaces.C_Streams.int64;
-- The Count type in each instantiation is derived from this type
subtype Positive_Count is Count range 1 .. Count'Last;
type Direct_AFCB is new FCB.AFCB with record
Index : Count := 1;
-- Current Index value
Bytes : Interfaces.C_Streams.size_t;
-- Length of item in bytes (set from inside generic template)
Last_Op : Operation := Op_Other;
-- Last operation performed on file, used to avoid unnecessary
-- repositioning between successive read or write operations.
end record;
function AFCB_Allocate (Control_Block : Direct_AFCB) return FCB.AFCB_Ptr;
procedure AFCB_Close (File : not null access Direct_AFCB);
procedure AFCB_Free (File : not null access Direct_AFCB);
procedure Read
(File : in out Direct_AFCB;
Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
-- Required overriding of Read, not actually used for Direct_IO
procedure Write
(File : in out Direct_AFCB;
Item : Ada.Streams.Stream_Element_Array);
-- Required overriding of Write, not actually used for Direct_IO
type File_Type is access all Direct_AFCB;
-- File_Type in individual instantiations is derived from this type
procedure Create
(File : in out File_Type;
Mode : FCB.File_Mode := FCB.Inout_File;
Name : String := "";
Form : String := "");
function End_Of_File (File : File_Type) return Boolean;
function Index (File : File_Type) return Positive_Count;
procedure Open
(File : in out File_Type;
Mode : FCB.File_Mode;
Name : String;
Form : String := "");
procedure Read
(File : File_Type;
Item : System.Address;
Size : Interfaces.C_Streams.size_t;
From : Positive_Count);
procedure Read
(File : File_Type;
Item : System.Address;
Size : Interfaces.C_Streams.size_t);
procedure Reset (File : in out File_Type; Mode : FCB.File_Mode);
procedure Reset (File : in out File_Type);
procedure Set_Index (File : File_Type; To : Positive_Count);
function Size (File : File_Type) return Count;
procedure Write
(File : File_Type;
Item : System.Address;
Size : Interfaces.C_Streams.size_t;
Zeroes : System.Storage_Elements.Storage_Array);
-- Note: Zeroes is the buffer of zeroes used to fill out partial records
-- The following procedures have a File_Type formal of mode IN OUT because
-- they may close the original file. The Close operation may raise an
-- exception, but in that case we want any assignment to the formal to
-- be effective anyway, so it must be passed by reference (or the caller
-- will be left with a dangling pointer).
pragma Export_Procedure
(Internal => Reset,
External => "",
Parameter_Types => (File_Type),
Mechanism => Reference);
pragma Export_Procedure
(Internal => Reset,
External => "",
Parameter_Types => (File_Type, FCB.File_Mode),
Mechanism => (File => Reference));
end System.Direct_IO;
| 42.48951 | 78 | 0.560895 |
fb82e5854d4ff962a4dbb7e2e24faaaeef424af9 | 1,046 | ads | Ada | gdb/testsuite/gdb.ada/convvar_comp/pck.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | 1 | 2020-10-14T03:24:35.000Z | 2020-10-14T03:24:35.000Z | gdb/testsuite/gdb.ada/convvar_comp/pck.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | gdb/testsuite/gdb.ada/convvar_comp/pck.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2018-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
type Kind_T is (One, Two, Three);
-- type Kind_T is new Integer range 1 .. 3;
type Time_Set_T is array (Kind_T) of Integer;
type T is record
Started : Time_Set_T;
end record;
Null_T : constant T := (Started => (others => 0));
function Break_Me (Item : T) return Boolean;
end Pck;
| 34.866667 | 73 | 0.703633 |
1863d802c9821d671e10a0a7056f9a4e1556e168 | 925 | adb | Ada | software/unittest/estimator/src/simulation.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/unittest/estimator/src/simulation.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/unittest/estimator/src/simulation.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | package body simulation is
procedure init is
begin
if not CSV_here.Open then
Put_Line ("Simulation: Error opening file");
Simulation.Finished := True;
return;
else
Put_Line ("Simulation: Replay from file");
have_data := True;
CSV_here.Parse_Header;
end if;
end init;
procedure update is
begin
if CSV_here.End_Of_File then
Finished := True;
Put_Line ("Simulation: EOF");
return;
end if;
if not CSV_here.Parse_Row then
Simulation.Finished := True;
Put_Line ("Simulation: Row error");
else
CSV_here.Dump_Columns;
declare
t : float := CSV_here.Get_Column("time");
begin
Put_Line ("t=" & t'Img);
end;
end if;
end;
procedure close is
begin
CSV_here.Close;
end close;
end simulation;
| 20.108696 | 53 | 0.556757 |
4a5756b82a0bb0178f590738e7e1fb4ad499e57c | 575 | adb | Ada | languages/ada/echo.adb | sergev/vak-opensource | e1912b83dabdbfab2baee5e7a9a40c3077349381 | [
"Apache-2.0"
] | 34 | 2016-10-29T19:50:34.000Z | 2022-02-12T21:27:43.000Z | languages/ada/echo.adb | sergev/vak-opensource | e1912b83dabdbfab2baee5e7a9a40c3077349381 | [
"Apache-2.0"
] | null | null | null | languages/ada/echo.adb | sergev/vak-opensource | e1912b83dabdbfab2baee5e7a9a40c3077349381 | [
"Apache-2.0"
] | 19 | 2017-06-19T23:04:00.000Z | 2021-11-13T15:00:41.000Z | --
-- echo [string ...]
--
-- Write arguments to the standard output
--
-- The echo utility writes any specified operands, separated by single blank
-- (`` '') characters and followed by a newline (``\n'') character, to the
-- standard output.
--
with Ada.Command_Line;
with Ada.Text_IO;
use Ada;
procedure Echo is
begin
if Command_Line.Argument_Count > 0 then
Text_IO.Put (Command_Line.Argument (1));
for Arg in 2 .. Command_Line.Argument_Count loop
Text_IO.Put (' ');
Text_IO.Put (Command_Line.Argument (Arg));
end loop;
end if;
Text_IO.New_Line;
end Echo;
| 23 | 76 | 0.702609 |
1ce2efdbf79c53c69b2a827646834906c6ff6dd0 | 81,547 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/sem_ch9.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/sem_ch9.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/sem_ch9.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ C H 9 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2006, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Checks; use Checks;
with Einfo; use Einfo;
with Errout; use Errout;
with Exp_Ch9; use Exp_Ch9;
with Elists; use Elists;
with Freeze; use Freeze;
with Itypes; use Itypes;
with Lib.Xref; use Lib.Xref;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Restrict; use Restrict;
with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Ch3; use Sem_Ch3;
with Sem_Ch5; use Sem_Ch5;
with Sem_Ch6; use Sem_Ch6;
with Sem_Ch8; use Sem_Ch8;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
with Sem_Type; use Sem_Type;
with Sem_Util; use Sem_Util;
with Sem_Warn; use Sem_Warn;
with Snames; use Snames;
with Stand; use Stand;
with Sinfo; use Sinfo;
with Style;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
package body Sem_Ch9 is
-----------------------
-- Local Subprograms --
-----------------------
procedure Check_Max_Entries (D : Node_Id; R : All_Parameter_Restrictions);
-- Given either a protected definition or a task definition in D, check
-- the corresponding restriction parameter identifier R, and if it is set,
-- count the entries (checking the static requirement), and compare with
-- the given maximum.
procedure Check_Overriding_Indicator (Def : Node_Id);
-- Ada 2005 (AI-397): Check the overriding indicator of entries and
-- subprograms of protected or task types. Def is the definition of the
-- protected or task type.
function Find_Concurrent_Spec (Body_Id : Entity_Id) return Entity_Id;
-- Find entity in corresponding task or protected declaration. Use full
-- view if first declaration was for an incomplete type.
procedure Install_Declarations (Spec : Entity_Id);
-- Utility to make visible in corresponding body the entities defined in
-- task, protected type declaration, or entry declaration.
-----------------------------
-- Analyze_Abort_Statement --
-----------------------------
procedure Analyze_Abort_Statement (N : Node_Id) is
T_Name : Node_Id;
begin
Tasking_Used := True;
T_Name := First (Names (N));
while Present (T_Name) loop
Analyze (T_Name);
if Is_Task_Type (Etype (T_Name))
or else (Ada_Version >= Ada_05
and then Ekind (Etype (T_Name)) = E_Class_Wide_Type
and then Is_Interface (Etype (T_Name))
and then Is_Task_Interface (Etype (T_Name)))
then
Resolve (T_Name);
else
if Ada_Version >= Ada_05 then
Error_Msg_N ("expect task name or task interface class-wide "
& "object for ABORT", T_Name);
else
Error_Msg_N ("expect task name for ABORT", T_Name);
end if;
return;
end if;
Next (T_Name);
end loop;
Check_Restriction (No_Abort_Statements, N);
Check_Potentially_Blocking_Operation (N);
end Analyze_Abort_Statement;
--------------------------------
-- Analyze_Accept_Alternative --
--------------------------------
procedure Analyze_Accept_Alternative (N : Node_Id) is
begin
Tasking_Used := True;
if Present (Pragmas_Before (N)) then
Analyze_List (Pragmas_Before (N));
end if;
if Present (Condition (N)) then
Analyze_And_Resolve (Condition (N), Any_Boolean);
end if;
Analyze (Accept_Statement (N));
if Is_Non_Empty_List (Statements (N)) then
Analyze_Statements (Statements (N));
end if;
end Analyze_Accept_Alternative;
------------------------------
-- Analyze_Accept_Statement --
------------------------------
procedure Analyze_Accept_Statement (N : Node_Id) is
Nam : constant Entity_Id := Entry_Direct_Name (N);
Formals : constant List_Id := Parameter_Specifications (N);
Index : constant Node_Id := Entry_Index (N);
Stats : constant Node_Id := Handled_Statement_Sequence (N);
Accept_Id : Entity_Id;
Entry_Nam : Entity_Id;
E : Entity_Id;
Kind : Entity_Kind;
Task_Nam : Entity_Id;
-----------------------
-- Actual_Index_Type --
-----------------------
function Actual_Index_Type (E : Entity_Id) return Entity_Id;
-- If the bounds of an entry family depend on task discriminants, create
-- a new index type where a discriminant is replaced by the local
-- variable that renames it in the task body.
function Actual_Index_Type (E : Entity_Id) return Entity_Id is
Typ : constant Entity_Id := Entry_Index_Type (E);
Lo : constant Node_Id := Type_Low_Bound (Typ);
Hi : constant Node_Id := Type_High_Bound (Typ);
New_T : Entity_Id;
function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id;
-- If bound is discriminant reference, replace with corresponding
-- local variable of the same name.
-----------------------------
-- Actual_Discriminant_Ref --
-----------------------------
function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id is
Typ : constant Entity_Id := Etype (Bound);
Ref : Node_Id;
begin
if not Is_Entity_Name (Bound)
or else Ekind (Entity (Bound)) /= E_Discriminant
then
return Bound;
else
Ref := Make_Identifier (Sloc (N), Chars (Entity (Bound)));
Analyze (Ref);
Resolve (Ref, Typ);
return Ref;
end if;
end Actual_Discriminant_Ref;
-- Start of processing for Actual_Index_Type
begin
if not Has_Discriminants (Task_Nam)
or else (not Is_Entity_Name (Lo)
and then not Is_Entity_Name (Hi))
then
return Entry_Index_Type (E);
else
New_T := Create_Itype (Ekind (Typ), N);
Set_Etype (New_T, Base_Type (Typ));
Set_Size_Info (New_T, Typ);
Set_RM_Size (New_T, RM_Size (Typ));
Set_Scalar_Range (New_T,
Make_Range (Sloc (N),
Low_Bound => Actual_Discriminant_Ref (Lo),
High_Bound => Actual_Discriminant_Ref (Hi)));
return New_T;
end if;
end Actual_Index_Type;
-- Start of processing for Analyze_Accept_Statement
begin
Tasking_Used := True;
-- Entry name is initialized to Any_Id. It should get reset to the
-- matching entry entity. An error is signalled if it is not reset.
Entry_Nam := Any_Id;
for J in reverse 0 .. Scope_Stack.Last loop
Task_Nam := Scope_Stack.Table (J).Entity;
exit when Ekind (Etype (Task_Nam)) = E_Task_Type;
Kind := Ekind (Task_Nam);
if Kind /= E_Block and then Kind /= E_Loop
and then not Is_Entry (Task_Nam)
then
Error_Msg_N ("enclosing body of accept must be a task", N);
return;
end if;
end loop;
if Ekind (Etype (Task_Nam)) /= E_Task_Type then
Error_Msg_N ("invalid context for accept statement", N);
return;
end if;
-- In order to process the parameters, we create a defining
-- identifier that can be used as the name of the scope. The
-- name of the accept statement itself is not a defining identifier,
-- and we cannot use its name directly because the task may have
-- any number of accept statements for the same entry.
if Present (Index) then
Accept_Id := New_Internal_Entity
(E_Entry_Family, Current_Scope, Sloc (N), 'E');
else
Accept_Id := New_Internal_Entity
(E_Entry, Current_Scope, Sloc (N), 'E');
end if;
Set_Etype (Accept_Id, Standard_Void_Type);
Set_Accept_Address (Accept_Id, New_Elmt_List);
if Present (Formals) then
New_Scope (Accept_Id);
Process_Formals (Formals, N);
Create_Extra_Formals (Accept_Id);
End_Scope;
end if;
-- We set the default expressions processed flag because we don't need
-- default expression functions. This is really more like body entity
-- than a spec entity anyway.
Set_Default_Expressions_Processed (Accept_Id);
E := First_Entity (Etype (Task_Nam));
while Present (E) loop
if Chars (E) = Chars (Nam)
and then (Ekind (E) = Ekind (Accept_Id))
and then Type_Conformant (Accept_Id, E)
then
Entry_Nam := E;
exit;
end if;
Next_Entity (E);
end loop;
if Entry_Nam = Any_Id then
Error_Msg_N ("no entry declaration matches accept statement", N);
return;
else
Set_Entity (Nam, Entry_Nam);
Generate_Reference (Entry_Nam, Nam, 'b', Set_Ref => False);
Style.Check_Identifier (Nam, Entry_Nam);
end if;
-- Verify that the entry is not hidden by a procedure declared in the
-- current block (pathological but possible).
if Current_Scope /= Task_Nam then
declare
E1 : Entity_Id;
begin
E1 := First_Entity (Current_Scope);
while Present (E1) loop
if Ekind (E1) = E_Procedure
and then Chars (E1) = Chars (Entry_Nam)
and then Type_Conformant (E1, Entry_Nam)
then
Error_Msg_N ("entry name is not visible", N);
end if;
Next_Entity (E1);
end loop;
end;
end if;
Set_Convention (Accept_Id, Convention (Entry_Nam));
Check_Fully_Conformant (Accept_Id, Entry_Nam, N);
for J in reverse 0 .. Scope_Stack.Last loop
exit when Task_Nam = Scope_Stack.Table (J).Entity;
if Entry_Nam = Scope_Stack.Table (J).Entity then
Error_Msg_N ("duplicate accept statement for same entry", N);
end if;
end loop;
declare
P : Node_Id := N;
begin
loop
P := Parent (P);
case Nkind (P) is
when N_Task_Body | N_Compilation_Unit =>
exit;
when N_Asynchronous_Select =>
Error_Msg_N ("accept statements are not allowed within" &
" an asynchronous select inner" &
" to the enclosing task body", N);
exit;
when others =>
null;
end case;
end loop;
end;
if Ekind (E) = E_Entry_Family then
if No (Index) then
Error_Msg_N ("missing entry index in accept for entry family", N);
else
Analyze_And_Resolve (Index, Entry_Index_Type (E));
Apply_Range_Check (Index, Actual_Index_Type (E));
end if;
elsif Present (Index) then
Error_Msg_N ("invalid entry index in accept for simple entry", N);
end if;
-- If label declarations present, analyze them. They are declared in the
-- enclosing task, but their enclosing scope is the entry itself, so
-- that goto's to the label are recognized as local to the accept.
if Present (Declarations (N)) then
declare
Decl : Node_Id;
Id : Entity_Id;
begin
Decl := First (Declarations (N));
while Present (Decl) loop
Analyze (Decl);
pragma Assert
(Nkind (Decl) = N_Implicit_Label_Declaration);
Id := Defining_Identifier (Decl);
Set_Enclosing_Scope (Id, Entry_Nam);
Next (Decl);
end loop;
end;
end if;
-- If statements are present, they must be analyzed in the context of
-- the entry, so that references to formals are correctly resolved. We
-- also have to add the declarations that are required by the expansion
-- of the accept statement in this case if expansion active.
-- In the case of a select alternative of a selective accept, the
-- expander references the address declaration even if there is no
-- statement list.
-- We also need to create the renaming declarations for the local
-- variables that will replace references to the formals within the
-- accept statement.
Exp_Ch9.Expand_Accept_Declarations (N, Entry_Nam);
-- Set Never_Set_In_Source and clear Is_True_Constant/Current_Value
-- fields on all entry formals (this loop ignores all other entities).
-- Reset Set_Referenced and Has_Pragma_Unreferenced as well, so that we
-- can post accurate warnings on each accept statement for the same
-- entry.
E := First_Entity (Entry_Nam);
while Present (E) loop
if Is_Formal (E) then
Set_Never_Set_In_Source (E, True);
Set_Is_True_Constant (E, False);
Set_Current_Value (E, Empty);
Set_Referenced (E, False);
Set_Has_Pragma_Unreferenced (E, False);
end if;
Next_Entity (E);
end loop;
-- Analyze statements if present
if Present (Stats) then
New_Scope (Entry_Nam);
Install_Declarations (Entry_Nam);
Set_Actual_Subtypes (N, Current_Scope);
Analyze (Stats);
Process_End_Label (Handled_Statement_Sequence (N), 't', Entry_Nam);
End_Scope;
end if;
-- Some warning checks
Check_Potentially_Blocking_Operation (N);
Check_References (Entry_Nam, N);
Set_Entry_Accepted (Entry_Nam);
end Analyze_Accept_Statement;
---------------------------------
-- Analyze_Asynchronous_Select --
---------------------------------
procedure Analyze_Asynchronous_Select (N : Node_Id) is
Param : Node_Id;
Trigger : Node_Id;
begin
Tasking_Used := True;
Check_Restriction (Max_Asynchronous_Select_Nesting, N);
Check_Restriction (No_Select_Statements, N);
if Ada_Version >= Ada_05 then
Trigger := Triggering_Statement (Triggering_Alternative (N));
Analyze (Trigger);
-- The trigger is a dispatching procedure. Postpone the analysis of
-- the triggering and abortable statements until the expansion of
-- this asynchronous select in Expand_N_Asynchronous_Select. This
-- action is required since otherwise we would get a gigi abort from
-- the code replication in Expand_N_Asynchronous_Select of an already
-- analyzed statement list.
if Expander_Active
and then Nkind (Trigger) = N_Procedure_Call_Statement
and then Present (Parameter_Associations (Trigger))
then
Param := First (Parameter_Associations (Trigger));
if Is_Controlling_Actual (Param)
and then Is_Interface (Etype (Param))
then
if Is_Limited_Record (Etype (Param)) then
return;
else
Error_Msg_N
("dispatching operation of limited or synchronized " &
"interface required ('R'M 9.7.2(3))!", N);
end if;
end if;
end if;
end if;
-- Analyze the statements. We analyze statements in the abortable part,
-- because this is the section that is executed first, and that way our
-- remembering of saved values and checks is accurate.
Analyze_Statements (Statements (Abortable_Part (N)));
Analyze (Triggering_Alternative (N));
end Analyze_Asynchronous_Select;
------------------------------------
-- Analyze_Conditional_Entry_Call --
------------------------------------
procedure Analyze_Conditional_Entry_Call (N : Node_Id) is
begin
Check_Restriction (No_Select_Statements, N);
Tasking_Used := True;
Analyze (Entry_Call_Alternative (N));
if List_Length (Else_Statements (N)) = 1
and then Nkind (First (Else_Statements (N))) in N_Delay_Statement
then
Error_Msg_N
("suspicious form of conditional entry call?", N);
Error_Msg_N
("\`SELECT OR` may be intended rather than `SELECT ELSE`", N);
end if;
Analyze_Statements (Else_Statements (N));
end Analyze_Conditional_Entry_Call;
--------------------------------
-- Analyze_Delay_Alternative --
--------------------------------
procedure Analyze_Delay_Alternative (N : Node_Id) is
Expr : Node_Id;
Typ : Entity_Id;
begin
Tasking_Used := True;
Check_Restriction (No_Delay, N);
if Present (Pragmas_Before (N)) then
Analyze_List (Pragmas_Before (N));
end if;
if Nkind (Parent (N)) = N_Selective_Accept
or else Nkind (Parent (N)) = N_Timed_Entry_Call
then
Expr := Expression (Delay_Statement (N));
-- Defer full analysis until the statement is expanded, to insure
-- that generated code does not move past the guard. The delay
-- expression is only evaluated if the guard is open.
if Nkind (Delay_Statement (N)) = N_Delay_Relative_Statement then
Pre_Analyze_And_Resolve (Expr, Standard_Duration);
else
Pre_Analyze_And_Resolve (Expr);
end if;
Typ := First_Subtype (Etype (Expr));
if Nkind (Delay_Statement (N)) = N_Delay_Until_Statement
and then not Is_RTE (Typ, RO_CA_Time)
and then not Is_RTE (Typ, RO_RT_Time)
then
Error_Msg_N ("expect Time types for `DELAY UNTIL`", Expr);
end if;
Check_Restriction (No_Fixed_Point, Expr);
else
Analyze (Delay_Statement (N));
end if;
if Present (Condition (N)) then
Analyze_And_Resolve (Condition (N), Any_Boolean);
end if;
if Is_Non_Empty_List (Statements (N)) then
Analyze_Statements (Statements (N));
end if;
end Analyze_Delay_Alternative;
----------------------------
-- Analyze_Delay_Relative --
----------------------------
procedure Analyze_Delay_Relative (N : Node_Id) is
E : constant Node_Id := Expression (N);
begin
Check_Restriction (No_Relative_Delay, N);
Tasking_Used := True;
Check_Restriction (No_Delay, N);
Check_Potentially_Blocking_Operation (N);
Analyze_And_Resolve (E, Standard_Duration);
Check_Restriction (No_Fixed_Point, E);
end Analyze_Delay_Relative;
-------------------------
-- Analyze_Delay_Until --
-------------------------
procedure Analyze_Delay_Until (N : Node_Id) is
E : constant Node_Id := Expression (N);
Typ : Entity_Id;
begin
Tasking_Used := True;
Check_Restriction (No_Delay, N);
Check_Potentially_Blocking_Operation (N);
Analyze (E);
Typ := First_Subtype (Etype (E));
if not Is_RTE (Typ, RO_CA_Time) and then
not Is_RTE (Typ, RO_RT_Time)
then
Error_Msg_N ("expect Time types for `DELAY UNTIL`", E);
end if;
end Analyze_Delay_Until;
------------------------
-- Analyze_Entry_Body --
------------------------
procedure Analyze_Entry_Body (N : Node_Id) is
Id : constant Entity_Id := Defining_Identifier (N);
Decls : constant List_Id := Declarations (N);
Stats : constant Node_Id := Handled_Statement_Sequence (N);
Formals : constant Node_Id := Entry_Body_Formal_Part (N);
P_Type : constant Entity_Id := Current_Scope;
Entry_Name : Entity_Id;
E : Entity_Id;
begin
Tasking_Used := True;
-- Entry_Name is initialized to Any_Id. It should get reset to the
-- matching entry entity. An error is signalled if it is not reset
Entry_Name := Any_Id;
Analyze (Formals);
if Present (Entry_Index_Specification (Formals)) then
Set_Ekind (Id, E_Entry_Family);
else
Set_Ekind (Id, E_Entry);
end if;
Set_Scope (Id, Current_Scope);
Set_Etype (Id, Standard_Void_Type);
Set_Accept_Address (Id, New_Elmt_List);
E := First_Entity (P_Type);
while Present (E) loop
if Chars (E) = Chars (Id)
and then (Ekind (E) = Ekind (Id))
and then Type_Conformant (Id, E)
then
Entry_Name := E;
Set_Convention (Id, Convention (E));
Set_Corresponding_Body (Parent (Entry_Name), Id);
Check_Fully_Conformant (Id, E, N);
if Ekind (Id) = E_Entry_Family then
if not Fully_Conformant_Discrete_Subtypes (
Discrete_Subtype_Definition (Parent (E)),
Discrete_Subtype_Definition
(Entry_Index_Specification (Formals)))
then
Error_Msg_N
("index not fully conformant with previous declaration",
Discrete_Subtype_Definition
(Entry_Index_Specification (Formals)));
else
-- The elaboration of the entry body does not recompute the
-- bounds of the index, which may have side effects. Inherit
-- the bounds from the entry declaration. This is critical
-- if the entry has a per-object constraint. If a bound is
-- given by a discriminant, it must be reanalyzed in order
-- to capture the discriminal of the current entry, rather
-- than that of the protected type.
declare
Index_Spec : constant Node_Id :=
Entry_Index_Specification (Formals);
Def : constant Node_Id :=
New_Copy_Tree
(Discrete_Subtype_Definition (Parent (E)));
begin
if Nkind
(Original_Node
(Discrete_Subtype_Definition (Index_Spec))) = N_Range
then
Set_Etype (Def, Empty);
Set_Analyzed (Def, False);
-- Keep the original subtree to ensure a properly
-- formed tree (e.g. for ASIS use).
Rewrite
(Discrete_Subtype_Definition (Index_Spec), Def);
Set_Analyzed (Low_Bound (Def), False);
Set_Analyzed (High_Bound (Def), False);
if Denotes_Discriminant (Low_Bound (Def)) then
Set_Entity (Low_Bound (Def), Empty);
end if;
if Denotes_Discriminant (High_Bound (Def)) then
Set_Entity (High_Bound (Def), Empty);
end if;
Analyze (Def);
Make_Index (Def, Index_Spec);
Set_Etype
(Defining_Identifier (Index_Spec), Etype (Def));
end if;
end;
end if;
end if;
exit;
end if;
Next_Entity (E);
end loop;
if Entry_Name = Any_Id then
Error_Msg_N ("no entry declaration matches entry body", N);
return;
elsif Has_Completion (Entry_Name) then
Error_Msg_N ("duplicate entry body", N);
return;
else
Set_Has_Completion (Entry_Name);
Generate_Reference (Entry_Name, Id, 'b', Set_Ref => False);
Style.Check_Identifier (Id, Entry_Name);
end if;
Exp_Ch9.Expand_Entry_Barrier (N, Entry_Name);
New_Scope (Entry_Name);
Exp_Ch9.Expand_Entry_Body_Declarations (N);
Install_Declarations (Entry_Name);
Set_Actual_Subtypes (N, Current_Scope);
-- The entity for the protected subprogram corresponding to the entry
-- has been created. We retain the name of this entity in the entry
-- body, for use when the corresponding subprogram body is created.
-- Note that entry bodies have no corresponding_spec, and there is no
-- easy link back in the tree between the entry body and the entity for
-- the entry itself, which is why we must propagate some attributes
-- explicitly from spec to body.
Set_Protected_Body_Subprogram
(Id, Protected_Body_Subprogram (Entry_Name));
Set_Entry_Parameters_Type
(Id, Entry_Parameters_Type (Entry_Name));
if Present (Decls) then
Analyze_Declarations (Decls);
end if;
if Present (Stats) then
Analyze (Stats);
end if;
-- Check for unreferenced variables etc. Before the Check_References
-- call, we transfer Never_Set_In_Source and Referenced flags from
-- parameters in the spec to the corresponding entities in the body,
-- since we want the warnings on the body entities. Note that we do
-- not have to transfer Referenced_As_LHS, since that flag can only
-- be set for simple variables.
-- At the same time, we set the flags on the spec entities to suppress
-- any warnings on the spec formals, since we also scan the spec.
-- Finally, we propagate the Entry_Component attribute to the body
-- formals, for use in the renaming declarations created later for the
-- formals (see exp_ch9.Add_Formal_Renamings).
declare
E1 : Entity_Id;
E2 : Entity_Id;
begin
E1 := First_Entity (Entry_Name);
while Present (E1) loop
E2 := First_Entity (Id);
while Present (E2) loop
exit when Chars (E1) = Chars (E2);
Next_Entity (E2);
end loop;
-- If no matching body entity, then we already had a detected
-- error of some kind, so just forget about worrying about these
-- warnings.
if No (E2) then
goto Continue;
end if;
if Ekind (E1) = E_Out_Parameter then
Set_Never_Set_In_Source (E2, Never_Set_In_Source (E1));
Set_Never_Set_In_Source (E1, False);
end if;
Set_Referenced (E2, Referenced (E1));
Set_Referenced (E1);
Set_Entry_Component (E2, Entry_Component (E1));
<<Continue>>
Next_Entity (E1);
end loop;
Check_References (Id);
end;
-- We still need to check references for the spec, since objects
-- declared in the body are chained (in the First_Entity sense) to
-- the spec rather than the body in the case of entries.
Check_References (Entry_Name);
-- Process the end label, and terminate the scope
Process_End_Label (Handled_Statement_Sequence (N), 't', Entry_Name);
End_Scope;
-- If this is an entry family, remove the loop created to provide
-- a scope for the entry index.
if Ekind (Id) = E_Entry_Family
and then Present (Entry_Index_Specification (Formals))
then
End_Scope;
end if;
end Analyze_Entry_Body;
------------------------------------
-- Analyze_Entry_Body_Formal_Part --
------------------------------------
procedure Analyze_Entry_Body_Formal_Part (N : Node_Id) is
Id : constant Entity_Id := Defining_Identifier (Parent (N));
Index : constant Node_Id := Entry_Index_Specification (N);
Formals : constant List_Id := Parameter_Specifications (N);
begin
Tasking_Used := True;
if Present (Index) then
Analyze (Index);
end if;
if Present (Formals) then
Set_Scope (Id, Current_Scope);
New_Scope (Id);
Process_Formals (Formals, Parent (N));
End_Scope;
end if;
end Analyze_Entry_Body_Formal_Part;
------------------------------------
-- Analyze_Entry_Call_Alternative --
------------------------------------
procedure Analyze_Entry_Call_Alternative (N : Node_Id) is
Call : constant Node_Id := Entry_Call_Statement (N);
begin
Tasking_Used := True;
if Present (Pragmas_Before (N)) then
Analyze_List (Pragmas_Before (N));
end if;
if Nkind (Call) = N_Attribute_Reference then
-- Possibly a stream attribute, but definitely illegal. Other
-- illegalitles, such as procedure calls, are diagnosed after
-- resolution.
Error_Msg_N ("entry call alternative requires an entry call", Call);
return;
end if;
Analyze (Call);
if Is_Non_Empty_List (Statements (N)) then
Analyze_Statements (Statements (N));
end if;
end Analyze_Entry_Call_Alternative;
-------------------------------
-- Analyze_Entry_Declaration --
-------------------------------
procedure Analyze_Entry_Declaration (N : Node_Id) is
Formals : constant List_Id := Parameter_Specifications (N);
Id : constant Entity_Id := Defining_Identifier (N);
D_Sdef : constant Node_Id := Discrete_Subtype_Definition (N);
begin
Generate_Definition (Id);
Tasking_Used := True;
if No (D_Sdef) then
Set_Ekind (Id, E_Entry);
else
Enter_Name (Id);
Set_Ekind (Id, E_Entry_Family);
Analyze (D_Sdef);
Make_Index (D_Sdef, N, Id);
end if;
Set_Etype (Id, Standard_Void_Type);
Set_Convention (Id, Convention_Entry);
Set_Accept_Address (Id, New_Elmt_List);
if Present (Formals) then
Set_Scope (Id, Current_Scope);
New_Scope (Id);
Process_Formals (Formals, N);
Create_Extra_Formals (Id);
End_Scope;
end if;
if Ekind (Id) = E_Entry then
New_Overloaded_Entity (Id);
end if;
end Analyze_Entry_Declaration;
---------------------------------------
-- Analyze_Entry_Index_Specification --
---------------------------------------
-- The Defining_Identifier of the entry index specification is local to the
-- entry body, but it must be available in the entry barrier which is
-- evaluated outside of the entry body. The index is eventually renamed as
-- a run-time object, so is visibility is strictly a front-end concern. In
-- order to make it available to the barrier, we create an additional
-- scope, as for a loop, whose only declaration is the index name. This
-- loop is not attached to the tree and does not appear as an entity local
-- to the protected type, so its existence need only be knwown to routines
-- that process entry families.
procedure Analyze_Entry_Index_Specification (N : Node_Id) is
Iden : constant Node_Id := Defining_Identifier (N);
Def : constant Node_Id := Discrete_Subtype_Definition (N);
Loop_Id : constant Entity_Id :=
Make_Defining_Identifier (Sloc (N),
Chars => New_Internal_Name ('L'));
begin
Tasking_Used := True;
Analyze (Def);
-- There is no elaboration of the entry index specification. Therefore,
-- if the index is a range, it is not resolved and expanded, but the
-- bounds are inherited from the entry declaration, and reanalyzed.
-- See Analyze_Entry_Body.
if Nkind (Def) /= N_Range then
Make_Index (Def, N);
end if;
Set_Ekind (Loop_Id, E_Loop);
Set_Scope (Loop_Id, Current_Scope);
New_Scope (Loop_Id);
Enter_Name (Iden);
Set_Ekind (Iden, E_Entry_Index_Parameter);
Set_Etype (Iden, Etype (Def));
end Analyze_Entry_Index_Specification;
----------------------------
-- Analyze_Protected_Body --
----------------------------
procedure Analyze_Protected_Body (N : Node_Id) is
Body_Id : constant Entity_Id := Defining_Identifier (N);
Last_E : Entity_Id;
Spec_Id : Entity_Id;
-- This is initially the entity of the protected object or protected
-- type involved, but is replaced by the protected type always in the
-- case of a single protected declaration, since this is the proper
-- scope to be used.
Ref_Id : Entity_Id;
-- This is the entity of the protected object or protected type
-- involved, and is the entity used for cross-reference purposes
-- (it differs from Spec_Id in the case of a single protected
-- object, since Spec_Id is set to the protected type in this case).
begin
Tasking_Used := True;
Set_Ekind (Body_Id, E_Protected_Body);
Spec_Id := Find_Concurrent_Spec (Body_Id);
if Present (Spec_Id)
and then Ekind (Spec_Id) = E_Protected_Type
then
null;
elsif Present (Spec_Id)
and then Ekind (Etype (Spec_Id)) = E_Protected_Type
and then not Comes_From_Source (Etype (Spec_Id))
then
null;
else
Error_Msg_N ("missing specification for protected body", Body_Id);
return;
end if;
Ref_Id := Spec_Id;
Generate_Reference (Ref_Id, Body_Id, 'b', Set_Ref => False);
Style.Check_Identifier (Body_Id, Spec_Id);
-- The declarations are always attached to the type
if Ekind (Spec_Id) /= E_Protected_Type then
Spec_Id := Etype (Spec_Id);
end if;
New_Scope (Spec_Id);
Set_Corresponding_Spec (N, Spec_Id);
Set_Corresponding_Body (Parent (Spec_Id), Body_Id);
Set_Has_Completion (Spec_Id);
Install_Declarations (Spec_Id);
Exp_Ch9.Expand_Protected_Body_Declarations (N, Spec_Id);
Last_E := Last_Entity (Spec_Id);
Analyze_Declarations (Declarations (N));
-- For visibility purposes, all entities in the body are private. Set
-- First_Private_Entity accordingly, if there was no private part in the
-- protected declaration.
if No (First_Private_Entity (Spec_Id)) then
if Present (Last_E) then
Set_First_Private_Entity (Spec_Id, Next_Entity (Last_E));
else
Set_First_Private_Entity (Spec_Id, First_Entity (Spec_Id));
end if;
end if;
Check_Completion (Body_Id);
Check_References (Spec_Id);
Process_End_Label (N, 't', Ref_Id);
End_Scope;
end Analyze_Protected_Body;
----------------------------------
-- Analyze_Protected_Definition --
----------------------------------
procedure Analyze_Protected_Definition (N : Node_Id) is
E : Entity_Id;
L : Entity_Id;
begin
Tasking_Used := True;
Analyze_Declarations (Visible_Declarations (N));
if Present (Private_Declarations (N))
and then not Is_Empty_List (Private_Declarations (N))
then
L := Last_Entity (Current_Scope);
Analyze_Declarations (Private_Declarations (N));
if Present (L) then
Set_First_Private_Entity (Current_Scope, Next_Entity (L));
else
Set_First_Private_Entity (Current_Scope,
First_Entity (Current_Scope));
end if;
end if;
E := First_Entity (Current_Scope);
while Present (E) loop
if Ekind (E) = E_Function
or else Ekind (E) = E_Procedure
then
Set_Convention (E, Convention_Protected);
elsif Is_Task_Type (Etype (E))
or else Has_Task (Etype (E))
then
Set_Has_Task (Current_Scope);
end if;
Next_Entity (E);
end loop;
Check_Max_Entries (N, Max_Protected_Entries);
Process_End_Label (N, 'e', Current_Scope);
Check_Overriding_Indicator (N);
end Analyze_Protected_Definition;
----------------------------
-- Analyze_Protected_Type --
----------------------------
procedure Analyze_Protected_Type (N : Node_Id) is
E : Entity_Id;
T : Entity_Id;
Def_Id : constant Entity_Id := Defining_Identifier (N);
Iface : Node_Id;
Iface_Def : Node_Id;
Iface_Typ : Entity_Id;
begin
if No_Run_Time_Mode then
Error_Msg_CRT ("protected type", N);
return;
end if;
Tasking_Used := True;
Check_Restriction (No_Protected_Types, N);
T := Find_Type_Name (N);
if Ekind (T) = E_Incomplete_Type then
T := Full_View (T);
Set_Completion_Referenced (T);
end if;
Set_Ekind (T, E_Protected_Type);
Set_Is_First_Subtype (T, True);
Init_Size_Align (T);
Set_Etype (T, T);
Set_Has_Delayed_Freeze (T, True);
Set_Stored_Constraint (T, No_Elist);
New_Scope (T);
-- Ada 2005 (AI-345)
if Present (Interface_List (N)) then
Set_Is_Tagged_Type (T);
Iface := First (Interface_List (N));
while Present (Iface) loop
Iface_Typ := Find_Type_Of_Subtype_Indic (Iface);
Iface_Def := Type_Definition (Parent (Iface_Typ));
if not Is_Interface (Iface_Typ) then
Error_Msg_NE ("(Ada 2005) & must be an interface",
Iface, Iface_Typ);
else
-- Ada 2005 (AI-251): "The declaration of a specific descendant
-- of an interface type freezes the interface type" RM 13.14.
Freeze_Before (N, Etype (Iface));
-- Ada 2005 (AI-345): Protected types can only implement
-- limited, synchronized or protected interfaces.
if Limited_Present (Iface_Def)
or else Synchronized_Present (Iface_Def)
or else Protected_Present (Iface_Def)
then
null;
elsif Task_Present (Iface_Def) then
Error_Msg_N ("(Ada 2005) protected type cannot implement a "
& "task interface", Iface);
else
Error_Msg_N ("(Ada 2005) protected type cannot implement a "
& "non-limited interface", Iface);
end if;
end if;
Next (Iface);
end loop;
-- If this is the full-declaration associated with a private
-- declaration that implement interfaces, then the private type
-- declaration must be limited.
if Has_Private_Declaration (T) then
declare
E : Entity_Id;
begin
E := First_Entity (Scope (T));
loop
pragma Assert (Present (E));
if Is_Type (E) and then Present (Full_View (E)) then
exit when Full_View (E) = T;
end if;
Next_Entity (E);
end loop;
if not Is_Limited_Record (E) then
Error_Msg_Sloc := Sloc (E);
Error_Msg_N
("(Ada 2005) private type declaration # must be limited",
T);
end if;
end;
end if;
end if;
if Present (Discriminant_Specifications (N)) then
if Has_Discriminants (T) then
-- Install discriminants. Also, verify conformance of
-- discriminants of previous and current view. ???
Install_Declarations (T);
else
Process_Discriminants (N);
end if;
end if;
Set_Is_Constrained (T, not Has_Discriminants (T));
Analyze (Protected_Definition (N));
-- Protected types with entries are controlled (because of the
-- Protection component if nothing else), same for any protected type
-- with interrupt handlers. Note that we need to analyze the protected
-- definition to set Has_Entries and such.
if (Abort_Allowed or else Restriction_Active (No_Entry_Queue) = False
or else Number_Entries (T) > 1)
and then
(Has_Entries (T)
or else Has_Interrupt_Handler (T)
or else Has_Attach_Handler (T))
then
Set_Has_Controlled_Component (T, True);
end if;
-- The Ekind of components is E_Void during analysis to detect illegal
-- uses. Now it can be set correctly.
E := First_Entity (Current_Scope);
while Present (E) loop
if Ekind (E) = E_Void then
Set_Ekind (E, E_Component);
Init_Component_Location (E);
end if;
Next_Entity (E);
end loop;
End_Scope;
if T /= Def_Id
and then Is_Private_Type (Def_Id)
and then Has_Discriminants (Def_Id)
and then Expander_Active
then
Exp_Ch9.Expand_N_Protected_Type_Declaration (N);
Process_Full_View (N, T, Def_Id);
end if;
end Analyze_Protected_Type;
---------------------
-- Analyze_Requeue --
---------------------
procedure Analyze_Requeue (N : Node_Id) is
Count : Natural := 0;
Entry_Name : Node_Id := Name (N);
Entry_Id : Entity_Id;
I : Interp_Index;
It : Interp;
Enclosing : Entity_Id;
Target_Obj : Node_Id := Empty;
Req_Scope : Entity_Id;
Outer_Ent : Entity_Id;
begin
Check_Restriction (No_Requeue_Statements, N);
Check_Unreachable_Code (N);
Tasking_Used := True;
Enclosing := Empty;
for J in reverse 0 .. Scope_Stack.Last loop
Enclosing := Scope_Stack.Table (J).Entity;
exit when Is_Entry (Enclosing);
if Ekind (Enclosing) /= E_Block
and then Ekind (Enclosing) /= E_Loop
then
Error_Msg_N ("requeue must appear within accept or entry body", N);
return;
end if;
end loop;
Analyze (Entry_Name);
if Etype (Entry_Name) = Any_Type then
return;
end if;
if Nkind (Entry_Name) = N_Selected_Component then
Target_Obj := Prefix (Entry_Name);
Entry_Name := Selector_Name (Entry_Name);
end if;
-- If an explicit target object is given then we have to check the
-- restrictions of 9.5.4(6).
if Present (Target_Obj) then
-- Locate containing concurrent unit and determine enclosing entry
-- body or outermost enclosing accept statement within the unit.
Outer_Ent := Empty;
for S in reverse 0 .. Scope_Stack.Last loop
Req_Scope := Scope_Stack.Table (S).Entity;
exit when Ekind (Req_Scope) in Task_Kind
or else Ekind (Req_Scope) in Protected_Kind;
if Is_Entry (Req_Scope) then
Outer_Ent := Req_Scope;
end if;
end loop;
pragma Assert (Present (Outer_Ent));
-- Check that the accessibility level of the target object is not
-- greater or equal to the outermost enclosing accept statement (or
-- entry body) unless it is a parameter of the innermost enclosing
-- accept statement (or entry body).
if Object_Access_Level (Target_Obj) >= Scope_Depth (Outer_Ent)
and then
(not Is_Entity_Name (Target_Obj)
or else Ekind (Entity (Target_Obj)) not in Formal_Kind
or else Enclosing /= Scope (Entity (Target_Obj)))
then
Error_Msg_N
("target object has invalid level for requeue", Target_Obj);
end if;
end if;
-- Overloaded case, find right interpretation
if Is_Overloaded (Entry_Name) then
Entry_Id := Empty;
Get_First_Interp (Entry_Name, I, It);
while Present (It.Nam) loop
if No (First_Formal (It.Nam))
or else Subtype_Conformant (Enclosing, It.Nam)
then
-- Ada 2005 (AI-345): Since protected and task types have
-- primitive entry wrappers, we only consider source entries.
if Comes_From_Source (It.Nam) then
Count := Count + 1;
Entry_Id := It.Nam;
else
Remove_Interp (I);
end if;
end if;
Get_Next_Interp (I, It);
end loop;
if Count = 0 then
Error_Msg_N ("no entry matches context", N);
return;
elsif Count > 1 then
Error_Msg_N ("ambiguous entry name in requeue", N);
return;
else
Set_Is_Overloaded (Entry_Name, False);
Set_Entity (Entry_Name, Entry_Id);
end if;
-- Non-overloaded cases
-- For the case of a reference to an element of an entry family, the
-- Entry_Name is an indexed component.
elsif Nkind (Entry_Name) = N_Indexed_Component then
-- Requeue to an entry out of the body
if Nkind (Prefix (Entry_Name)) = N_Selected_Component then
Entry_Id := Entity (Selector_Name (Prefix (Entry_Name)));
-- Requeue from within the body itself
elsif Nkind (Prefix (Entry_Name)) = N_Identifier then
Entry_Id := Entity (Prefix (Entry_Name));
else
Error_Msg_N ("invalid entry_name specified", N);
return;
end if;
-- If we had a requeue of the form REQUEUE A (B), then the parser
-- accepted it (because it could have been a requeue on an entry index.
-- If A turns out not to be an entry family, then the analysis of A (B)
-- turned it into a function call.
elsif Nkind (Entry_Name) = N_Function_Call then
Error_Msg_N
("arguments not allowed in requeue statement",
First (Parameter_Associations (Entry_Name)));
return;
-- Normal case of no entry family, no argument
else
Entry_Id := Entity (Entry_Name);
end if;
-- Resolve entry, and check that it is subtype conformant with the
-- enclosing construct if this construct has formals (RM 9.5.4(5)).
if not Is_Entry (Entry_Id) then
Error_Msg_N ("expect entry name in requeue statement", Name (N));
elsif Ekind (Entry_Id) = E_Entry_Family
and then Nkind (Entry_Name) /= N_Indexed_Component
then
Error_Msg_N ("missing index for entry family component", Name (N));
else
Resolve_Entry (Name (N));
Generate_Reference (Entry_Id, Entry_Name);
if Present (First_Formal (Entry_Id)) then
Check_Subtype_Conformant (Enclosing, Entry_Id, Name (N));
-- Processing for parameters accessed by the requeue
declare
Ent : Entity_Id;
begin
Ent := First_Formal (Enclosing);
while Present (Ent) loop
-- For OUT or IN OUT parameter, the effect of the requeue is
-- to assign the parameter a value on exit from the requeued
-- body, so we can set it as source assigned. We also clear
-- the Is_True_Constant indication. We do not need to clear
-- Current_Value, since the effect of the requeue is to
-- perform an unconditional goto so that any further
-- references will not occur anyway.
if Ekind (Ent) = E_Out_Parameter
or else
Ekind (Ent) = E_In_Out_Parameter
then
Set_Never_Set_In_Source (Ent, False);
Set_Is_True_Constant (Ent, False);
end if;
-- For all parameters, the requeue acts as a reference,
-- since the value of the parameter is passed to the new
-- entry, so we want to suppress unreferenced warnings.
Set_Referenced (Ent);
Next_Formal (Ent);
end loop;
end;
end if;
end if;
end Analyze_Requeue;
------------------------------
-- Analyze_Selective_Accept --
------------------------------
procedure Analyze_Selective_Accept (N : Node_Id) is
Alts : constant List_Id := Select_Alternatives (N);
Alt : Node_Id;
Accept_Present : Boolean := False;
Terminate_Present : Boolean := False;
Delay_Present : Boolean := False;
Relative_Present : Boolean := False;
Alt_Count : Uint := Uint_0;
begin
Check_Restriction (No_Select_Statements, N);
Tasking_Used := True;
-- Loop to analyze alternatives
Alt := First (Alts);
while Present (Alt) loop
Alt_Count := Alt_Count + 1;
Analyze (Alt);
if Nkind (Alt) = N_Delay_Alternative then
if Delay_Present then
if Relative_Present /=
(Nkind (Delay_Statement (Alt)) = N_Delay_Relative_Statement)
then
Error_Msg_N
("delay_until and delay_relative alternatives ", Alt);
Error_Msg_N
("\cannot appear in the same selective_wait", Alt);
end if;
else
Delay_Present := True;
Relative_Present :=
Nkind (Delay_Statement (Alt)) = N_Delay_Relative_Statement;
end if;
elsif Nkind (Alt) = N_Terminate_Alternative then
if Terminate_Present then
Error_Msg_N ("only one terminate alternative allowed", N);
else
Terminate_Present := True;
Check_Restriction (No_Terminate_Alternatives, N);
end if;
elsif Nkind (Alt) = N_Accept_Alternative then
Accept_Present := True;
-- Check for duplicate accept
declare
Alt1 : Node_Id;
Stm : constant Node_Id := Accept_Statement (Alt);
EDN : constant Node_Id := Entry_Direct_Name (Stm);
Ent : Entity_Id;
begin
if Nkind (EDN) = N_Identifier
and then No (Condition (Alt))
and then Present (Entity (EDN)) -- defend against junk
and then Ekind (Entity (EDN)) = E_Entry
then
Ent := Entity (EDN);
Alt1 := First (Alts);
while Alt1 /= Alt loop
if Nkind (Alt1) = N_Accept_Alternative
and then No (Condition (Alt1))
then
declare
Stm1 : constant Node_Id := Accept_Statement (Alt1);
EDN1 : constant Node_Id := Entry_Direct_Name (Stm1);
begin
if Nkind (EDN1) = N_Identifier then
if Entity (EDN1) = Ent then
Error_Msg_Sloc := Sloc (Stm1);
Error_Msg_N
("?accept duplicates one on line#", Stm);
exit;
end if;
end if;
end;
end if;
Next (Alt1);
end loop;
end if;
end;
end if;
Next (Alt);
end loop;
Check_Restriction (Max_Select_Alternatives, N, Alt_Count);
Check_Potentially_Blocking_Operation (N);
if Terminate_Present and Delay_Present then
Error_Msg_N ("at most one of terminate or delay alternative", N);
elsif not Accept_Present then
Error_Msg_N
("select must contain at least one accept alternative", N);
end if;
if Present (Else_Statements (N)) then
if Terminate_Present or Delay_Present then
Error_Msg_N ("else part not allowed with other alternatives", N);
end if;
Analyze_Statements (Else_Statements (N));
end if;
end Analyze_Selective_Accept;
------------------------------
-- Analyze_Single_Protected --
------------------------------
procedure Analyze_Single_Protected (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Id : constant Node_Id := Defining_Identifier (N);
T : Entity_Id;
T_Decl : Node_Id;
O_Decl : Node_Id;
O_Name : constant Entity_Id := New_Copy (Id);
begin
Generate_Definition (Id);
Tasking_Used := True;
-- The node is rewritten as a protected type declaration, in exact
-- analogy with what is done with single tasks.
T :=
Make_Defining_Identifier (Sloc (Id),
New_External_Name (Chars (Id), 'T'));
T_Decl :=
Make_Protected_Type_Declaration (Loc,
Defining_Identifier => T,
Protected_Definition => Relocate_Node (Protected_Definition (N)),
Interface_List => Interface_List (N));
O_Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => O_Name,
Object_Definition => Make_Identifier (Loc, Chars (T)));
Rewrite (N, T_Decl);
Insert_After (N, O_Decl);
Mark_Rewrite_Insertion (O_Decl);
-- Enter names of type and object before analysis, because the name of
-- the object may be used in its own body.
Enter_Name (T);
Set_Ekind (T, E_Protected_Type);
Set_Etype (T, T);
Enter_Name (O_Name);
Set_Ekind (O_Name, E_Variable);
Set_Etype (O_Name, T);
-- Instead of calling Analyze on the new node, call the proper analysis
-- procedure directly. Otherwise the node would be expanded twice, with
-- disastrous result.
Analyze_Protected_Type (N);
end Analyze_Single_Protected;
-------------------------
-- Analyze_Single_Task --
-------------------------
procedure Analyze_Single_Task (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Id : constant Node_Id := Defining_Identifier (N);
T : Entity_Id;
T_Decl : Node_Id;
O_Decl : Node_Id;
O_Name : constant Entity_Id := New_Copy (Id);
begin
Generate_Definition (Id);
Tasking_Used := True;
-- The node is rewritten as a task type declaration, followed by an
-- object declaration of that anonymous task type.
T :=
Make_Defining_Identifier (Sloc (Id),
New_External_Name (Chars (Id), Suffix => "TK"));
T_Decl :=
Make_Task_Type_Declaration (Loc,
Defining_Identifier => T,
Task_Definition => Relocate_Node (Task_Definition (N)),
Interface_List => Interface_List (N));
O_Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => O_Name,
Object_Definition => Make_Identifier (Loc, Chars (T)));
Rewrite (N, T_Decl);
Insert_After (N, O_Decl);
Mark_Rewrite_Insertion (O_Decl);
-- Enter names of type and object before analysis, because the name of
-- the object may be used in its own body.
Enter_Name (T);
Set_Ekind (T, E_Task_Type);
Set_Etype (T, T);
Enter_Name (O_Name);
Set_Ekind (O_Name, E_Variable);
Set_Etype (O_Name, T);
-- Instead of calling Analyze on the new node, call the proper analysis
-- procedure directly. Otherwise the node would be expanded twice, with
-- disastrous result.
Analyze_Task_Type (N);
end Analyze_Single_Task;
-----------------------
-- Analyze_Task_Body --
-----------------------
procedure Analyze_Task_Body (N : Node_Id) is
Body_Id : constant Entity_Id := Defining_Identifier (N);
Last_E : Entity_Id;
Spec_Id : Entity_Id;
-- This is initially the entity of the task or task type involved, but
-- is replaced by the task type always in the case of a single task
-- declaration, since this is the proper scope to be used.
Ref_Id : Entity_Id;
-- This is the entity of the task or task type, and is the entity used
-- for cross-reference purposes (it differs from Spec_Id in the case of
-- a single task, since Spec_Id is set to the task type)
begin
Tasking_Used := True;
Set_Ekind (Body_Id, E_Task_Body);
Set_Scope (Body_Id, Current_Scope);
Spec_Id := Find_Concurrent_Spec (Body_Id);
-- The spec is either a task type declaration, or a single task
-- declaration for which we have created an anonymous type.
if Present (Spec_Id)
and then Ekind (Spec_Id) = E_Task_Type
then
null;
elsif Present (Spec_Id)
and then Ekind (Etype (Spec_Id)) = E_Task_Type
and then not Comes_From_Source (Etype (Spec_Id))
then
null;
else
Error_Msg_N ("missing specification for task body", Body_Id);
return;
end if;
if Has_Completion (Spec_Id)
and then Present (Corresponding_Body (Parent (Spec_Id)))
then
if Nkind (Parent (Spec_Id)) = N_Task_Type_Declaration then
Error_Msg_NE ("duplicate body for task type&", N, Spec_Id);
else
Error_Msg_NE ("duplicate body for task&", N, Spec_Id);
end if;
end if;
Ref_Id := Spec_Id;
Generate_Reference (Ref_Id, Body_Id, 'b', Set_Ref => False);
Style.Check_Identifier (Body_Id, Spec_Id);
-- Deal with case of body of single task (anonymous type was created)
if Ekind (Spec_Id) = E_Variable then
Spec_Id := Etype (Spec_Id);
end if;
New_Scope (Spec_Id);
Set_Corresponding_Spec (N, Spec_Id);
Set_Corresponding_Body (Parent (Spec_Id), Body_Id);
Set_Has_Completion (Spec_Id);
Install_Declarations (Spec_Id);
Last_E := Last_Entity (Spec_Id);
Analyze_Declarations (Declarations (N));
-- For visibility purposes, all entities in the body are private. Set
-- First_Private_Entity accordingly, if there was no private part in the
-- protected declaration.
if No (First_Private_Entity (Spec_Id)) then
if Present (Last_E) then
Set_First_Private_Entity (Spec_Id, Next_Entity (Last_E));
else
Set_First_Private_Entity (Spec_Id, First_Entity (Spec_Id));
end if;
end if;
Analyze (Handled_Statement_Sequence (N));
Check_Completion (Body_Id);
Check_References (Body_Id);
Check_References (Spec_Id);
-- Check for entries with no corresponding accept
declare
Ent : Entity_Id;
begin
Ent := First_Entity (Spec_Id);
while Present (Ent) loop
if Is_Entry (Ent)
and then not Entry_Accepted (Ent)
and then Comes_From_Source (Ent)
then
Error_Msg_NE ("no accept for entry &?", N, Ent);
end if;
Next_Entity (Ent);
end loop;
end;
Process_End_Label (Handled_Statement_Sequence (N), 't', Ref_Id);
End_Scope;
end Analyze_Task_Body;
-----------------------------
-- Analyze_Task_Definition --
-----------------------------
procedure Analyze_Task_Definition (N : Node_Id) is
L : Entity_Id;
begin
Tasking_Used := True;
if Present (Visible_Declarations (N)) then
Analyze_Declarations (Visible_Declarations (N));
end if;
if Present (Private_Declarations (N)) then
L := Last_Entity (Current_Scope);
Analyze_Declarations (Private_Declarations (N));
if Present (L) then
Set_First_Private_Entity
(Current_Scope, Next_Entity (L));
else
Set_First_Private_Entity
(Current_Scope, First_Entity (Current_Scope));
end if;
end if;
Check_Max_Entries (N, Max_Task_Entries);
Process_End_Label (N, 'e', Current_Scope);
Check_Overriding_Indicator (N);
end Analyze_Task_Definition;
-----------------------
-- Analyze_Task_Type --
-----------------------
procedure Analyze_Task_Type (N : Node_Id) is
T : Entity_Id;
Def_Id : constant Entity_Id := Defining_Identifier (N);
Iface : Node_Id;
Iface_Def : Node_Id;
Iface_Typ : Entity_Id;
begin
Check_Restriction (No_Tasking, N);
Tasking_Used := True;
T := Find_Type_Name (N);
Generate_Definition (T);
if Ekind (T) = E_Incomplete_Type then
T := Full_View (T);
Set_Completion_Referenced (T);
end if;
Set_Ekind (T, E_Task_Type);
Set_Is_First_Subtype (T, True);
Set_Has_Task (T, True);
Init_Size_Align (T);
Set_Etype (T, T);
Set_Has_Delayed_Freeze (T, True);
Set_Stored_Constraint (T, No_Elist);
New_Scope (T);
-- Ada 2005 (AI-345)
if Present (Interface_List (N)) then
Set_Is_Tagged_Type (T);
Iface := First (Interface_List (N));
while Present (Iface) loop
Iface_Typ := Find_Type_Of_Subtype_Indic (Iface);
Iface_Def := Type_Definition (Parent (Iface_Typ));
if not Is_Interface (Iface_Typ) then
Error_Msg_NE ("(Ada 2005) & must be an interface",
Iface, Iface_Typ);
else
-- Ada 2005 (AI-251): The declaration of a specific descendant
-- of an interface type freezes the interface type (RM 13.14).
Freeze_Before (N, Etype (Iface));
-- Ada 2005 (AI-345): Task types can only implement limited,
-- synchronized or task interfaces.
if Limited_Present (Iface_Def)
or else Synchronized_Present (Iface_Def)
or else Task_Present (Iface_Def)
then
null;
elsif Protected_Present (Iface_Def) then
Error_Msg_N ("(Ada 2005) task type cannot implement a " &
"protected interface", Iface);
else
Error_Msg_N ("(Ada 2005) task type cannot implement a " &
"non-limited interface", Iface);
end if;
end if;
Next (Iface);
end loop;
-- If this is the full-declaration associated with a private
-- declaration that implement interfaces, then the private
-- type declaration must be limited.
if Has_Private_Declaration (T) then
declare
E : Entity_Id;
begin
E := First_Entity (Scope (T));
loop
pragma Assert (Present (E));
if Is_Type (E) and then Present (Full_View (E)) then
exit when Full_View (E) = T;
end if;
Next_Entity (E);
end loop;
if not Is_Limited_Record (E) then
Error_Msg_Sloc := Sloc (E);
Error_Msg_N
("(Ada 2005) private type declaration # must be limited",
T);
end if;
end;
end if;
end if;
if Present (Discriminant_Specifications (N)) then
if Ada_Version = Ada_83 and then Comes_From_Source (N) then
Error_Msg_N ("(Ada 83) task discriminant not allowed!", N);
end if;
if Has_Discriminants (T) then
-- Install discriminants. Also, verify conformance of
-- discriminants of previous and current view. ???
Install_Declarations (T);
else
Process_Discriminants (N);
end if;
end if;
Set_Is_Constrained (T, not Has_Discriminants (T));
if Present (Task_Definition (N)) then
Analyze_Task_Definition (Task_Definition (N));
end if;
if not Is_Library_Level_Entity (T) then
Check_Restriction (No_Task_Hierarchy, N);
end if;
End_Scope;
if T /= Def_Id
and then Is_Private_Type (Def_Id)
and then Has_Discriminants (Def_Id)
and then Expander_Active
then
Exp_Ch9.Expand_N_Task_Type_Declaration (N);
Process_Full_View (N, T, Def_Id);
end if;
end Analyze_Task_Type;
-----------------------------------
-- Analyze_Terminate_Alternative --
-----------------------------------
procedure Analyze_Terminate_Alternative (N : Node_Id) is
begin
Tasking_Used := True;
if Present (Pragmas_Before (N)) then
Analyze_List (Pragmas_Before (N));
end if;
if Present (Condition (N)) then
Analyze_And_Resolve (Condition (N), Any_Boolean);
end if;
end Analyze_Terminate_Alternative;
------------------------------
-- Analyze_Timed_Entry_Call --
------------------------------
procedure Analyze_Timed_Entry_Call (N : Node_Id) is
begin
Check_Restriction (No_Select_Statements, N);
Tasking_Used := True;
Analyze (Entry_Call_Alternative (N));
Analyze (Delay_Alternative (N));
end Analyze_Timed_Entry_Call;
------------------------------------
-- Analyze_Triggering_Alternative --
------------------------------------
procedure Analyze_Triggering_Alternative (N : Node_Id) is
Trigger : constant Node_Id := Triggering_Statement (N);
begin
Tasking_Used := True;
if Present (Pragmas_Before (N)) then
Analyze_List (Pragmas_Before (N));
end if;
Analyze (Trigger);
if Comes_From_Source (Trigger)
and then Nkind (Trigger) not in N_Delay_Statement
and then Nkind (Trigger) /= N_Entry_Call_Statement
then
if Ada_Version < Ada_05 then
Error_Msg_N
("triggering statement must be delay or entry call", Trigger);
-- Ada 2005 (AI-345): If a procedure_call_statement is used for a
-- procedure_or_entry_call, the procedure_name or pro- cedure_prefix
-- of the procedure_call_statement shall denote an entry renamed by a
-- procedure, or (a view of) a primitive subprogram of a limited
-- interface whose first parameter is a controlling parameter.
elsif Nkind (Trigger) = N_Procedure_Call_Statement
and then not Is_Renamed_Entry (Entity (Name (Trigger)))
and then not Is_Controlling_Limited_Procedure
(Entity (Name (Trigger)))
then
Error_Msg_N ("triggering statement must be delay, procedure " &
"or entry call", Trigger);
end if;
end if;
if Is_Non_Empty_List (Statements (N)) then
Analyze_Statements (Statements (N));
end if;
end Analyze_Triggering_Alternative;
-----------------------
-- Check_Max_Entries --
-----------------------
procedure Check_Max_Entries (D : Node_Id; R : All_Parameter_Restrictions) is
Ecount : Uint;
procedure Count (L : List_Id);
-- Count entries in given declaration list
-----------
-- Count --
-----------
procedure Count (L : List_Id) is
D : Node_Id;
begin
if No (L) then
return;
end if;
D := First (L);
while Present (D) loop
if Nkind (D) = N_Entry_Declaration then
declare
DSD : constant Node_Id :=
Discrete_Subtype_Definition (D);
begin
-- If not an entry family, then just one entry
if No (DSD) then
Ecount := Ecount + 1;
-- If entry family with static bounds, count entries
elsif Is_OK_Static_Subtype (Etype (DSD)) then
declare
Lo : constant Uint :=
Expr_Value
(Type_Low_Bound (Etype (DSD)));
Hi : constant Uint :=
Expr_Value
(Type_High_Bound (Etype (DSD)));
begin
if Hi >= Lo then
Ecount := Ecount + Hi - Lo + 1;
end if;
end;
-- Entry family with non-static bounds
else
-- If restriction is set, then this is an error
if Restrictions.Set (R) then
Error_Msg_N
("static subtype required by Restriction pragma",
DSD);
-- Otherwise we record an unknown count restriction
else
Check_Restriction (R, D);
end if;
end if;
end;
end if;
Next (D);
end loop;
end Count;
-- Start of processing for Check_Max_Entries
begin
Ecount := Uint_0;
Count (Visible_Declarations (D));
Count (Private_Declarations (D));
if Ecount > 0 then
Check_Restriction (R, D, Ecount);
end if;
end Check_Max_Entries;
--------------------------------
-- Check_Overriding_Indicator --
--------------------------------
procedure Check_Overriding_Indicator (Def : Node_Id) is
Aliased_Hom : Entity_Id;
Decl : Node_Id;
Def_Id : Entity_Id;
Hom : Entity_Id;
Ifaces : constant List_Id := Interface_List (Parent (Def));
Overrides : Boolean;
Spec : Node_Id;
Vis_Decls : constant List_Id := Visible_Declarations (Def);
function Matches_Prefixed_View_Profile
(Ifaces : List_Id;
Entry_Params : List_Id;
Proc_Params : List_Id) return Boolean;
-- Ada 2005 (AI-397): Determine if an entry parameter profile matches
-- the prefixed view profile of an abstract procedure. Also determine
-- whether the abstract procedure belongs to an implemented interface.
-----------------------------------
-- Matches_Prefixed_View_Profile --
-----------------------------------
function Matches_Prefixed_View_Profile
(Ifaces : List_Id;
Entry_Params : List_Id;
Proc_Params : List_Id) return Boolean
is
Entry_Param : Node_Id;
Proc_Param : Node_Id;
Proc_Param_Typ : Entity_Id;
function Includes_Interface
(Iface : Entity_Id;
Ifaces : List_Id) return Boolean;
-- Determine if an interface is contained in a list of interfaces
------------------------
-- Includes_Interface --
------------------------
function Includes_Interface
(Iface : Entity_Id;
Ifaces : List_Id) return Boolean
is
Ent : Entity_Id;
begin
Ent := First (Ifaces);
while Present (Ent) loop
if Etype (Ent) = Iface then
return True;
end if;
Next (Ent);
end loop;
return False;
end Includes_Interface;
-- Start of processing for Matches_Prefixed_View_Profile
begin
Proc_Param := First (Proc_Params);
Proc_Param_Typ := Etype (Parameter_Type (Proc_Param));
-- The first parameter of the abstract procedure must be of an
-- interface type. The task or protected type must also implement
-- that interface.
if not Is_Interface (Proc_Param_Typ)
or else not Includes_Interface (Proc_Param_Typ, Ifaces)
then
return False;
end if;
Entry_Param := First (Entry_Params);
Proc_Param := Next (Proc_Param);
while Present (Entry_Param) and then Present (Proc_Param) loop
-- The two parameters must be mode conformant and have the exact
-- same types.
if Ekind (Defining_Identifier (Entry_Param)) /=
Ekind (Defining_Identifier (Proc_Param))
or else Etype (Parameter_Type (Entry_Param)) /=
Etype (Parameter_Type (Proc_Param))
then
return False;
end if;
Next (Entry_Param);
Next (Proc_Param);
end loop;
-- One of the lists is longer than the other
if Present (Entry_Param) or else Present (Proc_Param) then
return False;
end if;
return True;
end Matches_Prefixed_View_Profile;
-- Start of processing for Check_Overriding_Indicator
begin
if Present (Ifaces) then
Decl := First (Vis_Decls);
while Present (Decl) loop
-- Consider entries with either "overriding" or "not overriding"
-- indicator present.
if Nkind (Decl) = N_Entry_Declaration
and then (Must_Override (Decl)
or else
Must_Not_Override (Decl))
then
Def_Id := Defining_Identifier (Decl);
Overrides := False;
Hom := Homonym (Def_Id);
while Present (Hom) loop
-- The current entry may override a procedure from an
-- implemented interface.
if Ekind (Hom) = E_Procedure
and then (Is_Abstract (Hom)
or else
Null_Present (Parent (Hom)))
then
Aliased_Hom := Hom;
while Present (Alias (Aliased_Hom)) loop
Aliased_Hom := Alias (Aliased_Hom);
end loop;
if Matches_Prefixed_View_Profile (Ifaces,
Parameter_Specifications (Decl),
Parameter_Specifications (Parent (Aliased_Hom)))
then
Overrides := True;
exit;
end if;
end if;
Hom := Homonym (Hom);
end loop;
if Overrides then
if Must_Not_Override (Decl) then
Error_Msg_NE ("entry& is overriding", Def_Id, Def_Id);
end if;
else
if Must_Override (Decl) then
Error_Msg_NE ("entry& is not overriding", Def_Id, Def_Id);
end if;
end if;
-- Consider subprograms with either "overriding" or "not
-- overriding" indicator present.
elsif Nkind (Decl) = N_Subprogram_Declaration
and then (Must_Override (Specification (Decl))
or else
Must_Not_Override (Specification (Decl)))
then
Spec := Specification (Decl);
Def_Id := Defining_Unit_Name (Spec);
Overrides := False;
Hom := Homonym (Def_Id);
while Present (Hom) loop
-- Function
if Ekind (Def_Id) = E_Function
and then Ekind (Hom) = E_Function
and then Is_Abstract (Hom)
and then Matches_Prefixed_View_Profile (Ifaces,
Parameter_Specifications (Spec),
Parameter_Specifications (Parent (Hom)))
and then Etype (Result_Definition (Spec)) =
Etype (Result_Definition (Parent (Hom)))
then
Overrides := True;
exit;
-- Procedure
elsif Ekind (Def_Id) = E_Procedure
and then Ekind (Hom) = E_Procedure
and then (Is_Abstract (Hom)
or else
Null_Present (Parent (Hom)))
and then Matches_Prefixed_View_Profile (Ifaces,
Parameter_Specifications (Spec),
Parameter_Specifications (Parent (Hom)))
then
Overrides := True;
exit;
end if;
Hom := Homonym (Hom);
end loop;
if Overrides then
if Must_Not_Override (Spec) then
Error_Msg_NE
("subprogram& is overriding", Def_Id, Def_Id);
end if;
else
if Must_Override (Spec) then
Error_Msg_NE
("subprogram& is not overriding", Def_Id, Def_Id);
end if;
end if;
end if;
Next (Decl);
end loop;
-- The protected or task type is not implementing an interface, we need
-- to check for the presence of "overriding" entries or subprograms and
-- flag them as erroneous.
else
Decl := First (Vis_Decls);
while Present (Decl) loop
if Nkind (Decl) = N_Entry_Declaration
and then Must_Override (Decl)
then
Def_Id := Defining_Identifier (Decl);
Error_Msg_NE ("entry& is not overriding", Def_Id, Def_Id);
elsif Nkind (Decl) = N_Subprogram_Declaration
and then Must_Override (Specification (Decl))
then
Def_Id := Defining_Identifier (Specification (Decl));
Error_Msg_NE ("subprogram& is not overriding", Def_Id, Def_Id);
end if;
Next (Decl);
end loop;
end if;
end Check_Overriding_Indicator;
--------------------------
-- Find_Concurrent_Spec --
--------------------------
function Find_Concurrent_Spec (Body_Id : Entity_Id) return Entity_Id is
Spec_Id : Entity_Id := Current_Entity_In_Scope (Body_Id);
begin
-- The type may have been given by an incomplete type declaration.
-- Find full view now.
if Present (Spec_Id) and then Ekind (Spec_Id) = E_Incomplete_Type then
Spec_Id := Full_View (Spec_Id);
end if;
return Spec_Id;
end Find_Concurrent_Spec;
--------------------------
-- Install_Declarations --
--------------------------
procedure Install_Declarations (Spec : Entity_Id) is
E : Entity_Id;
Prev : Entity_Id;
begin
E := First_Entity (Spec);
while Present (E) loop
Prev := Current_Entity (E);
Set_Current_Entity (E);
Set_Is_Immediately_Visible (E);
Set_Homonym (E, Prev);
Next_Entity (E);
end loop;
end Install_Declarations;
end Sem_Ch9;
| 33.325296 | 79 | 0.553926 |
d01b701380f0184fe49738cefa6cdeaf790303a2 | 5,030 | ads | Ada | source/amf/utp/amf-utp-test_contexts-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/utp/amf-utp-test_contexts-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/utp/amf-utp-test_contexts-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.Utp.Test_Contexts.Collections is
pragma Preelaborate;
package Utp_Test_Context_Collections is
new AMF.Generic_Collections
(Utp_Test_Context,
Utp_Test_Context_Access);
type Set_Of_Utp_Test_Context is
new Utp_Test_Context_Collections.Set with null record;
Empty_Set_Of_Utp_Test_Context : constant Set_Of_Utp_Test_Context;
type Ordered_Set_Of_Utp_Test_Context is
new Utp_Test_Context_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_Utp_Test_Context : constant Ordered_Set_Of_Utp_Test_Context;
type Bag_Of_Utp_Test_Context is
new Utp_Test_Context_Collections.Bag with null record;
Empty_Bag_Of_Utp_Test_Context : constant Bag_Of_Utp_Test_Context;
type Sequence_Of_Utp_Test_Context is
new Utp_Test_Context_Collections.Sequence with null record;
Empty_Sequence_Of_Utp_Test_Context : constant Sequence_Of_Utp_Test_Context;
private
Empty_Set_Of_Utp_Test_Context : constant Set_Of_Utp_Test_Context
:= (Utp_Test_Context_Collections.Set with null record);
Empty_Ordered_Set_Of_Utp_Test_Context : constant Ordered_Set_Of_Utp_Test_Context
:= (Utp_Test_Context_Collections.Ordered_Set with null record);
Empty_Bag_Of_Utp_Test_Context : constant Bag_Of_Utp_Test_Context
:= (Utp_Test_Context_Collections.Bag with null record);
Empty_Sequence_Of_Utp_Test_Context : constant Sequence_Of_Utp_Test_Context
:= (Utp_Test_Context_Collections.Sequence with null record);
end AMF.Utp.Test_Contexts.Collections;
| 54.673913 | 84 | 0.51829 |
fbedf47d1310ee86a1fa4007acb8248e03cd9530 | 197 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/small_alignment.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/small_alignment.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/small_alignment.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
package Small_Alignment is
type Int is range -512 .. 511;
for Int'Alignment use 1;
type R is record
I: Int;
end record;
Pragma Pack (R);
end Small_Alignment;
| 14.071429 | 32 | 0.654822 |
105636d71750d0a820abced1c791aec7c92afa31 | 2,619 | ads | Ada | src/flyweights/flyweights-basic_hashtables.ads | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | 5 | 2016-02-22T10:29:26.000Z | 2021-12-18T08:20:12.000Z | src/flyweights/flyweights-basic_hashtables.ads | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | 1 | 2022-02-16T03:38:08.000Z | 2022-02-20T21:11:30.000Z | src/flyweights/flyweights-basic_hashtables.ads | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | null | null | null | -- flyweights-basic_hashtables.ads
-- A package of non-task-safe hash tables for the Flyweights packages
-- 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 Ada.Containers;
with Flyweights_Lists_Spec;
with Flyweights_Hashtables_Spec;
generic
type Element(<>) is limited private;
type Element_Access is access Element;
with function Hash (E : Element) return Ada.Containers.Hash_Type;
with package Lists_Spec is
new Flyweights_Lists_Spec(Element_Access => Element_Access,
others => <>);
Capacity : Ada.Containers.Hash_Type := 256;
package Flyweights.Basic_Hashtables is
use type Ada.Containers.Hash_Type;
type List_Array is array (Ada.Containers.Hash_Type range <>) of Lists_Spec.List;
type Flyweight is limited
record
Lists : List_Array (0..(Capacity-1))
:= (others => Lists_Spec.Empty_List);
end record;
procedure Insert (F : aliased in out Flyweight;
Bucket : out Ada.Containers.Hash_Type;
Data_Ptr : in out Element_Access)
with Inline;
procedure Increment (F : aliased in out Flyweight;
Bucket : in Ada.Containers.Hash_Type;
Data_Ptr : in Element_Access)
with Inline;
procedure Remove (F : in out Flyweight;
Bucket : in Ada.Containers.Hash_Type;
Data_Ptr : in Element_Access)
with Inline;
package Hashtables_Spec is
new Flyweights_Hashtables_Spec(Element_Access => Element_Access,
Flyweight => Flyweight,
Insert => Insert,
Increment => Increment,
Remove => Remove);
end Flyweights.Basic_Hashtables;
| 37.956522 | 83 | 0.654066 |
1cccd1b41918c6435780a7ee48aa82d8714d6ed7 | 320 | ads | Ada | day18/src/day.ads | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | 3 | 2020-12-26T23:44:33.000Z | 2021-12-06T16:00:54.000Z | day18/src/day.ads | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | day18/src/day.ads | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | -- AOC 2020, Day 18
package Day is
function hw_sum(filename : in String) return Long_Integer;
function hw_newmath_sum(filename : in String) return Long_Integer;
private
function eval_string(expr : in String) return Long_Integer;
function eval_newmath_string(expr : in String) return Long_Integer;
end Day;
| 24.615385 | 69 | 0.771875 |
1c13a4ec08674eee85bffcc0e96c0a21309d50ac | 6,658 | ads | Ada | arch/ARM/STM32/svd/stm32f46_79x/stm32_svd-dbg.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/STM32/svd/stm32f46_79x/stm32_svd-dbg.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/STM32/svd/stm32f46_79x/stm32_svd-dbg.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | -- This spec has been automatically generated from STM32F46_79x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.DBG is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype DBGMCU_IDCODE_DEV_ID_Field is HAL.UInt12;
subtype DBGMCU_IDCODE_REV_ID_Field is HAL.UInt16;
-- IDCODE
type DBGMCU_IDCODE_Register is record
-- Read-only. DEV_ID
DEV_ID : DBGMCU_IDCODE_DEV_ID_Field;
-- unspecified
Reserved_12_15 : HAL.UInt4;
-- Read-only. REV_ID
REV_ID : DBGMCU_IDCODE_REV_ID_Field;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DBGMCU_IDCODE_Register use record
DEV_ID at 0 range 0 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
REV_ID at 0 range 16 .. 31;
end record;
subtype DBGMCU_CR_TRACE_MODE_Field is HAL.UInt2;
-- Control Register
type DBGMCU_CR_Register is record
-- DBG_SLEEP
DBG_SLEEP : Boolean := False;
-- DBG_STOP
DBG_STOP : Boolean := False;
-- DBG_STANDBY
DBG_STANDBY : Boolean := False;
-- unspecified
Reserved_3_4 : HAL.UInt2 := 16#0#;
-- TRACE_IOEN
TRACE_IOEN : Boolean := False;
-- TRACE_MODE
TRACE_MODE : DBGMCU_CR_TRACE_MODE_Field := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DBGMCU_CR_Register use record
DBG_SLEEP at 0 range 0 .. 0;
DBG_STOP at 0 range 1 .. 1;
DBG_STANDBY at 0 range 2 .. 2;
Reserved_3_4 at 0 range 3 .. 4;
TRACE_IOEN at 0 range 5 .. 5;
TRACE_MODE at 0 range 6 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- Debug MCU APB1 Freeze registe
type DBGMCU_APB1_FZ_Register is record
-- DBG_TIM2_STOP
DBG_TIM2_STOP : Boolean := False;
-- DBG_TIM3 _STOP
DBG_TIM3_STOP : Boolean := False;
-- DBG_TIM4_STOP
DBG_TIM4_STOP : Boolean := False;
-- DBG_TIM5_STOP
DBG_TIM5_STOP : Boolean := False;
-- DBG_TIM6_STOP
DBG_TIM6_STOP : Boolean := False;
-- DBG_TIM7_STOP
DBG_TIM7_STOP : Boolean := False;
-- DBG_TIM12_STOP
DBG_TIM12_STOP : Boolean := False;
-- DBG_TIM13_STOP
DBG_TIM13_STOP : Boolean := False;
-- DBG_TIM14_STOP
DBG_TIM14_STOP : Boolean := False;
-- unspecified
Reserved_9_10 : HAL.UInt2 := 16#0#;
-- DBG_WWDG_STOP
DBG_WWDG_STOP : Boolean := False;
-- DBG_IWDEG_STOP
DBG_IWDEG_STOP : Boolean := False;
-- unspecified
Reserved_13_20 : HAL.UInt8 := 16#0#;
-- DBG_J2C1_SMBUS_TIMEOUT
DBG_J2C1_SMBUS_TIMEOUT : Boolean := False;
-- DBG_J2C2_SMBUS_TIMEOUT
DBG_J2C2_SMBUS_TIMEOUT : Boolean := False;
-- DBG_J2C3SMBUS_TIMEOUT
DBG_J2C3SMBUS_TIMEOUT : Boolean := False;
-- unspecified
Reserved_24_24 : HAL.Bit := 16#0#;
-- DBG_CAN1_STOP
DBG_CAN1_STOP : Boolean := False;
-- DBG_CAN2_STOP
DBG_CAN2_STOP : Boolean := False;
-- unspecified
Reserved_27_31 : HAL.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DBGMCU_APB1_FZ_Register use record
DBG_TIM2_STOP at 0 range 0 .. 0;
DBG_TIM3_STOP at 0 range 1 .. 1;
DBG_TIM4_STOP at 0 range 2 .. 2;
DBG_TIM5_STOP at 0 range 3 .. 3;
DBG_TIM6_STOP at 0 range 4 .. 4;
DBG_TIM7_STOP at 0 range 5 .. 5;
DBG_TIM12_STOP at 0 range 6 .. 6;
DBG_TIM13_STOP at 0 range 7 .. 7;
DBG_TIM14_STOP at 0 range 8 .. 8;
Reserved_9_10 at 0 range 9 .. 10;
DBG_WWDG_STOP at 0 range 11 .. 11;
DBG_IWDEG_STOP at 0 range 12 .. 12;
Reserved_13_20 at 0 range 13 .. 20;
DBG_J2C1_SMBUS_TIMEOUT at 0 range 21 .. 21;
DBG_J2C2_SMBUS_TIMEOUT at 0 range 22 .. 22;
DBG_J2C3SMBUS_TIMEOUT at 0 range 23 .. 23;
Reserved_24_24 at 0 range 24 .. 24;
DBG_CAN1_STOP at 0 range 25 .. 25;
DBG_CAN2_STOP at 0 range 26 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
-- Debug MCU APB2 Freeze registe
type DBGMCU_APB2_FZ_Register is record
-- TIM1 counter stopped when core is halted
DBG_TIM1_STOP : Boolean := False;
-- TIM8 counter stopped when core is halted
DBG_TIM8_STOP : Boolean := False;
-- unspecified
Reserved_2_15 : HAL.UInt14 := 16#0#;
-- TIM9 counter stopped when core is halted
DBG_TIM9_STOP : Boolean := False;
-- TIM10 counter stopped when core is halted
DBG_TIM10_STOP : Boolean := False;
-- TIM11 counter stopped when core is halted
DBG_TIM11_STOP : Boolean := False;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DBGMCU_APB2_FZ_Register use record
DBG_TIM1_STOP at 0 range 0 .. 0;
DBG_TIM8_STOP at 0 range 1 .. 1;
Reserved_2_15 at 0 range 2 .. 15;
DBG_TIM9_STOP at 0 range 16 .. 16;
DBG_TIM10_STOP at 0 range 17 .. 17;
DBG_TIM11_STOP at 0 range 18 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Debug support
type DBG_Peripheral is record
-- IDCODE
DBGMCU_IDCODE : aliased DBGMCU_IDCODE_Register;
-- Control Register
DBGMCU_CR : aliased DBGMCU_CR_Register;
-- Debug MCU APB1 Freeze registe
DBGMCU_APB1_FZ : aliased DBGMCU_APB1_FZ_Register;
-- Debug MCU APB2 Freeze registe
DBGMCU_APB2_FZ : aliased DBGMCU_APB2_FZ_Register;
end record
with Volatile;
for DBG_Peripheral use record
DBGMCU_IDCODE at 16#0# range 0 .. 31;
DBGMCU_CR at 16#4# range 0 .. 31;
DBGMCU_APB1_FZ at 16#8# range 0 .. 31;
DBGMCU_APB2_FZ at 16#C# range 0 .. 31;
end record;
-- Debug support
DBG_Periph : aliased DBG_Peripheral
with Import, Address => System'To_Address (16#E0042000#);
end STM32_SVD.DBG;
| 33.626263 | 68 | 0.594623 |
5024b15ade8a73ececbc3664adcfc1b77af13a8e | 3,311 | ads | Ada | ada-numerics-generic_elementary_functions.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 15 | 2018-07-08T07:09:19.000Z | 2021-11-21T09:58:55.000Z | ada-numerics-generic_elementary_functions.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 4 | 2019-11-17T20:04:33.000Z | 2021-08-29T21:24:55.000Z | ada-numerics-generic_elementary_functions.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 3 | 2020-04-23T11:17:11.000Z | 2021-08-29T19:31:09.000Z | -- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <[email protected]>
-- 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;
| 38.952941 | 75 | 0.591664 |
fb8a7f70a27249be20aed9588764d5204d06ddba | 4,211 | adb | Ada | tools-src/gnu/gcc/gcc/ada/5wgloloc.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/5wgloloc.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/5wgloloc.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . G L O B A L _ L O C K S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1999-2001 Ada Core Technologies, 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 is maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This implementation is specific to NT.
with GNAT.Task_Lock;
with Interfaces.C.Strings;
with System.OS_Interface;
package body System.Global_Locks is
package TSL renames GNAT.Task_Lock;
package OSI renames System.OS_Interface;
package ICS renames Interfaces.C.Strings;
subtype Lock_File_Entry is OSI.HANDLE;
Last_Lock : Lock_Type := Null_Lock;
Lock_Table : array (Lock_Type range 1 .. 15) of Lock_File_Entry;
-----------------
-- Create_Lock --
-----------------
procedure Create_Lock
(Lock : out Lock_Type;
Name : in String)
is
L : Lock_Type;
begin
TSL.Lock;
Last_Lock := Last_Lock + 1;
L := Last_Lock;
TSL.Unlock;
if L > Lock_Table'Last then
raise Lock_Error;
end if;
Lock_Table (L) :=
OSI.CreateMutex (null, OSI.BOOL (False), ICS.New_String (Name));
Lock := L;
end Create_Lock;
------------------
-- Acquire_Lock --
------------------
procedure Acquire_Lock
(Lock : in out Lock_Type)
is
use type OSI.DWORD;
Res : OSI.DWORD;
begin
Res := OSI.WaitForSingleObject (Lock_Table (Lock), OSI.Wait_Infinite);
if Res = OSI.WAIT_FAILED then
raise Lock_Error;
end if;
end Acquire_Lock;
------------------
-- Release_Lock --
------------------
procedure Release_Lock
(Lock : in out Lock_Type)
is
use type OSI.BOOL;
Res : OSI.BOOL;
begin
Res := OSI.ReleaseMutex (Lock_Table (Lock));
if Res = OSI.False then
raise Lock_Error;
end if;
end Release_Lock;
end System.Global_Locks;
| 36.617391 | 78 | 0.458561 |
0edfb1e8e3d35e9eb0bc57c6d4497f7c83f4042e | 14,598 | adb | Ada | runtime/ravenscar-sfp-stm32f427/gnarl-common/s-bbthre.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | runtime/ravenscar-sfp-stm32f427/gnarl-common/s-bbthre.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | runtime/ravenscar-sfp-stm32f427/gnarl-common/s-bbthre.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . B B . T H R E A D S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1999-2002 Universidad Politecnica de Madrid --
-- Copyright (C) 2003-2005 The European Space Agency --
-- Copyright (C) 2003-2016, AdaCore --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, 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. --
-- --
-- --
-- --
-- --
-- --
-- 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. --
-- --
-- The port of GNARL to bare board targets was initially developed by the --
-- Real-Time Systems Group at the Technical University of Madrid. --
-- --
------------------------------------------------------------------------------
pragma Restrictions (No_Elaboration_Code);
with System.Parameters;
with System.BB.Parameters;
with System.BB.Board_Support;
with System.BB.Protection;
with System.BB.Threads.Queues;
with Ada.Unchecked_Conversion;
package body System.BB.Threads is
use System.Multiprocessors;
use System.BB.CPU_Primitives;
use System.BB.CPU_Primitives.Multiprocessors;
use System.BB.Time;
use System.BB.Parameters;
use Board_Support;
use type System.Address;
use type System.Parameters.Size_Type;
use type System.Storage_Elements.Storage_Offset;
procedure Initialize_Thread
(Id : Thread_Id;
Code : System.Address;
Arg : System.Address;
Priority : Integer;
This_CPU : System.Multiprocessors.CPU_Range;
Stack_Top : System.Address;
Stack_Bottom : System.Address);
-----------------------
-- Stack information --
-----------------------
-- Boundaries of the stack for the environment task, defined by the linker
-- script file.
Top_Of_Environment_Stack : constant System.Address;
pragma Import (Asm, Top_Of_Environment_Stack, "__stack_end");
-- Top of the stack to be used by the environment task
Bottom_Of_Environment_Stack : constant System.Address;
pragma Import (Asm, Bottom_Of_Environment_Stack, "__stack_start");
-- Bottom of the stack to be used by the environment task
------------------
-- Get_Affinity --
------------------
function Get_Affinity (Thread : Thread_Id) return CPU_Range is
begin
return Thread.Base_CPU;
end Get_Affinity;
-------------
-- Get_CPU --
-------------
function Get_CPU (Thread : Thread_Id) return CPU is
begin
if Thread.Base_CPU = Not_A_Specific_CPU then
-- Return the implementation specific default CPU
return CPU'First;
else
return CPU (Thread.Base_CPU);
end if;
end Get_CPU;
--------------
-- Get_ATCB --
--------------
function Get_ATCB return System.Address is
begin
-- This is not a light operation as there is a function call
return Queues.Running_Thread.ATCB;
end Get_ATCB;
------------------
-- Get_Priority --
------------------
function Get_Priority (Id : Thread_Id) return Integer is
begin
-- This function does not need to be protected by Enter_Kernel and
-- Leave_Kernel, because the Active_Priority value is only updated by
-- Set_Priority (atomically). Moreover, Active_Priority is marked as
-- Volatile.
return Id.Active_Priority;
end Get_Priority;
-----------------------------
-- Initialize_Thread --
-----------------------------
procedure Initialize_Thread
(Id : Thread_Id;
Code : System.Address;
Arg : System.Address;
Priority : Integer;
This_CPU : System.Multiprocessors.CPU_Range;
Stack_Top : System.Address;
Stack_Bottom : System.Address) is
begin
-- The environment thread executes the main procedure of the program
-- CPU of the environment thread is current one (initialization CPU)
Id.Base_CPU := This_CPU;
-- The active priority is initially equal to the base priority
Id.Base_Priority := Priority;
Id.Active_Priority := Priority;
-- Insert in the global list
-- ??? Not thread safe.
Id.Global_List := Queues.Global_List;
Queues.Global_List := Id;
-- Insert task inside the ready list (as last within its priority)
Queues.Insert (Id);
-- Store stack information
Id.Top_Of_Stack := Stack_Top;
Id.Bottom_Of_Stack := Stack_Bottom;
-- The initial state is Runnable
Id.State := Runnable;
-- Not currently in an interrupt handler
Id.In_Interrupt := False;
-- No wakeup has been yet signaled
Id.Wakeup_Signaled := False;
-- Initialize alarm status
Id.Alarm_Time := System.BB.Time.Time'Last;
Id.Next_Alarm := Null_Thread_Id;
-- Reset execution time
Id.Execution_Time :=
System.BB.Time.Initial_Composite_Execution_Time;
-- Initialize the saved registers. We can ignore the stack and code to
-- execute because the environment task is already executing. We are
-- interested in the initialization of the rest of the state, such as
-- the interrupt nesting level and the cache state.
Initialize_Context
(Buffer => Id.Context'Access,
Program_Counter => Code,
Argument => Arg,
Stack_Pointer => (if System.Parameters.Stack_Grows_Down
then Id.Top_Of_Stack
else Id.Bottom_Of_Stack));
end Initialize_Thread;
----------------
-- Initialize --
----------------
procedure Initialize
(Environment_Thread : Thread_Id;
Main_Priority : System.Any_Priority)
is
Main_CPU : constant System.Multiprocessors.CPU := Current_CPU;
begin
-- Perform some basic hardware initialization (clock, timer, and
-- interrupt handlers).
-- First initialize interrupt stacks
Interrupts.Initialize_Interrupts;
-- Then the CPU (which set interrupt stack pointer)
Initialize_CPU;
-- Then the devices
Board_Support.Initialize_Board;
Time.Initialize_Timers;
-- Initialize internal queues and the environment task
Protection.Enter_Kernel;
-- The environment thread executes the main procedure of the program
Initialize_Thread
(Environment_Thread, Null_Address, Null_Address,
Main_Priority, Main_CPU,
Top_Of_Environment_Stack'Address,
Bottom_Of_Environment_Stack'Address);
Queues.Running_Thread_Table (Main_CPU) := Environment_Thread;
-- The tasking executive is initialized
Initialized := True;
Protection.Leave_Kernel;
end Initialize;
----------------------
-- Initialize_Slave --
----------------------
procedure Initialize_Slave
(Idle_Thread : Thread_Id;
Idle_Priority : Integer;
Stack_Address : System.Address;
Stack_Size : System.Storage_Elements.Storage_Offset)
is
CPU_Id : constant System.Multiprocessors.CPU := Current_CPU;
begin
Initialize_Thread
(Idle_Thread, Null_Address, Null_Address,
Idle_Priority, CPU_Id,
Stack_Address + Stack_Size, Stack_Address);
Queues.Running_Thread_Table (CPU_Id) := Idle_Thread;
end Initialize_Slave;
--------------
-- Set_ATCB --
--------------
procedure Set_ATCB (Id : Thread_Id; ATCB : System.Address) is
begin
-- Set_ATCB is only called in the initialization of the task
Id.ATCB := ATCB;
end Set_ATCB;
------------------
-- Set_Priority --
------------------
procedure Set_Priority (Priority : Integer) is
begin
Protection.Enter_Kernel;
-- The Ravenscar profile does not allow dynamic priority changes. Tasks
-- change their priority only when they inherit the ceiling priority of
-- a PO (Ceiling Locking policy). Hence, the task must be running when
-- changing the priority. It is not possible to change the priority of
-- another thread within the Ravenscar profile, so that is why
-- Running_Thread is used.
-- Priority changes are only possible as a result of inheriting the
-- ceiling priority of a protected object. Hence, it can never be set
-- a priority which is lower than the base priority of the thread.
pragma Assert
(Queues.Running_Thread /= Null_Thread_Id
and then Priority >= Queues.Running_Thread.Base_Priority);
Queues.Change_Priority (Queues.Running_Thread, Priority);
Protection.Leave_Kernel;
end Set_Priority;
-----------
-- Sleep --
-----------
procedure Sleep is
Self_Id : constant Thread_Id := Queues.Running_Thread;
begin
Protection.Enter_Kernel;
-- It can only suspend if it is executing
pragma Assert
(Self_Id /= Null_Thread_Id and then Self_Id.State = Runnable);
if Self_Id.Wakeup_Signaled then
-- Another thread has already executed a Wakeup on this thread so
-- that we just consume the token and continue execution. It means
-- that just before this call to Sleep the task has been preempted
-- by the task that is awaking it. Hence the Sleep/Wakeup calls do
-- not happen in the expected order, and we use the Wakeup_Signaled
-- to flag this event so it is not lost.
-- The situation is the following:
-- 1) a task A is going to wait in an entry for a barrier
-- 2) task A releases the lock associated to the protected object
-- 3) task A calls Sleep to suspend itself
-- 4) a task B opens the barrier and awakes task A (calls Wakeup)
-- This is the expected sequence of events, but 4) may happen
-- before 3) because task A decreases its priority in step 2) as a
-- consequence of releasing the lock (Ceiling_Locking). Hence, task
-- A may be preempted by task B in the window between releasing the
-- protected object and actually suspending itself, and the Wakeup
-- call by task B in 4) can happen before the Sleep call in 3).
Self_Id.Wakeup_Signaled := False;
else
-- Update status
Self_Id.State := Suspended;
-- Extract from the list of ready threads
Queues.Extract (Self_Id);
-- The currently executing thread is now blocked, and it will leave
-- the CPU when executing the Leave_Kernel procedure.
end if;
Protection.Leave_Kernel;
-- Now the thread has been awaken again and it is executing
end Sleep;
-------------------
-- Thread_Create --
-------------------
procedure Thread_Create
(Id : Thread_Id;
Code : System.Address;
Arg : System.Address;
Priority : Integer;
Base_CPU : System.Multiprocessors.CPU_Range;
Stack_Address : System.Address;
Stack_Size : System.Storage_Elements.Storage_Offset)
is
begin
Protection.Enter_Kernel;
Initialize_Thread
(Id, Code, Arg, Priority, Base_CPU,
((Stack_Address + Stack_Size) /
Standard'Maximum_Alignment) * Standard'Maximum_Alignment,
Stack_Address);
Protection.Leave_Kernel;
end Thread_Create;
-----------------
-- Thread_Self --
-----------------
function Thread_Self return Thread_Id is
begin
-- Return the thread that is currently executing
return Queues.Running_Thread;
end Thread_Self;
------------
-- Wakeup --
------------
procedure Wakeup (Id : Thread_Id) is
begin
Protection.Enter_Kernel;
if Id.State = Suspended then
-- The thread is already waiting so that we awake it
-- Update status
Id.State := Runnable;
-- Insert the thread at the tail of its active priority so that the
-- thread will resume execution.
Queues.Insert (Id);
else
-- The thread is not yet waiting so that we just signal that the
-- Wakeup command has been executed. We are waking up a task that
-- is going to wait in an entry for a barrier, but before calling
-- Sleep it has been preempted by the task awaking it.
Id.Wakeup_Signaled := True;
end if;
pragma Assert (Id.State = Runnable);
Protection.Leave_Kernel;
end Wakeup;
end System.BB.Threads;
| 32.584821 | 78 | 0.56494 |
fbc1469a673ce36d1334246959470d0d3cdffa72 | 3,797 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-comver.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-comver.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-comver.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . C O M P I L E R _ V E R S I O N --
-- --
-- B o d y --
-- --
-- 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 a routine for obtaining the version number of the
-- GNAT compiler used to compile the program. It relies on the generated
-- constant in the binder generated package that records this information.
package body GNAT.Compiler_Version is
Ver_Len_Max : constant := 256;
-- This is logically a reference to Gnatvsn.Ver_Len_Max but we cannot
-- import this directly since run-time units cannot WITH compiler units.
Ver_Prefix : constant String := "GNAT Version: ";
-- This is logically a reference to Gnatvsn.Ver_Prefix but we cannot
-- import this directly since run-time units cannot WITH compiler units.
GNAT_Version : constant String (1 .. Ver_Len_Max + Ver_Prefix'Length);
pragma Import (C, GNAT_Version, "__gnat_version");
-------------
-- Version --
-------------
function Version return String is
begin
-- Search for terminating right paren or NUL ending the string
for J in Ver_Prefix'Length + 1 .. GNAT_Version'Last loop
if GNAT_Version (J) = ')' then
return GNAT_Version (Ver_Prefix'Length + 1 .. J);
end if;
if GNAT_Version (J) = Character'Val (0) then
return GNAT_Version (Ver_Prefix'Length + 1 .. J - 1);
end if;
end loop;
-- This should not happen (no right paren or NUL found)
return GNAT_Version;
end Version;
end GNAT.Compiler_Version;
| 52.013699 | 78 | 0.476429 |
23a48158092e577c57e00b8c2ed9cd342f300c7e | 11,169 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-exctab.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-exctab.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-exctab.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . E X C E P T I O N _ T A B L E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1996-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. --
-- --
------------------------------------------------------------------------------
pragma Compiler_Unit_Warning;
with System.Soft_Links; use System.Soft_Links;
package body System.Exception_Table is
use System.Standard_Library;
type Hash_Val is mod 2 ** 8;
subtype Hash_Idx is Hash_Val range 1 .. 37;
HTable : array (Hash_Idx) of aliased Exception_Data_Ptr;
-- Actual hash table containing all registered exceptions
--
-- The table is very small and the hash function weak, as looking up
-- registered exceptions is rare and minimizing space and time overhead
-- of registration is more important. In addition, it is expected that the
-- exceptions that need to be looked up are registered dynamically, and
-- therefore will be at the begin of the hash chains.
--
-- The table differs from System.HTable.Static_HTable in that the final
-- element of each chain is not marked by null, but by a pointer to self.
-- This way it is possible to defend against the same entry being inserted
-- twice, without having to do a lookup which is relatively expensive for
-- programs with large number
--
-- All non-local subprograms use the global Task_Lock to protect against
-- concurrent use of the exception table. This is needed as local
-- exceptions may be declared concurrently with those declared at the
-- library level.
-- Local Subprograms
generic
with procedure Process (T : Exception_Data_Ptr; More : out Boolean);
procedure Iterate;
-- Iterate over all
function Lookup (Name : String) return Exception_Data_Ptr;
-- Find and return the Exception_Data of the exception with the given Name
-- (which must be in all uppercase), or null if none was registered.
procedure Register (Item : Exception_Data_Ptr);
-- Register an exception with the given Exception_Data in the table.
function Has_Name (Item : Exception_Data_Ptr; Name : String) return Boolean;
-- Return True iff Item.Full_Name and Name are equal. Both names are
-- assumed to be in all uppercase and end with ASCII.NUL.
function Hash (S : String) return Hash_Idx;
-- Return the index in the hash table for S, which is assumed to be all
-- uppercase and end with ASCII.NUL.
--------------
-- Has_Name --
--------------
function Has_Name (Item : Exception_Data_Ptr; Name : String) return Boolean
is
S : constant Big_String_Ptr := To_Ptr (Item.Full_Name);
J : Integer := S'First;
begin
for K in Name'Range loop
-- Note that as both items are terminated with ASCII.NUL, the
-- comparison below must fail for strings of different lengths.
if S (J) /= Name (K) then
return False;
end if;
J := J + 1;
end loop;
return True;
end Has_Name;
------------
-- Lookup --
------------
function Lookup (Name : String) return Exception_Data_Ptr is
Prev : Exception_Data_Ptr;
Curr : Exception_Data_Ptr;
begin
Curr := HTable (Hash (Name));
Prev := null;
while Curr /= Prev loop
if Has_Name (Curr, Name) then
return Curr;
end if;
Prev := Curr;
Curr := Curr.HTable_Ptr;
end loop;
return null;
end Lookup;
----------
-- Hash --
----------
function Hash (S : String) return Hash_Idx is
Hash : Hash_Val := 0;
begin
for J in S'Range loop
exit when S (J) = ASCII.NUL;
Hash := Hash xor Character'Pos (S (J));
end loop;
return Hash_Idx'First + Hash mod (Hash_Idx'Last - Hash_Idx'First + 1);
end Hash;
-------------
-- Iterate --
-------------
procedure Iterate is
More : Boolean;
Prev, Curr : Exception_Data_Ptr;
begin
Outer : for Idx in HTable'Range loop
Prev := null;
Curr := HTable (Idx);
while Curr /= Prev loop
Process (Curr, More);
exit Outer when not More;
Prev := Curr;
Curr := Curr.HTable_Ptr;
end loop;
end loop Outer;
end Iterate;
--------------
-- Register --
--------------
procedure Register (Item : Exception_Data_Ptr) is
begin
if Item.HTable_Ptr = null then
Prepend_To_Chain : declare
Chain : Exception_Data_Ptr
renames HTable (Hash (To_Ptr (Item.Full_Name).all));
begin
if Chain = null then
Item.HTable_Ptr := Item;
else
Item.HTable_Ptr := Chain;
end if;
Chain := Item;
end Prepend_To_Chain;
end if;
end Register;
-------------------------------
-- Get_Registered_Exceptions --
-------------------------------
procedure Get_Registered_Exceptions
(List : out Exception_Data_Array;
Last : out Integer)
is
procedure Get_One (Item : Exception_Data_Ptr; More : out Boolean);
-- Add Item to List (List'First .. Last) by first incrementing Last
-- and storing Item in List (Last). Last should be in List'First - 1
-- and List'Last.
procedure Get_All is new Iterate (Get_One);
-- Store all registered exceptions in List, updating Last
-------------
-- Get_One --
-------------
procedure Get_One (Item : Exception_Data_Ptr; More : out Boolean) is
begin
if Last < List'Last then
Last := Last + 1;
List (Last) := Item;
More := True;
else
More := False;
end if;
end Get_One;
begin
-- In this routine the invariant is that List (List'First .. Last)
-- contains the registered exceptions retrieved so far.
Last := List'First - 1;
Lock_Task.all;
Get_All;
Unlock_Task.all;
end Get_Registered_Exceptions;
------------------------
-- Internal_Exception --
------------------------
function Internal_Exception
(X : String;
Create_If_Not_Exist : Boolean := True) return Exception_Data_Ptr
is
-- If X was not yet registered and Create_if_Not_Exist is True,
-- dynamically allocate and register a new exception.
type String_Ptr is access all String;
Dyn_Copy : String_Ptr;
Copy : aliased String (X'First .. X'Last + 1);
Result : Exception_Data_Ptr;
begin
Lock_Task.all;
Copy (X'Range) := X;
Copy (Copy'Last) := ASCII.NUL;
Result := Lookup (Copy);
-- If unknown exception, create it on the heap. This is a legitimate
-- situation in the distributed case when an exception is defined
-- only in a partition
if Result = null and then Create_If_Not_Exist then
Dyn_Copy := new String'(Copy);
Result :=
new Exception_Data'
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Copy'Length,
Full_Name => Dyn_Copy.all'Address,
HTable_Ptr => null,
Foreign_Data => Null_Address,
Raise_Hook => null);
Register (Result);
end if;
Unlock_Task.all;
return Result;
end Internal_Exception;
------------------------
-- Register_Exception --
------------------------
procedure Register_Exception (X : Exception_Data_Ptr) is
begin
Lock_Task.all;
Register (X);
Unlock_Task.all;
end Register_Exception;
---------------------------------
-- Registered_Exceptions_Count --
---------------------------------
function Registered_Exceptions_Count return Natural is
Count : Natural := 0;
procedure Count_Item (Item : Exception_Data_Ptr; More : out Boolean);
-- Update Count for given Item
procedure Count_Item (Item : Exception_Data_Ptr; More : out Boolean) is
pragma Unreferenced (Item);
begin
Count := Count + 1;
More := Count < Natural'Last;
end Count_Item;
procedure Count_All is new Iterate (Count_Item);
begin
Lock_Task.all;
Count_All;
Unlock_Task.all;
return Count;
end Registered_Exceptions_Count;
begin
-- Register the standard exceptions at elaboration time
-- We don't need to use the locking version here as the elaboration
-- will not be concurrent and no tasks can call any subprograms of this
-- unit before it has been elaborated.
Register (Abort_Signal_Def'Access);
Register (Tasking_Error_Def'Access);
Register (Storage_Error_Def'Access);
Register (Program_Error_Def'Access);
Register (Numeric_Error_Def'Access);
Register (Constraint_Error_Def'Access);
end System.Exception_Table;
| 32.85 | 79 | 0.542931 |
df531e99b6d8b9154388882323f7ee08ad8da09e | 9,949 | ads | Ada | arch/ARM/cortex_m/src/svd/cortex_m_svd-debug.ads | WickedShell/Ada_Drivers_Library | 391866ad37a599347df40a4dbb3bf0721bedabea | [
"BSD-3-Clause"
] | 6 | 2017-05-28T04:37:11.000Z | 2020-11-22T11:26:19.000Z | arch/ARM/cortex_m/src/svd/cortex_m_svd-debug.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2019-08-30T10:57:40.000Z | 2020-02-11T21:34:14.000Z | arch/ARM/cortex_m/src/svd/cortex_m_svd-debug.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2017-02-07T19:42:02.000Z | 2020-11-22T11:26:20.000Z | -- This spec has been automatically generated from cortex_m-debug.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
with HAL;
with System;
package Cortex_M_SVD.Debug is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- Debug Fault Status Register
type DFSR_Register is record
HALTED : Boolean := False;
-- BKPT instruction executed or breakpoint match in FPB.
BKPT : Boolean := False;
-- Data Watchpoint and Trace trap. Indicates that the core halted due to
-- at least one DWT trap event.
DWTTRAP : Boolean := False;
-- Vector catch triggered. Corresponding FSR will contain the primary
-- cause of the exception.
VCATCH : Boolean := False;
-- An asynchronous exception generated due to the assertion of EDBGRQ.
EXTERNAL : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DFSR_Register use record
HALTED at 0 range 0 .. 0;
BKPT at 0 range 1 .. 1;
DWTTRAP at 0 range 2 .. 2;
VCATCH at 0 range 3 .. 3;
EXTERNAL at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
-------------------------------
-- DHCSR cluster's Registers --
-------------------------------
type ReadDHCSR_Register is record
-- Read-only.
C_DEBUGGEN : Boolean;
-- Read-only.
C_HALT : Boolean;
-- Read-only.
C_STEP : Boolean;
-- Read-only.
C_MASKINTS : Boolean;
-- unspecified
Reserved_4_4 : HAL.Bit;
-- Read-only.
C_SNAPSTALL : Boolean;
-- unspecified
Reserved_6_15 : HAL.UInt10;
-- Read-only.
S_REGRDY : Boolean;
-- Read-only.
S_HALT : Boolean;
-- Read-only.
S_SLEEP : Boolean;
-- Read-only.
S_LOCKUP : Boolean;
-- unspecified
Reserved_20_23 : HAL.UInt4;
-- Read-only.
S_RETIRE_ST : Boolean;
-- Read-only.
S_RESET_ST : Boolean;
-- unspecified
Reserved_26_31 : HAL.UInt6;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ReadDHCSR_Register use record
C_DEBUGGEN at 0 range 0 .. 0;
C_HALT at 0 range 1 .. 1;
C_STEP at 0 range 2 .. 2;
C_MASKINTS at 0 range 3 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
C_SNAPSTALL at 0 range 5 .. 5;
Reserved_6_15 at 0 range 6 .. 15;
S_REGRDY at 0 range 16 .. 16;
S_HALT at 0 range 17 .. 17;
S_SLEEP at 0 range 18 .. 18;
S_LOCKUP at 0 range 19 .. 19;
Reserved_20_23 at 0 range 20 .. 23;
S_RETIRE_ST at 0 range 24 .. 24;
S_RESET_ST at 0 range 25 .. 25;
Reserved_26_31 at 0 range 26 .. 31;
end record;
subtype WriteDHCSR_S_RESET_ST_Field is HAL.Short;
type WriteDHCSR_Register is record
-- Write-only.
C_DEBUGGEN : Boolean := False;
-- Write-only.
C_HALT : Boolean := False;
-- Write-only.
C_STEP : Boolean := False;
-- Write-only.
C_MASKINTS : Boolean := False;
-- unspecified
Reserved_4_4 : HAL.Bit := 16#0#;
-- Write-only.
C_SNAPSTALL : Boolean := False;
-- unspecified
Reserved_6_15 : HAL.UInt10 := 16#0#;
-- Write-only. Debug Key. The value 0xA05F must be written to enable
-- write accesses to bits [15:0], otherwise the write access will be
-- ignored. Read behavior of bits [31:16] is as listed below.
S_RESET_ST : WriteDHCSR_S_RESET_ST_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for WriteDHCSR_Register use record
C_DEBUGGEN at 0 range 0 .. 0;
C_HALT at 0 range 1 .. 1;
C_STEP at 0 range 2 .. 2;
C_MASKINTS at 0 range 3 .. 3;
Reserved_4_4 at 0 range 4 .. 4;
C_SNAPSTALL at 0 range 5 .. 5;
Reserved_6_15 at 0 range 6 .. 15;
S_RESET_ST at 0 range 16 .. 31;
end record;
type DHCSR_Disc is
(
Mode_1,
Mode_2);
-- Debug Halting Control and Status Register
type DHCSR_Cluster
(Discriminent : DHCSR_Disc := Mode_1)
is record
case Discriminent is
when Mode_1 =>
Read : ReadDHCSR_Register;
when Mode_2 =>
Write : WriteDHCSR_Register;
end case;
end record
with Unchecked_Union, Volatile, Size => 32;
for DHCSR_Cluster use record
Read at 0 range 0 .. 31;
Write at 0 range 0 .. 31;
end record;
type DCRSR_HALTED_Field is
(
Register_0,
Register_1,
Register_2,
Register_3,
Register_4,
Register_5,
Register_6,
Register_7,
Register_8,
Register_9,
Register_10,
Register_11,
Register_12,
Current_Sp,
Link_Rregister,
Debug_Return_Address,
XPsr,
Msp,
Psp,
Control_Faultmask_Basepri_Primask)
with Size => 5;
for DCRSR_HALTED_Field use
(Register_0 => 0,
Register_1 => 1,
Register_2 => 2,
Register_3 => 3,
Register_4 => 4,
Register_5 => 5,
Register_6 => 6,
Register_7 => 7,
Register_8 => 8,
Register_9 => 9,
Register_10 => 10,
Register_11 => 11,
Register_12 => 12,
Current_Sp => 13,
Link_Rregister => 14,
Debug_Return_Address => 15,
XPsr => 16,
Msp => 17,
Psp => 18,
Control_Faultmask_Basepri_Primask => 19);
type DCRSR_REGWnR_Field is
(
Read,
Write)
with Size => 1;
for DCRSR_REGWnR_Field use
(Read => 0,
Write => 1);
-- Debug Core Register Selector Register: The DCRSR write-only register
-- generates a handshake to the core to transfer the selected register
-- to/from the DCRDR. The DHCSR S_REGRDY bit is cleared when the DCRSR is
-- written, and remains clear until the core transaction completes. This
-- register is only accessible from Debug state.
type DCRSR_Register is record
-- Write-only.
HALTED : DCRSR_HALTED_Field := Cortex_M_SVD.Debug.Register_0;
-- unspecified
Reserved_5_15 : HAL.UInt11 := 16#0#;
-- Write-only.
REGWnR : DCRSR_REGWnR_Field := Cortex_M_SVD.Debug.Read;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DCRSR_Register use record
HALTED at 0 range 0 .. 4;
Reserved_5_15 at 0 range 5 .. 15;
REGWnR at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- Debug Exception and Monitor Control Register
type DEMCR_Register is record
VC_CORERESET : Boolean := False;
-- unspecified
Reserved_1_3 : HAL.UInt3 := 16#0#;
VC_MMERR : Boolean := False;
VC_NOCPERR : Boolean := False;
VC_CHKERR : Boolean := False;
VC_STATERR : Boolean := False;
VC_BUSERR : Boolean := False;
VC_INTERR : Boolean := False;
VC_HARDERR : Boolean := False;
-- unspecified
Reserved_11_15 : HAL.UInt5 := 16#0#;
MON_EN : Boolean := False;
MON_PEND : Boolean := False;
MON_STEP : Boolean := False;
MON_REQ : Boolean := False;
-- unspecified
Reserved_20_23 : HAL.UInt4 := 16#0#;
TRCENA : Boolean := False;
-- unspecified
Reserved_25_31 : HAL.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DEMCR_Register use record
VC_CORERESET at 0 range 0 .. 0;
Reserved_1_3 at 0 range 1 .. 3;
VC_MMERR at 0 range 4 .. 4;
VC_NOCPERR at 0 range 5 .. 5;
VC_CHKERR at 0 range 6 .. 6;
VC_STATERR at 0 range 7 .. 7;
VC_BUSERR at 0 range 8 .. 8;
VC_INTERR at 0 range 9 .. 9;
VC_HARDERR at 0 range 10 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
MON_EN at 0 range 16 .. 16;
MON_PEND at 0 range 17 .. 17;
MON_STEP at 0 range 18 .. 18;
MON_REQ at 0 range 19 .. 19;
Reserved_20_23 at 0 range 20 .. 23;
TRCENA at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
type Debug_Peripheral is record
-- Debug Fault Status Register
DFSR : DFSR_Register;
-- Debug Halting Control and Status Register
DHCSR : DHCSR_Cluster;
-- Debug Core Register Selector Register: The DCRSR write-only register
-- generates a handshake to the core to transfer the selected register
-- to/from the DCRDR. The DHCSR S_REGRDY bit is cleared when the DCRSR
-- is written, and remains clear until the core transaction completes.
-- This register is only accessible from Debug state.
DCRSR : DCRSR_Register;
-- Debug Core Register Data Register
DCRDR : HAL.Word;
-- Debug Exception and Monitor Control Register
DEMCR : DEMCR_Register;
end record
with Volatile;
for Debug_Peripheral use record
DFSR at 48 range 0 .. 31;
DHCSR at 240 range 0 .. 31;
DCRSR at 244 range 0 .. 31;
DCRDR at 248 range 0 .. 31;
DEMCR at 252 range 0 .. 31;
end record;
Debug_Periph : aliased Debug_Peripheral
with Import, Address => Debug_Base;
end Cortex_M_SVD.Debug;
| 31.090625 | 79 | 0.572218 |
fbe2168fa50a519017584219435e705e79ef29dc | 8,097 | adb | Ada | src/common/keccak-generic_parallel_cshake.adb | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 26 | 2015-09-20T17:52:38.000Z | 2021-07-29T21:47:04.000Z | src/common/keccak-generic_parallel_cshake.adb | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 3 | 2019-03-12T16:01:36.000Z | 2020-05-23T13:06:43.000Z | src/common/keccak-generic_parallel_cshake.adb | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 2 | 2019-04-15T18:02:19.000Z | 2020-11-22T11:22:18.000Z | -------------------------------------------------------------------------------
-- Copyright (c) 2019, Daniel King
-- 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.
-- * The name of the copyright holder may not 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 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 Keccak.Util; use Keccak.Util;
package body Keccak.Generic_Parallel_CSHAKE
is
---------------------------
-- Process_Full_Blocks --
---------------------------
procedure Process_Full_Blocks
(Ctx : in out Context;
Block : in out Types.Byte_Array;
Input : in Types.Byte_Array;
Block_Offset : in out Natural)
with Global => null,
Pre => (Block_Offset < Block'Length
and Block'First = 0
and Block'Length = Rate / 8
and State_Of (Ctx) = Updating),
Post => (Block_Offset < Block'Length
and State_Of (Ctx) = Updating);
---------------------------
-- Process_Full_Blocks --
---------------------------
procedure Process_Full_Blocks
(Ctx : in out Context;
Block : in out Types.Byte_Array;
Input : in Types.Byte_Array;
Block_Offset : in out Natural)
is
use type XOF.States;
Block_Length : constant Natural := Block'Length - Block_Offset;
Input_Remaining : Natural := Input'Length;
Input_Offset : Natural := 0;
Length : Natural;
Num_Full_Blocks : Natural;
Pos : Types.Index_Number;
begin
if Block_Offset > 0 then
-- Merge first bytes of Input with the last bytes currently in
-- the block.
if Input_Remaining < Block_Length then
-- Not enough for a full block.
Block (Block_Offset .. Block_Offset + Input_Remaining - 1) :=
Input (Input'First .. Input'First + Input_Remaining - 1);
Input_Offset := Input'Length;
Block_Offset := Block_Offset + Input_Remaining;
Input_Remaining := 0;
else
-- We have enough for a full block
Block (Block_Offset .. Block'Last) :=
Input (Input'First .. Input'First + Block_Length - 1);
XOF.Update_All (Ctx.XOF_Ctx, Block);
Input_Offset := Input_Offset + Block_Length;
Input_Remaining := Input_Remaining - Block_Length;
Block_Offset := 0;
end if;
end if;
pragma Assert_And_Cut
(Input_Offset + Input_Remaining = Input'Length
and Block_Offset < Block'Length
and Block'Length = Rate / 8
and State_Of (Ctx) = Updating
and XOF.State_Of (Ctx.XOF_Ctx) = XOF.Updating
and (if Input_Remaining > 0 then Block_Offset = 0));
-- Now process as many full blocks from Input as we can.
Num_Full_Blocks := Input_Remaining / Block'Length;
if Num_Full_Blocks > 0 then
Pos := Input'First + Input_Offset;
Length := Num_Full_Blocks * Block'Length;
XOF.Update_All (Ctx.XOF_Ctx, Input (Pos .. Pos + Length - 1));
Input_Offset := Input_Offset + Length;
Input_Remaining := Input_Remaining - Length;
end if;
pragma Assert_And_Cut
(Input_Offset + Input_Remaining = Input'Length
and Block_Offset < Block'Length
and Block'Length = Rate / 8
and State_Of (Ctx) = Updating
and (if Input_Remaining > 0 then Block_Offset = 0)
and Input_Remaining < Block'Length);
-- Store any leftover bytes in the block
if Input_Remaining > 0 then
Pos := Input'First + Input_Offset;
Block (0 .. Input_Remaining - 1) := Input (Pos .. Input'Last);
Block_Offset := Input_Remaining;
end if;
end Process_Full_Blocks;
------------
-- Init --
------------
procedure Init (Ctx : out Context;
Customization : in String;
Function_Name : in String)
is
Rate_Bytes : constant Positive := Rate / 8;
Block : Types.Byte_Array (0 .. Rate_Bytes - 1) := (others => 0);
Block_Offset : Natural;
begin
XOF.Init (Ctx.XOF_Ctx);
-- We need to make sure that the data length for each call to
-- XOF.Update_Separate is a multiple of the rate in order to keep the XOF
-- in the "Updating" state. This requires packing the encoded
-- rate, customization string, and function name into a block which is
-- the length of the rate.
--
-- +------+---------------+---------------+
-- | rate | Function_Name | Customization |
-- +------+---------------+---------------+
-- |<-------------->|
-- Rate
Block_Offset := 0;
Process_Full_Blocks
(Ctx => Ctx,
Block => Block,
Input => Left_Encode_NIST (Rate_Bytes),
Block_Offset => Block_Offset);
Process_Full_Blocks
(Ctx => Ctx,
Block => Block,
Input => Left_Encode_NIST_Bit_Length (Function_Name'Length),
Block_Offset => Block_Offset);
Process_Full_Blocks
(Ctx => Ctx,
Block => Block,
Input => To_Byte_Array (Function_Name),
Block_Offset => Block_Offset);
Process_Full_Blocks
(Ctx => Ctx,
Block => Block,
Input => Left_Encode_NIST_Bit_Length (Customization'Length),
Block_Offset => Block_Offset);
Process_Full_Blocks
(Ctx => Ctx,
Block => Block,
Input => To_Byte_Array (Customization),
Block_Offset => Block_Offset);
if Block_Offset > 0 then
-- Need to add padding zeroes to leftover data
Block (Block_Offset .. Block'Last) := (others => 0);
XOF.Update_All (Ctx.XOF_Ctx, Block);
end if;
end Init;
-----------------------
-- Update_Separate --
-----------------------
procedure Update_Separate (Ctx : in out Context;
Data : in Types.Byte_Array)
is
begin
XOF.Update_Separate (Ctx.XOF_Ctx, Data);
end Update_Separate;
-----------------------
-- Extract_Separate --
-----------------------
procedure Extract_Separate (Ctx : in out Context;
Data : out Types.Byte_Array)
is
begin
XOF.Extract_Separate (Ctx.XOF_Ctx, Data);
end Extract_Separate;
end Keccak.Generic_Parallel_CSHAKE;
| 34.455319 | 80 | 0.56169 |
503420ce079942b7ae89a6e3f57e540045e939c9 | 582,297 | adb | Ada | honeybee_proj/HBD/.autopilot/db/checkAxis_2.sched.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | null | null | null | honeybee_proj/HBD/.autopilot/db/checkAxis_2.sched.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | null | null | null | honeybee_proj/HBD/.autopilot/db/checkAxis_2.sched.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | null | null | null | <?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>
| 28.092291 | 142 | 0.588339 |
fb0f3f26c789509c841582d91b4d1d7e8b86d4d2 | 3,284 | ads | Ada | source/oasis/program-elements-procedure_body_stubs.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-procedure_body_stubs.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-procedure_body_stubs.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Declarations;
with Program.Lexical_Elements;
with Program.Elements.Defining_Identifiers;
with Program.Elements.Parameter_Specifications;
with Program.Elements.Aspect_Specifications;
package Program.Elements.Procedure_Body_Stubs is
pragma Pure (Program.Elements.Procedure_Body_Stubs);
type Procedure_Body_Stub is
limited interface and Program.Elements.Declarations.Declaration;
type Procedure_Body_Stub_Access is access all Procedure_Body_Stub'Class
with Storage_Size => 0;
not overriding function Name
(Self : Procedure_Body_Stub)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access is abstract;
not overriding function Parameters
(Self : Procedure_Body_Stub)
return Program.Elements.Parameter_Specifications
.Parameter_Specification_Vector_Access is abstract;
not overriding function Aspects
(Self : Procedure_Body_Stub)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access is abstract;
not overriding function Has_Not (Self : Procedure_Body_Stub) return Boolean
is abstract;
not overriding function Has_Overriding
(Self : Procedure_Body_Stub)
return Boolean is abstract;
type Procedure_Body_Stub_Text is limited interface;
type Procedure_Body_Stub_Text_Access is
access all Procedure_Body_Stub_Text'Class with Storage_Size => 0;
not overriding function To_Procedure_Body_Stub_Text
(Self : aliased in out Procedure_Body_Stub)
return Procedure_Body_Stub_Text_Access is abstract;
not overriding function Not_Token
(Self : Procedure_Body_Stub_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Overriding_Token
(Self : Procedure_Body_Stub_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Procedure_Token
(Self : Procedure_Body_Stub_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Left_Bracket_Token
(Self : Procedure_Body_Stub_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Right_Bracket_Token
(Self : Procedure_Body_Stub_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Is_Token
(Self : Procedure_Body_Stub_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Separate_Token
(Self : Procedure_Body_Stub_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function With_Token
(Self : Procedure_Body_Stub_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Semicolon_Token
(Self : Procedure_Body_Stub_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Procedure_Body_Stubs;
| 34.568421 | 78 | 0.772838 |
cb6cea6d7a445828c3bd758b15929830f7a57beb | 5,521 | ads | Ada | source/amf/uml/amf-uml-stereotypes.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-stereotypes.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-stereotypes.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
-- A stereotype defines how an existing metaclass may be extended, and
-- enables the use of platform or domain specific terminology or notation in
-- place of, or in addition to, the ones used for the extended metaclass.
------------------------------------------------------------------------------
with AMF.UML.Classes;
limited with AMF.UML.Images.Collections;
limited with AMF.UML.Profiles;
package AMF.UML.Stereotypes is
pragma Preelaborate;
type UML_Stereotype is limited interface
and AMF.UML.Classes.UML_Class;
type UML_Stereotype_Access is
access all UML_Stereotype'Class;
for UML_Stereotype_Access'Storage_Size use 0;
not overriding function Get_Icon
(Self : not null access constant UML_Stereotype)
return AMF.UML.Images.Collections.Set_Of_UML_Image is abstract;
-- Getter of Stereotype::icon.
--
-- Stereotype can change the graphical appearance of the extended model
-- element by using attached icons. When this association is not null, it
-- references the location of the icon content to be displayed within
-- diagrams presenting the extended model elements.
not overriding function Get_Profile
(Self : not null access constant UML_Stereotype)
return AMF.UML.Profiles.UML_Profile_Access is abstract;
-- Getter of Stereotype::profile.
--
-- The profile that directly or indirectly contains this stereotype.
not overriding function Containing_Profile
(Self : not null access constant UML_Stereotype)
return AMF.UML.Profiles.UML_Profile_Access is abstract;
-- Operation Stereotype::containingProfile.
--
-- The query containingProfile returns the closest profile directly or
-- indirectly containing this stereotype.
not overriding function Profile
(Self : not null access constant UML_Stereotype)
return AMF.UML.Profiles.UML_Profile_Access is abstract;
-- Operation Stereotype::profile.
--
-- A stereotype must be contained, directly or indirectly, in a profile.
end AMF.UML.Stereotypes;
| 56.336735 | 78 | 0.508604 |
20c7e414e71fb95ca9d1216a54da1f2bbf9ac34d | 5,837 | adb | Ada | 3-mid/opengl/source/lean/text/private/opengl-glyphimpl-texture.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 3-mid/opengl/source/lean/text/private/opengl-glyphimpl-texture.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 3-mid/opengl/source/lean/text/private/opengl-glyphimpl-texture.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
openGL.Tasks,
openGL.Errors,
GL.Binding,
GL.Pointers,
freetype_c.Binding,
freetype_c.FT_Bitmap,
interfaces.C;
package body openGL.GlyphImpl.texture
is
-----------
-- Globals
--
activeTextureID : openGL.texture.texture_Name; -- TODO: Check C source for how this is used.
pragma Unreferenced (activeTextureID);
--
-- The texture index of the currently active texture
--
-- We keep track of the currently active texture to try to reduce the
-- number of texture bind operations.
procedure ResetActiveTexture
is
begin
activeTextureID := 0;
end ResetActiveTexture;
---------
-- Forge
--
function new_GlyphImpl (glyth_Slot : in freetype_c.FT_GlyphSlot.item;
texture_Id : in openGL.Texture.texture_Name;
xOffset, yOffset : in Integer;
Width, Height : in Integer) return GlyphImpl.texture.view
is
use freetype_C,
freetype_C.Binding,
GL,
GL.Binding;
use type interfaces.C.unsigned,
GLint;
Self : constant GlyphImpl.texture.view := new GlyphImpl.texture.item;
begin
Tasks.check;
Self.define (glyth_Slot);
Self.destWidth := 0;
Self.destHeight := 0;
Self.glTextureID := texture_Id;
Self.Err := FT_Render_Glyph (glyth_Slot,
FT_RENDER_MODE_NORMAL);
if Self.Err /= no_Error
then
raise openGL.Error with "FT_Render_Glyph failed with error code: " & Self.Err'Image;
end if;
if FT_GlyphSlot_Get_Format (glyth_Slot) /= get_FT_GLYPH_FORMAT_BITMAP
then
raise openGL.Error with "Glyph is not a bitmap format.";
end if;
declare
use GL.Pointers;
Bitmap : constant freetype_C.FT_Bitmap.item := FT_GlyphSlot_Get_Bitmap (glyth_Slot);
begin
Self.destWidth := Bitmap.Width;
Self.destHeight := Bitmap.Rows;
if Self.destWidth /= 0
and then Self.destHeight /= 0
then
glPixelStorei (GL_UNPACK_ALIGNMENT, 1);
glBindTexture (GL_TEXTURE_2D, Self.glTextureID);
Errors.log;
glTexSubImage2D (GL_TEXTURE_2D, 0,
GLint (xOffset), GLint (yOffset),
Self.destWidth, Self.destHeight,
GL_ALPHA,
GL_UNSIGNED_BYTE,
to_GLvoid_access (Bitmap.Buffer));
Errors.log;
end if;
end;
-- 0
-- +----+
-- | |
-- | |
-- | |
-- +----+
-- 1
Self.UV (1).S := Real (xOffset) / Real (Width);
Self.UV (1).T := Real (yOffset) / Real (Height);
Self.UV (2).S := Real (GLint (xOffset) + Self.destWidth) / Real (Width);
Self.UV (2).T := Real (GLint (yOffset) + Self.destHeight) / Real (Height);
Self.Corner := (Real (FT_GlyphSlot_Get_bitmap_left (glyth_Slot)),
Real (FT_GlyphSlot_Get_bitmap_top (glyth_Slot)),
0.0);
declare
use openGL.Primitive;
the_Indices : constant openGL.Indices := (1, 2, 3, 4);
begin
Self.Primitive := Primitive.indexed.new_Primitive (triangle_Fan, the_Indices);
end;
return Self;
end new_GlyphImpl;
--------------
-- Attributes
--
function Quad (Self : in Item; Pen : in Vector_3) return Quad_t
is
dx : constant Real := Real'Floor (Pen (1) + Self.Corner (1));
dy : constant Real := Real'Floor (Pen (2) + Self.Corner (2));
the_Quad : aliased constant Quad_t := (NW => (Site => (dx,
dy,
0.0),
Coords => (S => Self.UV (1).S,
T => Self.UV (1).T)),
SW => (Site => (dx,
dy - Real (Self.destHeight),
0.0),
Coords => (S => Self.UV (1).S,
T => Self.UV (2).T)),
SE => (Site => (dx + Real (Self.destWidth),
dy - Real (Self.destHeight),
0.0),
Coords => (S => Self.UV (2).S,
T => Self.UV (2).T)),
NE => (Site => (dx + Real (Self.destWidth),
dy,
0.0),
Coords => (S => Self.UV (2).S,
T => Self.UV (1).T)),
Advance => Self.Advance);
begin
return the_Quad;
end Quad;
--------------
-- Operations
--
function renderImpl (Self : in Item; Pen : in Vector_3;
renderMode : in Integer) return Vector_3
is
pragma unreferenced (renderMode);
begin
return Self.Advance;
end renderImpl;
end openGL.GlyphImpl.Texture;
| 32.792135 | 99 | 0.428816 |
10e918771d2c8e71361b0b975f5f56ab60930a7e | 8,665 | adb | Ada | awa/src/awa-permissions.adb | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/src/awa-permissions.adb | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/src/awa-permissions.adb | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-permissions -- Permissions module
-- Copyright (C) 2011, 2012, 2013, 2014 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Log.Loggers;
with Util.Beans.Objects;
with Util.Serialize.Mappers.Record_Mapper;
with ADO.Schemas.Entities;
with ADO.Sessions.Entities;
with Security.Contexts;
with AWA.Services.Contexts;
with AWA.Permissions.Controllers;
package body AWA.Permissions is
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Permissions");
-- ------------------------------
-- Verify that the permission represented by <b>Permission</b> is granted.
-- ------------------------------
procedure Check (Permission : in Security.Permissions.Permission_Index) is
begin
if not (Security.Contexts.Has_Permission (Permission)) then
raise NO_PERMISSION;
end if;
end Check;
-- ------------------------------
-- Verify that the permission represented by <b>Permission</b> is granted to access the
-- database entity represented by <b>Entity</b>.
-- ------------------------------
procedure Check (Permission : in Security.Permissions.Permission_Index;
Entity : in ADO.Identifier) is
use type Security.Contexts.Security_Context_Access;
Context : constant Security.Contexts.Security_Context_Access := Security.Contexts.Current;
Perm : Entity_Permission (Permission);
begin
if Context = null then
Log.Debug ("Permission is refused because there is no security context");
raise NO_PERMISSION;
end if;
Perm.Entity := Entity;
if not Context.Has_Permission (Perm) then
Log.Debug ("Permission is refused by the security controller");
raise NO_PERMISSION;
end if;
end Check;
-- ------------------------------
-- Verify that the permission represented by <b>Permission</b> is granted to access the
-- database entity represented by <b>Entity</b>.
-- ------------------------------
procedure Check (Permission : in Security.Permissions.Permission_Index;
Entity : in ADO.Objects.Object_Ref'Class) is
begin
if Entity.Is_Null then
Log.Debug ("Permission is refused because the entity is null.");
raise NO_PERMISSION;
end if;
Check (Permission, ADO.Objects.Get_Value (Entity.Get_Key));
end Check;
type Controller_Config is record
Name : Util.Beans.Objects.Object;
SQL : Util.Beans.Objects.Object;
Entity : ADO.Entity_Type := 0;
Entities : Entity_Type_Array := (others => ADO.NO_ENTITY_TYPE);
Count : Natural := 0;
Manager : Entity_Policy_Access;
Session : ADO.Sessions.Session;
end record;
type Config_Fields is (FIELD_NAME, FIELD_ENTITY_TYPE, FIELD_ENTITY_PERMISSION, FIELD_SQL);
type Controller_Config_Access is access all Controller_Config;
procedure Set_Member (Into : in out Controller_Config;
Field : in Config_Fields;
Value : in Util.Beans.Objects.Object);
-- ------------------------------
-- Called while parsing the XML policy file when the <name>, <entity-type>, <sql> and
-- <entity-permission> XML entities are found. Create the new permission when the complete
-- permission definition has been parsed and save the permission in the security manager.
-- ------------------------------
procedure Set_Member (Into : in out Controller_Config;
Field : in Config_Fields;
Value : in Util.Beans.Objects.Object) is
use AWA.Permissions.Controllers;
use type ADO.Entity_Type;
begin
case Field is
when FIELD_NAME =>
Into.Name := Value;
when FIELD_SQL =>
Into.SQL := Value;
when FIELD_ENTITY_TYPE =>
declare
Name : constant String := Util.Beans.Objects.To_String (Value);
begin
if Into.Count = MAX_ENTITY_TYPES then
raise Util.Serialize.Mappers.Field_Error with "Too many entity types.";
end if;
Into.Count := Into.Count + 1;
Into.Entities (Into.Count)
:= ADO.Sessions.Entities.Find_Entity_Type (Into.Session, Name);
exception
when ADO.Schemas.Entities.No_Entity_Type =>
raise Util.Serialize.Mappers.Field_Error with "Invalid entity type: " & Name;
end;
when FIELD_ENTITY_PERMISSION =>
declare
Name : constant String := Util.Beans.Objects.To_String (Into.Name);
begin
if Into.Count = 0 then
raise Util.Serialize.Mappers.Field_Error
with "Permission '" & Name & "' ignored: missing entity type";
end if;
declare
SQL : constant String := Util.Beans.Objects.To_String (Into.SQL);
Perm : constant Entity_Controller_Access
:= new Entity_Controller '(Len => SQL'Length,
SQL => SQL,
Entities => Into.Entities);
begin
Into.Manager.Add_Permission (Name, Perm.all'Access);
Into.Count := 0;
Into.Entities := (others => ADO.NO_ENTITY_TYPE);
end;
end;
end case;
end Set_Member;
package Config_Mapper is
new Util.Serialize.Mappers.Record_Mapper (Element_Type => Controller_Config,
Element_Type_Access => Controller_Config_Access,
Fields => Config_Fields,
Set_Member => Set_Member);
Mapper : aliased Config_Mapper.Mapper;
-- ------------------------------
-- Setup the XML parser to read the <b>entity-permission</b> description. For example:
--
-- <entity-permission>
-- <name>create-workspace</name>
-- <entity-type>WORKSPACE</entity-type>
-- <sql>select acl.id from acl where ...</sql>
-- </entity-permission>
--
-- This defines a permission <b>create-workspace</b> that will be granted if the
-- SQL statement returns a non empty list.
-- ------------------------------
-- ------------------------------
-- Get the policy name.
-- ------------------------------
overriding
function Get_Name (From : in Entity_Policy) return String is
pragma Unreferenced (From);
begin
return NAME;
end Get_Name;
-- ------------------------------
-- Setup the XML parser to read the <b>policy</b> description.
-- ------------------------------
overriding
procedure Prepare_Config (Policy : in out Entity_Policy;
Reader : in out Util.Serialize.IO.XML.Parser) is
Config : constant Controller_Config_Access := new Controller_Config;
begin
Reader.Add_Mapping ("policy-rules", Mapper'Access);
Reader.Add_Mapping ("module", Mapper'Access);
Config.Manager := Policy'Unchecked_Access;
Config.Session := AWA.Services.Contexts.Get_Session (AWA.Services.Contexts.Current);
Config_Mapper.Set_Context (Reader, Config);
end Prepare_Config;
begin
Mapper.Add_Mapping ("entity-permission", FIELD_ENTITY_PERMISSION);
Mapper.Add_Mapping ("entity-permission/name", FIELD_NAME);
Mapper.Add_Mapping ("entity-permission/entity-type", FIELD_ENTITY_TYPE);
Mapper.Add_Mapping ("entity-permission/sql", FIELD_SQL);
end AWA.Permissions;
| 41.658654 | 97 | 0.566186 |
fb1df29b81e190fefb3e38e88253a4cb6027575b | 3,608 | ads | Ada | source/amf/uml/amf-uml-associations-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-associations-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-associations-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.UML.Associations.Hash is
new AMF.Elements.Generic_Hash (UML_Association, UML_Association_Access);
| 72.16 | 78 | 0.401885 |
fb0d9f508d08dcd58a8c36ecd8cb0e89efab171e | 2,060 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83f01d1.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83f01d1.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83f01d1.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C83F01D1.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.
--*
-- SEPARATELY COMPILED PACKAGE BODY FOR USE WITH C83F01D0M
-- RM 13 AUGUST 1980
-- RM 29 AUGUST 1980
SEPARATE (C83F01D0M)
PACKAGE BODY C83F01D1 IS
Y4 : INTEGER := 200 ;
PACKAGE BODY P IS
BEGIN
X1 := NOT X1 AND Y1 AND Y3 ;
Z := Z + T1 ;
Y2 := X2 * Y2 ;
Y4 := X2 * Y4 ;
-- ALL 4 ASSIGNMENTS ARE TESTED IN THE MAIN PROGRAM (RATHER
-- THAN HERE) TO PRECLUDE FALSE NEGATIVES (WHERE THE LACK
-- OF ELABORATION-TIME ERROR MESSAGES SIMPLY MEANS THAT THE
-- PACKAGE WAS NOT ELABORATED).
-- INCORRECT INTERPRETATIONS IN THE FIRST TWO
-- ASSIGNMENTS MANIFEST THEMSELVES AT
-- COMPILE TIME AS TYPE ERRORS.
END P ;
END C83F01D1 ;
| 35.517241 | 79 | 0.630583 |
5006ec516c9b73413896444eeaa39957800be2bc | 9,331 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-wwdenu.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-wwdenu.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-wwdenu.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- 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;
| 34.054745 | 78 | 0.491587 |
23cded06a29207980ece26a867dda35e379348ad | 657 | ada | Ada | examples/Ada/mspoller.ada | dcramer/zguide | a07fe97c4c597e6401b4281ae07c3a156590f4c6 | [
"Zed",
"X11",
"MIT"
] | 2 | 2015-09-24T19:53:04.000Z | 2015-11-06T10:22:53.000Z | examples/Ada/mspoller.ada | gaubert/zguide | e24c02481c47b129a37f261d1109140572f255f4 | [
"Zed",
"X11",
"MIT"
] | null | null | null | examples/Ada/mspoller.ada | gaubert/zguide | e24c02481c47b129a37f261d1109140572f255f4 | [
"Zed",
"X11",
"MIT"
] | null | null | null | No-one has translated the mspoller example into Ada yet. Be the first to create
mspoller in Ada and get one free Internet! If you're the author of the Ada
binding, this is a great way to get people to use 0MQ in Ada.
To submit a new translation email it to [email protected]. Please:
* Stick to identical functionality and naming used in examples so that readers
can easily compare languages.
* You MUST place your name as author in the examples so readers can contact you.
* You MUST state in the email that you license your code under the MIT/X11
license.
Subscribe to this list at http://lists.zeromq.org/mailman/listinfo/zeromq-dev.
| 46.928571 | 80 | 0.776256 |
1881eb3c08d970604e96442b3edd2521dc0c5f63 | 12,332 | ads | Ada | src/el-expressions-nodes.ads | jquorning/ada-el | b0b07da093ac6109286404cb54a62a9a93816610 | [
"Apache-2.0"
] | 6 | 2015-01-18T23:04:00.000Z | 2022-01-26T12:34:07.000Z | src/el-expressions-nodes.ads | jquorning/ada-el | b0b07da093ac6109286404cb54a62a9a93816610 | [
"Apache-2.0"
] | 1 | 2022-01-30T20:46:16.000Z | 2022-01-30T20:46:16.000Z | src/el-expressions-nodes.ads | jquorning/ada-el | b0b07da093ac6109286404cb54a62a9a93816610 | [
"Apache-2.0"
] | 2 | 2021-01-06T08:27:49.000Z | 2022-01-30T19:33:41.000Z | -----------------------------------------------------------------------
-- el-expressions-nodes -- Expression Nodes
-- Copyright (C) 2009, 2010, 2011, 2012, 2013, 2020, 2021 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
-- The 'ELNode' describes an expression that can later be evaluated
-- on an expression context. Expressions are parsed and translated
-- to a read-only tree.
with EL.Functions;
with Ada.Strings.Wide_Wide_Unbounded;
private with Ada.Strings.Unbounded;
with Util.Concurrent.Counters;
private package EL.Expressions.Nodes is
pragma Preelaborate;
use EL.Functions;
use Ada.Strings.Wide_Wide_Unbounded;
use Ada.Strings.Unbounded;
type Reduction;
type ELNode is abstract tagged limited record
Ref_Counter : Util.Concurrent.Counters.Counter;
end record;
type ELNode_Access is access all ELNode'Class;
type Reduction is record
Node : ELNode_Access;
Value : EL.Objects.Object;
end record;
-- Evaluate a node on a given context. If
function Get_Safe_Value (Expr : in ELNode;
Context : in ELContext'Class) return Object;
-- Evaluate a node on a given context.
function Get_Value (Expr : in ELNode;
Context : in ELContext'Class) return Object is abstract;
-- Reduce the expression by eliminating variables which are known
-- and computing constant expressions. Returns either a new expression
-- tree or a constant value.
function Reduce (Expr : access ELNode;
Context : in ELContext'Class) return Reduction is abstract;
-- Delete the expression tree (calls Delete (ELNode_Access) recursively).
procedure Delete (Node : in out ELNode) is abstract;
-- Delete the expression tree. Free the memory allocated by nodes
-- of the expression tree. Clears the node pointer.
procedure Delete (Node : in out ELNode_Access);
-- ------------------------------
-- Unary expression node
-- ------------------------------
type ELUnary is new ELNode with private;
type Unary_Node is (EL_VOID, EL_NOT, EL_MINUS, EL_EMPTY);
-- Evaluate a node on a given context.
overriding
function Get_Value (Expr : ELUnary;
Context : ELContext'Class) return Object;
-- Reduce the expression by eliminating variables which are known
-- and computing constant expressions. Returns either a new expression
-- tree or a constant value.
overriding
function Reduce (Expr : access ELUnary;
Context : in ELContext'Class) return Reduction;
overriding
procedure Delete (Node : in out ELUnary);
-- ------------------------------
-- Binary expression node
-- ------------------------------
type ELBinary is new ELNode with private;
type Binary_Node is (EL_EQ, EL_NE, EL_LE, EL_LT, EL_GE, EL_GT,
EL_ADD, EL_SUB, EL_MUL, EL_DIV, EL_MOD,
EL_AND, EL_OR, EL_LAND, EL_LOR, EL_CONCAT);
-- Evaluate a node on a given context.
overriding
function Get_Value (Expr : ELBinary;
Context : ELContext'Class) return Object;
-- Reduce the expression by eliminating variables which are known
-- and computing constant expressions. Returns either a new expression
-- tree or a constant value.
overriding
function Reduce (Expr : access ELBinary;
Context : in ELContext'Class) return Reduction;
overriding
procedure Delete (Node : in out ELBinary);
-- ------------------------------
-- Ternary expression node
-- ------------------------------
type ELTernary is new ELNode with private;
-- Evaluate a node on a given context.
overriding
function Get_Value (Expr : ELTernary;
Context : ELContext'Class) return Object;
-- Reduce the expression by eliminating variables which are known
-- and computing constant expressions. Returns either a new expression
-- tree or a constant value.
overriding
function Reduce (Expr : access ELTernary;
Context : in ELContext'Class) return Reduction;
overriding
procedure Delete (Node : in out ELTernary);
-- ------------------------------
-- Variable to be looked at in the expression context
-- ------------------------------
type ELVariable is new ELNode with private;
-- Evaluate a node on a given context.
overriding
function Get_Value (Expr : ELVariable;
Context : ELContext'Class) return Object;
-- Reduce the expression by eliminating variables which are known
-- and computing constant expressions. Returns either a new expression
-- tree or a constant value.
overriding
function Reduce (Expr : access ELVariable;
Context : in ELContext'Class) return Reduction;
overriding
procedure Delete (Node : in out ELVariable);
-- ------------------------------
-- Value property referring to a variable
-- ------------------------------
type ELValue (Len : Natural) is new ELNode with private;
type ELValue_Access is access all ELValue'Class;
-- Check if the target bean is a readonly bean.
function Is_Readonly (Node : in ELValue;
Context : in ELContext'Class) return Boolean;
-- Get the variable name.
function Get_Variable_Name (Node : in ELValue) return String;
-- Evaluate the node and return a method info with
-- the bean object and the method binding.
function Get_Method_Info (Node : in ELValue;
Context : in ELContext'Class) return Method_Info;
-- Evaluate a node on a given context.
overriding
function Get_Value (Expr : ELValue;
Context : ELContext'Class) return Object;
-- Evaluate the node and set the value on the associated bean.
-- Raises Invalid_Variable if the target object is not a bean.
-- Raises Invalid_Expression if the target bean is not writeable.
procedure Set_Value (Node : in ELValue;
Context : in ELContext'Class;
Value : in Objects.Object);
-- Reduce the expression by eliminating variables which are known
-- and computing constant expressions. Returns either a new expression
-- tree or a constant value.
overriding
function Reduce (Expr : access ELValue;
Context : in ELContext'Class) return Reduction;
overriding
procedure Delete (Node : in out ELValue);
-- ------------------------------
-- Literal object (integer, boolean, float, string)
-- ------------------------------
type ELObject is new ELNode with private;
-- Evaluate a node on a given context.
overriding
function Get_Value (Expr : ELObject;
Context : ELContext'Class) return Object;
-- Reduce the expression by eliminating variables which are known
-- and computing constant expressions. Returns either a new expression
-- tree or a constant value.
overriding
function Reduce (Expr : access ELObject;
Context : in ELContext'Class) return Reduction;
overriding
procedure Delete (Node : in out ELObject);
-- ------------------------------
-- Function call with up to 4 arguments
-- ------------------------------
type ELFunction is new ELNode with private;
-- Evaluate a node on a given context.
overriding
function Get_Value (Expr : ELFunction;
Context : ELContext'Class) return Object;
-- Reduce the expression by eliminating variables which are known
-- and computing constant expressions. Returns either a new expression
-- tree or a constant value.
overriding
function Reduce (Expr : access ELFunction;
Context : in ELContext'Class) return Reduction;
overriding
procedure Delete (Node : in out ELFunction);
-- Create constant nodes
function Create_Node (Value : Boolean) return ELNode_Access;
function Create_Node (Value : Long_Long_Integer) return ELNode_Access;
function Create_Node (Value : String) return ELNode_Access;
function Create_Node (Value : Wide_Wide_String) return ELNode_Access;
function Create_Node (Value : Long_Float) return ELNode_Access;
function Create_Node (Value : Unbounded_Wide_Wide_String) return ELNode_Access;
function Create_Variable (Name : in Wide_Wide_String) return ELNode_Access;
function Create_Value (Variable : in ELNode_Access;
Name : in Wide_Wide_String) return ELNode_Access;
-- Create unary expressions
function Create_Node (Of_Type : Unary_Node;
Expr : ELNode_Access) return ELNode_Access;
-- Create binary expressions
function Create_Node (Of_Type : Binary_Node;
Left : ELNode_Access;
Right : ELNode_Access) return ELNode_Access;
-- Create a ternary expression.
function Create_Node (Cond : ELNode_Access;
Left : ELNode_Access;
Right : ELNode_Access) return ELNode_Access;
-- Create a function call
function Create_Node (Func : EL.Functions.Function_Access;
Arg1 : ELNode_Access) return ELNode_Access;
-- Create a function call
function Create_Node (Func : EL.Functions.Function_Access;
Arg1 : ELNode_Access;
Arg2 : ELNode_Access) return ELNode_Access;
-- Create a function call
function Create_Node (Func : EL.Functions.Function_Access;
Arg1 : ELNode_Access;
Arg2 : ELNode_Access;
Arg3 : ELNode_Access) return ELNode_Access;
-- Create a function call
function Create_Node (Func : EL.Functions.Function_Access;
Arg1 : ELNode_Access;
Arg2 : ELNode_Access;
Arg3 : ELNode_Access;
Arg4 : ELNode_Access) return ELNode_Access;
private
type ELUnary is new ELNode with record
Kind : Unary_Node;
Node : ELNode_Access;
end record;
-- ------------------------------
-- Binary nodes
-- ------------------------------
type ELBinary is new ELNode with record
Kind : Binary_Node;
Left : ELNode_Access;
Right : ELNode_Access;
end record;
-- ------------------------------
-- Ternary expression
-- ------------------------------
type ELTernary is new ELNode with record
Cond : ELNode_Access;
Left : ELNode_Access;
Right : ELNode_Access;
end record;
-- #{bean.name} - Bean name, Bean property
-- #{bean[12]} - Bean name,
-- Variable to be looked at in the expression context
type ELVariable is new ELNode with record
Name : Unbounded_String;
end record;
type ELVariable_Access is access all ELVariable;
type ELValue (Len : Natural) is new ELNode with record
Variable : ELNode_Access;
Name : String (1 .. Len);
end record;
-- A literal object (integer, boolean, float, String)
type ELObject is new ELNode with record
Value : Object;
end record;
-- A function call with up to 4 arguments.
type ELFunction is new ELNode with record
Func : EL.Functions.Function_Access;
Arg1 : ELNode_Access;
Arg2 : ELNode_Access;
Arg3 : ELNode_Access;
Arg4 : ELNode_Access;
end record;
end EL.Expressions.Nodes;
| 36.702381 | 82 | 0.617742 |
236d05f8769b83bb037cdb85da1a266627d0a4ff | 3,823 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-tienau.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-tienau.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-tienau.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . E N U M E R A T I O N _ A U X --
-- --
-- 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 routines for Ada.Text_IO.Enumeration_IO
-- that are shared among separate instantiations of this package.
private package Ada.Text_IO.Enumeration_Aux is
procedure Get_Enum_Lit
(File : File_Type;
Buf : out String;
Buflen : out Natural);
-- Reads an enumeration literal value from the file, folds to upper case,
-- and stores the result in Buf, setting Buflen to the number of stored
-- characters (Buf has a lower bound of 1). If more than Buflen characters
-- are present in the literal, Data_Error is raised.
procedure Scan_Enum_Lit
(From : String;
Start : out Natural;
Stop : out Natural);
-- Scans an enumeration literal at the start of From, skipping any leading
-- spaces. Sets Start to the first character, Stop to the last character.
-- Raises End_Error if no enumeration literal is found.
procedure Put
(File : File_Type;
Item : String;
Width : Field;
Set : Type_Set);
-- Outputs the enumeration literal image stored in Item to the given File,
-- using the given Width and Set parameters (Item is always in upper case).
procedure Puts
(To : out String;
Item : String;
Set : Type_Set);
-- Stores the enumeration literal image stored in Item to the string To,
-- padding with trailing spaces if necessary to fill To. Set is used to
end Ada.Text_IO.Enumeration_Aux;
| 54.614286 | 79 | 0.490191 |
0ee7c37877cf6809be8c7802fd7b4f7bfbf66b9c | 1,695 | ads | Ada | resources/scripts/cert/googlect.ads | wisdark/amass | 50c43a5ac36808a55aca1df1b25f7214ee69c71b | [
"Apache-2.0"
] | 2 | 2021-10-03T00:38:40.000Z | 2021-11-08T12:53:32.000Z | resources/scripts/cert/googlect.ads | TheTexasGamer/Amass | 3d6ea1deef907eb0fa6e905a4aa2dd1119c0f42e | [
"Apache-2.0"
] | null | null | null | resources/scripts/cert/googlect.ads | TheTexasGamer/Amass | 3d6ea1deef907eb0fa6e905a4aa2dd1119c0f42e | [
"Apache-2.0"
] | null | null | null | -- Copyright 2020-2021 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
local url = require("url")
name = "GoogleCT"
type = "cert"
function start()
set_rate_limit(2)
end
function vertical(ctx, domain)
local token = ""
local hdrs={
Connection="close",
Referer="https://transparencyreport.google.com/https/certificates",
}
while(true) do
local page, err = request(ctx, {
['url']=build_url(domain, token),
headers=hdrs,
})
if (err ~= nil and err ~= "") then
log(ctx, "vertical request to service failed: " .. err)
break
end
send_names(ctx, page)
token = get_token(page)
if token == "" then
break
end
end
end
function build_url(domain, token)
local base = "https://www.google.com/transparencyreport/api/v3/httpsreport/ct/certsearch"
if token ~= "" then
base = base .. "/page"
end
local params = {
['domain']=domain,
['include_expired']="true",
['include_subdomains']="true",
}
if token ~= "" then
params['p'] = token
end
return base .. "?" .. url.build_query_string(params)
end
function get_token(content)
local pattern = "\\[(null|\"[a-zA-Z0-9]+\"),\"([a-zA-Z0-9]+)\",null,([0-9]+),([0-9]+)\\]"
local matches = submatch(content, pattern)
if (matches == nil or #matches == 0) then
return ""
end
local match = matches[1]
if (match ~= nil and #match == 5 and (match[4] < match[5])) then
return match[3]
end
return ""
end
| 23.541667 | 97 | 0.565782 |
fb3dfc0a49f231cf73017c87798ecc1f8aa14e25 | 1,306 | ads | Ada | awa/plugins/awa-mail/src/awa-mail.ads | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-mail/src/awa-mail.ads | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-mail/src/awa-mail.ads | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-mail -- Mail module
-- Copyright (C) 2011, 2017, 2018 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- 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.
-----------------------------------------------------------------------
-- = Mail Module =
-- The `AWA.Mail` module allows an application to format and send a mail
-- to users. This module does not define any web interface. It provides
-- a set of services and methods to send a mail when an event is
-- received. All this is done through configuration. The module
-- defines a set of specific ASF components to format and prepare the
-- email.
--
-- @include awa-mail-modules.ads
package AWA.Mail is
end AWA.Mail;
| 42.129032 | 76 | 0.644717 |
1c013465ca251ee715cd3f0ca3ffe1add4969b42 | 576 | ads | Ada | source/tabula-calendar.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | 1 | 2016-12-19T13:25:14.000Z | 2016-12-19T13:25:14.000Z | source/tabula-calendar.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | null | null | null | source/tabula-calendar.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | null | null | null | -- The Village of Vampire by YT, このソースコードはNYSLです
with Ada.Calendar.Time_Zones;
with Ada.Calendar.Formatting;
package Tabula.Calendar is
use type Ada.Calendar.Time_Zones.Time_Offset;
Null_Time : constant Ada.Calendar.Time;
Time_Offset : constant Ada.Calendar.Time_Zones.Time_Offset := 9 * 60;
-- GMT+9 日本
private
Null_Time : constant Ada.Calendar.Time :=
Ada.Calendar.Formatting.Time_Of (
Year => Ada.Calendar.Year_Number'First,
Month => Ada.Calendar.Month_Number'First,
Day => Ada.Calendar.Day_Number'First,
Time_Zone => 0);
end Tabula.Calendar;
| 26.181818 | 70 | 0.744792 |
4a99fe90f2339ba7b94dcd138780649e1e4f4cab | 633 | ads | Ada | tlsf/src/old/tlsf-allocator.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | 3 | 2020-02-21T15:42:14.000Z | 2020-04-08T09:42:32.000Z | tlsf/src/old/tlsf-allocator.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | null | null | null | tlsf/src/old/tlsf-allocator.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | 1 | 2020-02-21T15:29:26.000Z | 2020-02-21T15:29:26.000Z | with System.Storage_Elements;
package TLSF.Allocator is
package SSE renames System.Storage_Elements;
type Pool is limited private;
function Init_Pool (Addr : System.Address;
Len : SSE.Storage_Count)
return Pool;
function Memory_Allocate (Sz : SSE.Storage_Count;
P : Pool)
return System.Address;
procedure Memory_Free (Addr : System.Address;
P : Pool);
private
pragma SPARK_Mode (Off);
type Pool_Header;
type Pool is access all Pool_Header;
end TLSF.Allocator;
| 22.607143 | 54 | 0.581359 |
1c9c4d5e94eb88d801131d803d06ec1e163baede | 2,460 | ads | Ada | bb-runtimes/examples/monitor/net/nettftp.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/examples/monitor/net/nettftp.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/examples/monitor/net/nettftp.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT EXAMPLE --
-- --
-- Copyright (C) 2013, 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. --
-- --
-- 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 Interfaces; use Interfaces;
package Nettftp is
procedure Open;
procedure Read (Off : Unsigned_32;
Data : Address;
Count : in out Natural);
procedure Close;
end Nettftp;
| 61.5 | 78 | 0.461789 |
205102c38512004edb819535c007bc510e4f33d8 | 1,834 | adb | Ada | reuse/ada/errorsdr.adb | cocolab8/cocktail-src | f708f2a3fc5806e72c8109348a7e0c93304afdaf | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | reuse/ada/errorsdr.adb | cocolab8/cocktail-src | f708f2a3fc5806e72c8109348a7e0c93304afdaf | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | reuse/ada/errorsdr.adb | cocolab8/cocktail-src | f708f2a3fc5806e72c8109348a7e0c93304afdaf | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | -- $Id: ErrorsDrv.mi,v 1.0 1993/01/16 11:25:41 grosch Exp $
-- $Log: ErrorsDrv.mi,v $
-- Ich, Doktor Josef Grosch, Informatiker, Sept. 1994
with Text_Io, Sets, Strings, Idents, Position, Errors;
use Text_Io, Sets, Strings, Idents, Position, Errors;
procedure ErrorsDr is
Int : Integer;
Short : Integer range 0 .. 2 ** 16 - 1;
Long : Integer;
Real : Float;
Bool : Boolean;
Char : Character;
Str : tString;
Set : tSet;
Ident : tIdent;
procedure do_errors is
begin
MessageI ("Integer ", Errors.Error, NoPosition, Errors.cInteger , Int 'Address);
MessageI ("Short ", Errors.Error, NoPosition, Errors.cShort , Short 'Address);
MessageI ("Long ", Errors.Error, NoPosition, Errors.cLong , Long 'Address);
MessageI ("Real ", Errors.Error, NoPosition, Errors.cFloat , Real 'Address);
MessageI ("Boolean ", Errors.Error, NoPosition, Errors.cBoolean , Bool 'Address);
MessageI ("Character ", Errors.Error, NoPosition, Errors.cCharacter , Char 'Address);
MessageI ("String ", Errors.Error, NoPosition, Errors.cString , Str 'Address);
MessageI ("Set ", Errors.Error, NoPosition, Errors.cSet , Set 'Address);
MessageI ("Ident ", Errors.Error, NoPosition, Errors.cIdent , Ident 'Address);
end do_errors;
begin
Int := 1;
Short := 2;
Long := 3;
Real := 4.0;
Bool := False;
Char := 'a';
MakeSet (Set, 10); Include (Set, 5); Include (Set, 6);
To_tString ("def", Str); Ident := MakeIdent (Str);
do_errors; New_Line (Standard_Error);
StoreMessages (True);
do_errors;
WriteMessages (Standard_Error); New_Line (Standard_Error);
WriteMessages (Standard_Output); New_Line (Standard_Error);
StoreMessages (True);
WriteMessages (Standard_Output);
end ErrorsDr;
| 34.603774 | 90 | 0.642857 |
fb9e0b4ce0552e5a2f749a7a66141ec230aa1d62 | 2,433 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ca/ca2007a0.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ca/ca2007a0.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ca/ca2007a0.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CA2007A0M.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT SUBUNIT PACKAGES ARE ELABORATED IN THE ORDER IN
-- WHICH THEIR BODY STUBS APPEAR, NOT (NECESSARILY) IN THE
-- ORDER IN WHICH THEY ARE COMPILED.
-- SEPARATE FILES ARE:
-- CA2007A0M THE MAIN PROCEDURE.
-- CA2007A1 A SUBUNIT PACKAGE BODY.
-- CA2007A2 A SUBUNIT PACKAGE BODY.
-- CA2007A3 A SUBUNIT PACKAGE BODY.
-- WKB 7/1/81
-- JRK 7/1/81
WITH REPORT;
USE REPORT;
PROCEDURE CA2007A0M IS
ELAB_ORDER : STRING (1..3) := " ";
NEXT : NATURAL := 1;
PACKAGE CALL_TEST IS
END CALL_TEST;
PACKAGE BODY CALL_TEST IS
BEGIN
TEST ("CA2007A", "CHECK THAT SUBUNIT PACKAGES ARE " &
"ELABORATED IN THE ORDER IN WHICH THEIR " &
"BODY STUBS APPEAR");
END CALL_TEST;
PACKAGE CA2007A3 IS
END CA2007A3;
PACKAGE BODY CA2007A3 IS SEPARATE;
PACKAGE CA2007A2 IS
END CA2007A2;
PACKAGE BODY CA2007A2 IS SEPARATE;
PACKAGE CA2007A1 IS
END CA2007A1;
PACKAGE BODY CA2007A1 IS SEPARATE;
BEGIN
IF ELAB_ORDER /= "321" THEN
FAILED ("INCORRECT ELABORATION ORDER");
END IF;
RESULT;
END CA2007A0M;
| 31.192308 | 79 | 0.650637 |
d06bdffd57e811e24a90e5a906c5721ab1601738 | 586 | adb | Ada | tests/crafts-test_data.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | tests/crafts-test_data.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | tests/crafts-test_data.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
package body Crafts.Test_Data is
procedure Set_Up(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Set_Up;
procedure Tear_Down(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Tear_Down;
end Crafts.Test_Data;
| 29.3 | 75 | 0.726962 |
fb2e36ef17a56156b3384abe99a85a559c4da79e | 6,420 | adb | Ada | ADL/drivers/stm32h743/stm32-syscfg.adb | JCGobbi/Nucleo-STM32H743ZI | bb0b5a66e9ac8b3dbe381f9909df5ed5d77dad1c | [
"BSD-3-Clause"
] | null | null | null | ADL/drivers/stm32h743/stm32-syscfg.adb | JCGobbi/Nucleo-STM32H743ZI | bb0b5a66e9ac8b3dbe381f9909df5ed5d77dad1c | [
"BSD-3-Clause"
] | null | null | null | ADL/drivers/stm32h743/stm32-syscfg.adb | JCGobbi/Nucleo-STM32H743ZI | bb0b5a66e9ac8b3dbe381f9909df5ed5d77dad1c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2017, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of STMicroelectronics nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f407xx.h et al. --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief CMSIS STM32F407xx Device Peripheral Access Layer Header File. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
-- This file provides register definitions for the STM32F3 (ARM Cortex M4F)
-- microcontrollers from ST Microelectronics.
with STM32_SVD.EXTI; use STM32_SVD.EXTI;
with STM32_SVD.RCC; use STM32_SVD.RCC;
with STM32_SVD.SYSCFG; use STM32_SVD.SYSCFG;
with STM32.EXTI;
with STM32.Device;
package body STM32.SYSCFG is
subtype GPIO_Pin_Index is Natural range 0 .. 15;
procedure Connect_External_Interrupt
(Port : GPIO_Port;
Pin : GPIO_Pin_Index);
------------------------------------
-- Enable_SYSCFG_COMP_OPAMP_Clock --
------------------------------------
procedure Enable_SYSCFG_Clock is
begin
RCC_Periph.APB4ENR.SYSCFGEN := True;
end Enable_SYSCFG_Clock;
-----------------------------
-- Reset_SYSCFG_COMP_OPAMP --
-----------------------------
procedure Reset_SYSCFG is
begin
RCC_Periph.APB4RSTR.SYSCFGRST := True;
RCC_Periph.APB4RSTR.SYSCFGRST := False;
end Reset_SYSCFG;
--------------------------------
-- Connect_External_Interrupt --
--------------------------------
procedure Connect_External_Interrupt
(Port : GPIO_Port;
Pin : GPIO_Pin_Index)
is
Port_Id : constant UInt4 := STM32.Device.GPIO_Port_Representation (Port);
begin
-- Finally we assign the port 'number' to the EXTI_n value within the
-- control register. We depend upon the Port enumerals' underlying
-- numeric representation values matching what the hardware expects,
-- that is, the values 0 .. n-1, which we get automatically unless
-- overridden.
case Pin is
when 0 .. 3 =>
SYSCFG_Periph.EXTICR1.EXTI.Arr (Pin) := Port_Id;
when 4 .. 7 =>
SYSCFG_Periph.EXTICR2.EXTI.Arr (Pin) := Port_Id;
when 8 .. 11 =>
SYSCFG_Periph.EXTICR3.EXTI.Arr (Pin) := Port_Id;
when 12 .. 15 =>
SYSCFG_Periph.EXTICR4.EXTI.Arr (Pin) := Port_Id;
end case;
end Connect_External_Interrupt;
--------------------------------
-- Connect_External_Interrupt --
--------------------------------
procedure Connect_External_Interrupt
(Port : GPIO_Port;
Pin : GPIO_Pin)
is
begin
Connect_External_Interrupt (Port, GPIO_Pin'Pos (Pin));
end Connect_External_Interrupt;
--------------------------------
-- Connect_External_Interrupt --
--------------------------------
procedure Connect_External_Interrupt
(Point : GPIO_Point)
is
begin
Connect_External_Interrupt (Point.Periph.all, Point.Pin);
end Connect_External_Interrupt;
--------------------------------
-- Connect_External_Interrupt --
--------------------------------
procedure Connect_External_Interrupt
(Port : GPIO_Port;
Pins : GPIO_Pins)
is
begin
for Pin of Pins loop
Connect_External_Interrupt (Port, Pin);
end loop;
end Connect_External_Interrupt;
------------------------------
-- Clear_External_Interrupt --
------------------------------
procedure Clear_External_Interrupt (Pin : GPIO_Pin) is
use STM32.EXTI;
begin
Clear_External_Interrupt (External_Line_Number'Val (GPIO_Pin'Pos (Pin)));
end Clear_External_Interrupt;
end STM32.SYSCFG;
| 41.153846 | 80 | 0.507788 |
1c4bb5e893266a8d3ecb87bde4c7f9b88b56acae | 8,404 | ads | Ada | src/model/hyperion-agents-models.ads | stcarrez/hyperion | 166b10135521ee6553affc1b79f0bee3a9c7ea43 | [
"Apache-2.0"
] | null | null | null | src/model/hyperion-agents-models.ads | stcarrez/hyperion | 166b10135521ee6553affc1b79f0bee3a9c7ea43 | [
"Apache-2.0"
] | null | null | null | src/model/hyperion-agents-models.ads | stcarrez/hyperion | 166b10135521ee6553affc1b79f0bee3a9c7ea43 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- Hyperion.Agents.Models -- Hyperion.Agents.Models
-----------------------------------------------------------------------
-- File generated by ada-gen DO NOT MODIFY
-- Template used: templates/model/package-spec.xhtml
-- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095
-----------------------------------------------------------------------
-- Copyright (C) 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- 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.
-----------------------------------------------------------------------
pragma Warnings (Off);
with ADO.Sessions;
with ADO.Objects;
with ADO.Statements;
with ADO.SQL;
with ADO.Schemas;
with Ada.Calendar;
with Ada.Containers.Vectors;
with Ada.Strings.Unbounded;
with Util.Beans.Objects;
with Util.Beans.Basic.Lists;
pragma Warnings (On);
package Hyperion.Agents.Models is
pragma Style_Checks ("-mr");
type Agent_Ref is new ADO.Objects.Object_Ref with null record;
-- --------------------
-- The Agent table holds the information about a monitoring agent
-- who is allowed to connect to the Hyperion server.
-- --------------------
-- Create an object key for Agent.
function Agent_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key;
-- Create an object key for Agent from a string.
-- Raises Constraint_Error if the string cannot be converted into the object key.
function Agent_Key (Id : in String) return ADO.Objects.Object_Key;
Null_Agent : constant Agent_Ref;
function "=" (Left, Right : Agent_Ref'Class) return Boolean;
-- Set the agent identifier
procedure Set_Id (Object : in out Agent_Ref;
Value : in ADO.Identifier);
-- Get the agent identifier
function Get_Id (Object : in Agent_Ref)
return ADO.Identifier;
-- Set the agent host name
procedure Set_Hostname (Object : in out Agent_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String);
procedure Set_Hostname (Object : in out Agent_Ref;
Value : in String);
-- Get the agent host name
function Get_Hostname (Object : in Agent_Ref)
return Ada.Strings.Unbounded.Unbounded_String;
function Get_Hostname (Object : in Agent_Ref)
return String;
-- Set the IP address
procedure Set_Ip (Object : in out Agent_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String);
procedure Set_Ip (Object : in out Agent_Ref;
Value : in String);
-- Get the IP address
function Get_Ip (Object : in Agent_Ref)
return Ada.Strings.Unbounded.Unbounded_String;
function Get_Ip (Object : in Agent_Ref)
return String;
-- Set the agent key
procedure Set_Key (Object : in out Agent_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String);
procedure Set_Key (Object : in out Agent_Ref;
Value : in String);
-- Get the agent key
function Get_Key (Object : in Agent_Ref)
return Ada.Strings.Unbounded.Unbounded_String;
function Get_Key (Object : in Agent_Ref)
return String;
-- Set the date when the agent was registered
procedure Set_Create_Date (Object : in out Agent_Ref;
Value : in Ada.Calendar.Time);
-- Get the date when the agent was registered
function Get_Create_Date (Object : in Agent_Ref)
return Ada.Calendar.Time;
-- Load the entity identified by 'Id'.
-- Raises the NOT_FOUND exception if it does not exist.
procedure Load (Object : in out Agent_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier);
-- Load the entity identified by 'Id'.
-- Returns True in <b>Found</b> if the object was found and False if it does not exist.
procedure Load (Object : in out Agent_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean);
-- Find and load the entity.
overriding
procedure Find (Object : in out Agent_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
-- Save the entity. If the entity does not have an identifier, an identifier is allocated
-- and it is inserted in the table. Otherwise, only data fields which have been changed
-- are updated.
overriding
procedure Save (Object : in out Agent_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
-- Delete the entity.
overriding
procedure Delete (Object : in out Agent_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
function Get_Value (From : in Agent_Ref;
Name : in String) return Util.Beans.Objects.Object;
-- Table definition
AGENT_TABLE : constant ADO.Schemas.Class_Mapping_Access;
-- Internal method to allocate the Object_Record instance
overriding
procedure Allocate (Object : in out Agent_Ref);
-- Copy of the object.
procedure Copy (Object : in Agent_Ref;
Into : in out Agent_Ref);
private
AGENT_NAME : aliased constant String := "hyperion_agent";
COL_0_1_NAME : aliased constant String := "id";
COL_1_1_NAME : aliased constant String := "hostname";
COL_2_1_NAME : aliased constant String := "ip";
COL_3_1_NAME : aliased constant String := "key";
COL_4_1_NAME : aliased constant String := "create_date";
AGENT_DEF : aliased constant ADO.Schemas.Class_Mapping :=
(Count => 5,
Table => AGENT_NAME'Access,
Members => (
1 => COL_0_1_NAME'Access,
2 => COL_1_1_NAME'Access,
3 => COL_2_1_NAME'Access,
4 => COL_3_1_NAME'Access,
5 => COL_4_1_NAME'Access)
);
AGENT_TABLE : constant ADO.Schemas.Class_Mapping_Access
:= AGENT_DEF'Access;
Null_Agent : constant Agent_Ref
:= Agent_Ref'(ADO.Objects.Object_Ref with null record);
type Agent_Impl is
new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER,
Of_Class => AGENT_DEF'Access)
with record
Hostname : Ada.Strings.Unbounded.Unbounded_String;
Ip : Ada.Strings.Unbounded.Unbounded_String;
Key : Ada.Strings.Unbounded.Unbounded_String;
Create_Date : Ada.Calendar.Time;
end record;
type Agent_Access is access all Agent_Impl;
overriding
procedure Destroy (Object : access Agent_Impl);
overriding
procedure Find (Object : in out Agent_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
overriding
procedure Load (Object : in out Agent_Impl;
Session : in out ADO.Sessions.Session'Class);
procedure Load (Object : in out Agent_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class);
overriding
procedure Save (Object : in out Agent_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Create (Object : in out Agent_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
procedure Delete (Object : in out Agent_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Set_Field (Object : in out Agent_Ref'Class;
Impl : out Agent_Access);
end Hyperion.Agents.Models;
| 37.686099 | 94 | 0.621014 |
df9e37580fc7edf479955e482aa99fe006c0b2cd | 8,678 | adb | Ada | kv-avm-messages.adb | davidkristola/vole | aa8e19d9deff2efe98fcd4dc0028c2895d624693 | [
"Unlicense"
] | 4 | 2015-02-02T12:11:41.000Z | 2020-12-19T02:14:21.000Z | kv-avm-messages.adb | davidkristola/vole | aa8e19d9deff2efe98fcd4dc0028c2895d624693 | [
"Unlicense"
] | null | null | null | kv-avm-messages.adb | davidkristola/vole | aa8e19d9deff2efe98fcd4dc0028c2895d624693 | [
"Unlicense"
] | 3 | 2017-02-22T10:44:02.000Z | 2021-05-16T09:34:39.000Z | with Ada.Unchecked_Deallocation;
package body kv.avm.Messages is
type Message_Data_Type is
record
Source_Actor : kv.avm.Actor_References.Actor_Reference_Type;
Reply_To : kv.avm.Actor_References.Actor_Reference_Type;
Destination_Actor : kv.avm.Actor_References.Actor_Reference_Type;
Message_Name : kv.avm.Registers.String_Type;
Data : kv.avm.Tuples.Tuple_Type;
Future : Interfaces.Unsigned_32;
end record;
type Message_Data_Access is access Message_Data_Type;
type Reference_Counted_Message_Type is
record
Count : Natural := 0;
Data : Message_Data_Access;
end record;
-----------------------------------------------------------------------------
procedure Free is new Ada.Unchecked_Deallocation(Reference_Counted_Message_Type, Reference_Counted_Message_Access);
-----------------------------------------------------------------------------
procedure Free is new Ada.Unchecked_Deallocation(Message_Data_Type, Message_Data_Access);
-----------------------------------------------------------------------------
function Debug(Data : Message_Data_Access) return String is
begin
return "N: '" & (+Data.Message_Name) & "'" &
" S:" & Data.Source_Actor.Image &
" R:" & Data.Reply_To.Image &
" D:" & Data.Destination_Actor.Image &
" T: " & Data.Data.To_String &
" F:" & Interfaces.Unsigned_32'IMAGE(Data.Future);
end Debug;
-----------------------------------------------------------------------------
procedure Initialize
(Self : in out Message_Type) is
begin
null;
end Initialize;
----------------------------------------------------------------------------
procedure Adjust
(Self : in out Message_Type) is
begin
if Self.Ref /= null then
Self.Ref.Count := Self.Ref.Count + 1;
end if;
end Adjust;
----------------------------------------------------------------------------
procedure Finalize
(Self : in out Message_Type) is
Ref : Reference_Counted_Message_Access := Self.Ref;
begin
Self.Ref := null;
if Ref /= null then
Ref.Count := Ref.Count - 1;
if Ref.Count = 0 then
Free(Ref.Data);
Free(Ref);
end if;
end if;
end Finalize;
-----------------------------------------------------------------------------
procedure Initialize
(Self : in out Message_Type;
Source : in kv.avm.Actor_References.Actor_Reference_Type;
Reply_To : in kv.avm.Actor_References.Actor_Reference_Type;
Destination : in kv.avm.Actor_References.Actor_Reference_Type;
Message_Name : in String;
Data : in kv.avm.Tuples.Tuple_Type;
Future : in Interfaces.Unsigned_32) is
use kv.avm.Registers;
begin
Self.Ref := new Reference_Counted_Message_Type;
Self.Ref.Count := 1;
Self.Ref.Data := new Message_Data_Type;
Self.Ref.Data.Source_Actor := Source;
Self.Ref.Data.Reply_To := Reply_To;
Self.Ref.Data.Destination_Actor := Destination;
Self.Ref.Data.Message_Name := +Message_Name;
Self.Ref.Data.Data := Data;
Self.Ref.Data.Future := Future;
end Initialize;
-----------------------------------------------------------------------------
function Get_Name(Self : Message_Type) return String is
use kv.avm.Registers;
begin
return +Self.Ref.Data.Message_Name;
end Get_Name;
-----------------------------------------------------------------------------
function Get_Source(Self : Message_Type) return kv.avm.Actor_References.Actor_Reference_Type is
begin
return Self.Ref.Data.Source_Actor;
end Get_Source;
-----------------------------------------------------------------------------
function Get_Reply_To(Self : Message_Type) return kv.avm.Actor_References.Actor_Reference_Type is
begin
return Self.Ref.Data.Reply_To;
end Get_Reply_To;
-----------------------------------------------------------------------------
function Get_Destination(Self : Message_Type) return kv.avm.Actor_References.Actor_Reference_Type is
begin
return Self.Ref.Data.Destination_Actor;
end Get_Destination;
-----------------------------------------------------------------------------
function Get_Data(Self : Message_Type) return kv.avm.Tuples.Tuple_Type is
begin
return Self.Ref.Data.Data;
end Get_Data;
-----------------------------------------------------------------------------
function Get_Future(Self : Message_Type) return Interfaces.Unsigned_32 is
begin
return Self.Ref.Data.Future;
end Get_Future;
-----------------------------------------------------------------------------
function Image(Self : Message_Type) return String is
begin
return "Message<" & Self.Get_Name & ">";
end Image;
-----------------------------------------------------------------------------
function Debug(Ref : Reference_Counted_Message_Access) return String is
Count : constant String := Natural'IMAGE(Ref.Count);
begin
if Ref.Data = null then
return "null data"&Count;
else
return Debug(Ref.Data);
end if;
end Debug;
-----------------------------------------------------------------------------
function Debug(Self : Message_Type) return String is
begin
if Self.Ref = null then
return "null ref";
else
return Debug(Self.Ref);
end if;
end Debug;
-----------------------------------------------------------------------------
function Reachable(Self : Message_Type) return kv.avm.Actor_References.Sets.Set is
begin
return Self.Ref.Data.Data.Reachable;
end Reachable;
----------------------------------------------------------------------------
function "="(L, R: Message_Type) return Boolean is
begin
if L.Ref = Null or R.Ref = Null then
return False;
end if;
if L.Ref.Data = Null or R.Ref.Data = Null then
return False;
end if;
return (L.Ref.Data.all = R.Ref.Data.all);
end "=";
----------------------------------------------------------------------------
procedure Message_Write(Stream : not null access Ada.Streams.Root_Stream_Type'CLASS; Item : in Message_Type) is
begin
kv.avm.Actor_References.Actor_Reference_Type'OUTPUT(Stream, Item.Ref.Data.Source_Actor);
kv.avm.Actor_References.Actor_Reference_Type'OUTPUT(Stream, Item.Ref.Data.Reply_To);
kv.avm.Actor_References.Actor_Reference_Type'OUTPUT(Stream, Item.Ref.Data.Destination_Actor);
kv.avm.Registers.String_Type'OUTPUT (Stream, Item.Ref.Data.Message_Name);
kv.avm.Tuples.Tuple_Type'OUTPUT (Stream, Item.Ref.Data.Data);
Interfaces.Unsigned_32'OUTPUT (Stream, Item.Ref.Data.Future);
end Message_Write;
----------------------------------------------------------------------------
procedure Message_Read(Stream : not null access Ada.Streams.Root_Stream_Type'CLASS; Item : out Message_Type) is
Source : kv.avm.Actor_References.Actor_Reference_Type;
Reply_To : kv.avm.Actor_References.Actor_Reference_Type;
Destination : kv.avm.Actor_References.Actor_Reference_Type;
Message_Name : kv.avm.Registers.String_Type;
Data : kv.avm.Tuples.Tuple_Type;
Future : Interfaces.Unsigned_32;
use kv.avm.Registers;
begin
Item.Finalize; -- Clear out the old one, if there was something there.
-- Even though the parameters to a message's Initialize routine are
-- in this order, reading the values as parameters to the routine
-- resulted in an out-of-order read from the Stream.
Source := kv.avm.Actor_References.Actor_Reference_Type'INPUT(Stream);
Reply_To := kv.avm.Actor_References.Actor_Reference_Type'INPUT(Stream);
Destination := kv.avm.Actor_References.Actor_Reference_Type'INPUT(Stream);
Message_Name := kv.avm.Registers.String_Type'INPUT(Stream);
Data := kv.avm.Tuples.Tuple_Type'INPUT(Stream);
Future := Interfaces.Unsigned_32'INPUT(Stream);
Item.Initialize
(Source => Source,
Reply_To => Reply_To,
Destination => Destination,
Message_Name => +Message_Name,
Data => Data,
Future => Future);
end Message_Read;
end kv.avm.Messages;
| 39.807339 | 118 | 0.533533 |
20a48b6d6c20c6cf301a9b469ef2a13379826d50 | 31,359 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-cohama.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/a-cohama.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-cohama.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . H A S H E D _ M A P S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Ada.Containers.Hash_Tables.Generic_Operations;
pragma Elaborate_All (Ada.Containers.Hash_Tables.Generic_Operations);
with Ada.Containers.Hash_Tables.Generic_Keys;
pragma Elaborate_All (Ada.Containers.Hash_Tables.Generic_Keys);
with Ada.Containers.Helpers; use Ada.Containers.Helpers;
with System; use type System.Address;
package body Ada.Containers.Hashed_Maps is
pragma Warnings (Off, "variable ""Busy*"" is not referenced");
pragma Warnings (Off, "variable ""Lock*"" is not referenced");
-- See comment in Ada.Containers.Helpers
-----------------------
-- Local Subprograms --
-----------------------
function Copy_Node
(Source : Node_Access) return Node_Access;
pragma Inline (Copy_Node);
function Equivalent_Key_Node
(Key : Key_Type;
Node : Node_Access) return Boolean;
pragma Inline (Equivalent_Key_Node);
procedure Free (X : in out Node_Access);
function Find_Equal_Key
(R_HT : Hash_Table_Type;
L_Node : Node_Access) return Boolean;
function Hash_Node (Node : Node_Access) return Hash_Type;
pragma Inline (Hash_Node);
function Next (Node : Node_Access) return Node_Access;
pragma Inline (Next);
function Read_Node
(Stream : not null access Root_Stream_Type'Class) return Node_Access;
pragma Inline (Read_Node);
procedure Set_Next (Node : Node_Access; Next : Node_Access);
pragma Inline (Set_Next);
function Vet (Position : Cursor) return Boolean;
procedure Write_Node
(Stream : not null access Root_Stream_Type'Class;
Node : Node_Access);
pragma Inline (Write_Node);
--------------------------
-- Local Instantiations --
--------------------------
package HT_Ops is new Hash_Tables.Generic_Operations
(HT_Types => HT_Types,
Hash_Node => Hash_Node,
Next => Next,
Set_Next => Set_Next,
Copy_Node => Copy_Node,
Free => Free);
package Key_Ops is new Hash_Tables.Generic_Keys
(HT_Types => HT_Types,
Next => Next,
Set_Next => Set_Next,
Key_Type => Key_Type,
Hash => Hash,
Equivalent_Keys => Equivalent_Key_Node);
function Is_Equal is new HT_Ops.Generic_Equal (Find_Equal_Key);
procedure Read_Nodes is new HT_Ops.Generic_Read (Read_Node);
procedure Write_Nodes is new HT_Ops.Generic_Write (Write_Node);
---------
-- "=" --
---------
function "=" (Left, Right : Map) return Boolean is
begin
return Is_Equal (Left.HT, Right.HT);
end "=";
------------
-- Adjust --
------------
procedure Adjust (Container : in out Map) is
begin
HT_Ops.Adjust (Container.HT);
end Adjust;
------------
-- Assign --
------------
procedure Assign (Target : in out Map; Source : Map) is
procedure Insert_Item (Node : Node_Access);
pragma Inline (Insert_Item);
procedure Insert_Items is new HT_Ops.Generic_Iteration (Insert_Item);
-----------------
-- Insert_Item --
-----------------
procedure Insert_Item (Node : Node_Access) is
begin
Target.Insert (Key => Node.Key, New_Item => Node.Element);
end Insert_Item;
-- Start of processing for Assign
begin
if Target'Address = Source'Address then
return;
end if;
Target.Clear;
if Target.Capacity < Source.Length then
Target.Reserve_Capacity (Source.Length);
end if;
Insert_Items (Source.HT);
end Assign;
--------------
-- Capacity --
--------------
function Capacity (Container : Map) return Count_Type is
begin
return HT_Ops.Capacity (Container.HT);
end Capacity;
-----------
-- Clear --
-----------
procedure Clear (Container : in out Map) is
begin
HT_Ops.Clear (Container.HT);
end Clear;
------------------------
-- Constant_Reference --
------------------------
function Constant_Reference
(Container : aliased Map;
Position : Cursor) return Constant_Reference_Type
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with
"Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong map";
end if;
pragma Assert
(Vet (Position),
"Position cursor in Constant_Reference is bad");
declare
HT : Hash_Table_Type renames Container'Unrestricted_Access.all.HT;
TC : constant Tamper_Counts_Access :=
HT.TC'Unrestricted_Access;
begin
return R : constant Constant_Reference_Type :=
(Element => Position.Node.Element'Access,
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Constant_Reference;
function Constant_Reference
(Container : aliased Map;
Key : Key_Type) return Constant_Reference_Type
is
HT : Hash_Table_Type renames Container'Unrestricted_Access.HT;
Node : constant Node_Access := Key_Ops.Find (HT, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with "key not in map";
end if;
declare
TC : constant Tamper_Counts_Access :=
HT.TC'Unrestricted_Access;
begin
return R : constant Constant_Reference_Type :=
(Element => Node.Element'Access,
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Constant_Reference;
--------------
-- Contains --
--------------
function Contains (Container : Map; Key : Key_Type) return Boolean is
begin
return Find (Container, Key) /= No_Element;
end Contains;
----------
-- Copy --
----------
function Copy
(Source : Map;
Capacity : Count_Type := 0) return Map
is
C : Count_Type;
begin
if Capacity = 0 then
C := Source.Length;
elsif Capacity >= Source.Length then
C := Capacity;
elsif Checks then
raise Capacity_Error
with "Requested capacity is less than Source length";
end if;
return Target : Map do
Target.Reserve_Capacity (C);
Target.Assign (Source);
end return;
end Copy;
---------------
-- Copy_Node --
---------------
function Copy_Node
(Source : Node_Access) return Node_Access
is
Target : constant Node_Access :=
new Node_Type'(Key => Source.Key,
Element => Source.Element,
Next => null);
begin
return Target;
end Copy_Node;
------------
-- Delete --
------------
procedure Delete (Container : in out Map; Key : Key_Type) is
X : Node_Access;
begin
Key_Ops.Delete_Key_Sans_Free (Container.HT, Key, X);
if Checks and then X = null then
raise Constraint_Error with "attempt to delete key not in map";
end if;
Free (X);
end Delete;
procedure Delete (Container : in out Map; Position : in out Cursor) is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of Delete equals No_Element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor of Delete designates wrong map";
end if;
TC_Check (Container.HT.TC);
pragma Assert (Vet (Position), "bad cursor in Delete");
HT_Ops.Delete_Node_Sans_Free (Container.HT, Position.Node);
Free (Position.Node);
Position.Container := null;
end Delete;
-------------
-- Element --
-------------
function Element (Container : Map; Key : Key_Type) return Element_Type is
HT : Hash_Table_Type renames Container'Unrestricted_Access.HT;
Node : constant Node_Access := Key_Ops.Find (HT, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with
"no element available because key not in map";
end if;
return Node.Element;
end Element;
function Element (Position : Cursor) return Element_Type is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of function Element equals No_Element";
end if;
pragma Assert (Vet (Position), "bad cursor in function Element");
return Position.Node.Element;
end Element;
-------------------------
-- Equivalent_Key_Node --
-------------------------
function Equivalent_Key_Node
(Key : Key_Type;
Node : Node_Access) return Boolean is
begin
return Equivalent_Keys (Key, Node.Key);
end Equivalent_Key_Node;
---------------------
-- Equivalent_Keys --
---------------------
function Equivalent_Keys (Left, Right : Cursor)
return Boolean is
begin
if Checks and then Left.Node = null then
raise Constraint_Error with
"Left cursor of Equivalent_Keys equals No_Element";
end if;
if Checks and then Right.Node = null then
raise Constraint_Error with
"Right cursor of Equivalent_Keys equals No_Element";
end if;
pragma Assert (Vet (Left), "Left cursor of Equivalent_Keys is bad");
pragma Assert (Vet (Right), "Right cursor of Equivalent_Keys is bad");
return Equivalent_Keys (Left.Node.Key, Right.Node.Key);
end Equivalent_Keys;
function Equivalent_Keys (Left : Cursor; Right : Key_Type) return Boolean is
begin
if Checks and then Left.Node = null then
raise Constraint_Error with
"Left cursor of Equivalent_Keys equals No_Element";
end if;
pragma Assert (Vet (Left), "Left cursor in Equivalent_Keys is bad");
return Equivalent_Keys (Left.Node.Key, Right);
end Equivalent_Keys;
function Equivalent_Keys (Left : Key_Type; Right : Cursor) return Boolean is
begin
if Checks and then Right.Node = null then
raise Constraint_Error with
"Right cursor of Equivalent_Keys equals No_Element";
end if;
pragma Assert (Vet (Right), "Right cursor of Equivalent_Keys is bad");
return Equivalent_Keys (Left, Right.Node.Key);
end Equivalent_Keys;
-------------
-- Exclude --
-------------
procedure Exclude (Container : in out Map; Key : Key_Type) is
X : Node_Access;
begin
Key_Ops.Delete_Key_Sans_Free (Container.HT, Key, X);
Free (X);
end Exclude;
--------------
-- Finalize --
--------------
procedure Finalize (Container : in out Map) is
begin
HT_Ops.Finalize (Container.HT);
end Finalize;
procedure Finalize (Object : in out Iterator) is
begin
if Object.Container /= null then
Unbusy (Object.Container.HT.TC);
end if;
end Finalize;
----------
-- Find --
----------
function Find (Container : Map; Key : Key_Type) return Cursor is
HT : Hash_Table_Type renames Container'Unrestricted_Access.HT;
Node : constant Node_Access := Key_Ops.Find (HT, Key);
begin
if Node = null then
return No_Element;
end if;
return Cursor'(Container'Unrestricted_Access, Node);
end Find;
--------------------
-- Find_Equal_Key --
--------------------
function Find_Equal_Key
(R_HT : Hash_Table_Type;
L_Node : Node_Access) return Boolean
is
R_Index : constant Hash_Type := Key_Ops.Index (R_HT, L_Node.Key);
R_Node : Node_Access := R_HT.Buckets (R_Index);
begin
while R_Node /= null loop
if Equivalent_Keys (L_Node.Key, R_Node.Key) then
return L_Node.Element = R_Node.Element;
end if;
R_Node := R_Node.Next;
end loop;
return False;
end Find_Equal_Key;
-----------
-- First --
-----------
function First (Container : Map) return Cursor is
Node : constant Node_Access := HT_Ops.First (Container.HT);
begin
if Node = null then
return No_Element;
end if;
return Cursor'(Container'Unrestricted_Access, Node);
end First;
function First (Object : Iterator) return Cursor is
begin
return Object.Container.First;
end First;
----------
-- Free --
----------
procedure Free (X : in out Node_Access) is
procedure Deallocate is
new Ada.Unchecked_Deallocation (Node_Type, Node_Access);
begin
if X /= null then
X.Next := X; -- detect mischief (in Vet)
Deallocate (X);
end if;
end Free;
------------------------
-- Get_Element_Access --
------------------------
function Get_Element_Access
(Position : Cursor) return not null Element_Access is
begin
return Position.Node.Element'Access;
end Get_Element_Access;
-----------------
-- Has_Element --
-----------------
function Has_Element (Position : Cursor) return Boolean is
begin
pragma Assert (Vet (Position), "bad cursor in Has_Element");
return Position.Node /= null;
end Has_Element;
---------------
-- Hash_Node --
---------------
function Hash_Node (Node : Node_Access) return Hash_Type is
begin
return Hash (Node.Key);
end Hash_Node;
-------------
-- Include --
-------------
procedure Include
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type)
is
Position : Cursor;
Inserted : Boolean;
begin
Insert (Container, Key, New_Item, Position, Inserted);
if not Inserted then
TE_Check (Container.HT.TC);
Position.Node.Key := Key;
Position.Node.Element := New_Item;
end if;
end Include;
------------
-- Insert --
------------
procedure Insert
(Container : in out Map;
Key : Key_Type;
Position : out Cursor;
Inserted : out Boolean)
is
function New_Node (Next : Node_Access) return Node_Access;
pragma Inline (New_Node);
procedure Local_Insert is
new Key_Ops.Generic_Conditional_Insert (New_Node);
--------------
-- New_Node --
--------------
function New_Node (Next : Node_Access) return Node_Access is
begin
return new Node_Type'(Key => Key,
Element => <>,
Next => Next);
end New_Node;
HT : Hash_Table_Type renames Container.HT;
-- Start of processing for Insert
begin
if HT_Ops.Capacity (HT) = 0 then
HT_Ops.Reserve_Capacity (HT, 1);
end if;
Local_Insert (HT, Key, Position.Node, Inserted);
if Inserted
and then HT.Length > HT_Ops.Capacity (HT)
then
HT_Ops.Reserve_Capacity (HT, HT.Length);
end if;
Position.Container := Container'Unrestricted_Access;
end Insert;
procedure Insert
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean)
is
function New_Node (Next : Node_Access) return Node_Access;
pragma Inline (New_Node);
procedure Local_Insert is
new Key_Ops.Generic_Conditional_Insert (New_Node);
--------------
-- New_Node --
--------------
function New_Node (Next : Node_Access) return Node_Access is
begin
return new Node_Type'(Key, New_Item, Next);
end New_Node;
HT : Hash_Table_Type renames Container.HT;
-- Start of processing for Insert
begin
if HT_Ops.Capacity (HT) = 0 then
HT_Ops.Reserve_Capacity (HT, 1);
end if;
Local_Insert (HT, Key, Position.Node, Inserted);
if Inserted
and then HT.Length > HT_Ops.Capacity (HT)
then
HT_Ops.Reserve_Capacity (HT, HT.Length);
end if;
Position.Container := Container'Unrestricted_Access;
end Insert;
procedure Insert
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type)
is
Position : Cursor;
pragma Unreferenced (Position);
Inserted : Boolean;
begin
Insert (Container, Key, New_Item, Position, Inserted);
if Checks and then not Inserted then
raise Constraint_Error with
"attempt to insert key already in map";
end if;
end Insert;
--------------
-- Is_Empty --
--------------
function Is_Empty (Container : Map) return Boolean is
begin
return Container.HT.Length = 0;
end Is_Empty;
-------------
-- Iterate --
-------------
procedure Iterate
(Container : Map;
Process : not null access procedure (Position : Cursor))
is
procedure Process_Node (Node : Node_Access);
pragma Inline (Process_Node);
procedure Local_Iterate is new HT_Ops.Generic_Iteration (Process_Node);
------------------
-- Process_Node --
------------------
procedure Process_Node (Node : Node_Access) is
begin
Process (Cursor'(Container'Unrestricted_Access, Node));
end Process_Node;
Busy : With_Busy (Container.HT.TC'Unrestricted_Access);
-- Start of processing for Iterate
begin
Local_Iterate (Container.HT);
end Iterate;
function Iterate
(Container : Map) return Map_Iterator_Interfaces.Forward_Iterator'Class
is
begin
return It : constant Iterator :=
(Limited_Controlled with Container => Container'Unrestricted_Access)
do
Busy (Container.HT.TC'Unrestricted_Access.all);
end return;
end Iterate;
---------
-- Key --
---------
function Key (Position : Cursor) return Key_Type is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of function Key equals No_Element";
end if;
pragma Assert (Vet (Position), "bad cursor in function Key");
return Position.Node.Key;
end Key;
------------
-- Length --
------------
function Length (Container : Map) return Count_Type is
begin
return Container.HT.Length;
end Length;
----------
-- Move --
----------
procedure Move
(Target : in out Map;
Source : in out Map)
is
begin
HT_Ops.Move (Target => Target.HT, Source => Source.HT);
end Move;
----------
-- Next --
----------
function Next (Node : Node_Access) return Node_Access is
begin
return Node.Next;
end Next;
function Next (Position : Cursor) return Cursor is
begin
if Position.Node = null then
return No_Element;
end if;
pragma Assert (Vet (Position), "bad cursor in function Next");
declare
HT : Hash_Table_Type renames Position.Container.HT;
Node : constant Node_Access := HT_Ops.Next (HT, Position.Node);
begin
if Node = null then
return No_Element;
end if;
return Cursor'(Position.Container, Node);
end;
end Next;
procedure Next (Position : in out Cursor) is
begin
Position := Next (Position);
end Next;
function Next
(Object : Iterator;
Position : Cursor) return Cursor
is
begin
if Position.Container = null then
return No_Element;
end if;
if Checks and then Position.Container /= Object.Container then
raise Program_Error with
"Position cursor of Next designates wrong map";
end if;
return Next (Position);
end Next;
----------------------
-- Pseudo_Reference --
----------------------
function Pseudo_Reference
(Container : aliased Map'Class) return Reference_Control_Type
is
TC : constant Tamper_Counts_Access :=
Container.HT.TC'Unrestricted_Access;
begin
return R : constant Reference_Control_Type := (Controlled with TC) do
Lock (TC.all);
end return;
end Pseudo_Reference;
-------------------
-- Query_Element --
-------------------
procedure Query_Element
(Position : Cursor;
Process : not null access
procedure (Key : Key_Type; Element : Element_Type))
is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of Query_Element equals No_Element";
end if;
pragma Assert (Vet (Position), "bad cursor in Query_Element");
declare
M : Map renames Position.Container.all;
HT : Hash_Table_Type renames M.HT'Unrestricted_Access.all;
Lock : With_Lock (HT.TC'Unrestricted_Access);
K : Key_Type renames Position.Node.Key;
E : Element_Type renames Position.Node.Element;
begin
Process (K, E);
end;
end Query_Element;
----------
-- Read --
----------
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Map)
is
begin
Read_Nodes (Stream, Container.HT);
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Cursor)
is
begin
raise Program_Error with "attempt to stream map cursor";
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
---------------
-- Reference --
---------------
function Reference
(Container : aliased in out Map;
Position : Cursor) return Reference_Type
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with
"Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong map";
end if;
pragma Assert
(Vet (Position),
"Position cursor in function Reference is bad");
declare
HT : Hash_Table_Type renames Container'Unrestricted_Access.all.HT;
TC : constant Tamper_Counts_Access :=
HT.TC'Unrestricted_Access;
begin
return R : constant Reference_Type :=
(Element => Position.Node.Element'Access,
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Reference;
function Reference
(Container : aliased in out Map;
Key : Key_Type) return Reference_Type
is
HT : Hash_Table_Type renames Container.HT;
Node : constant Node_Access := Key_Ops.Find (HT, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with "key not in map";
end if;
declare
TC : constant Tamper_Counts_Access :=
HT.TC'Unrestricted_Access;
begin
return R : constant Reference_Type :=
(Element => Node.Element'Access,
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Reference;
---------------
-- Read_Node --
---------------
function Read_Node
(Stream : not null access Root_Stream_Type'Class) return Node_Access
is
Node : Node_Access := new Node_Type;
begin
Key_Type'Read (Stream, Node.Key);
Element_Type'Read (Stream, Node.Element);
return Node;
exception
when others =>
Free (Node);
raise;
end Read_Node;
-------------
-- Replace --
-------------
procedure Replace
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type)
is
Node : constant Node_Access := Key_Ops.Find (Container.HT, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with
"attempt to replace key not in map";
end if;
TE_Check (Container.HT.TC);
Node.Key := Key;
Node.Element := New_Item;
end Replace;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Container : in out Map;
Position : Cursor;
New_Item : Element_Type)
is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of Replace_Element equals No_Element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor of Replace_Element designates wrong map";
end if;
TE_Check (Position.Container.HT.TC);
pragma Assert (Vet (Position), "bad cursor in Replace_Element");
Position.Node.Element := New_Item;
end Replace_Element;
----------------------
-- Reserve_Capacity --
----------------------
procedure Reserve_Capacity
(Container : in out Map;
Capacity : Count_Type)
is
begin
HT_Ops.Reserve_Capacity (Container.HT, Capacity);
end Reserve_Capacity;
--------------
-- Set_Next --
--------------
procedure Set_Next (Node : Node_Access; Next : Node_Access) is
begin
Node.Next := Next;
end Set_Next;
--------------------
-- Update_Element --
--------------------
procedure Update_Element
(Container : in out Map;
Position : Cursor;
Process : not null access procedure (Key : Key_Type;
Element : in out Element_Type))
is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of Update_Element equals No_Element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor of Update_Element designates wrong map";
end if;
pragma Assert (Vet (Position), "bad cursor in Update_Element");
declare
HT : Hash_Table_Type renames Container.HT;
Lock : With_Lock (HT.TC'Unrestricted_Access);
K : Key_Type renames Position.Node.Key;
E : Element_Type renames Position.Node.Element;
begin
Process (K, E);
end;
end Update_Element;
---------
-- Vet --
---------
function Vet (Position : Cursor) return Boolean is
begin
if Position.Node = null then
return Position.Container = null;
end if;
if Position.Container = null then
return False;
end if;
if Position.Node.Next = Position.Node then
return False;
end if;
declare
HT : Hash_Table_Type renames Position.Container.HT;
X : Node_Access;
begin
if HT.Length = 0 then
return False;
end if;
if HT.Buckets = null
or else HT.Buckets'Length = 0
then
return False;
end if;
X := HT.Buckets (Key_Ops.Checked_Index (HT, Position.Node.Key));
for J in 1 .. HT.Length loop
if X = Position.Node then
return True;
end if;
if X = null then
return False;
end if;
if X = X.Next then -- to prevent unnecessary looping
return False;
end if;
X := X.Next;
end loop;
return False;
end;
end Vet;
-----------
-- Write --
-----------
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Map)
is
begin
Write_Nodes (Stream, Container.HT);
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Cursor)
is
begin
raise Program_Error with "attempt to stream map cursor";
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
----------------
-- Write_Node --
----------------
procedure Write_Node
(Stream : not null access Root_Stream_Type'Class;
Node : Node_Access)
is
begin
Key_Type'Write (Stream, Node.Key);
Element_Type'Write (Stream, Node.Element);
end Write_Node;
end Ada.Containers.Hashed_Maps;
| 26.197995 | 79 | 0.570968 |
1c8433f2149cab3c19055b2c7abf9cddf79337f2 | 5,138 | ads | Ada | source/nodes/program-nodes-number_declarations.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-number_declarations.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-number_declarations.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Defining_Identifiers;
with Program.Lexical_Elements;
with Program.Elements.Expressions;
with Program.Elements.Number_Declarations;
with Program.Element_Visitors;
package Program.Nodes.Number_Declarations is
pragma Preelaborate;
type Number_Declaration is
new Program.Nodes.Node
and Program.Elements.Number_Declarations.Number_Declaration
and Program.Elements.Number_Declarations.Number_Declaration_Text
with private;
function Create
(Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Colon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Constant_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Assignment_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Number_Declaration;
type Implicit_Number_Declaration is
new Program.Nodes.Node
and Program.Elements.Number_Declarations.Number_Declaration
with private;
function Create
(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 Implicit_Number_Declaration
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Number_Declaration is
abstract new Program.Nodes.Node
and Program.Elements.Number_Declarations.Number_Declaration
with record
Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Expression : not null Program.Elements.Expressions.Expression_Access;
end record;
procedure Initialize (Self : in out Base_Number_Declaration'Class);
overriding procedure Visit
(Self : not null access Base_Number_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Names
(Self : Base_Number_Declaration)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
overriding function Expression
(Self : Base_Number_Declaration)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Is_Number_Declaration
(Self : Base_Number_Declaration)
return Boolean;
overriding function Is_Declaration
(Self : Base_Number_Declaration)
return Boolean;
type Number_Declaration is
new Base_Number_Declaration
and Program.Elements.Number_Declarations.Number_Declaration_Text
with record
Colon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Constant_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Assignment_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Number_Declaration_Text
(Self : in out Number_Declaration)
return Program.Elements.Number_Declarations
.Number_Declaration_Text_Access;
overriding function Colon_Token
(Self : Number_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Constant_Token
(Self : Number_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Assignment_Token
(Self : Number_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Semicolon_Token
(Self : Number_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Number_Declaration is
new Base_Number_Declaration
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Number_Declaration_Text
(Self : in out Implicit_Number_Declaration)
return Program.Elements.Number_Declarations
.Number_Declaration_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Number_Declaration)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Number_Declaration)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Number_Declaration)
return Boolean;
end Program.Nodes.Number_Declarations;
| 34.716216 | 77 | 0.736473 |
235b75aef2fa3e630fc0b2633963536fe6853e0f | 14,997 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_ch7.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_ch7.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_ch7.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ C H 7 --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
with Namet; use Namet;
with Types; use Types;
package Exp_Ch7 is
procedure Expand_N_Package_Body (N : Node_Id);
procedure Expand_N_Package_Declaration (N : Node_Id);
-----------------------------
-- Finalization Management --
-----------------------------
procedure Build_Anonymous_Master (Ptr_Typ : Entity_Id);
-- Build a finalization master for an anonymous access-to-controlled type
-- denoted by Ptr_Typ. The master is inserted in the declarations of the
-- current unit.
procedure Build_Controlling_Procs (Typ : Entity_Id);
-- Typ is a record, and array type having controlled components.
-- Create the procedures Deep_Initialize, Deep_Adjust and Deep_Finalize
-- that take care of finalization management at run-time.
-- Support of exceptions from user finalization procedures
-- There is a specific mechanism to handle these exceptions, continue
-- finalization and then raise PE. This mechanism is used by this package
-- but also by exp_intr for Ada.Unchecked_Deallocation.
-- There are 3 subprograms to use this mechanism, and the type
-- Finalization_Exception_Data carries internal data between these
-- subprograms:
--
-- 1. Build_Object_Declaration: create the variables for the next two
-- subprograms.
-- 2. Build_Exception_Handler: create the exception handler for a call
-- to a user finalization procedure.
-- 3. Build_Raise_Stmt: create code to potentially raise a PE exception
-- if an exception was raise in a user finalization procedure.
type Finalization_Exception_Data is record
Loc : Source_Ptr;
-- Sloc for the added nodes
Abort_Id : Entity_Id;
-- Boolean variable set to true if the finalization was triggered by
-- an abort.
E_Id : Entity_Id;
-- Variable containing the exception occurrence raised by user code
Raised_Id : Entity_Id;
-- Boolean variable set to true if an exception was raised in user code
end record;
function Build_Exception_Handler
(Data : Finalization_Exception_Data;
For_Library : Boolean := False) return Node_Id;
-- Subsidiary to Build_Finalizer, Make_Deep_Array_Body and Make_Deep_Record
-- _Body. Create an exception handler of the following form:
--
-- when others =>
-- if not Raised_Id then
-- Raised_Id := True;
-- Save_Occurrence (E_Id, Get_Current_Excep.all.all);
-- end if;
--
-- If flag For_Library is set (and not in restricted profile):
--
-- when others =>
-- if not Raised_Id then
-- Raised_Id := True;
-- Save_Library_Occurrence (Get_Current_Excep.all);
-- end if;
--
-- E_Id denotes the defining identifier of a local exception occurrence.
-- Raised_Id is the entity of a local boolean flag. Flag For_Library is
-- used when operating at the library level, when enabled the current
-- exception will be saved to a global location.
procedure Build_Finalization_Master
(Typ : Entity_Id;
For_Lib_Level : Boolean := False;
For_Private : Boolean := False;
Context_Scope : Entity_Id := Empty;
Insertion_Node : Node_Id := Empty);
-- Build a finalization master for an access type. The designated type may
-- not necessarily be controlled or need finalization actions depending on
-- the context. Flag For_Lib_Level must be set when creating a master for a
-- build-in-place function call access result type. Flag For_Private must
-- be set when the designated type contains a private component. Parameters
-- Context_Scope and Insertion_Node must be used in conjunction with flag
-- For_Private. Context_Scope is the scope of the context where the
-- finalization master must be analyzed. Insertion_Node is the insertion
-- point before which the master is to be inserted.
procedure Build_Late_Proc (Typ : Entity_Id; Nam : Name_Id);
-- Build one controlling procedure when a late body overrides one of the
-- controlling operations.
procedure Build_Object_Declarations
(Data : out Finalization_Exception_Data;
Decls : List_Id;
Loc : Source_Ptr;
For_Package : Boolean := False);
-- Subsidiary to Make_Deep_Array_Body and Make_Deep_Record_Body. Create the
-- list List containing the object declarations of boolean flag Abort_Id,
-- the exception occurrence E_Id and boolean flag Raised_Id.
--
-- Abort_Id : constant Boolean :=
-- Exception_Identity (Get_Current_Excep.all) =
-- Standard'Abort_Signal'Identity;
-- <or>
-- Abort_Id : constant Boolean := False; -- no abort or For_Package
--
-- E_Id : Exception_Occurrence;
-- Raised_Id : Boolean := False;
function Build_Raise_Statement
(Data : Finalization_Exception_Data) return Node_Id;
-- Subsidiary to routines Build_Finalizer, Make_Deep_Array_Body and Make_
-- Deep_Record_Body. Generate the following conditional raise statement:
--
-- if Raised_Id and then not Abort_Id then
-- Raise_From_Controlled_Operation (E_Id);
-- end if;
--
-- Abort_Id is a local boolean flag which is set when the finalization was
-- triggered by an abort, E_Id denotes the defining identifier of a local
-- exception occurrence, Raised_Id is the entity of a local boolean flag.
function CW_Or_Has_Controlled_Part (T : Entity_Id) return Boolean;
-- True if T is a class-wide type, or if it has controlled parts ("part"
-- means T or any of its subcomponents). Same as Needs_Finalization, except
-- when pragma Restrictions (No_Finalization) applies, in which case we
-- know that class-wide objects do not contain controlled parts.
function Has_New_Controlled_Component (E : Entity_Id) return Boolean;
-- E is a type entity. Give the same result as Has_Controlled_Component
-- except for tagged extensions where the result is True only if the
-- latest extension contains a controlled component.
function Make_Adjust_Call
(Obj_Ref : Node_Id;
Typ : Entity_Id;
Skip_Self : Boolean := False) return Node_Id;
-- Create a call to either Adjust or Deep_Adjust depending on the structure
-- of type Typ. Obj_Ref is an expression with no side effects (not required
-- to have been previously analyzed) that references the object to be
-- adjusted. Typ is the expected type of Obj_Ref. When Skip_Self is set,
-- only the components (if any) are adjusted. Return Empty if Adjust or
-- Deep_Adjust is not available, possibly due to previous errors.
function Make_Detach_Call (Obj_Ref : Node_Id) return Node_Id;
-- Create a call to unhook an object from an arbitrary list. Obj_Ref is the
-- object. Generate the following:
--
-- Ada.Finalization.Heap_Management.Detach
-- (System.Finalization_Root.Root_Controlled_Ptr (Obj_Ref));
function Make_Final_Call
(Obj_Ref : Node_Id;
Typ : Entity_Id;
Skip_Self : Boolean := False) return Node_Id;
-- Create a call to either Finalize or Deep_Finalize, depending on the
-- structure of type Typ. Obj_Ref is an expression (with no side effects
-- and is not required to have been previously analyzed) that references
-- the object to be finalized. Typ is the expected type of Obj_Ref. When
-- Skip_Self is set, only the components (if any) are finalized. Return
-- Empty if Finalize or Deep_Finalize is not available, possibly due to
-- previous errors.
procedure Make_Finalize_Address_Body (Typ : Entity_Id);
-- Create the body of TSS routine Finalize_Address if Typ is controlled and
-- does not have a TSS entry for Finalize_Address. The procedure converts
-- an address into a pointer and subsequently calls Deep_Finalize on the
-- dereference.
function Make_Init_Call
(Obj_Ref : Node_Id;
Typ : Entity_Id) return Node_Id;
-- Create a call to either Initialize or Deep_Initialize, depending on the
-- structure of type Typ. Obj_Ref is an expression with no side effects
-- (not required to have been previously analyzed) that references the
-- object to be initialized. Typ is the expected type of Obj_Ref. Return
-- Empty if Initialize or Deep_Initialize is not available, possibly due to
-- previous errors.
function Make_Handler_For_Ctrl_Operation (Loc : Source_Ptr) return Node_Id;
-- Generate an implicit exception handler with an 'others' choice,
-- converting any occurrence to a raise of Program_Error.
function Make_Local_Deep_Finalize
(Typ : Entity_Id;
Nam : Entity_Id) return Node_Id;
-- Create a special version of Deep_Finalize with identifier Nam. The
-- routine has state information and can perform partial finalization.
function Make_Set_Finalize_Address_Call
(Loc : Source_Ptr;
Ptr_Typ : Entity_Id) return Node_Id;
-- Associate the Finalize_Address primitive of the designated type with the
-- finalization master of access type Ptr_Typ. The returned call is:
--
-- Set_Finalize_Address
-- (<Ptr_Typ>FM, <Desig_Typ>FD'Unrestricted_Access);
--------------------------------------------
-- Task and Protected Object finalization --
--------------------------------------------
function Cleanup_Array
(N : Node_Id;
Obj : Node_Id;
Typ : Entity_Id) return List_Id;
-- Generate loops to finalize any tasks or simple protected objects that
-- are subcomponents of an array.
function Cleanup_Protected_Object
(N : Node_Id;
Ref : Node_Id) return Node_Id;
-- Generate code to finalize a protected object without entries
function Cleanup_Record
(N : Node_Id;
Obj : Node_Id;
Typ : Entity_Id) return List_Id;
-- For each subcomponent of a record that contains tasks or simple
-- protected objects, generate the appropriate finalization call.
function Cleanup_Task
(N : Node_Id;
Ref : Node_Id) return Node_Id;
-- Generate code to finalize a task
function Has_Simple_Protected_Object (T : Entity_Id) return Boolean;
-- Check whether composite type contains a simple protected component
function Is_Simple_Protected_Type (T : Entity_Id) return Boolean;
-- Determine whether T denotes a protected type without entries whose
-- _object field is of type System.Tasking.Protected_Objects.Protection.
-- Something wrong here, implementation was changed to test Lock_Free
-- but this spec does not mention that ???
--------------------------------
-- Transient Scope Management --
--------------------------------
procedure Expand_Cleanup_Actions (N : Node_Id);
-- Expand the necessary stuff into a scope to enable finalization of local
-- objects and deallocation of transient data when exiting the scope. N is
-- a "scope node" that is to say one of the following: N_Block_Statement,
-- N_Subprogram_Body, N_Task_Body, N_Entry_Body.
procedure Establish_Transient_Scope
(N : Node_Id;
Manage_Sec_Stack : Boolean);
-- Push a new transient scope on the scope stack. N is the node which must
-- be serviced by the transient scope. Set Manage_Sec_Stack when the scope
-- must mark and release the secondary stack.
function Node_To_Be_Wrapped return Node_Id;
-- Return the node to be wrapped if the current scope is transient
procedure Store_Before_Actions_In_Scope (L : List_Id);
-- Append the list L of actions to the end of the before-actions store in
-- the top of the scope stack (also analyzes these actions).
procedure Store_After_Actions_In_Scope (L : List_Id);
-- Prepend the list L of actions to the beginning of the after-actions
-- stored in the top of the scope stack (also analyzes these actions).
--
-- Note that we are prepending here rather than appending. This means that
-- if several calls are made to this procedure for the same scope, the
-- actions will be executed in reverse order of the calls (actions for the
-- last call executed first). Within the list L for a single call, the
-- actions are executed in the order in which they appear in this list.
procedure Store_Cleanup_Actions_In_Scope (L : List_Id);
-- Prepend the list L of actions to the beginning of the cleanup-actions
-- store in the top of the scope stack.
procedure Wrap_Transient_Declaration (N : Node_Id);
-- N is an object declaration. Expand the finalization calls after the
-- declaration and make the outer scope being the transient one.
procedure Wrap_Transient_Expression (N : Node_Id);
-- N is a sub-expression. Expand a transient block around an expression
procedure Wrap_Transient_Statement (N : Node_Id);
-- N is a statement. Expand a transient block around an instruction
end Exp_Ch7;
| 47.160377 | 79 | 0.652397 |
fb14e1f591a0daa264698c39e4bfd75d079d0ded | 40,864 | ads | Ada | src/devices/SAMD51/ATSAMD51P19A/sam-functions.ads | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | 1 | 2020-02-24T23:19:03.000Z | 2020-02-24T23:19:03.000Z | src/devices/SAMD51/ATSAMD51P20A/sam-functions.ads | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | null | null | null | src/devices/SAMD51/ATSAMD51P20A/sam-functions.ads | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | null | null | null |
-- Generated by a script from an "avr tools device file" (atdf)
with SAM.Port; use SAM.Port;
package SAM.Functions is
PA04_AC_AIN0 : constant Peripheral_Function := B;
PA05_AC_AIN1 : constant Peripheral_Function := B;
PA06_AC_AIN2 : constant Peripheral_Function := B;
PA07_AC_AIN3 : constant Peripheral_Function := B;
PA12_AC_CMP0 : constant Peripheral_Function := M;
PA18_AC_CMP0 : constant Peripheral_Function := M;
PB24_AC_CMP0 : constant Peripheral_Function := M;
PA13_AC_CMP1 : constant Peripheral_Function := M;
PA19_AC_CMP1 : constant Peripheral_Function := M;
PB25_AC_CMP1 : constant Peripheral_Function := M;
PA02_ADC0_AIN0 : constant Peripheral_Function := B;
PA03_ADC0_AIN1 : constant Peripheral_Function := B;
PB08_ADC0_AIN2 : constant Peripheral_Function := B;
PB09_ADC0_AIN3 : constant Peripheral_Function := B;
PA04_ADC0_AIN4 : constant Peripheral_Function := B;
PA05_ADC0_AIN5 : constant Peripheral_Function := B;
PA06_ADC0_AIN6 : constant Peripheral_Function := B;
PA07_ADC0_AIN7 : constant Peripheral_Function := B;
PA08_ADC0_AIN8 : constant Peripheral_Function := B;
PA09_ADC0_AIN9 : constant Peripheral_Function := B;
PA10_ADC0_AIN10 : constant Peripheral_Function := B;
PA11_ADC0_AIN11 : constant Peripheral_Function := B;
PB00_ADC0_AIN12 : constant Peripheral_Function := B;
PB01_ADC0_AIN13 : constant Peripheral_Function := B;
PB02_ADC0_AIN14 : constant Peripheral_Function := B;
PB03_ADC0_AIN15 : constant Peripheral_Function := B;
PA03_ADC0_X0 : constant Peripheral_Function := B;
PA03_ADC0_Y0 : constant Peripheral_Function := B;
PB08_ADC0_X1 : constant Peripheral_Function := B;
PB08_ADC0_Y1 : constant Peripheral_Function := B;
PB09_ADC0_X2 : constant Peripheral_Function := B;
PB09_ADC0_Y2 : constant Peripheral_Function := B;
PA04_ADC0_X3 : constant Peripheral_Function := B;
PA04_ADC0_Y3 : constant Peripheral_Function := B;
PA06_ADC0_X4 : constant Peripheral_Function := B;
PA06_ADC0_Y4 : constant Peripheral_Function := B;
PA07_ADC0_X5 : constant Peripheral_Function := B;
PA07_ADC0_Y5 : constant Peripheral_Function := B;
PA08_ADC0_X6 : constant Peripheral_Function := B;
PA08_ADC0_Y6 : constant Peripheral_Function := B;
PA09_ADC0_X7 : constant Peripheral_Function := B;
PA09_ADC0_Y7 : constant Peripheral_Function := B;
PA10_ADC0_X8 : constant Peripheral_Function := B;
PA10_ADC0_Y8 : constant Peripheral_Function := B;
PA11_ADC0_X9 : constant Peripheral_Function := B;
PA11_ADC0_Y9 : constant Peripheral_Function := B;
PA16_ADC0_X10 : constant Peripheral_Function := B;
PA16_ADC0_Y10 : constant Peripheral_Function := B;
PA17_ADC0_X11 : constant Peripheral_Function := B;
PA17_ADC0_Y11 : constant Peripheral_Function := B;
PA18_ADC0_X12 : constant Peripheral_Function := B;
PA18_ADC0_Y12 : constant Peripheral_Function := B;
PA19_ADC0_X13 : constant Peripheral_Function := B;
PA19_ADC0_Y13 : constant Peripheral_Function := B;
PA20_ADC0_X14 : constant Peripheral_Function := B;
PA20_ADC0_Y14 : constant Peripheral_Function := B;
PA21_ADC0_X15 : constant Peripheral_Function := B;
PA21_ADC0_Y15 : constant Peripheral_Function := B;
PA22_ADC0_X16 : constant Peripheral_Function := B;
PA22_ADC0_Y16 : constant Peripheral_Function := B;
PA23_ADC0_X17 : constant Peripheral_Function := B;
PA23_ADC0_Y17 : constant Peripheral_Function := B;
PA27_ADC0_X18 : constant Peripheral_Function := B;
PA27_ADC0_Y18 : constant Peripheral_Function := B;
PA30_ADC0_X19 : constant Peripheral_Function := B;
PA30_ADC0_Y19 : constant Peripheral_Function := B;
PB02_ADC0_X20 : constant Peripheral_Function := B;
PB02_ADC0_Y20 : constant Peripheral_Function := B;
PB03_ADC0_X21 : constant Peripheral_Function := B;
PB03_ADC0_Y21 : constant Peripheral_Function := B;
PB04_ADC0_X22 : constant Peripheral_Function := B;
PB04_ADC0_Y22 : constant Peripheral_Function := B;
PB05_ADC0_X23 : constant Peripheral_Function := B;
PB05_ADC0_Y23 : constant Peripheral_Function := B;
PB06_ADC0_X24 : constant Peripheral_Function := B;
PB06_ADC0_Y24 : constant Peripheral_Function := B;
PB07_ADC0_X25 : constant Peripheral_Function := B;
PB07_ADC0_Y25 : constant Peripheral_Function := B;
PB12_ADC0_X26 : constant Peripheral_Function := B;
PB12_ADC0_Y26 : constant Peripheral_Function := B;
PB13_ADC0_X27 : constant Peripheral_Function := B;
PB13_ADC0_Y27 : constant Peripheral_Function := B;
PB14_ADC0_X28 : constant Peripheral_Function := B;
PB14_ADC0_Y28 : constant Peripheral_Function := B;
PB15_ADC0_X29 : constant Peripheral_Function := B;
PB15_ADC0_Y29 : constant Peripheral_Function := B;
PB00_ADC0_X30 : constant Peripheral_Function := B;
PB00_ADC0_Y30 : constant Peripheral_Function := B;
PB01_ADC0_X31 : constant Peripheral_Function := B;
PB01_ADC0_Y31 : constant Peripheral_Function := B;
PB08_ADC1_AIN0 : constant Peripheral_Function := B;
PB09_ADC1_AIN1 : constant Peripheral_Function := B;
PA08_ADC1_AIN2 : constant Peripheral_Function := B;
PA09_ADC1_AIN3 : constant Peripheral_Function := B;
PC02_ADC1_AIN4 : constant Peripheral_Function := B;
PC03_ADC1_AIN5 : constant Peripheral_Function := B;
PB04_ADC1_AIN6 : constant Peripheral_Function := B;
PB05_ADC1_AIN7 : constant Peripheral_Function := B;
PB06_ADC1_AIN8 : constant Peripheral_Function := B;
PB07_ADC1_AIN9 : constant Peripheral_Function := B;
PC00_ADC1_AIN10 : constant Peripheral_Function := B;
PC01_ADC1_AIN11 : constant Peripheral_Function := B;
PC30_ADC1_AIN12 : constant Peripheral_Function := B;
PC31_ADC1_AIN13 : constant Peripheral_Function := B;
PD00_ADC1_AIN14 : constant Peripheral_Function := B;
PD01_ADC1_AIN15 : constant Peripheral_Function := B;
PA04_CCL_IN0 : constant Peripheral_Function := N;
PA16_CCL_IN0 : constant Peripheral_Function := N;
PB22_CCL_IN0 : constant Peripheral_Function := N;
PA05_CCL_IN1 : constant Peripheral_Function := N;
PA17_CCL_IN1 : constant Peripheral_Function := N;
PB00_CCL_IN1 : constant Peripheral_Function := N;
PA06_CCL_IN2 : constant Peripheral_Function := N;
PA18_CCL_IN2 : constant Peripheral_Function := N;
PB01_CCL_IN2 : constant Peripheral_Function := N;
PA08_CCL_IN3 : constant Peripheral_Function := N;
PA30_CCL_IN3 : constant Peripheral_Function := N;
PA09_CCL_IN4 : constant Peripheral_Function := N;
PC27_CCL_IN4 : constant Peripheral_Function := N;
PA10_CCL_IN5 : constant Peripheral_Function := N;
PC28_CCL_IN5 : constant Peripheral_Function := N;
PA22_CCL_IN6 : constant Peripheral_Function := N;
PB06_CCL_IN6 : constant Peripheral_Function := N;
PA23_CCL_IN7 : constant Peripheral_Function := N;
PB07_CCL_IN7 : constant Peripheral_Function := N;
PA24_CCL_IN8 : constant Peripheral_Function := N;
PB08_CCL_IN8 : constant Peripheral_Function := N;
PB14_CCL_IN9 : constant Peripheral_Function := N;
PC20_CCL_IN9 : constant Peripheral_Function := N;
PB15_CCL_IN10 : constant Peripheral_Function := N;
PC21_CCL_IN10 : constant Peripheral_Function := N;
PB10_CCL_IN11 : constant Peripheral_Function := N;
PB16_CCL_IN11 : constant Peripheral_Function := N;
PA07_CCL_OUT0 : constant Peripheral_Function := N;
PA19_CCL_OUT0 : constant Peripheral_Function := N;
PB02_CCL_OUT0 : constant Peripheral_Function := N;
PB23_CCL_OUT0 : constant Peripheral_Function := N;
PA11_CCL_OUT1 : constant Peripheral_Function := N;
PA31_CCL_OUT1 : constant Peripheral_Function := N;
PB11_CCL_OUT1 : constant Peripheral_Function := N;
PA25_CCL_OUT2 : constant Peripheral_Function := N;
PB09_CCL_OUT2 : constant Peripheral_Function := N;
PB17_CCL_OUT3 : constant Peripheral_Function := N;
PA02_DAC_VOUT0 : constant Peripheral_Function := B;
PA05_DAC_VOUT1 : constant Peripheral_Function := B;
PA00_EIC_EXTINT0 : constant Peripheral_Function := A;
PA16_EIC_EXTINT0 : constant Peripheral_Function := A;
PB00_EIC_EXTINT0 : constant Peripheral_Function := A;
PB16_EIC_EXTINT0 : constant Peripheral_Function := A;
PC00_EIC_EXTINT0 : constant Peripheral_Function := A;
PC16_EIC_EXTINT0 : constant Peripheral_Function := A;
PD00_EIC_EXTINT0 : constant Peripheral_Function := A;
PA01_EIC_EXTINT1 : constant Peripheral_Function := A;
PA17_EIC_EXTINT1 : constant Peripheral_Function := A;
PB01_EIC_EXTINT1 : constant Peripheral_Function := A;
PB17_EIC_EXTINT1 : constant Peripheral_Function := A;
PC01_EIC_EXTINT1 : constant Peripheral_Function := A;
PC17_EIC_EXTINT1 : constant Peripheral_Function := A;
PD01_EIC_EXTINT1 : constant Peripheral_Function := A;
PA02_EIC_EXTINT2 : constant Peripheral_Function := A;
PA18_EIC_EXTINT2 : constant Peripheral_Function := A;
PB02_EIC_EXTINT2 : constant Peripheral_Function := A;
PB18_EIC_EXTINT2 : constant Peripheral_Function := A;
PC02_EIC_EXTINT2 : constant Peripheral_Function := A;
PC18_EIC_EXTINT2 : constant Peripheral_Function := A;
PA03_EIC_EXTINT3 : constant Peripheral_Function := A;
PA19_EIC_EXTINT3 : constant Peripheral_Function := A;
PB03_EIC_EXTINT3 : constant Peripheral_Function := A;
PB19_EIC_EXTINT3 : constant Peripheral_Function := A;
PC03_EIC_EXTINT3 : constant Peripheral_Function := A;
PC19_EIC_EXTINT3 : constant Peripheral_Function := A;
PD08_EIC_EXTINT3 : constant Peripheral_Function := A;
PA04_EIC_EXTINT4 : constant Peripheral_Function := A;
PA20_EIC_EXTINT4 : constant Peripheral_Function := A;
PB04_EIC_EXTINT4 : constant Peripheral_Function := A;
PB20_EIC_EXTINT4 : constant Peripheral_Function := A;
PC04_EIC_EXTINT4 : constant Peripheral_Function := A;
PC20_EIC_EXTINT4 : constant Peripheral_Function := A;
PD09_EIC_EXTINT4 : constant Peripheral_Function := A;
PA05_EIC_EXTINT5 : constant Peripheral_Function := A;
PA21_EIC_EXTINT5 : constant Peripheral_Function := A;
PB05_EIC_EXTINT5 : constant Peripheral_Function := A;
PB21_EIC_EXTINT5 : constant Peripheral_Function := A;
PC05_EIC_EXTINT5 : constant Peripheral_Function := A;
PC21_EIC_EXTINT5 : constant Peripheral_Function := A;
PD10_EIC_EXTINT5 : constant Peripheral_Function := A;
PA06_EIC_EXTINT6 : constant Peripheral_Function := A;
PA22_EIC_EXTINT6 : constant Peripheral_Function := A;
PB06_EIC_EXTINT6 : constant Peripheral_Function := A;
PB22_EIC_EXTINT6 : constant Peripheral_Function := A;
PC06_EIC_EXTINT6 : constant Peripheral_Function := A;
PC22_EIC_EXTINT6 : constant Peripheral_Function := A;
PD11_EIC_EXTINT6 : constant Peripheral_Function := A;
PA07_EIC_EXTINT7 : constant Peripheral_Function := A;
PA23_EIC_EXTINT7 : constant Peripheral_Function := A;
PB07_EIC_EXTINT7 : constant Peripheral_Function := A;
PB23_EIC_EXTINT7 : constant Peripheral_Function := A;
PC23_EIC_EXTINT7 : constant Peripheral_Function := A;
PD12_EIC_EXTINT7 : constant Peripheral_Function := A;
PA24_EIC_EXTINT8 : constant Peripheral_Function := A;
PB08_EIC_EXTINT8 : constant Peripheral_Function := A;
PB24_EIC_EXTINT8 : constant Peripheral_Function := A;
PC24_EIC_EXTINT8 : constant Peripheral_Function := A;
PA09_EIC_EXTINT9 : constant Peripheral_Function := A;
PA25_EIC_EXTINT9 : constant Peripheral_Function := A;
PB09_EIC_EXTINT9 : constant Peripheral_Function := A;
PB25_EIC_EXTINT9 : constant Peripheral_Function := A;
PC07_EIC_EXTINT9 : constant Peripheral_Function := A;
PC25_EIC_EXTINT9 : constant Peripheral_Function := A;
PA10_EIC_EXTINT10 : constant Peripheral_Function := A;
PB10_EIC_EXTINT10 : constant Peripheral_Function := A;
PC10_EIC_EXTINT10 : constant Peripheral_Function := A;
PC26_EIC_EXTINT10 : constant Peripheral_Function := A;
PD20_EIC_EXTINT10 : constant Peripheral_Function := A;
PA11_EIC_EXTINT11 : constant Peripheral_Function := A;
PA27_EIC_EXTINT11 : constant Peripheral_Function := A;
PB11_EIC_EXTINT11 : constant Peripheral_Function := A;
PC11_EIC_EXTINT11 : constant Peripheral_Function := A;
PC27_EIC_EXTINT11 : constant Peripheral_Function := A;
PD21_EIC_EXTINT11 : constant Peripheral_Function := A;
PA12_EIC_EXTINT12 : constant Peripheral_Function := A;
PB12_EIC_EXTINT12 : constant Peripheral_Function := A;
PB26_EIC_EXTINT12 : constant Peripheral_Function := A;
PC12_EIC_EXTINT12 : constant Peripheral_Function := A;
PC28_EIC_EXTINT12 : constant Peripheral_Function := A;
PA13_EIC_EXTINT13 : constant Peripheral_Function := A;
PB13_EIC_EXTINT13 : constant Peripheral_Function := A;
PB27_EIC_EXTINT13 : constant Peripheral_Function := A;
PC13_EIC_EXTINT13 : constant Peripheral_Function := A;
PA30_EIC_EXTINT14 : constant Peripheral_Function := A;
PB14_EIC_EXTINT14 : constant Peripheral_Function := A;
PB28_EIC_EXTINT14 : constant Peripheral_Function := A;
PB30_EIC_EXTINT14 : constant Peripheral_Function := A;
PC14_EIC_EXTINT14 : constant Peripheral_Function := A;
PC30_EIC_EXTINT14 : constant Peripheral_Function := A;
PA14_EIC_EXTINT14 : constant Peripheral_Function := A;
PA15_EIC_EXTINT15 : constant Peripheral_Function := A;
PA31_EIC_EXTINT15 : constant Peripheral_Function := A;
PB15_EIC_EXTINT15 : constant Peripheral_Function := A;
PB29_EIC_EXTINT15 : constant Peripheral_Function := A;
PB31_EIC_EXTINT15 : constant Peripheral_Function := A;
PC15_EIC_EXTINT15 : constant Peripheral_Function := A;
PC31_EIC_EXTINT15 : constant Peripheral_Function := A;
PA08_EIC_NMI : constant Peripheral_Function := A;
PA30_GCLK_IO0 : constant Peripheral_Function := M;
PB14_GCLK_IO0 : constant Peripheral_Function := M;
PA14_GCLK_IO0 : constant Peripheral_Function := M;
PB22_GCLK_IO0 : constant Peripheral_Function := M;
PB15_GCLK_IO1 : constant Peripheral_Function := M;
PA15_GCLK_IO1 : constant Peripheral_Function := M;
PB23_GCLK_IO1 : constant Peripheral_Function := M;
PA27_GCLK_IO1 : constant Peripheral_Function := M;
PA16_GCLK_IO2 : constant Peripheral_Function := M;
PB16_GCLK_IO2 : constant Peripheral_Function := M;
PA17_GCLK_IO3 : constant Peripheral_Function := M;
PB17_GCLK_IO3 : constant Peripheral_Function := M;
PA10_GCLK_IO4 : constant Peripheral_Function := M;
PB10_GCLK_IO4 : constant Peripheral_Function := M;
PB18_GCLK_IO4 : constant Peripheral_Function := M;
PA11_GCLK_IO5 : constant Peripheral_Function := M;
PB11_GCLK_IO5 : constant Peripheral_Function := M;
PB19_GCLK_IO5 : constant Peripheral_Function := M;
PB12_GCLK_IO6 : constant Peripheral_Function := M;
PB20_GCLK_IO6 : constant Peripheral_Function := M;
PB13_GCLK_IO7 : constant Peripheral_Function := M;
PB21_GCLK_IO7 : constant Peripheral_Function := M;
PA09_I2S_FS0 : constant Peripheral_Function := J;
PA20_I2S_FS0 : constant Peripheral_Function := J;
PA23_I2S_FS1 : constant Peripheral_Function := J;
PB11_I2S_FS1 : constant Peripheral_Function := J;
PA08_I2S_MCK0 : constant Peripheral_Function := J;
PB17_I2S_MCK0 : constant Peripheral_Function := J;
PB29_I2S_MCK1 : constant Peripheral_Function := J;
PB13_I2S_MCK1 : constant Peripheral_Function := J;
PA10_I2S_SCK0 : constant Peripheral_Function := J;
PB16_I2S_SCK0 : constant Peripheral_Function := J;
PB28_I2S_SCK1 : constant Peripheral_Function := J;
PB12_I2S_SCK1 : constant Peripheral_Function := J;
PA22_I2S_SDI : constant Peripheral_Function := J;
PB10_I2S_SDI : constant Peripheral_Function := J;
PA11_I2S_SDO : constant Peripheral_Function := J;
PA21_I2S_SDO : constant Peripheral_Function := J;
PA14_PCC_CLK : constant Peripheral_Function := K;
PA16_PCC_DATA0 : constant Peripheral_Function := K;
PA17_PCC_DATA1 : constant Peripheral_Function := K;
PA18_PCC_DATA2 : constant Peripheral_Function := K;
PA19_PCC_DATA3 : constant Peripheral_Function := K;
PA20_PCC_DATA4 : constant Peripheral_Function := K;
PA21_PCC_DATA5 : constant Peripheral_Function := K;
PA22_PCC_DATA6 : constant Peripheral_Function := K;
PA23_PCC_DATA7 : constant Peripheral_Function := K;
PB14_PCC_DATA8 : constant Peripheral_Function := K;
PB15_PCC_DATA9 : constant Peripheral_Function := K;
PC12_PCC_DATA10 : constant Peripheral_Function := K;
PC13_PCC_DATA11 : constant Peripheral_Function := K;
PC14_PCC_DATA12 : constant Peripheral_Function := K;
PC15_PCC_DATA13 : constant Peripheral_Function := K;
PA12_PCC_DEN1 : constant Peripheral_Function := K;
PA13_PCC_DEN2 : constant Peripheral_Function := K;
PB18_PDEC_QDI0 : constant Peripheral_Function := G;
PB23_PDEC_QDI0 : constant Peripheral_Function := G;
PC16_PDEC_QDI0 : constant Peripheral_Function := G;
PA24_PDEC_QDI0 : constant Peripheral_Function := G;
PB19_PDEC_QDI1 : constant Peripheral_Function := G;
PB24_PDEC_QDI1 : constant Peripheral_Function := G;
PC17_PDEC_QDI1 : constant Peripheral_Function := G;
PA25_PDEC_QDI1 : constant Peripheral_Function := G;
PB20_PDEC_QDI2 : constant Peripheral_Function := G;
PB25_PDEC_QDI2 : constant Peripheral_Function := G;
PC18_PDEC_QDI2 : constant Peripheral_Function := G;
PB22_PDEC_QDI2 : constant Peripheral_Function := G;
PB11_QSPI_CS : constant Peripheral_Function := H;
PA08_QSPI_DATA0 : constant Peripheral_Function := H;
PA09_QSPI_DATA1 : constant Peripheral_Function := H;
PA10_QSPI_DATA2 : constant Peripheral_Function := H;
PA11_QSPI_DATA3 : constant Peripheral_Function := H;
PB10_QSPI_SCK : constant Peripheral_Function := H;
PA06_SDHC0_SDCD : constant Peripheral_Function := I;
PA12_SDHC0_SDCD : constant Peripheral_Function := I;
PB12_SDHC0_SDCD : constant Peripheral_Function := I;
PC06_SDHC0_SDCD : constant Peripheral_Function := I;
PB11_SDHC0_SDCK : constant Peripheral_Function := I;
PA08_SDHC0_SDCMD : constant Peripheral_Function := I;
PA09_SDHC0_SDDAT0 : constant Peripheral_Function := I;
PA10_SDHC0_SDDAT1 : constant Peripheral_Function := I;
PA11_SDHC0_SDDAT2 : constant Peripheral_Function := I;
PB10_SDHC0_SDDAT3 : constant Peripheral_Function := I;
PA07_SDHC0_SDWP : constant Peripheral_Function := I;
PA13_SDHC0_SDWP : constant Peripheral_Function := I;
PB13_SDHC0_SDWP : constant Peripheral_Function := I;
PC07_SDHC0_SDWP : constant Peripheral_Function := I;
PB16_SDHC1_SDCD : constant Peripheral_Function := I;
PC20_SDHC1_SDCD : constant Peripheral_Function := I;
PD20_SDHC1_SDCD : constant Peripheral_Function := I;
PA21_SDHC1_SDCK : constant Peripheral_Function := I;
PA20_SDHC1_SDCMD : constant Peripheral_Function := I;
PB18_SDHC1_SDDAT0 : constant Peripheral_Function := I;
PB19_SDHC1_SDDAT1 : constant Peripheral_Function := I;
PB20_SDHC1_SDDAT2 : constant Peripheral_Function := I;
PB21_SDHC1_SDDAT3 : constant Peripheral_Function := I;
PB17_SDHC1_SDWP : constant Peripheral_Function := I;
PC21_SDHC1_SDWP : constant Peripheral_Function := I;
PD21_SDHC1_SDWP : constant Peripheral_Function := I;
PA04_SERCOM0_PAD0 : constant Peripheral_Function := D;
PC17_SERCOM0_PAD0 : constant Peripheral_Function := D;
PA08_SERCOM0_PAD0 : constant Peripheral_Function := C;
PB24_SERCOM0_PAD0 : constant Peripheral_Function := C;
PA05_SERCOM0_PAD1 : constant Peripheral_Function := D;
PC16_SERCOM0_PAD1 : constant Peripheral_Function := D;
PA09_SERCOM0_PAD1 : constant Peripheral_Function := C;
PB25_SERCOM0_PAD1 : constant Peripheral_Function := C;
PA06_SERCOM0_PAD2 : constant Peripheral_Function := D;
PC18_SERCOM0_PAD2 : constant Peripheral_Function := D;
PA10_SERCOM0_PAD2 : constant Peripheral_Function := C;
PC24_SERCOM0_PAD2 : constant Peripheral_Function := C;
PA07_SERCOM0_PAD3 : constant Peripheral_Function := D;
PC19_SERCOM0_PAD3 : constant Peripheral_Function := D;
PA11_SERCOM0_PAD3 : constant Peripheral_Function := C;
PC25_SERCOM0_PAD3 : constant Peripheral_Function := C;
PA00_SERCOM1_PAD0 : constant Peripheral_Function := D;
PA16_SERCOM1_PAD0 : constant Peripheral_Function := C;
PC22_SERCOM1_PAD0 : constant Peripheral_Function := C;
PC27_SERCOM1_PAD0 : constant Peripheral_Function := C;
PA01_SERCOM1_PAD1 : constant Peripheral_Function := D;
PA17_SERCOM1_PAD1 : constant Peripheral_Function := C;
PC23_SERCOM1_PAD1 : constant Peripheral_Function := C;
PC28_SERCOM1_PAD1 : constant Peripheral_Function := C;
PA30_SERCOM1_PAD2 : constant Peripheral_Function := D;
PA18_SERCOM1_PAD2 : constant Peripheral_Function := C;
PB22_SERCOM1_PAD2 : constant Peripheral_Function := C;
PD20_SERCOM1_PAD2 : constant Peripheral_Function := C;
PA31_SERCOM1_PAD3 : constant Peripheral_Function := D;
PA19_SERCOM1_PAD3 : constant Peripheral_Function := C;
PB23_SERCOM1_PAD3 : constant Peripheral_Function := C;
PD21_SERCOM1_PAD3 : constant Peripheral_Function := C;
PA09_SERCOM2_PAD0 : constant Peripheral_Function := D;
PB25_SERCOM2_PAD0 : constant Peripheral_Function := D;
PA12_SERCOM2_PAD0 : constant Peripheral_Function := C;
PB26_SERCOM2_PAD0 : constant Peripheral_Function := C;
PA08_SERCOM2_PAD1 : constant Peripheral_Function := D;
PB24_SERCOM2_PAD1 : constant Peripheral_Function := D;
PA13_SERCOM2_PAD1 : constant Peripheral_Function := C;
PB27_SERCOM2_PAD1 : constant Peripheral_Function := C;
PA10_SERCOM2_PAD2 : constant Peripheral_Function := D;
PC24_SERCOM2_PAD2 : constant Peripheral_Function := D;
PB28_SERCOM2_PAD2 : constant Peripheral_Function := C;
PA14_SERCOM2_PAD2 : constant Peripheral_Function := C;
PA11_SERCOM2_PAD3 : constant Peripheral_Function := D;
PC25_SERCOM2_PAD3 : constant Peripheral_Function := D;
PB29_SERCOM2_PAD3 : constant Peripheral_Function := C;
PA15_SERCOM2_PAD3 : constant Peripheral_Function := C;
PA17_SERCOM3_PAD0 : constant Peripheral_Function := D;
PC23_SERCOM3_PAD0 : constant Peripheral_Function := D;
PA22_SERCOM3_PAD0 : constant Peripheral_Function := C;
PB20_SERCOM3_PAD0 : constant Peripheral_Function := C;
PA16_SERCOM3_PAD1 : constant Peripheral_Function := D;
PC22_SERCOM3_PAD1 : constant Peripheral_Function := D;
PA23_SERCOM3_PAD1 : constant Peripheral_Function := C;
PB21_SERCOM3_PAD1 : constant Peripheral_Function := C;
PA18_SERCOM3_PAD2 : constant Peripheral_Function := D;
PA20_SERCOM3_PAD2 : constant Peripheral_Function := D;
PD20_SERCOM3_PAD2 : constant Peripheral_Function := D;
PA24_SERCOM3_PAD2 : constant Peripheral_Function := C;
PA19_SERCOM3_PAD3 : constant Peripheral_Function := D;
PA21_SERCOM3_PAD3 : constant Peripheral_Function := D;
PD21_SERCOM3_PAD3 : constant Peripheral_Function := D;
PA25_SERCOM3_PAD3 : constant Peripheral_Function := C;
PA13_SERCOM4_PAD0 : constant Peripheral_Function := D;
PB08_SERCOM4_PAD0 : constant Peripheral_Function := D;
PB27_SERCOM4_PAD0 : constant Peripheral_Function := D;
PB12_SERCOM4_PAD0 : constant Peripheral_Function := C;
PA12_SERCOM4_PAD1 : constant Peripheral_Function := D;
PB09_SERCOM4_PAD1 : constant Peripheral_Function := D;
PB26_SERCOM4_PAD1 : constant Peripheral_Function := D;
PB13_SERCOM4_PAD1 : constant Peripheral_Function := C;
PA14_SERCOM4_PAD2 : constant Peripheral_Function := D;
PB10_SERCOM4_PAD2 : constant Peripheral_Function := D;
PB28_SERCOM4_PAD2 : constant Peripheral_Function := D;
PB14_SERCOM4_PAD2 : constant Peripheral_Function := C;
PB11_SERCOM4_PAD3 : constant Peripheral_Function := D;
PB29_SERCOM4_PAD3 : constant Peripheral_Function := D;
PA15_SERCOM4_PAD3 : constant Peripheral_Function := D;
PB15_SERCOM4_PAD3 : constant Peripheral_Function := C;
PA23_SERCOM5_PAD0 : constant Peripheral_Function := D;
PB02_SERCOM5_PAD0 : constant Peripheral_Function := D;
PB31_SERCOM5_PAD0 : constant Peripheral_Function := D;
PB16_SERCOM5_PAD0 : constant Peripheral_Function := C;
PA22_SERCOM5_PAD1 : constant Peripheral_Function := D;
PB03_SERCOM5_PAD1 : constant Peripheral_Function := D;
PB30_SERCOM5_PAD1 : constant Peripheral_Function := D;
PB17_SERCOM5_PAD1 : constant Peripheral_Function := C;
PA24_SERCOM5_PAD2 : constant Peripheral_Function := D;
PB00_SERCOM5_PAD2 : constant Peripheral_Function := D;
PB22_SERCOM5_PAD2 : constant Peripheral_Function := D;
PA20_SERCOM5_PAD2 : constant Peripheral_Function := C;
PB18_SERCOM5_PAD2 : constant Peripheral_Function := C;
PA25_SERCOM5_PAD3 : constant Peripheral_Function := D;
PB01_SERCOM5_PAD3 : constant Peripheral_Function := D;
PB23_SERCOM5_PAD3 : constant Peripheral_Function := D;
PA21_SERCOM5_PAD3 : constant Peripheral_Function := C;
PB19_SERCOM5_PAD3 : constant Peripheral_Function := C;
PD09_SERCOM6_PAD0 : constant Peripheral_Function := D;
PC13_SERCOM6_PAD0 : constant Peripheral_Function := D;
PC04_SERCOM6_PAD0 : constant Peripheral_Function := C;
PC16_SERCOM6_PAD0 : constant Peripheral_Function := C;
PD08_SERCOM6_PAD1 : constant Peripheral_Function := D;
PC12_SERCOM6_PAD1 : constant Peripheral_Function := D;
PC05_SERCOM6_PAD1 : constant Peripheral_Function := C;
PC17_SERCOM6_PAD1 : constant Peripheral_Function := C;
PC14_SERCOM6_PAD2 : constant Peripheral_Function := D;
PD10_SERCOM6_PAD2 : constant Peripheral_Function := D;
PC06_SERCOM6_PAD2 : constant Peripheral_Function := C;
PC10_SERCOM6_PAD2 : constant Peripheral_Function := C;
PC18_SERCOM6_PAD2 : constant Peripheral_Function := C;
PC15_SERCOM6_PAD3 : constant Peripheral_Function := D;
PD11_SERCOM6_PAD3 : constant Peripheral_Function := D;
PC07_SERCOM6_PAD3 : constant Peripheral_Function := C;
PC11_SERCOM6_PAD3 : constant Peripheral_Function := C;
PC19_SERCOM6_PAD3 : constant Peripheral_Function := C;
PB21_SERCOM7_PAD0 : constant Peripheral_Function := D;
PD08_SERCOM7_PAD0 : constant Peripheral_Function := C;
PB30_SERCOM7_PAD0 : constant Peripheral_Function := C;
PC12_SERCOM7_PAD0 : constant Peripheral_Function := C;
PB20_SERCOM7_PAD1 : constant Peripheral_Function := D;
PD09_SERCOM7_PAD1 : constant Peripheral_Function := C;
PB31_SERCOM7_PAD1 : constant Peripheral_Function := C;
PC13_SERCOM7_PAD1 : constant Peripheral_Function := C;
PB18_SERCOM7_PAD2 : constant Peripheral_Function := D;
PC10_SERCOM7_PAD2 : constant Peripheral_Function := D;
PC14_SERCOM7_PAD2 : constant Peripheral_Function := C;
PD10_SERCOM7_PAD2 : constant Peripheral_Function := C;
PA30_SERCOM7_PAD2 : constant Peripheral_Function := C;
PB19_SERCOM7_PAD3 : constant Peripheral_Function := D;
PC11_SERCOM7_PAD3 : constant Peripheral_Function := D;
PC15_SERCOM7_PAD3 : constant Peripheral_Function := C;
PD11_SERCOM7_PAD3 : constant Peripheral_Function := C;
PA31_SERCOM7_PAD3 : constant Peripheral_Function := C;
PA04_TC0_WO0 : constant Peripheral_Function := E;
PA08_TC0_WO0 : constant Peripheral_Function := E;
PB30_TC0_WO0 : constant Peripheral_Function := E;
PA05_TC0_WO1 : constant Peripheral_Function := E;
PA09_TC0_WO1 : constant Peripheral_Function := E;
PB31_TC0_WO1 : constant Peripheral_Function := E;
PA06_TC1_WO0 : constant Peripheral_Function := E;
PA10_TC1_WO0 : constant Peripheral_Function := E;
PA07_TC1_WO1 : constant Peripheral_Function := E;
PA11_TC1_WO1 : constant Peripheral_Function := E;
PA12_TC2_WO0 : constant Peripheral_Function := E;
PA16_TC2_WO0 : constant Peripheral_Function := E;
PA00_TC2_WO0 : constant Peripheral_Function := E;
PA01_TC2_WO1 : constant Peripheral_Function := E;
PA13_TC2_WO1 : constant Peripheral_Function := E;
PA17_TC2_WO1 : constant Peripheral_Function := E;
PA18_TC3_WO0 : constant Peripheral_Function := E;
PA14_TC3_WO0 : constant Peripheral_Function := E;
PA15_TC3_WO1 : constant Peripheral_Function := E;
PA19_TC3_WO1 : constant Peripheral_Function := E;
PA22_TC4_WO0 : constant Peripheral_Function := E;
PB08_TC4_WO0 : constant Peripheral_Function := E;
PB12_TC4_WO0 : constant Peripheral_Function := E;
PA23_TC4_WO1 : constant Peripheral_Function := E;
PB09_TC4_WO1 : constant Peripheral_Function := E;
PB13_TC4_WO1 : constant Peripheral_Function := E;
PA24_TC5_WO0 : constant Peripheral_Function := E;
PB10_TC5_WO0 : constant Peripheral_Function := E;
PB14_TC5_WO0 : constant Peripheral_Function := E;
PA25_TC5_WO1 : constant Peripheral_Function := E;
PB11_TC5_WO1 : constant Peripheral_Function := E;
PB15_TC5_WO1 : constant Peripheral_Function := E;
PA30_TC6_WO0 : constant Peripheral_Function := E;
PB02_TC6_WO0 : constant Peripheral_Function := E;
PB16_TC6_WO0 : constant Peripheral_Function := E;
PA31_TC6_WO1 : constant Peripheral_Function := E;
PB03_TC6_WO1 : constant Peripheral_Function := E;
PB17_TC6_WO1 : constant Peripheral_Function := E;
PA20_TC7_WO0 : constant Peripheral_Function := E;
PB00_TC7_WO0 : constant Peripheral_Function := E;
PB22_TC7_WO0 : constant Peripheral_Function := E;
PA21_TC7_WO1 : constant Peripheral_Function := E;
PB01_TC7_WO1 : constant Peripheral_Function := E;
PB23_TC7_WO1 : constant Peripheral_Function := E;
PA20_TCC0_WO0 : constant Peripheral_Function := G;
PB12_TCC0_WO0 : constant Peripheral_Function := G;
PA08_TCC0_WO0 : constant Peripheral_Function := F;
PC04_TCC0_WO0 : constant Peripheral_Function := F;
PC10_TCC0_WO0 : constant Peripheral_Function := F;
PC16_TCC0_WO0 : constant Peripheral_Function := F;
PA21_TCC0_WO1 : constant Peripheral_Function := G;
PB13_TCC0_WO1 : constant Peripheral_Function := G;
PA09_TCC0_WO1 : constant Peripheral_Function := F;
PC11_TCC0_WO1 : constant Peripheral_Function := F;
PC17_TCC0_WO1 : constant Peripheral_Function := F;
PD08_TCC0_WO1 : constant Peripheral_Function := F;
PA22_TCC0_WO2 : constant Peripheral_Function := G;
PB14_TCC0_WO2 : constant Peripheral_Function := G;
PA10_TCC0_WO2 : constant Peripheral_Function := F;
PC12_TCC0_WO2 : constant Peripheral_Function := F;
PC18_TCC0_WO2 : constant Peripheral_Function := F;
PD09_TCC0_WO2 : constant Peripheral_Function := F;
PA23_TCC0_WO3 : constant Peripheral_Function := G;
PB15_TCC0_WO3 : constant Peripheral_Function := G;
PA11_TCC0_WO3 : constant Peripheral_Function := F;
PC13_TCC0_WO3 : constant Peripheral_Function := F;
PC19_TCC0_WO3 : constant Peripheral_Function := F;
PD10_TCC0_WO3 : constant Peripheral_Function := F;
PA16_TCC0_WO4 : constant Peripheral_Function := G;
PB16_TCC0_WO4 : constant Peripheral_Function := G;
PB10_TCC0_WO4 : constant Peripheral_Function := F;
PC14_TCC0_WO4 : constant Peripheral_Function := F;
PC20_TCC0_WO4 : constant Peripheral_Function := F;
PD11_TCC0_WO4 : constant Peripheral_Function := F;
PA17_TCC0_WO5 : constant Peripheral_Function := G;
PB17_TCC0_WO5 : constant Peripheral_Function := G;
PB11_TCC0_WO5 : constant Peripheral_Function := F;
PC15_TCC0_WO5 : constant Peripheral_Function := F;
PC21_TCC0_WO5 : constant Peripheral_Function := F;
PD12_TCC0_WO5 : constant Peripheral_Function := F;
PA18_TCC0_WO6 : constant Peripheral_Function := G;
PB30_TCC0_WO6 : constant Peripheral_Function := G;
PA12_TCC0_WO6 : constant Peripheral_Function := F;
PC22_TCC0_WO6 : constant Peripheral_Function := F;
PA19_TCC0_WO7 : constant Peripheral_Function := G;
PB31_TCC0_WO7 : constant Peripheral_Function := G;
PA13_TCC0_WO7 : constant Peripheral_Function := F;
PC23_TCC0_WO7 : constant Peripheral_Function := F;
PB10_TCC1_WO0 : constant Peripheral_Function := G;
PC14_TCC1_WO0 : constant Peripheral_Function := G;
PA16_TCC1_WO0 : constant Peripheral_Function := F;
PB18_TCC1_WO0 : constant Peripheral_Function := F;
PD20_TCC1_WO0 : constant Peripheral_Function := F;
PB11_TCC1_WO1 : constant Peripheral_Function := G;
PC15_TCC1_WO1 : constant Peripheral_Function := G;
PA17_TCC1_WO1 : constant Peripheral_Function := F;
PB19_TCC1_WO1 : constant Peripheral_Function := F;
PD21_TCC1_WO1 : constant Peripheral_Function := F;
PA12_TCC1_WO2 : constant Peripheral_Function := G;
PA14_TCC1_WO2 : constant Peripheral_Function := G;
PA18_TCC1_WO2 : constant Peripheral_Function := F;
PB20_TCC1_WO2 : constant Peripheral_Function := F;
PB26_TCC1_WO2 : constant Peripheral_Function := F;
PA13_TCC1_WO3 : constant Peripheral_Function := G;
PA15_TCC1_WO3 : constant Peripheral_Function := G;
PA19_TCC1_WO3 : constant Peripheral_Function := F;
PB21_TCC1_WO3 : constant Peripheral_Function := F;
PB27_TCC1_WO3 : constant Peripheral_Function := F;
PA08_TCC1_WO4 : constant Peripheral_Function := G;
PC10_TCC1_WO4 : constant Peripheral_Function := G;
PA20_TCC1_WO4 : constant Peripheral_Function := F;
PB28_TCC1_WO4 : constant Peripheral_Function := F;
PA09_TCC1_WO5 : constant Peripheral_Function := G;
PC11_TCC1_WO5 : constant Peripheral_Function := G;
PA21_TCC1_WO5 : constant Peripheral_Function := F;
PB29_TCC1_WO5 : constant Peripheral_Function := F;
PA10_TCC1_WO6 : constant Peripheral_Function := G;
PC12_TCC1_WO6 : constant Peripheral_Function := G;
PA22_TCC1_WO6 : constant Peripheral_Function := F;
PA11_TCC1_WO7 : constant Peripheral_Function := G;
PC13_TCC1_WO7 : constant Peripheral_Function := G;
PA23_TCC1_WO7 : constant Peripheral_Function := F;
PA14_TCC2_WO0 : constant Peripheral_Function := F;
PA30_TCC2_WO0 : constant Peripheral_Function := F;
PA15_TCC2_WO1 : constant Peripheral_Function := F;
PA31_TCC2_WO1 : constant Peripheral_Function := F;
PA24_TCC2_WO2 : constant Peripheral_Function := F;
PB02_TCC2_WO2 : constant Peripheral_Function := F;
PB12_TCC3_WO0 : constant Peripheral_Function := F;
PB16_TCC3_WO0 : constant Peripheral_Function := F;
PB13_TCC3_WO1 : constant Peripheral_Function := F;
PB17_TCC3_WO1 : constant Peripheral_Function := F;
PB14_TCC4_WO0 : constant Peripheral_Function := F;
PB30_TCC4_WO0 : constant Peripheral_Function := F;
PB15_TCC4_WO1 : constant Peripheral_Function := F;
PB31_TCC4_WO1 : constant Peripheral_Function := F;
PA24_USB_DM : constant Peripheral_Function := H;
PA25_USB_DP : constant Peripheral_Function := H;
PA23_USB_SOF_1KHZ : constant Peripheral_Function := H;
PB22_USB_SOF_1KHZ : constant Peripheral_Function := H;
end SAM.Functions;
| 65.277955 | 65 | 0.643941 |
10d9c8bca9f903bec89b5c00cc76bb634d2c0445 | 19,389 | ads | Ada | src/gl/implementation/gl-enums-getter.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | null | null | null | src/gl/implementation/gl-enums-getter.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | null | null | null | src/gl/implementation/gl-enums-getter.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | null | null | null | -- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with GL.Types;
package GL.Enums.Getter is
pragma Preelaborate;
type Parameter is
(Current_Color,
Current_Index,
Current_Normal,
Current_Texture_Coords,
Current_Raster_Color,
Current_Raster_Index,
Current_Raster_Texture_Coords,
Current_Raster_Position,
Current_Raster_Position_Valid,
Current_Raster_Distance,
Point_Smooth,
Point_Size,
Point_Size_Range,
Point_Size_Granularity,
Line_Smooth,
Line_Width,
Smooth_Line_Width_Range,
Smooth_Line_Width_Granularity,
Line_Stipple,
Line_Stipple_Pattern,
Line_Stipple_Repeat,
List_Mode,
Max_List_Nesting,
List_Base,
List_Index,
Polygon_Mode,
Polygon_Smooth,
Polygon_Stipple,
Edge_Flag,
Cull_Face,
Cull_Face_Mode,
Front_Face,
Lighting,
Light_Model_Local_Viewer,
Light_Model_Two_Side,
Light_Model_Ambient,
Shade_Model,
Color_Material_Face,
Color_Material_Parameter,
Color_Material,
Fog,
Fog_Index,
Fog_Density,
Fog_Start,
Fog_End,
Fog_Mode,
Fog_Color,
Depth_Range,
Depth_Test,
Depth_Writemask,
Depth_Clear_Value,
Depth_Func,
Accum_Clear_Value,
Stencil_Test,
Stencil_Clear_Value,
Stencil_Func,
Stencil_Value_Mask,
Stencil_Fail,
Stencil_Pass_Depth_Fail,
Stencil_Pass_Depth_Pass,
Stencil_Ref,
Stencil_Writemask,
Matrix_Mode,
Normalize,
Viewport,
Modelview_Stack_Depth,
Projection_Stack_Depth,
Texture_Stack_Depth,
Modelview_Matrix,
Projection_Matrix,
Texture_Matrix,
Attrib_Stack_Depth,
Client_Attrib_Stack_Depth,
Alpha_Test,
Alpha_Test_Func,
Alpha_Test_Ref,
Dither,
Blend_Dst,
Blend_Src,
Blend,
Logic_Op_Mode,
Index_Logic_Op,
Color_Logic_Op,
Aux_Buffers,
Draw_Buffer,
Read_Buffer,
Scissor_Box,
Scissor_Test,
Index_Clear_Value,
Index_Writemask,
Color_Clear_Value,
Color_Writemask,
Index_Mode,
Rgba_Mode,
Doublebuffer,
Stereo,
Render_Mode,
Perspective_Correction_Hint,
Point_Smooth_Hint,
Line_Smooth_Hint,
Polygon_Smooth_Hint,
Fog_Hint,
Texture_Gen_S,
Texture_Gen_T,
Texture_Gen_R,
Texture_Gen_Q,
Pixel_Map_I_To_I,
Pixel_Map_S_To_S,
Pixel_Map_I_To_R,
Pixel_Map_I_To_G,
Pixel_Map_I_To_B,
Pixel_Map_I_To_A,
Pixel_Map_R_To_R,
Pixel_Map_G_To_G,
Pixel_Map_B_To_B,
Pixel_Map_A_To_A,
Pixel_Map_I_To_I_Size,
Pixel_Map_S_To_S_Size,
Pixel_Map_I_To_R_Size,
Pixel_Map_I_To_G_Size,
Pixel_Map_I_To_B_Size,
Pixel_Map_I_To_A_Size,
Pixel_Map_R_To_R_Size,
Pixel_Map_G_To_G_Size,
Pixel_Map_B_To_B_Size,
Pixel_Map_A_To_A_Size,
Unpack_Swap_Bytes,
Unpack_Lsb_First,
Unpack_Row_Length,
Unpack_Skip_Rows,
Unpack_Skip_Pixels,
Unpack_Alignment,
Pack_Swap_Bytes,
Pack_Lsb_First,
Pack_Row_Length,
Pack_Skip_Rows,
Pack_Skip_Pixels,
Pack_Alignment,
Map_Color,
Map_Stencil,
Index_Shift,
Index_Offset,
Red_Scale,
Red_Bias,
Zoom_X,
Zoom_Y,
Green_Scale,
Green_Bias,
Blue_Scale,
Blue_Bias,
Alpha_Scale,
Alpha_Bias,
Depth_Scale,
Depth_Bias,
Max_Eval_Order,
Max_Lights,
Max_Clip_Planes,
Max_Texture_Size,
Max_Pixel_Map_Table,
Max_Attrib_Stack_Depth,
Max_Modelview_Stack_Depth,
Max_Name_Stack_Depth,
Max_Projection_Stack_Depth,
Max_Texture_Stack_Depth,
Max_Viewport_Dims,
Max_Client_Attrib_Stack_Depth,
Subpixel_Bits,
Index_Bits,
Red_Bits,
Green_Bits,
Blue_Bits,
Alpha_Bits,
Depth_Bits,
Stencil_Bits,
Accum_Red_Bits,
Accum_Green_Bits,
Accum_Blue_Bits,
Accum_Alpha_Bits,
Name_Stack_Depth,
Auto_Normal,
Map1_Color_4,
Map1_Index,
Map1_Normal,
Map1_Texture_Coord_1,
Map1_Texture_Coord_2,
Map1_Texture_Coord_3,
Map1_Texture_Coord_4,
Map1_Vertex_3,
Map1_Vertex_4,
Map2_Color_4,
Map2_Index,
Map2_Normal,
Map2_Texture_Coord_1,
Map2_Texture_Coord_2,
Map2_Texture_Coord_3,
Map2_Texture_Coord_4,
Map2_Vertex_3,
Map2_Vertex_4,
Map1_Grid_Domain,
Map1_Grid_Segments,
Map2_Grid_Domain,
Map2_Grid_Segments,
Texture_1D,
Texture_2D,
Feedback_Buffer_Pointer,
Feedback_Buffer_Size,
Feedback_Buffer_Type,
Selection_Buffer_Pointer,
Selection_Buffer_Size,
Blend_Color,
Blend_Equation_RGB,
Pack_Skip_Images,
Pack_Image_Height,
Unpack_Skip_Images,
Unpack_Image_Height,
Blend_Dst_RGB,
Blend_Src_RGB,
Blend_Dst_Alpha,
Blend_Src_Alpha,
Point_Fade_Threshold_Size,
Light_Model_Color_Control,
Major_Version,
Minor_Version,
Num_Extensions,
Num_Shading_Language_Versions,
Current_Fog_Coord,
Current_Secondary_Color,
Aliased_Line_Width_Range,
Active_Texture,
Stencil_Back_Func,
Stencil_Back_Fail,
Stencil_Back_Pass_Depth_Fail,
Stencil_Back_Pass_Depth_Pass,
Blend_Equation_Alpha,
Query_Result,
Query_Result_Available,
Max_Combined_Texture_Image_Units,
Stencil_Back_Ref,
Stencil_Back_Value_Mask,
Stencil_Back_Writemask,
Max_Framebuffer_Width,
Max_Framebuffer_Height,
Max_Framebuffer_Layers,
Max_Framebuffer_Samples);
for Parameter use
(Current_Color => 16#0B00#,
Current_Index => 16#0B01#,
Current_Normal => 16#0B02#,
Current_Texture_Coords => 16#0B03#,
Current_Raster_Color => 16#0B04#,
Current_Raster_Index => 16#0B05#,
Current_Raster_Texture_Coords => 16#0B06#,
Current_Raster_Position => 16#0B07#,
Current_Raster_Position_Valid => 16#0B08#,
Current_Raster_Distance => 16#0B09#,
Point_Smooth => 16#0B10#,
Point_Size => 16#0B11#,
Point_Size_Range => 16#0B12#,
Point_Size_Granularity => 16#0B13#,
Line_Smooth => 16#0B20#,
Line_Width => 16#0B21#,
Smooth_Line_Width_Range => 16#0B22#,
Smooth_Line_Width_Granularity => 16#0B23#,
Line_Stipple => 16#0B24#,
Line_Stipple_Pattern => 16#0B25#,
Line_Stipple_Repeat => 16#0B26#,
List_Mode => 16#0B30#,
Max_List_Nesting => 16#0B31#,
List_Base => 16#0B32#,
List_Index => 16#0B33#,
Polygon_Mode => 16#0B40#,
Polygon_Smooth => 16#0B41#,
Polygon_Stipple => 16#0B42#,
Edge_Flag => 16#0B43#,
Cull_Face => 16#0B44#,
Cull_Face_Mode => 16#0B45#,
Front_Face => 16#0B46#,
Lighting => 16#0B50#,
Light_Model_Local_Viewer => 16#0B51#,
Light_Model_Two_Side => 16#0B52#,
Light_Model_Ambient => 16#0B53#,
Shade_Model => 16#0B54#,
Color_Material_Face => 16#0B55#,
Color_Material_Parameter => 16#0B56#,
Color_Material => 16#0B57#,
Fog => 16#0B60#,
Fog_Index => 16#0B61#,
Fog_Density => 16#0B62#,
Fog_Start => 16#0B63#,
Fog_End => 16#0B64#,
Fog_Mode => 16#0B65#,
Fog_Color => 16#0B66#,
Depth_Range => 16#0B70#,
Depth_Test => 16#0B71#,
Depth_Writemask => 16#0B72#,
Depth_Clear_Value => 16#0B73#,
Depth_Func => 16#0B74#,
Accum_Clear_Value => 16#0B80#,
Stencil_Test => 16#0B90#,
Stencil_Clear_Value => 16#0B91#,
Stencil_Func => 16#0B92#,
Stencil_Value_Mask => 16#0B93#,
Stencil_Fail => 16#0B94#,
Stencil_Pass_Depth_Fail => 16#0B95#,
Stencil_Pass_Depth_Pass => 16#0B96#,
Stencil_Ref => 16#0B97#,
Stencil_Writemask => 16#0B98#,
Matrix_Mode => 16#0BA0#,
Normalize => 16#0BA1#,
Viewport => 16#0BA2#,
Modelview_Stack_Depth => 16#0BA3#,
Projection_Stack_Depth => 16#0BA4#,
Texture_Stack_Depth => 16#0BA5#,
Modelview_Matrix => 16#0BA6#,
Projection_Matrix => 16#0BA7#,
Texture_Matrix => 16#0BA8#,
Attrib_Stack_Depth => 16#0BB0#,
Client_Attrib_Stack_Depth => 16#0BB1#,
Alpha_Test => 16#0BC0#,
Alpha_Test_Func => 16#0BC1#,
Alpha_Test_Ref => 16#0BC2#,
Dither => 16#0BD0#,
Blend_Dst => 16#0BE0#,
Blend_Src => 16#0BE1#,
Blend => 16#0BE2#,
Logic_Op_Mode => 16#0BF0#,
Index_Logic_Op => 16#0BF1#,
Color_Logic_Op => 16#0BF2#,
Aux_Buffers => 16#0C00#,
Draw_Buffer => 16#0C01#,
Read_Buffer => 16#0C02#,
Scissor_Box => 16#0C10#,
Scissor_Test => 16#0C11#,
Index_Clear_Value => 16#0C20#,
Index_Writemask => 16#0C21#,
Color_Clear_Value => 16#0C22#,
Color_Writemask => 16#0C23#,
Index_Mode => 16#0C30#,
Rgba_Mode => 16#0C31#,
Doublebuffer => 16#0C32#,
Stereo => 16#0C33#,
Render_Mode => 16#0C40#,
Perspective_Correction_Hint => 16#0C50#,
Point_Smooth_Hint => 16#0C51#,
Line_Smooth_Hint => 16#0C52#,
Polygon_Smooth_Hint => 16#0C53#,
Fog_Hint => 16#0C54#,
Texture_Gen_S => 16#0C60#,
Texture_Gen_T => 16#0C61#,
Texture_Gen_R => 16#0C62#,
Texture_Gen_Q => 16#0C63#,
Pixel_Map_I_To_I => 16#0C70#,
Pixel_Map_S_To_S => 16#0C71#,
Pixel_Map_I_To_R => 16#0C72#,
Pixel_Map_I_To_G => 16#0C73#,
Pixel_Map_I_To_B => 16#0C74#,
Pixel_Map_I_To_A => 16#0C75#,
Pixel_Map_R_To_R => 16#0C76#,
Pixel_Map_G_To_G => 16#0C77#,
Pixel_Map_B_To_B => 16#0C78#,
Pixel_Map_A_To_A => 16#0C79#,
Pixel_Map_I_To_I_Size => 16#0CB0#,
Pixel_Map_S_To_S_Size => 16#0CB1#,
Pixel_Map_I_To_R_Size => 16#0CB2#,
Pixel_Map_I_To_G_Size => 16#0CB3#,
Pixel_Map_I_To_B_Size => 16#0CB4#,
Pixel_Map_I_To_A_Size => 16#0CB5#,
Pixel_Map_R_To_R_Size => 16#0CB6#,
Pixel_Map_G_To_G_Size => 16#0CB7#,
Pixel_Map_B_To_B_Size => 16#0CB8#,
Pixel_Map_A_To_A_Size => 16#0CB9#,
Unpack_Swap_Bytes => 16#0CF0#,
Unpack_Lsb_First => 16#0CF1#,
Unpack_Row_Length => 16#0CF2#,
Unpack_Skip_Rows => 16#0CF3#,
Unpack_Skip_Pixels => 16#0CF4#,
Unpack_Alignment => 16#0CF5#,
Pack_Swap_Bytes => 16#0D00#,
Pack_Lsb_First => 16#0D01#,
Pack_Row_Length => 16#0D02#,
Pack_Skip_Rows => 16#0D03#,
Pack_Skip_Pixels => 16#0D04#,
Pack_Alignment => 16#0D05#,
Map_Color => 16#0D10#,
Map_Stencil => 16#0D11#,
Index_Shift => 16#0D12#,
Index_Offset => 16#0D13#,
Red_Scale => 16#0D14#,
Red_Bias => 16#0D15#,
Zoom_X => 16#0D16#,
Zoom_Y => 16#0D17#,
Green_Scale => 16#0D18#,
Green_Bias => 16#0D19#,
Blue_Scale => 16#0D1A#,
Blue_Bias => 16#0D1B#,
Alpha_Scale => 16#0D1C#,
Alpha_Bias => 16#0D1D#,
Depth_Scale => 16#0D1E#,
Depth_Bias => 16#0D1F#,
Max_Eval_Order => 16#0D30#,
Max_Lights => 16#0D31#,
Max_Clip_Planes => 16#0D32#,
Max_Texture_Size => 16#0D33#,
Max_Pixel_Map_Table => 16#0D34#,
Max_Attrib_Stack_Depth => 16#0D35#,
Max_Modelview_Stack_Depth => 16#0D36#,
Max_Name_Stack_Depth => 16#0D37#,
Max_Projection_Stack_Depth => 16#0D38#,
Max_Texture_Stack_Depth => 16#0D39#,
Max_Viewport_Dims => 16#0D3A#,
Max_Client_Attrib_Stack_Depth => 16#0D3B#,
Subpixel_Bits => 16#0D50#,
Index_Bits => 16#0D51#,
Red_Bits => 16#0D52#,
Green_Bits => 16#0D53#,
Blue_Bits => 16#0D54#,
Alpha_Bits => 16#0D55#,
Depth_Bits => 16#0D56#,
Stencil_Bits => 16#0D57#,
Accum_Red_Bits => 16#0D58#,
Accum_Green_Bits => 16#0D59#,
Accum_Blue_Bits => 16#0D5A#,
Accum_Alpha_Bits => 16#0D5B#,
Name_Stack_Depth => 16#0D70#,
Auto_Normal => 16#0D80#,
Map1_Color_4 => 16#0D90#,
Map1_Index => 16#0D91#,
Map1_Normal => 16#0D92#,
Map1_Texture_Coord_1 => 16#0D93#,
Map1_Texture_Coord_2 => 16#0D94#,
Map1_Texture_Coord_3 => 16#0D95#,
Map1_Texture_Coord_4 => 16#0D96#,
Map1_Vertex_3 => 16#0D97#,
Map1_Vertex_4 => 16#0D98#,
Map2_Color_4 => 16#0DB0#,
Map2_Index => 16#0DB1#,
Map2_Normal => 16#0DB2#,
Map2_Texture_Coord_1 => 16#0DB3#,
Map2_Texture_Coord_2 => 16#0DB4#,
Map2_Texture_Coord_3 => 16#0DB5#,
Map2_Texture_Coord_4 => 16#0DB6#,
Map2_Vertex_3 => 16#0DB7#,
Map2_Vertex_4 => 16#0DB8#,
Map1_Grid_Domain => 16#0DD0#,
Map1_Grid_Segments => 16#0DD1#,
Map2_Grid_Domain => 16#0DD2#,
Map2_Grid_Segments => 16#0DD3#,
Texture_1D => 16#0DE0#,
Texture_2D => 16#0DE1#,
Feedback_Buffer_Pointer => 16#0DF0#,
Feedback_Buffer_Size => 16#0DF1#,
Feedback_Buffer_Type => 16#0DF2#,
Selection_Buffer_Pointer => 16#0DF3#,
Selection_Buffer_Size => 16#0DF4#,
Blend_Color => 16#8005#,
Blend_Equation_RGB => 16#8009#,
Pack_Skip_Images => 16#806B#,
Pack_Image_Height => 16#806C#,
Unpack_Skip_Images => 16#806D#,
Unpack_Image_Height => 16#806E#,
Blend_Dst_RGB => 16#80C8#,
Blend_Src_RGB => 16#80C9#,
Blend_Dst_Alpha => 16#80CA#,
Blend_Src_Alpha => 16#80CB#,
Point_Fade_Threshold_Size => 16#8128#,
Light_Model_Color_Control => 16#81F8#,
Major_Version => 16#821B#,
Minor_Version => 16#821C#,
Num_Extensions => 16#821D#,
Num_Shading_Language_Versions => 16#82E9#,
Current_Fog_Coord => 16#8453#,
Current_Secondary_Color => 16#8459#,
Aliased_Line_Width_Range => 16#846E#,
Active_Texture => 16#84E0#,
Stencil_Back_Func => 16#8800#,
Stencil_Back_Fail => 16#8801#,
Stencil_Back_Pass_Depth_Fail => 16#8802#,
Stencil_Back_Pass_Depth_Pass => 16#8803#,
Blend_Equation_Alpha => 16#883D#,
Query_Result => 16#8866#,
Query_Result_Available => 16#8867#,
Max_Combined_Texture_Image_Units => 16#8B4D#,
Stencil_Back_Ref => 16#8CA3#,
Stencil_Back_Value_Mask => 16#8CA4#,
Stencil_Back_Writemask => 16#8CA5#,
Max_Framebuffer_Width => 16#9315#,
Max_Framebuffer_Height => 16#9316#,
Max_Framebuffer_Layers => 16#9317#,
Max_Framebuffer_Samples => 16#9318#);
for Parameter'Size use Low_Level.Enum'Size;
type String_Parameter is
(Vendor, Renderer, Version, Extensions, Shading_Language_Version);
for String_Parameter use
(Vendor => 16#1F00#,
Renderer => 16#1F01#,
Version => 16#1F02#,
Extensions => 16#1F03#,
Shading_Language_Version => 16#8B8C#);
for String_Parameter'Size use Low_Level.Enum'Size;
type Renderbuffer_Parameter is (Width, Height, Internal_Format, Red_Size,
Green_Size, Blue_Size, Alpha_Size,
Depth_Size, Stencil_Size);
for Renderbuffer_Parameter use (Width => 16#8D42#,
Height => 16#8D43#,
Internal_Format => 16#8D44#,
Red_Size => 16#8D50#,
Green_Size => 16#8D51#,
Blue_Size => 16#8D52#,
Alpha_Size => 16#8D53#,
Depth_Size => 16#8D54#,
Stencil_Size => 16#8D55#);
for Renderbuffer_Parameter'Size use Low_Level.Enum'Size;
-- declared here so that Max in GL.Enums.Indexes works
function Get_Max (Getter_Param : Parameter) return Types.Int;
end GL.Enums.Getter;
| 36.721591 | 76 | 0.512507 |
1c999b5bacbaad2cf68b4f46f6d62e977a210b97 | 4,043 | ads | Ada | src/natools-s_expressions-atom_buffers.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-s_expressions-atom_buffers.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-s_expressions-atom_buffers.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- Copyright (c) 2014, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.S_Expressions.Atom_Buffers implements an unbounded Atom designed --
-- to be used as an input buffer, accumulating data and extracting it as a --
-- single Atom object. --
-- It also provides an individual Octet accessor, used in parser internal --
-- recursive buffer. --
------------------------------------------------------------------------------
with Natools.S_Expressions.Atom_Refs;
package Natools.S_Expressions.Atom_Buffers is
pragma Preelaborate (Atom_Buffers);
type Atom_Buffer is new Ada.Streams.Root_Stream_Type with private;
pragma Preelaborable_Initialization (Atom_Buffer);
overriding procedure Write
(Buffer : in out Atom_Buffer;
Item : in Ada.Streams.Stream_Element_Array);
overriding procedure Read
(Buffer : in out Atom_Buffer;
Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
procedure Preallocate (Buffer : in out Atom_Buffer; Length : in Count);
-- Preallocate enough memory to append Length octets without
-- any further allocation.
procedure Append (Buffer : in out Atom_Buffer; Data : in Atom);
procedure Append (Buffer : in out Atom_Buffer; Data : in Octet);
-- Append Data after the end of Buffer
procedure Append_Reverse (Buffer : in out Atom_Buffer; Data : in Atom);
-- Append bytes from Atom from last to first
procedure Invert (Buffer : in out Atom_Buffer);
-- Invert the order of bytes (first becomes last, etc)
function Length (Buffer : Atom_Buffer) return Count;
function Capacity (Buffer : Atom_Buffer) return Count;
function Data (Buffer : Atom_Buffer) return Atom;
procedure Query
(Buffer : in Atom_Buffer;
Process : not null access procedure (Data : in Atom));
procedure Peek
(Buffer : in Atom_Buffer;
Data : out Atom;
Length : out Count);
function Element (Buffer : Atom_Buffer; Position : Count) return Octet;
-- Accessors to the whole buffer as an Atom
procedure Pop (Buffer : in out Atom_Buffer; Data : out Octet);
-- Remove last octet from Buffer and store it in Data
function Raw_Query (Buffer : Atom_Buffer) return Atom_Refs.Accessor;
-- Accessor to the whole allocated memory
procedure Hard_Reset (Buffer : in out Atom_Buffer);
-- Clear buffer and release internal memory
procedure Soft_Reset (Buffer : in out Atom_Buffer);
-- Clear buffer keeping internal memory
private
type Atom_Buffer is new Ada.Streams.Root_Stream_Type with record
Ref : Atom_Refs.Reference;
Available, Used : Count := 0;
end record;
end Natools.S_Expressions.Atom_Buffers;
| 45.943182 | 78 | 0.604254 |
c5369da60bac7959d861e3cc14889ac48db812bc | 10,792 | adb | Ada | src/security-auth.adb | jquorning/ada-security | b9aa8e7deffaf71d50d501e284b821b8b0f942c3 | [
"Apache-2.0"
] | 19 | 2015-01-18T23:04:59.000Z | 2021-11-30T10:39:10.000Z | src/security-auth.adb | jquorning/ada-security | b9aa8e7deffaf71d50d501e284b821b8b0f942c3 | [
"Apache-2.0"
] | 4 | 2020-08-06T15:37:51.000Z | 2022-02-04T20:19:39.000Z | src/security-auth.adb | jquorning/ada-security | b9aa8e7deffaf71d50d501e284b821b8b0f942c3 | [
"Apache-2.0"
] | 3 | 2021-01-04T10:23:22.000Z | 2022-01-30T21:45:49.000Z | -----------------------------------------------------------------------
-- security-openid -- OpenID 2.0 Support
-- Copyright (C) 2009, 2010, 2011, 2012, 2013, 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Util.Log.Loggers;
with Security.Auth.OpenID;
with Security.Auth.OAuth.Facebook;
with Security.Auth.OAuth.Googleplus;
with Security.Auth.OAuth.Yahoo;
with Security.Auth.OAuth.Github;
package body Security.Auth is
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Security.Auth");
Def_Factory : Factory_Access := Default_Factory'Access;
-- ------------------------------
-- Get the provider.
-- ------------------------------
function Get_Provider (Assoc : in Association) return String is
begin
return To_String (Assoc.Provider);
end Get_Provider;
-- ------------------------------
-- Get the email address
-- ------------------------------
function Get_Email (Auth : in Authentication) return String is
begin
return To_String (Auth.Email);
end Get_Email;
-- ------------------------------
-- Get the user first name.
-- ------------------------------
function Get_First_Name (Auth : in Authentication) return String is
begin
return To_String (Auth.First_Name);
end Get_First_Name;
-- ------------------------------
-- Get the user last name.
-- ------------------------------
function Get_Last_Name (Auth : in Authentication) return String is
begin
return To_String (Auth.Last_Name);
end Get_Last_Name;
-- ------------------------------
-- Get the user full name.
-- ------------------------------
function Get_Full_Name (Auth : in Authentication) return String is
begin
return To_String (Auth.Full_Name);
end Get_Full_Name;
-- ------------------------------
-- Get the user identity.
-- ------------------------------
function Get_Identity (Auth : in Authentication) return String is
begin
return To_String (Auth.Identity);
end Get_Identity;
-- ------------------------------
-- Get the user claimed identity.
-- ------------------------------
function Get_Claimed_Id (Auth : in Authentication) return String is
begin
return To_String (Auth.Claimed_Id);
end Get_Claimed_Id;
-- ------------------------------
-- Get the user language.
-- ------------------------------
function Get_Language (Auth : in Authentication) return String is
begin
return To_String (Auth.Language);
end Get_Language;
-- ------------------------------
-- Get the user country.
-- ------------------------------
function Get_Country (Auth : in Authentication) return String is
begin
return To_String (Auth.Country);
end Get_Country;
-- ------------------------------
-- Get the result of the authentication.
-- ------------------------------
function Get_Status (Auth : in Authentication) return Auth_Result is
begin
return Auth.Status;
end Get_Status;
-- ------------------------------
-- Default principal
-- ------------------------------
-- ------------------------------
-- Get the principal name.
-- ------------------------------
function Get_Name (From : in Principal) return String is
begin
return Get_First_Name (From.Auth) & " " & Get_Last_Name (From.Auth);
end Get_Name;
-- ------------------------------
-- Get the user email address.
-- ------------------------------
function Get_Email (From : in Principal) return String is
begin
return Get_Email (From.Auth);
end Get_Email;
-- ------------------------------
-- Get the authentication data.
-- ------------------------------
function Get_Authentication (From : in Principal) return Authentication is
begin
return From.Auth;
end Get_Authentication;
-- ------------------------------
-- Create a principal with the given authentication results.
-- ------------------------------
function Create_Principal (Auth : in Authentication) return Principal_Access is
P : constant Principal_Access := new Principal;
begin
P.Auth := Auth;
return P;
end Create_Principal;
-- ------------------------------
-- Default factory used by `Initialize`. It supports OpenID, Google, Facebook.
-- ------------------------------
function Default_Factory (Provider : in String) return Manager_Access is
begin
if Provider = PROVIDER_OPENID then
return new Security.Auth.OpenID.Manager;
elsif Provider = PROVIDER_FACEBOOK then
return new Security.Auth.OAuth.Facebook.Manager;
elsif Provider = PROVIDER_GOOGLE_PLUS then
return new Security.Auth.OAuth.Googleplus.Manager;
elsif Provider = PROVIDER_YAHOO then
return new Security.Auth.OAuth.Yahoo.Manager;
elsif Provider = PROVIDER_GITHUB then
return new Security.Auth.OAuth.Github.Manager;
else
Log.Error ("Authentication provider {0} not recognized", Provider);
raise Service_Error with "Authentication provider not supported";
end if;
end Default_Factory;
-- ------------------------------
-- Initialize the OpenID realm.
-- ------------------------------
procedure Initialize (Realm : in out Manager;
Params : in Parameters'Class;
Name : in String := PROVIDER_OPENID) is
begin
Initialize (Realm, Params, Def_Factory, Name);
end Initialize;
procedure Initialize (Realm : in out Manager;
Params : in Parameters'Class;
Factory : not null
access function (Name : in String) return Manager_Access;
Name : in String := PROVIDER_OPENID) is
Provider : constant String := Params.Get_Parameter ("auth.provider." & Name);
Impl : constant Manager_Access := Factory (Provider);
begin
if Impl = null then
Log.Error ("Authentication provider {0} not recognized", Provider);
raise Service_Error with "Authentication provider not supported";
end if;
Realm.Delegate := Impl;
Impl.Initialize (Params, Name);
Realm.Provider := To_Unbounded_String (Name);
end Initialize;
-- ------------------------------
-- Discover the OpenID provider that must be used to authenticate the user.
-- The <b>Name</b> can be an URL or an alias that identifies the provider.
-- A cached OpenID provider can be returned.
-- (See OpenID Section 7.3 Discovery)
-- ------------------------------
procedure Discover (Realm : in out Manager;
Name : in String;
Result : out End_Point) is
begin
if Realm.Delegate /= null then
Realm.Delegate.Discover (Name, Result);
else
-- Result.URL := Realm.Realm;
Result.Alias := To_Unbounded_String ("");
end if;
end Discover;
-- ------------------------------
-- Associate the application (relying party) with the OpenID provider.
-- The association can be cached.
-- (See OpenID Section 8 Establishing Associations)
-- ------------------------------
procedure Associate (Realm : in out Manager;
OP : in End_Point;
Result : out Association) is
begin
Result.Provider := Realm.Provider;
if Realm.Delegate /= null then
Realm.Delegate.Associate (OP, Result);
end if;
end Associate;
-- ------------------------------
-- Get the authentication URL to which the user must be redirected for authentication
-- by the authentication server.
-- ------------------------------
function Get_Authentication_URL (Realm : in Manager;
OP : in End_Point;
Assoc : in Association) return String is
begin
if Realm.Delegate /= null then
return Realm.Delegate.Get_Authentication_URL (OP, Assoc);
else
return To_String (OP.URL);
end if;
end Get_Authentication_URL;
procedure Set_Result (Result : in out Authentication;
Status : in Auth_Result;
Message : in String) is
begin
if Status /= AUTHENTICATED then
Log.Error ("OpenID verification failed: {0}", Message);
else
Log.Info ("OpenID verification: {0}", Message);
end if;
Result.Status := Status;
end Set_Result;
-- ------------------------------
-- Verify the authentication result
-- ------------------------------
procedure Verify (Realm : in out Manager;
Assoc : in Association;
Request : in Parameters'Class;
Result : out Authentication) is
begin
if Realm.Delegate /= null then
Realm.Delegate.Verify (Assoc, Request, Result);
else
Set_Result (Result, SETUP_NEEDED, "Setup is needed");
end if;
end Verify;
function To_String (OP : End_Point) return String is
begin
return "openid://" & To_String (OP.URL);
end To_String;
function To_String (Assoc : Association) return String is
begin
return "session_type=" & To_String (Assoc.Session_Type)
& "&assoc_type=" & To_String (Assoc.Assoc_Type)
& "&assoc_handle=" & To_String (Assoc.Assoc_Handle)
& "&mac_key=" & To_String (Assoc.Mac_Key);
end To_String;
-- ------------------------------
-- Set the default factory to use.
-- ------------------------------
procedure Set_Default_Factory (Factory : in Factory_Access) is
begin
Def_Factory := Factory;
end Set_Default_Factory;
overriding
procedure Finalize (Realm : in out Manager) is
procedure Free is
new Ada.Unchecked_Deallocation (Manager'Class, Manager_Access);
begin
Free (Realm.Delegate);
end Finalize;
end Security.Auth;
| 35.038961 | 89 | 0.547813 |
fbb0f38fb59b483ca64a9cab40f84407d68c4b1b | 7,035 | ads | Ada | source/amf/dd/amf-internals-tables-di_metamodel-objects.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/dd/amf-internals-tables-di_metamodel-objects.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/dd/amf-internals-tables-di_metamodel-objects.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
package AMF.Internals.Tables.DI_Metamodel.Objects is
procedure Initialize;
private
procedure Initialize_1 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_2 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_3 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_4 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_5 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_6 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_7 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_8 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_9 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_10 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_11 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_12 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_13 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_14 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_15 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_16 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_17 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_18 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_19 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_20 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_21 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_22 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_23 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_24 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_25 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_26 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_27 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_28 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_29 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_30 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_31 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_32 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_33 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_34 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_35 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_36 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_37 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_38 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_39 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_40 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_41 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_42 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_43 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_44 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_45 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_46 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_47 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_48 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_49 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_50 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_51 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_52 (Extent : AMF.Internals.AMF_Extent);
procedure Initialize_53 (Extent : AMF.Internals.AMF_Extent);
end AMF.Internals.Tables.DI_Metamodel.Objects;
| 43.96875 | 78 | 0.579531 |
fbd2cc8d53dcfe1929e8c29f34fa958c724dfeb1 | 386 | adb | Ada | meassure_velocity.adb | oysteinlondal/Inverted-Pendulum | 0a59e8d7bea31a255c1ca27c97430a688421f787 | [
"MIT"
] | null | null | null | meassure_velocity.adb | oysteinlondal/Inverted-Pendulum | 0a59e8d7bea31a255c1ca27c97430a688421f787 | [
"MIT"
] | 2 | 2020-11-16T12:35:26.000Z | 2020-11-16T12:35:31.000Z | meassure_velocity.adb | oysteinlondal/Inverted-Pendulum | 0a59e8d7bea31a255c1ca27c97430a688421f787 | [
"MIT"
] | null | null | null | package body Meassure_Velocity is
procedure Retrieve_Velocity (Velocity_Z : out Float) is
begin
--if Imu.Gyro.Read.Available() not true then
-- raise Gyro_Not_Available ;
--end if;
--Imu.gyro.read(data);
--z_gyro = gyro.data(z_angle);
--return z_gyro;
Z_Coordinate := 2.0;
Velocity_Z := Z_Coordinate;
end Retrieve_Velocity;
end Meassure_Velocity;
| 27.571429 | 56 | 0.689119 |
fb822428292f29f24a52ff3a5a75697ebaacafa5 | 5,212 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2405b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2405b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2405b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE2405B.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 READ RAISES END_ERROR WHEN THE CURRENT READ POSITION
-- IS GREATER THAN THE END POSITION. ALSO CHECK THAT END_OF_FILE
-- CORRECTLY DETECTS THE END OF A DIRECT FILE.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- CREATION WITH INOUT_FILE MODE AND OPENING OF IN_FILE MODE.
-- HISTORY:
-- SPS 09/28/82
-- JBG 02/22/84 CHANGE TO .ADA TEST
-- EG 05/16/85
-- GMT 08/03/87 ADDED CODE TO CHECK THAT END_OF_FILE WORKS, AND
-- ADDED CODE TO PREVENT SOME EXCEPTION PROPAGATION.
WITH REPORT; USE REPORT;
WITH DIRECT_IO;
PROCEDURE CE2405B IS
BEGIN
TEST ("CE2405B", "CHECK THAT END_ERROR IS RAISED BY READ AT THE " &
"END OF A FILE AND THAT END_OF_FILE CORRECTLY " &
"DETECTS THE END OF A DIRECT_IO FILE");
DECLARE
PACKAGE DIR IS NEW DIRECT_IO (CHARACTER);
USE DIR;
FT : FILE_TYPE;
CH : CHARACTER;
INCOMPLETE : EXCEPTION;
BEGIN
-- CREATE AND INITIALIZE FILE
BEGIN
CREATE (FT, INOUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR | NAME_ERROR =>
NOT_APPLICABLE ("USE_ERROR | NAME_ERROR WAS " &
"RAISED ON CREATE - 1");
RAISE INCOMPLETE;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED ON CREATE - 2");
RAISE INCOMPLETE;
END;
BEGIN
WRITE (FT, 'C');
WRITE (FT, 'X');
-- BEGIN TEST
IF NOT END_OF_FILE (FT) THEN
FAILED ("END_OF_FILE RETURNED INCORRECT " &
"BOOLEAN VALUE - 3");
END IF;
BEGIN
READ (FT, CH);
FAILED ("END_ERROR NOT RAISED ON READ - 4");
EXCEPTION
WHEN END_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED ON READ - 5");
END;
WRITE (FT,'E');
BEGIN
READ (FT, CH);
FAILED ("END_ERROR NOT RAISED ON READ - 6");
EXCEPTION
WHEN END_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED ON READ - 7");
END;
END;
CLOSE (FT);
BEGIN
OPEN (FT, IN_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED ON OPEN - 8");
RAISE INCOMPLETE;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED ON OPEN - 9");
RAISE INCOMPLETE;
END;
DECLARE
COUNT_NBR_OF_READS : NATURAL := 0;
EXPECTED_COUNT : CONSTANT := 3;
BEGIN
LOOP
IF END_OF_FILE (FT) THEN
EXIT;
ELSE
READ (FT, CH);
COUNT_NBR_OF_READS := COUNT_NBR_OF_READS + 1;
END IF;
END LOOP;
IF COUNT_NBR_OF_READS /= EXPECTED_COUNT THEN
FAILED ("THE BAD VALUE FOR COUNT_NBR_OF_READS " &
"IS " &
NATURAL'IMAGE (COUNT_NBR_OF_READS) );
END IF;
END;
BEGIN
DELETE (FT);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
EXCEPTION
WHEN INCOMPLETE =>
NULL;
END;
RESULT;
END CE2405B;
| 32.987342 | 79 | 0.502686 |
202d9e20ca114f3001c96fc27898749a22034a8e | 6,489 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-excact.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-excact.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-excact.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . E X C E P T I O N _ A C T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2002-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 Ada.Unchecked_Conversion;
with System;
with System.Soft_Links; use System.Soft_Links;
with System.Standard_Library; use System.Standard_Library;
with System.Exception_Table; use System.Exception_Table;
package body GNAT.Exception_Actions is
Global_Action : Exception_Action;
pragma Import
(Ada, Global_Action, "__gnat_exception_actions_global_action");
pragma Atomic (Global_Action);
-- Imported from Ada.Exceptions. Any change in the external name needs to
-- be coordinated with a-exextr.adb.
Global_Unhandled_Action : Exception_Action;
pragma Import
(Ada, Global_Unhandled_Action,
"__gnat_exception_actions_global_unhandled_action");
pragma Atomic (Global_Unhandled_Action);
-- Imported from Ada.Exceptions. Any change in the external name needs to
-- be coordinated with a-exextr.adb.
Raise_Hook_Initialized : Boolean;
pragma Import
(Ada, Raise_Hook_Initialized, "__gnat_exception_actions_initialized");
function To_Raise_Action is new Ada.Unchecked_Conversion
(Exception_Action, Raise_Action);
-- ??? Would be nice to have this in System.Standard_Library
function To_Data is new Ada.Unchecked_Conversion
(Exception_Id, Exception_Data_Ptr);
function To_Id is new Ada.Unchecked_Conversion
(Exception_Data_Ptr, Exception_Id);
----------------------------
-- Register_Global_Action --
----------------------------
procedure Register_Global_Action (Action : Exception_Action) is
begin
Global_Action := Action;
end Register_Global_Action;
--------------------------------------
-- Register_Global_Unhandled_Action --
--------------------------------------
procedure Register_Global_Unhandled_Action (Action : Exception_Action) is
begin
Global_Unhandled_Action := Action;
end Register_Global_Unhandled_Action;
------------------------
-- Register_Id_Action --
------------------------
procedure Register_Id_Action
(Id : Exception_Id;
Action : Exception_Action)
is
begin
if Id = Null_Id then
raise Program_Error;
end if;
Lock_Task.all;
To_Data (Id).Raise_Hook := To_Raise_Action (Action);
Raise_Hook_Initialized := True;
Unlock_Task.all;
end Register_Id_Action;
---------------
-- Core_Dump --
---------------
procedure Core_Dump (Occurrence : Exception_Occurrence) is separate;
--------------------------
-- Is_Foreign_Exception --
--------------------------
function Is_Foreign_Exception (E : Exception_Occurrence) return Boolean is
Foreign_Exception : aliased Exception_Data;
pragma Import
(Ada, Foreign_Exception, "system__exceptions__foreign_exception");
begin
return (To_Data (Exception_Identity (E))
= Foreign_Exception'Unchecked_Access);
end Is_Foreign_Exception;
----------------
-- Name_To_Id --
----------------
function Name_To_Id (Name : String) return Exception_Id is
begin
return To_Id (Internal_Exception (Name, Create_If_Not_Exist => False));
end Name_To_Id;
---------------------------------
-- Registered_Exceptions_Count --
---------------------------------
function Registered_Exceptions_Count return Natural renames
System.Exception_Table.Registered_Exceptions_Count;
-------------------------------
-- Get_Registered_Exceptions --
-------------------------------
-- This subprogram isn't an iterator to avoid concurrency problems,
-- since the exceptions are registered dynamically. Since we have to lock
-- the runtime while computing this array, this means that any callback in
-- an active iterator would be unable to access the runtime.
procedure Get_Registered_Exceptions
(List : out Exception_Id_Array;
Last : out Integer)
is
Ids : Exception_Data_Array (List'Range);
begin
Get_Registered_Exceptions (Ids, Last);
for L in List'First .. Last loop
List (L) := To_Id (Ids (L));
end loop;
end Get_Registered_Exceptions;
end GNAT.Exception_Actions;
| 40.055556 | 78 | 0.544306 |
1011af33e28d3fd5ce5a8d9c4f2b676b99b3c250 | 836 | adb | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/tagged/pck.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/tagged/pck.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/tagged/pck.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2008-2016 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Do_Nothing (A : System.Address) is
begin
null;
end Do_Nothing;
end Pck;
| 32.153846 | 73 | 0.726077 |
18f821b6b792c867edd3355aeeb8c353c3c62783 | 2,580 | adb | Ada | tests/src/cbap_register_error_test.adb | darkestkhan/cbap | 5b7744a1714b74f803f7785b51fddfaa47b0cbf8 | [
"0BSD"
] | 6 | 2015-07-01T18:35:54.000Z | 2020-09-21T20:41:24.000Z | tests/src/cbap_register_error_test.adb | darkestkhan/cbap | 5b7744a1714b74f803f7785b51fddfaa47b0cbf8 | [
"0BSD"
] | 1 | 2016-02-29T14:29:58.000Z | 2016-02-29T14:29:58.000Z | tests/src/cbap_register_error_test.adb | darkestkhan/cbap | 5b7744a1714b74f803f7785b51fddfaa47b0cbf8 | [
"0BSD"
] | null | null | null | pragma License (GPL);
------------------------------------------------------------------------------
-- EMAIL: <[email protected]> --
-- License: GNU GPLv3 or any later as published by Free Software Foundation --
-- (see COPYING file) --
-- --
-- Copyright © 2015 darkestkhan --
------------------------------------------------------------------------------
-- 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 Ada.Command_Line;
with CBAP;
procedure CBAP_Register_Error_Test is
---------------------------------------------------------------------------
procedure Cause_Error (Argument: in String) is null;
---------------------------------------------------------------------------
Got_Errors: Natural := 0;
---------------------------------------------------------------------------
begin
begin
CBAP.Register (Cause_Error'Unrestricted_Access, "letsroll=die");
exception
when CBAP.Incorrect_Called_On => Got_Errors := Got_Errors + 1;
end;
begin
CBAP.Register (Cause_Error'Unrestricted_Access, "help");
CBAP.Register (Cause_Error'Unrestricted_Access, "help");
exception
when Constraint_Error => Got_Errors := Got_Errors + 1;
end;
if Got_Errors /= 2 then
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure);
else
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Success);
end if;
end CBAP_Register_Error_Test;
| 45.263158 | 78 | 0.455814 |
0e1953823c55908710a91fa629a323a794d9d875 | 3,876 | adb | Ada | bsp/wire.adb | yannickmoy/SPARKZumo | 29d4d5d4f00d43d2dafd8d8b8d21eea0769923f3 | [
"MIT"
] | 6 | 2018-04-05T21:05:17.000Z | 2021-06-04T15:24:09.000Z | bsp/wire.adb | yannickmoy/SPARKZumo | 29d4d5d4f00d43d2dafd8d8b8d21eea0769923f3 | [
"MIT"
] | null | null | null | bsp/wire.adb | yannickmoy/SPARKZumo | 29d4d5d4f00d43d2dafd8d8b8d21eea0769923f3 | [
"MIT"
] | 3 | 2021-01-18T16:07:40.000Z | 2021-05-03T15:52:13.000Z | pragma SPARK_Mode;
with Sparkduino; use Sparkduino;
with Interfaces.C; use Interfaces.C;
package body Wire is
Timeout : constant unsigned_long := 1;
function RequestFrom (Addr : Byte;
Quant : Byte;
Stop : Boolean)
return Byte
is
CB : Byte := 0;
begin
if Stop then
CB := 1;
end if;
return RequestFrom_C (Addr => Addr,
Quant => Quant,
Stop => CB);
end RequestFrom;
function EndTransmission (Stop : Boolean) return Byte
is
CB : Byte := 0;
begin
if Stop then
CB := 1;
end if;
return EndTransmission_C (Stop => CB);
end EndTransmission;
function Byte2TSI (BB : Byte)
return Transmission_Status_Index
is
begin
for I in Transmission_Status_Index loop
if Transmission_Status (I) = BB then
return I;
end if;
end loop;
return Other_Err;
end Byte2TSI;
function Read_Byte (Addr : Byte;
Reg : Byte)
return Byte
is
Ret_Val : Byte;
Bytes_Read : Byte;
Bytes_Written : Byte;
Status : Transmission_Status_Index;
begin
Wire.BeginTransmission (Addr => Addr);
Bytes_Written := Wire.Write_Value (Val => Reg);
Status := Byte2TSI (BB => Wire.EndTransmission (Stop => True));
if Status /= Wire.Success or Bytes_Written /= 1 then
return Byte'First;
end if;
Bytes_Read := RequestFrom (Addr => Addr,
Quant => 1,
Stop => True);
if Bytes_Read /= 1 then
return Byte'First;
end if;
Ret_Val := Wire.Read;
return Ret_Val;
end Read_Byte;
procedure Read_Bytes (Addr : Byte;
Reg : Byte;
Data : out Byte_Array)
is
Bytes_Read : Byte;
Bytes_Written : Byte;
Status : Transmission_Status_Index;
Start_Time : unsigned_long;
begin
Wire.BeginTransmission (Addr => Addr);
Bytes_Written := Wire.Write_Value (Val => (Reg or 16#80#));
Status := Byte2TSI (BB => Wire.EndTransmission (Stop => True));
if Status /= Wire.Success or Bytes_Written /= 1 then
Data := (others => Byte'First);
return;
end if;
Bytes_Read := RequestFrom (Addr => Addr,
Quant => Data'Length,
Stop => True);
if Bytes_Read /= Data'Length or Bytes_Read = 0 then
Data := (others => Byte'First);
return;
end if;
Start_Time := Millis;
while Wire.Available < Data'Length loop
if Millis - Start_Time > Timeout then
Data := (others => Byte'First);
return;
end if;
end loop;
for I in Data'First .. Data'Last loop
Data (I) := Wire.Read;
pragma Annotate (GNATprove,
False_Positive,
"""Data"" might not be initialized",
String'("Data properly initialized by this loop"));
end loop;
end Read_Bytes;
function Write_Byte (Addr : Byte;
Reg : Byte;
Data : Byte)
return Transmission_Status_Index
is
Bytes_Written : Byte;
begin
BeginTransmission (Addr => Addr);
Bytes_Written := Write_Value (Val => Reg);
if Bytes_Written /= 1 then
return Other_Err;
end if;
Bytes_Written := Write_Value (Val => Data);
if Bytes_Written /= 1 then
return Other_Err;
end if;
return Byte2TSI (BB => EndTransmission (Stop => True));
end Write_Byte;
end Wire;
| 25.5 | 77 | 0.51677 |
d035af7cee470f56bf90178cb43d49ef0b1ff448 | 4,361 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3405a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3405a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3405a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE3405A.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 NEW_PAGE OUTPUTS A LINE TERMINATOR FOLLOWED BY A PAGE
-- TERMINATOR IF THE CURRENT LINE IS NOT AT COLUMN 1 OR IF THE
-- CURRENT PAGE IS AT LINE 1; IF THE CURRENT LINE IS AT COLUMN 1,
-- OUTPUTS A PAGE TERMINATOR ONLY.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH
-- SUPPORT TEXT FILES.
-- HISTORY:
-- ABW 09/02/82
-- JBG 01/18/83
-- TBN 11/04/86 REVISED TEST TO OUTPUT A NON_APPLICABLE
-- RESULT WHEN FILES ARE NOT SUPPORTED.
-- DWC 09/23/87 ADDED A CASE WHICH CALLS NEW_LINE AND NEW_PAGE
-- CONSECUTIVELY AND SEPARATED CASES INTO DIFFERENT
-- IF STATEMENTS. ADDED CHECK FOR USE_ERROR ON
-- DELETE.
WITH REPORT;
USE REPORT;
WITH TEXT_IO;
USE TEXT_IO;
WITH CHECK_FILE;
PROCEDURE CE3405A IS
INCOMPLETE : EXCEPTION;
FILE : FILE_TYPE;
ONE : POSITIVE_COUNT := POSITIVE_COUNT(IDENT_INT(1));
TWO : POSITIVE_COUNT := POSITIVE_COUNT(IDENT_INT(2));
THREE : POSITIVE_COUNT := POSITIVE_COUNT(IDENT_INT(3));
FOUR : POSITIVE_COUNT := POSITIVE_COUNT(IDENT_INT(4));
CHAR : CHARACTER := ('C');
BEGIN
TEST ("CE3405A", "CHECK THAT NEW_PAGE OUTPUTS A LINE TERMINATOR " &
"FOLLOWED BY A PAGE TERMINATOR IF THE CURRENT " &
"LINE IS NOT AT COLUMN 1 OR IF THE CURRENT " &
"PAGE IS AT LINE 1; IF THE CURRENT LINE IS AT " &
"COLUMN 1, OUTPUTS A PAGE TERMINATOR ONLY");
BEGIN
CREATE (FILE, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED; TEXT CREATE " &
"WITH OUT_FILE MODE");
RAISE INCOMPLETE;
WHEN NAME_ERROR =>
NOT_APPLICABLE ("NAME_ERROR RAISED; TEXT CREATE " &
"WITH OUT_FILE MODE");
RAISE INCOMPLETE;
END;
NEW_PAGE (FILE);
NEW_PAGE (FILE); -- CURRENT PAGE TERMINATED
IF PAGE (FILE) /= THREE THEN
FAILED ("INITIAL PAGE COUNT INCORRECT");
END IF;
SET_LINE_LENGTH (FILE,THREE);
PUT (FILE,CHAR);
NEW_LINE (FILE);
IF LINE (FILE) /= TWO THEN
FAILED ("INCORRECT LINE NUMBER - 1");
END IF;
IF PAGE (FILE) /= THREE THEN
FAILED ("INCORRECT PAGE NUMBER - 2");
END IF;
NEW_PAGE (FILE); -- CURRENT LINE TERMINATED (B)
IF LINE (FILE) /= ONE THEN
FAILED ("LINE NUMBER NOT INCREMENTED");
END IF;
IF PAGE (FILE) /= FOUR THEN
FAILED ("PAGE NUMBER NOT INCREMENTED");
END IF;
PUT (FILE, IDENT_CHAR('E')); -- CURRENT LINE NOT TERM (C)
NEW_PAGE (FILE);
NEW_LINE (FILE);
NEW_PAGE (FILE);
CHECK_FILE (FILE, "#@#@C#@E#@#@%");
BEGIN
DELETE (FILE);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
RESULT;
EXCEPTION
WHEN INCOMPLETE =>
RESULT;
END CE3405A;
| 34.070313 | 79 | 0.59734 |
107516a3d2c6e5c333e4d6bed33a689df7252590 | 13,940 | ads | Ada | source/amf/uml/amf-visitors-standard_profile_l2_iterators.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-visitors-standard_profile_l2_iterators.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-visitors-standard_profile_l2_iterators.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Standard_Profile_L2.Auxiliaries;
with AMF.Standard_Profile_L2.Calls;
with AMF.Standard_Profile_L2.Creates;
with AMF.Standard_Profile_L2.Derives;
with AMF.Standard_Profile_L2.Destroies;
with AMF.Standard_Profile_L2.Documents;
with AMF.Standard_Profile_L2.Entities;
with AMF.Standard_Profile_L2.Executables;
with AMF.Standard_Profile_L2.Focuses;
with AMF.Standard_Profile_L2.Frameworks;
with AMF.Standard_Profile_L2.Implementation_Classes;
with AMF.Standard_Profile_L2.Implements;
with AMF.Standard_Profile_L2.Instantiates;
with AMF.Standard_Profile_L2.Libraries;
with AMF.Standard_Profile_L2.Metaclasses;
with AMF.Standard_Profile_L2.Model_Libraries;
with AMF.Standard_Profile_L2.Processes;
with AMF.Standard_Profile_L2.Realizations;
with AMF.Standard_Profile_L2.Refines;
with AMF.Standard_Profile_L2.Responsibilities;
with AMF.Standard_Profile_L2.Scripts;
with AMF.Standard_Profile_L2.Sends;
with AMF.Standard_Profile_L2.Services;
with AMF.Standard_Profile_L2.Sources;
with AMF.Standard_Profile_L2.Specifications;
with AMF.Standard_Profile_L2.Subsystems;
with AMF.Standard_Profile_L2.Traces;
with AMF.Standard_Profile_L2.Types;
with AMF.Standard_Profile_L2.Utilities;
package AMF.Visitors.Standard_Profile_L2_Iterators is
pragma Preelaborate;
type Standard_Profile_L2_Iterator is limited interface and AMF.Visitors.Abstract_Iterator;
not overriding procedure Visit_Auxiliary
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Auxiliaries.Standard_Profile_L2_Auxiliary_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Call
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Calls.Standard_Profile_L2_Call_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Create
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Creates.Standard_Profile_L2_Create_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Derive
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Derives.Standard_Profile_L2_Derive_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Destroy
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Destroies.Standard_Profile_L2_Destroy_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Document
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Documents.Standard_Profile_L2_Document_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Entity
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Entities.Standard_Profile_L2_Entity_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Executable
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Executables.Standard_Profile_L2_Executable_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Focus
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Focuses.Standard_Profile_L2_Focus_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Framework
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Frameworks.Standard_Profile_L2_Framework_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Implement
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Implements.Standard_Profile_L2_Implement_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Implementation_Class
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Implementation_Classes.Standard_Profile_L2_Implementation_Class_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Instantiate
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Instantiates.Standard_Profile_L2_Instantiate_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Library
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Libraries.Standard_Profile_L2_Library_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Metaclass
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Metaclasses.Standard_Profile_L2_Metaclass_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Model_Library
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Model_Libraries.Standard_Profile_L2_Model_Library_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Process
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Processes.Standard_Profile_L2_Process_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Realization
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Realizations.Standard_Profile_L2_Realization_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Refine
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Refines.Standard_Profile_L2_Refine_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Responsibility
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Responsibilities.Standard_Profile_L2_Responsibility_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Script
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Scripts.Standard_Profile_L2_Script_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Send
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Sends.Standard_Profile_L2_Send_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Service
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Services.Standard_Profile_L2_Service_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Source
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Sources.Standard_Profile_L2_Source_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Specification
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Specifications.Standard_Profile_L2_Specification_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Subsystem
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Subsystems.Standard_Profile_L2_Subsystem_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Trace
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Traces.Standard_Profile_L2_Trace_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Type
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Types.Standard_Profile_L2_Type_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
not overriding procedure Visit_Utility
(Self : in out Standard_Profile_L2_Iterator;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Element : not null AMF.Standard_Profile_L2.Utilities.Standard_Profile_L2_Utility_Access;
Control : in out AMF.Visitors.Traverse_Control) is null;
end AMF.Visitors.Standard_Profile_L2_Iterators;
| 54.241245 | 119 | 0.688235 |
201d2daac43fd4515a6c7ea77d31be4cc9558b70 | 1,407 | ada | Ada | Task/Horizontal-sundial-calculations/Ada/horizontal-sundial-calculations.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Horizontal-sundial-calculations/Ada/horizontal-sundial-calculations.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Horizontal-sundial-calculations/Ada/horizontal-sundial-calculations.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Text_IO;
with Ada.Numerics.Elementary_Functions;
procedure Sundial is
use Ada.Numerics.Elementary_Functions;
use Ada.Numerics;
package Float_IO is new Ada.Text_IO.Float_IO (Float);
Latitude, Longitude, Meridian : Float;
Latitude_Sine : Float;
begin
Ada.Text_IO.Put ("Enter latitude: ");
Float_IO.Get (Latitude);
Ada.Text_IO.Put ("Enter longitude: ");
Float_IO.Get (Longitude);
Ada.Text_IO.Put ("Enter legal meridian: ");
Float_IO.Get (Meridian);
Ada.Text_IO.New_Line;
Latitude_Sine := Sin (Latitude * Pi / 180.0);
Ada.Text_IO.Put_Line
(" sine of latitude:" & Float'Image (Latitude_Sine));
Ada.Text_IO.Put_Line
(" diff longitude:" & Float'Image (Longitude - Meridian));
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line
("hour, sun hour angle, dial hour line angle from 6am to 6pm");
for H in -6 .. 6 loop
declare
Hour_Angle : constant Float :=
15.0 * Float (H) - (Longitude - Meridian);
Line_Angle : constant Float :=
Arctan (Latitude_Sine * Tan (Hour_Angle * Pi / 180.0)) * 180.0 /
Pi;
begin
Ada.Text_IO.Put_Line
("HR=" &
Integer'Image (H) &
"; HRA=" &
Float'Image (Hour_Angle) &
"; HLA=" &
Float'Image (Line_Angle));
end;
end loop;
end Sundial;
| 30.586957 | 76 | 0.592751 |
df610dca0e2e2cf68c1fc33ab7e0ed7d315008d2 | 6,198 | ads | Ada | arch/ARM/Nordic/svd/nrf51/nrf51_svd-temp.ads | WickedShell/Ada_Drivers_Library | 391866ad37a599347df40a4dbb3bf0721bedabea | [
"BSD-3-Clause"
] | 6 | 2017-05-28T04:37:11.000Z | 2020-11-22T11:26:19.000Z | arch/ARM/Nordic/svd/nrf51/nrf51_svd-temp.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2019-08-30T10:57:40.000Z | 2020-02-11T21:34:14.000Z | arch/ARM/Nordic/svd/nrf51/nrf51_svd-temp.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2017-02-07T19:42:02.000Z | 2020-11-22T11:26:20.000Z | -- Copyright (c) 2013, Nordic Semiconductor ASA
-- 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 Nordic Semiconductor ASA nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-- DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-- FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-- DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-- SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-- CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-- OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--
-- This spec has been automatically generated from nrf51.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package NRF51_SVD.TEMP is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- Enable interrupt on DATARDY event.
type INTENSET_DATARDY_Field is
(
-- Interrupt disabled.
Disabled,
-- Interrupt enabled.
Enabled)
with Size => 1;
for INTENSET_DATARDY_Field use
(Disabled => 0,
Enabled => 1);
-- Enable interrupt on DATARDY event.
type INTENSET_DATARDY_Field_1 is
(
-- Reset value for the field
Intenset_Datardy_Field_Reset,
-- Enable interrupt on write.
Set)
with Size => 1;
for INTENSET_DATARDY_Field_1 use
(Intenset_Datardy_Field_Reset => 0,
Set => 1);
-- Interrupt enable set register.
type INTENSET_Register is record
-- Enable interrupt on DATARDY event.
DATARDY : INTENSET_DATARDY_Field_1 :=
Intenset_Datardy_Field_Reset;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for INTENSET_Register use record
DATARDY at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- Disable interrupt on DATARDY event.
type INTENCLR_DATARDY_Field is
(
-- Interrupt disabled.
Disabled,
-- Interrupt enabled.
Enabled)
with Size => 1;
for INTENCLR_DATARDY_Field use
(Disabled => 0,
Enabled => 1);
-- Disable interrupt on DATARDY event.
type INTENCLR_DATARDY_Field_1 is
(
-- Reset value for the field
Intenclr_Datardy_Field_Reset,
-- Disable interrupt on write.
Clear)
with Size => 1;
for INTENCLR_DATARDY_Field_1 use
(Intenclr_Datardy_Field_Reset => 0,
Clear => 1);
-- Interrupt enable clear register.
type INTENCLR_Register is record
-- Disable interrupt on DATARDY event.
DATARDY : INTENCLR_DATARDY_Field_1 :=
Intenclr_Datardy_Field_Reset;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for INTENCLR_Register use record
DATARDY at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- Peripheral power control.
type POWER_POWER_Field is
(
-- Module power disabled.
Disabled,
-- Module power enabled.
Enabled)
with Size => 1;
for POWER_POWER_Field use
(Disabled => 0,
Enabled => 1);
-- Peripheral power control.
type POWER_Register is record
-- Peripheral power control.
POWER : POWER_POWER_Field := NRF51_SVD.TEMP.Disabled;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for POWER_Register use record
POWER at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Temperature Sensor.
type TEMP_Peripheral is record
-- Start temperature measurement.
TASKS_START : aliased HAL.UInt32;
-- Stop temperature measurement.
TASKS_STOP : aliased HAL.UInt32;
-- Temperature measurement complete, data ready event.
EVENTS_DATARDY : aliased HAL.UInt32;
-- Interrupt enable set register.
INTENSET : aliased INTENSET_Register;
-- Interrupt enable clear register.
INTENCLR : aliased INTENCLR_Register;
-- Die temperature in degC, 2's complement format, 0.25 degC pecision.
TEMP : aliased HAL.UInt32;
-- Peripheral power control.
POWER : aliased POWER_Register;
end record
with Volatile;
for TEMP_Peripheral use record
TASKS_START at 16#0# range 0 .. 31;
TASKS_STOP at 16#4# range 0 .. 31;
EVENTS_DATARDY at 16#100# range 0 .. 31;
INTENSET at 16#304# range 0 .. 31;
INTENCLR at 16#308# range 0 .. 31;
TEMP at 16#508# range 0 .. 31;
POWER at 16#FFC# range 0 .. 31;
end record;
-- Temperature Sensor.
TEMP_Periph : aliased TEMP_Peripheral
with Import, Address => System'To_Address (16#4000C000#);
end NRF51_SVD.TEMP;
| 32.450262 | 82 | 0.652146 |
0ed1642cc12ac4225316472ecb74c35f4983ac71 | 2,318 | ads | Ada | resources/scripts/api/securitytrails.ads | r0ck3rt/Amass | 8a7cd5dbdc0458422bd2ff9cda08712562a681ef | [
"Apache-2.0"
] | 1 | 2022-03-22T11:16:31.000Z | 2022-03-22T11:16:31.000Z | resources/scripts/api/securitytrails.ads | r0ck3rt/Amass | 8a7cd5dbdc0458422bd2ff9cda08712562a681ef | [
"Apache-2.0"
] | null | null | null | resources/scripts/api/securitytrails.ads | r0ck3rt/Amass | 8a7cd5dbdc0458422bd2ff9cda08712562a681ef | [
"Apache-2.0"
] | 1 | 2022-03-23T20:59:39.000Z | 2022-03-23T20:59:39.000Z | -- Copyright © by Jeff Foley 2020-2022. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
-- SPDX-License-Identifier: Apache-2.0
local json = require("json")
name = "SecurityTrails"
type = "api"
function start()
set_rate_limit(2)
end
function check()
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c ~= nil and c.key ~= nil and c.key ~= "") then
return true
end
return false
end
function vertical(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == nil or c.key == "") then
return
end
local resp, err = request(ctx, {
['url']=vert_url(domain),
headers={['APIKEY']=c.key},
})
if (err ~= nil and err ~= "") then
log(ctx, "vertical request to service failed: " .. err)
return
end
local j = json.decode(resp)
if (j == nil or j.subdomains == nil or #(j.subdomains) == 0) then
return
end
for _, sub in pairs(j.subdomains) do
new_name(ctx, sub .. "." .. domain)
end
end
function vert_url(domain)
return "https://api.securitytrails.com/v1/domain/" .. domain .. "/subdomains"
end
function horizontal(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == nil or c.key == "") then
return
end
for i=1,100 do
local resp, err = request(ctx, {
['url']=horizon_url(domain, i),
headers={['APIKEY']=c.key},
})
if (err ~= nil and err ~= "") then
log(ctx, "horizontal request to service failed: " .. err)
return
end
local j = json.decode(resp)
if (j == nil or j.records == nil or #(j.records) == 0) then
return
end
for _, r in pairs(j.records) do
if (r.hostname ~= nil and r.hostname ~= "") then
associated(ctx, domain, r.hostname)
end
end
end
end
function horizon_url(domain, pagenum)
return "https://api.securitytrails.com/v1/domain/" .. domain .. "/associated?page=" .. pagenum
end
| 23.653061 | 98 | 0.562554 |
d0355cb5d064e46ffadcb92b26f5eece31f65027 | 5,898 | ads | Ada | arch/ARM/STM32/svd/stm32l4x5/stm32_svd-comp.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/svd/stm32l4x5/stm32_svd-comp.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l4x5/stm32_svd-comp.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L4x5.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.COMP is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype COMP1_CSR_COMP1_PWRMODE_Field is HAL.UInt2;
subtype COMP1_CSR_COMP1_INMSEL_Field is HAL.UInt3;
subtype COMP1_CSR_COMP1_HYST_Field is HAL.UInt2;
subtype COMP1_CSR_COMP1_BLANKING_Field is HAL.UInt3;
-- Comparator 1 control and status register
type COMP1_CSR_Register is record
-- Comparator 1 enable bit
COMP1_EN : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Power Mode of the comparator 1
COMP1_PWRMODE : COMP1_CSR_COMP1_PWRMODE_Field := 16#0#;
-- Comparator 1 Input Minus connection configuration bit
COMP1_INMSEL : COMP1_CSR_COMP1_INMSEL_Field := 16#0#;
-- Comparator1 input plus selection bit
COMP1_INPSEL : Boolean := False;
-- unspecified
Reserved_8_14 : HAL.UInt7 := 16#0#;
-- Comparator 1 polarity selection bit
COMP1_POLARITY : Boolean := False;
-- Comparator 1 hysteresis selection bits
COMP1_HYST : COMP1_CSR_COMP1_HYST_Field := 16#0#;
-- Comparator 1 blanking source selection bits
COMP1_BLANKING : COMP1_CSR_COMP1_BLANKING_Field := 16#0#;
-- unspecified
Reserved_21_21 : HAL.Bit := 16#0#;
-- Scaler bridge enable
COMP1_BRGEN : Boolean := False;
-- Voltage scaler enable bit
COMP1_SCALEN : Boolean := False;
-- unspecified
Reserved_24_29 : HAL.UInt6 := 16#0#;
-- Read-only. Comparator 1 output status bit
COMP1_VALUE : Boolean := False;
-- Write-only. COMP1_CSR register lock bit
COMP1_LOCK : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for COMP1_CSR_Register use record
COMP1_EN at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
COMP1_PWRMODE at 0 range 2 .. 3;
COMP1_INMSEL at 0 range 4 .. 6;
COMP1_INPSEL at 0 range 7 .. 7;
Reserved_8_14 at 0 range 8 .. 14;
COMP1_POLARITY at 0 range 15 .. 15;
COMP1_HYST at 0 range 16 .. 17;
COMP1_BLANKING at 0 range 18 .. 20;
Reserved_21_21 at 0 range 21 .. 21;
COMP1_BRGEN at 0 range 22 .. 22;
COMP1_SCALEN at 0 range 23 .. 23;
Reserved_24_29 at 0 range 24 .. 29;
COMP1_VALUE at 0 range 30 .. 30;
COMP1_LOCK at 0 range 31 .. 31;
end record;
subtype COMP2_CSR_COMP2_PWRMODE_Field is HAL.UInt2;
subtype COMP2_CSR_COMP2_INMSEL_Field is HAL.UInt3;
subtype COMP2_CSR_COMP2_HYST_Field is HAL.UInt2;
subtype COMP2_CSR_COMP2_BLANKING_Field is HAL.UInt3;
-- Comparator 2 control and status register
type COMP2_CSR_Register is record
-- Comparator 2 enable bit
COMP2_EN : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Power Mode of the comparator 2
COMP2_PWRMODE : COMP2_CSR_COMP2_PWRMODE_Field := 16#0#;
-- Comparator 2 Input Minus connection configuration bit
COMP2_INMSEL : COMP2_CSR_COMP2_INMSEL_Field := 16#0#;
-- Comparator 2 Input Plus connection configuration bit
COMP2_INPSEL : Boolean := False;
-- unspecified
Reserved_8_8 : HAL.Bit := 16#0#;
-- Windows mode selection bit
COMP2_WINMODE : Boolean := False;
-- unspecified
Reserved_10_14 : HAL.UInt5 := 16#0#;
-- Comparator 2 polarity selection bit
COMP2_POLARITY : Boolean := False;
-- Comparator 2 hysteresis selection bits
COMP2_HYST : COMP2_CSR_COMP2_HYST_Field := 16#0#;
-- Comparator 2 blanking source selection bits
COMP2_BLANKING : COMP2_CSR_COMP2_BLANKING_Field := 16#0#;
-- unspecified
Reserved_21_21 : HAL.Bit := 16#0#;
-- Scaler bridge enable
COMP2_BRGEN : Boolean := False;
-- Voltage scaler enable bit
COMP2_SCALEN : Boolean := False;
-- unspecified
Reserved_24_29 : HAL.UInt6 := 16#0#;
-- Read-only. Comparator 2 output status bit
COMP2_VALUE : Boolean := False;
-- Write-only. COMP2_CSR register lock bit
COMP2_LOCK : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for COMP2_CSR_Register use record
COMP2_EN at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
COMP2_PWRMODE at 0 range 2 .. 3;
COMP2_INMSEL at 0 range 4 .. 6;
COMP2_INPSEL at 0 range 7 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
COMP2_WINMODE at 0 range 9 .. 9;
Reserved_10_14 at 0 range 10 .. 14;
COMP2_POLARITY at 0 range 15 .. 15;
COMP2_HYST at 0 range 16 .. 17;
COMP2_BLANKING at 0 range 18 .. 20;
Reserved_21_21 at 0 range 21 .. 21;
COMP2_BRGEN at 0 range 22 .. 22;
COMP2_SCALEN at 0 range 23 .. 23;
Reserved_24_29 at 0 range 24 .. 29;
COMP2_VALUE at 0 range 30 .. 30;
COMP2_LOCK at 0 range 31 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Comparator
type COMP_Peripheral is record
-- Comparator 1 control and status register
COMP1_CSR : aliased COMP1_CSR_Register;
-- Comparator 2 control and status register
COMP2_CSR : aliased COMP2_CSR_Register;
end record
with Volatile;
for COMP_Peripheral use record
COMP1_CSR at 16#0# range 0 .. 31;
COMP2_CSR at 16#4# range 0 .. 31;
end record;
-- Comparator
COMP_Periph : aliased COMP_Peripheral
with Import, Address => System'To_Address (16#40010200#);
end STM32_SVD.COMP;
| 35.963415 | 65 | 0.634452 |
5062072462b2b0d40eb33217d1e2976132021e36 | 7,815 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-crc32.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/s-crc32.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-crc32.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- S Y S T E M . C R C 3 2 --
-- --
-- B o d y --
-- --
-- Copyright (C) 2001-2002 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body System.CRC32 is
Init : constant CRC32 := 16#FFFF_FFFF#; -- Initial value
XorOut : constant CRC32 := 16#FFFF_FFFF#; -- To compute final result.
-- The following table contains precomputed values for contributions
-- from various possible byte values. Doing a table lookup is quicker
-- than processing the byte bit by bit.
Table : constant array (CRC32 range 0 .. 255) of CRC32 :=
(16#0000_0000#, 16#7707_3096#, 16#EE0E_612C#, 16#9909_51BA#,
16#076D_C419#, 16#706A_F48F#, 16#E963_A535#, 16#9E64_95A3#,
16#0EDB_8832#, 16#79DC_B8A4#, 16#E0D5_E91E#, 16#97D2_D988#,
16#09B6_4C2B#, 16#7EB1_7CBD#, 16#E7B8_2D07#, 16#90BF_1D91#,
16#1DB7_1064#, 16#6AB0_20F2#, 16#F3B9_7148#, 16#84BE_41DE#,
16#1ADA_D47D#, 16#6DDD_E4EB#, 16#F4D4_B551#, 16#83D3_85C7#,
16#136C_9856#, 16#646B_A8C0#, 16#FD62_F97A#, 16#8A65_C9EC#,
16#1401_5C4F#, 16#6306_6CD9#, 16#FA0F_3D63#, 16#8D08_0DF5#,
16#3B6E_20C8#, 16#4C69_105E#, 16#D560_41E4#, 16#A267_7172#,
16#3C03_E4D1#, 16#4B04_D447#, 16#D20D_85FD#, 16#A50A_B56B#,
16#35B5_A8FA#, 16#42B2_986C#, 16#DBBB_C9D6#, 16#ACBC_F940#,
16#32D8_6CE3#, 16#45DF_5C75#, 16#DCD6_0DCF#, 16#ABD1_3D59#,
16#26D9_30AC#, 16#51DE_003A#, 16#C8D7_5180#, 16#BFD0_6116#,
16#21B4_F4B5#, 16#56B3_C423#, 16#CFBA_9599#, 16#B8BD_A50F#,
16#2802_B89E#, 16#5F05_8808#, 16#C60C_D9B2#, 16#B10B_E924#,
16#2F6F_7C87#, 16#5868_4C11#, 16#C161_1DAB#, 16#B666_2D3D#,
16#76DC_4190#, 16#01DB_7106#, 16#98D2_20BC#, 16#EFD5_102A#,
16#71B1_8589#, 16#06B6_B51F#, 16#9FBF_E4A5#, 16#E8B8_D433#,
16#7807_C9A2#, 16#0F00_F934#, 16#9609_A88E#, 16#E10E_9818#,
16#7F6A_0DBB#, 16#086D_3D2D#, 16#9164_6C97#, 16#E663_5C01#,
16#6B6B_51F4#, 16#1C6C_6162#, 16#8565_30D8#, 16#F262_004E#,
16#6C06_95ED#, 16#1B01_A57B#, 16#8208_F4C1#, 16#F50F_C457#,
16#65B0_D9C6#, 16#12B7_E950#, 16#8BBE_B8EA#, 16#FCB9_887C#,
16#62DD_1DDF#, 16#15DA_2D49#, 16#8CD3_7CF3#, 16#FBD4_4C65#,
16#4DB2_6158#, 16#3AB5_51CE#, 16#A3BC_0074#, 16#D4BB_30E2#,
16#4ADF_A541#, 16#3DD8_95D7#, 16#A4D1_C46D#, 16#D3D6_F4FB#,
16#4369_E96A#, 16#346E_D9FC#, 16#AD67_8846#, 16#DA60_B8D0#,
16#4404_2D73#, 16#3303_1DE5#, 16#AA0A_4C5F#, 16#DD0D_7CC9#,
16#5005_713C#, 16#2702_41AA#, 16#BE0B_1010#, 16#C90C_2086#,
16#5768_B525#, 16#206F_85B3#, 16#B966_D409#, 16#CE61_E49F#,
16#5EDE_F90E#, 16#29D9_C998#, 16#B0D0_9822#, 16#C7D7_A8B4#,
16#59B3_3D17#, 16#2EB4_0D81#, 16#B7BD_5C3B#, 16#C0BA_6CAD#,
16#EDB8_8320#, 16#9ABF_B3B6#, 16#03B6_E20C#, 16#74B1_D29A#,
16#EAD5_4739#, 16#9DD2_77AF#, 16#04DB_2615#, 16#73DC_1683#,
16#E363_0B12#, 16#9464_3B84#, 16#0D6D_6A3E#, 16#7A6A_5AA8#,
16#E40E_CF0B#, 16#9309_FF9D#, 16#0A00_AE27#, 16#7D07_9EB1#,
16#F00F_9344#, 16#8708_A3D2#, 16#1E01_F268#, 16#6906_C2FE#,
16#F762_575D#, 16#8065_67CB#, 16#196C_3671#, 16#6E6B_06E7#,
16#FED4_1B76#, 16#89D3_2BE0#, 16#10DA_7A5A#, 16#67DD_4ACC#,
16#F9B9_DF6F#, 16#8EBE_EFF9#, 16#17B7_BE43#, 16#60B0_8ED5#,
16#D6D6_A3E8#, 16#A1D1_937E#, 16#38D8_C2C4#, 16#4FDF_F252#,
16#D1BB_67F1#, 16#A6BC_5767#, 16#3FB5_06DD#, 16#48B2_364B#,
16#D80D_2BDA#, 16#AF0A_1B4C#, 16#3603_4AF6#, 16#4104_7A60#,
16#DF60_EFC3#, 16#A867_DF55#, 16#316E_8EEF#, 16#4669_BE79#,
16#CB61_B38C#, 16#BC66_831A#, 16#256F_D2A0#, 16#5268_E236#,
16#CC0C_7795#, 16#BB0B_4703#, 16#2202_16B9#, 16#5505_262F#,
16#C5BA_3BBE#, 16#B2BD_0B28#, 16#2BB4_5A92#, 16#5CB3_6A04#,
16#C2D7_FFA7#, 16#B5D0_CF31#, 16#2CD9_9E8B#, 16#5BDE_AE1D#,
16#9B64_C2B0#, 16#EC63_F226#, 16#756A_A39C#, 16#026D_930A#,
16#9C09_06A9#, 16#EB0E_363F#, 16#7207_6785#, 16#0500_5713#,
16#95BF_4A82#, 16#E2B8_7A14#, 16#7BB1_2BAE#, 16#0CB6_1B38#,
16#92D2_8E9B#, 16#E5D5_BE0D#, 16#7CDC_EFB7#, 16#0BDB_DF21#,
16#86D3_D2D4#, 16#F1D4_E242#, 16#68DD_B3F8#, 16#1FDA_836E#,
16#81BE_16CD#, 16#F6B9_265B#, 16#6FB0_77E1#, 16#18B7_4777#,
16#8808_5AE6#, 16#FF0F_6A70#, 16#6606_3BCA#, 16#1101_0B5C#,
16#8F65_9EFF#, 16#F862_AE69#, 16#616B_FFD3#, 16#166C_CF45#,
16#A00A_E278#, 16#D70D_D2EE#, 16#4E04_8354#, 16#3903_B3C2#,
16#A767_2661#, 16#D060_16F7#, 16#4969_474D#, 16#3E6E_77DB#,
16#AED1_6A4A#, 16#D9D6_5ADC#, 16#40DF_0B66#, 16#37D8_3BF0#,
16#A9BC_AE53#, 16#DEBB_9EC5#, 16#47B2_CF7F#, 16#30B5_FFE9#,
16#BDBD_F21C#, 16#CABA_C28A#, 16#53B3_9330#, 16#24B4_A3A6#,
16#BAD0_3605#, 16#CDD7_0693#, 16#54DE_5729#, 16#23D9_67BF#,
16#B366_7A2E#, 16#C461_4AB8#, 16#5D68_1B02#, 16#2A6F_2B94#,
16#B40B_BE37#, 16#C30C_8EA1#, 16#5A05_DF1B#, 16#2D02_EF8D#);
---------------
-- Get_Value --
---------------
function Get_Value (C : CRC32) return Interfaces.Unsigned_32 is
begin
return Interfaces.Unsigned_32 (C xor XorOut);
end Get_Value;
----------------
-- Initialize --
----------------
procedure Initialize (C : out CRC32) is
begin
C := Init;
end Initialize;
------------
-- Update --
------------
procedure Update (C : in out CRC32; Value : Character) is
V : constant CRC32 := CRC32 (Character'Pos (Value));
begin
C := Shift_Right (C, 8) xor Table (V xor (C and 16#0000_00FF#));
end Update;
end System.CRC32;
| 56.223022 | 78 | 0.572105 |
fb853ffe76652b68cbe34f3ac868c7c48ce1b595 | 2,667 | adb | Ada | demo/src/last_chance_handler.adb | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | demo/src/last_chance_handler.adb | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | demo/src/last_chance_handler.adb | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT EXAMPLE --
-- --
-- Copyright (C) 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. --
-- --
------------------------------------------------------------------------------
with STM32F429_Discovery; use STM32F429_Discovery;
package body Last_Chance_Handler is
-------------------------
-- Last_Chance_Handler --
-------------------------
procedure Last_Chance_Handler (Msg : System.Address; Line : Integer) is
pragma Unreferenced (Msg, Line);
begin
Off (Green);
-- Off (Orange);
-- Off (Blue);
On (Red);
-- No return procedure.
pragma Warnings (Off, "*rewritten as loop");
<<spin>> goto spin; -- yes, a goto!
pragma Warnings (On, "*rewritten as loop");
end Last_Chance_Handler;
end Last_Chance_Handler;
| 53.34 | 78 | 0.445819 |
fbae1a38f7b67642689d0ba9269144c6ecccf3e9 | 53 | adb | Ada | puzzle_03/src/puzzle_03.adb | AdaForge/Advent_of_Code_2020 | ed8bde7eb2a21b6fba70988f8220a3facc12890f | [
"CC0-1.0"
] | null | null | null | puzzle_03/src/puzzle_03.adb | AdaForge/Advent_of_Code_2020 | ed8bde7eb2a21b6fba70988f8220a3facc12890f | [
"CC0-1.0"
] | null | null | null | puzzle_03/src/puzzle_03.adb | AdaForge/Advent_of_Code_2020 | ed8bde7eb2a21b6fba70988f8220a3facc12890f | [
"CC0-1.0"
] | null | null | null | procedure Puzzle_03 is
begin
null;
end Puzzle_03;
| 10.6 | 22 | 0.773585 |
502eda70d6b5cffd8e88dfc358bd11b5daf9d8f3 | 1,582 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_glx_get_minmax_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_minmax_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_minmax_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- 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;
| 28.25 | 79 | 0.664349 |
23a9721227a6d04aaac9f25de98cd900d1101c52 | 271 | ads | Ada | tests/generic_table_test.ads | jonashaggstrom/ada-canopen | 8e0f32323a0f09b41e8b51ef7123738bbf29f194 | [
"Apache-2.0"
] | 6 | 2018-05-12T22:08:04.000Z | 2021-07-25T20:55:12.000Z | tests/generic_table_test.ads | jonashaggstrom/ada-canopen | 8e0f32323a0f09b41e8b51ef7123738bbf29f194 | [
"Apache-2.0"
] | null | null | null | tests/generic_table_test.ads | jonashaggstrom/ada-canopen | 8e0f32323a0f09b41e8b51ef7123738bbf29f194 | [
"Apache-2.0"
] | 2 | 2021-06-15T11:56:46.000Z | 2021-06-21T13:56:01.000Z | with AUnit;
with AUnit.Simple_Test_Cases;
package Generic_Table_Test is
type Test is new AUnit.Simple_Test_Cases.Test_Case with null record;
function Name (T : Test) return AUnit.Message_String;
procedure Run_Test (T : in out Test);
end Generic_Table_Test;
| 20.846154 | 71 | 0.774908 |
107e28c8d0f19cf922ff2e81d8c7b926d3c61d22 | 835 | adb | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/info_addr_mixed_case/pck.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/info_addr_mixed_case/pck.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/info_addr_mixed_case/pck.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2018-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Do_Nothing (A : System.Address) is
begin
null;
end Do_Nothing;
end Pck;
| 33.4 | 73 | 0.726946 |
df99ca92c3dda263158350bf79d1f37bfcd5b0ae | 811 | ads | Ada | courses/fundamentals_of_ada/labs/radar/040_statements/util/radar_internals.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 15 | 2020-10-07T08:56:45.000Z | 2022-02-08T23:13:22.000Z | courses/fundamentals_of_ada/labs/radar/040_statements/util/radar_internals.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 20 | 2020-11-05T14:35:20.000Z | 2022-01-13T15:59:33.000Z | courses/fundamentals_of_ada/labs/radar/040_statements/util/radar_internals.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 6 | 2020-10-08T15:57:06.000Z | 2021-08-31T12:03:08.000Z | package Radar_Internals is
-- Types
type Object_Status_T is (Out_Of_Range, Tracked, Cleared, Selected);
subtype Object_Distance_Km_T is Float range 0.01 .. 100.0;
subtype Speed_Kph_T is Float range 0.0 .. 50.0;
type Speed_Setting_T is (Stopped, Slow, Normal, Fast);
-- Actions on the Radar
procedure Rotate_Antenna (Speed : Speed_Setting_T);
procedure Walk_And_Scan;
procedure Next_Object;
procedure Get_Closer (Speed : Speed_Setting_T);
-- Radar status
function Get_Active_Object_Status return Object_Status_T;
function Get_Active_Object_Distance return Object_Distance_Km_T;
function Get_Running_Speed return Speed_Kph_T;
-- Radar feedback
procedure Update_E_T_A (E_T_A : Float);
procedure Update_No_E_T_A;
procedure Time_Step;
end Radar_Internals;
| 30.037037 | 70 | 0.762022 |
d000f1bdb39760563f22aebe36b961f57cd61fed | 3,384 | adb | Ada | runtime/ravenscar-sfp-stm32f427/arch/s-macres.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | runtime/ravenscar-sfp-stm32f427/arch/s-macres.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | runtime/ravenscar-sfp-stm32f427/arch/s-macres.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . M A C H I N E _ R E S E T --
-- --
-- B o d y --
-- --
-- Copyright (C) 2011-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- 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 Interfaces;
package body System.Machine_Reset is
procedure Os_Exit (Status : Integer);
pragma No_Return (Os_Exit);
pragma Export (Ada, Os_Exit, "_exit");
-- Shutdown or restart the board
procedure Os_Abort;
pragma No_Return (Os_Abort);
pragma Export (Ada, Os_Abort, "abort");
-- Likewise
--------------
-- Os_Abort --
--------------
procedure Os_Abort is
begin
Os_Exit (1);
end Os_Abort;
-------------
-- Os_Exit --
-------------
procedure Os_Exit (Status : Integer) is
pragma Unreferenced (Status);
-- The parameter is just for ISO-C compatibility
AIRCR : Interfaces.Unsigned_32;
for AIRCR'Address use 16#E000_ED0C#;
pragma Import (Ada, AIRCR);
pragma Volatile (AIRCR);
begin
AIRCR := 16#05FA_0004#;
loop
null;
end loop;
end Os_Exit;
----------
-- Stop --
----------
procedure Stop is
begin
Os_Exit (0);
end Stop;
end System.Machine_Reset;
| 40.285714 | 78 | 0.378546 |
dfdd7a9b344ce7264c23a604fb5cc3f8a82fa091 | 3,227 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-pack45.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-pack45.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-pack45.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 5 --
-- --
-- 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. --
-- --
-- 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 = 45
package System.Pack_45 is
pragma Preelaborate;
Bits : constant := 45;
type Bits_45 is mod 2 ** Bits;
for Bits_45'Size use Bits;
-- In all subprograms below, Rev_SSO is set True if the array has the
-- non-default scalar storage order.
function Get_45
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_45 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_45
(Arr : System.Address;
N : Natural;
E : Bits_45;
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.
end System.Pack_45;
| 52.901639 | 78 | 0.439727 |
dfb362f542cf5fd7241ee4776f097e388c8b1f6a | 6,335 | adb | Ada | src/flyweights/flyweights-refcounted_ptrs.adb | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | 5 | 2016-02-22T10:29:26.000Z | 2021-12-18T08:20:12.000Z | src/flyweights/flyweights-refcounted_ptrs.adb | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | 1 | 2022-02-16T03:38:08.000Z | 2022-02-20T21:11:30.000Z | src/flyweights/flyweights-refcounted_ptrs.adb | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | null | null | null | -- flyweights-refcounted_ptrs.adb
-- A package of reference-counting generalised references which point to
-- resources inside a Flyweight
-- 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 Ada.Unchecked_Conversion;
package body Flyweights.Refcounted_Ptrs is
type Access_Element is access all Element;
function Access_Element_To_Element_Access is
new Ada.Unchecked_Conversion(Source => Access_Element,
Target => Element_Access);
subtype Hash_Type is Ada.Containers.Hash_Type;
use type Ada.Containers.Hash_Type;
----------------------------
-- Refcounted_Element_Ptr --
----------------------------
function P (P : Refcounted_Element_Ptr) return E_Ref is
(E_Ref'(E => P.E));
function Get (P : Refcounted_Element_Ptr) return Element_Access is
(P.E);
function Make_Ref (P : Refcounted_Element_Ptr'Class)
return Refcounted_Element_Ref is
begin
Flyweight_Hashtables.Increment(F => P.Containing_Flyweight.all,
Bucket => P.Containing_Bucket,
Data_Ptr => P.E);
return Refcounted_Element_Ref'(Ada.Finalization.Controlled
with E => P.E,
Containing_Flyweight => P.Containing_Flyweight,
Containing_Bucket => P.Containing_Bucket);
end Make_Ref;
function Insert_Ptr (F : aliased in out Flyweight_Hashtables.Flyweight;
E : in out Element_Access) return Refcounted_Element_Ptr is
Bucket : Hash_Type ;
begin
Flyweight_Hashtables.Insert (F => F,
Bucket => Bucket,
Data_Ptr => E);
return Refcounted_Element_Ptr'(Ada.Finalization.Controlled
with E => E,
Containing_Flyweight => F'Access,
Containing_Bucket => Bucket);
end Insert_Ptr;
overriding procedure Adjust (Object : in out Refcounted_Element_Ptr) is
begin
if Object.E /= null and Object.Containing_Flyweight /= null then
Flyweight_Hashtables.Increment(F => Object.Containing_Flyweight.all,
Bucket => Object.Containing_Bucket,
Data_Ptr => Object.E);
end if;
end Adjust;
overriding procedure Finalize (Object : in out Refcounted_Element_Ptr) is
begin
if Object.E /= null and Object.Containing_Flyweight /= null then
Flyweight_Hashtables.Remove(F => Object.Containing_Flyweight.all,
Bucket => Object.Containing_Bucket,
Data_Ptr => Object.E);
Object.Containing_Flyweight := null;
end if;
end Finalize;
----------------------------
-- Refcounted_Element_Ref --
----------------------------
function Make_Ptr (R : Refcounted_Element_Ref'Class)
return Refcounted_Element_Ptr is
begin
Flyweight_Hashtables.Increment(F => R.Containing_Flyweight.all,
Bucket => R.Containing_Bucket,
Data_Ptr => Access_Element_To_Element_Access(R.E));
return Refcounted_Element_Ptr'(Ada.Finalization.Controlled
with E => Access_Element_To_Element_Access(R.E),
Containing_Flyweight => R.Containing_Flyweight,
Containing_Bucket => R.Containing_Bucket);
end Make_Ptr;
function Get (P : Refcounted_Element_Ref) return Element_Access is
(Access_Element_To_Element_Access(P.E));
function Insert_Ref (F : aliased in out Flyweight_Hashtables.Flyweight;
E : in out Element_Access) return Refcounted_Element_Ref is
Bucket : Hash_Type ;
begin
Flyweight_Hashtables.Insert (F => F,
Bucket => Bucket,
Data_Ptr => E);
return Refcounted_Element_Ref'(Ada.Finalization.Controlled
with E => E,
Containing_Flyweight => F'Access,
Containing_Bucket => Bucket);
end Insert_Ref;
overriding procedure Initialize (Object : in out Refcounted_Element_Ref) is
begin
raise Program_Error
with "Refcounted_Element_Ref should not be created outside the package";
end Initialize;
overriding procedure Adjust (Object : in out Refcounted_Element_Ref) is
begin
if Object.Containing_Flyweight /= null then
Flyweight_Hashtables.Increment(F => Object.Containing_Flyweight.all,
Bucket => Object.Containing_Bucket,
Data_Ptr => Access_Element_To_Element_Access(Object.E));
end if;
end Adjust;
overriding procedure Finalize (Object : in out Refcounted_Element_Ref) is
begin
if Object.Containing_Flyweight /= null then
Flyweight_Hashtables.Remove(F => Object.Containing_Flyweight.all,
Bucket => Object.Containing_Bucket,
Data_Ptr => Access_Element_To_Element_Access(Object.E));
Object.Containing_Flyweight := null;
end if;
end Finalize;
end Flyweights.Refcounted_Ptrs;
| 42.804054 | 99 | 0.596685 |
0e0bbca440eb2f2814e2c1afb92fdea417a057a0 | 28,267 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/exp_ch13.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/exp_ch13.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/exp_ch13.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ C H 1 3 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Checks; use Checks;
with Einfo; use Einfo;
with Exp_Ch3; use Exp_Ch3;
with Exp_Ch6; use Exp_Ch6;
with Exp_Imgv; use Exp_Imgv;
with Exp_Tss; use Exp_Tss;
with Exp_Util; use Exp_Util;
with Freeze; use Freeze;
with Namet; use Namet;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Restrict; use Restrict;
with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Ch7; use Sem_Ch7;
with Sem_Ch8; use Sem_Ch8;
with Sem_Eval; use Sem_Eval;
with Sem_Util; use Sem_Util;
with Sinfo; use Sinfo;
with Snames; use Snames;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
with Validsw; use Validsw;
package body Exp_Ch13 is
------------------------------------------
-- Expand_N_Attribute_Definition_Clause --
------------------------------------------
-- Expansion action depends on attribute involved
procedure Expand_N_Attribute_Definition_Clause (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Exp : constant Node_Id := Expression (N);
Ent : Entity_Id;
V : Node_Id;
begin
Ent := Entity (Name (N));
if Is_Type (Ent) then
Ent := Underlying_Type (Ent);
end if;
case Get_Attribute_Id (Chars (N)) is
-------------
-- Address --
-------------
when Attribute_Address =>
-- If there is an initialization which did not come from the
-- source program, then it is an artifact of our expansion, and we
-- suppress it. The case we are most concerned about here is the
-- initialization of a packed array to all false, which seems
-- inappropriate for variable to which an address clause is
-- applied. The expression may itself have been rewritten if the
-- type is packed array, so we need to examine whether the
-- original node is in the source. An exception though is the case
-- of an access variable which is default initialized to null, and
-- such initialization is retained.
-- Furthermore, if the initialization is the equivalent aggregate
-- of the type initialization procedure, it replaces an implicit
-- call to the init proc, and must be respected. Note that for
-- packed types we do not build equivalent aggregates.
-- Also, if Init_Or_Norm_Scalars applies, then we need to retain
-- any default initialization for objects of scalar types and
-- types with scalar components. Normally a composite type will
-- have an init_proc in the presence of Init_Or_Norm_Scalars,
-- so when that flag is set we have just have to do a test for
-- scalar and string types (the predefined string types such as
-- String and Wide_String don't have an init_proc).
declare
Decl : constant Node_Id := Declaration_Node (Ent);
Typ : constant Entity_Id := Etype (Ent);
begin
if Nkind (Decl) = N_Object_Declaration
and then Present (Expression (Decl))
and then Nkind (Expression (Decl)) /= N_Null
and then
not Comes_From_Source (Original_Node (Expression (Decl)))
then
if Present (Base_Init_Proc (Typ))
and then
Present (Static_Initialization (Base_Init_Proc (Typ)))
then
null;
elsif Init_Or_Norm_Scalars
and then (Is_Scalar_Type (Typ)
or else Is_String_Type (Typ))
then
null;
else
Set_Expression (Decl, Empty);
end if;
-- An object declaration to which an address clause applies
-- has a delayed freeze, but the address expression itself
-- must be elaborated at the point it appears. If the object
-- is controlled, additional checks apply elsewhere.
-- If the attribute comes from an aspect specification it
-- is being elaborated at the freeze point and side effects
-- need not be removed (and shouldn't, if the expression
-- depends on other entities that have delayed freeze).
-- This is another consequence of the delayed analysis of
-- aspects, and a real semantic difference.
elsif Nkind (Decl) = N_Object_Declaration
and then not Needs_Constant_Address (Decl, Typ)
and then not From_Aspect_Specification (N)
then
Remove_Side_Effects (Exp);
end if;
end;
---------------
-- Alignment --
---------------
when Attribute_Alignment =>
-- As required by Gigi, we guarantee that the operand is an
-- integer literal (this simplifies things in Gigi).
if Nkind (Exp) /= N_Integer_Literal then
Rewrite (Exp, Make_Integer_Literal (Loc, Expr_Value (Exp)));
end if;
-- A complex case arises if the alignment clause applies to an
-- unconstrained object initialized with a function call. The
-- result of the call is placed on the secondary stack, and the
-- declaration is rewritten as a renaming of a dereference, which
-- fails expansion. We must introduce a temporary and assign its
-- value to the existing entity.
if Nkind (Parent (Ent)) = N_Object_Renaming_Declaration
and then not Is_Entity_Name (Renamed_Object (Ent))
then
declare
Decl : constant Node_Id := Parent (Ent);
Loc : constant Source_Ptr := Sloc (N);
Temp : constant Entity_Id := Make_Temporary (Loc, 'T');
New_Decl : Node_Id;
begin
-- Replace entity with temporary and reanalyze
Set_Defining_Identifier (Decl, Temp);
Set_Analyzed (Decl, False);
Analyze (Decl);
-- Introduce new declaration for entity but do not reanalyze
-- because entity is already in scope. Type and expression
-- are already resolved.
New_Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => Ent,
Object_Definition =>
New_Occurrence_Of (Etype (Ent), Loc),
Expression => New_Occurrence_Of (Temp, Loc));
Set_Renamed_Object (Ent, Empty);
Insert_After (Decl, New_Decl);
Set_Analyzed (Decl);
end;
end if;
------------------
-- Storage_Size --
------------------
when Attribute_Storage_Size =>
-- If the type is a task type, then assign the value of the
-- storage size to the Size variable associated with the task.
-- Insert the assignment right after the declaration of the Size
-- variable.
-- Generate:
-- task_typeZ := expression
if Ekind (Ent) = E_Task_Type then
declare
Assign : Node_Id;
begin
Assign :=
Make_Assignment_Statement (Loc,
Name =>
New_Occurrence_Of (Storage_Size_Variable (Ent), Loc),
Expression =>
Convert_To (RTE (RE_Size_Type), Expression (N)));
-- If the clause is not generated by an aspect, insert
-- the assignment here. Freezing rules ensure that this
-- is safe, or clause will have been rejected already.
if Is_List_Member (N) then
Insert_After (N, Assign);
-- Otherwise, insert assignment after task declaration.
else
Insert_After
(Parent (Storage_Size_Variable (Entity (N))), Assign);
end if;
Analyze (Assign);
end;
-- For Storage_Size for an access type, create a variable to hold
-- the value of the specified size with name typeV and expand an
-- assignment statement to initialize this value.
elsif Is_Access_Type (Ent) then
-- We don't need the variable for a storage size of zero
if not No_Pool_Assigned (Ent) then
V :=
Make_Defining_Identifier (Loc,
Chars => New_External_Name (Chars (Ent), 'V'));
-- Insert the declaration of the object
Insert_Action (N,
Make_Object_Declaration (Loc,
Defining_Identifier => V,
Object_Definition =>
New_Occurrence_Of (RTE (RE_Storage_Offset), Loc),
Expression =>
Convert_To (RTE (RE_Storage_Offset), Expression (N))));
Set_Storage_Size_Variable (Ent, Entity_Id (V));
end if;
end if;
-- Other attributes require no expansion
when others =>
null;
end case;
end Expand_N_Attribute_Definition_Clause;
-----------------------------
-- Expand_N_Free_Statement --
-----------------------------
procedure Expand_N_Free_Statement (N : Node_Id) is
Expr : constant Node_Id := Expression (N);
Typ : Entity_Id;
begin
-- Certain run-time configurations and targets do not provide support
-- for controlled types.
if Restriction_Active (No_Finalization) then
return;
end if;
-- Use the base type to perform the check for finalization master
Typ := Etype (Expr);
if Ekind (Typ) = E_Access_Subtype then
Typ := Etype (Typ);
end if;
-- Handle private access types
if Is_Private_Type (Typ)
and then Present (Full_View (Typ))
then
Typ := Full_View (Typ);
end if;
-- Do not create a custom Deallocate when freeing an object with
-- suppressed finalization. In such cases the object is never attached
-- to a master, so it does not need to be detached. Use a regular free
-- statement instead.
if No (Finalization_Master (Typ)) then
return;
end if;
-- Use a temporary to store the result of a complex expression. Perform
-- the following transformation:
--
-- Free (Complex_Expression);
--
-- Temp : constant Type_Of_Expression := Complex_Expression;
-- Free (Temp);
if Nkind (Expr) /= N_Identifier then
declare
Expr_Typ : constant Entity_Id := Etype (Expr);
Loc : constant Source_Ptr := Sloc (N);
New_Expr : Node_Id;
Temp_Id : Entity_Id;
begin
Temp_Id := Make_Temporary (Loc, 'T');
Insert_Action (N,
Make_Object_Declaration (Loc,
Defining_Identifier => Temp_Id,
Object_Definition => New_Occurrence_Of (Expr_Typ, Loc),
Expression => Relocate_Node (Expr)));
New_Expr := New_Occurrence_Of (Temp_Id, Loc);
Set_Etype (New_Expr, Expr_Typ);
Set_Expression (N, New_Expr);
end;
end if;
-- Create a custom Deallocate for a controlled object. This routine
-- ensures that the hidden list header will be deallocated along with
-- the actual object.
Build_Allocate_Deallocate_Proc (N, Is_Allocate => False);
end Expand_N_Free_Statement;
----------------------------
-- Expand_N_Freeze_Entity --
----------------------------
procedure Expand_N_Freeze_Entity (N : Node_Id) is
E : constant Entity_Id := Entity (N);
Decl : Node_Id;
Delete : Boolean := False;
E_Scope : Entity_Id;
In_Other_Scope : Boolean;
In_Outer_Scope : Boolean;
begin
-- If there are delayed aspect specifications, we insert them just
-- before the freeze node. They are already analyzed so we don't need
-- to reanalyze them (they were analyzed before the type was frozen),
-- but we want them in the tree for the back end, and so that the
-- listing from sprint is clearer on where these occur logically.
if Has_Delayed_Aspects (E) then
declare
Aitem : Node_Id;
Ritem : Node_Id;
begin
-- Look for aspect specs for this entity
Ritem := First_Rep_Item (E);
while Present (Ritem) loop
if Nkind (Ritem) = N_Aspect_Specification
and then Entity (Ritem) = E
then
Aitem := Aspect_Rep_Item (Ritem);
-- Skip this for aspects (e.g. Current_Value) for which
-- there is no corresponding pragma or attribute.
if Present (Aitem)
-- Also skip if we have a null statement rather than a
-- delayed aspect (this happens when we are ignoring rep
-- items from use of the -gnatI switch).
and then Nkind (Aitem) /= N_Null_Statement
then
pragma Assert (Is_Delayed_Aspect (Aitem));
Insert_Before (N, Aitem);
end if;
end if;
Next_Rep_Item (Ritem);
end loop;
end;
end if;
-- Processing for objects
if Is_Object (E) then
if Present (Address_Clause (E)) then
Apply_Address_Clause_Check (E, N);
end if;
-- Analyze actions in freeze node, if any
if Present (Actions (N)) then
declare
Act : Node_Id;
begin
Act := First (Actions (N));
while Present (Act) loop
Analyze (Act);
Next (Act);
end loop;
end;
end if;
-- If initialization statements have been captured in a compound
-- statement, insert them back into the tree now.
Explode_Initialization_Compound_Statement (E);
return;
-- Only other items requiring any front end action are types and
-- subprograms.
elsif not Is_Type (E) and then not Is_Subprogram (E) then
return;
end if;
-- Here E is a type or a subprogram
E_Scope := Scope (E);
-- This is an error protection against previous errors
if No (E_Scope) then
Check_Error_Detected;
return;
end if;
-- The entity may be a subtype declared for a constrained record
-- component, in which case the relevant scope is the scope of
-- the record. This happens for class-wide subtypes created for
-- a constrained type extension with inherited discriminants.
if Is_Type (E_Scope)
and then Ekind (E_Scope) not in Concurrent_Kind
then
E_Scope := Scope (E_Scope);
end if;
-- Remember that we are processing a freezing entity and its freezing
-- nodes. This flag (non-zero = set) is used to avoid the need of
-- climbing through the tree while processing the freezing actions (ie.
-- to avoid generating spurious warnings or to avoid killing constant
-- indications while processing the code associated with freezing
-- actions). We use a counter to deal with nesting.
Inside_Freezing_Actions := Inside_Freezing_Actions + 1;
-- If we are freezing entities defined in protected types, they belong
-- in the enclosing scope, given that the original type has been
-- expanded away. The same is true for entities in task types, in
-- particular the parameter records of entries (Entities in bodies are
-- all frozen within the body). If we are in the task body, this is a
-- proper scope. If we are within a subprogram body, the proper scope
-- is the corresponding spec. This may happen for itypes generated in
-- the bodies of protected operations.
if Ekind (E_Scope) = E_Protected_Type
or else (Ekind (E_Scope) = E_Task_Type
and then not Has_Completion (E_Scope))
then
E_Scope := Scope (E_Scope);
elsif Ekind (E_Scope) = E_Subprogram_Body then
E_Scope := Corresponding_Spec (Unit_Declaration_Node (E_Scope));
end if;
-- If the scope of the entity is in open scopes, it is the current one
-- or an enclosing one, including a loop, a block, or a subprogram.
if In_Open_Scopes (E_Scope) then
In_Other_Scope := False;
In_Outer_Scope := E_Scope /= Current_Scope;
-- Otherwise it is a local package or a different compilation unit
else
In_Other_Scope := True;
In_Outer_Scope := False;
end if;
-- If the entity being frozen is defined in a scope that is not
-- currently on the scope stack, we must establish the proper
-- visibility before freezing the entity and related subprograms.
if In_Other_Scope then
Push_Scope (E_Scope);
-- Finalizers are little odd in terms of freezing. The spec of the
-- procedure appears in the declarations while the body appears in
-- the statement part of a single construct. Since the finalizer must
-- be called by the At_End handler of the construct, the spec is
-- manually frozen right after its declaration. The only side effect
-- of this action appears in contexts where the construct is not in
-- its final resting place. These contexts are:
-- * Entry bodies - The declarations and statements are moved to
-- the procedure equivalen of the entry.
-- * Protected subprograms - The declarations and statements are
-- moved to the non-protected version of the subprogram.
-- * Task bodies - The declarations and statements are moved to the
-- task body procedure.
-- Visible declarations do not need to be installed in these three
-- cases since it does not make semantic sense to do so. All entities
-- referenced by a finalizer are visible and already resolved, plus
-- the enclosing scope may not have visible declarations at all.
if Ekind (E) = E_Procedure
and then Is_Finalizer (E)
and then
(Is_Entry (E_Scope)
or else (Is_Subprogram (E_Scope)
and then Is_Protected_Type (Scope (E_Scope)))
or else Is_Task_Type (E_Scope))
then
null;
else
Install_Visible_Declarations (E_Scope);
end if;
if Is_Package_Or_Generic_Package (E_Scope) or else
Is_Protected_Type (E_Scope) or else
Is_Task_Type (E_Scope)
then
Install_Private_Declarations (E_Scope);
end if;
-- If the entity is in an outer scope, then that scope needs to
-- temporarily become the current scope so that operations created
-- during type freezing will be declared in the right scope and
-- can properly override any corresponding inherited operations.
elsif In_Outer_Scope then
Push_Scope (E_Scope);
end if;
-- If type, freeze the type
if Is_Type (E) then
Delete := Freeze_Type (N);
-- And for enumeration type, build the enumeration tables
if Is_Enumeration_Type (E) then
Build_Enumeration_Image_Tables (E, N);
end if;
-- If subprogram, freeze the subprogram
elsif Is_Subprogram (E) then
Exp_Ch6.Freeze_Subprogram (N);
-- Ada 2005 (AI-251): Remove the freezing node associated with the
-- entities internally used by the frontend to register primitives
-- covering abstract interfaces. The call to Freeze_Subprogram has
-- already expanded the code that fills the corresponding entry in
-- its secondary dispatch table and therefore the code generator
-- has nothing else to do with this freezing node.
Delete := Present (Interface_Alias (E));
end if;
-- Analyze actions generated by freezing. The init_proc contains source
-- expressions that may raise Constraint_Error, and the assignment
-- procedure for complex types needs checks on individual component
-- assignments, but all other freezing actions should be compiled with
-- all checks off.
if Present (Actions (N)) then
Decl := First (Actions (N));
while Present (Decl) loop
if Nkind (Decl) = N_Subprogram_Body
and then (Is_Init_Proc (Defining_Entity (Decl))
or else
Chars (Defining_Entity (Decl)) = Name_uAssign)
then
Analyze (Decl);
-- A subprogram body created for a renaming_as_body completes
-- a previous declaration, which may be in a different scope.
-- Establish the proper scope before analysis.
elsif Nkind (Decl) = N_Subprogram_Body
and then Present (Corresponding_Spec (Decl))
and then Scope (Corresponding_Spec (Decl)) /= Current_Scope
then
Push_Scope (Scope (Corresponding_Spec (Decl)));
Analyze (Decl, Suppress => All_Checks);
Pop_Scope;
-- We treat generated equality specially, if validity checks are
-- enabled, in order to detect components default-initialized
-- with invalid values.
elsif Nkind (Decl) = N_Subprogram_Body
and then Chars (Defining_Entity (Decl)) = Name_Op_Eq
and then Validity_Checks_On
and then Initialize_Scalars
then
declare
Save_Force : constant Boolean := Force_Validity_Checks;
begin
Force_Validity_Checks := True;
Analyze (Decl);
Force_Validity_Checks := Save_Force;
end;
-- All other freezing actions
else
Analyze (Decl, Suppress => All_Checks);
end if;
Next (Decl);
end loop;
end if;
-- If we are to delete this N_Freeze_Entity, do so by rewriting so that
-- a loop on all nodes being inserted will work propertly.
if Delete then
Rewrite (N, Make_Null_Statement (Sloc (N)));
end if;
-- Pop scope if we installed one for the analysis
if In_Other_Scope then
if Ekind (Current_Scope) = E_Package then
End_Package_Scope (E_Scope);
else
End_Scope;
end if;
elsif In_Outer_Scope then
Pop_Scope;
end if;
-- Restore previous value of the nesting-level counter that records
-- whether we are inside a (possibly nested) call to this procedure.
Inside_Freezing_Actions := Inside_Freezing_Actions - 1;
end Expand_N_Freeze_Entity;
-------------------------------------------
-- Expand_N_Record_Representation_Clause --
-------------------------------------------
-- The only expansion required is for the case of a mod clause present,
-- which is removed, and translated into an alignment representation
-- clause inserted immediately after the record rep clause with any
-- initial pragmas inserted at the start of the component clause list.
procedure Expand_N_Record_Representation_Clause (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Rectype : constant Entity_Id := Entity (Identifier (N));
Mod_Val : Uint;
Citems : List_Id;
Repitem : Node_Id;
AtM_Nod : Node_Id;
begin
if Present (Mod_Clause (N)) and then not Ignore_Rep_Clauses then
Mod_Val := Expr_Value (Expression (Mod_Clause (N)));
Citems := Pragmas_Before (Mod_Clause (N));
if Present (Citems) then
Append_List_To (Citems, Component_Clauses (N));
Set_Component_Clauses (N, Citems);
end if;
AtM_Nod :=
Make_Attribute_Definition_Clause (Loc,
Name => New_Occurrence_Of (Base_Type (Rectype), Loc),
Chars => Name_Alignment,
Expression => Make_Integer_Literal (Loc, Mod_Val));
Set_From_At_Mod (AtM_Nod);
Insert_After (N, AtM_Nod);
Set_Mod_Clause (N, Empty);
end if;
-- If the record representation clause has no components, then
-- completely remove it. Note that we also have to remove
-- ourself from the Rep Item list.
if Is_Empty_List (Component_Clauses (N)) then
if First_Rep_Item (Rectype) = N then
Set_First_Rep_Item (Rectype, Next_Rep_Item (N));
else
Repitem := First_Rep_Item (Rectype);
while Present (Next_Rep_Item (Repitem)) loop
if Next_Rep_Item (Repitem) = N then
Set_Next_Rep_Item (Repitem, Next_Rep_Item (N));
exit;
end if;
Next_Rep_Item (Repitem);
end loop;
end if;
Rewrite (N,
Make_Null_Statement (Loc));
end if;
end Expand_N_Record_Representation_Clause;
end Exp_Ch13;
| 38.044415 | 79 | 0.556656 |
398084f750da9e3442294533504282dc0514b089 | 5,407 | ads | Ada | source/amf/uml/amf-internals-standard_profile_l2_creates.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-internals-standard_profile_l2_creates.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-internals-standard_profile_l2_creates.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Elements;
with AMF.Standard_Profile_L2.Creates;
with AMF.UML.Behavioral_Features;
with AMF.UML.Usages;
with AMF.Visitors;
package AMF.Internals.Standard_Profile_L2_Creates is
type Standard_Profile_L2_Create_Proxy is
limited new AMF.Internals.UML_Elements.UML_Element_Base
and AMF.Standard_Profile_L2.Creates.Standard_Profile_L2_Create with null record;
overriding function Get_Base_Behavioral_Feature
(Self : not null access constant Standard_Profile_L2_Create_Proxy)
return AMF.UML.Behavioral_Features.UML_Behavioral_Feature_Access;
-- Getter of Create::base_BehavioralFeature.
--
overriding procedure Set_Base_Behavioral_Feature
(Self : not null access Standard_Profile_L2_Create_Proxy;
To : AMF.UML.Behavioral_Features.UML_Behavioral_Feature_Access);
-- Setter of Create::base_BehavioralFeature.
--
overriding function Get_Base_Usage
(Self : not null access constant Standard_Profile_L2_Create_Proxy)
return AMF.UML.Usages.UML_Usage_Access;
-- Getter of Create::base_Usage.
--
overriding procedure Set_Base_Usage
(Self : not null access Standard_Profile_L2_Create_Proxy;
To : AMF.UML.Usages.UML_Usage_Access);
-- Setter of Create::base_Usage.
--
overriding procedure Enter_Element
(Self : not null access constant Standard_Profile_L2_Create_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
overriding procedure Leave_Element
(Self : not null access constant Standard_Profile_L2_Create_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
overriding procedure Visit_Element
(Self : not null access constant Standard_Profile_L2_Create_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
end AMF.Internals.Standard_Profile_L2_Creates;
| 55.742268 | 87 | 0.536342 |
c5e7ea3e9aaf3b7ed4ad8e6f33835cfc8a7c080e | 24,943 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-exexda.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-exexda.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-exexda.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- ADA.EXCEPTIONS.EXCEPTION_DATA --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements; use System.Storage_Elements;
separate (Ada.Exceptions)
package body Exception_Data is
-- This unit implements the Exception_Information related services for
-- both the Ada standard requirements and the GNAT.Exception_Traces
-- facility. This is also used by the implementation of the stream
-- attributes of types Exception_Id and Exception_Occurrence.
-- There are common parts between the contents of Exception_Information
-- (the regular Ada interface) and Untailored_Exception_Information (used
-- for streaming, and when there is no symbolic traceback available) The
-- overall structure is sketched below:
--
-- Untailored_Exception_Information
-- |
-- +-------+--------+
-- | |
-- Basic_Exc_Info & Untailored_Exc_Tback
-- (B_E_I) (U_E_TB)
-- o--
-- (B_E_I) | Exception_Name: <exception name> (as in Exception_Name)
-- | Message: <message> (or a null line if no message)
-- | PID=nnnn (if nonzero)
-- o--
-- (U_E_TB) | Call stack traceback locations:
-- | <0xyyyyyyyy 0xyyyyyyyy ...>
-- o--
-- Exception_Information
-- |
-- +----------+----------+
-- | |
-- Basic_Exc_Info & traceback
-- |
-- +-----------+------------+
-- | |
-- Untailored_Exc_Tback Or Tback_Decorator
-- if no decorator set otherwise
-- Functions returning String imply secondary stack use, which is a heavy
-- mechanism requiring run-time support. Besides, some of the routines we
-- provide here are to be used by the default Last_Chance_Handler, at the
-- critical point where the runtime is about to be finalized. Since most
-- of the items we have at hand are of bounded length, we also provide a
-- procedural interface able to incrementally append the necessary bits to
-- a preallocated buffer or output them straight to stderr.
-- The procedural interface is composed of two major sections: a neutral
-- section for basic types like Address, Character, Natural or String, and
-- an exception oriented section for the exception names, messages, and
-- information. This is the Append_Info family of procedures below.
-- Output to stderr is commanded by passing an empty buffer to update, and
-- care is taken not to overflow otherwise.
--------------------------------------------
-- Procedural Interface - Neutral section --
--------------------------------------------
procedure Append_Info_Address
(A : Address;
Info : in out String;
Ptr : in out Natural);
procedure Append_Info_Character
(C : Character;
Info : in out String;
Ptr : in out Natural);
procedure Append_Info_Nat
(N : Natural;
Info : in out String;
Ptr : in out Natural);
procedure Append_Info_NL
(Info : in out String;
Ptr : in out Natural);
pragma Inline (Append_Info_NL);
procedure Append_Info_String
(S : String;
Info : in out String;
Ptr : in out Natural);
-------------------------------------------------------
-- Procedural Interface - Exception oriented section --
-------------------------------------------------------
procedure Append_Info_Exception_Name
(Id : Exception_Id;
Info : in out String;
Ptr : in out Natural);
procedure Append_Info_Exception_Name
(X : Exception_Occurrence;
Info : in out String;
Ptr : in out Natural);
procedure Append_Info_Exception_Message
(X : Exception_Occurrence;
Info : in out String;
Ptr : in out Natural);
procedure Append_Info_Basic_Exception_Information
(X : Exception_Occurrence;
Info : in out String;
Ptr : in out Natural);
procedure Append_Info_Untailored_Exception_Traceback
(X : Exception_Occurrence;
Info : in out String;
Ptr : in out Natural);
procedure Append_Info_Untailored_Exception_Information
(X : Exception_Occurrence;
Info : in out String;
Ptr : in out Natural);
-- The "functional" interface to the exception information not involving
-- a traceback decorator uses preallocated intermediate buffers to avoid
-- the use of secondary stack. Preallocation requires preliminary length
-- computation, for which a series of functions are introduced:
---------------------------------
-- Length evaluation utilities --
---------------------------------
function Basic_Exception_Info_Maxlength
(X : Exception_Occurrence) return Natural;
function Untailored_Exception_Traceback_Maxlength
(X : Exception_Occurrence) return Natural;
function Exception_Info_Maxlength
(X : Exception_Occurrence) return Natural;
function Exception_Name_Length
(Id : Exception_Id) return Natural;
function Exception_Name_Length
(X : Exception_Occurrence) return Natural;
function Exception_Message_Length
(X : Exception_Occurrence) return Natural;
--------------------------
-- Functional Interface --
--------------------------
function Untailored_Exception_Traceback
(X : Exception_Occurrence) return String;
-- Returns an image of the complete call chain associated with an
-- exception occurrence in its most basic form, that is as a raw sequence
-- of hexadecimal addresses.
function Tailored_Exception_Traceback
(X : Exception_Occurrence) return String;
-- Returns an image of the complete call chain associated with an
-- exception occurrence, either in its basic form if no decorator is
-- in place, or as formatted by the decorator otherwise.
-----------------------------------------------------------------------
-- Services for the default Last_Chance_Handler and the task wrapper --
-----------------------------------------------------------------------
pragma Export
(Ada, Append_Info_Exception_Message, "__gnat_append_info_e_msg");
pragma Export
(Ada, Append_Info_Untailored_Exception_Information,
"__gnat_append_info_u_e_info");
pragma Export
(Ada, Exception_Message_Length, "__gnat_exception_msg_len");
function Get_Executable_Load_Address return System.Address;
pragma Import (C, Get_Executable_Load_Address,
"__gnat_get_executable_load_address");
-- Get the load address of the executable, or Null_Address if not known
-------------------------
-- Append_Info_Address --
-------------------------
procedure Append_Info_Address
(A : Address;
Info : in out String;
Ptr : in out Natural)
is
S : String (1 .. 18);
P : Natural;
N : Integer_Address;
H : constant array (Integer range 0 .. 15) of Character :=
"0123456789abcdef";
begin
P := S'Last;
N := To_Integer (A);
loop
S (P) := H (Integer (N mod 16));
P := P - 1;
N := N / 16;
exit when N = 0;
end loop;
S (P - 1) := '0';
S (P) := 'x';
Append_Info_String (S (P - 1 .. S'Last), Info, Ptr);
end Append_Info_Address;
---------------------------------------------
-- Append_Info_Basic_Exception_Information --
---------------------------------------------
-- To ease the maximum length computation, we define and pull out some
-- string constants:
BEI_Name_Header : constant String := "raised ";
BEI_Msg_Header : constant String := " : ";
BEI_PID_Header : constant String := "PID: ";
procedure Append_Info_Basic_Exception_Information
(X : Exception_Occurrence;
Info : in out String;
Ptr : in out Natural)
is
Name : String (1 .. Exception_Name_Length (X));
-- Buffer in which to fetch the exception name, in order to check
-- whether this is an internal _ABORT_SIGNAL or a regular occurrence.
Name_Ptr : Natural := Name'First - 1;
begin
-- Output exception name and message except for _ABORT_SIGNAL, where
-- these two lines are omitted.
Append_Info_Exception_Name (X, Name, Name_Ptr);
if Name (Name'First) /= '_' then
Append_Info_String (BEI_Name_Header, Info, Ptr);
Append_Info_String (Name, Info, Ptr);
if Exception_Message_Length (X) /= 0 then
Append_Info_String (BEI_Msg_Header, Info, Ptr);
Append_Info_Exception_Message (X, Info, Ptr);
end if;
Append_Info_NL (Info, Ptr);
end if;
-- Output PID line if nonzero
if X.Pid /= 0 then
Append_Info_String (BEI_PID_Header, Info, Ptr);
Append_Info_Nat (X.Pid, Info, Ptr);
Append_Info_NL (Info, Ptr);
end if;
end Append_Info_Basic_Exception_Information;
---------------------------
-- Append_Info_Character --
---------------------------
procedure Append_Info_Character
(C : Character;
Info : in out String;
Ptr : in out Natural)
is
begin
if Info'Length = 0 then
To_Stderr (C);
elsif Ptr < Info'Last then
Ptr := Ptr + 1;
Info (Ptr) := C;
end if;
end Append_Info_Character;
-----------------------------------
-- Append_Info_Exception_Message --
-----------------------------------
procedure Append_Info_Exception_Message
(X : Exception_Occurrence;
Info : in out String;
Ptr : in out Natural)
is
begin
if X.Id = Null_Id then
raise Constraint_Error;
end if;
declare
Len : constant Natural := Exception_Message_Length (X);
Msg : constant String (1 .. Len) := X.Msg (1 .. Len);
begin
Append_Info_String (Msg, Info, Ptr);
end;
end Append_Info_Exception_Message;
--------------------------------
-- Append_Info_Exception_Name --
--------------------------------
procedure Append_Info_Exception_Name
(Id : Exception_Id;
Info : in out String;
Ptr : in out Natural)
is
begin
if Id = Null_Id then
raise Constraint_Error;
end if;
declare
Len : constant Natural := Exception_Name_Length (Id);
Name : constant String (1 .. Len) := To_Ptr (Id.Full_Name) (1 .. Len);
begin
Append_Info_String (Name, Info, Ptr);
end;
end Append_Info_Exception_Name;
procedure Append_Info_Exception_Name
(X : Exception_Occurrence;
Info : in out String;
Ptr : in out Natural)
is
begin
Append_Info_Exception_Name (X.Id, Info, Ptr);
end Append_Info_Exception_Name;
------------------------------
-- Exception_Info_Maxlength --
------------------------------
function Exception_Info_Maxlength
(X : Exception_Occurrence) return Natural
is
begin
return
Basic_Exception_Info_Maxlength (X)
+ Untailored_Exception_Traceback_Maxlength (X);
end Exception_Info_Maxlength;
---------------------
-- Append_Info_Nat --
---------------------
procedure Append_Info_Nat
(N : Natural;
Info : in out String;
Ptr : in out Natural)
is
begin
if N > 9 then
Append_Info_Nat (N / 10, Info, Ptr);
end if;
Append_Info_Character
(Character'Val (Character'Pos ('0') + N mod 10), Info, Ptr);
end Append_Info_Nat;
--------------------
-- Append_Info_NL --
--------------------
procedure Append_Info_NL
(Info : in out String;
Ptr : in out Natural)
is
begin
Append_Info_Character (ASCII.LF, Info, Ptr);
end Append_Info_NL;
------------------------
-- Append_Info_String --
------------------------
procedure Append_Info_String
(S : String;
Info : in out String;
Ptr : in out Natural)
is
begin
if Info'Length = 0 then
To_Stderr (S);
else
declare
Last : constant Natural :=
Integer'Min (Ptr + S'Length, Info'Last);
begin
Info (Ptr + 1 .. Last) := S;
Ptr := Last;
end;
end if;
end Append_Info_String;
--------------------------------------------------
-- Append_Info_Untailored_Exception_Information --
--------------------------------------------------
procedure Append_Info_Untailored_Exception_Information
(X : Exception_Occurrence;
Info : in out String;
Ptr : in out Natural)
is
begin
Append_Info_Basic_Exception_Information (X, Info, Ptr);
Append_Info_Untailored_Exception_Traceback (X, Info, Ptr);
end Append_Info_Untailored_Exception_Information;
------------------------------------------------
-- Append_Info_Untailored_Exception_Traceback --
------------------------------------------------
-- As for Basic_Exception_Information:
BETB_Header : constant String := "Call stack traceback locations:";
LDAD_Header : constant String := "Load address: ";
procedure Append_Info_Untailored_Exception_Traceback
(X : Exception_Occurrence;
Info : in out String;
Ptr : in out Natural)
is
Load_Address : Address;
begin
if X.Num_Tracebacks = 0 then
return;
end if;
-- The executable load address line
Load_Address := Get_Executable_Load_Address;
if Load_Address /= Null_Address then
Append_Info_String (LDAD_Header, Info, Ptr);
Append_Info_Address (Load_Address, Info, Ptr);
Append_Info_NL (Info, Ptr);
end if;
-- The traceback lines
Append_Info_String (BETB_Header, Info, Ptr);
Append_Info_NL (Info, Ptr);
for J in 1 .. X.Num_Tracebacks loop
Append_Info_Address (TBE.PC_For (X.Tracebacks (J)), Info, Ptr);
exit when J = X.Num_Tracebacks;
Append_Info_Character (' ', Info, Ptr);
end loop;
Append_Info_NL (Info, Ptr);
end Append_Info_Untailored_Exception_Traceback;
------------------------------------
-- Basic_Exception_Info_Maxlength --
------------------------------------
function Basic_Exception_Info_Maxlength
(X : Exception_Occurrence) return Natural
is
begin
return
BEI_Name_Header'Length + Exception_Name_Length (X)
+ BEI_Msg_Header'Length + Exception_Message_Length (X) + 1
+ BEI_PID_Header'Length + 15;
end Basic_Exception_Info_Maxlength;
---------------------------
-- Exception_Information --
---------------------------
function Exception_Information (X : Exception_Occurrence) return String is
-- The tailored exception information is the basic information
-- associated with the tailored call chain backtrace.
Tback_Info : constant String := Tailored_Exception_Traceback (X);
Tback_Len : constant Natural := Tback_Info'Length;
Info : String (1 .. Basic_Exception_Info_Maxlength (X) + Tback_Len);
Ptr : Natural := Info'First - 1;
begin
Append_Info_Basic_Exception_Information (X, Info, Ptr);
Append_Info_String (Tback_Info, Info, Ptr);
return Info (Info'First .. Ptr);
end Exception_Information;
------------------------------
-- Exception_Message_Length --
------------------------------
function Exception_Message_Length
(X : Exception_Occurrence) return Natural
is
begin
return X.Msg_Length;
end Exception_Message_Length;
---------------------------
-- Exception_Name_Length --
---------------------------
function Exception_Name_Length (Id : Exception_Id) return Natural is
begin
-- What is stored in the internal Name buffer includes a terminating
-- null character that we never care about.
return Id.Name_Length - 1;
end Exception_Name_Length;
function Exception_Name_Length (X : Exception_Occurrence) return Natural is
begin
return Exception_Name_Length (X.Id);
end Exception_Name_Length;
-------------------------------
-- Untailored_Exception_Traceback --
-------------------------------
function Untailored_Exception_Traceback
(X : Exception_Occurrence) return String
is
Info : aliased String
(1 .. Untailored_Exception_Traceback_Maxlength (X));
Ptr : Natural := Info'First - 1;
begin
Append_Info_Untailored_Exception_Traceback (X, Info, Ptr);
return Info (Info'First .. Ptr);
end Untailored_Exception_Traceback;
--------------------------------------
-- Untailored_Exception_Information --
--------------------------------------
function Untailored_Exception_Information
(X : Exception_Occurrence) return String
is
Info : String (1 .. Exception_Info_Maxlength (X));
Ptr : Natural := Info'First - 1;
begin
Append_Info_Untailored_Exception_Information (X, Info, Ptr);
return Info (Info'First .. Ptr);
end Untailored_Exception_Information;
-------------------------
-- Set_Exception_C_Msg --
-------------------------
procedure Set_Exception_C_Msg
(Excep : EOA;
Id : Exception_Id;
Msg1 : System.Address;
Line : Integer := 0;
Column : Integer := 0;
Msg2 : System.Address := System.Null_Address)
is
Remind : Integer;
Ptr : Natural;
procedure Append_Number (Number : Integer);
-- Append given number to Excep.Msg
-------------------
-- Append_Number --
-------------------
procedure Append_Number (Number : Integer) is
Val : Integer;
Size : Integer;
begin
if Number <= 0 then
return;
end if;
-- Compute the number of needed characters
Size := 1;
Val := Number;
while Val > 0 loop
Val := Val / 10;
Size := Size + 1;
end loop;
-- If enough characters are available, put the line number
if Excep.Msg_Length <= Exception_Msg_Max_Length - Size then
Excep.Msg (Excep.Msg_Length + 1) := ':';
Excep.Msg_Length := Excep.Msg_Length + Size;
Val := Number;
Size := 0;
while Val > 0 loop
Remind := Val rem 10;
Val := Val / 10;
Excep.Msg (Excep.Msg_Length - Size) :=
Character'Val (Remind + Character'Pos ('0'));
Size := Size + 1;
end loop;
end if;
end Append_Number;
-- Start of processing for Set_Exception_C_Msg
begin
Excep.Exception_Raised := False;
Excep.Id := Id;
Excep.Num_Tracebacks := 0;
Excep.Pid := Local_Partition_ID;
Excep.Msg_Length := 0;
while To_Ptr (Msg1) (Excep.Msg_Length + 1) /= ASCII.NUL
and then Excep.Msg_Length < Exception_Msg_Max_Length
loop
Excep.Msg_Length := Excep.Msg_Length + 1;
Excep.Msg (Excep.Msg_Length) := To_Ptr (Msg1) (Excep.Msg_Length);
end loop;
Append_Number (Line);
Append_Number (Column);
-- Append second message if present
if Msg2 /= System.Null_Address
and then Excep.Msg_Length + 1 < Exception_Msg_Max_Length
then
Excep.Msg_Length := Excep.Msg_Length + 1;
Excep.Msg (Excep.Msg_Length) := ' ';
Ptr := 1;
while To_Ptr (Msg2) (Ptr) /= ASCII.NUL
and then Excep.Msg_Length < Exception_Msg_Max_Length
loop
Excep.Msg_Length := Excep.Msg_Length + 1;
Excep.Msg (Excep.Msg_Length) := To_Ptr (Msg2) (Ptr);
Ptr := Ptr + 1;
end loop;
end if;
end Set_Exception_C_Msg;
-----------------------
-- Set_Exception_Msg --
-----------------------
procedure Set_Exception_Msg
(Excep : EOA;
Id : Exception_Id;
Message : String)
is
Len : constant Natural :=
Natural'Min (Message'Length, Exception_Msg_Max_Length);
First : constant Integer := Message'First;
begin
Excep.Exception_Raised := False;
Excep.Msg_Length := Len;
Excep.Msg (1 .. Len) := Message (First .. First + Len - 1);
Excep.Id := Id;
Excep.Num_Tracebacks := 0;
Excep.Pid := Local_Partition_ID;
end Set_Exception_Msg;
----------------------------------
-- Tailored_Exception_Traceback --
----------------------------------
function Tailored_Exception_Traceback
(X : Exception_Occurrence) return String
is
-- We reference the decorator *wrapper* here and not the decorator
-- itself. The purpose of the local variable Wrapper is to prevent a
-- potential race condition in the code below. The atomicity of this
-- assignment is enforced by pragma Atomic in System.Soft_Links.
-- The potential race condition here, if no local variable was used,
-- relates to the test upon the wrapper's value and the call, which
-- are not performed atomically. With the local variable, potential
-- changes of the wrapper's global value between the test and the
-- call become inoffensive.
Wrapper : constant Traceback_Decorator_Wrapper_Call :=
Traceback_Decorator_Wrapper;
begin
if Wrapper = null then
return Untailored_Exception_Traceback (X);
else
return Wrapper.all (X.Tracebacks'Address, X.Num_Tracebacks);
end if;
end Tailored_Exception_Traceback;
----------------------------------------------
-- Untailored_Exception_Traceback_Maxlength --
----------------------------------------------
function Untailored_Exception_Traceback_Maxlength
(X : Exception_Occurrence) return Natural
is
Space_Per_Address : constant := 2 + 16 + 1;
-- Space for "0x" + HHHHHHHHHHHHHHHH + " "
begin
return
LDAD_Header'Length + Space_Per_Address + BETB_Header'Length + 1 +
X.Num_Tracebacks * Space_Per_Address + 1;
end Untailored_Exception_Traceback_Maxlength;
end Exception_Data;
| 33.480537 | 79 | 0.54388 |
1049e2b4092f56acfa57739102ca0f431cf5e980 | 26,060 | adb | Ada | src/yaml/yaml-lexer-evaluation.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/yaml/yaml-lexer-evaluation.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/yaml/yaml-lexer-evaluation.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | -- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with Ada.Strings.UTF_Encoding.Strings;
with Ada.Strings.UTF_Encoding.Wide_Strings;
with Ada.Strings.UTF_Encoding.Wide_Wide_Strings;
with Text.Builder;
package body Yaml.Lexer.Evaluation is
-----------------------------------------------------------------------------
-- constant UTF-8 strings that may be generated from escape sequences
-----------------------------------------------------------------------------
function Next_Line return Ada.Strings.UTF_Encoding.UTF_8_String is
(Ada.Strings.UTF_Encoding.Strings.Encode ("" & Character'Val (16#85#)));
function Non_Breaking_Space return Ada.Strings.UTF_Encoding.UTF_8_String is
(Ada.Strings.UTF_Encoding.Strings.Encode ("" & Character'Val (16#A0#)));
function Line_Separator return Ada.Strings.UTF_Encoding.UTF_8_String is
(Ada.Strings.UTF_Encoding.Wide_Strings.Encode
("" & Wide_Character'Val (16#2028#)));
function Paragraph_Separator return Ada.Strings.UTF_Encoding.UTF_8_String is
(Ada.Strings.UTF_Encoding.Wide_Strings.Encode
("" & Wide_Character'Val (16#2029#)));
-----------------------------------------------------------------------------
-- implementation
-----------------------------------------------------------------------------
procedure Read_Plain_Scalar (L : in out Instance; T : out Token) is
Target : Text.Builder.Reference := Text.Builder.Create (L.Pool);
After_Newline_State : constant State_Type :=
(if L.Flow_Depth + L.Annotation_Depth = 0 then Line_Indentation'Access
else Flow_Line_Indentation'Access);
Line_Start_Pos : Positive;
begin
L.Seen_Multiline := False;
Start_Token (L);
if L.Proposed_Indentation /= -1 then
L.Indentation := L.Proposed_Indentation;
L.Proposed_Indentation := -1;
end if;
T := (Start_Pos => L.Token_Start_Mark, End_Pos => <>,
Kind => Plain_Scalar);
Multiline_Loop : loop
Line_Start_Pos := L.Pos - 1;
Inline_Loop : loop
L.Cur := Next (L);
case L.Cur is
when ' ' =>
T.End_Pos := Cur_Mark (L);
declare
Space_Start : constant Positive := L.Pos - 1;
begin
Space_Loop : loop
L.Cur := Next (L);
case L.Cur is
when Line_Feed | Carriage_Return =>
Target.Append
(L.Buffer (Line_Start_Pos .. Space_Start - 1));
exit Inline_Loop;
when End_Of_Input =>
Target.Append
(L.Buffer (Line_Start_Pos .. Space_Start - 1));
L.State := Stream_End'Access;
exit Multiline_Loop;
when '#' =>
Target.Append
(L.Buffer (Line_Start_Pos .. Space_Start - 1));
L.State := Expect_Line_End'Access;
exit Multiline_Loop;
when ':' =>
if not Next_Is_Plain_Safe (L) then
Target.Append
(L.Buffer (Line_Start_Pos .. Space_Start - 1));
L.State := Inside_Line'Access;
exit Multiline_Loop;
end if;
exit Space_Loop;
when Flow_Indicator =>
if L.Flow_Depth + L.Annotation_Depth > 0 then
Target.Append
(L.Buffer (Line_Start_Pos .. Space_Start - 1));
L.State := Inside_Line'Access;
exit Multiline_Loop;
end if;
exit Space_Loop;
when ')' =>
if L.Annotation_Depth > 0 then
Target.Append
(L.Buffer (Line_Start_Pos .. Space_Start - 1));
L.State := Inside_Line'Access;
exit Multiline_Loop;
end if;
exit Space_Loop;
when ' ' => null;
when others => exit Space_Loop;
end case;
end loop Space_Loop;
end;
when ':' =>
if not Next_Is_Plain_Safe (L) then
Target.Append
(L.Buffer (Line_Start_Pos .. L.Pos - 2));
T.End_Pos := Cur_Mark (L);
L.State := Inside_Line'Access;
exit Multiline_Loop;
end if;
when Flow_Indicator =>
if L.Flow_Depth + L.Annotation_Depth > 0 then
Target.Append
(L.Buffer (Line_Start_Pos .. L.Pos - 2));
T.End_Pos := Cur_Mark (L);
L.State := Inside_Line'Access;
exit Multiline_Loop;
end if;
when ')' =>
if L.Annotation_Depth > 0 then
Target.Append
(L.Buffer (Line_Start_Pos .. L.Pos - 2));
T.End_Pos := Cur_Mark (L);
L.State := Inside_Line'Access;
exit Multiline_Loop;
end if;
when Line_Feed | Carriage_Return =>
Target.Append
(L.Buffer (Line_Start_Pos .. L.Pos - 2));
T.End_Pos := Cur_Mark (L);
exit Inline_Loop;
when End_Of_Input =>
Target.Append
(L.Buffer (Line_Start_Pos .. L.Pos - 2));
if L.Pos /= L.Line_Start then
T.End_Pos := Cur_Mark (L);
end if;
L.State := Stream_End'Access;
exit Multiline_Loop;
when others => null;
end case;
end loop Inline_Loop;
End_Line (L);
declare
Newlines : Positive := 1;
begin
Newline_Loop : loop
case Start_Line (L) is
when Content =>
if L.Pos - L.Line_Start - 1 <= L.Indentation then
L.State := After_Newline_State;
exit Multiline_Loop;
end if;
exit Newline_Loop;
when Directives_End_Marker =>
L.State := Line_Dir_End'Access;
exit Multiline_Loop;
when Document_End_Marker =>
L.State := Line_Doc_End'Access;
exit Multiline_Loop;
when Stream_End =>
exit Multiline_Loop;
when Comment =>
End_Line (L);
L.State := Line_Start'Access;
exit Multiline_Loop;
when Newline =>
End_Line (L);
end case;
Newlines := Newlines + 1;
end loop Newline_Loop;
if
(L.Cur = ':' and then not Next_Is_Plain_Safe (L)) or else
L.Cur = '#' or else (L.Cur in Flow_Indicator and
L.Flow_Depth + L.Annotation_Depth > 0)
or else (L.Cur = ')' and L.Annotation_Depth > 0)
then
L.State := After_Newline_State;
exit Multiline_Loop;
end if;
L.Seen_Multiline := True;
if Newlines = 1 then
Target.Append (' ');
else
Target.Append ((1 .. Newlines - 1 => Line_Feed));
end if;
end;
end loop Multiline_Loop;
L.Value := Target.Lock;
end Read_Plain_Scalar;
procedure Process_Quoted_Whitespace (L : in out Instance; Init : Natural;
Target : in out Text.Builder.Reference);
procedure Process_Quoted_Whitespace (L : in out Instance; Init : Natural;
Target : in out Text.Builder.Reference) is
Newlines : Natural := Init;
First_Space : constant Positive := L.Pos - 1;
begin
loop
case L.Cur is
when ' ' => null;
when Line_Feed =>
Handle_LF (L);
L.Cur := L.Next;
exit;
when Carriage_Return =>
Handle_CR (L);
L.Cur := L.Next;
exit;
when others =>
Target.Append (L.Buffer (First_Space .. L.Pos - 2));
return;
end case;
L.Cur := Next (L);
end loop;
L.Seen_Multiline := True;
loop
case Start_Line (L) is
when Content | Comment => exit;
when Directives_End_Marker =>
raise Lexer_Error with "Illegal '---' within quoted scalar";
when Document_End_Marker =>
raise Lexer_Error with "Illegal '...' within quoted scalar";
when Newline => End_Line (L);
when Stream_End =>
raise Lexer_Error with
"Unexpected end of input (quoted string not closed)";
end case;
Newlines := Newlines + 1;
end loop;
if Newlines = 0 then
null;
elsif Newlines = 1 then
Target.Append (' ');
else
Target.Append ((1 .. Newlines - 1 => Line_Feed));
end if;
end Process_Quoted_Whitespace;
procedure Read_Single_Quoted_Scalar (L : in out Instance; T : out Token) is
Target : Text.Builder.Reference := Text.Builder.Create (L.Pool);
Literal_Start : Positive;
begin
L.Seen_Multiline := False;
Start_Token (L);
if L.Proposed_Indentation /= -1 then
L.Indentation := L.Proposed_Indentation;
L.Proposed_Indentation := -1;
end if;
Literal_Start := L.Pos;
L.Cur := Next (L);
loop
case L.Cur is
when End_Of_Input =>
raise Lexer_Error with
"Unexpected end of input (quoted string not closed)";
when ''' =>
Target.Append (L.Buffer (Literal_Start .. L.Pos - 2));
L.Cur := Next (L);
if L.Cur = ''' then
Target.Append (''');
Literal_Start := L.Pos;
L.Cur := Next (L);
else
exit;
end if;
when ' ' | Line_Feed | Carriage_Return =>
Target.Append (L.Buffer (Literal_Start .. L.Pos - 2));
Process_Quoted_Whitespace (L, 1, Target);
Literal_Start := L.Pos - 1;
when others =>
L.Cur := Next (L);
end case;
end loop;
T := (Start_Pos => L.Token_Start_Mark, End_Pos => Cur_Mark (L),
Kind => Single_Quoted_Scalar);
L.Value := Target.Lock;
end Read_Single_Quoted_Scalar;
subtype Hex_Code_Point is Natural range 0 .. 16#1FFFFF#;
procedure Read_Hex_Sequence (L : in out Instance; Length : Positive;
Target : in out Text.Builder.Reference);
procedure Read_Hex_Sequence (L : in out Instance; Length : Positive;
Target : in out Text.Builder.Reference) is
Char_Pos : Hex_Code_Point := 0;
Start_Pos : constant Positive := L.Pos;
begin
-- first, we make sure that this is a valid escape sequence. it is
-- important to not calculate its value directly because that may lead
-- to an overflow before we checked that the escape sequence is
-- syntactically correct. We only want to report that the value is out of
-- range if it is a valid escape sequence.
for I in 0 .. Length - 1 loop
if not (L.Buffer (Start_Pos + I) in Digit | 'a' .. 'f' | 'A' .. 'F')
then
raise Lexer_Error with
"Invalid character in hex escape sequence: " &
Escaped (L.Buffer (Start_Pos + I));
end if;
end loop;
for Exponent in reverse 0 .. Length - 1 loop
L.Cur := Next (L);
case L.Cur is
when Digit =>
Char_Pos := Char_Pos + (16 ** Exponent) *
(Character'Pos (L.Cur) - Character'Pos ('0'));
when 'a' .. 'f' =>
Char_Pos := Char_Pos + (16 ** Exponent) *
(Character'Pos (L.Cur) - Character'Pos ('a') + 10);
when 'A' .. 'F' =>
Char_Pos := Char_Pos + (16 ** Exponent) *
(Character'Pos (L.Cur) - Character'Pos ('A') + 10);
when others =>
null; -- cannot happen because of the check above
end case;
end loop;
Target.Append (Ada.Strings.UTF_Encoding.Wide_Wide_Strings.Encode (
"" & Wide_Wide_Character'Val (Char_Pos)));
exception
when Constraint_Error =>
raise Lexer_Error with
"Invalid hex escape sequence (value too large): " &
L.Buffer (Start_Pos .. Start_Pos + Length - 1);
end Read_Hex_Sequence;
procedure Read_Double_Quoted_Scalar (L : in out Instance; T : out Token) is
Target : Text.Builder.Reference := Text.Builder.Create (L.Pool);
Literal_Start : Positive;
begin
L.Seen_Multiline := False;
Start_Token (L);
if L.Proposed_Indentation /= -1 then
L.Indentation := L.Proposed_Indentation;
L.Proposed_Indentation := -1;
end if;
Literal_Start := L.Pos;
L.Cur := Next (L);
loop
<<Handle_Char>>
case L.Cur is
when End_Of_Input =>
raise Lexer_Error with
"Unexpected end of input (quoted string not closed)";
when '\' =>
Target.Append (L.Buffer (Literal_Start .. L.Pos - 2));
L.Cur := Next (L);
Literal_Start := L.Pos;
case L.Cur is
when '0' => Target.Append (Character'Val (0));
when 'a' => Target.Append (Character'Val (7));
when 'b' => Target.Append (Character'Val (8));
when 't' | Character'Val (9) =>
Target.Append (Character'Val (9));
when 'n' => Target.Append (Line_Feed);
when 'v' => Target.Append (Character'Val (11));
when 'f' => Target.Append (Character'Val (12));
when 'r' => Target.Append (Carriage_Return);
when 'e' => Target.Append (Character'Val (27));
when ' ' | '"' | '/' | '\' => Target.Append (L.Cur);
when 'N' => Target.Append (Next_Line);
when '_' => Target.Append (Non_Breaking_Space);
when 'L' => Target.Append (Line_Separator);
when 'P' => Target.Append (Paragraph_Separator);
when 'x' =>
Read_Hex_Sequence (L, 2, Target);
Literal_Start := L.Pos;
when 'u' =>
Read_Hex_Sequence (L, 4, Target);
Literal_Start := L.Pos;
when 'U' =>
Read_Hex_Sequence (L, 8, Target);
Literal_Start := L.Pos;
when Line_Feed | Carriage_Return =>
Process_Quoted_Whitespace (L, 0, Target);
Literal_Start := L.Pos - 1;
goto Handle_Char;
when others =>
raise Lexer_Error with
"Illegal character in escape sequence: " &
Escaped (L.Cur);
end case;
when '"' =>
Target.Append (L.Buffer (Literal_Start .. L.Pos - 2));
exit;
when ' ' | Line_Feed | Carriage_Return =>
Target.Append (L.Buffer (Literal_Start .. L.Pos - 2));
Process_Quoted_Whitespace (L, 1, Target);
Literal_Start := L.Pos - 1;
goto Handle_Char;
when others => null;
end case;
L.Cur := Next (L);
end loop;
L.Cur := Next (L);
T := (Start_Pos => L.Token_Start_Mark, End_Pos => Cur_Mark (L),
Kind => Double_Quoted_Scalar);
L.Value := Target.Lock;
end Read_Double_Quoted_Scalar;
procedure Read_Block_Scalar (L : in out Instance; T : out Token) is
type Chomp_Style is (Clip, Strip, Keep);
Chomp : Chomp_Style := Clip;
Indent : Natural := 0;
Separation_Lines : Natural := 0;
Content_Start : Positive;
Target : Text.Builder.Reference := Text.Builder.Create (L.Pool);
begin
Start_Token (L);
T := (Start_Pos => L.Token_Start_Mark, End_Pos => <>,
Kind => (if L.Cur = '>' then Folded_Scalar else Literal_Scalar));
-- header
loop
L.Cur := Next (L);
case L.Cur is
when '+' =>
if Chomp /= Clip then
raise Lexer_Error with "Multiple chomping indicators!";
end if;
Chomp := Keep;
when '-' =>
if Chomp /= Clip then
raise Lexer_Error with "Multiple chomping indicators!";
end if;
Chomp := Strip;
when '1' .. '9' =>
if Indent /= 0 then
raise Lexer_Error with "Multiple indentation indicators!";
end if;
Indent := Natural'Max (0, L.Indentation) +
Character'Pos (L.Cur) - Character'Pos ('0');
when ' ' =>
while L.Cur = ' ' loop
L.Cur := Next (L);
end loop;
if not (L.Cur in Comment_Or_Line_End) then
raise Lexer_Error with
"Illegal character after block scalar header: " &
Escaped (L.Cur);
end if;
exit;
when Line_End => exit;
when others =>
raise Lexer_Error with
"Illegal character in block scalar header: " & Escaped (L.Cur);
end case;
end loop;
End_Line (L);
-- determining indentation and leading empty lines
declare
Max_Leading_Spaces : Natural := 0;
begin
loop
if Indent = 0 then
while L.Cur = ' ' loop
L.Cur := Next (L);
end loop;
else
Max_Leading_Spaces := L.Line_Start + Indent;
while L.Cur = ' ' and L.Pos <= Max_Leading_Spaces loop
L.Cur := Next (L);
end loop;
end if;
case L.Cur is
when Line_Feed | Carriage_Return =>
T.End_Pos := Cur_Mark (L);
Max_Leading_Spaces :=
Natural'Max (Max_Leading_Spaces, L.Pos - 1 - L.Line_Start);
End_Line (L);
Separation_Lines := Separation_Lines + 1;
when End_Of_Input =>
L.State := Stream_End'Access;
goto End_Of_Input_Target;
when others =>
if Indent = 0 then
Indent := L.Pos - L.Line_Start - 1;
if Indent <= Indentation_Type'Max (0, L.Indentation) then
L.State := Line_Indentation'Access;
goto Finalize;
elsif Indent < Max_Leading_Spaces then
raise Lexer_Error with
"Leading all-spaces line contains too many spaces.";
end if;
elsif L.Pos - L.Line_Start - 1 < Indent then
goto Finalize;
end if;
exit;
end case;
end loop;
if Separation_Lines > 0 then
Target.Append ((1 .. Separation_Lines => Line_Feed));
end if;
end;
-- read block scalar content
Block_Content : loop
-- content of line
Content_Start := L.Pos - 1;
while not (L.Cur in Line_End) loop
L.Cur := Next (L);
end loop;
Target.Append (L.Buffer (Content_Start .. L.Pos - 2));
Separation_Lines := 0;
if L.Cur = End_Of_Input then
L.State := Stream_End'Access;
goto End_Of_Input_Target;
end if;
Separation_Lines := Separation_Lines + 1;
T.End_Pos := Cur_Mark (L);
End_Line (L);
-- empty lines and indentation of next line
loop
declare
Indent_Pos : constant Natural := L.Line_Start + Indent;
begin
while L.Cur = ' ' and L.Pos - 1 < Indent_Pos loop
L.Cur := Next (L);
end loop;
case L.Cur is
when Carriage_Return | Line_Feed =>
T.End_Pos := Cur_Mark (L);
Separation_Lines := Separation_Lines + 1;
End_Line (L);
when End_Of_Input =>
L.State := Stream_End'Access;
goto End_Of_Input_Target;
when others =>
if L.Pos - 1 < Indent_Pos then
exit Block_Content;
else
exit;
end if;
end case;
end;
end loop;
-- line folding
if T.Kind = Literal_Scalar then
Target.Append ((1 .. Separation_Lines => Line_Feed));
elsif Separation_Lines = 1 then
Target.Append (' ');
else
Target.Append ((1 .. Separation_Lines - 1 => Line_Feed));
end if;
end loop Block_Content;
if L.Pos - L.Line_Start - 1 > Indentation_Type'Max (0, L.Indentation) then
if L.Cur = '#' then
L.State := Expect_Line_End'Access;
else
raise Lexer_Error with
"This line at " & Escaped (L.Cur) & " is less indented than necessary."
& L.Cur_Line'Img;
end if;
elsif L.Pos = L.Line_Start + 1 then
L.State := Line_Start'Access;
else
L.State := Line_Indentation'Access;
end if;
<<Finalize>>
T.End_Pos := Cur_Mark (L);
goto Finish;
<<End_Of_Input_Target>>
-- if we encounter the stream end directly after a newline character,
-- we must have stored the T.End_Pos beforehand because we cannot
-- calculate it back (we do not know how long the recent line was).
if L.Pos /= L.Line_Start + 1 then
T.End_Pos := Cur_Mark (L);
-- the generated End_Pos is *after* the stream end char, which is one
-- too far; compensate here.
T.End_Pos.Index := T.End_Pos.Index - 1;
T.End_Pos.Column := T.End_Pos.Column - 1;
end if;
<<Finish>>
T.End_Pos := Cur_Mark (L);
-- handling trailing empty lines
case Chomp is
when Strip => null;
when Clip =>
if Target.Length > 0 then
Target.Append (Line_Feed);
end if;
when Keep => Target.Append ((1 .. Separation_Lines => Line_Feed));
end case;
L.Value := Target.Lock;
end Read_Block_Scalar;
procedure Read_URI (L : in out Instance; Restricted : Boolean) is
Target : Text.Builder.Reference := Text.Builder.Create (L.Pool);
End_With_Space : constant Boolean := L.Cur /= '<';
Literal_Start : Positive;
begin
if End_With_Space then
if (not Restricted) and L.Cur in '[' | ']' | ',' then
raise Lexer_Error with "Flow indicator cannot start tag prefix";
end if;
Literal_Start := L.Pos - 1;
else
Literal_Start := L.Pos;
L.Cur := Next (L);
end if;
loop
case L.Cur is
when Space_Or_Line_End =>
if End_With_Space then
Target.Append (L.Buffer (Literal_Start .. L.Pos - 2));
exit;
else
raise Lexer_Error with "Unclosed verbatim tag";
end if;
when '%' =>
Target.Append (L.Buffer (Literal_Start .. L.Pos - 2));
Read_Hex_Sequence (L, 2, Target);
Literal_Start := L.Pos;
when Tag_Char => null;
when '[' | ']' | ',' =>
if Restricted then
Target.Append (L.Buffer (Literal_Start .. L.Pos - 2));
exit;
end if;
when '!' =>
if Restricted then
raise Lexer_Error with "Illegal '!' in tag suffix!";
end if;
when '>' =>
if End_With_Space then
raise Lexer_Error with "Illegal character in URI: "">""";
else
Target.Append (L.Buffer (Literal_Start .. L.Pos - 2));
L.Cur := Next (L);
exit;
end if;
when others =>
raise Lexer_Error with "Illegal character in URI: " &
Escaped (L.Cur);
end case;
L.Cur := Next (L);
end loop;
L.Value := Target.Lock;
end Read_URI;
end Yaml.Lexer.Evaluation;
| 39.72561 | 85 | 0.473024 |
fb099db0a410e5eba70714f32027bc56b9867d9f | 5,411 | ads | Ada | src/sdl.ads | mosteo/sdlada | 429c594de613c5ba2f0d7c59f8708956697e14f1 | [
"Zlib"
] | 89 | 2015-01-03T01:41:23.000Z | 2022-02-23T18:21:11.000Z | src/sdl.ads | mosteo/sdlada | 429c594de613c5ba2f0d7c59f8708956697e14f1 | [
"Zlib"
] | 66 | 2015-05-01T00:54:03.000Z | 2022-01-20T04:09:59.000Z | src/sdl.ads | Jellix/sdlada | 997d2ae2da5c75e2ea99cee98372cf5b752519cf | [
"Zlib"
] | 33 | 2015-04-30T23:39:31.000Z | 2022-01-03T13:00:41.000Z | --------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, Luke A. Guest
--
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
--
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
--
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
-- SDL
--
-- Ada 2012 bindings to the SDL 2.x.y library.
--------------------------------------------------------------------------------------------------------------------
with Interfaces.C;
package SDL is
pragma Preelaborate;
package C renames Interfaces.C;
use type C.int;
type Init_Flags is mod 2 ** 32 with
Convention => C;
Null_Init_Flags : constant Init_Flags := 16#0000_0000#;
Enable_Timer : constant Init_Flags := 16#0000_0001#;
Enable_Audio : constant Init_Flags := 16#0000_0010#;
Enable_Screen : constant Init_Flags := 16#0000_0020#;
Enable_Joystick : constant Init_Flags := 16#0000_0200#;
Enable_Haptic : constant Init_Flags := 16#0000_1000#;
Enable_Game_Controller : constant Init_Flags := 16#0000_2000#;
Enable_Events : constant Init_Flags := 16#0000_4000#;
Enable_No_Parachute : constant Init_Flags := 16#0010_0000#;
Enable_Everything : constant Init_Flags :=
Enable_Timer or Enable_Audio or Enable_Screen or Enable_Joystick or Enable_Haptic or
Enable_Game_Controller or Enable_Events or Enable_No_Parachute;
-- Coordinates are for positioning things.
subtype Coordinate is C.int;
subtype Natural_Coordinate is Coordinate range 0 .. Coordinate'Last;
subtype Positive_Coordinate is Coordinate range 1 .. Coordinate'Last;
Centre_Coordinate : constant Coordinate := 0;
type Coordinates is
record
X : SDL.Coordinate;
Y : SDL.Coordinate;
end record with
Convention => C;
Zero_Coordinate : constant Coordinates := (others => 0);
subtype Natural_Coordinates is Coordinates with
Dynamic_Predicate =>
Natural_Coordinates.X >= Natural_Coordinate'First and Natural_Coordinates.Y >= Natural_Coordinate'First;
subtype Positive_Coordinates is Coordinates with
Dynamic_Predicate =>
Positive_Coordinates.X >= Positive_Coordinate'First and Positive_Coordinates.Y >= Positive_Coordinate'First;
-- Dimensions are for sizing things.
subtype Dimension is C.int;
subtype Natural_Dimension is Dimension range 0 .. Dimension'Last;
subtype Positive_Dimension is Dimension range 1 .. Dimension'Last;
type Sizes is
record
Width : Dimension;
Height : Dimension;
end record with
Convention => C;
Zero_Size : constant Sizes := (others => Natural_Dimension'First);
subtype Natural_Sizes is Sizes with
Dynamic_Predicate => Natural_Sizes.Width >= 0 and Natural_Sizes.Height >= 0;
subtype Positive_Sizes is Sizes with
Dynamic_Predicate => Positive_Sizes.Width >= 1 and Positive_Sizes.Height >= 1;
function "*" (Left : in Sizes; Scale : in Positive_Dimension) return Sizes is
(Sizes'(Width => Left.Width * Scale, Height => Left.Height * Scale));
function "/" (Left : in Sizes; Scale : in Positive_Dimension) return Sizes is
(Sizes'(Width => Left.Width / Scale, Height => Left.Height / Scale));
function Initialise (Flags : in Init_Flags := Enable_Everything) return Boolean;
procedure Finalise with
Import => True,
Convention => C,
External_Name => "SDL_Quit";
function Initialise_Sub_System (Flags : in Init_Flags) return Boolean;
procedure Finalise_Sub_System
(Flags : in Init_Flags) with
Import => True,
Convention => C,
External_Name => "SDL_QuitSubSystem";
-- Get which sub-systems were initialised.
function Was_Initialised return Init_Flags;
-- Check whether a set of sub-systems were initialised.
function Was_Initialised (Flags : in Init_Flags) return Boolean;
private
Success : constant Interfaces.C.int := 0;
type SDL_Bool is (SDL_False, SDL_True) with
Convention => C;
-- The next value is used in mapping the Ada types onto the C types, it is the word size used for all data
-- in SDL, i.e. all data is 4 byte aligned so it works with 32-bit architectures.
Word : constant := 4;
-- These constants are internal to the events system.
SDL_Query : constant C.int := -1;
SDL_Ignore : constant C.int := 0;
SDL_Disable : constant C.int := 0;
SDL_Enable : constant C.int := 1;
end SDL;
| 39.210145 | 116 | 0.650712 |
1ca121060360cb29461731ed50d129cd93e4b6fc | 7,982 | ads | Ada | src/drivers/adc_u2500/sam-adc.ads | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | 1 | 2020-02-24T23:19:03.000Z | 2020-02-24T23:19:03.000Z | src/drivers/adc_u2500/sam-adc.ads | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | null | null | null | src/drivers/adc_u2500/sam-adc.ads | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2019-2020, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with System;
with HAL;
private with SAM_SVD.ADC;
package SAM.ADC is
type ADC_Internal is private;
type ADC_Device
(Periph : not null access ADC_Internal)
is tagged private;
type Conversion_Resolution is (Res_12bit, Res_16bit, Res_10bit, Res_8bit);
type Reference_Kind is (Internal_Bandgap, Half_VDDANA, VDDANA,
External_A, External_B, External_C);
type Prescaler_Kind is (Pre_2, Pre_4, Pre_8, Pre_16,
Pre_32, Pre_64, Pre_128, Pre_256);
procedure Configure (This : in out ADC_Device;
Resolution : Conversion_Resolution;
Reference : Reference_Kind;
Prescaler : Prescaler_Kind;
Free_Running : Boolean;
Differential_Mode : Boolean;
Window_Monitor_Event_Out : Boolean := False;
Result_Ready_Event_Out : Boolean := False;
Start_Conversion_Event_Invert : Boolean := False;
Flush_Event_Invert : Boolean := False;
Start_Conversion_Event_Input : Boolean := False;
Flush_Event_Input : Boolean := False);
procedure Enable (This : in out ADC_Device);
-- Enable the ADC channel
procedure Disable (This : in out ADC_Device);
-- Disable the ADC channel
type Negative_Selection is (AIN0, AIN1, AIN2, AIN3, AIN4, AIN5, AIN6, AIN7,
GND);
type Positive_Selection is (AIN0, AIN1, AIN2, AIN3, AIN4, AIN5, AIN6, AIN7,
AIN8, AIN9, AIN10, AIN11, AIN12, AIN13, AIN14,
AIN15, AIN16, AIN17, AIN18, AIN19, AIN20, AIN21,
AIN22, AIN23,
SCALEDCOREVCC, SCALEDVBAT, SCALEDIOVCC,
BANDGAP, PTAT, CTAT, DAC);
procedure Set_Inputs (This : in out ADC_Device;
Negative : Negative_Selection;
Positive : Positive_Selection);
-- Set the negative and positive inputs for the conversion
procedure Software_Start (This : in out ADC_Device);
-- Start a conversion
function Conversion_Done (This : in out ADC_Device) return Boolean;
-- Return True if the conversion is done
function Result (This : in out ADC_Device) return HAL.UInt16;
-- Return the result of a conversion
-- DMA --
function Result_Address (This : ADC_Device) return System.Address;
-- Return the address of the result register for DMA transfers
private
type ADC_Internal is new SAM_SVD.ADC.ADC_Peripheral;
type ADC_Device
(Periph : not null access ADC_Internal)
is tagged null record;
for Conversion_Resolution use (Res_12bit => 0,
Res_16bit => 1,
Res_10bit => 2,
Res_8bit => 3);
for Reference_Kind use (Internal_Bandgap => 0,
Half_VDDANA => 2,
VDDANA => 3,
External_A => 4,
External_B => 5,
External_C => 6);
for Negative_Selection use (AIN0 => 16#00#,
AIN1 => 16#01#,
AIN2 => 16#02#,
AIN3 => 16#03#,
AIN4 => 16#04#,
AIN5 => 16#05#,
AIN6 => 16#06#,
AIN7 => 16#07#,
GND => 16#18#);
for Positive_Selection use (AIN0 => 16#00#,
AIN1 => 16#01#,
AIN2 => 16#02#,
AIN3 => 16#03#,
AIN4 => 16#04#,
AIN5 => 16#05#,
AIN6 => 16#06#,
AIN7 => 16#07#,
AIN8 => 16#08#,
AIN9 => 16#09#,
AIN10 => 16#0A#,
AIN11 => 16#0B#,
AIN12 => 16#0C#,
AIN13 => 16#0D#,
AIN14 => 16#0E#,
AIN15 => 16#0F#,
AIN16 => 16#10#,
AIN17 => 16#11#,
AIN18 => 16#12#,
AIN19 => 16#13#,
AIN20 => 16#14#,
AIN21 => 16#15#,
AIN22 => 16#16#,
AIN23 => 16#17#,
SCALEDCOREVCC => 16#18#,
SCALEDVBAT => 16#19#,
SCALEDIOVCC => 16#1A#,
BANDGAP => 16#1B#,
PTAT => 16#1C#,
CTAT => 16#1D#,
DAC => 16#1E#);
end SAM.ADC;
| 48.969325 | 79 | 0.427712 |
230c811e3be7db844b2702031fc5274c270ee080 | 535 | ads | Ada | src/ascon128av12.ads | jhumphry/Ascon_SPARK | 3ec888b0f62f7c3afa9c76643551d46703d4a112 | [
"0BSD"
] | 1 | 2020-10-14T08:43:14.000Z | 2020-10-14T08:43:14.000Z | src/ascon128av12.ads | jhumphry/Ascon_SPARK | 3ec888b0f62f7c3afa9c76643551d46703d4a112 | [
"0BSD"
] | null | null | null | src/ascon128av12.ads | jhumphry/Ascon_SPARK | 3ec888b0f62f7c3afa9c76643551d46703d4a112 | [
"0BSD"
] | null | null | null | -- Ascon128av12
-- an instantiation of the Ascon-128a (v 1.2) variant of the Ascon Authenticated
-- Encryption Algorithm created by Christoph Dobraunig, Maria Eichlseder,
-- Florian Mendel and Martin Schläffer.
-- Copyright (c) 2018, James Humphry - see LICENSE file for details
pragma SPARK_Mode(On);
with Ascon;
package Ascon128av12 is new Ascon(a_rounds => 12,
b_rounds => 8,
b_round_constants_offset => 4,
rate => 128);
| 31.470588 | 80 | 0.603738 |
fbc5b1f1ad56ba535b4ace05dd5470cda22733dd | 503 | ads | Ada | ADL/drivers/stm32g474/stm32-cordic-polling.ads | JCGobbi/Nucleo-STM32G474RE | 8dc1c4948ffeb11841eed10f1c3708f00fa1d832 | [
"BSD-3-Clause"
] | null | null | null | ADL/drivers/stm32g474/stm32-cordic-polling.ads | JCGobbi/Nucleo-STM32G474RE | 8dc1c4948ffeb11841eed10f1c3708f00fa1d832 | [
"BSD-3-Clause"
] | null | null | null | ADL/drivers/stm32g474/stm32-cordic-polling.ads | JCGobbi/Nucleo-STM32G474RE | 8dc1c4948ffeb11841eed10f1c3708f00fa1d832 | [
"BSD-3-Clause"
] | null | null | null | package STM32.CORDIC.Polling is
procedure Calculate_CORDIC_Function
(This : in out CORDIC_Coprocessor;
Argument : UInt32_Array;
Result : out UInt32_Array);
-- Polls the CORDIC directly to get the calculated funtion result.
procedure Calculate_CORDIC_Function
(This : in out CORDIC_Coprocessor;
Argument : UInt16_Array;
Result : out UInt16_Array);
-- Polls the CORDIC directly to get the calculated funtion result.
end STM32.CORDIC.Polling;
| 31.4375 | 70 | 0.71173 |
10e3d850f97adc21d0a4345577881e8820506907 | 2,869 | ads | Ada | ADL/hal/hal-time.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | 3 | 2020-10-21T09:05:41.000Z | 2022-02-10T19:57:32.000Z | ADL/hal/hal-time.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ADL/hal/hal-time.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package HAL.Time is
pragma Preelaborate;
type Delays is limited interface;
type Any_Delays is access all Delays'Class;
procedure Delay_Microseconds (This : in out Delays;
Us : Integer) is abstract;
procedure Delay_Milliseconds (This : in out Delays;
Ms : Integer) is abstract;
procedure Delay_Seconds (This : in out Delays;
S : Integer) is abstract;
end HAL.Time;
| 59.770833 | 78 | 0.515859 |
1c307e502bb925b83e7ff68c61d589797409a771 | 19,198 | ads | Ada | source/amf/uml/amf-internals-uml_value_specification_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-internals-uml_value_specification_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-internals-uml_value_specification_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Named_Elements;
with AMF.UML.Activities;
with AMF.UML.Activity_Edges.Collections;
with AMF.UML.Activity_Groups.Collections;
with AMF.UML.Activity_Nodes.Collections;
with AMF.UML.Activity_Partitions.Collections;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Exception_Handlers.Collections;
with AMF.UML.Input_Pins.Collections;
with AMF.UML.Interruptible_Activity_Regions.Collections;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces;
with AMF.UML.Output_Pins.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Structured_Activity_Nodes;
with AMF.UML.Value_Specification_Actions;
with AMF.UML.Value_Specifications;
with AMF.Visitors;
package AMF.Internals.UML_Value_Specification_Actions is
type UML_Value_Specification_Action_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Value_Specification_Actions.UML_Value_Specification_Action with null record;
overriding function Get_Result
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Output_Pins.UML_Output_Pin_Access;
-- Getter of ValueSpecificationAction::result.
--
-- Gives the output pin on which the result is put.
overriding procedure Set_Result
(Self : not null access UML_Value_Specification_Action_Proxy;
To : AMF.UML.Output_Pins.UML_Output_Pin_Access);
-- Setter of ValueSpecificationAction::result.
--
-- Gives the output pin on which the result is put.
overriding function Get_Value
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Value_Specifications.UML_Value_Specification_Access;
-- Getter of ValueSpecificationAction::value.
--
-- Value specification to be evaluated.
overriding procedure Set_Value
(Self : not null access UML_Value_Specification_Action_Proxy;
To : AMF.UML.Value_Specifications.UML_Value_Specification_Access);
-- Setter of ValueSpecificationAction::value.
--
-- Value specification to be evaluated.
overriding function Get_Context
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access;
-- Getter of Action::context.
--
-- The classifier that owns the behavior of which this action is a part.
overriding function Get_Input
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Input_Pins.Collections.Ordered_Set_Of_UML_Input_Pin;
-- Getter of Action::input.
--
-- The ordered set of input pins connected to the Action. These are among
-- the total set of inputs.
overriding function Get_Is_Locally_Reentrant
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return Boolean;
-- Getter of Action::isLocallyReentrant.
--
-- If true, the action can begin a new, concurrent execution, even if
-- there is already another execution of the action ongoing. If false, the
-- action cannot begin a new execution until any previous execution has
-- completed.
overriding procedure Set_Is_Locally_Reentrant
(Self : not null access UML_Value_Specification_Action_Proxy;
To : Boolean);
-- Setter of Action::isLocallyReentrant.
--
-- If true, the action can begin a new, concurrent execution, even if
-- there is already another execution of the action ongoing. If false, the
-- action cannot begin a new execution until any previous execution has
-- completed.
overriding function Get_Local_Postcondition
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Action::localPostcondition.
--
-- Constraint that must be satisfied when executed is completed.
overriding function Get_Local_Precondition
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Action::localPrecondition.
--
-- Constraint that must be satisfied when execution is started.
overriding function Get_Output
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Output_Pins.Collections.Ordered_Set_Of_UML_Output_Pin;
-- Getter of Action::output.
--
-- The ordered set of output pins connected to the Action. The action
-- places its results onto pins in this set.
overriding function Get_Handler
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Exception_Handlers.Collections.Set_Of_UML_Exception_Handler;
-- Getter of ExecutableNode::handler.
--
-- A set of exception handlers that are examined if an uncaught exception
-- propagates to the outer level of the executable node.
overriding function Get_Activity
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Activities.UML_Activity_Access;
-- Getter of ActivityNode::activity.
--
-- Activity containing the node.
overriding procedure Set_Activity
(Self : not null access UML_Value_Specification_Action_Proxy;
To : AMF.UML.Activities.UML_Activity_Access);
-- Setter of ActivityNode::activity.
--
-- Activity containing the node.
overriding function Get_In_Group
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Activity_Groups.Collections.Set_Of_UML_Activity_Group;
-- Getter of ActivityNode::inGroup.
--
-- Groups containing the node.
overriding function Get_In_Interruptible_Region
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Interruptible_Activity_Regions.Collections.Set_Of_UML_Interruptible_Activity_Region;
-- Getter of ActivityNode::inInterruptibleRegion.
--
-- Interruptible regions containing the node.
overriding function Get_In_Partition
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Activity_Partitions.Collections.Set_Of_UML_Activity_Partition;
-- Getter of ActivityNode::inPartition.
--
-- Partitions containing the node.
overriding function Get_In_Structured_Node
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access;
-- Getter of ActivityNode::inStructuredNode.
--
-- Structured activity node containing the node.
overriding procedure Set_In_Structured_Node
(Self : not null access UML_Value_Specification_Action_Proxy;
To : AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access);
-- Setter of ActivityNode::inStructuredNode.
--
-- Structured activity node containing the node.
overriding function Get_Incoming
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge;
-- Getter of ActivityNode::incoming.
--
-- Edges that have the node as target.
overriding function Get_Outgoing
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge;
-- Getter of ActivityNode::outgoing.
--
-- Edges that have the node as source.
overriding function Get_Redefined_Node
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Activity_Nodes.Collections.Set_Of_UML_Activity_Node;
-- Getter of ActivityNode::redefinedNode.
--
-- Inherited nodes replaced by this node in a specialization of the
-- activity.
overriding function Get_Is_Leaf
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return Boolean;
-- Getter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding procedure Set_Is_Leaf
(Self : not null access UML_Value_Specification_Action_Proxy;
To : Boolean);
-- Setter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding function Get_Redefined_Element
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element;
-- Getter of RedefinableElement::redefinedElement.
--
-- The redefinable element that is being redefined by this element.
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of RedefinableElement::redefinitionContext.
--
-- References the contexts that this element may be redefined from.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Value_Specification_Action_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Context
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access;
-- Operation Action::context.
--
-- Missing derivation for Action::/context : Classifier
overriding function Is_Consistent_With
(Self : not null access constant UML_Value_Specification_Action_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isConsistentWith.
--
-- The query isConsistentWith() specifies, for any two RedefinableElements
-- in a context in which redefinition is possible, whether redefinition
-- would be logically consistent. By default, this is false; this
-- operation must be overridden for subclasses of RedefinableElement to
-- define the consistency conditions.
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Value_Specification_Action_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of this RedefinableElement are properly related
-- to the redefinition contexts of the specified RedefinableElement to
-- allow this element to redefine the other. By default at least one of
-- the redefinition contexts of this element must be a specialization of
-- at least one of the redefinition contexts of the specified element.
overriding function All_Owning_Packages
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Value_Specification_Action_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Value_Specification_Action_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding procedure Enter_Element
(Self : not null access constant UML_Value_Specification_Action_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Value_Specification_Action_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Value_Specification_Action_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Value_Specification_Actions;
| 48.236181 | 106 | 0.698979 |
1cde9ad50fdb1192f50331a8bd55e5644ec28e96 | 912 | ads | Ada | boards/native/config_src/adl_config.ads | Kidev/Ada_Drivers_Library | da434883bc217ddecb8f61686d301d24cb1df17d | [
"BSD-3-Clause"
] | null | null | null | boards/native/config_src/adl_config.ads | Kidev/Ada_Drivers_Library | da434883bc217ddecb8f61686d301d24cb1df17d | [
"BSD-3-Clause"
] | null | null | null | boards/native/config_src/adl_config.ads | Kidev/Ada_Drivers_Library | da434883bc217ddecb8f61686d301d24cb1df17d | [
"BSD-3-Clause"
] | null | null | null | -- This package was generated by the Ada_Drivers_Library project wizard script
package ADL_Config is
Max_Mount_Points : constant := 2; -- From default value
Max_Mount_Name_Length : constant := 128; -- From default value
Has_Ravenscar_Full_Runtime : constant String := "False"; -- From default value
Board : constant String := "Native"; -- From command line
Has_ZFP_Runtime : constant String := "False"; -- From default value
Has_Ravenscar_SFP_Runtime : constant String := "False"; -- From default value
Max_Path_Length : constant := 1024; -- From default value
Architecture : constant String := "Native"; -- From board definition
end ADL_Config;
| 76 | 101 | 0.539474 |
df8c51fb3d45c163d637bbd9533a00eaea453ca7 | 4,785 | adb | Ada | bb-runtimes/src/s-textio__stm32f4.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/s-textio__stm32f4.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/s-textio__stm32f4.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . T E X T _ I O --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Minimal version of Text_IO body for use on STM32F4xxx, using USART1
with Interfaces; use Interfaces;
with Interfaces.STM32; use Interfaces.STM32;
with Interfaces.STM32.RCC; use Interfaces.STM32.RCC;
with Interfaces.STM32.GPIO; use Interfaces.STM32.GPIO;
with Interfaces.STM32.USART; use Interfaces.STM32.USART;
with System.STM32; use System.STM32;
with System.BB.Parameters;
package body System.Text_IO is
Baudrate : constant := 115_200;
-- Bitrate to use
----------------
-- Initialize --
----------------
procedure Initialize is
use System.BB.Parameters;
APB_Clock : constant Positive := Positive (STM32.System_Clocks.PCLK2);
Int_Divider : constant Positive := (25 * APB_Clock) / (4 * Baudrate);
Frac_Divider : constant Natural := Int_Divider rem 100;
begin
Initialized := True;
RCC_Periph.APB2ENR.USART1EN := 1;
RCC_Periph.AHB1ENR.GPIOBEN := 1;
GPIOB_Periph.MODER.Arr (6 .. 7) := (Mode_AF, Mode_AF);
GPIOB_Periph.OSPEEDR.Arr (6 .. 7) := (Speed_50MHz, Speed_50MHz);
GPIOB_Periph.OTYPER.OT.Arr (6 .. 7) := (Push_Pull, Push_Pull);
GPIOB_Periph.PUPDR.Arr (6 .. 7) := (Pull_Up, Pull_Up);
GPIOB_Periph.AFRL.Arr (6 .. 7) := (AF_USART1, AF_USART1);
USART1_Periph.BRR :=
(DIV_Fraction => UInt4 (((Frac_Divider * 16 + 50) / 100) mod 16),
DIV_Mantissa => UInt12 (Int_Divider / 100),
others => <>);
USART1_Periph.CR1 :=
(UE => 1,
RE => 1,
TE => 1,
others => <>);
USART1_Periph.CR2 := (others => <>);
USART1_Periph.CR3 := (others => <>);
end Initialize;
-----------------
-- Is_Tx_Ready --
-----------------
function Is_Tx_Ready return Boolean is
(USART1_Periph.SR.TC = 1);
-----------------
-- Is_Rx_Ready --
-----------------
function Is_Rx_Ready return Boolean is
(USART1_Periph.SR.RXNE = 1);
---------
-- Get --
---------
function Get return Character is (Character'Val (USART1_Periph.DR.DR));
---------
-- Put --
---------
procedure Put (C : Character) is
begin
USART1_Periph.DR.DR := Character'Pos (C);
end Put;
----------------------------
-- Use_Cr_Lf_For_New_Line --
----------------------------
function Use_Cr_Lf_For_New_Line return Boolean is (True);
end System.Text_IO;
| 40.210084 | 79 | 0.465413 |
10483791b86d50674698e6b3b4d69c9b6dbcd4a1 | 2,476 | ads | Ada | tools/xml2ayacc/encoding/auto/encodings-maps-cp_862.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | 4 | 2016-02-05T15:51:56.000Z | 2022-03-25T20:38:32.000Z | tools/xml2ayacc/encoding/auto/encodings-maps-cp_862.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | tools/xml2ayacc/encoding/auto/encodings-maps-cp_862.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | -- Auto generated file. Don't edit
-- Read copyright and license at the end of this file
package Encodings.Maps.CP_862 is
function Decode (Char : Character) return Wide_Character;
pragma Inline (Decode);
procedure Encode
(Text : in Wide_String;
Text_Last : out Natural;
Result : out Raw_String;
Result_Last : out Natural;
Map : in Encoding := Encodings.CP_862);
procedure Decode
(Text : in Raw_String;
Text_Last : out Natural;
Result : out Wide_String;
Result_Last : out Natural;
Map : in Encoding := Encodings.CP_862);
end Encodings.Maps.CP_862;
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
| 45.851852 | 79 | 0.657916 |
5040f486ef166dd2bf6dfecd12f50bbf4764bf1b | 2,590 | ads | Ada | arch/ARM/STM32/driversL1/stm32-i2c.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/driversL1/stm32-i2c.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/driversL1/stm32-i2c.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This file provides definitions for the STM32F7 (ARM Cortex M7F
-- from ST Microelectronics) Inter-Integrated Circuit (I2C) facility.
private with STM32_SVD.I2C;
with HAL.I2C;
package STM32.I2C is
end STM32.I2C;
| 63.170732 | 78 | 0.526255 |
0e9b876c04640f1b66f377f3ec64a1b7641cb07e | 3,739 | adb | Ada | src/util-concurrent-pools.adb | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | src/util-concurrent-pools.adb | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | src/util-concurrent-pools.adb | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- Util.Concurrent.Pools -- Concurrent Pools
-- Copyright (C) 2011, 2014 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
package body Util.Concurrent.Pools is
-- ------------------------------
-- Get an element instance from the pool.
-- Wait until one instance gets available.
-- ------------------------------
procedure Get_Instance (From : in out Pool;
Item : out Element_Type) is
begin
From.List.Get_Instance (Item);
end Get_Instance;
-- ------------------------------
-- Put the element back to the pool.
-- ------------------------------
procedure Release (Into : in out Pool;
Item : in Element_Type) is
begin
Into.List.Release (Item);
end Release;
-- ------------------------------
-- Set the pool size.
-- ------------------------------
procedure Set_Size (Into : in out Pool;
Capacity : in Positive) is
begin
Into.List.Set_Size (Capacity);
end Set_Size;
-- ------------------------------
-- Release the pool elements.
-- ------------------------------
overriding
procedure Finalize (Object : in out Pool) is
begin
Object.List.Set_Size (0);
end Finalize;
-- Pool of objects
protected body Protected_Pool is
-- ------------------------------
-- Get an element instance from the pool.
-- Wait until one instance gets available.
-- ------------------------------
entry Get_Instance (Item : out Element_Type) when Available > 0 is
begin
Item := Elements (Available);
Available := Available - 1;
end Get_Instance;
-- ------------------------------
-- Put the element back to the pool.
-- ------------------------------
procedure Release (Item : in Element_Type) is
begin
Available := Available + 1;
Elements (Available) := Item;
end Release;
-- ------------------------------
-- Set the pool size.
-- ------------------------------
procedure Set_Size (Capacity : in Natural) is
procedure Free is new Ada.Unchecked_Deallocation (Element_Array, Element_Array_Access);
begin
if Capacity = 0 then
Free (Elements);
elsif Elements = null then
Elements := new Element_Array (1 .. Capacity);
else
declare
New_Array : constant Element_Array_Access := new Element_Array (1 .. Capacity);
begin
if Capacity > Elements'Size then
New_Array (1 .. Elements'Last) := Elements (1 .. Elements'Last);
else
New_Array (1 .. Capacity) := Elements (1 .. Capacity);
end if;
Free (Elements);
Elements := New_Array;
end;
end if;
end Set_Size;
end Protected_Pool;
end Util.Concurrent.Pools;
| 33.990909 | 96 | 0.505483 |
fbf9db713a32e4c33b21756aec287a91402d492f | 3,851 | ads | Ada | dcf/src/dcf-zip-compress.ads | onox/dcf-ada | 47891e7789d3aa53d8f6632284cdf63dbd2ec7dd | [
"MIT"
] | 5 | 2019-05-31T00:00:15.000Z | 2022-02-11T23:11:54.000Z | dcf/src/dcf-zip-compress.ads | onox/dcf-ada | 47891e7789d3aa53d8f6632284cdf63dbd2ec7dd | [
"MIT"
] | null | null | null | dcf/src/dcf-zip-compress.ads | onox/dcf-ada | 47891e7789d3aa53d8f6632284cdf63dbd2ec7dd | [
"MIT"
] | null | null | null | -- SPDX-License-Identifier: MIT
--
-- Copyright (c) 2007 - 2018 Gautier de Montmollin (Maintainer of the Ada version)
-- SWITZERLAND
--
-- 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.
-- Zip.Compress
-- ------------
--
-- This package facilitates the storage or compression of data.
--
-- Note that unlike decompression where the decoding is unique,
-- there is a quasi indefinite number of ways of compressing data into
-- most Zip-supported formats, including LZW (Shrink), Reduce, Deflate, or LZMA.
-- As a result, you may want to use your own way for compressing data.
-- This package is a portable one and doesn't claim to be the "best".
-- The term "best" is relative to the needs, since there are at least
-- two criteria that usually go in opposite directions: speed and
-- compression ratio, a bit like risk and return in finance.
with DCF.Streams;
package DCF.Zip.Compress is
pragma Preelaborate;
-- Compression_Method is actually reflecting the way of compressing
-- data, not only the final compression format called "method" in
-- Zip specifications.
type Compression_Method is
-- No compression:
(Store,
-- Deflate combines LZ and Huffman encoding; 4 strengths available:
Deflate_Fixed, Deflate_1, Deflate_2, Deflate_3);
type Method_To_Format_Type is array (Compression_Method) of Pkzip_Method;
Method_To_Format : constant Method_To_Format_Type;
-- Deflate_Fixed compresses the data into a single block and with predefined
-- ("fixed") compression structures. The data are basically LZ-compressed
-- only, since the Huffman code sets are flat and not tailored for the data.
subtype Deflation_Method is Compression_Method range Deflate_Fixed .. Deflate_3;
-- The multi-block Deflate methods use refined techniques to decide when to
-- start a new block and what sort of block to put next.
subtype Taillaule_Deflation_Method is Compression_Method range Deflate_1 .. Deflate_3;
User_Abort : exception;
-- Compress data from an input stream to an output stream until
-- End_Of_File(input) = True, or number of input bytes = input_size.
-- If password /= "", an encryption header is written.
procedure Compress_Data
(Input, Output : in out DCF.Streams.Root_Zipstream_Type'Class;
Input_Size : File_Size_Type;
Method : Compression_Method;
Feedback : Feedback_Proc;
CRC : out Unsigned_32;
Output_Size : out File_Size_Type;
Zip_Type : out Unsigned_16);
-- ^ code corresponding to the compression method actually used
private
Method_To_Format : constant Method_To_Format_Type :=
(Store => Store, Deflation_Method => Deflate);
end DCF.Zip.Compress;
| 44.264368 | 89 | 0.719294 |
fb406745c0ee10c7680575eb17594df452ce205a | 3,341 | adb | Ada | src/fltk-widgets-valuators-sliders-value-horizontal.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | 1 | 2020-12-18T15:20:13.000Z | 2020-12-18T15:20:13.000Z | src/fltk-widgets-valuators-sliders-value-horizontal.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null | src/fltk-widgets-valuators-sliders-value-horizontal.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null |
with
Interfaces.C.Strings,
System;
use type
System.Address;
package body FLTK.Widgets.Valuators.Sliders.Value.Horizontal is
procedure hor_value_slider_set_draw_hook
(W, D : in System.Address);
pragma Import (C, hor_value_slider_set_draw_hook, "hor_value_slider_set_draw_hook");
pragma Inline (hor_value_slider_set_draw_hook);
procedure hor_value_slider_set_handle_hook
(W, H : in System.Address);
pragma Import (C, hor_value_slider_set_handle_hook, "hor_value_slider_set_handle_hook");
pragma Inline (hor_value_slider_set_handle_hook);
function new_fl_hor_value_slider
(X, Y, W, H : in Interfaces.C.int;
Text : in Interfaces.C.char_array)
return System.Address;
pragma Import (C, new_fl_hor_value_slider, "new_fl_hor_value_slider");
pragma Inline (new_fl_hor_value_slider);
procedure free_fl_hor_value_slider
(D : in System.Address);
pragma Import (C, free_fl_hor_value_slider, "free_fl_hor_value_slider");
pragma Inline (free_fl_hor_value_slider);
procedure fl_hor_value_slider_draw
(W : in System.Address);
pragma Import (C, fl_hor_value_slider_draw, "fl_hor_value_slider_draw");
pragma Inline (fl_hor_value_slider_draw);
function fl_hor_value_slider_handle
(W : in System.Address;
E : in Interfaces.C.int)
return Interfaces.C.int;
pragma Import (C, fl_hor_value_slider_handle, "fl_hor_value_slider_handle");
pragma Inline (fl_hor_value_slider_handle);
procedure Finalize
(This : in out Hor_Value_Slider) is
begin
if This.Void_Ptr /= System.Null_Address and then
This in Hor_Value_Slider'Class
then
free_fl_hor_value_slider (This.Void_Ptr);
This.Void_Ptr := System.Null_Address;
end if;
Finalize (Value_Slider (This));
end Finalize;
package body Forge is
function Create
(X, Y, W, H : in Integer;
Text : in String)
return Hor_Value_Slider is
begin
return This : Hor_Value_Slider do
This.Void_Ptr := new_fl_hor_value_slider
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.To_C (Text));
fl_widget_set_user_data
(This.Void_Ptr,
Widget_Convert.To_Address (This'Unchecked_Access));
hor_value_slider_set_draw_hook (This.Void_Ptr, Draw_Hook'Address);
hor_value_slider_set_handle_hook (This.Void_Ptr, Handle_Hook'Address);
end return;
end Create;
end Forge;
procedure Draw
(This : in out Hor_Value_Slider) is
begin
fl_hor_value_slider_draw (This.Void_Ptr);
end Draw;
function Handle
(This : in out Hor_Value_Slider;
Event : in Event_Kind)
return Event_Outcome is
begin
return Event_Outcome'Val
(fl_hor_value_slider_handle (This.Void_Ptr, Event_Kind'Pos (Event)));
end Handle;
end FLTK.Widgets.Valuators.Sliders.Value.Horizontal;
| 27.841667 | 92 | 0.63035 |
2016f41f33bcd2eed207e7fc2ed49d22429f83cf | 9,497 | adb | Ada | disorderly/gamma_1_to_3.adb | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | 30 | 2018-12-09T01:15:04.000Z | 2022-03-20T16:14:54.000Z | disorderly/gamma_1_to_3.adb | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null | disorderly/gamma_1_to_3.adb | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null |
--
-- The following uses 32+ decimal digit rational polynomial
-- approximations of the log_gamma function on [1,3], derived
-- from John Maddock's extended precision
-- (Boost Library) gamma function, so let's use the Boost License.
-- Many thanks are due to John Maddock.
--------------------------------------------------------------------------
--(C) Copyright John Maddock 2006.
--Use, modification and distribution are subject to the
--Boost Software License, Version 1.0. (See accompanying file
--LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
--
--Boost Software License - Version 1.0 - August 17th, 2003
--
--Permission is hereby granted, free of charge, to any person or organization
--obtaining a copy of the software and accompanying documentation covered by
--this license (the "Software") to use, reproduce, display, distribute,
--execute, and transmit the Software, and to prepare derivative works of the
--Software, and to permit third-parties to whom the Software is furnished to
--do so, all subject to the following:
--
--The copyright notices in the Software and this entire statement, including
--the above license grant, this restriction and the following disclaimer,
--must be included in all copies of the Software, in whole or in part, and
--all derivative works of the Software, unless such copies or derivative
--works are solely in the form of machine-executable object code generated by
--a source language processor.
--
--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, TITLE AND NON-INFRINGEMENT. IN NO EVENT
--SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
--FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
--ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
--DEALINGS IN THE SOFTWARE.
--------------------------------------------------------------------------
package body Gamma_1_to_3 is
Zero : constant Real := +0.0;
One : constant Real := +1.0;
Two : constant Real := +2.0;
Three : constant Real := +3.0;
-----------------------
-- Log_Gamma_1_to_3 --
-----------------------
-- Rational poly coefficients.
type Remez_Coeff_Range is range 1..13;
type Remez_Rational_Poly is array(Remez_Coeff_Range) of Real;
Y_1_to_1pt35 : constant Real := +0.54076099395751953125;
Numerator_Log_Gamma_1_to_1pt35 : constant Remez_Rational_Poly :=
(
0.036454670944013329356512090082402429697,
-0.066235835556476033710068679907798799959,
-0.67492399795577182387312206593595565371,
-1.4345555263962411429855341651960000166,
-1.4894319559821365820516771951249649563,
-0.87210277668067964629483299712322411566,
-0.29602090537771744401524080430529369136,
-0.0561832587517836908929331992218879676,
-0.0053236785487328044334381502530383140443,
-0.00018629360291358130461736386077971890789,
-0.10164985672213178500790406939467614498e-6,
0.13680157145361387405588201461036338274e-8,
0.0
);
Denominator_Log_Gamma_1_to_1pt35 : constant Remez_Rational_Poly :=
(
1.0,
4.9106336261005990534095838574132225599,
10.258804800866438510889341082793078432,
11.88588976846826108836629960537466889,
8.3455000546999704314454891036700998428,
3.6428823682421746343233362007194282703,
0.97465989807254572142266753052776132252,
0.15121052897097822172763084966793352524,
0.012017363555383555123769849654484594893,
0.0003583032812720649835431669893011257277,
0.0,
0.0,
0.0
);
Y_1pt35_to_1pt625 : constant Real := +0.483787059783935546875;
Numerator_Log_Gamma_1pt35_to_1pt625 : constant Remez_Rational_Poly :=
(
-0.017977422421608624353488126610933005432,
0.18484528905298309555089509029244135703,
-0.40401251514859546989565001431430884082,
0.40277179799147356461954182877921388182,
-0.21993421441282936476709677700477598816,
0.069595742223850248095697771331107571011,
-0.012681481427699686635516772923547347328,
0.0012489322866834830413292771335113136034,
-0.57058739515423112045108068834668269608e-4,
0.8207548771933585614380644961342925976e-6,
0.0,
0.0,
0.0
);
Denominator_Log_Gamma_1pt35_to_1pt625 : constant Remez_Rational_Poly :=
(
1.0,
-2.9629552288944259229543137757200262073,
3.7118380799042118987185957298964772755,
-2.5569815272165399297600586376727357187,
1.0546764918220835097855665680632153367,
-0.26574021300894401276478730940980810831,
0.03996289731752081380552901986471233462,
-0.0033398680924544836817826046380586480873,
0.00013288854760548251757651556792598235735,
-0.17194794958274081373243161848194745111e-5,
0.0,
0.0,
0.0
);
Y_1pt625_to_2 : constant Real := +0.443811893463134765625;
Numerator_Log_Gamma_1pt625_to_2 : constant Remez_Rational_Poly :=
(
-0.021027558364667626231512090082402429494,
0.15128811104498736604523586803722368377,
-0.26249631480066246699388544451126410278,
0.21148748610533489823742352180628489742,
-0.093964130697489071999873506148104370633,
0.024292059227009051652542804957550866827,
-0.0036284453226534839926304745756906117066,
0.0002939230129315195346843036254392485984,
-0.11088589183158123733132268042570710338e-4,
0.13240510580220763969511741896361984162e-6,
0.0,
0.0,
0.0
);
Denominator_Log_Gamma_1pt625_to_2 : constant Remez_Rational_Poly :=
(
1.0,
-2.4240003754444040525462170802796471996,
2.4868383476933178722203278602342786002,
-1.4047068395206343375520721509193698547,
0.47583809087867443858344765659065773369,
-0.09865724264554556400463655444270700132,
0.012238223514176587501074150988445109735,
-0.00084625068418239194670614419707491797097,
0.2796574430456237061420839429225710602e-4,
-0.30202973883316730694433702165188835331e-6,
0.0,
0.0,
0.0
);
Y_2_to_3 : constant Real := +0.158963680267333984375;
Numerator_Log_Gamma_2_to_3 : constant Remez_Rational_Poly :=
(
-0.018035568567844937910504030027467476655,
0.013841458273109517271750705401202404195,
0.062031842739486600078866923383017722399,
0.052518418329052161202007865149435256093,
0.01881718142472784129191838493267755758,
0.0025104830367021839316463675028524702846,
-0.00021043176101831873281848891452678568311,
-0.00010249622350908722793327719494037981166,
-0.11381479670982006841716879074288176994e-4,
-0.49999811718089980992888533630523892389e-6,
-0.70529798686542184668416911331718963364e-8,
0.0,
0.0
);
Denominator_Log_Gamma_2_to_3 : constant Remez_Rational_Poly :=
(
1.0,
2.5877485070422317542808137697939233685,
2.8797959228352591788629602533153837126,
1.8030885955284082026405495275461180977,
0.69774331297747390169238306148355428436,
0.17261566063277623942044077039756583802,
0.02729301254544230229429621192443000121,
0.0026776425891195270663133581960016620433,
0.00015244249160486584591370355730402168106,
0.43997034032479866020546814475414346627e-5,
0.46295080708455613044541885534408170934e-7,
-0.93326638207459533682980757982834180952e-11,
0.42316456553164995177177407325292867513e-13
);
function Log_Gamma_1_to_3
(x : in Real) return Real
is
Result, Arg : Real := Zero;
R, c : Real;
-- Evaluate P(n) x^n + P(n-1) x^(n-1) + ... + P(0):
function Remez_Poly_Sum
(x : in Real;
P : Remez_Rational_Poly) return Real
is
Sum : Real := Zero;
begin
for j in reverse Remez_Coeff_Range loop
Sum := Sum * x + P(j);
end loop;
return Sum;
end Remez_Poly_Sum;
begin
if x > Three then
raise Constraint_Error;
end if;
if x >= Two then
-- x in [2,3):
-- Log_Gamma(x) := (x-2)(x+1)(Y + R(x-2))
Arg := x - Two;
R := Remez_Poly_Sum (Arg, Numerator_Log_Gamma_2_to_3) /
Remez_Poly_Sum (Arg, Denominator_Log_Gamma_2_to_3);
c := Arg * (x + One);
Result := c * Y_2_to_3 + c * R;
elsif x > (+1.625) then
-- x in (1.625, 2.0]:
-- Log_Gamma(z) := (2-x)(1-x)(Y + R(2-x))
Arg := Two - x;
R := Remez_Poly_Sum (Arg, Numerator_Log_Gamma_1pt625_to_2) /
Remez_Poly_Sum (Arg, Denominator_Log_Gamma_1pt625_to_2);
c := Arg * (One - x);
Result := c * Y_1pt625_to_2 + c * R;
elsif x > (+1.35) then
-- x in (1.35, 1.625]:
-- Log_Gamma(x) := (x-1)(x-2)(Y + R(1.625 - x))
Arg := +1.625 - x;
R := Remez_Poly_Sum (Arg, Numerator_Log_Gamma_1pt35_to_1pt625) /
Remez_Poly_Sum (Arg, Denominator_Log_Gamma_1pt35_to_1pt625);
c := (x - One) * (x - Two);
Result := c * Y_1pt35_to_1pt625 + c * R;
elsif x >= One then
-- x in [1,1.35]:
-- Log_Gamma(x) := (x-1)(x-2)(Y + R(x-1))
Arg := x - One;
R := Remez_Poly_Sum (Arg, Numerator_Log_Gamma_1_to_1pt35) /
Remez_Poly_Sum (Arg, Denominator_Log_Gamma_1_to_1pt35);
c := Arg * (x - Two);
Result := c * Y_1_to_1pt35 + c * R;
else
raise Constraint_Error; -- or Argument_Error?
end if;
return Result;
end Log_Gamma_1_to_3;
end Gamma_1_to_3;
| 31.869128 | 77 | 0.705697 |
fb5c1c98087f450a8832f3aa995e492c4f81d41b | 269 | ads | Ada | specs/ada/server/ike/tkmrpc-operation_handlers-ike-cc_check_ca.ads | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | specs/ada/server/ike/tkmrpc-operation_handlers-ike-cc_check_ca.ads | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | specs/ada/server/ike/tkmrpc-operation_handlers-ike-cc_check_ca.ads | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | with Tkmrpc.Request;
with Tkmrpc.Response;
package Tkmrpc.Operation_Handlers.Ike.Cc_Check_Ca is
procedure Handle (Req : Request.Data_Type; Res : out Response.Data_Type);
-- Handler for the cc_check_ca operation.
end Tkmrpc.Operation_Handlers.Ike.Cc_Check_Ca;
| 26.9 | 76 | 0.791822 |
fb92ea91ef9dde0dd0f52b105226ad34808bab20 | 7,014 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-diflio.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-diflio.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-diflio.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . F L O A T _ I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-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 provides output routines for float dimensioned types. All Put
-- routines are modeled after those in package Ada.Text_IO.Float_IO with the
-- addition of an extra default parameter. All Put_Dim_Of routines
-- output the dimension of Item in a symbolic manner.
-- Parameter Symbol may be used in the following manner (all the examples are
-- based on the MKS system of units defined in package System.Dim.Mks):
-- type Mks_Type is new Long_Long_Float
-- 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'));
-- Case 1. A value is supplied for Symbol
-- * Put : The string appears as a suffix of Item
-- * Put_Dim_Of : The string appears alone
-- Obj : Mks_Type := 2.6;
-- Put (Obj, 1, 1, 0, " dimensionless");
-- Put_Dim_Of (Obj, "dimensionless");
-- The corresponding outputs are:
-- $2.6 dimensionless
-- $dimensionless
-- Case 2. No value is supplied for Symbol and Item is dimensionless
-- * Put : Item appears without a suffix
-- * Put_Dim_Of : the output is []
-- Obj : Mks_Type := 2.6;
-- Put (Obj, 1, 1, 0);
-- Put_Dim_Of (Obj);
-- The corresponding outputs are:
-- $2.6
-- $[]
-- Case 3. No value is supplied for Symbol and Item has a dimension
-- * Put : If the type of Item is a dimensioned subtype whose
-- symbol is not empty, then the symbol appears as a suffix.
-- Otherwise, a new string is created and appears as a
-- suffix of Item. This string results in the successive
-- concatenations between each unit symbol raised by its
-- corresponding dimension power from the dimensions of Item.
-- * Put_Dim_Of : The output is a new string resulting in the successive
-- concatenations between each dimension symbol raised by its
-- corresponding dimension power from the dimensions of Item.
-- subtype Length is Mks_Type
-- with
-- Dimension => ('m',
-- Meter => 1,
-- others => 0);
-- Obj : Length := 2.3 * dm;
-- Put (Obj, 1, 2, 0);
-- Put_Dim_Of (Obj);
-- The corresponding outputs are:
-- $0.23 m
-- $[L]
-- subtype Random is Mks_Type
-- with
-- Dimension => (
-- Meter => 3,
-- Candela => -1,
-- others => 0);
-- Obj : Random := 5.0;
-- Put (Obj);
-- Put_Dim_Of (Obj);
-- The corresponding outputs are:
-- $5.0 m**3.cd**(-1)
-- $[l**3.J**(-1)]
-- Put (3.3 * km * dm * min, 5, 1, 0);
-- Put_Dim_Of (3.3 * km * dm * min);
-- The corresponding outputs are:
-- $19800.0 m**2.s
-- $[L**2.T]
with Ada.Text_IO; use Ada.Text_IO;
generic
type Num_Dim_Float is digits <>;
package System.Dim.Float_IO is
Default_Fore : Field := 2;
Default_Aft : Field := Num_Dim_Float'Digits - 1;
Default_Exp : Field := 3;
procedure Put
(File : File_Type;
Item : Num_Dim_Float;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "");
procedure Put
(Item : Num_Dim_Float;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "");
procedure Put
(To : out String;
Item : Num_Dim_Float;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "");
procedure Put_Dim_Of
(File : File_Type;
Item : Num_Dim_Float;
Symbol : String := "");
procedure Put_Dim_Of
(Item : Num_Dim_Float;
Symbol : String := "");
procedure Put_Dim_Of
(To : out String;
Item : Num_Dim_Float;
Symbol : String := "");
pragma Inline (Put);
pragma Inline (Put_Dim_Of);
function Image
(Item : Num_Dim_Float;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp;
Symbol : String := "") return String;
end System.Dim.Float_IO;
| 37.913514 | 78 | 0.493869 |
1043c18d2bc11010c389c49076f7ccb9e3fabc99 | 4,638 | adb | Ada | bb-runtimes/src/s-textio__microbit.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/s-textio__microbit.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/s-textio__microbit.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . T E X T _ I O --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2018, 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 Interfaces.NRF51; use Interfaces.NRF51;
with Interfaces.NRF51.UART; use Interfaces.NRF51.UART;
package body System.Text_IO is
---------
-- Get --
---------
function Get return Character is
Ret : constant Character :=
Character'Val (UART0_Periph.RXD.RXD and 16#FF#);
begin
-- Clear the RX event for the character we just received
UART0_Periph.EVENTS_RXDRDY := 0;
return Ret;
end Get;
----------------
-- Initialize --
----------------
procedure Initialize is
Unref : Character with Unreferenced;
begin
-- Set a 115_200 baudrate
UART0_Periph.BAUDRATE := 16#01D7E000#;
-- Set TX io pin
UART0_Periph.PSELTXD := 24;
-- Set RX io pin
UART0_Periph.PSELRXD := 25;
-- Hardware Flow Control disabled
UART0_Periph.CONFIG.HWFC := Disabled;
-- Parity disabled
UART0_Periph.CONFIG.PARITY := Excluded;
-- Enable the peripheral
UART0_Periph.ENABLE.ENABLE := Enabled;
-- Clear events
UART0_Periph.EVENTS_RXDRDY := 0;
UART0_Periph.EVENTS_TXDRDY := 0;
-- Start TX and RX
UART0_Periph.TASKS_STARTRX := 1;
UART0_Periph.TASKS_STARTTX := 1;
-- Send a first character to start the TXREADY events (See nRF51 Series
-- Reference Manual Version 3.0 Figure 68: UART transmission)
Put (ASCII.NUL);
Initialized := True;
end Initialize;
-----------------
-- Is_Rx_Ready --
-----------------
function Is_Rx_Ready return Boolean is
begin
return UART0_Periph.EVENTS_RXDRDY /= 0;
end Is_Rx_Ready;
-----------------
-- Is_Tx_Ready --
-----------------
function Is_Tx_Ready return Boolean is
begin
return UART0_Periph.EVENTS_TXDRDY /= 0;
end Is_Tx_Ready;
---------
-- Put --
---------
procedure Put (C : Character) is
begin
UART0_Periph.EVENTS_TXDRDY := 0;
-- Send the character
UART0_Periph.TXD.TXD := Byte (Character'Pos (C));
end Put;
----------------------------
-- Use_Cr_Lf_For_New_Line --
----------------------------
function Use_Cr_Lf_For_New_Line return Boolean is
begin
return True;
end Use_Cr_Lf_For_New_Line;
end System.Text_IO;
| 35.136364 | 78 | 0.47003 |
5062960cbeccd2e003ebf108516c476a78d4905b | 2,848 | ads | Ada | tools-src/gnu/gcc/gcc/ada/s-expflt.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/s-expflt.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/s-expflt.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . E X P F L T --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992,1993,1994 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. --
-- --
------------------------------------------------------------------------------
-- Float exponentiation (checks on)
with System.Exp_Gen;
package System.Exp_Flt is
pragma Pure (Exp_Flt);
function Exp_Float is new System.Exp_Gen.Exp_Float_Type (Float);
end System.Exp_Flt;
| 61.913043 | 78 | 0.417837 |
fb5d6190bb914adf5a3e78195634c9b0eff8877e | 1,129 | adb | Ada | .emacs.d/elpa/wisi-3.1.3/sal-gen_bounded_definite_vectors_sorted-gen_refs.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/sal-gen_bounded_definite_vectors_sorted-gen_refs.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/sal-gen_bounded_definite_vectors_sorted-gen_refs.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- See spec.
--
-- Copyright (C) 2019 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. This library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
package body SAL.Gen_Bounded_Definite_Vectors_Sorted.Gen_Refs is
function Constant_Ref (Container : aliased Vector; Index : in Peek_Type) return Constant_Reference_Type
is begin
return
(Element => Container.Elements (Index)'Access,
Dummy => 1);
end Constant_Ref;
end SAL.Gen_Bounded_Definite_Vectors_Sorted.Gen_Refs;
| 37.633333 | 106 | 0.738707 |
4a194bab6f26181bf110eb64900640aa1fb16b90 | 505 | ads | Ada | tests/factions-test_data-tests-careers_container-test_data-tests.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | tests/factions-test_data-tests-careers_container-test_data-tests.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | tests/factions-test_data-tests-careers_container-test_data-tests.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- 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 Factions.Test_Data.Tests.Careers_Container.Test_Data.Tests is
type Test is new GNATtest_Generated.GNATtest_Standard.Factions.Test_Data
.Tests
.Careers_Container
.Test_Data
.New_Test with
null record;
end Factions.Test_Data.Tests.Careers_Container.Test_Data.Tests;
-- end read only
| 28.055556 | 76 | 0.772277 |
397ceaeb35b10a5157e3a54ae123fd3240176878 | 6,396 | ads | Ada | source/nodes/program-nodes-formal_type_declarations.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-formal_type_declarations.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-formal_type_declarations.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Elements.Defining_Identifiers;
with Program.Elements.Definitions;
with Program.Elements.Formal_Type_Definitions;
with Program.Elements.Aspect_Specifications;
with Program.Elements.Formal_Type_Declarations;
with Program.Element_Visitors;
package Program.Nodes.Formal_Type_Declarations is
pragma Preelaborate;
type Formal_Type_Declaration is
new Program.Nodes.Node
and Program.Elements.Formal_Type_Declarations.Formal_Type_Declaration
and Program.Elements.Formal_Type_Declarations
.Formal_Type_Declaration_Text
with private;
function Create
(Type_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Discriminant_Part : Program.Elements.Definitions.Definition_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Definition : not null Program.Elements.Formal_Type_Definitions
.Formal_Type_Definition_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 Formal_Type_Declaration;
type Implicit_Formal_Type_Declaration is
new Program.Nodes.Node
and Program.Elements.Formal_Type_Declarations.Formal_Type_Declaration
with private;
function Create
(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 Implicit_Formal_Type_Declaration
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Formal_Type_Declaration is
abstract new Program.Nodes.Node
and Program.Elements.Formal_Type_Declarations.Formal_Type_Declaration
with record
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;
end record;
procedure Initialize (Self : in out Base_Formal_Type_Declaration'Class);
overriding procedure Visit
(Self : not null access Base_Formal_Type_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Name
(Self : Base_Formal_Type_Declaration)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
overriding function Discriminant_Part
(Self : Base_Formal_Type_Declaration)
return Program.Elements.Definitions.Definition_Access;
overriding function Definition
(Self : Base_Formal_Type_Declaration)
return not null Program.Elements.Formal_Type_Definitions
.Formal_Type_Definition_Access;
overriding function Aspects
(Self : Base_Formal_Type_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
overriding function Is_Formal_Type_Declaration
(Self : Base_Formal_Type_Declaration)
return Boolean;
overriding function Is_Declaration
(Self : Base_Formal_Type_Declaration)
return Boolean;
type Formal_Type_Declaration is
new Base_Formal_Type_Declaration
and Program.Elements.Formal_Type_Declarations
.Formal_Type_Declaration_Text
with record
Type_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Formal_Type_Declaration_Text
(Self : in out Formal_Type_Declaration)
return Program.Elements.Formal_Type_Declarations
.Formal_Type_Declaration_Text_Access;
overriding function Type_Token
(Self : Formal_Type_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Is_Token
(Self : Formal_Type_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function With_Token
(Self : Formal_Type_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function Semicolon_Token
(Self : Formal_Type_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Formal_Type_Declaration is
new Base_Formal_Type_Declaration
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Formal_Type_Declaration_Text
(Self : in out Implicit_Formal_Type_Declaration)
return Program.Elements.Formal_Type_Declarations
.Formal_Type_Declaration_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Formal_Type_Declaration)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Formal_Type_Declaration)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Formal_Type_Declaration)
return Boolean;
end Program.Nodes.Formal_Type_Declarations;
| 37.623529 | 78 | 0.742652 |
1cfcf482abae33556570df74261fc3f14a533ca5 | 8,824 | ads | Ada | src/yaml/text.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/yaml/text.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/yaml/text.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | -- part of ParserTools, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with Ada.Containers;
with Ada.Strings.UTF_Encoding;
with Ada.Strings.Unbounded;
with System.Storage_Elements;
package Text is
-- this package defines a reference-counted string pointer type. it is used
-- for all YAML data entities and relieves the user from the need to
-- manually dispose events created by the parser.
--
-- typically, YAML content strings are deallocated in the same order as they
-- are allocated. this knowledge is built into a storage pool for efficient
-- memory usage and to avoid fragmentation.
--
-- to be able to efficiently interface with C, this package allocates its
-- strings so that they can directly be passed on to C without the need to
-- copy any data. Use the subroutines Export and Delete_Exported to get
-- C-compatible string values from a Reference. these subroutines also
-- take care of reference counting for values exposed to C. this means that
-- after exporting a value, you *must* eventually call Delete_Exported in
-- order for the value to be freed.
--
-- HINT: this package makes use of compiler implementation details and may
-- not work with other compilers. however, since there currently are no
-- Ada 2012 compilers but GNAT, this is not considered a problem.
-- the pool allocates the memory it uses on the heap. it is allowed for the
-- pool to vanish while References created on it are still around. the
-- heap memory is reclaimed when the pool itself and all References
-- created by it vanish.
--
-- this type has pointer semantics in order to allow the usage of the same
-- pool at different places without the need of access types. copying a
-- value of this type will make both values use the same memory. use Create
-- to generate a new independent pool.
-- all strings generated by Yaml are encoded in UTF-8, regardless of input
-- encoding.
subtype UTF_8_String is Ada.Strings.UTF_Encoding.UTF_8_String;
type UTF_8_String_Access is access UTF_8_String;
subtype Pool_Offset is System.Storage_Elements.Storage_Offset
range 0 .. System.Storage_Elements.Storage_Offset (Integer'Last);
-- this is a smart pointer. use Value to access its value.
subtype Reference is Ada.Strings.Unbounded.Unbounded_String;
-- shortcut for Object.Value.Data'Length
function Length (Object : Reference) return Natural renames Ada.Strings.Unbounded.Length;
function "&" (Left, Right : Reference) return String;
-- compares the string content of two Content values.
function "=" (Left, Right : Reference) return Boolean renames Ada.Strings.Unbounded."=";
function Hash (Object : Reference) return Ada.Containers.Hash_Type;
-- equivalent to the empty string. default value for References.
Empty : constant Reference;
-- this can be used for constant Reference values that are declared at
-- library level where no Pool is available. References pointing to a
-- Constant_Content_Holder are never freed.
subtype Constant_Instance is Reference;
-- note that there is a limit of 128 characters for Content values created
-- like this.
function Hold (Content : String) return Constant_Instance
renames Ada.Strings.Unbounded.To_Unbounded_String;
-- get a Reference value which is a reference to the string contained in the
-- Holder.
function Held (Holder : Constant_Instance) return Reference is (Holder);
private
-- this forces GNAT to store the First and Last dope values right before
-- the first element of the String. we use that to our advantage.
for UTF_8_String_Access'Size use Standard'Address_Size;
type Chunk_Index_Type is range 1 .. 10;
subtype Refcount_Type is Integer range 0 .. 2 ** 24 - 1;
-- the pool consists of multiple chunks of memory. strings are allocated
-- inside the chunks.
type Pool_Array is array (Pool_Offset range <>) of System.Storage_Elements.Storage_Element;
type Chunk is access Pool_Array;
type Chunk_Array is array (Chunk_Index_Type) of Chunk;
type Usage_Array is array (Chunk_Index_Type) of Natural;
-- the idea is that Cur is the pointer to the active Chunk. all new strings
-- are allocated in that active Chunk until there is no more space. then,
-- we allocate a new Chunk of twice the size of the current one and make
-- that the current Chunk. the old Chunk lives on until all Content strings
-- allocated on it vanish. Usage is the number of strings currently
-- allocated on the Chunk and is used as reference count. the current Chunk
-- has Usage + 1 which prevents its deallocation even if the last Content
-- string on it vanishes. the Content type's finalization takes care of
-- decrementing the Usage value that counts allocated strings, while the
-- String_Pool type's deallocation takes care of removing the +1 for the
-- current Chunk.
--
-- we treat each Chunk basically as a bitvector ring list, and Pos is the
-- current offset in the current Chunk. instead of having a full bitvector
-- for allocating, we use the dope values from the strings that stay in the
-- memory after deallocation. besides the First and Last values, we also
-- store a reference count in the dope. so when searching for a place to
-- allocate a new string, we can skip over regions that have a non-zero
-- reference count in their header, and those with a 0 reference count are
-- available space. compared to a real bitvector, we always have the
-- information of the length of an free region available. we can avoid
-- fragmentation by merging a region that is freed with the surrounding free
-- regions.
type Pool_Data is record
Refcount : Refcount_Type := 1;
Chunks : Chunk_Array;
Usage : Usage_Array := (1 => 1, others => 0);
Cur : Chunk_Index_Type := 1;
Pos : Pool_Offset;
end record;
type Pool_Data_Access is access Pool_Data;
for Pool_Data_Access'Size use Standard'Address_Size;
-- this is the dope vector of each string allocated in a Chunk. it is put
-- immediately before the string's value. note that the First and Last
-- elements are at the exact positions where GNAT searches for the string's
-- boundary dope. this allows us to access those values for maintaining the
-- ring list.
type Header is record
Pool : Pool_Data_Access;
Chunk_Index : Chunk_Index_Type;
Refcount : Refcount_Type := 1;
First, Last : Pool_Offset;
end record;
Chunk_Index_Start : constant := Standard'Address_Size;
Refcount_Start : constant := Standard'Address_Size + 8;
First_Start : constant := Standard'Address_Size + 32;
Last_Start : constant := First_Start + Integer'Size;
Header_End : constant := Last_Start + Integer'Size - 1;
for Header use record
Pool at 0 range 0 .. Chunk_Index_Start - 1;
Chunk_Index at 0 range Chunk_Index_Start .. Refcount_Start - 1;
Refcount at 0 range Refcount_Start .. First_Start - 1;
First at 0 range First_Start .. Last_Start - 1;
Last at 0 range Last_Start .. Header_End;
end record;
for Header'Size use Header_End + 1;
use type System.Storage_Elements.Storage_Offset;
Header_Size : constant Pool_Offset := Header'Size / System.Storage_Unit;
Chunk_Start_Index : constant := Chunk_Index_Start / System.Storage_Unit + 1;
Refcount_Start_Index : constant := Refcount_Start / System.Storage_Unit + 1;
First_Start_Index : constant := First_Start / System.Storage_Unit + 1;
Last_Start_Index : constant := Last_Start / System.Storage_Unit + 1;
End_Index : constant := (Header_End + 1) / System.Storage_Unit;
type Accessor (Data : not null access constant UTF_8_String) is limited
record
-- holds a copy of the smart pointer, so the string cannot be freed
-- while the accessor lives.
Hold : Reference;
end record;
Empty : constant Reference := Ada.Strings.Unbounded.Null_Unbounded_String;
-- it is important that all allocated strings are aligned to the header
-- length. else, it may happen that we generate a region of free memory that
-- is not large enough to hold a header – but we need to write the header
-- there to hold information for the ring list. therefore, whenever we
-- calculate offsets, we use this to round them up to a multiple of
-- Header_Size.
function Round_To_Header_Size (Length : Pool_Offset)
return Pool_Offset is
((Length + Header_Size - 1) / Header_Size * Header_Size);
end Text;
| 47.956522 | 94 | 0.714189 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.