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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
045069c1d1f97ccecf0b97651d3c070020c1ffb7 | 2,842 | ads | Ada | ada-numerics-generic_complex_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_complex_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_complex_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
---------------------------------------------------------------------------
with Ada.Numerics.Generic_Complex_Types;
generic
with package Complex_Types is new Ada.Numerics.Generic_Complex_Types (<>);
package Ada.Numerics.Generic_Complex_Elementary_Functions is
pragma Pure (Generic_Complex_Elementary_Functions);
function Sqrt (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Log (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Exp (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Exp (X : in Complex_Types.Imaginary) return Complex_Types.Complex;
function "**" (Left : in Complex_Types.Complex;
Right : in Complex_Types.Complex)
return Complex_Types.Complex;
function "**" (Left : in Complex_Types.Complex;
Right : in Complex_Types.Real'Base)
return Complex_Types.Complex;
function "**" (Left : in Complex_Types.Real'Base;
Right : in Complex_Types.Complex)
return Complex_Types.Complex;
function Sin (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Cos (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Tan (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Cot (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Arcsin (X : in Complex_Types.Complex)
return Complex_Types.Complex;
function Arccos (X : in Complex_Types.Complex)
return Complex_Types.Complex;
function Arctan (X : in Complex_Types.Complex)
return Complex_Types.Complex;
function Arccot (X : in Complex_Types.Complex)
return Complex_Types.Complex;
function Sinh (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Cosh (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Tanh (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Coth (X : in Complex_Types.Complex) return Complex_Types.Complex;
function Arcsinh (X : in Complex_Types.Complex)
return Complex_Types.Complex;
function Arccosh (X : in Complex_Types.Complex)
return Complex_Types.Complex;
function Arctanh (X : in Complex_Types.Complex)
return Complex_Types.Complex;
function Arccoth (X : in Complex_Types.Complex)
return Complex_Types.Complex;
end Ada.Numerics.Generic_Complex_Elementary_Functions;
| 35.525 | 78 | 0.714989 |
04c5c1206b9c97a6bcb51ab5aa7ca8c3ad414bec | 1,215 | adb | Ada | examples/filelock.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | examples/filelock.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | examples/filelock.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | with Ada.Directories.Temporary;
with Ada.Streams.Stream_IO;
procedure filelock is
use Ada.Streams.Stream_IO;
Name : String := Ada.Directories.Temporary.Create_Temporary_File;
begin
Ada.Debug.Put (Name);
-- raising
declare
Step : Integer := 0;
File_1, File_2 : File_Type;
begin
Step := 1;
Open (File_1, In_File, Name); -- read lock
Step := 2;
Open (File_2, In_File, Name, Form => "shared=deny"); -- write lock
Step := 3;
exception
when Tasking_Error =>
if Step /= 2 then
Ada.Debug.Put ("bad");
end if;
end;
-- waiting
declare
Step : Integer := 0;
pragma Atomic (Step);
File_1 : File_Type;
task Task_2 is
end Task_2;
task body Task_2 is
File_2 : File_Type;
begin
delay 0.1;
pragma Assert (Step = 2);
Step := 3;
Open (File_2, In_File, Name, Form => "shared=deny,wait=true"); -- write lock
pragma Assert (Step = 4);
Step := 5;
end Task_2;
begin
pragma Assert (Step = 0);
Step := 1;
Open (File_1, In_File, Name, Form => "wait=true"); -- read lock
pragma Assert (Step = 1);
Step := 2;
delay 0.2;
pragma Assert (Step = 3);
Step := 4;
Close (File_1);
end;
Ada.Directories.Delete_File (Name);
Ada.Debug.Put ("OK");
end filelock;
| 22.090909 | 79 | 0.638683 |
1377a23da669e7f0e9db2d457c80dfc33c52d76f | 3,317 | ads | Ada | software/hal/hal/src/hal-framebuffer.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/hal/hal/src/hal-framebuffer.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/hal/hal/src/hal-framebuffer.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | with HAL.Bitmap;
package HAL.Framebuffer is
subtype FB_Color_Mode is HAL.Bitmap.Bitmap_Color_Mode range
HAL.Bitmap.ARGB_8888 .. HAL.Bitmap.AL_88;
type Display_Orientation is
(Default, Landscape, Portrait);
type Wait_Mode is (Polling, Interrupt);
type Frame_Buffer_Display is limited interface;
type Frame_Buffer_Display_Access is access all Frame_Buffer_Display'Class;
function Get_Max_Layers
(Display : Frame_Buffer_Display) return Positive
is abstract;
function Is_Supported
(Display : Frame_Buffer_Display;
Mode : FB_Color_Mode) return Boolean
is abstract;
procedure Initialize
(Display : in out Frame_Buffer_Display;
Orientation : Display_Orientation := Default;
Mode : Wait_Mode := Interrupt) is abstract;
procedure Set_Orientation
(Display : in out Frame_Buffer_Display;
Orientation : Display_Orientation) is abstract;
procedure Set_Mode
(Display : in out Frame_Buffer_Display;
Mode : Wait_Mode) is abstract;
function Initialized
(Display : Frame_Buffer_Display) return Boolean is abstract;
function Get_Width
(Display : Frame_Buffer_Display) return Positive is abstract;
function Get_Height
(Display : Frame_Buffer_Display) return Positive is abstract;
function Is_Swapped
(Display : Frame_Buffer_Display) return Boolean is abstract;
-- Whether X/Y coordinates are considered Swapped by the drawing primitives
-- This simulates Landscape/Portrait orientation on displays not supporting
-- hardware orientation change
procedure Set_Background
(Display : Frame_Buffer_Display; R, G, B : Byte) is abstract;
procedure Initialize_Layer
(Display : in out Frame_Buffer_Display;
Layer : Positive;
Mode : FB_Color_Mode;
X : Natural := 0;
Y : Natural := 0;
Width : Positive := Positive'Last;
Height : Positive := Positive'Last) is abstract;
-- All layers are double buffered, so an explicit call to Update_Layer
-- needs to be performed to actually display the current buffer attached
-- to the layer.
-- Alloc is called to create the actual buffer.
function Initialized
(Display : Frame_Buffer_Display;
Layer : Positive) return Boolean is abstract;
procedure Update_Layer
(Display : in out Frame_Buffer_Display;
Layer : Positive;
Copy_Back : Boolean := False) is abstract;
-- Updates the layer so that the hidden buffer is displayed.
procedure Update_Layers
(Display : in out Frame_Buffer_Display) is abstract;
-- Updates all initialized layers at once with their respective hidden
-- buffer
function Get_Color_Mode
(Display : Frame_Buffer_Display;
Layer : Positive) return FB_Color_Mode is abstract;
-- Retrieves the current color mode for the layer.
function Get_Hidden_Buffer
(Display : Frame_Buffer_Display;
Layer : Positive) return HAL.Bitmap.Bitmap_Buffer'Class is abstract;
-- Retrieves the current hidden buffer for the layer.
function Get_Pixel_Size
(Display : Frame_Buffer_Display;
Layer : Positive) return Positive is abstract;
-- Retrieves the current hidden buffer for the layer.
end HAL.Framebuffer;
| 33.17 | 79 | 0.71028 |
574396c33071ae81a7c67f1dedf5b3c128083598 | 4,253 | adb | Ada | regtests/ado-schemas-tests.adb | Letractively/ada-ado | f0863c6975ae1a2c5349daee1e98a04fe11ba11e | [
"Apache-2.0"
] | null | null | null | regtests/ado-schemas-tests.adb | Letractively/ada-ado | f0863c6975ae1a2c5349daee1e98a04fe11ba11e | [
"Apache-2.0"
] | null | null | null | regtests/ado-schemas-tests.adb | Letractively/ada-ado | f0863c6975ae1a2c5349daee1e98a04fe11ba11e | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- schemas Tests -- Test loading of database schema
-- Copyright (C) 2009, 2010, 2011, 2012 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.Test_Caller;
with ADO.Sessions;
with ADO.Schemas.Entities;
with Regtests;
with Regtests.Simple.Model;
package body ADO.Schemas.Tests is
use Util.Tests;
package Caller is new Util.Test_Caller (Test, "ADO.Schemas");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test ADO.Schemas.Entities.Find_Entity_Type",
Test_Find_Entity_Type'Access);
Caller.Add_Test (Suite, "Test ADO.Schemas.Entities.Find_Entity_Type (error)",
Test_Find_Entity_Type_Error'Access);
end Add_Tests;
-- ------------------------------
-- Test reading the entity cache and the Find_Entity_Type operation
-- ------------------------------
procedure Test_Find_Entity_Type (T : in out Test) is
S : ADO.Sessions.Session := Regtests.Get_Database;
C : ADO.Schemas.Entities.Entity_Cache;
begin
ADO.Schemas.Entities.Initialize (Cache => C,
Session => S);
declare
-- T1 : constant ADO.Model.Entity_Type_Ref
-- := Entities.Find_Entity_Type (Cache => C,
-- Table => Regtests.Simple.Model.USER_TABLE'Access);
-- T2 : constant ADO.Model.Entity_Type_Ref
-- := Entities.Find_Entity_Type (Cache => C,
-- Table => Regtests.Simple.Model.ALLOCATE_TABLE'Access);
T4 : constant ADO.Entity_Type
:= Entities.Find_Entity_Type (Cache => C,
Table => Regtests.Simple.Model.ALLOCATE_TABLE'Access);
T5 : constant ADO.Entity_Type
:= Entities.Find_Entity_Type (Cache => C,
Table => Regtests.Simple.Model.USER_TABLE'Access);
begin
-- T.Assert (not ADO.Objects.Is_Null (T1), "Find_Entity_Type returned a null value");
-- T.Assert (not ADO.Objects.Is_Null (T2), "Find_Entity_Type returned a null value");
T.Assert (T4 /= T5, "Two distinct tables have different entity types");
T.Assert (T4 > 0, "T1.Id must be positive");
T.Assert (T5 > 0, "T2.Id must be positive");
-- T.Assert (T1.Get_Id /= T2.Get_Id, "Two distinct tables have different ids");
--
-- Assert_Equals (T, Integer (T2.Get_Id), Integer (T4),
-- "Invalid entity type for allocate_table");
-- Assert_Equals (T, Integer (T1.Get_Id), Integer (T5),
-- "Invalid entity type for user_table");
end;
end Test_Find_Entity_Type;
-- ------------------------------
-- Test calling Find_Entity_Type with an invalid table.
-- ------------------------------
procedure Test_Find_Entity_Type_Error (T : in out Test) is
C : ADO.Schemas.Entities.Entity_Cache;
begin
declare
R : ADO.Entity_Type;
pragma Unreferenced (R);
begin
R := Entities.Find_Entity_Type (Cache => C,
Table => Regtests.Simple.Model.USER_TABLE'Access);
T.Assert (False, "Find_Entity_Type did not raise the No_Entity_Type exception");
exception
when ADO.Schemas.Entities.No_Entity_Type =>
null;
end;
end Test_Find_Entity_Type_Error;
end ADO.Schemas.Tests;
| 42.108911 | 99 | 0.579356 |
c7686142f581dc0a8e1b79bb4802b34c081968d9 | 46,678 | adb | Ada | model_multistart/0/hls4ml_prj/myproject_prj/solution1/.autopilot/db/relu_1.sched.adb | filipemlins/nas-hls4ml | b35afc4f684d803d352776c40f3a6cbbf47c4b1c | [
"MIT"
] | null | null | null | model_multistart/0/hls4ml_prj/myproject_prj/solution1/.autopilot/db/relu_1.sched.adb | filipemlins/nas-hls4ml | b35afc4f684d803d352776c40f3a6cbbf47c4b1c | [
"MIT"
] | null | null | null | model_multistart/0/hls4ml_prj/myproject_prj/solution1/.autopilot/db/relu_1.sched.adb | filipemlins/nas-hls4ml | b35afc4f684d803d352776c40f3a6cbbf47c4b1c | [
"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>relu_1</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>data_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>6728</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>res_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>6728</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>15</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>3</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>76</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>23</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>1.76</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>ii</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ii</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</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>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>tmp</name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>76</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>29</item>
<item>31</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.09</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>ii_2</name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>ii</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>32</item>
<item>34</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.67</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>76</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>35</item>
<item>36</item>
<item>37</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>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>tmp_s</name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>80</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>38</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>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>data_V_addr</name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>80</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>39</item>
<item>41</item>
<item>42</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>datareg_V</name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>80</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>datareg.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>tmp_16</name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>80</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>44</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>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>tmp_2</name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>81</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>45</item>
<item>47</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.20</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>res_V_addr</name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>48</item>
<item>49</item>
<item>50</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>datareg_V_2</name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>datareg.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>51</item>
<item>52</item>
<item>53</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.69</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>54</item>
<item>55</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>76</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>56</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>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_activation.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_activation.h</first>
<second>relu&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, relu_config5&gt;</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_18">
<Value>
<Obj>
<type>2</type>
<id>24</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_19">
<Value>
<Obj>
<type>2</type>
<id>30</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>6728</content>
</item>
<item class_id_reference="16" object_id="_20">
<Value>
<Obj>
<type>2</type>
<id>33</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_21">
<Value>
<Obj>
<type>2</type>
<id>40</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="_22">
<Value>
<Obj>
<type>2</type>
<id>46</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</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="_23">
<Obj>
<type>3</type>
<id>4</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>3</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_24">
<Obj>
<type>3</type>
<id>10</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>4</count>
<item_version>0</item_version>
<item>5</item>
<item>6</item>
<item>8</item>
<item>9</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_25">
<Obj>
<type>3</type>
<id>20</id>
<name>_ZgtILi14ELi2ELb1EL9ap_q_mode0EL9ap_o_mode0ELi0EEbRK13ap_fixed_baseIXT_EXT0_EXT1_EXT2_EXT3_EXT4_EEi.exit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>9</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_26">
<Obj>
<type>3</type>
<id>22</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>21</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>33</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_27">
<id>23</id>
<edge_type>2</edge_type>
<source_obj>10</source_obj>
<sink_obj>3</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_28">
<id>25</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_29">
<id>26</id>
<edge_type>2</edge_type>
<source_obj>4</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_30">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_31">
<id>28</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_32">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>6</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_33">
<id>31</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>6</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_34">
<id>32</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="_35">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_36">
<id>35</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_37">
<id>36</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_38">
<id>37</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_39">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_40">
<id>39</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="_41">
<id>41</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_42">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_43">
<id>43</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="_44">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_45">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_46">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_47">
<id>48</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_48">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_49">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_50">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_51">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_52">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_53">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_55">
<id>56</id>
<edge_type>2</edge_type>
<source_obj>10</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_56">
<id>63</id>
<edge_type>2</edge_type>
<source_obj>4</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_57">
<id>64</id>
<edge_type>2</edge_type>
<source_obj>10</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_58">
<id>65</id>
<edge_type>2</edge_type>
<source_obj>10</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_59">
<id>66</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>10</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="_60">
<mId>1</mId>
<mTag>relu.1</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>26913</mMinLatency>
<mMaxLatency>26913</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_61">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>4</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_62">
<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>10</item>
<item>20</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>6728</mMinTripCount>
<mMaxTripCount>6728</mMaxTripCount>
<mMinLatency>26912</mMinLatency>
<mMaxLatency>26912</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_63">
<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>22</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>15</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>3</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>5</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>4</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>4</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>4</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>4</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 30.056665 | 153 | 0.619392 |
0453b0fd0d9bc322505d9cd1a00e8d6abff26fca | 5,282 | adb | Ada | demo/adainclude/a-rttiev.adb | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | demo/adainclude/a-rttiev.adb | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | demo/adainclude/a-rttiev.adb | e3l6/SSMDev | 2929757aab3842aefd84debb2d7c3e8b28c2b340 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . R E A L _ T I M E . T I M I N G _ E V E N T S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2005-2013, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
with System.BB.Time;
package body Ada.Real_Time.Timing_Events is
procedure Handler_Wrapper
(Event : in out System.BB.Timing_Events.Timing_Event'Class) with
-- This wrapper is needed to make a clean conversion between
-- System.BB.Timing_Events.Timing_Event_Handler and
-- Ada.Real_Time.Timing_Events.Timing_Event_Handler.
Pre =>
-- Timing_Event can only be defined from the type defined in RM D.15
-- Ada.Real_Time.Timing_Events.Timing_Event.
Event in Ada.Real_Time.Timing_Events.Timing_Event;
package SBTE renames System.BB.Timing_Events;
---------------------
-- Handler_Wrapper --
---------------------
procedure Handler_Wrapper
(Event : in out System.BB.Timing_Events.Timing_Event'Class)
is
RT_Event : Timing_Event renames Timing_Event (Event);
-- View conversion on the parameter
Handler : constant Timing_Event_Handler := RT_Event.Real_Handler;
begin
if Handler /= null then
RT_Event.Real_Handler := null;
Handler.all (RT_Event);
end if;
end Handler_Wrapper;
-----------------
-- Set_Handler --
-----------------
procedure Set_Handler
(Event : in out Timing_Event;
At_Time : Time;
Handler : Timing_Event_Handler)
is
BB_Handler : constant System.BB.Timing_Events.Timing_Event_Handler :=
(if Handler = null then null else Handler_Wrapper'Access);
-- Keep a null low-level handler if we are setting a null handler
-- (meaning that we the event is to be cleared as per D.15 par. 11/3).
-- Otherwise, pass the address of the wrapper in charge of executing
-- the actual handler (we need a wrapper because in addition to execute
-- the handler we need to set the handler to null to indicate that it
-- has already been executed).
begin
Event.Real_Handler := Handler;
SBTE.Set_Handler (SBTE.Timing_Event (Event),
System.BB.Time.Time (At_Time),
BB_Handler);
end Set_Handler;
---------------------
-- Current_Handler --
---------------------
function Current_Handler
(Event : Timing_Event) return Timing_Event_Handler
is
begin
return Event.Real_Handler;
end Current_Handler;
--------------------
-- Cancel_Handler --
--------------------
procedure Cancel_Handler
(Event : in out Timing_Event;
Cancelled : out Boolean)
is
begin
SBTE.Cancel_Handler (SBTE.Timing_Event (Event), Cancelled);
Event.Real_Handler := null;
end Cancel_Handler;
-------------------
-- Time_Of_Event --
-------------------
function Time_Of_Event (Event : Timing_Event) return Time is
begin
return Time (SBTE.Time_Of_Event (SBTE.Timing_Event (Event)));
end Time_Of_Event;
end Ada.Real_Time.Timing_Events;
| 40.320611 | 78 | 0.480121 |
ad3b52e0b30f38808c2259d64e91d4785ea43ab4 | 4,992 | ads | Ada | source/nodes/program-nodes-variant_parts.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-variant_parts.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-variant_parts.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.Identifiers;
with Program.Elements.Variants;
with Program.Elements.Variant_Parts;
with Program.Element_Visitors;
package Program.Nodes.Variant_Parts is
pragma Preelaborate;
type Variant_Part is
new Program.Nodes.Node and Program.Elements.Variant_Parts.Variant_Part
and Program.Elements.Variant_Parts.Variant_Part_Text
with private;
function Create
(Case_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Discriminant : not null Program.Elements.Identifiers.Identifier_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Variants : not null Program.Elements.Variants
.Variant_Vector_Access;
End_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Case_Token_2 : not null Program.Lexical_Elements
.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Variant_Part;
type Implicit_Variant_Part is
new Program.Nodes.Node and Program.Elements.Variant_Parts.Variant_Part
with private;
function Create
(Discriminant : not null Program.Elements.Identifiers
.Identifier_Access;
Variants : not null Program.Elements.Variants
.Variant_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Variant_Part
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Variant_Part is
abstract new Program.Nodes.Node
and Program.Elements.Variant_Parts.Variant_Part
with record
Discriminant : not null Program.Elements.Identifiers.Identifier_Access;
Variants : not null Program.Elements.Variants
.Variant_Vector_Access;
end record;
procedure Initialize (Self : in out Base_Variant_Part'Class);
overriding procedure Visit
(Self : not null access Base_Variant_Part;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Discriminant
(Self : Base_Variant_Part)
return not null Program.Elements.Identifiers.Identifier_Access;
overriding function Variants
(Self : Base_Variant_Part)
return not null Program.Elements.Variants.Variant_Vector_Access;
overriding function Is_Variant_Part
(Self : Base_Variant_Part)
return Boolean;
overriding function Is_Definition (Self : Base_Variant_Part) return Boolean;
type Variant_Part is
new Base_Variant_Part and Program.Elements.Variant_Parts.Variant_Part_Text
with record
Case_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
End_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Case_Token_2 : not null Program.Lexical_Elements
.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Variant_Part_Text
(Self : in out Variant_Part)
return Program.Elements.Variant_Parts.Variant_Part_Text_Access;
overriding function Case_Token
(Self : Variant_Part)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Is_Token
(Self : Variant_Part)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function End_Token
(Self : Variant_Part)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Case_Token_2
(Self : Variant_Part)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Semicolon_Token
(Self : Variant_Part)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Variant_Part is
new Base_Variant_Part
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Variant_Part_Text
(Self : in out Implicit_Variant_Part)
return Program.Elements.Variant_Parts.Variant_Part_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Variant_Part)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Variant_Part)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Variant_Part)
return Boolean;
end Program.Nodes.Variant_Parts;
| 33.959184 | 79 | 0.725361 |
04b71ab3d5e1aa279173230458254ba7ad66aa55 | 393 | adb | Ada | tests/unit_tests/jsa-tests.adb | sparre/JSA | 713a8244bcd85d86f14a58b3a94ba72c4d4382c0 | [
"ISC"
] | 1 | 2018-12-17T14:35:33.000Z | 2018-12-17T14:35:33.000Z | tests/unit_tests/jsa-tests.adb | sparre/JSA | 713a8244bcd85d86f14a58b3a94ba72c4d4382c0 | [
"ISC"
] | null | null | null | tests/unit_tests/jsa-tests.adb | sparre/JSA | 713a8244bcd85d86f14a58b3a94ba72c4d4382c0 | [
"ISC"
] | null | null | null | with
JSA.Tests.Intermediate_Backups;
package body JSA.Tests is
function Suite return Ahven.Framework.Test_Suite is
use Ahven.Framework;
Intermediate_Backup_Test : JSA.Tests.Intermediate_Backups.Test;
begin
return Suite : Test_Suite := Create_Suite ("JSA") do
Add_Static_Test (Suite, Intermediate_Backup_Test);
end return;
end Suite;
end JSA.Tests;
| 28.071429 | 69 | 0.727735 |
2242c350c331ad6dcff4c5951ea00c4460014f0a | 4,854 | adb | Ada | awa/plugins/awa-mail/src/awa-mail-modules.adb | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-mail/src/awa-mail-modules.adb | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-mail/src/awa-mail-modules.adb | twdroeger/ada-awa | 77b824773747aecb912c37b1b7b59ea414679b80 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-mail -- Mail module
-- Copyright (C) 2011, 2012, 2015, 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.
-----------------------------------------------------------------------
with AWA.Modules.Beans;
with AWA.Modules.Get;
with AWA.Mail.Beans;
with AWA.Mail.Components.Factory;
with AWA.Applications;
with Servlet.Core;
with ASF.Requests.Mockup;
with ASF.Responses.Mockup;
with Util.Beans.Basic;
with Util.Beans.Objects;
with Util.Log.Loggers;
package body AWA.Mail.Modules is
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Mail.Module");
package Register is new AWA.Modules.Beans (Module => Mail_Module,
Module_Access => Mail_Module_Access);
-- ------------------------------
-- Initialize the mail module.
-- ------------------------------
overriding
procedure Initialize (Plugin : in out Mail_Module;
App : in AWA.Modules.Application_Access;
Props : in ASF.Applications.Config) is
begin
Log.Info ("Initializing the mail module");
-- Add the Mail UI components.
App.Add_Components (AWA.Mail.Components.Factory.Definition);
-- Register here any bean class, servlet, filter.
Register.Register (Plugin => Plugin,
Name => "AWA.Mail.Beans.Mail_Bean",
Handler => AWA.Mail.Beans.Create_Mail_Bean'Access);
AWA.Modules.Module (Plugin).Initialize (App, Props);
end Initialize;
-- ------------------------------
-- Configures the module after its initialization and after having read its XML configuration.
-- ------------------------------
overriding
procedure Configure (Plugin : in out Mail_Module;
Props : in ASF.Applications.Config) is
Mailer : constant String := Props.Get ("mailer", "smtp");
begin
Log.Info ("Mail plugin is using {0} mailer", Mailer);
Plugin.Mailer := AWA.Mail.Clients.Factory (Mailer, Props);
end Configure;
-- ------------------------------
-- Create a new mail message.
-- ------------------------------
function Create_Message (Plugin : in Mail_Module)
return AWA.Mail.Clients.Mail_Message_Access is
begin
return Plugin.Mailer.Create_Message;
end Create_Message;
-- ------------------------------
-- Receive an event sent by another module with <b>Send_Event</b> method.
-- Format and send an email.
-- ------------------------------
procedure Send_Mail (Plugin : in Mail_Module;
Template : in String;
Props : in Util.Beans.Objects.Maps.Map;
Content : in AWA.Events.Module_Event'Class) is
Name : constant String := Content.Get_Parameter ("name");
begin
Log.Info ("Receive event {0} with template {1}", Name, Template);
if Template = "" then
Log.Debug ("No email template associated with event {0}", Name);
return;
end if;
declare
Req : ASF.Requests.Mockup.Request;
Reply : ASF.Responses.Mockup.Response;
Ptr : constant Util.Beans.Basic.Readonly_Bean_Access := Content'Unrestricted_Access;
Bean : constant Util.Beans.Objects.Object
:= Util.Beans.Objects.To_Object (Ptr, Util.Beans.Objects.STATIC);
Dispatcher : constant Servlet.Core.Request_Dispatcher
:= Plugin.Get_Application.Get_Request_Dispatcher (Template);
begin
Req.Set_Request_URI (Template);
Req.Set_Method ("GET");
Req.Set_Attribute (Name => "event", Value => Bean);
Req.Set_Attributes (Props);
Servlet.Core.Forward (Dispatcher, Req, Reply);
end;
end Send_Mail;
-- ------------------------------
-- Get the mail module instance associated with the current application.
-- ------------------------------
function Get_Mail_Module return Mail_Module_Access is
function Get is new AWA.Modules.Get (Mail_Module, Mail_Module_Access, NAME);
begin
return Get;
end Get_Mail_Module;
end AWA.Mail.Modules;
| 38.52381 | 98 | 0.58529 |
29f7703ab60bac56a414c343af9eb922430010a7 | 25,165 | ads | Ada | arch/ARM/NXP/svd/lpc55s6x/nxp_svd-puf.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/NXP/svd/lpc55s6x/nxp_svd-puf.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/NXP/svd/lpc55s6x/nxp_svd-puf.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2016-2019 NXP
-- All rights reserved.SPDX-License-Identifier: BSD-3-Clause
-- This spec has been automatically generated from LPC55S6x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package NXP_SVD.PUF is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- PUF Control register
type CTRL_Register is record
-- Begin Zeroize operation for PUF and go to Error state
zeroize : Boolean := False;
-- Begin Enroll operation
enroll : Boolean := False;
-- Begin Start operation
start : Boolean := False;
-- Begin Set Intrinsic Key operation
GENERATEKEY : Boolean := False;
-- Begin Set User Key operation
SETKEY : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Begin Get Key operation
GETKEY : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CTRL_Register use record
zeroize at 0 range 0 .. 0;
enroll at 0 range 1 .. 1;
start at 0 range 2 .. 2;
GENERATEKEY at 0 range 3 .. 3;
SETKEY at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
GETKEY at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype KEYINDEX_KEYIDX_Field is HAL.UInt4;
-- PUF Key Index register
type KEYINDEX_Register is record
-- Key index for Set Key operations
KEYIDX : KEYINDEX_KEYIDX_Field := 16#0#;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for KEYINDEX_Register use record
KEYIDX at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
subtype KEYSIZE_KEYSIZE_Field is HAL.UInt6;
-- PUF Key Size register
type KEYSIZE_Register is record
-- Key size for Set Key operations
KEYSIZE : KEYSIZE_KEYSIZE_Field := 16#0#;
-- unspecified
Reserved_6_31 : HAL.UInt26 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for KEYSIZE_Register use record
KEYSIZE at 0 range 0 .. 5;
Reserved_6_31 at 0 range 6 .. 31;
end record;
-- PUF Status register
type STAT_Register is record
-- Read-only. Indicates that operation is in progress
busy : Boolean;
-- Read-only. Last operation was successful
SUCCESS : Boolean;
-- Read-only. PUF is in the Error state and no operations can be
-- performed
error : Boolean;
-- unspecified
Reserved_3_3 : HAL.Bit;
-- Read-only. Request for next part of key
KEYINREQ : Boolean;
-- Read-only. Next part of key is available
KEYOUTAVAIL : Boolean;
-- Read-only. Request for next part of AC/KC
CODEINREQ : Boolean;
-- Read-only. Next part of AC/KC is available
CODEOUTAVAIL : Boolean;
-- unspecified
Reserved_8_31 : HAL.UInt24;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for STAT_Register use record
busy at 0 range 0 .. 0;
SUCCESS at 0 range 1 .. 1;
error at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
KEYINREQ at 0 range 4 .. 4;
KEYOUTAVAIL at 0 range 5 .. 5;
CODEINREQ at 0 range 6 .. 6;
CODEOUTAVAIL at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- PUF Allow register
type ALLOW_Register is record
-- Read-only. Enroll operation is allowed
ALLOWENROLL : Boolean;
-- Read-only. Start operation is allowed
ALLOWSTART : Boolean;
-- Read-only. Set Key operations are allowed
ALLOWSETKEY : Boolean;
-- Read-only. Get Key operation is allowed
ALLOWGETKEY : Boolean;
-- unspecified
Reserved_4_31 : HAL.UInt28;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ALLOW_Register use record
ALLOWENROLL at 0 range 0 .. 0;
ALLOWSTART at 0 range 1 .. 1;
ALLOWSETKEY at 0 range 2 .. 2;
ALLOWGETKEY at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
subtype KEYOUTINDEX_KEYOUTIDX_Field is HAL.UInt4;
-- PUF Key Output Index register
type KEYOUTINDEX_Register is record
-- Read-only. Key index for the key that is currently output via the Key
-- Output register
KEYOUTIDX : KEYOUTINDEX_KEYOUTIDX_Field;
-- unspecified
Reserved_4_31 : HAL.UInt28;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for KEYOUTINDEX_Register use record
KEYOUTIDX at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- PUF Interface Status and clear register
type IFSTAT_Register is record
-- Indicates that an APB error has occurred,Writing logic1 clears the
-- if_error bit
ERROR : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IFSTAT_Register use record
ERROR at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- PUF Interrupt Enable
type INTEN_Register is record
-- Enable corresponding interrupt. Note that bit numbers match those
-- assigned in QK_SR (Quiddikey Status Register)
READYEN : Boolean := False;
-- Enable corresponding interrupt. Note that bit numbers match those
-- assigned in QK_SR (Quiddikey Status Register)
SUCCESEN : Boolean := False;
-- Enable corresponding interrupt. Note that bit numbers match those
-- assigned in QK_SR (Quiddikey Status Register)
ERROREN : Boolean := False;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Enable corresponding interrupt. Note that bit numbers match those
-- assigned in QK_SR (Quiddikey Status Register)
KEYINREQEN : Boolean := False;
-- Enable corresponding interrupt. Note that bit numbers match those
-- assigned in QK_SR (Quiddikey Status Register)
KEYOUTAVAILEN : Boolean := False;
-- Enable corresponding interrupt. Note that bit numbers match those
-- assigned in QK_SR (Quiddikey Status Register)
CODEINREQEN : Boolean := False;
-- Enable corresponding interrupt. Note that bit numbers match those
-- assigned in QK_SR (Quiddikey Status Register)
CODEOUTAVAILEN : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for INTEN_Register use record
READYEN at 0 range 0 .. 0;
SUCCESEN at 0 range 1 .. 1;
ERROREN at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
KEYINREQEN at 0 range 4 .. 4;
KEYOUTAVAILEN at 0 range 5 .. 5;
CODEINREQEN at 0 range 6 .. 6;
CODEOUTAVAILEN at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- PUF interrupt status
type INTSTAT_Register is record
-- Triggers on falling edge of busy, write 1 to clear
READY : Boolean := False;
-- Level sensitive interrupt, cleared when interrupt source clears
SUCCESS : Boolean := False;
-- Level sensitive interrupt, cleared when interrupt source clears
ERROR : Boolean := False;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Level sensitive interrupt, cleared when interrupt source clears
KEYINREQ : Boolean := False;
-- Level sensitive interrupt, cleared when interrupt source clears
KEYOUTAVAIL : Boolean := False;
-- Level sensitive interrupt, cleared when interrupt source clears
CODEINREQ : Boolean := False;
-- Level sensitive interrupt, cleared when interrupt source clears
CODEOUTAVAIL : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for INTSTAT_Register use record
READY at 0 range 0 .. 0;
SUCCESS at 0 range 1 .. 1;
ERROR at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
KEYINREQ at 0 range 4 .. 4;
KEYOUTAVAIL at 0 range 5 .. 5;
CODEINREQ at 0 range 6 .. 6;
CODEOUTAVAIL at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- PUF RAM Power Control
type PWRCTRL_Register is record
-- Power on the PUF RAM.
RAMON : Boolean := False;
-- PUF RAM status.
RAMSTAT : Boolean := False;
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#3E#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PWRCTRL_Register use record
RAMON at 0 range 0 .. 0;
RAMSTAT at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-- PUF config register for block bits
type CFG_Register is record
-- Block enroll operation. Write 1 to set, cleared on reset.
BLOCKENROLL_SETKEY : Boolean := False;
-- Block set key operation. Write 1 to set, cleared on reset.
BLOCKKEYOUTPUT : Boolean := False;
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CFG_Register use record
BLOCKENROLL_SETKEY at 0 range 0 .. 0;
BLOCKKEYOUTPUT at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-- KEYLOCK_KEY array element
subtype KEYLOCK_KEY_Element is HAL.UInt2;
-- KEYLOCK_KEY array
type KEYLOCK_KEY_Field_Array is array (0 .. 3) of KEYLOCK_KEY_Element
with Component_Size => 2, Size => 8;
-- Type definition for KEYLOCK_KEY
type KEYLOCK_KEY_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- KEY as a value
Val : HAL.UInt8;
when True =>
-- KEY as an array
Arr : KEYLOCK_KEY_Field_Array;
end case;
end record
with Unchecked_Union, Size => 8;
for KEYLOCK_KEY_Field use record
Val at 0 range 0 .. 7;
Arr at 0 range 0 .. 7;
end record;
-- Only reset in case of full IC reset
type KEYLOCK_Register is record
-- "10:Write access to KEY0MASK, KEYENABLE.KEY0 and KEYRESET.KEY0 is
-- allowed. 00, 01, 11:Write access to KEY0MASK, KEYENABLE.KEY0 and
-- KEYRESET.KEY0 is NOT allowed. Important Note : Once this field is
-- written with a value different from '10', its value can no longer be
-- modified until un Power On Reset occurs."
KEY : KEYLOCK_KEY_Field := (As_Array => False, Val => 16#2#);
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for KEYLOCK_Register use record
KEY at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- KEYENABLE_KEY array element
subtype KEYENABLE_KEY_Element is HAL.UInt2;
-- KEYENABLE_KEY array
type KEYENABLE_KEY_Field_Array is array (0 .. 3) of KEYENABLE_KEY_Element
with Component_Size => 2, Size => 8;
-- Type definition for KEYENABLE_KEY
type KEYENABLE_KEY_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- KEY as a value
Val : HAL.UInt8;
when True =>
-- KEY as an array
Arr : KEYENABLE_KEY_Field_Array;
end case;
end record
with Unchecked_Union, Size => 8;
for KEYENABLE_KEY_Field use record
Val at 0 range 0 .. 7;
Arr at 0 range 0 .. 7;
end record;
-- no description available
type KEYENABLE_Register is record
-- "10: Data coming out from PUF Index 0 interface are shifted in KEY0
-- register. 00, 01, 11 : Data coming out from PUF Index 0 interface are
-- NOT shifted in KEY0 register."
KEY : KEYENABLE_KEY_Field :=
(As_Array => False, Val => 16#1#);
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for KEYENABLE_Register use record
KEY at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- KEYRESET_KEY array element
subtype KEYRESET_KEY_Element is HAL.UInt2;
-- KEYRESET_KEY array
type KEYRESET_KEY_Field_Array is array (0 .. 3) of KEYRESET_KEY_Element
with Component_Size => 2, Size => 8;
-- Type definition for KEYRESET_KEY
type KEYRESET_KEY_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- KEY as a value
Val : HAL.UInt8;
when True =>
-- KEY as an array
Arr : KEYRESET_KEY_Field_Array;
end case;
end record
with Unchecked_Union, Size => 8;
for KEYRESET_KEY_Field use record
Val at 0 range 0 .. 7;
Arr at 0 range 0 .. 7;
end record;
-- Reinitialize Keys shift registers counters
type KEYRESET_Register is record
-- Write-only. 10: Reset KEY0 shift register. Self clearing. Must be
-- done before loading any new key.
KEY : KEYRESET_KEY_Field := (As_Array => False, Val => 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 KEYRESET_Register use record
KEY at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- IDXBLK_L_IDX array element
subtype IDXBLK_L_IDX_Element is HAL.UInt2;
-- IDXBLK_L_IDX array
type IDXBLK_L_IDX_Field_Array is array (1 .. 7) of IDXBLK_L_IDX_Element
with Component_Size => 2, Size => 14;
-- Type definition for IDXBLK_L_IDX
type IDXBLK_L_IDX_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- IDX as a value
Val : HAL.UInt14;
when True =>
-- IDX as an array
Arr : IDXBLK_L_IDX_Field_Array;
end case;
end record
with Unchecked_Union, Size => 14;
for IDXBLK_L_IDX_Field use record
Val at 0 range 0 .. 13;
Arr at 0 range 0 .. 13;
end record;
subtype IDXBLK_L_LOCK_IDX_Field is HAL.UInt2;
-- no description available
type IDXBLK_L_Register is record
-- unspecified
Reserved_0_1 : HAL.UInt2 := 16#2#;
-- Use to block PUF index 1
IDX : IDXBLK_L_IDX_Field :=
(As_Array => False, Val => 16#2#);
-- unspecified
Reserved_16_29 : HAL.UInt14 := 16#0#;
-- Write-only. Lock 0 to 7 PUF key indexes
LOCK_IDX : IDXBLK_L_LOCK_IDX_Field := 16#2#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IDXBLK_L_Register use record
Reserved_0_1 at 0 range 0 .. 1;
IDX at 0 range 2 .. 15;
Reserved_16_29 at 0 range 16 .. 29;
LOCK_IDX at 0 range 30 .. 31;
end record;
-- IDXBLK_H_DP_IDX array element
subtype IDXBLK_H_DP_IDX_Element is HAL.UInt2;
-- IDXBLK_H_DP_IDX array
type IDXBLK_H_DP_IDX_Field_Array is array (8 .. 15)
of IDXBLK_H_DP_IDX_Element
with Component_Size => 2, Size => 16;
-- Type definition for IDXBLK_H_DP_IDX
type IDXBLK_H_DP_IDX_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- IDX as a value
Val : HAL.UInt16;
when True =>
-- IDX as an array
Arr : IDXBLK_H_DP_IDX_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for IDXBLK_H_DP_IDX_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- no description available
type IDXBLK_H_DP_Register is record
-- Use to block PUF index 8
IDX : IDXBLK_H_DP_IDX_Field :=
(As_Array => False, Val => 16#2#);
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IDXBLK_H_DP_Register use record
IDX at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- Only reset in case of full IC reset
-- Only reset in case of full IC reset
type KEYMASK_Registers is array (0 .. 3) of HAL.UInt32
with Volatile;
-- IDXBLK_H_IDX array element
subtype IDXBLK_H_IDX_Element is HAL.UInt2;
-- IDXBLK_H_IDX array
type IDXBLK_H_IDX_Field_Array is array (8 .. 15) of IDXBLK_H_IDX_Element
with Component_Size => 2, Size => 16;
-- Type definition for IDXBLK_H_IDX
type IDXBLK_H_IDX_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- IDX as a value
Val : HAL.UInt16;
when True =>
-- IDX as an array
Arr : IDXBLK_H_IDX_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for IDXBLK_H_IDX_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
subtype IDXBLK_H_LOCK_IDX_Field is HAL.UInt2;
-- no description available
type IDXBLK_H_Register is record
-- Use to block PUF index 8
IDX : IDXBLK_H_IDX_Field :=
(As_Array => False, Val => 16#2#);
-- unspecified
Reserved_16_29 : HAL.UInt14 := 16#0#;
-- Write-only. Lock 8 to 15 PUF key indexes
LOCK_IDX : IDXBLK_H_LOCK_IDX_Field := 16#2#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IDXBLK_H_Register use record
IDX at 0 range 0 .. 15;
Reserved_16_29 at 0 range 16 .. 29;
LOCK_IDX at 0 range 30 .. 31;
end record;
-- IDXBLK_L_DP_IDX array element
subtype IDXBLK_L_DP_IDX_Element is HAL.UInt2;
-- IDXBLK_L_DP_IDX array
type IDXBLK_L_DP_IDX_Field_Array is array (1 .. 7)
of IDXBLK_L_DP_IDX_Element
with Component_Size => 2, Size => 14;
-- Type definition for IDXBLK_L_DP_IDX
type IDXBLK_L_DP_IDX_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- IDX as a value
Val : HAL.UInt14;
when True =>
-- IDX as an array
Arr : IDXBLK_L_DP_IDX_Field_Array;
end case;
end record
with Unchecked_Union, Size => 14;
for IDXBLK_L_DP_IDX_Field use record
Val at 0 range 0 .. 13;
Arr at 0 range 0 .. 13;
end record;
-- no description available
type IDXBLK_L_DP_Register is record
-- unspecified
Reserved_0_1 : HAL.UInt2 := 16#2#;
-- Use to block PUF index 1
IDX : IDXBLK_L_DP_IDX_Field :=
(As_Array => False, Val => 16#2#);
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IDXBLK_L_DP_Register use record
Reserved_0_1 at 0 range 0 .. 1;
IDX at 0 range 2 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- SHIFT_STATUS_KEY array element
subtype SHIFT_STATUS_KEY_Element is HAL.UInt4;
-- SHIFT_STATUS_KEY array
type SHIFT_STATUS_KEY_Field_Array is array (0 .. 3)
of SHIFT_STATUS_KEY_Element
with Component_Size => 4, Size => 16;
-- Type definition for SHIFT_STATUS_KEY
type SHIFT_STATUS_KEY_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- KEY as a value
Val : HAL.UInt16;
when True =>
-- KEY as an array
Arr : SHIFT_STATUS_KEY_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for SHIFT_STATUS_KEY_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- no description available
type SHIFT_STATUS_Register is record
-- Read-only. Index counter from key 0 shift register
KEY : SHIFT_STATUS_KEY_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SHIFT_STATUS_Register use record
KEY at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- PUFCTRL
type PUF_Peripheral is record
-- PUF Control register
CTRL : aliased CTRL_Register;
-- PUF Key Index register
KEYINDEX : aliased KEYINDEX_Register;
-- PUF Key Size register
KEYSIZE : aliased KEYSIZE_Register;
-- PUF Status register
STAT : aliased STAT_Register;
-- PUF Allow register
ALLOW : aliased ALLOW_Register;
-- PUF Key Input register
KEYINPUT : aliased HAL.UInt32;
-- PUF Code Input register
CODEINPUT : aliased HAL.UInt32;
-- PUF Code Output register
CODEOUTPUT : aliased HAL.UInt32;
-- PUF Key Output Index register
KEYOUTINDEX : aliased KEYOUTINDEX_Register;
-- PUF Key Output register
KEYOUTPUT : aliased HAL.UInt32;
-- PUF Interface Status and clear register
IFSTAT : aliased IFSTAT_Register;
-- PUF version register.
VERSION : aliased HAL.UInt32;
-- PUF Interrupt Enable
INTEN : aliased INTEN_Register;
-- PUF interrupt status
INTSTAT : aliased INTSTAT_Register;
-- PUF RAM Power Control
PWRCTRL : aliased PWRCTRL_Register;
-- PUF config register for block bits
CFG : aliased CFG_Register;
-- Only reset in case of full IC reset
KEYLOCK : aliased KEYLOCK_Register;
-- no description available
KEYENABLE : aliased KEYENABLE_Register;
-- Reinitialize Keys shift registers counters
KEYRESET : aliased KEYRESET_Register;
-- no description available
IDXBLK_L : aliased IDXBLK_L_Register;
-- no description available
IDXBLK_H_DP : aliased IDXBLK_H_DP_Register;
-- Only reset in case of full IC reset
KEYMASK : aliased KEYMASK_Registers;
-- no description available
IDXBLK_H : aliased IDXBLK_H_Register;
-- no description available
IDXBLK_L_DP : aliased IDXBLK_L_DP_Register;
-- no description available
SHIFT_STATUS : aliased SHIFT_STATUS_Register;
end record
with Volatile;
for PUF_Peripheral use record
CTRL at 16#0# range 0 .. 31;
KEYINDEX at 16#4# range 0 .. 31;
KEYSIZE at 16#8# range 0 .. 31;
STAT at 16#20# range 0 .. 31;
ALLOW at 16#28# range 0 .. 31;
KEYINPUT at 16#40# range 0 .. 31;
CODEINPUT at 16#44# range 0 .. 31;
CODEOUTPUT at 16#48# range 0 .. 31;
KEYOUTINDEX at 16#60# range 0 .. 31;
KEYOUTPUT at 16#64# range 0 .. 31;
IFSTAT at 16#DC# range 0 .. 31;
VERSION at 16#FC# range 0 .. 31;
INTEN at 16#100# range 0 .. 31;
INTSTAT at 16#104# range 0 .. 31;
PWRCTRL at 16#108# range 0 .. 31;
CFG at 16#10C# range 0 .. 31;
KEYLOCK at 16#200# range 0 .. 31;
KEYENABLE at 16#204# range 0 .. 31;
KEYRESET at 16#208# range 0 .. 31;
IDXBLK_L at 16#20C# range 0 .. 31;
IDXBLK_H_DP at 16#210# range 0 .. 31;
KEYMASK at 16#214# range 0 .. 127;
IDXBLK_H at 16#254# range 0 .. 31;
IDXBLK_L_DP at 16#258# range 0 .. 31;
SHIFT_STATUS at 16#25C# range 0 .. 31;
end record;
-- PUFCTRL
PUF_Periph : aliased PUF_Peripheral
with Import, Address => System'To_Address (16#4003B000#);
end NXP_SVD.PUF;
| 32.981651 | 79 | 0.605126 |
040ce014598aa9785ef31909511c745d39c3161a | 5,162 | ads | Ada | source/amf/uml/amf-uml-information_items-collections.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-information_items-collections.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-information_items-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 © 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.Generic_Collections;
package AMF.UML.Information_Items.Collections is
pragma Preelaborate;
package UML_Information_Item_Collections is
new AMF.Generic_Collections
(UML_Information_Item,
UML_Information_Item_Access);
type Set_Of_UML_Information_Item is
new UML_Information_Item_Collections.Set with null record;
Empty_Set_Of_UML_Information_Item : constant Set_Of_UML_Information_Item;
type Ordered_Set_Of_UML_Information_Item is
new UML_Information_Item_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UML_Information_Item : constant Ordered_Set_Of_UML_Information_Item;
type Bag_Of_UML_Information_Item is
new UML_Information_Item_Collections.Bag with null record;
Empty_Bag_Of_UML_Information_Item : constant Bag_Of_UML_Information_Item;
type Sequence_Of_UML_Information_Item is
new UML_Information_Item_Collections.Sequence with null record;
Empty_Sequence_Of_UML_Information_Item : constant Sequence_Of_UML_Information_Item;
private
Empty_Set_Of_UML_Information_Item : constant Set_Of_UML_Information_Item
:= (UML_Information_Item_Collections.Set with null record);
Empty_Ordered_Set_Of_UML_Information_Item : constant Ordered_Set_Of_UML_Information_Item
:= (UML_Information_Item_Collections.Ordered_Set with null record);
Empty_Bag_Of_UML_Information_Item : constant Bag_Of_UML_Information_Item
:= (UML_Information_Item_Collections.Bag with null record);
Empty_Sequence_Of_UML_Information_Item : constant Sequence_Of_UML_Information_Item
:= (UML_Information_Item_Collections.Sequence with null record);
end AMF.UML.Information_Items.Collections;
| 56.108696 | 92 | 0.531383 |
1abd6dc4bd6c2a450c8fca1a93e0bda44ba8f70a | 30,152 | adb | Ada | tools-src/gnu/gcc/gcc/ada/a-tasatt.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/a-tasatt.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/a-tasatt.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T A S K _ A T T R I B U T E S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1991-2000 Florida State University --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. It is --
-- now maintained by Ada Core Technologies Inc. in cooperation with Florida --
-- State University (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- The following notes are provided in case someone decides the
-- implementation of this package is too complicated, or too slow.
-- Please read this before making any "simplifications".
-- Correct implementation of this package is more difficult than one
-- might expect. After considering (and coding) several alternatives,
-- we settled on the present compromise. Things we do not like about
-- this implementation include:
-- - It is vulnerable to bad Task_ID values, to the extent of
-- possibly trashing memory and crashing the runtime system.
-- - It requires dynamic storage allocation for each new attribute value,
-- except for types that happen to be the same size as System.Address,
-- or shorter.
-- - Instantiations at other than the library level rely on being able to
-- do down-level calls to a procedure declared in the generic package body.
-- This makes it potentially vulnerable to compiler changes.
-- The main implementation issue here is that the connection from
-- task to attribute is a potential source of dangling references.
-- When a task goes away, we want to be able to recover all the storage
-- associated with its attributes. The Ada mechanism for this is
-- finalization, via controlled attribute types. For this reason,
-- the ARM requires finalization of attribute values when the
-- associated task terminates.
-- This finalization must be triggered by the tasking runtime system,
-- during termination of the task. Given the active set of instantiations
-- of Ada.Task_Attributes is dynamic, the number and types of attributes
-- belonging to a task will not be known until the task actually terminates.
-- Some of these types may be controlled and some may not. The RTS must find
-- some way to determine which of these attributes need finalization, and
-- invoke the appropriate finalization on them.
-- One way this might be done is to create a special finalization chain
-- for each task, similar to the finalization chain that is used for
-- controlled objects within the task. This would differ from the usual
-- finalization chain in that it would not have a LIFO structure, since
-- attributes may be added to a task at any time during its lifetime.
-- This might be the right way to go for the longer term, but at present
-- this approach is not open, since GNAT does not provide such special
-- finalization support.
-- Lacking special compiler support, the RTS is limited to the
-- normal ways an application invokes finalization, i.e.
-- a) Explicit call to the procedure Finalize, if we know the type
-- has this operation defined on it. This is not sufficient, since
-- we have no way of determining whether a given generic formal
-- Attribute type is controlled, and no visibility of the associated
-- Finalize procedure, in the generic body.
-- b) Leaving the scope of a local object of a controlled type.
-- This does not help, since the lifetime of an instantiation of
-- Ada.Task_Attributes does not correspond to the lifetimes of the
-- various tasks which may have that attribute.
-- c) Assignment of another value to the object. This would not help,
-- since we then have to finalize the new value of the object.
-- d) Unchecked deallocation of an object of a controlled type.
-- This seems to be the only mechanism available to the runtime
-- system for finalization of task attributes.
-- We considered two ways of using unchecked deallocation, both based
-- on a linked list of that would hang from the task control block.
-- In the first approach the objects on the attribute list are all derived
-- from one controlled type, say T, and are linked using an access type to
-- T'Class. The runtime system has an Unchecked_Deallocation for T'Class
-- with access type T'Class, and uses this to deallocate and finalize all
-- the items in the list. The limitation of this approach is that each
-- instantiation of the package Ada.Task_Attributes derives a new record
-- extension of T, and since T is controlled (RM 3.9.1 (3)), instantiation
-- is only allowed at the library level.
-- In the second approach the objects on the attribute list are of
-- unrelated but structurally similar types. Unchecked conversion is
-- used to circument Ada type checking. Each attribute-storage node
-- contains not only the attribute value and a link for chaining, but
-- also a pointer to a descriptor for the corresponding instantiation
-- of Task_Attributes. The instantiation-descriptor contains a
-- pointer to a procedure that can do the correct deallocation and
-- finalization for that type of attribute. On task termination, the
-- runtime system uses the pointer to call the appropriate deallocator.
-- While this gets around the limitation that instantiations be at
-- the library level, it relies on an implementation feature that
-- may not always be safe, i.e. that it is safe to call the
-- Deallocate procedure for an instantiation of Ada.Task_Attributes
-- that no longer exists. In general, it seems this might result in
-- dangling references.
-- Another problem with instantiations deeper than the library level
-- is that there is risk of storage leakage, or dangling references
-- to reused storage. That is, if an instantiation of Ada.Task_Attributes
-- is made within a procedure, what happens to the storage allocated for
-- attributes, when the procedure call returns? Apparently (RM 7.6.1 (4))
-- any such objects must be finalized, since they will no longer be
-- accessible, and in general one would expect that the storage they occupy
-- would be recovered for later reuse. (If not, we would have a case of
-- storage leakage.) Assuming the storage is recovered and later reused,
-- we have potentially dangerous dangling references. When the procedure
-- containing the instantiation of Ada.Task_Attributes returns, there
-- may still be unterminated tasks with associated attribute values for
-- that instantiation. When such tasks eventually terminate, the RTS
-- will attempt to call the Deallocate procedure on them. If the
-- corresponding storage has already been deallocated, when the master
-- of the access type was left, we have a potential disaster. This
-- disaster is compounded since the pointer to Deallocate is probably
-- through a "trampoline" which will also have been destroyed.
-- For this reason, we arrange to remove all dangling references
-- before leaving the scope of an instantiation. This is ugly, since
-- it requires traversing the list of all tasks, but it is no more ugly
-- than a similar traversal that we must do at the point of instantiation
-- in order to initialize the attributes of all tasks. At least we only
-- need to do these traversals if the type is controlled.
-- We chose to defer allocation of storage for attributes until the
-- Reference function is called or the attribute is first set to a value
-- different from the default initial one. This allows a potential
-- savings in allocation, for attributes that are not used by all tasks.
-- For efficiency, we reserve space in the TCB for a fixed number of
-- direct-access attributes. These are required to be of a size that
-- fits in the space of an object of type System.Address. Because
-- we must use unchecked bitwise copy operations on these values, they
-- cannot be of a controlled type, but that is covered automatically
-- since controlled objects are too large to fit in the spaces.
-- We originally deferred the initialization of these direct-access
-- attributes, just as we do for the indirect-access attributes, and
-- used a per-task bit vector to keep track of which attributes were
-- currently defined for that task. We found that the overhead of
-- maintaining this bit-vector seriously slowed down access to the
-- attributes, and made the fetch operation non-atomic, so that even
-- to read an attribute value required locking the TCB. Therefore,
-- we now initialize such attributes for all existing tasks at the time
-- of the attribute instantiation, and initialize existing attributes
-- for each new task at the time it is created.
-- The latter initialization requires a list of all the instantiation
-- descriptors. Updates to this list, as well as the bit-vector that
-- is used to reserve slots for attributes in the TCB, require mutual
-- exclusion. That is provided by the lock
-- System.Tasking.Task_Attributes.All_Attrs_L.
-- One special problem that added complexity to the design is that
-- the per-task list of indirect attributes contains objects of
-- different types. We use unchecked pointer conversion to link
-- these nodes together and access them, but the records may not have
-- identical internal structure. Initially, we thought it would be
-- enough to allocate all the common components of the records at the
-- front of each record, so that their positions would correspond.
-- Unfortunately, GNAT adds "dope" information at the front of a record,
-- if the record contains any controlled-type components.
--
-- This means that the offset of the fields we use to link the nodes is
-- at different positions on nodes of different types. To get around this,
-- each attribute storage record consists of a core node and wrapper.
-- The core nodes are all of the same type, and it is these that are
-- linked together and generally "seen" by the RTS. Each core node
-- contains a pointer to its own wrapper, which is a record that contains
-- the core node along with an attribute value, approximately
-- as follows:
-- type Node;
-- type Node_Access is access all Node;
-- type Node_Access;
-- type Access_Wrapper is access all Wrapper;
-- type Node is record
-- Next : Node_Access;
-- ...
-- Wrapper : Access_Wrapper;
-- end record;
-- type Wrapper is record
-- Noed : aliased Node;
-- Value : aliased Attribute; -- the generic formal type
-- end record;
-- Another interesting problem is with the initialization of
-- the instantiation descriptors. Originally, we did this all via
-- the Initialize procedure of the descriptor type and code in the
-- package body. It turned out that the Initialize procedure needed
-- quite a bit of information, including the size of the attribute
-- type, the initial value of the attribute (if it fits in the TCB),
-- and a pointer to the deallocator procedure. These needed to be
-- "passed" in via access discriminants. GNAT was having trouble
-- with access discriminants, so all this work was moved to the
-- package body.
with Ada.Task_Identification;
-- used for Task_Id
-- Null_Task_ID
-- Current_Task
with System.Error_Reporting;
-- used for Shutdown;
with System.Storage_Elements;
-- used for Integer_Address
with System.Task_Primitives.Operations;
-- used for Write_Lock
-- Unlock
-- Lock/Unlock_All_Tasks_List
with System.Tasking;
-- used for Access_Address
-- Task_ID
-- Direct_Index_Vector
-- Direct_Index
with System.Tasking.Initialization;
-- used for Defer_Abortion
-- Undefer_Abortion
-- Initialize_Attributes_Link
-- Finalize_Attributes_Link
with System.Tasking.Task_Attributes;
-- used for Access_Node
-- Access_Dummy_Wrapper
-- Deallocator
-- Instance
-- Node
-- Access_Instance
with Ada.Exceptions;
-- used for Raise_Exception
with Unchecked_Conversion;
with Unchecked_Deallocation;
pragma Elaborate_All (System.Tasking.Task_Attributes);
-- to ensure the initialization of object Local (below) will work
package body Ada.Task_Attributes is
use System.Error_Reporting,
System.Tasking.Initialization,
System.Tasking,
System.Tasking.Task_Attributes,
Ada.Exceptions;
use type System.Tasking.Access_Address;
package POP renames System.Task_Primitives.Operations;
---------------------------
-- Unchecked Conversions --
---------------------------
pragma Warnings (Off);
-- These unchecked conversions can give warnings when alignments
-- are incorrect, but they will not be used in such cases anyway,
-- so the warnings can be safely ignored.
-- The following type corresponds to Dummy_Wrapper,
-- declared in System.Tasking.Task_Attributes.
type Wrapper;
type Access_Wrapper is access all Wrapper;
function To_Attribute_Handle is new Unchecked_Conversion
(Access_Address, Attribute_Handle);
-- For reference to directly addressed task attributes
type Access_Integer_Address is access all
System.Storage_Elements.Integer_Address;
function To_Attribute_Handle is new Unchecked_Conversion
(Access_Integer_Address, Attribute_Handle);
-- For reference to directly addressed task attributes
function To_Access_Address is new Unchecked_Conversion
(Access_Node, Access_Address);
-- To store pointer to list of indirect attributes
function To_Access_Node is new Unchecked_Conversion
(Access_Address, Access_Node);
-- To fetch pointer to list of indirect attributes
function To_Access_Wrapper is new Unchecked_Conversion
(Access_Dummy_Wrapper, Access_Wrapper);
-- To fetch pointer to actual wrapper of attribute node
function To_Access_Dummy_Wrapper is new Unchecked_Conversion
(Access_Wrapper, Access_Dummy_Wrapper);
-- To store pointer to actual wrapper of attribute node
function To_Task_ID is new Unchecked_Conversion
(Task_Identification.Task_Id, Task_ID);
-- To access TCB of identified task
Null_ID : constant Task_ID := To_Task_ID (Task_Identification.Null_Task_Id);
-- ??? need comments on use and purpose
type Local_Deallocator is
access procedure (P : in out Access_Node);
function To_Lib_Level_Deallocator is new Unchecked_Conversion
(Local_Deallocator, Deallocator);
-- To defeat accessibility check
pragma Warnings (On);
------------------------
-- Storage Management --
------------------------
procedure Deallocate (P : in out Access_Node);
-- Passed to the RTS via unchecked conversion of a pointer to
-- permit finalization and deallocation of attribute storage nodes
--------------------------
-- Instantiation Record --
--------------------------
Local : aliased Instance;
-- Initialized in package body
type Wrapper is record
Noed : aliased Node;
Value : aliased Attribute := Initial_Value;
-- The generic formal type, may be controlled
end record;
procedure Free is
new Unchecked_Deallocation (Wrapper, Access_Wrapper);
procedure Deallocate (P : in out Access_Node) is
T : Access_Wrapper := To_Access_Wrapper (P.Wrapper);
begin
Free (T);
exception
when others =>
pragma Assert (Shutdown ("Exception in Deallocate")); null;
end Deallocate;
---------------
-- Reference --
---------------
function Reference
(T : Task_Identification.Task_Id := Task_Identification.Current_Task)
return Attribute_Handle
is
TT : Task_ID := To_Task_ID (T);
Error_Message : constant String := "Trying to get the reference of a";
begin
if TT = Null_ID then
Raise_Exception (Program_Error'Identity,
Error_Message & "null task");
end if;
if TT.Common.State = Terminated then
Raise_Exception (Tasking_Error'Identity,
Error_Message & "terminated task");
end if;
begin
Defer_Abortion;
POP.Write_Lock (All_Attrs_L'Access);
if Local.Index /= 0 then
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
return
To_Attribute_Handle (TT.Direct_Attributes (Local.Index)'Access);
else
declare
P : Access_Node := To_Access_Node (TT.Indirect_Attributes);
W : Access_Wrapper;
begin
while P /= null loop
if P.Instance = Access_Instance'(Local'Unchecked_Access) then
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
return To_Access_Wrapper (P.Wrapper).Value'Access;
end if;
P := P.Next;
end loop;
-- Unlock All_Attrs_L here to follow the lock ordering rule
-- that prevent us from using new (i.e the Global_Lock) while
-- holding any other lock.
POP.Unlock (All_Attrs_L'Access);
W := new Wrapper'
((null, Local'Unchecked_Access, null), Initial_Value);
POP.Write_Lock (All_Attrs_L'Access);
P := W.Noed'Unchecked_Access;
P.Wrapper := To_Access_Dummy_Wrapper (W);
P.Next := To_Access_Node (TT.Indirect_Attributes);
TT.Indirect_Attributes := To_Access_Address (P);
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
return W.Value'Access;
end;
end if;
pragma Assert (Shutdown ("Should never get here in Reference"));
return null;
exception
when others =>
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
raise;
end;
exception
when Tasking_Error | Program_Error =>
raise;
when others =>
raise Program_Error;
end Reference;
------------------
-- Reinitialize --
------------------
procedure Reinitialize
(T : Task_Identification.Task_Id := Task_Identification.Current_Task)
is
TT : Task_ID := To_Task_ID (T);
Error_Message : constant String := "Trying to Reinitialize a";
begin
if TT = Null_ID then
Raise_Exception (Program_Error'Identity,
Error_Message & "null task");
end if;
if TT.Common.State = Terminated then
Raise_Exception (Tasking_Error'Identity,
Error_Message & "terminated task");
end if;
if Local.Index = 0 then
declare
P, Q : Access_Node;
W : Access_Wrapper;
begin
Defer_Abortion;
POP.Write_Lock (All_Attrs_L'Access);
Q := To_Access_Node (TT.Indirect_Attributes);
while Q /= null loop
if Q.Instance = Access_Instance'(Local'Unchecked_Access) then
if P = null then
TT.Indirect_Attributes := To_Access_Address (Q.Next);
else
P.Next := Q.Next;
end if;
W := To_Access_Wrapper (Q.Wrapper);
Free (W);
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
return;
end if;
P := Q;
Q := Q.Next;
end loop;
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
exception
when others =>
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
end;
else
Set_Value (Initial_Value, T);
end if;
exception
when Tasking_Error | Program_Error =>
raise;
when others =>
raise Program_Error;
end Reinitialize;
---------------
-- Set_Value --
---------------
procedure Set_Value
(Val : Attribute;
T : Task_Identification.Task_Id := Task_Identification.Current_Task)
is
TT : Task_ID := To_Task_ID (T);
Error_Message : constant String := "Trying to Set the Value of a";
begin
if TT = Null_ID then
Raise_Exception (Program_Error'Identity,
Error_Message & "null task");
end if;
if TT.Common.State = Terminated then
Raise_Exception (Tasking_Error'Identity,
Error_Message & "terminated task");
end if;
begin
Defer_Abortion;
POP.Write_Lock (All_Attrs_L'Access);
if Local.Index /= 0 then
To_Attribute_Handle
(TT.Direct_Attributes (Local.Index)'Access).all := Val;
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
return;
else
declare
P : Access_Node := To_Access_Node (TT.Indirect_Attributes);
W : Access_Wrapper;
begin
while P /= null loop
if P.Instance = Access_Instance'(Local'Unchecked_Access) then
To_Access_Wrapper (P.Wrapper).Value := Val;
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
return;
end if;
P := P.Next;
end loop;
-- Unlock TT here to follow the lock ordering rule that
-- prevent us from using new (i.e the Global_Lock) while
-- holding any other lock.
POP.Unlock (All_Attrs_L'Access);
W := new Wrapper'
((null, Local'Unchecked_Access, null), Val);
POP.Write_Lock (All_Attrs_L'Access);
P := W.Noed'Unchecked_Access;
P.Wrapper := To_Access_Dummy_Wrapper (W);
P.Next := To_Access_Node (TT.Indirect_Attributes);
TT.Indirect_Attributes := To_Access_Address (P);
end;
end if;
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
exception
when others =>
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
raise;
end;
return;
exception
when Tasking_Error | Program_Error =>
raise;
when others =>
raise Program_Error;
end Set_Value;
-----------
-- Value --
-----------
function Value
(T : Task_Identification.Task_Id := Task_Identification.Current_Task)
return Attribute
is
Result : Attribute;
TT : Task_ID := To_Task_ID (T);
Error_Message : constant String := "Trying to get the Value of a";
begin
if TT = Null_ID then
Raise_Exception
(Program_Error'Identity, Error_Message & "null task");
end if;
if TT.Common.State = Terminated then
Raise_Exception
(Program_Error'Identity, Error_Message & "terminated task");
end if;
begin
if Local.Index /= 0 then
Result :=
To_Attribute_Handle
(TT.Direct_Attributes (Local.Index)'Access).all;
else
declare
P : Access_Node;
begin
Defer_Abortion;
POP.Write_Lock (All_Attrs_L'Access);
P := To_Access_Node (TT.Indirect_Attributes);
while P /= null loop
if P.Instance = Access_Instance'(Local'Unchecked_Access) then
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
return To_Access_Wrapper (P.Wrapper).Value;
end if;
P := P.Next;
end loop;
Result := Initial_Value;
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
exception
when others =>
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
raise;
end;
end if;
return Result;
end;
exception
when Tasking_Error | Program_Error =>
raise;
when others =>
raise Program_Error;
end Value;
-- Start of elaboration code for package Ada.Task_Attributes
begin
-- This unchecked conversion can give warnings when alignments
-- are incorrect, but they will not be used in such cases anyway,
-- so the warnings can be safely ignored.
pragma Warnings (Off);
Local.Deallocate := To_Lib_Level_Deallocator (Deallocate'Access);
pragma Warnings (On);
declare
Two_To_J : Direct_Index_Vector;
begin
Defer_Abortion;
POP.Write_Lock (All_Attrs_L'Access);
-- Add this instantiation to the list of all instantiations.
Local.Next := System.Tasking.Task_Attributes.All_Attributes;
System.Tasking.Task_Attributes.All_Attributes :=
Local'Unchecked_Access;
-- Try to find space for the attribute in the TCB.
Local.Index := 0;
Two_To_J := 2 ** Direct_Index'First;
if Attribute'Size <= System.Address'Size then
for J in Direct_Index loop
if (Two_To_J and In_Use) /= 0 then
-- Reserve location J for this attribute
In_Use := In_Use or Two_To_J;
Local.Index := J;
-- This unchecked conversions can give a warning when the
-- the alignment is incorrect, but it will not be used in
-- such a case anyway, so the warning can be safely ignored.
pragma Warnings (Off);
To_Attribute_Handle (Local.Initial_Value'Access).all :=
Initial_Value;
pragma Warnings (On);
exit;
end if;
Two_To_J := Two_To_J * 2;
end loop;
end if;
-- Need protection of All_Tasks_L for updating links to
-- per-task initialization and finalization routines,
-- in case some task is being created or terminated concurrently.
POP.Lock_All_Tasks_List;
-- Attribute goes directly in the TCB
if Local.Index /= 0 then
-- Replace stub for initialization routine
-- that is called at task creation.
Initialization.Initialize_Attributes_Link :=
System.Tasking.Task_Attributes.Initialize_Attributes'Access;
-- Initialize the attribute, for all tasks.
declare
C : System.Tasking.Task_ID := System.Tasking.All_Tasks_List;
begin
while C /= null loop
POP.Write_Lock (C);
C.Direct_Attributes (Local.Index) :=
System.Storage_Elements.To_Address (Local.Initial_Value);
POP.Unlock (C);
C := C.Common.All_Tasks_Link;
end loop;
end;
-- Attribute goes into a node onto a linked list
else
-- Replace stub for finalization routine
-- that is called at task termination.
Initialization.Finalize_Attributes_Link :=
System.Tasking.Task_Attributes.Finalize_Attributes'Access;
end if;
POP.Unlock_All_Tasks_List;
POP.Unlock (All_Attrs_L'Access);
Undefer_Abortion;
exception
when others => null;
pragma Assert (Shutdown ("Exception in task attribute initializer"));
-- If we later decide to allow exceptions to propagate, we need to
-- not only release locks and undefer abortion, we also need to undo
-- any initializations that succeeded up to this point, or we will
-- risk a dangling reference when the task terminates.
end;
end Ada.Task_Attributes;
| 37.270705 | 79 | 0.626559 |
ad786697fa8f0712874eb81d7750c3177a3fb446 | 2,959 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-stseme.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-stseme.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-stseme.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- GNAT.SOCKETS.THIN.SOCKET_ERROR_MESSAGE --
-- --
-- B o d y --
-- --
-- Copyright (C) 2007-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 is the default implementation of this unit, using the standard C
-- library's strerror(3) function. It is used on all platforms except Windows,
-- since on that platform socket errno values are distinct from the system
-- ones: there is a specific variant of this function in g-socthi-mingw.adb.
separate (GNAT.Sockets.Thin)
--------------------------
-- Socket_Error_Message --
--------------------------
function Socket_Error_Message
(Errno : Integer) return String
is
begin
return Errno_Message (Errno, Default => "Unknown system error");
end Socket_Error_Message;
| 60.387755 | 79 | 0.431903 |
13b24c1e6ac5830827211b93ca79900016592380 | 878 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/unchecked_convert10.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/testsuite/gnat.dg/unchecked_convert10.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/unchecked_convert10.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do run }
with Unchecked_Conversion;
procedure Unchecked_Convert10 is
subtype Unsigned_Type is Integer range 2_034 .. 2_164;
subtype Signed_Type is Integer range -2048 .. 2047;
function To_Signed_Type is
new Unchecked_Conversion (Source => Unsigned_Type, Target => Signed_Type);
function To_Unsigned_Type is
new Unchecked_Conversion (Source => Signed_Type, Target => Unsigned_Type);
Data : Unsigned_Type;
Temp : Signed_Type;
begin
Data := 2100;
Temp := To_Signed_Type (Data);
if Temp /= -1996 then
raise Program_Error;
end if;
Data := To_Unsigned_Type (Temp);
if Data /= 2100 then
raise Program_Error;
end if;
Data := 2047;
Temp := To_Signed_Type (Data);
if Temp /= 2047 then
raise Program_Error;
end if;
Data := To_Unsigned_Type (Temp);
if Data /= 2047 then
raise Program_Error;
end if;
end;
| 20.418605 | 79 | 0.693622 |
04e903c982cea64c9243bca1e1dc6ee01beb0798 | 3,027 | ads | Ada | arch/ARM/Nordic/drivers/nrf51/nrf-ppi.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/Nordic/drivers/nrf51/nrf-ppi.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/Nordic/drivers/nrf51/nrf-ppi.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016-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. --
-- --
------------------------------------------------------------------------------
package nRF.PPI is
subtype Channel_ID is Natural range 0 .. 15;
subtype Group_ID is Natural range 0 .. 3;
procedure Configure (Chan : Channel_ID;
Evt_EP : Event_Type;
Task_EP : Task_Type);
procedure Enable_Channel (Chan : Channel_ID);
procedure Disable_Channel (Chan : Channel_ID);
procedure Add_To_Group (Chan : Channel_ID;
Group : Group_ID);
procedure Remove_From_Group (Chan : Channel_ID;
Group : Group_ID);
procedure Enable_Group (Group : Group_ID);
procedure Disable_Group (Group : Group_ID);
end nRF.PPI;
| 58.211538 | 78 | 0.526264 |
59d6c27350a34b810d270323ed39ec7042022d36 | 94,080 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-cobove.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-cobove.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-cobove.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 . B O U N D E D _ V E C T O R 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.Containers.Generic_Array_Sort;
with System; use type System.Address;
package body Ada.Containers.Bounded_Vectors 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 To_Array_Index (Index : Index_Type'Base) return Count_Type'Base;
---------
-- "&" --
---------
function "&" (Left, Right : Vector) return Vector is
LN : constant Count_Type := Length (Left);
RN : constant Count_Type := Length (Right);
N : Count_Type'Base; -- length of result
J : Count_Type'Base; -- for computing intermediate index values
Last : Index_Type'Base; -- Last index of result
begin
-- We decide that the capacity of the result is the sum of the lengths
-- of the vector parameters. We could decide to make it larger, but we
-- have no basis for knowing how much larger, so we just allocate the
-- minimum amount of storage.
-- Here we handle the easy cases first, when one of the vector
-- parameters is empty. (We say "easy" because there's nothing to
-- compute, that can potentially overflow.)
if LN = 0 then
if RN = 0 then
return Empty_Vector;
end if;
return Vector'(Capacity => RN,
Elements => Right.Elements (1 .. RN),
Last => Right.Last,
others => <>);
end if;
if RN = 0 then
return Vector'(Capacity => LN,
Elements => Left.Elements (1 .. LN),
Last => Left.Last,
others => <>);
end if;
-- Neither of the vector parameters is empty, so must compute the length
-- of the result vector and its last index. (This is the harder case,
-- because our computations must avoid overflow.)
-- There are two constraints we need to satisfy. The first constraint is
-- that a container cannot have more than Count_Type'Last elements, so
-- we must check the sum of the combined lengths. Note that we cannot
-- simply add the lengths, because of the possibility of overflow.
if Checks and then LN > Count_Type'Last - RN then
raise Constraint_Error with "new length is out of range";
end if;
-- It is now safe to compute the length of the new vector, without fear
-- of overflow.
N := LN + RN;
-- The second constraint is that the new Last index value cannot
-- exceed Index_Type'Last. We use the wider of Index_Type'Base and
-- Count_Type'Base as the type for intermediate values.
if Index_Type'Base'Last >= Count_Type'Pos (Count_Type'Last) then
-- We perform a two-part test. First we determine whether the
-- computed Last value lies in the base range of the type, and then
-- determine whether it lies in the range of the index (sub)type.
-- Last must satisfy this relation:
-- First + Length - 1 <= Last
-- We regroup terms:
-- First - 1 <= Last - Length
-- Which can rewrite as:
-- No_Index <= Last - Length
if Checks and then
Index_Type'Base'Last - Index_Type'Base (N) < No_Index
then
raise Constraint_Error with "new length is out of range";
end if;
-- We now know that the computed value of Last is within the base
-- range of the type, so it is safe to compute its value:
Last := No_Index + Index_Type'Base (N);
-- Finally we test whether the value is within the range of the
-- generic actual index subtype:
if Checks and then Last > Index_Type'Last then
raise Constraint_Error with "new length is out of range";
end if;
elsif Index_Type'First <= 0 then
-- Here we can compute Last directly, in the normal way. We know that
-- No_Index is less than 0, so there is no danger of overflow when
-- adding the (positive) value of length.
J := Count_Type'Base (No_Index) + N; -- Last
if Checks and then J > Count_Type'Base (Index_Type'Last) then
raise Constraint_Error with "new length is out of range";
end if;
-- We know that the computed value (having type Count_Type) of Last
-- is within the range of the generic actual index subtype, so it is
-- safe to convert to Index_Type:
Last := Index_Type'Base (J);
else
-- Here Index_Type'First (and Index_Type'Last) is positive, so we
-- must test the length indirectly (by working backwards from the
-- largest possible value of Last), in order to prevent overflow.
J := Count_Type'Base (Index_Type'Last) - N; -- No_Index
if Checks and then J < Count_Type'Base (No_Index) then
raise Constraint_Error with "new length is out of range";
end if;
-- We have determined that the result length would not create a Last
-- index value outside of the range of Index_Type, so we can now
-- safely compute its value.
Last := Index_Type'Base (Count_Type'Base (No_Index) + N);
end if;
declare
LE : Elements_Array renames Left.Elements (1 .. LN);
RE : Elements_Array renames Right.Elements (1 .. RN);
begin
return Vector'(Capacity => N,
Elements => LE & RE,
Last => Last,
others => <>);
end;
end "&";
function "&" (Left : Vector; Right : Element_Type) return Vector is
LN : constant Count_Type := Length (Left);
begin
-- We decide that the capacity of the result is the sum of the lengths
-- of the parameters. We could decide to make it larger, but we have no
-- basis for knowing how much larger, so we just allocate the minimum
-- amount of storage.
-- We must compute the length of the result vector and its last index,
-- but in such a way that overflow is avoided. We must satisfy two
-- constraints: the new length cannot exceed Count_Type'Last, and the
-- new Last index cannot exceed Index_Type'Last.
if Checks and then LN = Count_Type'Last then
raise Constraint_Error with "new length is out of range";
end if;
if Checks and then Left.Last >= Index_Type'Last then
raise Constraint_Error with "new length is out of range";
end if;
return Vector'(Capacity => LN + 1,
Elements => Left.Elements (1 .. LN) & Right,
Last => Left.Last + 1,
others => <>);
end "&";
function "&" (Left : Element_Type; Right : Vector) return Vector is
RN : constant Count_Type := Length (Right);
begin
-- We decide that the capacity of the result is the sum of the lengths
-- of the parameters. We could decide to make it larger, but we have no
-- basis for knowing how much larger, so we just allocate the minimum
-- amount of storage.
-- We compute the length of the result vector and its last index, but in
-- such a way that overflow is avoided. We must satisfy two constraints:
-- the new length cannot exceed Count_Type'Last, and the new Last index
-- cannot exceed Index_Type'Last.
if Checks and then RN = Count_Type'Last then
raise Constraint_Error with "new length is out of range";
end if;
if Checks and then Right.Last >= Index_Type'Last then
raise Constraint_Error with "new length is out of range";
end if;
return Vector'(Capacity => 1 + RN,
Elements => Left & Right.Elements (1 .. RN),
Last => Right.Last + 1,
others => <>);
end "&";
function "&" (Left, Right : Element_Type) return Vector is
begin
-- We decide that the capacity of the result is the sum of the lengths
-- of the parameters. We could decide to make it larger, but we have no
-- basis for knowing how much larger, so we just allocate the minimum
-- amount of storage.
-- We must compute the length of the result vector and its last index,
-- but in such a way that overflow is avoided. We must satisfy two
-- constraints: the new length cannot exceed Count_Type'Last (here, we
-- know that that condition is satisfied), and the new Last index cannot
-- exceed Index_Type'Last.
if Checks and then Index_Type'First >= Index_Type'Last then
raise Constraint_Error with "new length is out of range";
end if;
return Vector'(Capacity => 2,
Elements => (Left, Right),
Last => Index_Type'First + 1,
others => <>);
end "&";
---------
-- "=" --
---------
overriding function "=" (Left, Right : Vector) return Boolean is
begin
if Left.Last /= Right.Last then
return False;
end if;
if Left.Length = 0 then
return True;
end if;
declare
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock_Left : With_Lock (Left.TC'Unrestricted_Access);
Lock_Right : With_Lock (Right.TC'Unrestricted_Access);
begin
for J in Count_Type range 1 .. Left.Length loop
if Left.Elements (J) /= Right.Elements (J) then
return False;
end if;
end loop;
end;
return True;
end "=";
------------
-- Assign --
------------
procedure Assign (Target : in out Vector; Source : Vector) is
begin
if Target'Address = Source'Address then
return;
end if;
if Checks and then Target.Capacity < Source.Length then
raise Capacity_Error -- ???
with "Target capacity is less than Source length";
end if;
Target.Clear;
Target.Elements (1 .. Source.Length) :=
Source.Elements (1 .. Source.Length);
Target.Last := Source.Last;
end Assign;
------------
-- Append --
------------
procedure Append (Container : in out Vector; New_Item : Vector) is
begin
if New_Item.Is_Empty then
return;
end if;
if Checks and then Container.Last >= Index_Type'Last then
raise Constraint_Error with "vector is already at its maximum length";
end if;
Container.Insert (Container.Last + 1, New_Item);
end Append;
procedure Append
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type := 1)
is
begin
if Count = 0 then
return;
end if;
if Checks and then Container.Last >= Index_Type'Last then
raise Constraint_Error with "vector is already at its maximum length";
end if;
Container.Insert (Container.Last + 1, New_Item, Count);
end Append;
--------------
-- Capacity --
--------------
function Capacity (Container : Vector) return Count_Type is
begin
return Container.Elements'Length;
end Capacity;
-----------
-- Clear --
-----------
procedure Clear (Container : in out Vector) is
begin
TC_Check (Container.TC);
Container.Last := No_Index;
end Clear;
------------------------
-- Constant_Reference --
------------------------
function Constant_Reference
(Container : aliased Vector;
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 denotes wrong container";
end if;
if Checks and then Position.Index > Position.Container.Last then
raise Constraint_Error with "Position cursor is out of range";
end if;
declare
A : Elements_Array renames Container.Elements;
J : constant Count_Type := To_Array_Index (Position.Index);
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
return R : constant Constant_Reference_Type :=
(Element => A (J)'Access,
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Constant_Reference;
function Constant_Reference
(Container : aliased Vector;
Index : Index_Type) return Constant_Reference_Type
is
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
declare
A : Elements_Array renames Container.Elements;
J : constant Count_Type := To_Array_Index (Index);
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
return R : constant Constant_Reference_Type :=
(Element => A (J)'Access,
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Constant_Reference;
--------------
-- Contains --
--------------
function Contains
(Container : Vector;
Item : Element_Type) return Boolean
is
begin
return Find_Index (Container, Item) /= No_Index;
end Contains;
----------
-- Copy --
----------
function Copy
(Source : Vector;
Capacity : Count_Type := 0) return Vector
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 : Vector (C) do
Target.Elements (1 .. Source.Length) :=
Source.Elements (1 .. Source.Length);
Target.Last := Source.Last;
end return;
end Copy;
------------
-- Delete --
------------
procedure Delete
(Container : in out Vector;
Index : Extended_Index;
Count : Count_Type := 1)
is
Old_Last : constant Index_Type'Base := Container.Last;
Old_Len : constant Count_Type := Container.Length;
New_Last : Index_Type'Base;
Count2 : Count_Type'Base; -- count of items from Index to Old_Last
Off : Count_Type'Base; -- Index expressed as offset from IT'First
begin
-- Delete removes items from the vector, the number of which is the
-- minimum of the specified Count and the items (if any) that exist from
-- Index to Container.Last. There are no constraints on the specified
-- value of Count (it can be larger than what's available at this
-- position in the vector, for example), but there are constraints on
-- the allowed values of the Index.
-- As a precondition on the generic actual Index_Type, the base type
-- must include Index_Type'Pred (Index_Type'First); this is the value
-- that Container.Last assumes when the vector is empty. However, we do
-- not allow that as the value for Index when specifying which items
-- should be deleted, so we must manually check. (That the user is
-- allowed to specify the value at all here is a consequence of the
-- declaration of the Extended_Index subtype, which includes the values
-- in the base range that immediately precede and immediately follow the
-- values in the Index_Type.)
if Checks and then Index < Index_Type'First then
raise Constraint_Error with "Index is out of range (too small)";
end if;
-- We do allow a value greater than Container.Last to be specified as
-- the Index, but only if it's immediately greater. This allows the
-- corner case of deleting no items from the back end of the vector to
-- be treated as a no-op. (It is assumed that specifying an index value
-- greater than Last + 1 indicates some deeper flaw in the caller's
-- algorithm, so that case is treated as a proper error.)
if Index > Old_Last then
if Checks and then Index > Old_Last + 1 then
raise Constraint_Error with "Index is out of range (too large)";
end if;
return;
end if;
-- Here and elsewhere we treat deleting 0 items from the container as a
-- no-op, even when the container is busy, so we simply return.
if Count = 0 then
return;
end if;
-- The tampering bits exist to prevent an item from being deleted (or
-- otherwise harmfully manipulated) while it is being visited. Query,
-- Update, and Iterate increment the busy count on entry, and decrement
-- the count on exit. Delete checks the count to determine whether it is
-- being called while the associated callback procedure is executing.
TC_Check (Container.TC);
-- We first calculate what's available for deletion starting at
-- Index. Here and elsewhere we use the wider of Index_Type'Base and
-- Count_Type'Base as the type for intermediate values. (See function
-- Length for more information.)
if Count_Type'Base'Last >= Index_Type'Pos (Index_Type'Base'Last) then
Count2 := Count_Type'Base (Old_Last) - Count_Type'Base (Index) + 1;
else
Count2 := Count_Type'Base (Old_Last - Index + 1);
end if;
-- If more elements are requested (Count) for deletion than are
-- available (Count2) for deletion beginning at Index, then everything
-- from Index is deleted. There are no elements to slide down, and so
-- all we need to do is set the value of Container.Last.
if Count >= Count2 then
Container.Last := Index - 1;
return;
end if;
-- There are some elements aren't being deleted (the requested count was
-- less than the available count), so we must slide them down to
-- Index. We first calculate the index values of the respective array
-- slices, using the wider of Index_Type'Base and Count_Type'Base as the
-- type for intermediate calculations.
if Index_Type'Base'Last >= Count_Type'Pos (Count_Type'Last) then
Off := Count_Type'Base (Index - Index_Type'First);
New_Last := Old_Last - Index_Type'Base (Count);
else
Off := Count_Type'Base (Index) - Count_Type'Base (Index_Type'First);
New_Last := Index_Type'Base (Count_Type'Base (Old_Last) - Count);
end if;
-- The array index values for each slice have already been determined,
-- so we just slide down to Index the elements that weren't deleted.
declare
EA : Elements_Array renames Container.Elements;
Idx : constant Count_Type := EA'First + Off;
begin
EA (Idx .. Old_Len - Count) := EA (Idx + Count .. Old_Len);
Container.Last := New_Last;
end;
end Delete;
procedure Delete
(Container : in out Vector;
Position : in out Cursor;
Count : Count_Type := 1)
is
pragma Warnings (Off, Position);
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 denotes wrong container";
end if;
if Checks and then Position.Index > Container.Last then
raise Program_Error with "Position index is out of range";
end if;
Delete (Container, Position.Index, Count);
Position := No_Element;
end Delete;
------------------
-- Delete_First --
------------------
procedure Delete_First
(Container : in out Vector;
Count : Count_Type := 1)
is
begin
if Count = 0 then
return;
elsif Count >= Length (Container) then
Clear (Container);
return;
else
Delete (Container, Index_Type'First, Count);
end if;
end Delete_First;
-----------------
-- Delete_Last --
-----------------
procedure Delete_Last
(Container : in out Vector;
Count : Count_Type := 1)
is
begin
-- It is not permitted to delete items while the container is busy (for
-- example, we're in the middle of a passive iteration). However, we
-- always treat deleting 0 items as a no-op, even when we're busy, so we
-- simply return without checking.
if Count = 0 then
return;
end if;
-- The tampering bits exist to prevent an item from being deleted (or
-- otherwise harmfully manipulated) while it is being visited. Query,
-- Update, and Iterate increment the busy count on entry, and decrement
-- the count on exit. Delete_Last checks the count to determine whether
-- it is being called while the associated callback procedure is
-- executing.
TC_Check (Container.TC);
-- There is no restriction on how large Count can be when deleting
-- items. If it is equal or greater than the current length, then this
-- is equivalent to clearing the vector. (In particular, there's no need
-- for us to actually calculate the new value for Last.)
-- If the requested count is less than the current length, then we must
-- calculate the new value for Last. For the type we use the widest of
-- Index_Type'Base and Count_Type'Base for the intermediate values of
-- our calculation. (See the comments in Length for more information.)
if Count >= Container.Length then
Container.Last := No_Index;
elsif Index_Type'Base'Last >= Count_Type'Pos (Count_Type'Last) then
Container.Last := Container.Last - Index_Type'Base (Count);
else
Container.Last :=
Index_Type'Base (Count_Type'Base (Container.Last) - Count);
end if;
end Delete_Last;
-------------
-- Element --
-------------
function Element
(Container : Vector;
Index : Index_Type) return Element_Type
is
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
else
return Container.Elements (To_Array_Index (Index));
end if;
end Element;
function Element (Position : Cursor) return Element_Type is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
else
return Position.Container.Element (Position.Index);
end if;
end Element;
--------------
-- Finalize --
--------------
procedure Finalize (Object : in out Iterator) is
begin
Unbusy (Object.Container.TC);
end Finalize;
----------
-- Find --
----------
function Find
(Container : Vector;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor
is
begin
if Position.Container /= null then
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with "Position cursor denotes wrong container";
end if;
if Checks and then Position.Index > Container.Last then
raise Program_Error with "Position index is out of range";
end if;
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unrestricted_Access);
begin
for J in Position.Index .. Container.Last loop
if Container.Elements (To_Array_Index (J)) = Item then
return Cursor'(Container'Unrestricted_Access, J);
end if;
end loop;
return No_Element;
end;
end Find;
----------------
-- Find_Index --
----------------
function Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'First) return Extended_Index
is
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock : With_Lock (Container.TC'Unrestricted_Access);
begin
for Indx in Index .. Container.Last loop
if Container.Elements (To_Array_Index (Indx)) = Item then
return Indx;
end if;
end loop;
return No_Index;
end Find_Index;
-----------
-- First --
-----------
function First (Container : Vector) return Cursor is
begin
if Is_Empty (Container) then
return No_Element;
else
return (Container'Unrestricted_Access, Index_Type'First);
end if;
end First;
function First (Object : Iterator) return Cursor is
begin
-- The value of the iterator object's Index component influences the
-- behavior of the First (and Last) selector function.
-- When the Index component is No_Index, this means the iterator
-- object was constructed without a start expression, in which case the
-- (forward) iteration starts from the (logical) beginning of the entire
-- sequence of items (corresponding to Container.First, for a forward
-- iterator).
-- Otherwise, this is iteration over a partial sequence of items.
-- When the Index component isn't No_Index, the iterator object was
-- constructed with a start expression, that specifies the position
-- from which the (forward) partial iteration begins.
if Object.Index = No_Index then
return First (Object.Container.all);
else
return Cursor'(Object.Container, Object.Index);
end if;
end First;
-------------------
-- First_Element --
-------------------
function First_Element (Container : Vector) return Element_Type is
begin
if Checks and then Container.Last = No_Index then
raise Constraint_Error with "Container is empty";
end if;
return Container.Elements (To_Array_Index (Index_Type'First));
end First_Element;
-----------------
-- First_Index --
-----------------
function First_Index (Container : Vector) return Index_Type is
pragma Unreferenced (Container);
begin
return Index_Type'First;
end First_Index;
---------------------
-- Generic_Sorting --
---------------------
package body Generic_Sorting is
---------------
-- Is_Sorted --
---------------
function Is_Sorted (Container : Vector) return Boolean is
begin
if Container.Last <= Index_Type'First then
return True;
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unrestricted_Access);
EA : Elements_Array renames Container.Elements;
begin
for J in 1 .. Container.Length - 1 loop
if EA (J + 1) < EA (J) then
return False;
end if;
end loop;
return True;
end;
end Is_Sorted;
-----------
-- Merge --
-----------
procedure Merge (Target, Source : in out Vector) is
I, J : Count_Type;
begin
-- The semantics of Merge changed slightly per AI05-0021. It was
-- originally the case that if Target and Source denoted the same
-- container object, then the GNAT implementation of Merge did
-- nothing. However, it was argued that RM05 did not precisely
-- specify the semantics for this corner case. The decision of the
-- ARG was that if Target and Source denote the same non-empty
-- container object, then Program_Error is raised.
if Source.Is_Empty then
return;
end if;
if Checks and then Target'Address = Source'Address then
raise Program_Error with
"Target and Source denote same non-empty container";
end if;
if Target.Is_Empty then
Move (Target => Target, Source => Source);
return;
end if;
TC_Check (Source.TC);
I := Target.Length;
Target.Set_Length (I + Source.Length);
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
TA : Elements_Array renames Target.Elements;
SA : Elements_Array renames Source.Elements;
Lock_Target : With_Lock (Target.TC'Unchecked_Access);
Lock_Source : With_Lock (Source.TC'Unchecked_Access);
begin
J := Target.Length;
while not Source.Is_Empty loop
pragma Assert (Source.Length <= 1
or else not (SA (Source.Length) < SA (Source.Length - 1)));
if I = 0 then
TA (1 .. J) := SA (1 .. Source.Length);
Source.Last := No_Index;
exit;
end if;
pragma Assert (I <= 1
or else not (TA (I) < TA (I - 1)));
if SA (Source.Length) < TA (I) then
TA (J) := TA (I);
I := I - 1;
else
TA (J) := SA (Source.Length);
Source.Last := Source.Last - 1;
end if;
J := J - 1;
end loop;
end;
end Merge;
----------
-- Sort --
----------
procedure Sort (Container : in out Vector) is
procedure Sort is
new Generic_Array_Sort
(Index_Type => Count_Type,
Element_Type => Element_Type,
Array_Type => Elements_Array,
"<" => "<");
begin
if Container.Last <= Index_Type'First then
return;
end if;
-- The exception behavior for the vector container must match that
-- for the list container, so we check for cursor tampering here
-- (which will catch more things) instead of for element tampering
-- (which will catch fewer things). It's true that the elements of
-- this vector container could be safely moved around while (say) an
-- iteration is taking place (iteration only increments the busy
-- counter), and so technically all we would need here is a test for
-- element tampering (indicated by the lock counter), that's simply
-- an artifact of our array-based implementation. Logically Sort
-- requires a check for cursor tampering.
TC_Check (Container.TC);
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unchecked_Access);
begin
Sort (Container.Elements (1 .. Container.Length));
end;
end Sort;
end Generic_Sorting;
------------------------
-- Get_Element_Access --
------------------------
function Get_Element_Access
(Position : Cursor) return not null Element_Access is
begin
return Position.Container.Elements
(To_Array_Index (Position.Index))'Access;
end Get_Element_Access;
-----------------
-- Has_Element --
-----------------
function Has_Element (Position : Cursor) return Boolean is
begin
if Position.Container = null then
return False;
end if;
return Position.Index <= Position.Container.Last;
end Has_Element;
------------
-- Insert --
------------
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Element_Type;
Count : Count_Type := 1)
is
EA : Elements_Array renames Container.Elements;
Old_Length : constant Count_Type := Container.Length;
Max_Length : Count_Type'Base; -- determined from range of Index_Type
New_Length : Count_Type'Base; -- sum of current length and Count
Index : Index_Type'Base; -- scratch for intermediate values
J : Count_Type'Base; -- scratch
begin
-- As a precondition on the generic actual Index_Type, the base type
-- must include Index_Type'Pred (Index_Type'First); this is the value
-- that Container.Last assumes when the vector is empty. However, we do
-- not allow that as the value for Index when specifying where the new
-- items should be inserted, so we must manually check. (That the user
-- is allowed to specify the value at all here is a consequence of the
-- declaration of the Extended_Index subtype, which includes the values
-- in the base range that immediately precede and immediately follow the
-- values in the Index_Type.)
if Checks and then Before < Index_Type'First then
raise Constraint_Error with
"Before index is out of range (too small)";
end if;
-- We do allow a value greater than Container.Last to be specified as
-- the Index, but only if it's immediately greater. This allows for the
-- case of appending items to the back end of the vector. (It is assumed
-- that specifying an index value greater than Last + 1 indicates some
-- deeper flaw in the caller's algorithm, so that case is treated as a
-- proper error.)
if Checks and then Before > Container.Last
and then Before > Container.Last + 1
then
raise Constraint_Error with
"Before index is out of range (too large)";
end if;
-- We treat inserting 0 items into the container as a no-op, even when
-- the container is busy, so we simply return.
if Count = 0 then
return;
end if;
-- There are two constraints we need to satisfy. The first constraint is
-- that a container cannot have more than Count_Type'Last elements, so
-- we must check the sum of the current length and the insertion
-- count. Note that we cannot simply add these values, because of the
-- possibility of overflow.
if Checks and then Old_Length > Count_Type'Last - Count then
raise Constraint_Error with "Count is out of range";
end if;
-- It is now safe compute the length of the new vector, without fear of
-- overflow.
New_Length := Old_Length + Count;
-- The second constraint is that the new Last index value cannot exceed
-- Index_Type'Last. In each branch below, we calculate the maximum
-- length (computed from the range of values in Index_Type), and then
-- compare the new length to the maximum length. If the new length is
-- acceptable, then we compute the new last index from that.
if Index_Type'Base'Last >= Count_Type'Pos (Count_Type'Last) then
-- We have to handle the case when there might be more values in the
-- range of Index_Type than in the range of Count_Type.
if Index_Type'First <= 0 then
-- We know that No_Index (the same as Index_Type'First - 1) is
-- less than 0, so it is safe to compute the following sum without
-- fear of overflow.
Index := No_Index + Index_Type'Base (Count_Type'Last);
if Index <= Index_Type'Last then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the
-- maximum number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than in Count_Type,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length := Count_Type'Base (Index_Type'Last - No_Index);
end if;
else
-- No_Index is equal or greater than 0, so we can safely compute
-- the difference without fear of overflow (which we would have to
-- worry about if No_Index were less than 0, but that case is
-- handled above).
if Index_Type'Last - No_Index >=
Count_Type'Pos (Count_Type'Last)
then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the
-- maximum number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than in Count_Type,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length := Count_Type'Base (Index_Type'Last - No_Index);
end if;
end if;
elsif Index_Type'First <= 0 then
-- We know that No_Index (the same as Index_Type'First - 1) is less
-- than 0, so it is safe to compute the following sum without fear of
-- overflow.
J := Count_Type'Base (No_Index) + Count_Type'Last;
if J <= Count_Type'Base (Index_Type'Last) then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the maximum
-- number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than Count_Type does,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length :=
Count_Type'Base (Index_Type'Last) - Count_Type'Base (No_Index);
end if;
else
-- No_Index is equal or greater than 0, so we can safely compute the
-- difference without fear of overflow (which we would have to worry
-- about if No_Index were less than 0, but that case is handled
-- above).
Max_Length :=
Count_Type'Base (Index_Type'Last) - Count_Type'Base (No_Index);
end if;
-- We have just computed the maximum length (number of items). We must
-- now compare the requested length to the maximum length, as we do not
-- allow a vector expand beyond the maximum (because that would create
-- an internal array with a last index value greater than
-- Index_Type'Last, with no way to index those elements).
if Checks and then New_Length > Max_Length then
raise Constraint_Error with "Count is out of range";
end if;
-- The tampering bits exist to prevent an item from being harmfully
-- manipulated while it is being visited. Query, Update, and Iterate
-- increment the busy count on entry, and decrement the count on
-- exit. Insert checks the count to determine whether it is being called
-- while the associated callback procedure is executing.
TC_Check (Container.TC);
if Checks and then New_Length > Container.Capacity then
raise Capacity_Error with "New length is larger than capacity";
end if;
J := To_Array_Index (Before);
if Before > Container.Last then
-- The new items are being appended to the vector, so no
-- sliding of existing elements is required.
EA (J .. New_Length) := (others => New_Item);
else
-- The new items are being inserted before some existing
-- elements, so we must slide the existing elements up to their
-- new home.
EA (J + Count .. New_Length) := EA (J .. Old_Length);
EA (J .. J + Count - 1) := (others => New_Item);
end if;
if Index_Type'Base'Last >= Count_Type'Pos (Count_Type'Last) then
Container.Last := No_Index + Index_Type'Base (New_Length);
else
Container.Last :=
Index_Type'Base (Count_Type'Base (No_Index) + New_Length);
end if;
end Insert;
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Vector)
is
N : constant Count_Type := Length (New_Item);
B : Count_Type; -- index Before converted to Count_Type
begin
-- Use Insert_Space to create the "hole" (the destination slice) into
-- which we copy the source items.
Insert_Space (Container, Before, Count => N);
if N = 0 then
-- There's nothing else to do here (vetting of parameters was
-- performed already in Insert_Space), so we simply return.
return;
end if;
B := To_Array_Index (Before);
if Container'Address /= New_Item'Address then
-- This is the simple case. New_Item denotes an object different
-- from Container, so there's nothing special we need to do to copy
-- the source items to their destination, because all of the source
-- items are contiguous.
Container.Elements (B .. B + N - 1) := New_Item.Elements (1 .. N);
return;
end if;
-- We refer to array index value Before + N - 1 as J. This is the last
-- index value of the destination slice.
-- New_Item denotes the same object as Container, so an insertion has
-- potentially split the source items. The destination is always the
-- range [Before, J], but the source is [Index_Type'First, Before) and
-- (J, Container.Last]. We perform the copy in two steps, using each of
-- the two slices of the source items.
declare
subtype Src_Index_Subtype is Count_Type'Base range 1 .. B - 1;
Src : Elements_Array renames Container.Elements (Src_Index_Subtype);
begin
-- We first copy the source items that precede the space we
-- inserted. (If Before equals Index_Type'First, then this first
-- source slice will be empty, which is harmless.)
Container.Elements (B .. B + Src'Length - 1) := Src;
end;
declare
subtype Src_Index_Subtype is Count_Type'Base range
B + N .. Container.Length;
Src : Elements_Array renames Container.Elements (Src_Index_Subtype);
begin
-- We next copy the source items that follow the space we inserted.
Container.Elements (B + N - Src'Length .. B + N - 1) := Src;
end;
end Insert;
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Vector)
is
Index : Index_Type'Base;
begin
if Checks and then Before.Container /= null
and then Before.Container /= Container'Unchecked_Access
then
raise Program_Error with "Before cursor denotes wrong container";
end if;
if Is_Empty (New_Item) then
return;
end if;
if Before.Container = null
or else Before.Index > Container.Last
then
if Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with
"vector is already at its maximum length";
end if;
Index := Container.Last + 1;
else
Index := Before.Index;
end if;
Insert (Container, Index, New_Item);
end Insert;
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Vector;
Position : out Cursor)
is
Index : Index_Type'Base;
begin
if Checks and then Before.Container /= null
and then Before.Container /= Container'Unchecked_Access
then
raise Program_Error with "Before cursor denotes wrong container";
end if;
if Is_Empty (New_Item) then
if Before.Container = null
or else Before.Index > Container.Last
then
Position := No_Element;
else
Position := (Container'Unchecked_Access, Before.Index);
end if;
return;
end if;
if Before.Container = null
or else Before.Index > Container.Last
then
if Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with
"vector is already at its maximum length";
end if;
Index := Container.Last + 1;
else
Index := Before.Index;
end if;
Insert (Container, Index, New_Item);
Position := Cursor'(Container'Unchecked_Access, Index);
end Insert;
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1)
is
Index : Index_Type'Base;
begin
if Checks and then Before.Container /= null
and then Before.Container /= Container'Unchecked_Access
then
raise Program_Error with "Before cursor denotes wrong container";
end if;
if Count = 0 then
return;
end if;
if Before.Container = null
or else Before.Index > Container.Last
then
if Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with
"vector is already at its maximum length";
end if;
Index := Container.Last + 1;
else
Index := Before.Index;
end if;
Insert (Container, Index, New_Item, Count);
end Insert;
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Element_Type;
Position : out Cursor;
Count : Count_Type := 1)
is
Index : Index_Type'Base;
begin
if Checks and then Before.Container /= null
and then Before.Container /= Container'Unchecked_Access
then
raise Program_Error with "Before cursor denotes wrong container";
end if;
if Count = 0 then
if Before.Container = null
or else Before.Index > Container.Last
then
Position := No_Element;
else
Position := (Container'Unchecked_Access, Before.Index);
end if;
return;
end if;
if Before.Container = null
or else Before.Index > Container.Last
then
if Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with
"vector is already at its maximum length";
end if;
Index := Container.Last + 1;
else
Index := Before.Index;
end if;
Insert (Container, Index, New_Item, Count);
Position := Cursor'(Container'Unchecked_Access, Index);
end Insert;
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
Count : Count_Type := 1)
is
New_Item : Element_Type; -- Default-initialized value
pragma Warnings (Off, New_Item);
begin
Insert (Container, Before, New_Item, Count);
end Insert;
procedure Insert
(Container : in out Vector;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1)
is
New_Item : Element_Type; -- Default-initialized value
pragma Warnings (Off, New_Item);
begin
Insert (Container, Before, New_Item, Position, Count);
end Insert;
------------------
-- Insert_Space --
------------------
procedure Insert_Space
(Container : in out Vector;
Before : Extended_Index;
Count : Count_Type := 1)
is
EA : Elements_Array renames Container.Elements;
Old_Length : constant Count_Type := Container.Length;
Max_Length : Count_Type'Base; -- determined from range of Index_Type
New_Length : Count_Type'Base; -- sum of current length and Count
Index : Index_Type'Base; -- scratch for intermediate values
J : Count_Type'Base; -- scratch
begin
-- As a precondition on the generic actual Index_Type, the base type
-- must include Index_Type'Pred (Index_Type'First); this is the value
-- that Container.Last assumes when the vector is empty. However, we do
-- not allow that as the value for Index when specifying where the new
-- items should be inserted, so we must manually check. (That the user
-- is allowed to specify the value at all here is a consequence of the
-- declaration of the Extended_Index subtype, which includes the values
-- in the base range that immediately precede and immediately follow the
-- values in the Index_Type.)
if Checks and then Before < Index_Type'First then
raise Constraint_Error with
"Before index is out of range (too small)";
end if;
-- We do allow a value greater than Container.Last to be specified as
-- the Index, but only if it's immediately greater. This allows for the
-- case of appending items to the back end of the vector. (It is assumed
-- that specifying an index value greater than Last + 1 indicates some
-- deeper flaw in the caller's algorithm, so that case is treated as a
-- proper error.)
if Checks and then Before > Container.Last
and then Before > Container.Last + 1
then
raise Constraint_Error with
"Before index is out of range (too large)";
end if;
-- We treat inserting 0 items into the container as a no-op, even when
-- the container is busy, so we simply return.
if Count = 0 then
return;
end if;
-- There are two constraints we need to satisfy. The first constraint is
-- that a container cannot have more than Count_Type'Last elements, so
-- we must check the sum of the current length and the insertion count.
-- Note that we cannot simply add these values, because of the
-- possibility of overflow.
if Checks and then Old_Length > Count_Type'Last - Count then
raise Constraint_Error with "Count is out of range";
end if;
-- It is now safe compute the length of the new vector, without fear of
-- overflow.
New_Length := Old_Length + Count;
-- The second constraint is that the new Last index value cannot exceed
-- Index_Type'Last. In each branch below, we calculate the maximum
-- length (computed from the range of values in Index_Type), and then
-- compare the new length to the maximum length. If the new length is
-- acceptable, then we compute the new last index from that.
if Index_Type'Base'Last >= Count_Type'Pos (Count_Type'Last) then
-- We have to handle the case when there might be more values in the
-- range of Index_Type than in the range of Count_Type.
if Index_Type'First <= 0 then
-- We know that No_Index (the same as Index_Type'First - 1) is
-- less than 0, so it is safe to compute the following sum without
-- fear of overflow.
Index := No_Index + Index_Type'Base (Count_Type'Last);
if Index <= Index_Type'Last then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the
-- maximum number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than in Count_Type,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length := Count_Type'Base (Index_Type'Last - No_Index);
end if;
else
-- No_Index is equal or greater than 0, so we can safely compute
-- the difference without fear of overflow (which we would have to
-- worry about if No_Index were less than 0, but that case is
-- handled above).
if Index_Type'Last - No_Index >=
Count_Type'Pos (Count_Type'Last)
then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the
-- maximum number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than in Count_Type,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length := Count_Type'Base (Index_Type'Last - No_Index);
end if;
end if;
elsif Index_Type'First <= 0 then
-- We know that No_Index (the same as Index_Type'First - 1) is less
-- than 0, so it is safe to compute the following sum without fear of
-- overflow.
J := Count_Type'Base (No_Index) + Count_Type'Last;
if J <= Count_Type'Base (Index_Type'Last) then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the maximum
-- number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than Count_Type does,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length :=
Count_Type'Base (Index_Type'Last) - Count_Type'Base (No_Index);
end if;
else
-- No_Index is equal or greater than 0, so we can safely compute the
-- difference without fear of overflow (which we would have to worry
-- about if No_Index were less than 0, but that case is handled
-- above).
Max_Length :=
Count_Type'Base (Index_Type'Last) - Count_Type'Base (No_Index);
end if;
-- We have just computed the maximum length (number of items). We must
-- now compare the requested length to the maximum length, as we do not
-- allow a vector expand beyond the maximum (because that would create
-- an internal array with a last index value greater than
-- Index_Type'Last, with no way to index those elements).
if Checks and then New_Length > Max_Length then
raise Constraint_Error with "Count is out of range";
end if;
-- The tampering bits exist to prevent an item from being harmfully
-- manipulated while it is being visited. Query, Update, and Iterate
-- increment the busy count on entry, and decrement the count on
-- exit. Insert checks the count to determine whether it is being called
-- while the associated callback procedure is executing.
TC_Check (Container.TC);
-- An internal array has already been allocated, so we need to check
-- whether there is enough unused storage for the new items.
if Checks and then New_Length > Container.Capacity then
raise Capacity_Error with "New length is larger than capacity";
end if;
-- In this case, we're inserting space into a vector that has already
-- allocated an internal array, and the existing array has enough
-- unused storage for the new items.
if Before <= Container.Last then
-- The space is being inserted before some existing elements,
-- so we must slide the existing elements up to their new home.
J := To_Array_Index (Before);
EA (J + Count .. New_Length) := EA (J .. Old_Length);
end if;
-- New_Last is the last index value of the items in the container after
-- insertion. Use the wider of Index_Type'Base and Count_Type'Base to
-- compute its value from the New_Length.
if Index_Type'Base'Last >= Count_Type'Pos (Count_Type'Last) then
Container.Last := No_Index + Index_Type'Base (New_Length);
else
Container.Last :=
Index_Type'Base (Count_Type'Base (No_Index) + New_Length);
end if;
end Insert_Space;
procedure Insert_Space
(Container : in out Vector;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1)
is
Index : Index_Type'Base;
begin
if Checks and then Before.Container /= null
and then Before.Container /= Container'Unchecked_Access
then
raise Program_Error with "Before cursor denotes wrong container";
end if;
if Count = 0 then
if Before.Container = null
or else Before.Index > Container.Last
then
Position := No_Element;
else
Position := (Container'Unchecked_Access, Before.Index);
end if;
return;
end if;
if Before.Container = null
or else Before.Index > Container.Last
then
if Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with
"vector is already at its maximum length";
end if;
Index := Container.Last + 1;
else
Index := Before.Index;
end if;
Insert_Space (Container, Index, Count => Count);
Position := Cursor'(Container'Unchecked_Access, Index);
end Insert_Space;
--------------
-- Is_Empty --
--------------
function Is_Empty (Container : Vector) return Boolean is
begin
return Container.Last < Index_Type'First;
end Is_Empty;
-------------
-- Iterate --
-------------
procedure Iterate
(Container : Vector;
Process : not null access procedure (Position : Cursor))
is
Busy : With_Busy (Container.TC'Unrestricted_Access);
begin
for Indx in Index_Type'First .. Container.Last loop
Process (Cursor'(Container'Unrestricted_Access, Indx));
end loop;
end Iterate;
function Iterate
(Container : Vector)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class
is
V : constant Vector_Access := Container'Unrestricted_Access;
begin
-- The value of its Index component influences the behavior of the First
-- and Last selector functions of the iterator object. When the Index
-- component is No_Index (as is the case here), this means the iterator
-- object was constructed without a start expression. This is a complete
-- iterator, meaning that the iteration starts from the (logical)
-- beginning of the sequence of items.
-- Note: For a forward iterator, Container.First is the beginning, and
-- for a reverse iterator, Container.Last is the beginning.
return It : constant Iterator :=
(Limited_Controlled with
Container => V,
Index => No_Index)
do
Busy (Container.TC'Unrestricted_Access.all);
end return;
end Iterate;
function Iterate
(Container : Vector;
Start : Cursor)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class
is
V : constant Vector_Access := Container'Unrestricted_Access;
begin
-- It was formerly the case that when Start = No_Element, the partial
-- iterator was defined to behave the same as for a complete iterator,
-- and iterate over the entire sequence of items. However, those
-- semantics were unintuitive and arguably error-prone (it is too easy
-- to accidentally create an endless loop), and so they were changed,
-- per the ARG meeting in Denver on 2011/11. However, there was no
-- consensus about what positive meaning this corner case should have,
-- and so it was decided to simply raise an exception. This does imply,
-- however, that it is not possible to use a partial iterator to specify
-- an empty sequence of items.
if Checks and then Start.Container = null then
raise Constraint_Error with
"Start position for iterator equals No_Element";
end if;
if Checks and then Start.Container /= V then
raise Program_Error with
"Start cursor of Iterate designates wrong vector";
end if;
if Checks and then Start.Index > V.Last then
raise Constraint_Error with
"Start position for iterator equals No_Element";
end if;
-- The value of its Index component influences the behavior of the First
-- and Last selector functions of the iterator object. When the Index
-- component is not No_Index (as is the case here), it means that this
-- is a partial iteration, over a subset of the complete sequence of
-- items. The iterator object was constructed with a start expression,
-- indicating the position from which the iteration begins. Note that
-- the start position has the same value irrespective of whether this is
-- a forward or reverse iteration.
return It : constant Iterator :=
(Limited_Controlled with
Container => V,
Index => Start.Index)
do
Busy (Container.TC'Unrestricted_Access.all);
end return;
end Iterate;
----------
-- Last --
----------
function Last (Container : Vector) return Cursor is
begin
if Is_Empty (Container) then
return No_Element;
else
return (Container'Unrestricted_Access, Container.Last);
end if;
end Last;
function Last (Object : Iterator) return Cursor is
begin
-- The value of the iterator object's Index component influences the
-- behavior of the Last (and First) selector function.
-- When the Index component is No_Index, this means the iterator object
-- was constructed without a start expression, in which case the
-- (reverse) iteration starts from the (logical) beginning of the entire
-- sequence (corresponding to Container.Last, for a reverse iterator).
-- Otherwise, this is iteration over a partial sequence of items. When
-- the Index component is not No_Index, the iterator object was
-- constructed with a start expression, that specifies the position from
-- which the (reverse) partial iteration begins.
if Object.Index = No_Index then
return Last (Object.Container.all);
else
return Cursor'(Object.Container, Object.Index);
end if;
end Last;
------------------
-- Last_Element --
------------------
function Last_Element (Container : Vector) return Element_Type is
begin
if Checks and then Container.Last = No_Index then
raise Constraint_Error with "Container is empty";
end if;
return Container.Elements (Container.Length);
end Last_Element;
----------------
-- Last_Index --
----------------
function Last_Index (Container : Vector) return Extended_Index is
begin
return Container.Last;
end Last_Index;
------------
-- Length --
------------
function Length (Container : Vector) return Count_Type is
L : constant Index_Type'Base := Container.Last;
F : constant Index_Type := Index_Type'First;
begin
-- The base range of the index type (Index_Type'Base) might not include
-- all values for length (Count_Type). Contrariwise, the index type
-- might include values outside the range of length. Hence we use
-- whatever type is wider for intermediate values when calculating
-- length. Note that no matter what the index type is, the maximum
-- length to which a vector is allowed to grow is always the minimum
-- of Count_Type'Last and (IT'Last - IT'First + 1).
-- For example, an Index_Type with range -127 .. 127 is only guaranteed
-- to have a base range of -128 .. 127, but the corresponding vector
-- would have lengths in the range 0 .. 255. In this case we would need
-- to use Count_Type'Base for intermediate values.
-- Another case would be the index range -2**63 + 1 .. -2**63 + 10. The
-- vector would have a maximum length of 10, but the index values lie
-- outside the range of Count_Type (which is only 32 bits). In this
-- case we would need to use Index_Type'Base for intermediate values.
if Count_Type'Base'Last >= Index_Type'Pos (Index_Type'Base'Last) then
return Count_Type'Base (L) - Count_Type'Base (F) + 1;
else
return Count_Type (L - F + 1);
end if;
end Length;
----------
-- Move --
----------
procedure Move
(Target : in out Vector;
Source : in out Vector)
is
begin
if Target'Address = Source'Address then
return;
end if;
if Checks and then Target.Capacity < Source.Length then
raise Capacity_Error -- ???
with "Target capacity is less than Source length";
end if;
TC_Check (Target.TC);
TC_Check (Source.TC);
-- Clear Target now, in case element assignment fails
Target.Last := No_Index;
Target.Elements (1 .. Source.Length) :=
Source.Elements (1 .. Source.Length);
Target.Last := Source.Last;
Source.Last := No_Index;
end Move;
----------
-- Next --
----------
function Next (Position : Cursor) return Cursor is
begin
if Position.Container = null then
return No_Element;
elsif Position.Index < Position.Container.Last then
return (Position.Container, Position.Index + 1);
else
return No_Element;
end if;
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 vector";
end if;
return Next (Position);
end Next;
procedure Next (Position : in out Cursor) is
begin
if Position.Container = null then
return;
elsif Position.Index < Position.Container.Last then
Position.Index := Position.Index + 1;
else
Position := No_Element;
end if;
end Next;
-------------
-- Prepend --
-------------
procedure Prepend (Container : in out Vector; New_Item : Vector) is
begin
Insert (Container, Index_Type'First, New_Item);
end Prepend;
procedure Prepend
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type := 1)
is
begin
Insert (Container,
Index_Type'First,
New_Item,
Count);
end Prepend;
--------------
-- Previous --
--------------
procedure Previous (Position : in out Cursor) is
begin
if Position.Container = null then
return;
elsif Position.Index > Index_Type'First then
Position.Index := Position.Index - 1;
else
Position := No_Element;
end if;
end Previous;
function Previous (Position : Cursor) return Cursor is
begin
if Position.Container = null then
return No_Element;
elsif Position.Index > Index_Type'First then
return (Position.Container, Position.Index - 1);
else
return No_Element;
end if;
end Previous;
function Previous (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 Previous designates wrong vector";
end if;
return Previous (Position);
end Previous;
----------------------
-- Pseudo_Reference --
----------------------
function Pseudo_Reference
(Container : aliased Vector'Class) return Reference_Control_Type
is
TC : constant Tamper_Counts_Access := Container.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
(Container : Vector;
Index : Index_Type;
Process : not null access procedure (Element : Element_Type))
is
Lock : With_Lock (Container.TC'Unrestricted_Access);
V : Vector renames Container'Unrestricted_Access.all;
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
Process (V.Elements (To_Array_Index (Index)));
end Query_Element;
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type))
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
end if;
Query_Element (Position.Container.all, Position.Index, Process);
end Query_Element;
----------
-- Read --
----------
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Vector)
is
Length : Count_Type'Base;
Last : Index_Type'Base := No_Index;
begin
Clear (Container);
Count_Type'Base'Read (Stream, Length);
Reserve_Capacity (Container, Capacity => Length);
for Idx in Count_Type range 1 .. Length loop
Last := Last + 1;
Element_Type'Read (Stream, Container.Elements (Idx));
Container.Last := Last;
end loop;
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Position : out Cursor)
is
begin
raise Program_Error with "attempt to stream vector 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 Vector;
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 denotes wrong container";
end if;
if Checks and then Position.Index > Position.Container.Last then
raise Constraint_Error with "Position cursor is out of range";
end if;
declare
A : Elements_Array renames Container.Elements;
J : constant Count_Type := To_Array_Index (Position.Index);
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
return R : constant Reference_Type :=
(Element => A (J)'Access,
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Reference;
function Reference
(Container : aliased in out Vector;
Index : Index_Type) return Reference_Type
is
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
declare
A : Elements_Array renames Container.Elements;
J : constant Count_Type := To_Array_Index (Index);
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
return R : constant Reference_Type :=
(Element => A (J)'Access,
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Reference;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Container : in out Vector;
Index : Index_Type;
New_Item : Element_Type)
is
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
TE_Check (Container.TC);
Container.Elements (To_Array_Index (Index)) := New_Item;
end Replace_Element;
procedure Replace_Element
(Container : in out Vector;
Position : Cursor;
New_Item : Element_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 denotes wrong container";
end if;
if Checks and then Position.Index > Container.Last then
raise Constraint_Error with "Position cursor is out of range";
end if;
TE_Check (Container.TC);
Container.Elements (To_Array_Index (Position.Index)) := New_Item;
end Replace_Element;
----------------------
-- Reserve_Capacity --
----------------------
procedure Reserve_Capacity
(Container : in out Vector;
Capacity : Count_Type)
is
begin
if Checks and then Capacity > Container.Capacity then
raise Capacity_Error with "Capacity is out of range";
end if;
end Reserve_Capacity;
----------------------
-- Reverse_Elements --
----------------------
procedure Reverse_Elements (Container : in out Vector) is
E : Elements_Array renames Container.Elements;
Idx : Count_Type;
Jdx : Count_Type;
begin
if Container.Length <= 1 then
return;
end if;
-- The exception behavior for the vector container must match that for
-- the list container, so we check for cursor tampering here (which will
-- catch more things) instead of for element tampering (which will catch
-- fewer things). It's true that the elements of this vector container
-- could be safely moved around while (say) an iteration is taking place
-- (iteration only increments the busy counter), and so technically
-- all we would need here is a test for element tampering (indicated
-- by the lock counter), that's simply an artifact of our array-based
-- implementation. Logically Reverse_Elements requires a check for
-- cursor tampering.
TC_Check (Container.TC);
Idx := 1;
Jdx := Container.Length;
while Idx < Jdx loop
declare
EI : constant Element_Type := E (Idx);
begin
E (Idx) := E (Jdx);
E (Jdx) := EI;
end;
Idx := Idx + 1;
Jdx := Jdx - 1;
end loop;
end Reverse_Elements;
------------------
-- Reverse_Find --
------------------
function Reverse_Find
(Container : Vector;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor
is
Last : Index_Type'Base;
begin
if Checks and then Position.Container /= null
and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with "Position cursor denotes wrong container";
end if;
Last :=
(if Position.Container = null or else Position.Index > Container.Last
then Container.Last
else Position.Index);
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unrestricted_Access);
begin
for Indx in reverse Index_Type'First .. Last loop
if Container.Elements (To_Array_Index (Indx)) = Item then
return Cursor'(Container'Unrestricted_Access, Indx);
end if;
end loop;
return No_Element;
end;
end Reverse_Find;
------------------------
-- Reverse_Find_Index --
------------------------
function Reverse_Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'Last) return Extended_Index
is
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock : With_Lock (Container.TC'Unrestricted_Access);
Last : constant Index_Type'Base :=
Index_Type'Min (Container.Last, Index);
begin
for Indx in reverse Index_Type'First .. Last loop
if Container.Elements (To_Array_Index (Indx)) = Item then
return Indx;
end if;
end loop;
return No_Index;
end Reverse_Find_Index;
---------------------
-- Reverse_Iterate --
---------------------
procedure Reverse_Iterate
(Container : Vector;
Process : not null access procedure (Position : Cursor))
is
Busy : With_Busy (Container.TC'Unrestricted_Access);
begin
for Indx in reverse Index_Type'First .. Container.Last loop
Process (Cursor'(Container'Unrestricted_Access, Indx));
end loop;
end Reverse_Iterate;
----------------
-- Set_Length --
----------------
procedure Set_Length (Container : in out Vector; Length : Count_Type) is
Count : constant Count_Type'Base := Container.Length - Length;
begin
-- Set_Length allows the user to set the length explicitly, instead of
-- implicitly as a side-effect of deletion or insertion. If the
-- requested length is less than the current length, this is equivalent
-- to deleting items from the back end of the vector. If the requested
-- length is greater than the current length, then this is equivalent to
-- inserting "space" (nonce items) at the end.
if Count >= 0 then
Container.Delete_Last (Count);
elsif Checks and then Container.Last >= Index_Type'Last then
raise Constraint_Error with "vector is already at its maximum length";
else
Container.Insert_Space (Container.Last + 1, -Count);
end if;
end Set_Length;
----------
-- Swap --
----------
procedure Swap (Container : in out Vector; I, J : Index_Type) is
E : Elements_Array renames Container.Elements;
begin
if Checks and then I > Container.Last then
raise Constraint_Error with "I index is out of range";
end if;
if Checks and then J > Container.Last then
raise Constraint_Error with "J index is out of range";
end if;
if I = J then
return;
end if;
TE_Check (Container.TC);
declare
EI_Copy : constant Element_Type := E (To_Array_Index (I));
begin
E (To_Array_Index (I)) := E (To_Array_Index (J));
E (To_Array_Index (J)) := EI_Copy;
end;
end Swap;
procedure Swap (Container : in out Vector; I, J : Cursor) is
begin
if Checks and then I.Container = null then
raise Constraint_Error with "I cursor has no element";
end if;
if Checks and then J.Container = null then
raise Constraint_Error with "J cursor has no element";
end if;
if Checks and then I.Container /= Container'Unrestricted_Access then
raise Program_Error with "I cursor denotes wrong container";
end if;
if Checks and then J.Container /= Container'Unrestricted_Access then
raise Program_Error with "J cursor denotes wrong container";
end if;
Swap (Container, I.Index, J.Index);
end Swap;
--------------------
-- To_Array_Index --
--------------------
function To_Array_Index (Index : Index_Type'Base) return Count_Type'Base is
Offset : Count_Type'Base;
begin
-- We know that
-- Index >= Index_Type'First
-- hence we also know that
-- Index - Index_Type'First >= 0
-- The issue is that even though 0 is guaranteed to be a value in
-- the type Index_Type'Base, there's no guarantee that the difference
-- is a value in that type. To prevent overflow we use the wider
-- of Count_Type'Base and Index_Type'Base to perform intermediate
-- calculations.
if Index_Type'Base'Last >= Count_Type'Pos (Count_Type'Last) then
Offset := Count_Type'Base (Index - Index_Type'First);
else
Offset := Count_Type'Base (Index) -
Count_Type'Base (Index_Type'First);
end if;
-- The array index subtype for all container element arrays
-- always starts with 1.
return 1 + Offset;
end To_Array_Index;
---------------
-- To_Cursor --
---------------
function To_Cursor
(Container : Vector;
Index : Extended_Index) return Cursor
is
begin
if Index not in Index_Type'First .. Container.Last then
return No_Element;
end if;
return Cursor'(Container'Unrestricted_Access, Index);
end To_Cursor;
--------------
-- To_Index --
--------------
function To_Index (Position : Cursor) return Extended_Index is
begin
if Position.Container = null then
return No_Index;
end if;
if Position.Index <= Position.Container.Last then
return Position.Index;
end if;
return No_Index;
end To_Index;
---------------
-- To_Vector --
---------------
function To_Vector (Length : Count_Type) return Vector is
Index : Count_Type'Base;
Last : Index_Type'Base;
begin
if Length = 0 then
return Empty_Vector;
end if;
-- We create a vector object with a capacity that matches the specified
-- Length, but we do not allow the vector capacity (the length of the
-- internal array) to exceed the number of values in Index_Type'Range
-- (otherwise, there would be no way to refer to those components via an
-- index). We must therefore check whether the specified Length would
-- create a Last index value greater than Index_Type'Last.
if Index_Type'Base'Last >= Count_Type'Pos (Count_Type'Last) then
-- We perform a two-part test. First we determine whether the
-- computed Last value lies in the base range of the type, and then
-- determine whether it lies in the range of the index (sub)type.
-- Last must satisfy this relation:
-- First + Length - 1 <= Last
-- We regroup terms:
-- First - 1 <= Last - Length
-- Which can rewrite as:
-- No_Index <= Last - Length
if Checks and then
Index_Type'Base'Last - Index_Type'Base (Length) < No_Index
then
raise Constraint_Error with "Length is out of range";
end if;
-- We now know that the computed value of Last is within the base
-- range of the type, so it is safe to compute its value:
Last := No_Index + Index_Type'Base (Length);
-- Finally we test whether the value is within the range of the
-- generic actual index subtype:
if Checks and then Last > Index_Type'Last then
raise Constraint_Error with "Length is out of range";
end if;
elsif Index_Type'First <= 0 then
-- Here we can compute Last directly, in the normal way. We know that
-- No_Index is less than 0, so there is no danger of overflow when
-- adding the (positive) value of Length.
Index := Count_Type'Base (No_Index) + Length; -- Last
if Checks and then Index > Count_Type'Base (Index_Type'Last) then
raise Constraint_Error with "Length is out of range";
end if;
-- We know that the computed value (having type Count_Type) of Last
-- is within the range of the generic actual index subtype, so it is
-- safe to convert to Index_Type:
Last := Index_Type'Base (Index);
else
-- Here Index_Type'First (and Index_Type'Last) is positive, so we
-- must test the length indirectly (by working backwards from the
-- largest possible value of Last), in order to prevent overflow.
Index := Count_Type'Base (Index_Type'Last) - Length; -- No_Index
if Checks and then Index < Count_Type'Base (No_Index) then
raise Constraint_Error with "Length is out of range";
end if;
-- We have determined that the value of Length would not create a
-- Last index value outside of the range of Index_Type, so we can now
-- safely compute its value.
Last := Index_Type'Base (Count_Type'Base (No_Index) + Length);
end if;
return V : Vector (Capacity => Length) do
V.Last := Last;
end return;
end To_Vector;
function To_Vector
(New_Item : Element_Type;
Length : Count_Type) return Vector
is
Index : Count_Type'Base;
Last : Index_Type'Base;
begin
if Length = 0 then
return Empty_Vector;
end if;
-- We create a vector object with a capacity that matches the specified
-- Length, but we do not allow the vector capacity (the length of the
-- internal array) to exceed the number of values in Index_Type'Range
-- (otherwise, there would be no way to refer to those components via an
-- index). We must therefore check whether the specified Length would
-- create a Last index value greater than Index_Type'Last.
if Index_Type'Base'Last >= Count_Type'Pos (Count_Type'Last) then
-- We perform a two-part test. First we determine whether the
-- computed Last value lies in the base range of the type, and then
-- determine whether it lies in the range of the index (sub)type.
-- Last must satisfy this relation:
-- First + Length - 1 <= Last
-- We regroup terms:
-- First - 1 <= Last - Length
-- Which can rewrite as:
-- No_Index <= Last - Length
if Checks and then
Index_Type'Base'Last - Index_Type'Base (Length) < No_Index
then
raise Constraint_Error with "Length is out of range";
end if;
-- We now know that the computed value of Last is within the base
-- range of the type, so it is safe to compute its value:
Last := No_Index + Index_Type'Base (Length);
-- Finally we test whether the value is within the range of the
-- generic actual index subtype:
if Checks and then Last > Index_Type'Last then
raise Constraint_Error with "Length is out of range";
end if;
elsif Index_Type'First <= 0 then
-- Here we can compute Last directly, in the normal way. We know that
-- No_Index is less than 0, so there is no danger of overflow when
-- adding the (positive) value of Length.
Index := Count_Type'Base (No_Index) + Length; -- same value as V.Last
if Checks and then Index > Count_Type'Base (Index_Type'Last) then
raise Constraint_Error with "Length is out of range";
end if;
-- We know that the computed value (having type Count_Type) of Last
-- is within the range of the generic actual index subtype, so it is
-- safe to convert to Index_Type:
Last := Index_Type'Base (Index);
else
-- Here Index_Type'First (and Index_Type'Last) is positive, so we
-- must test the length indirectly (by working backwards from the
-- largest possible value of Last), in order to prevent overflow.
Index := Count_Type'Base (Index_Type'Last) - Length; -- No_Index
if Checks and then Index < Count_Type'Base (No_Index) then
raise Constraint_Error with "Length is out of range";
end if;
-- We have determined that the value of Length would not create a
-- Last index value outside of the range of Index_Type, so we can now
-- safely compute its value.
Last := Index_Type'Base (Count_Type'Base (No_Index) + Length);
end if;
return V : Vector (Capacity => Length) do
V.Elements := (others => New_Item);
V.Last := Last;
end return;
end To_Vector;
--------------------
-- Update_Element --
--------------------
procedure Update_Element
(Container : in out Vector;
Index : Index_Type;
Process : not null access procedure (Element : in out Element_Type))
is
Lock : With_Lock (Container.TC'Unchecked_Access);
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
Process (Container.Elements (To_Array_Index (Index)));
end Update_Element;
procedure Update_Element
(Container : in out Vector;
Position : Cursor;
Process : not null access procedure (Element : in out Element_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 denotes wrong container";
end if;
Update_Element (Container, Position.Index, Process);
end Update_Element;
-----------
-- Write --
-----------
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Vector)
is
N : Count_Type;
begin
N := Container.Length;
Count_Type'Base'Write (Stream, N);
for J in 1 .. N loop
Element_Type'Write (Stream, Container.Elements (J));
end loop;
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Position : Cursor)
is
begin
raise Program_Error with "attempt to stream vector 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;
end Ada.Containers.Bounded_Vectors;
| 33.528154 | 79 | 0.603773 |
04a776ad2e796cc8951a8406248f151015643a35 | 2,228 | adb | Ada | src/normalisation.adb | SKNZ/BezierToSTL | 6cc9ed48aa1729140a0bb17aa7f67c17b51561ac | [
"MIT"
] | null | null | null | src/normalisation.adb | SKNZ/BezierToSTL | 6cc9ed48aa1729140a0bb17aa7f67c17b51561ac | [
"MIT"
] | null | null | null | src/normalisation.adb | SKNZ/BezierToSTL | 6cc9ed48aa1729140a0bb17aa7f67c17b51561ac | [
"MIT"
] | null | null | null | with Helper; use Helper;
package body Normalisation is
-- Centre la figure sur l'axe X
-- Raccorde les extremités de la figure à l'axe
procedure Normaliser(Segments : in out Liste) is
Coords_Min : constant Point2D := Trouver_Coords_Min (Segments);
procedure Normaliser_Point(P : in out Point2D) is
begin
P := P - Coords_Min;
end;
procedure Normaliser_Liste is new Parcourir(Normaliser_Point);
Debut : Point2D;
Fin : Point2D;
begin
Debug("Offset appliqué:");
Debug(To_String(Coords_Min));
Normaliser_Liste(Segments);
-- Instanciation maintenant car Segments a été décalé
Debut := Tete(Segments);
Fin := Queue(Segments);
-- Points à rajouter en début et fin de courbe
Debut := (Debut'First => Debut(Debut'First), Debut'Last => 0.0);
Fin := (Fin'First => Fin(Fin'First), Fin'Last => 0.0);
-- On vérifie leur utilité
if Debut /= Tete(Segments) then
Debug("Rajout d'un raccord en début de figure");
Insertion_Tete(Segments, Debut);
end if;
if Fin /= Queue(Segments) then
Debug("Rajout d'un raccord en fin de figure");
Insertion_Queue(Segments, Fin);
end if;
Debug("Fin normalisation");
Debug;
end;
-- Trouve les coord min
function Trouver_Coords_Min(Segments : in out Liste) return Point2D is
-- Abscisses et ordonnées minimales nécessaires
-- pour le pré-traitement
X_Min : Float := Tete(Segments)(Point2D'First);
Y_Min : Float := Tete(Segments)(Point2D'Last);
-- Met à jour les minima X_Min et Y_Min
procedure Comparer_Min(P : in out Point2D) is
begin
-- On compare X_Min et l'abscisse du point P
X_Min := Float'Min(X_Min, P(P'First));
-- On compare Y_Min et l'ordonnée du point P
Y_Min := Float'Min(Y_Min, P(P'Last));
end;
procedure Chercher_Min is new Parcourir(Comparer_Min);
begin
Chercher_Min (Segments);
return (Point2D'First => X_Min, Point2D'Last => Y_Min);
end;
end;
| 31.828571 | 74 | 0.59246 |
04f3843b8bc5372b92deb8e1148e1e711df9f5d9 | 2,615 | ads | Ada | tools/scitools/conf/understand/ada/ada12/s-dimkio.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/s-dimkio.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/s-dimkio.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . M K S _ I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-2012, 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. --
-- --
------------------------------------------------------------------------------
-- Provides output facilities for the MKS dimension system (see System.Dim.Mks
-- and System.Dim.Float_IO).
with System.Dim.Mks; use System.Dim.Mks;
with System.Dim.Float_IO;
package System.Dim.Mks_IO is new System.Dim.Float_IO (Mks_Type);
| 67.051282 | 79 | 0.339197 |
582f09a63b3d4aebe1b3b385cd7a7bac2e398b40 | 347 | ads | Ada | source/tasking/machine-w64-mingw32/s-intnum.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/tasking/machine-w64-mingw32/s-intnum.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/tasking/machine-w64-mingw32/s-intnum.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- implementation unit specialized for Windows
with C.signal;
package System.Interrupt_Numbers is
pragma Preelaborate;
First_Interrupt_Id : constant := 1;
Last_Interrupt_Id : constant := C.signal.NSIG - 1;
function Is_Reserved (Interrupt : C.signed_int) return Boolean;
end System.Interrupt_Numbers;
| 26.692308 | 66 | 0.769452 |
1acc08225ccd3745737b89259469e9f9a4f35482 | 65,984 | adb | Ada | source/xml/sax/xml/xml-sax-simple_readers-scanner.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/xml/sax/xml/xml-sax-simple_readers-scanner.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/xml/sax/xml/xml-sax-simple_readers-scanner.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- XML Processor --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2014, 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 Ada.Unchecked_Deallocation;
with League.IRIs;
with League.Strings.Internals;
with Matreshka.Internals.Strings.Operations;
with Matreshka.Internals.Unicode.Characters.Latin;
with Matreshka.Internals.URI_Utilities;
with XML.SAX.Simple_Readers.Callbacks;
with XML.SAX.Simple_Readers.Scanner.Actions;
with XML.SAX.Simple_Readers.Scanner.Tables;
package body XML.SAX.Simple_Readers.Scanner is
use type Interfaces.Unsigned_32;
use Matreshka.Internals.Unicode;
use Matreshka.Internals.Unicode.Characters.Latin;
use Matreshka.Internals.Utf16;
use Matreshka.Internals.XML;
use Matreshka.Internals.XML.Base_Scopes;
use Matreshka.Internals.XML.Entity_Tables;
use XML.SAX.Simple_Readers.Scanner.Tables;
procedure Set_Whitespace_Matched (Self : in out Simple_Reader'Class)
with Inline => True;
-- Sets "whitespace matched" flag.
procedure Free is
new Ada.Unchecked_Deallocation
(XML.SAX.Input_Sources.SAX_Input_Source'Class,
XML.SAX.Input_Sources.SAX_Input_Source_Access);
---------------------------
-- Enter_Start_Condition --
---------------------------
procedure Enter_Start_Condition
(Self : in out Simple_Reader'Class;
State : Interfaces.Unsigned_32) is
begin
Self.Scanner_State.YY_Start_State := State * 2 + 1;
end Enter_Start_Condition;
--------------
-- Finalize --
--------------
procedure Finalize (Self : in out Simple_Reader'Class) is
use type XML.SAX.Input_Sources.SAX_Input_Source_Access;
begin
-- Unwind entity stack and release all input sources owned by the
-- reader.
while not Self.Scanner_Stack.Is_Empty loop
if Self.Scanner_State.Source /= null then
-- Deallocate input source and replacement text data, because
-- it was not yet saved in the entities table.
Free (Self.Scanner_State.Source);
Matreshka.Internals.Strings.Dereference (Self.Scanner_State.Data);
end if;
Self.Scanner_State := Self.Scanner_Stack.Last_Element;
Self.Scanner_Stack.Delete_Last;
end loop;
-- Release last token, it can be unused by the parser when fatal error
-- occured.
Clear (Self.YYLVal);
-- Release shared string when scanner's stack is empty, because it is
-- buffer for document entity.
Matreshka.Internals.Strings.Dereference (Self.Scanner_State.Data);
end Finalize;
----------------
-- Initialize --
----------------
procedure Initialize (Self : in out Simple_Reader'Class) is
begin
Self.Scanner_State.Start_Condition_Stack.Append (Tables.DOCUMENT_10);
end Initialize;
-------------------------
-- Pop_Start_Condition --
-------------------------
procedure Pop_Start_Condition (Self : in out Simple_Reader'Class) is
begin
Enter_Start_Condition
(Self, Self.Scanner_State.Start_Condition_Stack.Last_Element);
Self.Scanner_State.Start_Condition_Stack.Delete_Last;
end Pop_Start_Condition;
------------------------------------
-- Push_And_Enter_Start_Condition --
------------------------------------
procedure Push_And_Enter_Start_Condition
(Self : in out Simple_Reader'Class;
Push : Interfaces.Unsigned_32;
Enter : Interfaces.Unsigned_32) is
begin
Self.Scanner_State.Start_Condition_Stack.Append (Push);
Self.Scanner_State.YY_Start_State := 1 + 2 * Enter;
end Push_And_Enter_Start_Condition;
--------------------------------------------
-- Push_Current_And_Enter_Start_Condition --
--------------------------------------------
procedure Push_Current_And_Enter_Start_Condition
(Self : in out Simple_Reader'Class;
Enter : Interfaces.Unsigned_32) is
begin
Self.Scanner_State.Start_Condition_Stack.Append (Start_Condition (Self));
Self.Scanner_State.YY_Start_State := 1 + 2 * Enter;
end Push_Current_And_Enter_Start_Condition;
-----------------
-- Push_Entity --
-----------------
function Push_Entity
(Self : in out Simple_Reader'Class;
Entity : Matreshka.Internals.XML.Entity_Identifier;
In_Document_Type : Boolean;
In_Literal : Boolean) return Boolean
is
use type Matreshka.Internals.Strings.Shared_String_Access;
use type League.Strings.Universal_String;
Source : XML.SAX.Input_Sources.SAX_Input_Source_Access;
Text : Matreshka.Internals.Strings.Shared_String_Access;
Last_Match : Boolean;
Condition : constant Interfaces.Unsigned_32 := Start_Condition (Self);
begin
-- Resolve entity when necessary.
if not Is_Resolved (Self.Entities, Entity) then
Callbacks.Call_Resolve_Entity
(Self,
Entity,
Public_Id (Self.Entities, Entity),
Enclosing_Base_URI (Self.Entities, Entity),
System_Id (Self.Entities, Entity),
Source);
Text := Matreshka.Internals.Strings.Shared_Empty'Access;
Last_Match := False;
if not Self.Continue then
Self.Error_Message.Prepend ("unable to resolve external entity: ");
Callbacks.Call_Fatal_Error (Self, Self.Error_Message);
return False;
end if;
Set_Is_Resolved (Self.Entities, Entity, True);
Set_Entity_Base_URI
(Self.Entities,
Entity,
Matreshka.Internals.URI_Utilities.Directory_Name
(Source.System_Id));
case Self.Version is
when XML_1_0 =>
Source.Set_Version (League.Strings.To_Universal_String ("1.0"));
when XML_1_1 =>
Source.Set_Version (League.Strings.To_Universal_String ("1.1"));
end case;
else
Source := null;
Text := Replacement_Text (Self.Entities, Entity);
Last_Match := True;
if Text.Unused = 0 then
-- Replacement text is empty string,
-- [XML 4.4.8] Included as PE
--
-- "Just as with external parsed entities, parameter entities need
-- only be included if validating. When a parameter-entity
-- reference is recognized in the DTD and included, its
-- replacement text MUST be enlarged by the attachment of one
-- leading and one following space (#x20) character; the intent is
-- to constrain the replacement text of parameter entities to
-- contain an integral number of grammatical tokens in the DTD.
-- This behavior MUST NOT apply to parameter entity references
-- within entity values; these are described in 4.4.5 Included in
-- Literal."
--
-- Set Whitespace_Matched flag, it is used only while processing
-- of DTD, so the place where parameter entity declarations are
-- allowed.
Self.Whitespace_Matched := True;
return True;
end if;
end if;
-- [XML 4.4.8] Included as PE
--
-- "Just as with external parsed entities, parameter entities need only
-- be included if validating. When a parameter-entity reference is
-- recognized in the DTD and included, its replacement text MUST be
-- enlarged by the attachment of one leading and one following space
-- (#x20) character; the intent is to constrain the replacement text of
-- parameter entities to contain an integral number of grammatical
-- tokens in the DTD. This behavior MUST NOT apply to parameter entity
-- references within entity values; these are described in 4.4.5
-- Included in Literal."
--
-- Set Whitespace_Matched flag, it is used only while processing of DTD,
-- so the place where parameter entity declarations are allowed.
Self.Whitespace_Matched := True;
Self.Scanner_Stack.Append (Self.Scanner_State);
Self.Scanner_State :=
(Source => Source,
Data => Text,
Entity => Entity,
In_Literal => In_Literal,
Delimiter => 0,
others => <>);
-- Push base URI into the stack. Entity base URI is used for external
-- entities; current base URI is used for internal entities.
if Entity_Base_URI (Self.Entities, Entity)
= Matreshka.Internals.Strings.Shared_Empty'Access
then
Matreshka.Internals.XML.Base_Scopes.Push_Scope (Self.Bases);
else
Matreshka.Internals.XML.Base_Scopes.Push_Scope
(Self.Bases,
League.IRIs.From_Universal_String
(League.Strings.Internals.Create
(Entity_Base_URI (Self.Entities, Entity))));
end if;
if Last_Match then
Self.Scanner_State.YY_Current_Position :=
First_Position (Self.Entities, Entity);
Self.Scanner_State.YY_Current_Index :=
Integer (First_Position (Self.Entities, Entity)) + 1;
if In_Document_Type then
-- External subset processed after processing of internal subset
-- is completed and scanner returns to DOCTYPE_INT start
-- condition; but it must be switched back to
-- DOCTYPE_INTSUBSET_10 or DOCTYPE_INTSUBSET_11 start condition.
case Self.Version is
when XML_1_0 =>
Enter_Start_Condition (Self, DOCTYPE_INTSUBSET_10);
when XML_1_1 =>
Enter_Start_Condition (Self, DOCTYPE_INTSUBSET_11);
end case;
else
if Condition = DOCUMENT_11
and Is_Internal_General_Entity (Self.Entities, Entity)
then
-- Character references are resolved when replacement text of
-- internal general entity is constructed. In XML 1.1 character
-- references can refer to restricted characters which is not
-- valid in text, but valid in replacement text.
Enter_Start_Condition (Self, DOCUMENT_U11);
else
Enter_Start_Condition (Self, Condition);
end if;
end if;
else
-- Reset scanner to INITIAL state to be able to process text
-- declaration at the beginning of the external entity.
if In_Document_Type then
-- External subset processed after processing of internal subset
-- is completed and scanner returns to DOCTYPE_INT start
-- condition; but it must be switched back to
-- DOCTYPE_INTSUBSET_10 or DOCTYPE_INTSUBSET_11 start condition.
case Self.Version is
when XML_1_0 =>
Push_And_Enter_Start_Condition
(Self, DOCTYPE_INTSUBSET_10, INITIAL);
when XML_1_1 =>
Push_And_Enter_Start_Condition
(Self, DOCTYPE_INTSUBSET_11, INITIAL);
end case;
else
Push_And_Enter_Start_Condition (Self, Condition, INITIAL);
end if;
end if;
return True;
end Push_Entity;
------------------------------
-- Reset_Whitespace_Matched --
------------------------------
procedure Reset_Whitespace_Matched
(Self : in out Simple_Reader'Class) is
begin
Self.Whitespace_Matched := False;
end Reset_Whitespace_Matched;
---------------------------------------
-- Set_Document_Version_And_Encoding --
---------------------------------------
procedure Set_Document_Version_And_Encoding
(Self : in out Simple_Reader'Class;
Version : XML_Version;
Encoding : League.Strings.Universal_String)
is
Restart : Boolean;
Success : Boolean;
End_Of_Source : Boolean;
begin
Pop_Start_Condition (Self);
if Self.Version /= Version then
-- [XML1.0 2.8]
--
-- "Note: When an XML 1.0 processor encounters a document that
-- specifies a 1.x version number other than '1.0', it will process
-- it as a 1.0 document. This means that an XML 1.0 processor will
-- accept 1.x documents provided they do not use any non-1.0
-- features."
--
-- [XML1.1 4.3.4]
--
-- "Each entity, including the document entity, can be separately
-- declared as XML 1.0 or XML 1.1. The version declaration appearing
-- in the document entity determines the version of the document as a
-- whole. An XML 1.1 document may invoke XML 1.0 external entities,
-- so that otherwise duplicated versions of external entities,
-- particularly DTD external subsets, need not be maintained.
-- However, in such a case the rules of XML 1.1 are applied to the
-- entire document."
--
-- So, XML version of the document can be declared only once, in the
-- XML declaration at the start of the document entity. All other
-- occurrences of version declaration in external subset and
-- external entities are ignored. This allows to simplify code of
-- the version change subprogram.
Self.Version := Version;
case Self.Version is
when XML_1_0 =>
Enter_Start_Condition (Self, Tables.DOCUMENT_10);
when XML_1_1 =>
Enter_Start_Condition (Self, Tables.DOCUMENT_11);
end case;
end if;
case Self.Version is
when XML_1_0 =>
Self.Scanner_State.Source.Reset
(League.Strings.To_Universal_String ("1.0"),
Encoding,
Restart,
Success);
when XML_1_1 =>
Self.Scanner_State.Source.Reset
(League.Strings.To_Universal_String ("1.1"),
Encoding,
Restart,
Success);
end case;
if not Success then
Callbacks.Call_Fatal_Error
(Self,
League.Strings.To_Universal_String
("invalid or unsupported encoding"));
elsif Restart then
Matreshka.Internals.Strings.Operations.Reset
(Self.Scanner_State.Data);
Self.Scanner_State.Source.Next
(Self.Scanner_State.Data, End_Of_Source);
end if;
end Set_Document_Version_And_Encoding;
----------------------------
-- Set_Whitespace_Matched --
----------------------------
procedure Set_Whitespace_Matched (Self : in out Simple_Reader'Class) is
begin
Self.Whitespace_Matched := True;
end Set_Whitespace_Matched;
---------------------
-- Start_Condition --
---------------------
function Start_Condition
(Self : Simple_Reader'Class) return Interfaces.Unsigned_32 is
begin
return (Self.Scanner_State.YY_Start_State - 1) / 2;
end Start_Condition;
----------------------
-- YY_Move_Backward --
----------------------
procedure YY_Move_Backward (Self : in out Simple_Reader'Class) is
begin
Self.Scanner_State.YY_Current_Position :=
Self.Scanner_State.YY_Current_Position - 1;
Self.Scanner_State.YY_Current_Index :=
Self.Scanner_State.YY_Current_Index - 1;
Self.Scanner_State.YY_Current_Column :=
Self.Scanner_State.YY_Current_Column - 1;
end YY_Move_Backward;
-------------
-- YY_Text --
-------------
function YY_Text
(Self : Simple_Reader'Class;
Trim_Left : Natural := 0;
Trim_Right : Natural := 0;
Trim_Whitespace : Boolean := False)
return Matreshka.Internals.Strings.Shared_String_Access
is
-- Trailing and leading character as well as whitespace characters
-- belongs to BMP and don't require expensive UTF-16 decoding.
FP : Utf16_String_Index
:= Self.Scanner_State.YY_Base_Position
+ Utf16_String_Index (Trim_Left);
FI : Positive := Self.Scanner_State.YY_Base_Index + Trim_Left;
LP : constant Utf16_String_Index
:= Self.Scanner_State.YY_Current_Position
- Utf16_String_Index (Trim_Right);
LI : constant Positive
:= Self.Scanner_State.YY_Current_Index - Trim_Right;
C : Code_Point;
begin
if Trim_Whitespace then
loop
C := Code_Point (Self.Scanner_State.Data.Value (FP));
exit when
C /= Space
and then C /= Character_Tabulation
and then C /= Carriage_Return
and then C /= Line_Feed;
FP := FP + 1;
FI := FI + 1;
end loop;
end if;
return
Matreshka.Internals.Strings.Operations.Slice
(Self.Scanner_State.Data, FP, LP - FP, LI - FI);
end YY_Text;
-----------
-- YYLex --
-----------
function YYLex (Self : in out Simple_Reader'Class) return Token is
use type XML.SAX.Input_Sources.SAX_Input_Source_Access;
type YY_End_Of_Buffer_Actions is
(YY_Continue_Scan, -- Continue scanning from the current position.
-- It is used to continue processing after pop
-- up of entity from the scanner's stack.
YY_Report_Entity_End, -- Return end of entity mark.
YY_Restart_Scan, -- Restart scanning from the base position.
YY_Accept_Last_Match, -- Accept last matched action.
YY_End_Of_Chunk, -- End of chunk of data is reached.
YY_End_Of_Input); -- End of input is reached.
YY_Action : Interfaces.Unsigned_32;
YY_C : Interfaces.Unsigned_32;
YY_Current_State : Interfaces.Unsigned_32;
YY_Current_Code : Code_Point;
YY_Last_Accepting_Position : Utf16_String_Index;
YY_Last_Accepting_Index : Positive;
YY_Last_Accepting_State : Interfaces.Unsigned_32;
YY_Last_Accepting_Line : Natural;
YY_Last_Accepting_Column : Natural;
YY_Last_Accepting_Skip_LF : Boolean;
YY_Last_Accepting : Boolean;
YY_Next_Position : Utf16_String_Index;
YY_Next_Index : Positive;
YY_Next_Line : Natural;
YY_Next_Column : Natural;
YY_Next_Skip_LF : Boolean;
YY_Last_Match_Position : Utf16_String_Index;
YY_Last_Match_Index : Positive;
YY_Last_Match_State : Interfaces.Unsigned_32;
YY_Last_Match_Line : Natural;
YY_Last_Match_Column : Natural;
YY_Last_Match_Skip_LF : Boolean;
YY_Last_Match : Boolean;
YYLVal : YYSType renames Self.YYLVal;
YY_Last : Utf16_String_Index;
End_Of_Source : Boolean;
YY_End_Of_Buffer_Action : YY_End_Of_Buffer_Actions;
YY_Position_Offset : Utf16_String_Index;
YY_Index_Offset : Natural;
YY_Start_Condition : Interfaces.Unsigned_32;
Start_Issued : Boolean;
function YY_Text_Internal
(Trim_Left : Natural := 0;
Trim_Right : Natural := 0;
Trim_Whitespace : Boolean := False)
return Matreshka.Internals.Strings.Shared_String_Access;
----------------------
-- YY_Text_Internal --
----------------------
function YY_Text_Internal
(Trim_Left : Natural := 0;
Trim_Right : Natural := 0;
Trim_Whitespace : Boolean := False)
return Matreshka.Internals.Strings.Shared_String_Access
is
-- Trailing and leading character as well as whitespace characters
-- belongs to BMP and don't require expensive UTF-16 decoding.
FP : Utf16_String_Index
:= Self.Scanner_State.YY_Base_Position
+ Utf16_String_Index (Trim_Left);
FI : Positive := Self.Scanner_State.YY_Base_Index + Trim_Left;
LP : constant Utf16_String_Index
:= Self.Scanner_State.YY_Current_Position
- Utf16_String_Index (Trim_Right);
LI : constant Positive
:= Self.Scanner_State.YY_Current_Index - Trim_Right;
C : Code_Point;
begin
if Trim_Whitespace then
loop
C := Code_Point (Self.Scanner_State.Data.Value (FP));
exit when
C /= Space
and then C /= Character_Tabulation
and then C /= Carriage_Return
and then C /= Line_Feed;
FP := FP + 1;
FI := FI + 1;
end loop;
end if;
return
Matreshka.Internals.Strings.Operations.Slice
(Self.Scanner_State.Data, FP, LP - FP, LI - FI);
end YY_Text_Internal;
begin
loop -- Loops until end-of-data is reached.
Self.Scanner_State.YY_Base_Position :=
Self.Scanner_State.YY_Current_Position;
Self.Scanner_State.YY_Base_Index :=
Self.Scanner_State.YY_Current_Index;
Self.Scanner_State.YY_Base_Line :=
Self.Scanner_State.YY_Current_Line;
Self.Scanner_State.YY_Base_Column :=
Self.Scanner_State.YY_Current_Column;
Self.Scanner_State.YY_Base_Skip_LF :=
Self.Scanner_State.YY_Current_Skip_LF;
YY_Current_State := Self.Scanner_State.YY_Start_State;
YY_Last_Match := False;
YY_Last_Accepting := False;
loop
YY_Next_Position := Self.Scanner_State.YY_Current_Position;
YY_Next_Index := Self.Scanner_State.YY_Current_Index;
YY_Next_Line := Self.Scanner_State.YY_Current_Line;
YY_Next_Column := Self.Scanner_State.YY_Current_Column;
YY_Next_Skip_LF := Self.Scanner_State.YY_Current_Skip_LF;
if YY_Next_Position < Self.Scanner_State.Data.Unused then
Unchecked_Next
(Self.Scanner_State.Data.Value,
YY_Next_Position,
YY_Current_Code);
YY_Next_Index := YY_Next_Index + 1;
-- Track line/column in entity
if YY_Current_Code = Carriage_Return then
-- Start of new line.
YY_Next_Line := YY_Next_Line + 1;
YY_Next_Column := 1;
YY_Next_Skip_LF := True;
elsif YY_Current_Code = Line_Feed then
if YY_Next_Skip_LF then
-- Ignore CR after LF.
YY_Next_Skip_LF := False;
else
YY_Next_Line := YY_Next_Line + 1;
YY_Next_Column := 1;
end if;
else
-- Move to next column.
YY_Next_Column := YY_Next_Column + 1;
YY_Next_Skip_LF := False;
end if;
YY_C :=
YY_EC_Base
(YY_Current_Code / 16#100#) (YY_Current_Code mod 16#100#);
else
-- End of buffer reached.
YY_C := 0;
-- Aflex uses character with code point zero to mark end of
-- buffer character. This character always has YY_EC zero.
YY_Last_Match := YY_Last_Accepting;
if YY_Last_Accepting then
YY_Last_Match_Position := YY_Last_Accepting_Position;
YY_Last_Match_Index := YY_Last_Accepting_Index;
YY_Last_Match_State := YY_Last_Accepting_State;
YY_Last_Match_Line := YY_Last_Accepting_Line;
YY_Last_Match_Column := YY_Last_Accepting_Column;
YY_Last_Match_Skip_LF := YY_Last_Accepting_Skip_LF;
end if;
end if;
if YY_Accept (YY_Current_State) /= 0 then
-- Accepting state reached, save for possible backtrack.
YY_Last_Accepting_Position :=
Self.Scanner_State.YY_Current_Position;
YY_Last_Accepting_Index :=
Self.Scanner_State.YY_Current_Index;
YY_Last_Accepting_Line :=
Self.Scanner_State.YY_Current_Line;
YY_Last_Accepting_Column :=
Self.Scanner_State.YY_Current_Column;
YY_Last_Accepting_Skip_LF :=
Self.Scanner_State.YY_Current_Skip_LF;
YY_Last_Accepting_State := YY_Current_State;
YY_Last_Accepting := True;
end if;
while YY_Chk (YY_Base (YY_Current_State) + YY_C)
/= YY_Current_State
loop
YY_Current_State := YY_Def (YY_Current_State);
if YY_Current_State >= YY_First_Template then
YY_C := YY_Meta (YY_C);
end if;
end loop;
Self.Scanner_State.YY_Current_Position := YY_Next_Position;
Self.Scanner_State.YY_Current_Index := YY_Next_Index;
Self.Scanner_State.YY_Current_Line := YY_Next_Line;
Self.Scanner_State.YY_Current_Column := YY_Next_Column;
Self.Scanner_State.YY_Current_Skip_LF := YY_Next_Skip_LF;
YY_Current_State := YY_Nxt (YY_Base (YY_Current_State) + YY_C);
exit when YY_Base (YY_Current_State) = YY_Jam_Base;
end loop;
-- Return back to last accepting state.
<<Next_Action>>
YY_Action := YY_Accept (YY_Current_State);
case YY_Action is
when 0 => -- must backtrack
if YY_Last_Accepting then
Self.Scanner_State.YY_Current_Position :=
YY_Last_Accepting_Position;
Self.Scanner_State.YY_Current_Index :=
YY_Last_Accepting_Index;
Self.Scanner_State.YY_Current_Line :=
YY_Last_Accepting_Line;
Self.Scanner_State.YY_Current_Column :=
YY_Last_Accepting_Column;
Self.Scanner_State.YY_Current_Skip_LF :=
YY_Last_Accepting_Skip_LF;
YY_Current_State :=
YY_Last_Accepting_State;
YY_Last_Accepting := False;
goto Next_Action;
else
raise Program_Error;
end if;
pragma Style_Checks ("M127");
when 1 =>
-- Open of XML declaration or text declaration, rules [23], [77].
return Actions.On_Open_Of_XML_Or_Text_Declaration (Self);
when 2 =>
-- Any character except literal "<?xml" means there is no XML declaration
-- in this document/external parsed entity.
Actions.On_No_XML_Declaration (Self);
when 3 =>
-- Open of processing instruction, rule [16]. Rule [17] is implemented
-- implicitly by ordering of open of XMLDecl and open of PI.
return Actions.On_Open_Of_Processing_Instruction (Self);
when 4 =>
-- Open tag of document type declaration and name of root element,
-- rule [28].
return Actions.On_Open_Of_Document_Type_Declaration (Self);
when 5 =>
-- Open of start tag, rule [40], or empty element, rule [44].
return Actions.On_Open_Of_Start_Tag (Self);
when 6 =>
-- Open of end tag, rule [42].
return Actions.On_Open_Of_End_Tag (Self);
when 7 =>
-- Segment of whitespaces.
if Actions.On_Whitespace_In_Document (Self) then
return Token_String_Segment;
end if;
when 8 =>
-- Segment of character data, rule [14].
return Actions.On_Character_Data (Self);
when 9 =>
-- Segment of character data, rule [14].
return Actions.On_Character_Data (Self);
when 10 =>
-- Segment of character data, rule [14].
return Actions.On_Character_Data (Self);
when 11 =>
-- Start of CDATA section, production [19].
return Actions.On_Open_Of_CDATA (Self);
when 12 =>
-- Start of CDATA section, production [19].
return Actions.On_Open_Of_CDATA (Self);
when 13 =>
-- Start of CDATA section, production [19].
return Actions.On_Open_Of_CDATA (Self);
when 14 =>
-- Text data of CDATA section, production [20].
return Actions.On_CDATA (Self);
when 15 =>
-- Text data of CDATA section, production [20].
return Actions.On_CDATA (Self);
when 16 =>
-- Text data of CDATA section, production [20].
return Actions.On_CDATA (Self);
when 17 =>
-- End of CDATA section, production [21].
return Actions.On_Close_Of_CDATA (Self);
when 18 =>
-- End of CDATA section, production [21].
return Actions.On_Close_Of_CDATA (Self);
when 19 =>
-- End of CDATA section, production [21].
return Actions.On_Close_Of_CDATA (Self);
when 20 =>
-- General entity reference rule [68] in document content.
declare
Aux : constant Token
:= Actions.On_General_Entity_Reference_In_Document_Content (Self);
begin
-- By convention, End_Of_Input means that replacement text of the
-- referenced entity is empty and it is not pushed into the scanner
-- stack.
if Aux /= End_Of_Input then
return Aux;
end if;
end;
when 21 =>
-- [24] VersionInfo
return Actions.On_Version_Keyword (Self);
when 22 =>
-- [80] EncodingDecl
return Actions.On_Encoding_Keyword (Self);
when 23 =>
-- [32] SDDecl
return Actions.On_Standalone_Keyword (Self);
when 24 =>
-- Synthetic rule. XMLDECL_ATTRIBUTE_CHAR is a union of characters allowed
-- by [26] VersionNum, [81] EncName, [32] SDDecl. Precise check is
-- processed while parsing.
return Actions.On_Attribute_Value_In_XML_Declaration (Self);
when 25 =>
-- Close of XML declaration (production [23]) or text declaration
-- (production [77]).
return Actions.On_Close_Of_XML_Or_Text_Declaration (Self);
when 26 =>
-- Close of processing instruction (rule [16]).
return Actions.On_Close_Of_Processing_Instruction (Self, True);
when 27 =>
-- Ignore all whitespaces is followed by processing insturction's name,
-- rule [16].
Actions.On_Whitespace_In_Processing_Instruction (Self);
when 28 =>
-- Segment of data and close delimiter of the processing instruction, rule
-- [16].
return Actions.On_Close_Of_Processing_Instruction (Self, False);
when 29 =>
-- Segment of data and close delimiter of the processing instruction, rule
-- [16].
return Actions.On_Close_Of_Processing_Instruction (Self, False);
when 30 =>
-- Keyword SYSTEM, rule [75].
return Actions.On_System_Keyword_In_Document_Type (Self);
when 31 =>
-- System literal, rule [11], used in rule [75].
return Actions.On_System_Literal (Self);
when 32 =>
-- Productions [82], [83] allows absence of system literal in
-- notation declaration.
Pop_Start_Condition (Self);
if Start_Condition (Self) = NOTATION_DECL then
Pop_Start_Condition (Self);
end if;
return Token_Close;
when 33 =>
-- Keyword PUBLIC, rule [75].
Reset_Whitespace_Matched (Self);
Push_And_Enter_Start_Condition (Self, DOCTYPE_INT, EXTERNAL_ID_PUB);
return Token_Public;
when 34 =>
-- Public id literal, rule [12], used in rule [75].
return Actions.On_Public_Literal (Self);
when 35 =>
-- Open of internal subset declaration, rule [28].
return Actions.On_Open_Of_Internal_Subset (Self);
when 36 =>
-- Close of internal subset declaration, rule [28].
Enter_Start_Condition (Self, DOCTYPE_INT);
return Token_Internal_Subset_Close;
when 37 =>
-- Text of comment, rule [15].
Set_String_Internal
(Item => YYLVal,
String => YY_Text_Internal (4, 3),
Is_Whitespace => False);
return Token_Comment;
when 38 =>
-- Text of comment, rule [15].
Set_String_Internal
(Item => YYLVal,
String => YY_Text_Internal (4, 3),
Is_Whitespace => False);
return Token_Comment;
when 39 =>
-- Parameter entity reference rule [69] in document type declaration.
return Actions.On_Parameter_Entity_Reference_In_Document_Declaration (Self);
when 40 =>
-- Open of entity declaration, rules [71], [72].
Enter_Start_Condition (Self, ENTITY_DECL);
Reset_Whitespace_Matched (Self);
return Token_Entity_Decl_Open;
when 41 =>
-- Open of element declaration and name of the element, rule [45].
return Actions.On_Open_Of_Element_Declaration (Self);
when 42 =>
-- Open of attribute list declaration, rule [52].
return Actions.On_Open_Of_Attribute_List_Declaration (Self);
when 43 =>
-- Open of notation declaration, production [82].
return Actions.On_Open_Of_Notation_Declaration (Self);
when 44 =>
-- Start of conditional section.
return Actions.On_Open_Of_Conditional_Section (Self);
when 45 =>
-- Close of conditional section.
return Actions.On_Close_Of_Conditional_Section (Self);
when 46 =>
-- Close of notation declaration, production [82].
Pop_Start_Condition (Self);
return Token_Close;
when 47 =>
-- Name in entity declaration, rules [71], [72].
return Actions.On_Name_In_Entity_Declaration (Self);
when 48 =>
-- Percent mark in parameter entity declaration, rule [72].
return Actions.On_Percent_Sign (Self);
when 49 =>
-- Entity value, rule [9].
return Actions.On_Entity_Value_Open_Delimiter (Self);
when 50 =>
-- Entity value as ExternalID, rule [75], used by rules [73], [74].
return Actions.On_System_Keyword_In_Entity_Or_Notation (Self);
when 51 =>
-- Entity value as ExternalID, rule [75], used by rules [73], [74].
-- Notation as ExternalID or Public_ID (productions [75], [82], [83]).
Reset_Whitespace_Matched (Self);
Push_Current_And_Enter_Start_Condition (Self, EXTERNAL_ID_PUB);
return Token_Public;
when 52 =>
-- NDATA keyword, rule [76].
return Actions.On_NDATA (Self);
when 53 =>
-- Name of NDATA, rule [76].
return Actions.On_Name_In_Entity_Declaration_Notation (Self);
when 54 =>
Set_String_Internal
(Item => YYLVal,
String => YY_Text_Internal,
Is_Whitespace => False);
return Token_String_Segment;
when 55 =>
Set_String_Internal
(Item => YYLVal,
String => YY_Text_Internal,
Is_Whitespace => False);
return Token_String_Segment;
when 56 =>
-- Close of entity value, rule [9].
return Actions.On_Entity_Value_Close_Delimiter (Self);
when 57 =>
-- Decimal form of character reference rule [66] in entity value rule [9];
-- or content of element, rule [43].
return Actions.On_Character_Reference (Self, False);
when 58 =>
-- Decimal form of character reference rule [66] in attribute value,
-- rule [10].
if not Actions.On_Character_Reference_In_Attribute_Value
(Self, False)
then
return Error;
end if;
when 59 =>
-- Hexadecimal form of character reference rule [66] in entity value rule
-- [9] or content of element, rule [43].
return Actions.On_Character_Reference (Self, True);
when 60 =>
-- Hexadecimal form of character reference rule [66] in attribute value,
-- rule [10].
if not Actions.On_Character_Reference_In_Attribute_Value
(Self, True)
then
return Error;
end if;
when 61 =>
-- General entity reference rule [68] in entity value rule [9].
return Actions.On_General_Entity_Reference_In_Entity_Value (Self);
when 62 =>
-- Parameter entity reference rule [69] in entity value rule [9].
--
-- Processing of parameter entity uses separate scanner's state, thus
-- after processing current state is restored automatically. This allows
-- to reuse code for three modes: parsing of entity value delimited by
-- quotation; parsing of entity value delimited by apostrophe; and
-- parsing of parameter entity replacement text when it is referenced
-- in any of two form of entity value.
if not Actions.On_Parameter_Entity_Reference_In_Entity_Value (Self) then
return Error;
end if;
when 63 =>
-- Name of the element in element declaration.
return Actions.On_Name_In_Element_Declaration (Self);
when 64 =>
-- EMPTY keyword, rule [46].
return Token_Empty;
when 65 =>
-- ANY keyword, rule [46].
return Token_Any;
when 66 =>
-- Open parenthesis, rules [49], [50], [51].
return Actions.On_Open_Parenthesis_In_Content_Declaration (Self);
when 67 =>
-- Close parenthesis, rules [49], [50], [51].
return Actions.On_Close_Parenthesis_In_Content_Declaration (Self);
when 68 =>
-- Question mark in rules [47], [48].
return Actions.On_Question_Mark_In_Content_Declaration (Self);
when 69 =>
-- Asterisk in rules [47], [48], [51].
return Actions.On_Asterisk_In_Content_Declaration (Self);
when 70 =>
-- Plus sign in rules [47], [48].
return Actions.On_Plus_In_Content_Declaration (Self);
when 71 =>
-- Vertical bar in rule [49].
return Token_Vertical_Bar;
when 72 =>
-- Comma in rule [50].
return Token_Comma;
when 73 =>
-- #PCDATA in rule [51].
return Token_Pcdata;
when 74 =>
-- Name in element's children declaration, rules [48], [51].
return Actions.On_Name_In_Element_Declaration_Children (Self);
when 75 =>
-- Close token of entity declaration, rules [71], [72].
-- Close of element declaration, rule [45].
-- Close of attribute list declaration, rule [52].
return Actions.On_Close_Of_Declaration (Self);
when 76 =>
-- Element's name in attribute list declaration, rule [52].
return Actions.On_Element_Name_In_Attribute_List_Declaration (Self);
when 77 =>
-- Name of the attribute, rule [53].
return Actions.On_Attribute_Name_In_Attribute_List_Declaration (Self);
when 78 =>
-- CDATA keyword, rule [55].
return Actions.On_Attribute_Type (Self, Token_Cdata);
when 79 =>
-- ID keyword, rule [56].
return Actions.On_Attribute_Type (Self, Token_Id);
when 80 =>
-- IDREF keyword, rule [56].
return Actions.On_Attribute_Type (Self, Token_Idref);
when 81 =>
-- IDREFS keyword, rule [56].
return Actions.On_Attribute_Type (Self, Token_Idrefs);
when 82 =>
-- ENTITY keyword, rule [56].
return Actions.On_Attribute_Type (Self, Token_Entity);
when 83 =>
-- ENTITIES keyword, rule [56].
return Actions.On_Attribute_Type (Self, Token_Entities);
when 84 =>
-- NMTOKEN keyword, rule [56].
return Actions.On_Attribute_Type (Self, Token_Nmtoken);
when 85 =>
-- NMTOKENS keyword, rule [56].
return Actions.On_Attribute_Type (Self, Token_Nmtokens);
when 86 =>
-- NOTATION keyword, rule [58].
return Actions.On_Attribute_Type (Self, Token_Notation);
when 87 =>
-- #REQUIRED keyword, rule [60].
return Actions.On_Default_Declaration (Self, ATTLIST_DECL, Token_Required);
when 88 =>
-- #IMPLIED keyword, rule [60].
return Actions.On_Default_Declaration (Self, ATTLIST_DECL, Token_Implied);
when 89 =>
-- #FIXED keyword, rule [60].
return Actions.On_Default_Declaration (Self, ATTLIST_TYPE, Token_Fixed);
when 90 =>
-- Open parenthesis, rules [58], [59].
return Actions.On_Open_Parenthesis_In_Notation_Attribute (Self);
when 91 =>
-- Close parenthesis, rules [58], [59].
return Actions.On_Close_Parenthesis_In_Notation_Attribute (Self);
when 92 =>
-- Vertical bar, rules [58], [59].
return Token_Vertical_Bar;
when 93 =>
-- Name in the rule [58].
return Actions.On_Name_In_Attribute_List_Declaration_Notation (Self);
when 94 =>
-- Nmtoken in the rule [59].
Set_String_Internal
(Item => YYLVal,
String => YY_Text_Internal,
Is_Whitespace => False);
-- XXX Need to add flag to mark Nmtoken.
return Token_Name;
when 95 =>
-- Open delimiter of attribute value, rule [10].
if not Actions.On_Attribute_Value_Open_Delimiter (Self, ATTLIST_DECL) then
return Error;
end if;
when 96 =>
-- Parameter entity reference rule [69] in attribute declaration.
-- Parameter entity reference in element's children declaration, [51].
if not Actions.On_Parameter_Entity_Reference_In_Markup_Declaration (Self) then
return Error;
end if;
when 97 =>
-- All white spaces from rules [28] are ignored.
-- Whitespace before name in rule [76] is ignored.
null;
when 98 =>
-- IGNORE directive of the conditional section.
Actions.On_Conditional_Section_Directive (Self, False);
when 99 =>
-- INCLUDE directive of the conditional section.
Actions.On_Conditional_Section_Directive (Self, True);
when 100 =>
-- Start of content of conditional section.
if not Actions.On_Open_Of_Conditional_Section_Content (Self) then
return Error;
end if;
when 101 =>
-- Content of ignore conditional section. It ends with "]]>" or "<![".
null;
when 102 =>
-- Content of ignore conditional section. It ends with "]]>" or "<![".
null;
when 103 =>
-- White spaces in entity declaration are not optional, rules [71], [72],
-- [75], [76].
--
-- White spaces in start tag, rule [40], are ignored, but white space
-- between attribute value and name of the next attribute are must be
-- present.
--
-- All white spaces from rules [23], [24], [25], [32], [80], [82] are
-- ignored, but white space between attribute value and name of the
-- next attribute are must be present.
--
-- Production [45] requires whitespace after the name and before
-- content specification.
--
-- Productions [47], [48] don't allow spaces before multiplicity
-- indicator.
Set_Whitespace_Matched (Self);
when 104 =>
-- Name of the attribute, rule [41].
return Actions.On_Name_In_Element_Start_Tag (Self);
when 105 =>
-- Equal sign as attribute's name value delimiter, rule [25] in rules [41],
-- [24], [32], [80].
return Token_Equal;
when 106 =>
-- Close of empty element tag, rule [44].
return Actions.On_Close_Of_Empty_Element_Tag (Self);
when 107 =>
-- Close tag of document type declaration, rule [28].
if Actions.On_Close_Of_Document_Type_Declaration (Self) then
return Token_Close;
end if;
when 108 =>
-- Close of tag, rule [40].
-- Close tag of document type declaration, rule [28].
return Actions.On_Close_Of_Tag (Self);
when 109 =>
-- Open delimiter of attribute value, rule [10].
Actions.On_Attribute_Value_Open_Delimiter (Self, ELEMENT_START);
when 110 =>
-- Close delimiter of attribute value, rule [10].
if Actions.On_Attribute_Value_Close_Delimiter (Self) then
return Token_String_Segment;
end if;
when 111 =>
-- Value of attribute, rule [10].
Actions.On_Attribute_Value_Character_Data (Self);
when 112 =>
-- Value of attribute, rule [10].
Actions.On_Attribute_Value_Character_Data (Self);
when 113 =>
-- Less-than sign can't be used in the attribute value.
return Actions.On_Less_Than_Sign_In_Attribute_Value (Self);
when 114 =>
-- General entity reference rule [68] in attribute value, rule [10].
if not Actions.On_General_Entity_Reference_In_Attribute_Value (Self) then
return Error;
end if;
when 115 =>
-- Unexpected character.
return Actions.On_Unexpected_Character (Self);
pragma Style_Checks ("M79");
-- when YY_END_OF_BUFFER + INITIAL + 1
-- =>
-- return End_Of_Input;
--
when YY_End_Of_Buffer =>
if Self.Scanner_State.Source /= null then
-- Input source is used to retrieve data.
if Is_Document_Entity
(Self.Entities, Self.Scanner_State.Entity)
and Self.Scanner_State.YY_Base_Position /= 0
then
-- For document entity, remove already scanned data.
-- Construct slice only when we actually need to move
-- data.
Matreshka.Internals.Strings.Operations.Slice
(Self.Scanner_State.Data,
Self.Scanner_State.YY_Base_Position,
Self.Scanner_State.Data.Unused
- Self.Scanner_State.YY_Base_Position,
Self.Scanner_State.Data.Length
- Self.Scanner_State.YY_Base_Index + 1);
YY_Position_Offset := Self.Scanner_State.YY_Base_Position;
YY_Index_Offset :=
Self.Scanner_State.YY_Base_Index - 1;
Self.Scanner_State.YY_Base_Position :=
Self.Scanner_State.YY_Base_Position
- YY_Position_Offset;
Self.Scanner_State.YY_Base_Index :=
Self.Scanner_State.YY_Base_Index - YY_Index_Offset;
Self.Scanner_State.YY_Current_Position :=
Self.Scanner_State.YY_Current_Position
- YY_Position_Offset;
Self.Scanner_State.YY_Current_Index :=
Self.Scanner_State.YY_Current_Index - YY_Index_Offset;
if YY_Last_Match then
YY_Last_Match_Position :=
YY_Last_Match_Position - YY_Position_Offset;
YY_Last_Match_Index :=
YY_Last_Match_Index - YY_Index_Offset;
end if;
end if;
-- Obtain next portion of data from the input source.
YY_Last := Self.Scanner_State.Data.Unused;
Self.Scanner_State.Source.Next
(Self.Scanner_State.Data, End_Of_Source);
YY_End_Of_Buffer_Action := YY_Restart_Scan;
if YY_Last = Self.Scanner_State.Data.Unused then
-- There is no new data retrieved, handle end of source
-- state. It is possible to not reach end of source and
-- retrieve no new data at the same time, for example
-- when source data is mailformed and decoder unable to
-- convert data. The same situtation is possible when
-- some kind of filter is inserted between input source
-- and actual stream (SSL/TLS encription, for example).
if End_Of_Source then
-- Replacement text of the entity is loaded from input
-- source and need to be stored in the entities table,
-- except replacement text of the document entity.
-- Input source can be deallocated.
if not Is_Document_Entity
(Self.Entities, Self.Scanner_State.Entity)
then
Set_Replacement_Text
(Self.Entities,
Self.Scanner_State.Entity,
Self.Scanner_State.Data);
Free (Self.Scanner_State.Source);
-- XXX Input source should not be deallocated, it
-- can be needed later to reread entity when XML
-- version (document entity only) or encoding is
-- changed.
else
Self.Scanner_State.Source := null;
-- Input source of document entity is managed by
-- application.
end if;
elsif Self.Scanner_State.Incremental then
YY_End_Of_Buffer_Action := YY_End_Of_Chunk;
end if;
end if;
else
-- Input source is not used, complete replacement text of
-- the entity is in the scanner's buffer. This covers two
-- cases: (1) entity is internal or predefined entity, and
-- (2) text of the entity is loaded completely.
if Self.Scanner_State.Data.Unused
/= Self.Scanner_State.YY_Base_Position
then
-- Continue processing till end of buffer will be
-- reached.
YY_End_Of_Buffer_Action := YY_Accept_Last_Match;
else
-- Replacement text of the entity is completely scanned,
-- pop scanner's entity stack. When scanner's stack is
-- empty returns End_Of_Input token.
if not Self.Scanner_Stack.Is_Empty then
if Is_Parameter_Entity
(Self.Entities, Self.Scanner_State.Entity)
then
-- For parameter entities start condition need to
-- be propagated to previous state, otherwise
-- scanner can start from the wrong condition.
-- For non-parameter entities it is not needed,
-- because their processing doesn't use stack of
-- start conditions.
YY_Start_Condition := Start_Condition (Self);
-- Save flag whether or not Token_Entity_Start was
-- issued.
Start_Issued := Self.Scanner_State.Start_Issued;
-- When entity's replacement text is empty and
-- there are no text declaration, then scanner is
-- in the initial state and actual state must be
-- retrieved from the state stack.
if YY_Start_Condition = INITIAL then
Pop_Start_Condition (Self);
YY_Start_Condition := Start_Condition (Self);
end if;
Free (Self.Scanner_State.Source);
Self.Scanner_State :=
Self.Scanner_Stack.Last_Element;
Self.Scanner_Stack.Delete_Last;
Pop_Scope (Self.Bases);
Enter_Start_Condition (Self, YY_Start_Condition);
-- [XML 4.4.8] Included as PE
--
-- "Just as with external parsed entities,
-- parameter entities need only be included if
-- validating. When a parameter-entity reference is
-- recognized in the DTD and included, its
-- replacement text MUST be enlarged by the
-- attachment of one leading and one following
-- space (#x20) character; the intent is to
-- constrain the replacement text of parameter
-- entities to contain an integral number of
-- grammatical tokens in the DTD. This behavior
-- MUST NOT apply to parameter entity references
-- within entity values; these are described in
-- 4.4.5 Included in Literal."
--
-- Set Whitespace_Matched flag, it is used only
-- while processing of DTD, so the place where
-- parameter entity declarations are allowed.
Self.Whitespace_Matched := True;
-- [XML WFC: PE Between Declarations]
--
-- "The replacement text of a parameter entity
-- reference in a DeclSep MUST match the production
-- extSubsetDecl."
--
-- To check this constraint special rule is added
-- in parser. To pass this rule Token_Entity_End
-- must be returned when handling of parameter
-- entity reference between markup declaration is
-- completed.
if Start_Issued then
YY_End_Of_Buffer_Action := YY_Report_Entity_End;
else
YY_End_Of_Buffer_Action := YY_Continue_Scan;
end if;
elsif Self.In_Document_Content
and not Self.Scanner_State.In_Literal
then
-- For entity references in the document content
-- we need to track start/end of entity.
Free (Self.Scanner_State.Source);
Self.Scanner_State :=
Self.Scanner_Stack.Last_Element;
Self.Scanner_Stack.Delete_Last;
Pop_Scope (Self.Bases);
YY_End_Of_Buffer_Action := YY_Report_Entity_End;
else
Free (Self.Scanner_State.Source);
Self.Scanner_State :=
Self.Scanner_Stack.Last_Element;
Self.Scanner_Stack.Delete_Last;
Pop_Scope (Self.Bases);
YY_End_Of_Buffer_Action := YY_Continue_Scan;
end if;
else
YY_End_Of_Buffer_Action := YY_End_Of_Input;
end if;
end if;
end if;
case YY_End_Of_Buffer_Action is
when YY_Continue_Scan =>
null;
when YY_Report_Entity_End =>
return Token_Entity_End;
when YY_Restart_Scan | YY_End_Of_Chunk =>
-- Back current position to base position.
Self.Scanner_State.YY_Current_Position :=
Self.Scanner_State.YY_Base_Position;
Self.Scanner_State.YY_Current_Index :=
Self.Scanner_State.YY_Base_Index;
Self.Scanner_State.YY_Current_Line :=
Self.Scanner_State.YY_Base_Line;
Self.Scanner_State.YY_Current_Column :=
Self.Scanner_State.YY_Base_Column;
Self.Scanner_State.YY_Current_Skip_LF :=
Self.Scanner_State.YY_Base_Skip_LF;
if YY_End_Of_Buffer_Action = YY_End_Of_Chunk then
return End_Of_Chunk;
end if;
when YY_Accept_Last_Match =>
-- Replace current position to last matched position and
-- process matched action.
-- XXX: Other cases handle line/column numbers and
-- "skip LF" flag also, should they be handled here?
if YY_Last_Match then
Self.Scanner_State.YY_Current_Position :=
YY_Last_Match_Position;
Self.Scanner_State.YY_Current_Index :=
YY_Last_Match_Index;
Self.Scanner_State.YY_Current_Line :=
YY_Last_Match_Line;
Self.Scanner_State.YY_Current_Column :=
YY_Last_Match_Column;
Self.Scanner_State.YY_Current_Skip_LF :=
YY_Last_Match_Skip_LF;
YY_Current_State :=
YY_Last_Match_State;
YY_Last_Match := False;
else
raise Program_Error;
end if;
goto Next_Action;
when YY_End_Of_Input =>
return End_Of_Input;
end case;
when others =>
raise Program_Error
with "Unhandled action"
& Interfaces.Unsigned_32'Image (YY_Action)
& " in scanner";
end case;
end loop; -- end of loop waiting for end of file
end YYLex;
end XML.SAX.Simple_Readers.Scanner;
| 37.554923 | 93 | 0.528795 |
ad245c5d9a9ec2735233f61b267b60aaad625079 | 292 | adb | Ada | 1-base/math/applet/test/modeller/launch_modeller_test.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 1-base/math/applet/test/modeller/launch_modeller_test.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 1-base/math/applet/test/modeller/launch_modeller_test.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
ada.Text_IO,
float_Math.Geometry.d3.Modeller.Forge;
procedure launch_modeller_Test
is
use ada.Text_IO,
float_Math.Geometry.d3.Modeller.Forge;
the_Modeller : polar_Model := polar_Model_from ("gaspra.tab");
begin
put_Line ("Done.");
end launch_modeller_Test;
| 18.25 | 65 | 0.726027 |
133aabf8751f5152ed2a9cf337a5bc0d7b39adec | 804 | adb | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/bp_on_var/foo.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/bp_on_var/foo.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/bp_on_var/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2012-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/>.
with Pck; use Pck;
procedure Foo is
begin
Do_Something (My_Global_Variable);
end Foo;
| 38.285714 | 73 | 0.741294 |
04d6ca4384881e824db59e755f5453c555f22300 | 2,511 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-dmotpr.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-dmotpr.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-dmotpr.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . M K S . O T H E R _ P R E F I X E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Dim.Generic_Mks.Generic_Other_Prefixes;
package System.Dim.Mks.Other_Prefixes is
new System.Dim.Mks.Generic_Other_Prefixes;
| 69.75 | 78 | 0.396256 |
c728be4bf396ba874125d3340fd2b4c3e5c8301d | 6,518 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-pack12.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-pack12.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-pack12.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 1 2 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
with Unchecked_Conversion;
package body System.Pack_12 is
subtype Ofs is System.Storage_Elements.Storage_Offset;
subtype Uns is System.Unsigned_Types.Unsigned;
subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7;
use type System.Storage_Elements.Storage_Offset;
use type System.Unsigned_Types.Unsigned;
type Cluster is record
E0, E1, E2, E3, E4, E5, E6, E7 : Bits_12;
end record;
for Cluster use record
E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1;
E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1;
E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1;
E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1;
E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1;
E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1;
E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1;
E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1;
end record;
for Cluster'Size use Bits * 8;
for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment,
1 +
1 * Boolean'Pos (Bits mod 2 = 0) +
2 * Boolean'Pos (Bits mod 4 = 0));
-- Use maximum possible alignment, given the bit field size, since this
-- will result in the most efficient code possible for the field.
type Cluster_Ref is access Cluster;
function To_Ref is new
Unchecked_Conversion (System.Address, Cluster_Ref);
-- The following declarations are for the case where the address
-- passed to GetU_12 or SetU_12 is not guaranteed to be aligned.
-- These routines are used when the packed array is itself a
-- component of a packed record, and therefore may not be aligned.
type ClusterU is new Cluster;
for ClusterU'Alignment use 1;
type ClusterU_Ref is access ClusterU;
function To_Ref is new
Unchecked_Conversion (System.Address, ClusterU_Ref);
------------
-- Get_12 --
------------
function Get_12 (Arr : System.Address; N : Natural) return Bits_12 is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end Get_12;
-------------
-- GetU_12 --
-------------
function GetU_12 (Arr : System.Address; N : Natural) return Bits_12 is
C : constant ClusterU_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end GetU_12;
------------
-- Set_12 --
------------
procedure Set_12 (Arr : System.Address; N : Natural; E : Bits_12) is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end Set_12;
-------------
-- SetU_12 --
-------------
procedure SetU_12 (Arr : System.Address; N : Natural; E : Bits_12) is
C : constant ClusterU_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end SetU_12;
end System.Pack_12;
| 38.797619 | 78 | 0.494477 |
2e1428077d396b1033baeaaca018e6b7d7b26b2a | 4,746 | ads | Ada | tools/uca_data.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | tools/uca_data.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | tools/uca_data.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2009, 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 Matreshka.Internals.Unicode.Ucd;
package Uca_Data is
type Collation_Element_Kinds is (Regular, Variable);
type Collation_Element is record
Kind : Collation_Element_Kinds;
Primary : Matreshka.Internals.Unicode.Ucd.Collation_Weight;
Secondary : Matreshka.Internals.Unicode.Ucd.Collation_Weight;
Trinary : Matreshka.Internals.Unicode.Ucd.Collation_Weight;
end record;
type Collation_Element_Sequence is
array (Matreshka.Internals.Unicode.Ucd.Sequence_Index range <>)
of Collation_Element;
type Collation_Element_Sequence_Access is
access constant Collation_Element_Sequence;
type Contraction_Data is record
Codes : Matreshka.Internals.Unicode.Ucd.Code_Point_Sequence_Access;
Expansion : Collation_Element_Sequence_Access;
end record;
type Contraction_Data_Array is
array (Positive range <>) of Contraction_Data;
type Contraction_Data_Array_Access is access all Contraction_Data_Array;
type Collation_Record is record
Expansion : Collation_Element_Sequence_Access;
Contraction : Contraction_Data_Array_Access;
end record;
type Collation_Data is
array (Matreshka.Internals.Unicode.Code_Point) of Collation_Record;
type Collation_Data_Access is access all Collation_Data;
Colls : Collation_Data_Access;
procedure Load (Uca_Directory : String);
end Uca_Data;
| 53.325843 | 78 | 0.504846 |
587052dbad7fa7e0414e4e23cacdf73069285507 | 826 | adb | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/call_pn/foo.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/call_pn/foo.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/call_pn/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2010-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/>.
with Pck; use Pck;
procedure Foo is
New_Node : Node_Id;
begin
New_Node := Pn (1234); -- STOP
end Foo;
| 34.416667 | 73 | 0.725182 |
041a79f7b7115886d3076c32c24a33abb782f238 | 9,809 | adb | Ada | Lab6/Worksheet 11/worksheet_11.adb | gabemgem/LITEC | 42679504cbd28425b3f33c09f50492bb60f827bb | [
"Unlicense"
] | null | null | null | Lab6/Worksheet 11/worksheet_11.adb | gabemgem/LITEC | 42679504cbd28425b3f33c09f50492bb60f827bb | [
"Unlicense"
] | null | null | null | Lab6/Worksheet 11/worksheet_11.adb | gabemgem/LITEC | 42679504cbd28425b3f33c09f50492bb60f827bb | [
"Unlicense"
] | null | null | null | M:worksheet_11
F:G$SYSCLK_Init$0$0({2}DF,SV:S),C,0,0,0,0,0
F:G$UART0_Init$0$0({2}DF,SV:S),C,0,0,0,0,0
F:G$Sys_Init$0$0({2}DF,SV:S),C,0,0,0,0,0
F:G$putchar$0$0({2}DF,SV:S),C,0,0,0,0,0
F:G$getchar$0$0({2}DF,SC:U),C,0,0,0,0,0
F:G$getchar_nw$0$0({2}DF,SC:U),C,0,0,0,0,0
F:G$main$0$0({2}DF,SV:S),C,0,0,0,0,0
S:Lworksheet_11.getchar$c$1$10({1}SC:U),R,0,0,[]
S:Lworksheet_11.getchar_nw$c$1$12({1}SC:U),R,0,0,[]
S:G$desired$0$0({2}SI:U),E,0,0
S:G$actual$0$0({2}SI:U),E,0,0
S:G$kp$0$0({2}SI:U),E,0,0
S:G$kd$0$0({2}SI:U),E,0,0
S:G$pw_neut$0$0({2}SI:S),E,0,0
S:G$previous_error$0$0({2}SI:S),E,0,0
S:G$error$0$0({2}SI:S),E,0,0
S:G$temp_motorpw_2byte$0$0({2}SI:S),E,0,0
S:G$temp_motorpw_alg1$0$0({4}SL:S),E,0,0
S:G$temp_motorpw_alg2$0$0({4}SL:S),E,0,0
S:G$temp_motorpw_alg3$0$0({4}SL:S),E,0,0
S:G$temp_motorpw_alg4$0$0({4}SL:S),E,0,0
S:G$temp_motorpw_alg5$0$0({4}SL:S),E,0,0
S:G$temp_motorpw_alg6$0$0({4}SL:S),E,0,0
S:Lworksheet_11.main$sloc0$1$0({4}SL:S),E,0,0
S:G$P0$0$0({1}SC:U),I,0,0
S:G$SP$0$0({1}SC:U),I,0,0
S:G$DPL$0$0({1}SC:U),I,0,0
S:G$DPH$0$0({1}SC:U),I,0,0
S:G$P4$0$0({1}SC:U),I,0,0
S:G$P5$0$0({1}SC:U),I,0,0
S:G$P6$0$0({1}SC:U),I,0,0
S:G$PCON$0$0({1}SC:U),I,0,0
S:G$TCON$0$0({1}SC:U),I,0,0
S:G$TMOD$0$0({1}SC:U),I,0,0
S:G$TL0$0$0({1}SC:U),I,0,0
S:G$TL1$0$0({1}SC:U),I,0,0
S:G$TH0$0$0({1}SC:U),I,0,0
S:G$TH1$0$0({1}SC:U),I,0,0
S:G$CKCON$0$0({1}SC:U),I,0,0
S:G$PSCTL$0$0({1}SC:U),I,0,0
S:G$P1$0$0({1}SC:U),I,0,0
S:G$TMR3CN$0$0({1}SC:U),I,0,0
S:G$TMR3RLL$0$0({1}SC:U),I,0,0
S:G$TMR3RLH$0$0({1}SC:U),I,0,0
S:G$TMR3L$0$0({1}SC:U),I,0,0
S:G$TMR3H$0$0({1}SC:U),I,0,0
S:G$P7$0$0({1}SC:U),I,0,0
S:G$SCON$0$0({1}SC:U),I,0,0
S:G$SCON0$0$0({1}SC:U),I,0,0
S:G$SBUF$0$0({1}SC:U),I,0,0
S:G$SBUF0$0$0({1}SC:U),I,0,0
S:G$SPI0CFG$0$0({1}SC:U),I,0,0
S:G$SPI0DAT$0$0({1}SC:U),I,0,0
S:G$ADC1$0$0({1}SC:U),I,0,0
S:G$SPI0CKR$0$0({1}SC:U),I,0,0
S:G$CPT0CN$0$0({1}SC:U),I,0,0
S:G$CPT1CN$0$0({1}SC:U),I,0,0
S:G$P2$0$0({1}SC:U),I,0,0
S:G$EMI0TC$0$0({1}SC:U),I,0,0
S:G$EMI0CF$0$0({1}SC:U),I,0,0
S:G$PRT0CF$0$0({1}SC:U),I,0,0
S:G$P0MDOUT$0$0({1}SC:U),I,0,0
S:G$PRT1CF$0$0({1}SC:U),I,0,0
S:G$P1MDOUT$0$0({1}SC:U),I,0,0
S:G$PRT2CF$0$0({1}SC:U),I,0,0
S:G$P2MDOUT$0$0({1}SC:U),I,0,0
S:G$PRT3CF$0$0({1}SC:U),I,0,0
S:G$P3MDOUT$0$0({1}SC:U),I,0,0
S:G$IE$0$0({1}SC:U),I,0,0
S:G$SADDR0$0$0({1}SC:U),I,0,0
S:G$ADC1CN$0$0({1}SC:U),I,0,0
S:G$ADC1CF$0$0({1}SC:U),I,0,0
S:G$AMX1SL$0$0({1}SC:U),I,0,0
S:G$P3IF$0$0({1}SC:U),I,0,0
S:G$SADEN1$0$0({1}SC:U),I,0,0
S:G$EMI0CN$0$0({1}SC:U),I,0,0
S:G$_XPAGE$0$0({1}SC:U),I,0,0
S:G$P3$0$0({1}SC:U),I,0,0
S:G$OSCXCN$0$0({1}SC:U),I,0,0
S:G$OSCICN$0$0({1}SC:U),I,0,0
S:G$P74OUT$0$0({1}SC:U),I,0,0
S:G$FLSCL$0$0({1}SC:U),I,0,0
S:G$FLACL$0$0({1}SC:U),I,0,0
S:G$IP$0$0({1}SC:U),I,0,0
S:G$SADEN0$0$0({1}SC:U),I,0,0
S:G$AMX0CF$0$0({1}SC:U),I,0,0
S:G$AMX0SL$0$0({1}SC:U),I,0,0
S:G$ADC0CF$0$0({1}SC:U),I,0,0
S:G$P1MDIN$0$0({1}SC:U),I,0,0
S:G$ADC0L$0$0({1}SC:U),I,0,0
S:G$ADC0H$0$0({1}SC:U),I,0,0
S:G$SMB0CN$0$0({1}SC:U),I,0,0
S:G$SMB0STA$0$0({1}SC:U),I,0,0
S:G$SMB0DAT$0$0({1}SC:U),I,0,0
S:G$SMB0ADR$0$0({1}SC:U),I,0,0
S:G$ADC0GTL$0$0({1}SC:U),I,0,0
S:G$ADC0GTH$0$0({1}SC:U),I,0,0
S:G$ADC0LTL$0$0({1}SC:U),I,0,0
S:G$ADC0LTH$0$0({1}SC:U),I,0,0
S:G$T2CON$0$0({1}SC:U),I,0,0
S:G$T4CON$0$0({1}SC:U),I,0,0
S:G$RCAP2L$0$0({1}SC:U),I,0,0
S:G$RCAP2H$0$0({1}SC:U),I,0,0
S:G$TL2$0$0({1}SC:U),I,0,0
S:G$TH2$0$0({1}SC:U),I,0,0
S:G$SMB0CR$0$0({1}SC:U),I,0,0
S:G$PSW$0$0({1}SC:U),I,0,0
S:G$REF0CN$0$0({1}SC:U),I,0,0
S:G$DAC0L$0$0({1}SC:U),I,0,0
S:G$DAC0H$0$0({1}SC:U),I,0,0
S:G$DAC0CN$0$0({1}SC:U),I,0,0
S:G$DAC1L$0$0({1}SC:U),I,0,0
S:G$DAC1H$0$0({1}SC:U),I,0,0
S:G$DAC1CN$0$0({1}SC:U),I,0,0
S:G$PCA0CN$0$0({1}SC:U),I,0,0
S:G$PCA0MD$0$0({1}SC:U),I,0,0
S:G$PCA0CPM0$0$0({1}SC:U),I,0,0
S:G$PCA0CPM1$0$0({1}SC:U),I,0,0
S:G$PCA0CPM2$0$0({1}SC:U),I,0,0
S:G$PCA0CPM3$0$0({1}SC:U),I,0,0
S:G$PCA0CPM4$0$0({1}SC:U),I,0,0
S:G$ACC$0$0({1}SC:U),I,0,0
S:G$XBR0$0$0({1}SC:U),I,0,0
S:G$XBR1$0$0({1}SC:U),I,0,0
S:G$XBR2$0$0({1}SC:U),I,0,0
S:G$RCAP4L$0$0({1}SC:U),I,0,0
S:G$RCAP4H$0$0({1}SC:U),I,0,0
S:G$EIE1$0$0({1}SC:U),I,0,0
S:G$EIE2$0$0({1}SC:U),I,0,0
S:G$ADC0CN$0$0({1}SC:U),I,0,0
S:G$PCA0L$0$0({1}SC:U),I,0,0
S:G$PCA0CPL0$0$0({1}SC:U),I,0,0
S:G$PCA0CPL1$0$0({1}SC:U),I,0,0
S:G$PCA0CPL2$0$0({1}SC:U),I,0,0
S:G$PCA0CPL3$0$0({1}SC:U),I,0,0
S:G$PCA0CPL4$0$0({1}SC:U),I,0,0
S:G$RSTSRC$0$0({1}SC:U),I,0,0
S:G$B$0$0({1}SC:U),I,0,0
S:G$SCON1$0$0({1}SC:U),I,0,0
S:G$SBUF1$0$0({1}SC:U),I,0,0
S:G$SADDR1$0$0({1}SC:U),I,0,0
S:G$TL4$0$0({1}SC:U),I,0,0
S:G$TH4$0$0({1}SC:U),I,0,0
S:G$EIP1$0$0({1}SC:U),I,0,0
S:G$EIP2$0$0({1}SC:U),I,0,0
S:G$SPI0CN$0$0({1}SC:U),I,0,0
S:G$PCA0H$0$0({1}SC:U),I,0,0
S:G$PCA0CPH0$0$0({1}SC:U),I,0,0
S:G$PCA0CPH1$0$0({1}SC:U),I,0,0
S:G$PCA0CPH2$0$0({1}SC:U),I,0,0
S:G$PCA0CPH3$0$0({1}SC:U),I,0,0
S:G$PCA0CPH4$0$0({1}SC:U),I,0,0
S:G$WDTCN$0$0({1}SC:U),I,0,0
S:G$TMR0$0$0({2}SI:U),I,0,0
S:G$TMR1$0$0({2}SI:U),I,0,0
S:G$TMR2$0$0({2}SI:U),I,0,0
S:G$RCAP2$0$0({2}SI:U),I,0,0
S:G$TMR3$0$0({2}SI:U),I,0,0
S:G$TMR3RL$0$0({2}SI:U),I,0,0
S:G$TMR4$0$0({2}SI:U),I,0,0
S:G$RCAP4$0$0({2}SI:U),I,0,0
S:G$ADC0$0$0({2}SI:U),I,0,0
S:G$ADC0GT$0$0({2}SI:U),I,0,0
S:G$ADC0LT$0$0({2}SI:U),I,0,0
S:G$DAC0$0$0({2}SI:U),I,0,0
S:G$DAC1$0$0({2}SI:U),I,0,0
S:G$PCA0$0$0({2}SI:U),I,0,0
S:G$PCA0CP0$0$0({2}SI:U),I,0,0
S:G$PCA0CP1$0$0({2}SI:U),I,0,0
S:G$PCA0CP2$0$0({2}SI:U),I,0,0
S:G$PCA0CP3$0$0({2}SI:U),I,0,0
S:G$PCA0CP4$0$0({2}SI:U),I,0,0
S:G$P0_0$0$0({1}SX:U),J,0,0
S:G$P0_1$0$0({1}SX:U),J,0,0
S:G$P0_2$0$0({1}SX:U),J,0,0
S:G$P0_3$0$0({1}SX:U),J,0,0
S:G$P0_4$0$0({1}SX:U),J,0,0
S:G$P0_5$0$0({1}SX:U),J,0,0
S:G$P0_6$0$0({1}SX:U),J,0,0
S:G$P0_7$0$0({1}SX:U),J,0,0
S:G$IT0$0$0({1}SX:U),J,0,0
S:G$IE0$0$0({1}SX:U),J,0,0
S:G$IT1$0$0({1}SX:U),J,0,0
S:G$IE1$0$0({1}SX:U),J,0,0
S:G$TR0$0$0({1}SX:U),J,0,0
S:G$TF0$0$0({1}SX:U),J,0,0
S:G$TR1$0$0({1}SX:U),J,0,0
S:G$TF1$0$0({1}SX:U),J,0,0
S:G$P1_0$0$0({1}SX:U),J,0,0
S:G$P1_1$0$0({1}SX:U),J,0,0
S:G$P1_2$0$0({1}SX:U),J,0,0
S:G$P1_3$0$0({1}SX:U),J,0,0
S:G$P1_4$0$0({1}SX:U),J,0,0
S:G$P1_5$0$0({1}SX:U),J,0,0
S:G$P1_6$0$0({1}SX:U),J,0,0
S:G$P1_7$0$0({1}SX:U),J,0,0
S:G$RI$0$0({1}SX:U),J,0,0
S:G$RI0$0$0({1}SX:U),J,0,0
S:G$TI$0$0({1}SX:U),J,0,0
S:G$TI0$0$0({1}SX:U),J,0,0
S:G$RB8$0$0({1}SX:U),J,0,0
S:G$RB80$0$0({1}SX:U),J,0,0
S:G$TB8$0$0({1}SX:U),J,0,0
S:G$TB80$0$0({1}SX:U),J,0,0
S:G$REN$0$0({1}SX:U),J,0,0
S:G$REN0$0$0({1}SX:U),J,0,0
S:G$SM2$0$0({1}SX:U),J,0,0
S:G$SM20$0$0({1}SX:U),J,0,0
S:G$MCE0$0$0({1}SX:U),J,0,0
S:G$SM1$0$0({1}SX:U),J,0,0
S:G$SM10$0$0({1}SX:U),J,0,0
S:G$SM0$0$0({1}SX:U),J,0,0
S:G$SM00$0$0({1}SX:U),J,0,0
S:G$S0MODE$0$0({1}SX:U),J,0,0
S:G$P2_0$0$0({1}SX:U),J,0,0
S:G$P2_1$0$0({1}SX:U),J,0,0
S:G$P2_2$0$0({1}SX:U),J,0,0
S:G$P2_3$0$0({1}SX:U),J,0,0
S:G$P2_4$0$0({1}SX:U),J,0,0
S:G$P2_5$0$0({1}SX:U),J,0,0
S:G$P2_6$0$0({1}SX:U),J,0,0
S:G$P2_7$0$0({1}SX:U),J,0,0
S:G$EX0$0$0({1}SX:U),J,0,0
S:G$ET0$0$0({1}SX:U),J,0,0
S:G$EX1$0$0({1}SX:U),J,0,0
S:G$ET1$0$0({1}SX:U),J,0,0
S:G$ES0$0$0({1}SX:U),J,0,0
S:G$ES$0$0({1}SX:U),J,0,0
S:G$ET2$0$0({1}SX:U),J,0,0
S:G$EA$0$0({1}SX:U),J,0,0
S:G$P3_0$0$0({1}SX:U),J,0,0
S:G$P3_1$0$0({1}SX:U),J,0,0
S:G$P3_2$0$0({1}SX:U),J,0,0
S:G$P3_3$0$0({1}SX:U),J,0,0
S:G$P3_4$0$0({1}SX:U),J,0,0
S:G$P3_5$0$0({1}SX:U),J,0,0
S:G$P3_6$0$0({1}SX:U),J,0,0
S:G$P3_7$0$0({1}SX:U),J,0,0
S:G$PX0$0$0({1}SX:U),J,0,0
S:G$PT0$0$0({1}SX:U),J,0,0
S:G$PX1$0$0({1}SX:U),J,0,0
S:G$PT1$0$0({1}SX:U),J,0,0
S:G$PS0$0$0({1}SX:U),J,0,0
S:G$PS$0$0({1}SX:U),J,0,0
S:G$PT2$0$0({1}SX:U),J,0,0
S:G$SMBTOE$0$0({1}SX:U),J,0,0
S:G$SMBFTE$0$0({1}SX:U),J,0,0
S:G$AA$0$0({1}SX:U),J,0,0
S:G$SI$0$0({1}SX:U),J,0,0
S:G$STO$0$0({1}SX:U),J,0,0
S:G$STA$0$0({1}SX:U),J,0,0
S:G$ENSMB$0$0({1}SX:U),J,0,0
S:G$BUSY$0$0({1}SX:U),J,0,0
S:G$CPRL2$0$0({1}SX:U),J,0,0
S:G$CT2$0$0({1}SX:U),J,0,0
S:G$TR2$0$0({1}SX:U),J,0,0
S:G$EXEN2$0$0({1}SX:U),J,0,0
S:G$TCLK$0$0({1}SX:U),J,0,0
S:G$RCLK$0$0({1}SX:U),J,0,0
S:G$EXF2$0$0({1}SX:U),J,0,0
S:G$TF2$0$0({1}SX:U),J,0,0
S:G$P$0$0({1}SX:U),J,0,0
S:G$F1$0$0({1}SX:U),J,0,0
S:G$OV$0$0({1}SX:U),J,0,0
S:G$RS0$0$0({1}SX:U),J,0,0
S:G$RS1$0$0({1}SX:U),J,0,0
S:G$F0$0$0({1}SX:U),J,0,0
S:G$AC$0$0({1}SX:U),J,0,0
S:G$CY$0$0({1}SX:U),J,0,0
S:G$CCF0$0$0({1}SX:U),J,0,0
S:G$CCF1$0$0({1}SX:U),J,0,0
S:G$CCF2$0$0({1}SX:U),J,0,0
S:G$CCF3$0$0({1}SX:U),J,0,0
S:G$CCF4$0$0({1}SX:U),J,0,0
S:G$CR$0$0({1}SX:U),J,0,0
S:G$CF$0$0({1}SX:U),J,0,0
S:G$ADLJST$0$0({1}SX:U),J,0,0
S:G$AD0LJST$0$0({1}SX:U),J,0,0
S:G$ADWINT$0$0({1}SX:U),J,0,0
S:G$AD0WINT$0$0({1}SX:U),J,0,0
S:G$ADSTM0$0$0({1}SX:U),J,0,0
S:G$AD0CM0$0$0({1}SX:U),J,0,0
S:G$ADSTM1$0$0({1}SX:U),J,0,0
S:G$AD0CM1$0$0({1}SX:U),J,0,0
S:G$ADBUSY$0$0({1}SX:U),J,0,0
S:G$AD0BUSY$0$0({1}SX:U),J,0,0
S:G$ADCINT$0$0({1}SX:U),J,0,0
S:G$AD0INT$0$0({1}SX:U),J,0,0
S:G$ADCTM$0$0({1}SX:U),J,0,0
S:G$AD0TM$0$0({1}SX:U),J,0,0
S:G$ADCEN$0$0({1}SX:U),J,0,0
S:G$AD0EN$0$0({1}SX:U),J,0,0
S:G$SPIEN$0$0({1}SX:U),J,0,0
S:G$MSTEN$0$0({1}SX:U),J,0,0
S:G$SLVSEL$0$0({1}SX:U),J,0,0
S:G$TXBSY$0$0({1}SX:U),J,0,0
S:G$RXOVRN$0$0({1}SX:U),J,0,0
S:G$MODF$0$0({1}SX:U),J,0,0
S:G$WCOL$0$0({1}SX:U),J,0,0
S:G$SPIF$0$0({1}SX:U),J,0,0
S:G$SYSCLK_Init$0$0({2}DF,SV:S),C,0,0
S:G$UART0_Init$0$0({2}DF,SV:S),C,0,0
S:G$Sys_Init$0$0({2}DF,SV:S),C,0,0
S:G$getchar_nw$0$0({2}DF,SC:U),C,0,0
S:G$_print_format$0$0({2}DF,SI:S),C,0,0
S:G$printf_small$0$0({2}DF,SV:S),C,0,0
S:G$printf$0$0({2}DF,SI:S),C,0,0
S:G$vprintf$0$0({2}DF,SI:S),C,0,0
S:G$sprintf$0$0({2}DF,SI:S),C,0,0
S:G$vsprintf$0$0({2}DF,SI:S),C,0,0
S:G$puts$0$0({2}DF,SI:S),C,0,0
S:G$getchar$0$0({2}DF,SC:U),C,0,0
S:G$putchar$0$0({2}DF,SV:S),C,0,0
S:G$printf_fast$0$0({2}DF,SV:S),C,0,0
S:G$printf_fast_f$0$0({2}DF,SV:S),C,0,0
S:G$printf_tiny$0$0({2}DF,SV:S),C,0,0
S:G$main$0$0({2}DF,SV:S),C,0,0
S:Fworksheet_11$__str_0$0$0({45}DA45d,SC:S),D,0,0
S:Fworksheet_11$__str_1$0$0({56}DA56d,SC:S),D,0,0
S:Fworksheet_11$__str_2$0$0({56}DA56d,SC:S),D,0,0
S:Fworksheet_11$__str_3$0$0({56}DA56d,SC:S),D,0,0
S:Fworksheet_11$__str_4$0$0({56}DA56d,SC:S),D,0,0
S:Fworksheet_11$__str_5$0$0({56}DA56d,SC:S),D,0,0
S:Fworksheet_11$__str_6$0$0({56}DA56d,SC:S),D,0,0
| 30.088957 | 51 | 0.564176 |
2f99196b213f0feadd9414dd81a26fd32f1d423e | 2,362 | ads | Ada | stm32f0/stm32f030x/svd/stm32_svd-interrupts.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | stm32f0/stm32f030x/svd/stm32_svd-interrupts.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | stm32f0/stm32f030x/svd/stm32_svd-interrupts.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | -- This spec has been automatically generated from STM32F030.svd
-- Definition of the device's interrupts
package STM32_SVD.Interrupts is
----------------
-- Interrupts --
----------------
-- Window Watchdog interrupt
WWDG : constant := 0;
-- PVD and VDDIO2 supply comparator interrupt
PVD : constant := 1;
-- RCC and CRS global interrupts
RCC_CRS : constant := 4;
-- EXTI Line[1:0] interrupts
EXTI0_1 : constant := 5;
-- EXTI Line[3:2] interrupts
EXTI2_3 : constant := 6;
-- EXTI Line15 and EXTI4 interrupts
EXTI4_15 : constant := 7;
-- DMA channel 1 interrupt
DMA_CH1 : constant := 9;
-- DMA channel 2 and 3 interrupts
DMA_CH2_3 : constant := 10;
-- DMA channel 4, 5, 6 and 7 interrupts
DMA_CH4_5_6_7 : constant := 11;
-- ADC and comparator interrupts
ADC_COMP : constant := 12;
-- TIM1 break, update, trigger and commutation interrupt
TIM1_BRK_UP_TRG_COM : constant := 13;
-- TIM1 Capture Compare interrupt
TIM1_CC : constant := 14;
-- TIM2 global interrupt
TIM2 : constant := 15;
-- TIM3 global interrupt
TIM3 : constant := 16;
-- TIM6 global interrupt and DAC underrun interrupt
TIM6_DAC : constant := 17;
-- TIM7 global interrupt
TIM7 : constant := 18;
-- TIM14 global interrupt
TIM14 : constant := 19;
-- I2C1 global interrupt
I2C1 : constant := 23;
-- I2C2 global interrupt
I2C2 : constant := 24;
-- SPI1_global_interrupt
SPI1 : constant := 25;
-- SPI2 global interrupt
SPI2 : constant := 26;
-- USART1 global interrupt
USART1 : constant := 27;
-- USART2 global interrupt
USART2 : constant := 28;
-- USART3 and USART4 global interrupt
USART3_4 : constant := 29;
end STM32_SVD.Interrupts;
| 28.457831 | 65 | 0.478408 |
a1f5dcb032b7a1229fd5587ce1ae4b48821e1280 | 2,627 | ads | Ada | orka_simd/src/x86/gnat/orka-simd-avx-singles-math.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | orka_simd/src/x86/gnat/orka-simd-avx-singles-math.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | orka_simd/src/x86/gnat/orka-simd-avx-singles-math.ads | 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) 2016 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.
package Orka.SIMD.AVX.Singles.Math is
pragma Pure;
function Min (Left, Right : m256) return m256
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_minps256";
-- Compare each 32-bit float in Left and Right and take the minimum values.
--
-- Result (I) := Float'Min (Left (I), Right (I)) for I in 1 ..4
function Max (Left, Right : m256) return m256
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_maxps256";
-- Compare each 32-bit float in Left and Right and take the maximum values.
--
-- Result (I) := Float'Max (Left (I), Right (I)) for I in 1 ..4
function Reciprocal (Elements : m256) return m256
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_rcpps256";
-- Return the reciprocal (1/X) of each element
function Reciprocal_Sqrt (Elements : m256) return m256
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_rsqrtps256";
-- Return the reciprocal of the square root (1/Sqrt(X)) of each element
function Sqrt (Elements : m256) return m256
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_sqrtps256";
-- Return the square root (Sqrt(X)) of each element
function Round (Elements : m256; Rounding : Unsigned_32) return m256
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_roundps256";
function Round_Nearest_Integer (Elements : m256) return m256 is
(Round (Elements, 0));
-- Round each element to the nearest integer
function Floor (Elements : m256) return m256 is
(Round (Elements, 1));
-- Round each element down to an integer value
function Ceil (Elements : m256) return m256 is
(Round (Elements, 2));
-- Round each element up to an integer value
function Round_Truncate (Elements : m256) return m256 is
(Round (Elements, 3));
-- Round each element to zero
end Orka.SIMD.AVX.Singles.Math;
| 41.046875 | 88 | 0.702322 |
2e48386069420638cf5e17f7e6fb4287ea30b755 | 2,606 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd5013m.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/cd/cd5013m.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd5013m.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CD5013M.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 AN ADDRESS CLAUSE CAN BE GIVEN IN THE VISIBLE PART OF
-- A PACKAGE SPECIFICATION FOR A VARIABLE OF AN ACCESS TYPE, WHERE
-- THE VARIABLE IS DECLARED IN THE VISIBLE PART OF THE
-- SPECIFICATION.
-- HISTORY:
-- BCB 09/16/87 CREATED ORIGINAL TEST.
-- PWB 05/11/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA'.
WITH REPORT; USE REPORT;
WITH SPPRT13; USE SPPRT13;
WITH SYSTEM; USE SYSTEM;
PROCEDURE CD5013M IS
TYPE ACC_TYPE IS ACCESS INTEGER;
PACKAGE PACK IS
CHECK_VAR : ACC_TYPE;
FOR CHECK_VAR USE
AT VARIABLE_ADDRESS;
END PACK;
USE PACK;
BEGIN
TEST ("CD5013M", "AN ADDRESS CLAUSE CAN BE GIVEN IN " &
"THE VISIBLE PART OF A PACKAGE SPECIFICATION " &
"FOR A VARIABLE OF AN ACCESS TYPE, WHERE THE " &
"VARIABLE IS DECLARED IN THE VISIBLE PART OF " &
"THE SPECIFICATION");
CHECK_VAR := NEW INTEGER'(100);
IF EQUAL(3,3) THEN
CHECK_VAR := NEW INTEGER'(25);
END IF;
IF CHECK_VAR.ALL /= 25 THEN
FAILED ("INCORRECT VALUE FOR ACCESS VARIABLE");
END IF;
IF CHECK_VAR'ADDRESS /= VARIABLE_ADDRESS THEN
FAILED ("INCORRECT ADDRESS FOR ACCESS VARIABLE");
END IF;
RESULT;
END CD5013M;
| 35.216216 | 79 | 0.637375 |
ad62aea9bf64908de2fa35363e1f18a7bc0781f5 | 3,132 | ads | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-vercon.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-vercon.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-vercon.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . V E R S I O N _ C O N T R O L --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This module contains the runtime routine for implementation of the
-- Version and Body_Version attributes, as well as the string type that
-- is returned as a result of using these attributes.
with System.Unsigned_Types;
package System.Version_Control is
pragma Pure;
subtype Version_String is String (1 .. 8);
-- Eight character string returned by Get_version_String
function Get_Version_String
(V : System.Unsigned_Types.Unsigned)
return Version_String;
-- The version information in the executable file is stored as unsigned
-- integers. This routine converts the unsigned integer into an eight
-- character string containing its hexadecimal digits (with lower case
-- letters).
end System.Version_Control;
| 59.09434 | 78 | 0.409323 |
13f318b3257cd4bc32f3fdf8180500db9eb7e7cb | 1,538 | ads | Ada | 3-mid/impact/source/3d/collision/narrowphase/impact-d3-collision-convex_raycast-gjk.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/3d/collision/narrowphase/impact-d3-collision-convex_raycast-gjk.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/3d/collision/narrowphase/impact-d3-collision-convex_raycast-gjk.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | -- #include "BulletCollision/CollisionShapes/impact.d3.collision.Margin.h"
--
-- #include "LinearMath/impact.d3.Vector.h"
-- #include "impact.d3.collision.convex_Raycast.h"
-- class impact.d3.Shape.convex;
-- class btMinkowskiSumShape;
-- #include "impact.d3.collision.simplex_Solver.h"
with impact.d3.collision.convex_Raycast;
with impact.d3.collision.simplex_Solver;
with impact.d3.Shape.convex;
package impact.d3.collision.convex_Raycast.gjk
--
-- Performs a raycast on a convex object using support mapping.
--
is
type Item is new impact.d3.collision.convex_Raycast.item with private;
function to_gjk_convex_Raycast (convexA, convexB : access impact.d3.Shape.convex.Item'Class;
simplexSolver : access impact.d3.collision.simplex_Solver.Item'Class) return Item;
overriding function calcTimeOfImpact (Self : access Item; fromA, toA : in Transform_3d;
fromB, toB : in Transform_3d;
result : access impact.d3.collision.convex_Raycast.CastResult'Class) return Boolean;
--
-- Cast a convex against another convex object.
private
type Item is new impact.d3.collision.convex_Raycast.item with
record
m_simplexSolver : access impact.d3.collision.simplex_Solver.Item'Class;
m_convexA,
m_convexB : access impact.d3.Shape.convex.Item'Class;
end record;
end impact.d3.collision.convex_Raycast.gjk;
| 29.018868 | 140 | 0.672302 |
c71591a8998cf742f31da82e25f730de2a7704d5 | 3,655 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2111a.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/ce2111a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2111a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE2111A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT THE FILE REMAINS OPEN AFTER A RESET.
-- THIS OBJECTIVE IS BEING INTERPRETED AS : CHECK THAT A FILE
-- REMAINS OPEN AFTER AN ATTEMPT TO RESET.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- SEQUENTIAL FILES.
-- HISTORY:
-- DLD 08/13/82
-- SPS 11/09/82
-- JBG 03/24/83
-- EG 05/28/85
-- JLH 07/22/87 REWROTE TEST ALGORITHM.
WITH REPORT; USE REPORT;
WITH SEQUENTIAL_IO;
PROCEDURE CE2111A IS
PACKAGE SEQ_IO IS NEW SEQUENTIAL_IO(INTEGER);
USE SEQ_IO;
SEQ_FILE : SEQ_IO.FILE_TYPE;
VAR1 : INTEGER := 5;
INCOMPLETE : EXCEPTION;
BEGIN
TEST ("CE2111A", "CHECK THAT THE FILE REMAINS OPEN AFTER A RESET");
-- CREATE SEQUENTIAL TEST FILE
BEGIN
CREATE (SEQ_FILE, OUT_FILE, LEGAL_FILE_NAME);
WRITE (SEQ_FILE, VAR1);
CLOSE (SEQ_FILE);
EXCEPTION
WHEN USE_ERROR | NAME_ERROR =>
NOT_APPLICABLE ("SEQUENTIAL FILES NOT SUPPORTED");
RAISE INCOMPLETE;
END;
-- OPEN FILE
BEGIN
OPEN (SEQ_FILE, IN_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("OPEN WITH IN_FILE MODE NOT SUPPORTED " &
"FOR SEQ_IO");
RAISE INCOMPLETE;
END;
-- RESET FILE
BEGIN
RESET(SEQ_FILE);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
IF IS_OPEN (SEQ_FILE) THEN
CLOSE (SEQ_FILE);
ELSE
FAILED ("RESET FOR IN_FILE, CLOSED FILE");
END IF;
-- RE-OPEN AS OUT_FILE AND REPEAT TEST
BEGIN
OPEN (SEQ_FILE, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("OPEN WITH OUT_FILE MODE NOT " &
"SUPPORTED FOR SEQ_IO");
RAISE INCOMPLETE;
END;
BEGIN
RESET (SEQ_FILE);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
IF IS_OPEN (SEQ_FILE) THEN
BEGIN
DELETE (SEQ_FILE);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
ELSE
FAILED ("RESET FOR OUT_FILE, CLOSED FILE");
END IF;
RESULT;
EXCEPTION
WHEN INCOMPLETE =>
RESULT;
END CE2111A;
| 27.689394 | 79 | 0.594254 |
a1ee4c8b9d353f7def3e12530c3d4dcabbc761aa | 1,796 | adb | Ada | src/file_utils.adb | psyomn/ash | 7630208f9f2dc296f75076141d591354bde02ac7 | [
"Apache-2.0"
] | 11 | 2017-04-08T17:48:19.000Z | 2021-12-31T23:36:25.000Z | src/file_utils.adb | psyomn/axios | 7630208f9f2dc296f75076141d591354bde02ac7 | [
"Apache-2.0"
] | 3 | 2017-03-24T04:34:15.000Z | 2017-04-03T05:18:47.000Z | src/file_utils.adb | psyomn/axios | 7630208f9f2dc296f75076141d591354bde02ac7 | [
"Apache-2.0"
] | 4 | 2017-05-14T11:46:37.000Z | 2019-04-18T20:34:07.000Z | -- Copyright 2019 Simon Symeonidis (psyomn)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with Ada.Text_IO;
with Ada.Directories;
with Ada.Direct_IO;
with Ada.Exceptions; use Ada.Exceptions;
package body File_Utils is
package IO renames Ada.Text_IO;
function Read (File_Name : String) return String is
File_Size : constant Natural :=
Natural (Ada.Directories.Size (File_Name));
subtype File_String is String (1 .. File_Size);
package File_String_IO is new Ada.Direct_IO (File_String);
The_File : File_String_IO.File_Type;
Contents : File_String;
begin
File_String_IO.Open
(File => The_File,
Mode => File_String_IO.In_File,
Name => File_Name);
File_String_IO.Read (The_File, Item => Contents);
File_String_IO.Close (File => The_File);
return Contents;
exception
when File_String_IO.Device_Error =>
File_String_IO.Close (File => The_File);
raise File_String_IO.Device_Error;
end Read;
function Is_Dir (Path : String) return Boolean is
use type Ada.Directories.File_Kind;
begin
return Ada.Directories.Exists (Path)
and then Ada.Directories.Kind (Path) = Ada.Directories.Directory;
end Is_Dir;
end File_Utils;
| 32.654545 | 78 | 0.699332 |
c7de0505f5874191aee4f0a1b841582839bf6227 | 797 | ads | Ada | gnu/src/gdb/gdb/testsuite/gdb.ada/variant_record_packed_array/pck.ads | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/variant_record_packed_array/pck.ads | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/variant_record_packed_array/pck.ads | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | -- Copyright 2009-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
procedure Do_Nothing (A : System.Address);
end Pck;
| 41.947368 | 73 | 0.739021 |
04bc3d1bd1cbe47e0fa493c5aa083395189e0455 | 155 | ads | Ada | zfp-gba/gnat_user/s-alloca.ads | 98devin/ada-gba-dev | 6ebca014b7537117144d878db8d13db49aa00cee | [
"Zlib"
] | 7 | 2021-04-08T02:32:54.000Z | 2022-02-14T01:21:43.000Z | zfp-gba/gnat_user/s-alloca.ads | 98devin/ada-gba-dev | 6ebca014b7537117144d878db8d13db49aa00cee | [
"Zlib"
] | 15 | 2021-04-09T20:13:33.000Z | 2021-12-22T01:03:59.000Z | zfp-gba/gnat_user/s-alloca.ads | 98devin/ada-gba-dev | 6ebca014b7537117144d878db8d13db49aa00cee | [
"Zlib"
] | 1 | 2021-06-12T07:48:05.000Z | 2021-06-12T07:48:05.000Z | -- Copyright (c) 2021 Devin Hill
-- zlib License -- see LICENSE for details.
package System.Allocation is
pragma Preelaborate;
end System.Allocation; | 25.833333 | 44 | 0.748387 |
2e9b0bc19ee3f328aa1336d76036f02700af1430 | 752 | adb | Ada | gdb/testsuite/gdb.ada/dgopt/x.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | 1 | 2020-10-14T03:24:35.000Z | 2020-10-14T03:24:35.000Z | gdb/testsuite/gdb.ada/dgopt/x.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | gdb/testsuite/gdb.ada/dgopt/x.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2019-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/>.
procedure X is
begin
null;
end X;
| 37.6 | 73 | 0.735372 |
4b0464a4b976c4ddb2b62eee20ffd6e51d176ebb | 4,478 | adb | Ada | test/ctestc/src/ctestc.adb | ficorax/PortAudioAda | 565cf8a3ad4ec3f6cbe1ed2dae75f42d001f052e | [
"MIT"
] | 2 | 2022-02-26T04:14:01.000Z | 2022-03-07T09:57:25.000Z | test/ctestc/src/ctestc.adb | ficorax/PortAudioAda | 565cf8a3ad4ec3f6cbe1ed2dae75f42d001f052e | [
"MIT"
] | null | null | null | test/ctestc/src/ctestc.adb | ficorax/PortAudioAda | 565cf8a3ad4ec3f6cbe1ed2dae75f42d001f052e | [
"MIT"
] | null | null | null | with Ada.Command_Line;
with Ada.Long_Float_Text_IO; use Ada.Long_Float_Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Text_IO; use Ada.Text_IO;
with System; use System;
with PortAudioAda; use PortAudioAda;
with Ctestc_Types; use Ctestc_Types;
with Ctestc_Callbacks; use Ctestc_Callbacks;
procedure Ctestc
is
package ACL renames Ada.Command_Line;
err : PA_Error;
stream : aliased PA_Stream_Ptr;
framesPerBuffer : Integer := Default_Buffer_Size;
outLatency : Integer := 0;
minLatency : constant Integer := Default_Buffer_Size * 2;
sampleRate : Long_Float := 44100.0;
Finish : Boolean := False;
begin
Put_Line ("pa_minlat - Determine minimum latency for your computer.");
Put_Line (" usage: pa_minlat {userBufferSize}");
Put_Line (" for example: pa_minlat 64");
Put_Line ("Adjust your stereo until you hear" &
" a smooth tone in each speaker.");
Put_Line ("Then try to find the smallest number" &
" of frames that still sounds smooth.");
Put_Line ("Note that the sound will stop momentarily" &
" when you change the number of buffers.");
-- Get bufferSize from command line.
if ACL.Argument_Count > 0 then
framesPerBuffer := Integer'Value (ACL.Argument (1));
end if;
Put ("Frames per buffer = ");
Put (framesPerBuffer, 0);
New_Line;
data.left_phase := 0.0;
data.right_phase := 0.0;
err := PA_Initialize;
if err /= paNoError then
raise PortAudio_Exception;
end if;
outLatency := Integer (sampleRate * 200.0 / 1000.0); -- 200 msec.
-- Try different numBuffers in a loop.
while not Finish loop
outputParameters.device := PA_Get_Default_Output_Device;
outputParameters.channelCount := 2;
outputParameters.sampleFormat := paFloat32;
outputParameters.suggestedLatency :=
PA_Time (outLatency) / PA_Time (sampleRate);
outputParameters.hostApiSpecificStreamInfo := System.Null_Address;
-- printf("%6.1f msec.\n", outLatency, . * 1000.0 );
Put ("Latency = ");
Put (outLatency, 0);
Put (" frames = ");
Put (Long_Float (outputParameters.suggestedLatency) * 1000.0, 0, 1, 0);
Put_Line (" msec.");
err := PA_Open_Stream
(stream'Access,
null,
outputParameters'Access,
sampleRate,
IC.unsigned_long (framesPerBuffer),
paClipOff,
paMinLatCallback'Access,
data'Address);
if err /= paNoError or stream = null then
raise PortAudio_Exception;
end if;
-- Start audio.
err := PA_Start_Stream (stream);
if err /= paNoError then
raise PortAudio_Exception;
end if;
-- Ask user for a new nlatency.
New_Line;
Put_Line ("Move windows around to see if the sound glitches.");
Put ("Latency now ");
Put (outLatency, 0);
Put (", enter new number of frames, or 'q' to quit: ");
declare
str : constant access String := new String'(Ada.Text_IO.Get_Line);
begin
if str.all (1) = 'q' then
Finish := True;
else
outLatency := Integer'Value (str.all);
if outLatency < minLatency then
Put ("Latency below minimum of ");
Put (minLatency, 0);
Put_Line ("! Set to minimum!!!");
outLatency := minLatency;
end if;
end if;
exception
when others =>
Put_Line ("Put integer number or 'q' to quit");
end;
-- Stop sound until ENTER hit.
err := PA_Stop_Stream (stream);
if err /= paNoError then
raise PortAudio_Exception;
end if;
err := PA_Close_Stream (stream);
if err /= paNoError then
raise PortAudio_Exception;
end if;
end loop;
Put_Line ("A good setting for latency would be somewhat higher than");
Put_Line ("the minimum latency that worked.");
Put_Line ("PortAudio: Test finished.");
err := PA_Terminate;
-----------------------------------------------------------------------------
exception
when PortAudio_Exception =>
err := PA_Terminate;
Put_Line ("Error occured while using the PortAudio stream");
Put_Line ("Error code: " & PA_Error'Image (err));
Put_Line ("Error message: " & PA_Get_Error_Text (err));
end Ctestc;
| 29.460526 | 80 | 0.602278 |
22bad81b4e0f2886fa6a03e27e14e3e8645ee451 | 5,650 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-taspri-posix.ads | 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-taspri-posix.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-taspri-posix.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K _ P R I M I T I V E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1991-1994, Florida State University --
-- Copyright (C) 1995-2005, AdaCore --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is a POSIX-like version of this package
-- Note: this file can only be used for POSIX compliant systems
pragma Polling (Off);
-- Turn off polling, we do not want ATC polling to take place during
-- tasking operations. It causes infinite loops and other problems.
with System.OS_Interface;
-- used for pthread_mutex_t
-- pthread_cond_t
-- pthread_t
package System.Task_Primitives is
pragma Preelaborate;
type Lock is limited private;
-- Should be used for implementation of protected objects
type RTS_Lock is limited private;
-- Should be used inside the runtime system. The difference between Lock
-- and the RTS_Lock is that the later one serves only as a semaphore so
-- that do not check for ceiling violations.
type Suspension_Object is limited private;
-- Should be used for the implementation of Ada.Synchronous_Task_Control
type Task_Body_Access is access procedure;
-- Pointer to the task body's entry point (or possibly a wrapper declared
-- local to the GNARL).
type Private_Data is limited private;
-- Any information that the GNULLI needs maintained on a per-task basis.
-- A component of this type is guaranteed to be included in the
-- Ada_Task_Control_Block.
private
type Lock is new System.OS_Interface.pthread_mutex_t;
type RTS_Lock is new System.OS_Interface.pthread_mutex_t;
type Suspension_Object is record
State : Boolean;
pragma Atomic (State);
-- Boolean that indicates whether the object is open. This field is
-- marked Atomic to ensure that we can read its value without locking
-- the access to the Suspension_Object.
Waiting : Boolean;
-- Flag showing if there is a task already suspended on this object
L : aliased System.OS_Interface.pthread_mutex_t;
-- Protection for ensuring mutual exclusion on the Suspension_Object
CV : aliased System.OS_Interface.pthread_cond_t;
-- Condition variable used to queue threads until condition is signaled
end record;
type Private_Data is record
Thread : aliased System.OS_Interface.pthread_t;
pragma Atomic (Thread);
-- Thread field may be updated by two different threads of control.
-- (See, Enter_Task and Create_Task in s-taprop.adb). They put the same
-- value (thr_self value). We do not want to use lock on those
-- operations and the only thing we have to make sure is that they are
-- updated in atomic fashion.
LWP : aliased System.Address;
-- The purpose of this field is to provide a better tasking support on
-- gdb. The order of the two first fields (Thread and LWP) is important.
-- On targets where lwp is not relevant, this is equivalent to Thread.
CV : aliased System.OS_Interface.pthread_cond_t;
-- Should be commented ??? (in all versions of taspri)
L : aliased RTS_Lock;
-- Protection for all components is lock L
end record;
end System.Task_Primitives;
| 49.130435 | 79 | 0.573097 |
2eaa5c2b1a5bbf95df6e1317651e0f766a4ed4f4 | 256 | adb | Ada | src/tom/library/sl/ada/objectpack.adb | rewriting/tom | 2918e95c78006f08a2a0919ef440413fa5c2342a | [
"BSD-3-Clause"
] | 36 | 2016-02-19T12:09:49.000Z | 2022-02-03T13:13:21.000Z | src/tom/library/sl/ada/objectpack.adb | rewriting/tom | 2918e95c78006f08a2a0919ef440413fa5c2342a | [
"BSD-3-Clause"
] | null | null | null | src/tom/library/sl/ada/objectpack.adb | rewriting/tom | 2918e95c78006f08a2a0919ef440413fa5c2342a | [
"BSD-3-Clause"
] | 6 | 2017-11-30T17:07:10.000Z | 2022-03-12T14:46:21.000Z | with System, System.Storage_Elements;
use System, System.Storage_Elements;
package body ObjectPack is
function hash(obj: Item) return Integer is
addr : Integer_Address := To_Integer(obj'Address);
begin
return Integer(addr mod 2**31);
end;
end;
| 19.692308 | 52 | 0.753906 |
adc7594758f5230e6a3c78e14d91402b8b6b7858 | 2,847 | adb | Ada | day03/tests/fms-test.adb | jwarwick/aoc_2019_ada | 2168249071d235ec76d8424967811d03e9415f5c | [
"MIT"
] | null | null | null | day03/tests/fms-test.adb | jwarwick/aoc_2019_ada | 2168249071d235ec76d8424967811d03e9415f5c | [
"MIT"
] | null | null | null | day03/tests/fms-test.adb | jwarwick/aoc_2019_ada | 2168249071d235ec76d8424967811d03e9415f5c | [
"MIT"
] | null | null | null | with AUnit.Assertions; use AUnit.Assertions;
with Ada.Containers;
use type Ada.Containers.Count_Type;
package body FMS.Test is
procedure Test_Load (T : in out AUnit.Test_Cases.Test_Case'Class) is
pragma Unreferenced (T);
begin
null;
load("R8,U5,L5,D3", "U7,R6,D4,L4");
Assert(wire_1.Length = 4, "Expected wire_1 to have 4 elements");
Assert(wire_2.Length = 4, "Expected wire_2 to have 4 elements");
Assert(wire_points_1.Length = 21, "Expected wire_1 points to have 21 elements");
Assert(wire_points_2.Length = 21, "Expected wire_1 points to have 21 elements");
load("R75,D30,R83,U83,L12,D49,R71,U7,L72", "U62,R66,U55,R34,D71,R55,D58,R83");
Assert(wire_1.Length = 9, "Expected wire_1 to have 9 elements");
Assert(wire_2.Length = 8, "Expected wire_2 to have 8 elements");
load("R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51", "U98,R91,D20,R16,D67,R40,U7,R15,U6,R7");
Assert(wire_1.Length = 11, "Expected wire_1 to have 11 elements");
Assert(wire_2.Length = 10, "Expected wire_2 to have 10 elements");
end Test_Load;
procedure Test_Closest (T : in out AUnit.Test_Cases.Test_Case'Class) is
pragma Unreferenced (T);
begin
load("R8,U5,L5,D3", "U7,R6,D4,L4");
Assert(closest_intersection = 6, "Expected closest intersection at distance 6");
load("R75,D30,R83,U83,L12,D49,R71,U7,L72", "U62,R66,U55,R34,D71,R55,D58,R83");
Assert(closest_intersection = 159, "Expected closest intersection at distance 159");
load("R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51", "U98,R91,D20,R16,D67,R40,U7,R15,U6,R7");
Assert(closest_intersection = 135, "Expected closest intersection at distance 135");
end Test_Closest;
procedure Test_Shortest (T : in out AUnit.Test_Cases.Test_Case'Class) is
pragma Unreferenced (T);
begin
load("R8,U5,L5,D3", "U7,R6,D4,L4");
Assert(shortest_intersection = 30, "Expected shortest intersection at distance 30");
load("R75,D30,R83,U83,L12,D49,R71,U7,L72", "U62,R66,U55,R34,D71,R55,D58,R83");
Assert(shortest_intersection = 610, "Expected shortest intersection at distance 610");
load("R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51", "U98,R91,D20,R16,D67,R40,U7,R15,U6,R7");
Assert(shortest_intersection = 410, "Expected shortest intersection at distance 410");
end Test_Shortest;
function Name (T : Test) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("FMS Package");
end Name;
procedure Register_Tests (T : in out Test) is
use AUnit.Test_Cases.Registration;
begin
Register_Routine (T, Test_Load'Access, "Loading");
Register_Routine (T, Test_Closest'Access, "Closest Point");
Register_Routine (T, Test_Shortest'Access, "Shortest Distance Point");
end Register_Tests;
end FMS.Test;
| 42.492537 | 97 | 0.696523 |
04babadf9642d2481d8fa0d9ae9a26d8cb2df300 | 1,678 | ads | Ada | src/ada-core/src/linted-stack.ads | mstewartgallus/linted | 4d4cf9390353ea045b95671474ab278456793a35 | [
"Apache-2.0"
] | null | null | null | src/ada-core/src/linted-stack.ads | mstewartgallus/linted | 4d4cf9390353ea045b95671474ab278456793a35 | [
"Apache-2.0"
] | null | null | null | src/ada-core/src/linted-stack.ads | mstewartgallus/linted | 4d4cf9390353ea045b95671474ab278456793a35 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2017 Steven Stewart-Gallus
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-- implied. See the License for the specific language governing
-- permissions and limitations under the License.
with Linted.Wait_Lists;
generic
type Element_T is private;
type Ix is mod <>;
with function Is_Valid (Element : Element_T) return Boolean;
package Linted.Stack with
Abstract_State => (State with External) is
pragma Elaborate_Body;
procedure Push (Element : Element_T) with
Pre => Is_Valid (Element),
Global => (In_Out => (State, Wait_Lists.State)),
Depends =>
(Wait_Lists.State =>+ (Element, State),
State =>+ (Element, Wait_Lists.State));
procedure Pop (Element : out Element_T) with
Post => Is_Valid (Element),
Global => (In_Out => (State, Wait_Lists.State)),
Depends =>
(State =>+ Wait_Lists.State,
Element => State,
Wait_Lists.State =>+ State);
procedure Try_Pop (Element : out Element_T; Success : out Boolean) with
Post => (if Success then Is_Valid (Element)),
Global => (In_Out => (State, Wait_Lists.State)),
Depends =>
(State =>+ Wait_Lists.State,
Element => State,
Success => State,
Wait_Lists.State =>+ State);
end Linted.Stack;
| 36.478261 | 74 | 0.671037 |
0477f8db19e3e14d0b8daee95da212ff9a920bc7 | 6,209 | adb | Ada | memsim-master/src/memsim.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null | memsim-master/src/memsim.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null | memsim-master/src/memsim.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null |
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Text_IO; use Ada.Text_IO;
with Memory; use Memory;
with Parser;
with Device;
with Benchmark; use Benchmark;
with Benchmark_Runner; use Benchmark_Runner;
with Benchmark.Heap;
with Benchmark.Trace;
with Benchmark.Stride;
with Benchmark.Hash;
with Benchmark.Matrix.MM;
with Benchmark.Matrix.Cholesky;
with Benchmark.Matrix.LU;
with Benchmark.QSort;
with Benchmark.Tree;
with Test;
with Util; use Util;
procedure MemSim is
mem : Memory_Pointer := null;
runner : Runner_Type;
arg : Positive := 1;
type Benchmark_Constructor_Type is
access function return Benchmark.Benchmark_Pointer;
type Benchmark_Info_Type is record
name : Unbounded_String;
usage : Unbounded_String;
constructor : Benchmark_Constructor_Type;
end record;
type Benchmark_Info_Array is array(Natural range <>) of Benchmark_Info_Type;
function BM_Entry(name : String;
usage : String;
constructor : Benchmark_Constructor_Type)
return Benchmark_Info_Type is
begin
return Benchmark_Info_Type'(To_Unbounded_String(name),
To_Unbounded_String(usage),
constructor);
end BM_Entry;
benchmark_map : constant Benchmark_Info_Array := (
BM_Entry("cholesky",
"[size=256][iterations=1][spacing=0]",
Benchmark.Matrix.Cholesky.Create_Cholesky'Access),
BM_Entry("hash",
"[size=1024][iterations=1000][spacing=0][seed=15]",
Benchmark.Hash.Create_Hash'Access),
BM_Entry("heap",
"[size=1024][spacing=0][seed=15]",
Benchmark.Heap.Create_Heap'Access),
BM_Entry("lu",
"[size=256][iterations=1][spacing=0]",
Benchmark.Matrix.LU.Create_LU'Access),
BM_Entry("mm",
"[size=256][iterations=1][spacing=0][seed=15]",
Benchmark.Matrix.MM.Create_MM'Access),
BM_Entry("qsort",
"[size=1024][iterations=1][spacing=0][seed=15]",
Benchmark.QSort.Create_QSort'Access),
BM_Entry("stride",
"[size=1024][iterations=1000][stride=1][spacing=0]",
Benchmark.Stride.Create_Stride'Access),
BM_Entry("trace",
"[file=trace.txt][spacing=0]",
Benchmark.Trace.Create_Trace'Access),
BM_Entry("tree",
"[size=1024][iterations=10000][spacing=0]",
Benchmark.Tree.Create_Tree'Access)
);
procedure Show_Usage is
begin
Put_Line("usage: " & Command_Name & " [options] " &
"<memory> {<benchmark> [<options>]}");
Put_Line("options:");
Put_Line(" -addr_bits <n> Number of address bits");
Put_Line(" -device <d> Device type (asic, virtex6, ...)");
Put_Line("benchmarks:");
for i in benchmark_map'First .. benchmark_map'Last loop
Put_Line(" " & To_String(benchmark_map(i).name & " " &
To_String(benchmark_map(i).usage)));
end loop;
Put_Line(" show");
end Show_Usage;
begin
-- Run the tests if requested.
if Argument_Count = 1 and then Argument(1) = "test" then
Test.Run_Tests;
return;
end if;
-- Parse options.
Parse_Options: while arg < Argument_Count loop
begin
if Argument(arg) = "-addr_bits" then
Device.Set_Address_Bits(Positive'Value(Argument(arg + 1)));
arg := arg + 2;
elsif Argument(arg) = "-device" then
Device.Set_Device(Argument(arg + 1));
arg := arg + 2;
else
exit Parse_Options;
end if;
exception
when others =>
Put_Line("error: invalid option value");
return;
end;
end loop Parse_Options;
-- Check if we are to show the memory.
if arg + 1 = Argument_Count and then Argument(arg + 1) = "show" then
mem := Parser.Parse(Argument(arg));
if mem = null then
Put_Line("error: could not open memory: " & Argument(arg));
return;
end if;
Put_Line("Max Path:" & Natural'Image(Get_Max_Length(mem)));
Put_Line("Cost:" & Cost_Type'Image(Get_Cost(mem.all)));
Destroy(mem);
return;
end if;
-- Make sure we have enough arguments to specify a memory and benchmark.
if arg >= Argument_Count then
Show_Usage;
return;
end if;
-- Parse the memory file.
Parse_Memory: declare
memory_file : constant String := Argument(arg);
begin
mem := Parser.Parse(memory_file);
if mem = null then
Put_Line("error: could not open memory: " & memory_file);
return;
end if;
end Parse_Memory;
arg := arg + 1;
-- Parse benchmarks.
Parse_Benchmarks: declare
bp : Benchmark_Pointer := null;
begin
for i in arg .. Argument_Count loop
-- If this is a benchmark name, create a new benchmark.
for b in benchmark_map'First .. benchmark_map'Last loop
if benchmark_map(b).name = Argument(i) then
bp := benchmark_map(b).constructor.all;
Register_Benchmark(runner, bp);
goto Parsed_Argument;
end if;
end loop;
-- If we get here, this argument is not a benchmark.
-- First we need to make sure we actually have a benchmark.
if bp = null then
Put_Line("error: invalid benchmark: " & Argument(i));
return;
end if;
-- If we get here, this is an argument to the current benchmark.
begin
Benchmark.Set_Argument(bp.all, Argument(i));
exception
when Benchmark.Invalid_Argument =>
Put_Line("error: invalid argument: " & Argument(i));
return;
end;
<<Parsed_Argument>>
null;
end loop;
end Parse_Benchmarks;
Run(runner, mem);
Destroy(mem);
end MemSim;
| 31.841026 | 79 | 0.583347 |
1ae5d8468c33776e30c9c9c879a5dcdd5945bdbd | 1,809 | ads | Ada | src/model/l_system/error/lse-model-l_system-error-missing_rule.ads | mgrojo/lsystem-editor | 1f855bc1f783c8d7a1c81594c8aee403e4b53132 | [
"MIT"
] | 2 | 2021-01-09T14:49:35.000Z | 2022-01-18T18:57:45.000Z | src/model/l_system/error/lse-model-l_system-error-missing_rule.ads | mgrojo/lsystem-editor | 1f855bc1f783c8d7a1c81594c8aee403e4b53132 | [
"MIT"
] | 1 | 2021-12-03T18:49:59.000Z | 2021-12-03T18:49:59.000Z | src/model/l_system/error/lse-model-l_system-error-missing_rule.ads | mgrojo/lsystem-editor | 1f855bc1f783c8d7a1c81594c8aee403e4b53132 | [
"MIT"
] | 1 | 2021-12-03T18:07:44.000Z | 2021-12-03T18:07:44.000Z | -------------------------------------------------------------------------------
-- LSE -- L-System Editor
-- Author: Heziode
--
-- License:
-- MIT License
--
-- Copyright (c) 2018 Quentin Dauprat (Heziode) <[email protected]>
--
-- 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.
-------------------------------------------------------------------------------
-- @description
-- This package define a missing rule error.
--
package LSE.Model.L_System.Error.Missing_Rule is
type Instance is new LSE.Model.L_System.Error.Instance with null record;
-- Axiom not found in input
Error : exception;
function Initialize return Instance;
overriding
function Get_Error (This : Instance) return String;
end LSE.Model.L_System.Error.Missing_Rule;
| 40.2 | 79 | 0.678275 |
1395d806d4729833b54234d64c207737c47754f5 | 945 | adb | Ada | examples/querybindexample.adb | ray2501/AdaBaseXClient | 016641d451a02015ca73cb25c5e9458f17b3904d | [
"MIT"
] | null | null | null | examples/querybindexample.adb | ray2501/AdaBaseXClient | 016641d451a02015ca73cb25c5e9458f17b3904d | [
"MIT"
] | null | null | null | examples/querybindexample.adb | ray2501/AdaBaseXClient | 016641d451a02015ca73cb25c5e9458f17b3904d | [
"MIT"
] | 1 | 2021-07-08T01:14:51.000Z | 2021-07-08T01:14:51.000Z | with Ada.Text_IO;
with Ada.Exceptions;
with AdaBaseXClient;
use Ada.Text_IO;
use Ada.Exceptions;
use AdaBaseXClient;
procedure QueryExample is
begin
if (Connect ("localhost", 1_984) = False) then
Ada.Text_IO.Put_Line ("Connect failed.");
return;
else
if (Authenticate ("admin", "admin") = False) then
Ada.Text_IO.Put_Line ("Authenticate failed.");
Close;
return;
end if;
end if;
declare
Response : Query :=
CreateQuery
("declare variable $name external; for $i in 1 to 10 return element { $name } { $i }");
begin
Response.Bind ("name", "number", "");
Ada.Text_IO.Put_Line (Response.Execute);
Response.Close;
end;
Close;
exception
when Error : BaseXException =>
Ada.Text_IO.Put ("Exception: ");
Ada.Text_IO.Put_Line (Exception_Name (Error));
Ada.Text_IO.Put (Exception_Message (Error));
end QueryExample;
| 23.04878 | 97 | 0.62963 |
13b4bd91edfd9e0eddb95b28a516d6ead8a38112 | 1,336 | ada | Ada | Task/Averages-Mean-angle/Ada/averages-mean-angle.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Averages-Mean-angle/Ada/averages-mean-angle.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Averages-Mean-angle/Ada/averages-mean-angle.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Text_IO, Ada.Numerics.Generic_Elementary_Functions;
procedure Mean_Angles is
type X_Real is digits 4; -- or more digits for improved precision
subtype Real is X_Real range 0.0 .. 360.0; -- the range of interest
type Angles is array(Positive range <>) of Real;
procedure Put(R: Real) is
package IO is new Ada.Text_IO.Float_IO(Real);
begin
IO.Put(R, Fore => 3, Aft => 2, Exp => 0);
end Put;
function Mean_Angle(A: Angles) return Real is
Sin_Sum, Cos_Sum: X_Real := 0.0; -- X_Real since sums might exceed 360.0
package Math is new Ada.Numerics.Generic_Elementary_Functions(Real);
use Math;
begin
for I in A'Range loop
Sin_Sum := Sin_Sum + Sin(A(I), Cycle => 360.0);
Cos_Sum := Cos_Sum + Cos(A(I), Cycle => 360.0);
end loop;
return Arctan(Sin_Sum / X_Real(A'Length), Cos_Sum / X_Real(A'Length),
Cycle => 360.0);
-- may raise Ada.Numerics.Argument_Error if inputs are
-- numerically instable, e.g., when Cos_Sum is 0.0
end Mean_Angle;
begin
Put(Mean_Angle((10.0, 20.0, 30.0))); Ada.Text_IO.New_Line; -- 20.00
Put(Mean_Angle((10.0, 350.0))); Ada.Text_IO.New_Line; -- 0.00
Put(Mean_Angle((90.0, 180.0, 270.0, 360.0))); -- Ada.Numerics.Argument_Error!
end Mean_Angles;
| 38.171429 | 80 | 0.632485 |
1346d2fff1c734b4393ee23c96f9be09f465785c | 4,959 | ads | Ada | source/web/soap/web_services-soap-payloads-decoders.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/soap/web_services-soap-payloads-decoders.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/soap/web_services-soap-payloads-decoders.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web 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$
------------------------------------------------------------------------------
-- Interface of decoder of SOAP Body's child element.
------------------------------------------------------------------------------
with League.Strings;
with XML.SAX.Attributes;
package Web_Services.SOAP.Payloads.Decoders is
pragma Preelaborate;
type SOAP_Payload_Decoder is abstract tagged limited null record;
type SOAP_Payload_Decoder_Access is access all SOAP_Payload_Decoder'Class;
not overriding function Create
(URI : not null access League.Strings.Universal_String)
return SOAP_Payload_Decoder is abstract;
-- This subprogram is used by dispatching constructor to create instance of
-- the decoder.
not overriding function Payload
(Self : SOAP_Payload_Decoder)
return not null Web_Services.SOAP.Payloads.SOAP_Payload_Access
is abstract;
-- Returns constructed SOAP message.
not overriding procedure Characters
(Self : in out SOAP_Payload_Decoder;
Text : League.Strings.Universal_String;
Success : in out Boolean) is null;
not overriding procedure End_Element
(Self : in out SOAP_Payload_Decoder;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Success : in out Boolean) is null;
not overriding procedure Start_Element
(Self : in out SOAP_Payload_Decoder;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Attributes : XML.SAX.Attributes.SAX_Attributes;
Success : in out Boolean) is null;
end Web_Services.SOAP.Payloads.Decoders;
| 56.352273 | 79 | 0.48538 |
addac4f59004966a63b449c03e0464a646bd3dae | 16,288 | adb | Ada | .emacs.d/elpa/wisi-2.1.1/sal-gen_definite_doubly_linked_lists_sorted.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-2.1.1/sal-gen_definite_doubly_linked_lists_sorted.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-2.1.1/sal-gen_definite_doubly_linked_lists_sorted.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- See spec.
--
-- Copyright (C) 2018 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_Definite_Doubly_Linked_Lists_Sorted is
----------
-- Body subprograms, alphabetical
procedure Find
(Container : in List;
Element : in Element_Type;
Found : out Node_Access;
Found_Compare : out Compare_Result)
is
-- Return pointer to first item in Container for which Compare (item,
-- element) returns True or Greater. If no such element exists, Found
-- is null, Found_Compare is Less.
use Ada.Containers;
begin
if Container.Head = null then
Found := null;
Found_Compare := Less;
return;
end if;
declare
Low_Index : Count_Type := 1;
High_Index : Count_Type := Container.Count;
Next_Node : Node_Access := Container.Head;
Next_Index : Count_Type := Low_Index;
Old_Index : Count_Type;
begin
loop
Old_Index := Next_Index;
Next_Index := (Low_Index + High_Index) / 2;
if Next_Index > Old_Index then
for I in Old_Index + 1 .. Next_Index loop
Next_Node := Next_Node.Next;
end loop;
elsif Next_Index < Old_Index then
for I in Next_Index .. Old_Index - 1 loop
Next_Node := Next_Node.Prev;
end loop;
end if;
case Element_Compare (Next_Node.Element, Element) is
when Less =>
if Next_Index = High_Index then
-- no more nodes to check
Found := null;
Found_Compare := Less;
return;
elsif Next_Index = Low_Index then
-- force check of high_index
Low_Index := High_Index;
else
Low_Index := Next_Index;
end if;
when Equal =>
Found := Next_Node;
Found_Compare := Equal;
return;
when Greater =>
if Low_Index = Next_Index then
-- no more nodes to check
Found := Next_Node;
Found_Compare := Greater;
return;
elsif High_Index = Next_Index then
-- Desired result is either high_index or low_index
pragma Assert (Low_Index + 1 = High_Index);
case Element_Compare (Next_Node.Prev.Element, Element) is
when Less =>
Found := Next_Node;
Found_Compare := Greater;
return;
when Equal =>
Found := Next_Node.Prev;
Found_Compare := Equal;
return;
when Greater =>
Found := Next_Node.Prev;
Found_Compare := Greater;
return;
end case;
else
High_Index := Next_Index;
end if;
end case;
end loop;
end;
end Find;
procedure Insert_Before
(Container : in out List;
Before : in Node_Access;
Element : in Element_Type)
is
New_Node : constant Node_Access := new Node_Type'
(Element => Element,
Prev => Before.Prev,
Next => Before);
begin
if Before = Container.Head then
Before.Prev := New_Node;
Container.Head := New_Node;
else
Before.Prev.Next := New_Node;
Before.Prev := New_Node;
end if;
end Insert_Before;
procedure Insert_After_Tail
(Container : in out List;
Element : in Element_Type)
is
New_Node : constant Node_Access := new Node_Type'
(Element => Element,
Prev => Container.Tail,
Next => null);
begin
Container.Tail.Next := New_Node;
Container.Tail := New_Node;
end Insert_After_Tail;
---------
-- Public operations, declaration order.
overriding
procedure Adjust (Container : in out List)
is
Next_Source : Node_Access := Container.Head;
New_Node : Node_Access;
begin
if Next_Source = null then
return;
end if;
Container.Tail := null;
loop
New_Node := new Node_Type'
(Element => Next_Source.Element,
Next => null,
Prev => Container.Tail);
if Container.Tail = null then
Container.Head := New_Node;
Container.Tail := New_Node;
else
Container.Tail.Next := New_Node;
Container.Tail := New_Node;
end if;
Next_Source := Next_Source.Next;
exit when Next_Source = null;
end loop;
end Adjust;
overriding
procedure Finalize (Container : in out List)
is
Next : Node_Access := Container.Head;
begin
loop
exit when Next = null;
Next := Container.Head.Next;
Free (Container.Head);
Container.Head := Next;
end loop;
Container.Tail := null;
end Finalize;
overriding function "=" (Left, Right : in List) return Boolean
is
Left_I : Node_Access := Left.Head;
Right_I : Node_Access := Right.Head;
begin
loop
exit when Left_I = null;
if Right_I = null then
return False;
elsif Left_I.Element /= Right_I.Element then
return False;
end if;
Left_I := Left_I.Next;
Right_I := Right_I.Next;
end loop;
return Right_I = null;
end "=";
function Length (Container : in List) return Ada.Containers.Count_Type
is begin
return Container.Count;
end Length;
function To_List (Element : in Element_Type) return List
is
New_Node : constant Node_Access := new Node_Type'
(Element => Element,
Prev => null,
Next => null);
begin
return Result : constant List :=
(Ada.Finalization.Controlled with
Head => New_Node,
Tail => New_Node,
Count => 1);
end To_List;
procedure Insert (Container : in out List; Element : in Element_Type)
is
Node : Node_Access := Container.Head;
Compare : Compare_Result;
begin
if Node = null then
Container := To_List (Element);
else
Find (Container, Element, Node, Compare);
Container.Count := Container.Count + 1;
if Node = null then
Insert_After_Tail (Container, Element);
else
Insert_Before (Container, Node, Element);
end if;
end if;
end Insert;
function Contains (Container : in List; Element : in Element_Type) return Boolean
is
Node : Node_Access := Container.Head;
Compare : Compare_Result;
begin
Find (Container, Element, Node, Compare);
return Compare = Equal;
end Contains;
procedure Merge
(Target : in out List;
Source : in List;
Added : out Boolean)
is
Target_I : Node_Access := Target.Head;
Source_I : Node_Access := Source.Head;
begin
if Target_I = null then
if Source_I = null then
Added := False;
else
Target.Head := Source.Head;
Target.Tail := Source.Tail;
Target.Count := Source.Count;
Adjust (Target);
Added := True;
end if;
elsif Source_I = null then
Added := False;
else
Added := False;
loop
exit when Source_I = null;
if Target_I = null then
Added := True;
Target.Count := Target.Count + 1;
Insert_After_Tail (Target, Source_I.Element);
Source_I := Source_I.Next;
else
case Element_Compare (Target_I.Element, Source_I.Element) is
when Greater =>
Added := True;
Target.Count := Target.Count + 1;
Insert_Before (Target, Target_I, Source_I.Element);
Source_I := Source_I.Next;
when Equal =>
Target_I := Target_I.Next;
Source_I := Source_I.Next;
when Less =>
Target_I := Target_I.Next;
end case;
end if;
end loop;
end if;
end Merge;
procedure Merge
(Target : in out List;
Source : in List;
Added : out Boolean;
Exclude : in Element_Type)
is
Target_I : Node_Access := Target.Head;
Source_I : Node_Access := Source.Head;
begin
Added := False;
if Target_I = null then
if Source_I = null then
return;
else
loop
if Source_I = null then
return;
end if;
exit when Source_I.Element /= Exclude;
Source_I := Source_I.Next;
end loop;
Added := True;
Target := To_List (Source_I.Element);
Source_I := Source_I.Next;
end if;
end if;
loop
exit when Source_I = null;
if Source_I.Element = Exclude then
Source_I := Source_I.Next;
elsif Target_I = null then
Added := True;
Target.Count := Target.Count + 1;
Insert_After_Tail (Target, Source_I.Element);
Source_I := Source_I.Next;
else
case Element_Compare (Target_I.Element, Source_I.Element) is
when Greater =>
Added := True;
Target.Count := Target.Count + 1;
Insert_Before (Target, Target_I, Source_I.Element);
Source_I := Source_I.Next;
when Equal =>
Target_I := Target_I.Next;
Source_I := Source_I.Next;
when Less =>
Target_I := Target_I.Next;
end case;
end if;
end loop;
end Merge;
function Has_Element (Position : in Cursor) return Boolean
is begin
return Position.Ptr /= null;
end Has_Element;
function First (Container : in List) return Cursor
is begin
if Container.Head = null then
return No_Element;
else
return (Container'Unrestricted_Access, Container.Head);
end if;
end First;
function Last (Container : in List) return Cursor
is begin
if Container.Tail = null then
return No_Element;
else
return (Container'Unrestricted_Access, Container.Tail);
end if;
end Last;
function Find (Container : in List; Element : in Element_Type) return Cursor
is
Node : Node_Access;
Compare : Compare_Result;
begin
Find (Container, Element, Node, Compare);
if Node = null then
return No_Element;
elsif Compare = Equal then
return (Container'Unrestricted_Access, Node);
else
return No_Element;
end if;
end Find;
procedure Next (Position : in out Cursor)
is begin
if Position.Ptr /= null then
if Position.Ptr.Next = null then
Position := No_Element;
else
Position.Ptr := Position.Ptr.Next;
end if;
end if;
end Next;
function Next (Position : in Cursor) return Cursor
is begin
if Position.Ptr = null then
return Position;
else
if Position.Ptr.Next = null then
return No_Element;
else
return (Position.Container, Position.Ptr.Next);
end if;
end if;
end Next;
function Previous (Position : in Cursor) return Cursor
is begin
if Position.Ptr = null then
return Position;
else
if Position.Ptr.Prev = null then
return No_Element;
else
return (Position.Container, Position.Ptr.Prev);
end if;
end if;
end Previous;
function Element (Position : in Cursor) return Element_Type
is begin
return Position.Ptr.Element;
end Element;
procedure Delete (Container : in out List; Position : in out Cursor)
is
Node : Node_Access renames Position.Ptr;
begin
if Node.Next = null then
Container.Tail := Node.Prev;
else
Node.Next.Prev := Node.Prev;
end if;
if Node.Prev = null then
Container.Head := Node.Next;
else
Node.Prev.Next := Node.Next;
end if;
Free (Node);
Position := No_Element;
Container.Count := Container.Count - 1;
end Delete;
function Pop (Container : in out List) return Element_Type
is
Node : Node_Access := Container.Head;
begin
return Result : constant Element_Type := Container.Head.Element do
Container.Head := Node.Next;
if Node.Next = null then
Container.Tail := null;
else
Node.Next.Prev := null;
end if;
Free (Node);
Container.Count := Container.Count - 1;
end return;
end Pop;
function Constant_Reference (Container : in List; Position : in Cursor) return Constant_Reference_Type
is
pragma Unreferenced (Container);
begin
return (Element => Position.Ptr.all.Element'Access);
end Constant_Reference;
function Constant_Ref (Position : in Cursor) return Constant_Reference_Type
is begin
return (Element => Position.Ptr.all.Element'Access);
end Constant_Ref;
function Reference (Container : in List; Position : in Cursor) return Reference_Type
is
pragma Unreferenced (Container);
begin
return (Element => Position.Ptr.all.Element'Access);
end Reference;
function Ref (Position : in Cursor) return Reference_Type
is begin
return (Element => Position.Ptr.all.Element'Access);
end Ref;
function Iterate (Container : aliased in List) return Iterator_Interfaces.Reversible_Iterator'Class
is begin
return Iterator'(Container => Container'Unrestricted_Access);
end Iterate;
overriding function First (Object : Iterator) return Cursor
is begin
return First (Object.Container.all);
end First;
overriding function Last (Object : Iterator) return Cursor
is begin
return Last (Object.Container.all);
end Last;
overriding function Next (Object : in Iterator; Position : in Cursor) return Cursor
is
pragma Unreferenced (Object);
begin
return Next (Position);
end Next;
overriding function Previous (Object : in Iterator; Position : in Cursor) return Cursor
is
pragma Unreferenced (Object);
begin
return Previous (Position);
end Previous;
end SAL.Gen_Definite_Doubly_Linked_Lists_Sorted;
| 29.996317 | 106 | 0.54138 |
130ca8e7601bcb9aa8ddca51464a44947a16125c | 5,641 | ads | Ada | linear_algebra/test_matrices.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | 30 | 2018-12-09T01:15:04.000Z | 2022-03-20T16:14:54.000Z | linear_algebra/test_matrices.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null | linear_algebra/test_matrices.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null |
-- Collection of square matrices. Most are ill conditioned, singular
-- or badly scaled.
-- Several matrices are from John Burkardt's fortran 90 Test_Mat.
generic
type real is digits <>;
type Index is range <>;
type Matrix is array(Index, Index) of Real;
package Test_Matrices is
-- In notes below, N is the Order of the Matrix.
type Matrix_Id is
(Laguerre, -- eig vec calc fails w/ balancing for lower tri version.
Ding_Dong, -- eigs clustered very near (18+ sig. figs) +/- pi, symmetric
Lesp,
-- Sensitive eigs., tridiag, not symmetric, transpo hard, triggers underflows,
-- Balancing v. bad., hessenberg pivoting solves difficult eigen calc.
Vandermonde, -- non-symmetric
Combin, -- solutions with maximally high error for given condition num?
Kahan,
Kahan_2,
Kahan_Col_Scaled,
Kahan_Row_Scaled,
Sampling, -- ill conditioned eigs, eigs = 0..N-1, ok up to ~ 21x21
Sampling_1, -- well behaved, eigs = 0..N-1
Companion_2, -- Eigs are roots of companion polynomial.
Companion_1, -- Badly scaled, difficult eigs, balancing essential for eigs.
Companion_0, -- Balancing important.
Companion, -- Eigs are roots of companion polynomial
Lower_Integers, -- almost triangular, eigs = 1, 2, 3 ...
Pas_Fib, -- ill-cond N > 9; rescaled if big
Pascal_Symmetric,
Pascal,
-- ill-cond N > 9; sing. vals ~ x, 1/x, all>0, rescaled if big, balancing bad
-- if lower triangular
Pascal_Row_Scaled,
Pascal_Col_Scaled,
Frank_0, -- upper Hess, ill cond eigs, eig prod = 1, balance bad, 17x17max
Frank_1, -- upper Hess, ill cond eigs, eig prod = N, balance bad
Frank_2, -- symmetric, easy, product of eigs = 1
Fiedler_0, -- symm, non singular
Fiedler_1, -- non symm, poor-cond eigs
Fibonacci, -- non symm, non singular, tri diag, max defective
Wilkinson_Minus, -- symm. W- only if odd N: then just one 0.0 eigval
Hilbert, -- exactly represented in 15 digit Real only up to ~ 20x20
Lotkin, -- like Hilbert, but not symmetric
Clustered, -- eigs clustered, poorly scaled
Zielke_0, -- symmetric, clustered eigs, ill conditioned
Zielke_1, -- symmetric, clustered eigs, singular
Zielke_2, -- symmetric, clustered eigs, singular
Gear_0, -- non symm, non singular, one small sing val
Gear_1, -- non symm, singular
Diag_Test, -- one small singular val.
Moler, -- 1 small eig, prod. of eigs = 1, eig sum = N(N+1)/2
Peters, -- 1 small eig, like Givens_Moler, lower triangular
Peters_0, -- 1 small eig, like Givens_Moler, upper triangular
Peters_1, -- ok w. row pivoting, LU
Peters_2, -- bad w/ row pivoting, LU
Gregory, -- symmetric, all but 2 of the eigs = 1.
Anti_Hadamard_Upper_Tri, -- 1 small sing.val, non singular
Anti_Hadamard_Lower_Tri, -- 1 small sing.val, non singular
Wilkinson_Plus, -- strictly it's W+ only for odd N.
Wilkinson_Plus_2I,
U_Hard, -- slow convergence on Golub SVD, all 1's but 1st col=0
Zero_Cols_and_Rows, -- 1st 3 rows and cols all 0; else it's 1.
Easy_Matrix,
Symmetric_Banded, -- not diagonally dominant, moderately ill-conditioned
Small_Diagonal, -- but not symmetric
Trench,
Trench_1,
Forsythe_0, -- eigs on circle of radius 1, center=A=0.
Forsythe_1, -- eigs on circle of radius 1, center=A=1.
Forsythe_Symmetric,
Zero_Diagonal, -- if odd then N singular, eg N X N = 13x13
QR_Test, -- 4x4 hard on QR
Ring_Adjacency_0, -- Symm.
Ring_Adjacency_1, -- Non-Symm.
Upper_Tri_K,
Lower_Tri_K, -- lower tri, non-singular, v high condition num
Upper_Ones, -- triangular
Lower_Ones, -- triangular
All_Ones,
Redheff, -- sensitive eigs, hard tst - slow convergence on Peters_Eigen.
Chow, -- ill-conditioned eigs, N / 2 eigs = 0, balancing bad, lower hess.
Chow1, -- chow w/ alpha=-1.05
Chow2, -- chow w/ alpha=gamma
Chow3, -- non-sym, full
Lehmer, -- easy
Random_1_bit_anti, -- anti-sym, singular, on [0,1] new seed each run, hard tst
Random_1_bit, -- new seed each run.
Random_32_bit, -- on [0,1), new seed each run.
All_Zeros);
procedure Init_Matrix
(M : out Matrix;
Desired_Matrix : in Matrix_Id := Easy_Matrix;
Starting_Index : in Index := Index'First;
Max_Index : in Index := Index'Last);
-- Can optionally add constant Matrix_Addend to some of the Matrices.
-- Increases the variety of tests, and usually makes them harder to
-- decompose. The matrices are:
--
-- Anti_Hadamard_Lower_Tri, Anti_Hadamard_Upper_Tri, Lower_Tri_K, Upper_Tri_K
-- Pascal_Col_Scaled, Pascal_Row_Scaled, Pascal
-- Lower_Ones, Upper_Ones, Lower_Integers
-- Frank_0, Frank_1, Fibonacci, Peters, Peters_0
-- Kahan_Row_Scaled, Kahan_Col_Scaled, Kahan_Col_Scaled_2, Kahan
--Matrix_Addend : constant Real := +1.0e-5;
Matrix_Addend : constant Real := +0.0;
procedure Transpose
(A : in out Matrix;
Starting_Index : in Index := Index'First;
Max_Index : in Index := Index'Last);
procedure Symmetrize
(A : in out Matrix);
end Test_Matrices;
| 44.769841 | 86 | 0.617798 |
4b19b3616430e3e0968c870a7b90659a1e8dc479 | 899 | ads | Ada | regtests/regtests-audits.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | regtests/regtests-audits.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | regtests/regtests-audits.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- regtests-audits -- Audits unit test
-- Copyright (C) 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.
-----------------------------------------------------------------------
package Regtests.Audits is
end Regtests.Audits;
| 40.863636 | 76 | 0.619577 |
044fe202aae6925c3d6cf1f540068d0060c63010 | 51,834 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/prep.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/prep.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/prep.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P R E P --
-- --
-- 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. 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 Csets; use Csets;
with Err_Vars; use Err_Vars;
with Opt; use Opt;
with Osint; use Osint;
with Output; use Output;
with Scans; use Scans;
with Snames; use Snames;
with Sinput;
with Stringt; use Stringt;
with Table;
with Uintp; use Uintp;
with GNAT.Heap_Sort_G;
package body Prep is
use Symbol_Table;
type Token_Name_Array is array (Token_Type) of Name_Id;
Token_Names : constant Token_Name_Array :=
(Tok_Abort => Name_Abort,
Tok_Abs => Name_Abs,
Tok_Abstract => Name_Abstract,
Tok_Accept => Name_Accept,
Tok_Aliased => Name_Aliased,
Tok_All => Name_All,
Tok_Array => Name_Array,
Tok_And => Name_And,
Tok_At => Name_At,
Tok_Begin => Name_Begin,
Tok_Body => Name_Body,
Tok_Case => Name_Case,
Tok_Constant => Name_Constant,
Tok_Declare => Name_Declare,
Tok_Delay => Name_Delay,
Tok_Delta => Name_Delta,
Tok_Digits => Name_Digits,
Tok_Else => Name_Else,
Tok_Elsif => Name_Elsif,
Tok_End => Name_End,
Tok_Entry => Name_Entry,
Tok_Exception => Name_Exception,
Tok_Exit => Name_Exit,
Tok_For => Name_For,
Tok_Function => Name_Function,
Tok_Generic => Name_Generic,
Tok_Goto => Name_Goto,
Tok_If => Name_If,
Tok_Is => Name_Is,
Tok_Limited => Name_Limited,
Tok_Loop => Name_Loop,
Tok_Mod => Name_Mod,
Tok_New => Name_New,
Tok_Null => Name_Null,
Tok_Of => Name_Of,
Tok_Or => Name_Or,
Tok_Others => Name_Others,
Tok_Out => Name_Out,
Tok_Package => Name_Package,
Tok_Pragma => Name_Pragma,
Tok_Private => Name_Private,
Tok_Procedure => Name_Procedure,
Tok_Protected => Name_Protected,
Tok_Raise => Name_Raise,
Tok_Range => Name_Range,
Tok_Record => Name_Record,
Tok_Rem => Name_Rem,
Tok_Renames => Name_Renames,
Tok_Requeue => Name_Requeue,
Tok_Return => Name_Return,
Tok_Reverse => Name_Reverse,
Tok_Select => Name_Select,
Tok_Separate => Name_Separate,
Tok_Subtype => Name_Subtype,
Tok_Tagged => Name_Tagged,
Tok_Task => Name_Task,
Tok_Terminate => Name_Terminate,
Tok_Then => Name_Then,
Tok_Type => Name_Type,
Tok_Until => Name_Until,
Tok_Use => Name_Use,
Tok_When => Name_When,
Tok_While => Name_While,
Tok_With => Name_With,
Tok_Xor => Name_Xor,
others => No_Name);
Already_Initialized : Boolean := False;
-- Used to avoid repetition of the part of the initialisation that needs
-- to be done only once.
Empty_String : String_Id;
-- "", as a string_id
String_False : String_Id;
-- "false", as a string_id
--------------
-- Behavior --
--------------
-- Accesses to procedure specified by procedure Initialize
Error_Msg : Error_Msg_Proc;
-- Report an error
Scan : Scan_Proc;
-- Scan one token
Set_Ignore_Errors : Set_Ignore_Errors_Proc;
-- Indicate if error should be taken into account
Put_Char : Put_Char_Proc;
-- Output one character
New_EOL : New_EOL_Proc;
-- Output an end of line indication
-------------------------------
-- State of the Preprocessor --
-------------------------------
type Pp_State is record
If_Ptr : Source_Ptr;
-- The location of the #if statement (used to flag #if with no
-- corresponding #end if, at the end).
Else_Ptr : Source_Ptr;
-- The location of the #else statement (used to detect multiple #else's)
Deleting : Boolean;
-- Set to True when the code should be deleted or commented out
Match_Seen : Boolean;
-- Set to True when a condition in an #if or an #elsif is True. Also set
-- to True if Deleting at the previous level is True. Used to decide if
-- Deleting should be set to True in a following #elsif or #else.
end record;
type Pp_Depth is new Nat;
Ground : constant Pp_Depth := 0;
package Pp_States is new Table.Table
(Table_Component_Type => Pp_State,
Table_Index_Type => Pp_Depth,
Table_Low_Bound => 1,
Table_Initial => 10,
Table_Increment => 100,
Table_Name => "Prep.Pp_States");
-- A stack of the states of the preprocessor, for nested #if
type Operator is (None, Op_Or, Op_And);
-----------------
-- Subprograms --
-----------------
function Deleting return Boolean;
-- Return True if code should be deleted or commented out
function Expression
(Evaluate_It : Boolean;
Complemented : Boolean := False) return Boolean;
-- Evaluate a condition in an #if or an #elsif statement. If Evaluate_It
-- is False, the condition is effectively evaluated, otherwise, only the
-- syntax is checked.
procedure Go_To_End_Of_Line;
-- Advance the scan pointer until we reach an end of line or the end of the
-- buffer.
function Matching_Strings (S1, S2 : String_Id) return Boolean;
-- Returns True if the two string parameters are equal (case insensitive)
---------------------------------------
-- Change_Reserved_Keyword_To_Symbol --
---------------------------------------
procedure Change_Reserved_Keyword_To_Symbol
(All_Keywords : Boolean := False)
is
New_Name : constant Name_Id := Token_Names (Token);
begin
if New_Name /= No_Name then
case Token is
when Tok_And
| Tok_Else
| Tok_Elsif
| Tok_End
| Tok_If
| Tok_Or
| Tok_Then
=>
if All_Keywords then
Token := Tok_Identifier;
Token_Name := New_Name;
end if;
when others =>
Token := Tok_Identifier;
Token_Name := New_Name;
end case;
end if;
end Change_Reserved_Keyword_To_Symbol;
------------------------------------------
-- Check_Command_Line_Symbol_Definition --
------------------------------------------
procedure Check_Command_Line_Symbol_Definition
(Definition : String;
Data : out Symbol_Data)
is
Index : Natural := 0;
Result : Symbol_Data;
begin
-- Look for the character '='
for J in Definition'Range loop
if Definition (J) = '=' then
Index := J;
exit;
end if;
end loop;
-- If no character '=', then the value is True
if Index = 0 then
-- Put the symbol in the name buffer
Name_Len := Definition'Length;
Name_Buffer (1 .. Name_Len) := Definition;
Result := True_Value;
elsif Index = Definition'First then
Fail ("invalid symbol definition """ & Definition & """");
else
-- Put the symbol in the name buffer
Name_Len := Index - Definition'First;
Name_Buffer (1 .. Name_Len) :=
String'(Definition (Definition'First .. Index - 1));
-- Check the syntax of the value
if Definition (Index + 1) /= '"'
or else Definition (Definition'Last) /= '"'
then
for J in Index + 1 .. Definition'Last loop
case Definition (J) is
when '_' | '.' | '0' .. '9' | 'a' .. 'z' | 'A' .. 'Z' =>
null;
when others =>
Fail ("illegal value """
& Definition (Index + 1 .. Definition'Last)
& """");
end case;
end loop;
end if;
-- Even if the value is a string, we still set Is_A_String to False,
-- to avoid adding additional quotes in the preprocessed sources when
-- replacing $<symbol>.
Result.Is_A_String := False;
-- Put the value in the result
Start_String;
Store_String_Chars (Definition (Index + 1 .. Definition'Last));
Result.Value := End_String;
end if;
-- Now, check the syntax of the symbol (we don't allow accented or
-- wide characters).
if Name_Buffer (1) not in 'a' .. 'z'
and then Name_Buffer (1) not in 'A' .. 'Z'
then
Fail ("symbol """
& Name_Buffer (1 .. Name_Len)
& """ does not start with a letter");
end if;
for J in 2 .. Name_Len loop
case Name_Buffer (J) is
when 'a' .. 'z' | 'A' .. 'Z' | '0' .. '9' =>
null;
when '_' =>
if J = Name_Len then
Fail ("symbol """
& Name_Buffer (1 .. Name_Len)
& """ end with a '_'");
elsif Name_Buffer (J + 1) = '_' then
Fail ("symbol """
& Name_Buffer (1 .. Name_Len)
& """ contains consecutive '_'");
end if;
when others =>
Fail ("symbol """
& Name_Buffer (1 .. Name_Len)
& """ contains illegal character(s)");
end case;
end loop;
Result.On_The_Command_Line := True;
-- Put the symbol name in the result
declare
Sym : constant String := Name_Buffer (1 .. Name_Len);
begin
for Index in 1 .. Name_Len loop
Name_Buffer (Index) := Fold_Lower (Name_Buffer (Index));
end loop;
Result.Symbol := Name_Find;
Name_Len := Sym'Length;
Name_Buffer (1 .. Name_Len) := Sym;
Result.Original := Name_Find;
end;
Data := Result;
end Check_Command_Line_Symbol_Definition;
--------------
-- Deleting --
--------------
function Deleting return Boolean is
begin
-- Always return False when not inside an #if statement
if Opt.No_Deletion or else Pp_States.Last = Ground then
return False;
else
return Pp_States.Table (Pp_States.Last).Deleting;
end if;
end Deleting;
----------------
-- Expression --
----------------
function Expression
(Evaluate_It : Boolean;
Complemented : Boolean := False) return Boolean
is
Evaluation : Boolean := Evaluate_It;
-- Is set to False after an "or else" when left term is True and after
-- an "and then" when left term is False.
Final_Result : Boolean := False;
Current_Result : Boolean := False;
-- Value of a term
Current_Operator : Operator := None;
Symbol1 : Symbol_Id;
Symbol2 : Symbol_Id;
Symbol_Name1 : Name_Id;
Symbol_Name2 : Name_Id;
Symbol_Pos1 : Source_Ptr;
Symbol_Pos2 : Source_Ptr;
Symbol_Value1 : String_Id;
Symbol_Value2 : String_Id;
Relop : Token_Type;
begin
-- Loop for each term
loop
Change_Reserved_Keyword_To_Symbol;
Current_Result := False;
-- Scan current term, starting with Token
case Token is
-- Handle parenthesized expression
when Tok_Left_Paren =>
Scan.all;
Current_Result := Expression (Evaluation);
if Token = Tok_Right_Paren then
Scan.all;
else
Error_Msg -- CODEFIX
("`)` expected", Token_Ptr);
end if;
-- Handle not expression
when Tok_Not =>
Scan.all;
Current_Result :=
not Expression (Evaluation, Complemented => True);
-- Handle sequence starting with identifier
when Tok_Identifier =>
Symbol_Name1 := Token_Name;
Symbol_Pos1 := Token_Ptr;
Scan.all;
if Token = Tok_Apostrophe then
-- symbol'Defined
Scan.all;
if Token = Tok_Identifier
and then Token_Name = Name_Defined
then
Scan.all;
else
Error_Msg ("identifier `Defined` expected", Token_Ptr);
end if;
if Evaluation then
Current_Result := Index_Of (Symbol_Name1) /= No_Symbol;
end if;
-- Handle relational operator
elsif Token = Tok_Equal
or else Token = Tok_Less
or else Token = Tok_Less_Equal
or else Token = Tok_Greater
or else Token = Tok_Greater_Equal
then
Relop := Token;
Scan.all;
Change_Reserved_Keyword_To_Symbol;
if Token = Tok_Integer_Literal then
-- symbol = integer
-- symbol < integer
-- symbol <= integer
-- symbol > integer
-- symbol >= integer
declare
Value : constant Int := UI_To_Int (Int_Literal_Value);
Data : Symbol_Data;
Symbol_Value : Int;
-- Value of symbol as Int
begin
if Evaluation then
Symbol1 := Index_Of (Symbol_Name1);
if Symbol1 = No_Symbol then
Error_Msg_Name_1 := Symbol_Name1;
Error_Msg ("unknown symbol %", Symbol_Pos1);
Symbol_Value1 := No_String;
else
Data := Mapping.Table (Symbol1);
if Data.Is_A_String then
Error_Msg_Name_1 := Symbol_Name1;
Error_Msg
("symbol % value is not integer",
Symbol_Pos1);
else
begin
String_To_Name_Buffer (Data.Value);
Symbol_Value :=
Int'Value (Name_Buffer (1 .. Name_Len));
case Relop is
when Tok_Equal =>
Current_Result :=
Symbol_Value = Value;
when Tok_Less =>
Current_Result :=
Symbol_Value < Value;
when Tok_Less_Equal =>
Current_Result :=
Symbol_Value <= Value;
when Tok_Greater =>
Current_Result :=
Symbol_Value > Value;
when Tok_Greater_Equal =>
Current_Result :=
Symbol_Value >= Value;
when others =>
null;
end case;
exception
when Constraint_Error =>
Error_Msg_Name_1 := Symbol_Name1;
Error_Msg
("symbol % value is not an integer",
Symbol_Pos1);
end;
end if;
end if;
end if;
Scan.all;
end;
-- Error if relational operator other than = if not numbers
elsif Relop /= Tok_Equal then
Error_Msg ("number expected", Token_Ptr);
-- Equality comparison of two strings
elsif Token = Tok_Identifier then
-- symbol = symbol
Symbol_Name2 := Token_Name;
Symbol_Pos2 := Token_Ptr;
Scan.all;
if Evaluation then
Symbol1 := Index_Of (Symbol_Name1);
if Symbol1 = No_Symbol then
if Undefined_Symbols_Are_False then
Symbol_Value1 := String_False;
else
Error_Msg_Name_1 := Symbol_Name1;
Error_Msg ("unknown symbol %", Symbol_Pos1);
Symbol_Value1 := No_String;
end if;
else
Symbol_Value1 :=
Mapping.Table (Symbol1).Value;
end if;
Symbol2 := Index_Of (Symbol_Name2);
if Symbol2 = No_Symbol then
if Undefined_Symbols_Are_False then
Symbol_Value2 := String_False;
else
Error_Msg_Name_1 := Symbol_Name2;
Error_Msg ("unknown symbol %", Symbol_Pos2);
Symbol_Value2 := No_String;
end if;
else
Symbol_Value2 := Mapping.Table (Symbol2).Value;
end if;
if Symbol_Value1 /= No_String
and then
Symbol_Value2 /= No_String
then
Current_Result :=
Matching_Strings (Symbol_Value1, Symbol_Value2);
end if;
end if;
elsif Token = Tok_String_Literal then
-- symbol = "value"
if Evaluation then
Symbol1 := Index_Of (Symbol_Name1);
if Symbol1 = No_Symbol then
if Undefined_Symbols_Are_False then
Symbol_Value1 := String_False;
else
Error_Msg_Name_1 := Symbol_Name1;
Error_Msg ("unknown symbol %", Symbol_Pos1);
Symbol_Value1 := No_String;
end if;
else
Symbol_Value1 := Mapping.Table (Symbol1).Value;
end if;
if Symbol_Value1 /= No_String then
Current_Result :=
Matching_Strings
(Symbol_Value1,
String_Literal_Id);
end if;
end if;
Scan.all;
else
Error_Msg
("literal integer, symbol or literal string expected",
Token_Ptr);
end if;
-- Handle True or False
else
if Evaluation then
Symbol1 := Index_Of (Symbol_Name1);
if Symbol1 = No_Symbol then
if Undefined_Symbols_Are_False then
Symbol_Value1 := String_False;
else
Error_Msg_Name_1 := Symbol_Name1;
Error_Msg ("unknown symbol %", Symbol_Pos1);
Symbol_Value1 := No_String;
end if;
else
Symbol_Value1 := Mapping.Table (Symbol1).Value;
end if;
if Symbol_Value1 /= No_String then
String_To_Name_Buffer (Symbol_Value1);
for Index in 1 .. Name_Len loop
Name_Buffer (Index) :=
Fold_Lower (Name_Buffer (Index));
end loop;
if Name_Buffer (1 .. Name_Len) = "true" then
Current_Result := True;
elsif Name_Buffer (1 .. Name_Len) = "false" then
Current_Result := False;
else
Error_Msg_Name_1 := Symbol_Name1;
Error_Msg
("value of symbol % is not True or False",
Symbol_Pos1);
end if;
end if;
end if;
end if;
-- Unrecognized sequence
when others =>
Error_Msg ("`(`, NOT or symbol expected", Token_Ptr);
end case;
-- Update the cumulative final result
case Current_Operator is
when None =>
Final_Result := Current_Result;
when Op_Or =>
Final_Result := Final_Result or Current_Result;
when Op_And =>
Final_Result := Final_Result and Current_Result;
end case;
-- Handle AND
if Token = Tok_And then
if Complemented then
Error_Msg
("mixing NOT and AND is not allowed, parentheses are required",
Token_Ptr);
elsif Current_Operator = Op_Or then
Error_Msg ("mixing OR and AND is not allowed", Token_Ptr);
end if;
Current_Operator := Op_And;
Scan.all;
if Token = Tok_Then then
Scan.all;
if Final_Result = False then
Evaluation := False;
end if;
end if;
-- Handle OR
elsif Token = Tok_Or then
if Complemented then
Error_Msg
("mixing NOT and OR is not allowed, parentheses are required",
Token_Ptr);
elsif Current_Operator = Op_And then
Error_Msg ("mixing AND and OR is not allowed", Token_Ptr);
end if;
Current_Operator := Op_Or;
Scan.all;
if Token = Tok_Else then
Scan.all;
if Final_Result then
Evaluation := False;
end if;
end if;
-- No AND/OR operator, so exit from the loop through terms
else
exit;
end if;
end loop;
return Final_Result;
end Expression;
-----------------------
-- Go_To_End_Of_Line --
-----------------------
procedure Go_To_End_Of_Line is
begin
-- Scan until we get an end of line or we reach the end of the buffer
while Token /= Tok_End_Of_Line
and then Token /= Tok_EOF
loop
Scan.all;
end loop;
end Go_To_End_Of_Line;
--------------
-- Index_Of --
--------------
function Index_Of (Symbol : Name_Id) return Symbol_Id is
begin
if Mapping.Table /= null then
for J in Symbol_Id range 1 .. Symbol_Table.Last (Mapping) loop
if Mapping.Table (J).Symbol = Symbol then
return J;
end if;
end loop;
end if;
return No_Symbol;
end Index_Of;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
if not Already_Initialized then
Start_String;
Store_String_Chars ("True");
True_Value.Value := End_String;
Start_String;
Empty_String := End_String;
Start_String;
Store_String_Chars ("False");
String_False := End_String;
Already_Initialized := True;
end if;
end Initialize;
------------------
-- List_Symbols --
------------------
procedure List_Symbols (Foreword : String) is
Order : array (0 .. Integer (Symbol_Table.Last (Mapping)))
of Symbol_Id;
-- After alphabetical sorting, this array stores the indexes of the
-- symbols in the order they are displayed.
function Lt (Op1, Op2 : Natural) return Boolean;
-- Comparison routine for sort call
procedure Move (From : Natural; To : Natural);
-- Move routine for sort call
--------
-- Lt --
--------
function Lt (Op1, Op2 : Natural) return Boolean is
S1 : constant String :=
Get_Name_String (Mapping.Table (Order (Op1)).Symbol);
S2 : constant String :=
Get_Name_String (Mapping.Table (Order (Op2)).Symbol);
begin
return S1 < S2;
end Lt;
----------
-- Move --
----------
procedure Move (From : Natural; To : Natural) is
begin
Order (To) := Order (From);
end Move;
package Sort_Syms is new GNAT.Heap_Sort_G (Move, Lt);
Max_L : Natural;
-- Maximum length of any symbol
-- Start of processing for List_Symbols_Case
begin
if Symbol_Table.Last (Mapping) = 0 then
return;
end if;
if Foreword'Length > 0 then
Write_Eol;
Write_Line (Foreword);
for J in Foreword'Range loop
Write_Char ('=');
end loop;
end if;
-- Initialize the order
for J in Order'Range loop
Order (J) := Symbol_Id (J);
end loop;
-- Sort alphabetically
Sort_Syms.Sort (Order'Last);
Max_L := 7;
for J in 1 .. Symbol_Table.Last (Mapping) loop
Get_Name_String (Mapping.Table (J).Original);
Max_L := Integer'Max (Max_L, Name_Len);
end loop;
Write_Eol;
Write_Str ("Symbol");
for J in 1 .. Max_L - 5 loop
Write_Char (' ');
end loop;
Write_Line ("Value");
Write_Str ("------");
for J in 1 .. Max_L - 5 loop
Write_Char (' ');
end loop;
Write_Line ("------");
for J in 1 .. Order'Last loop
declare
Data : constant Symbol_Data := Mapping.Table (Order (J));
begin
Get_Name_String (Data.Original);
Write_Str (Name_Buffer (1 .. Name_Len));
for K in Name_Len .. Max_L loop
Write_Char (' ');
end loop;
String_To_Name_Buffer (Data.Value);
if Data.Is_A_String then
Write_Char ('"');
for J in 1 .. Name_Len loop
Write_Char (Name_Buffer (J));
if Name_Buffer (J) = '"' then
Write_Char ('"');
end if;
end loop;
Write_Char ('"');
else
Write_Str (Name_Buffer (1 .. Name_Len));
end if;
end;
Write_Eol;
end loop;
Write_Eol;
end List_Symbols;
----------------------
-- Matching_Strings --
----------------------
function Matching_Strings (S1, S2 : String_Id) return Boolean is
begin
String_To_Name_Buffer (S1);
for Index in 1 .. Name_Len loop
Name_Buffer (Index) := Fold_Lower (Name_Buffer (Index));
end loop;
declare
String1 : constant String := Name_Buffer (1 .. Name_Len);
begin
String_To_Name_Buffer (S2);
for Index in 1 .. Name_Len loop
Name_Buffer (Index) := Fold_Lower (Name_Buffer (Index));
end loop;
return String1 = Name_Buffer (1 .. Name_Len);
end;
end Matching_Strings;
--------------------
-- Parse_Def_File --
--------------------
-- This procedure REALLY needs some more comments ???
procedure Parse_Def_File is
Symbol : Symbol_Id;
Symbol_Name : Name_Id;
Original_Name : Name_Id;
Data : Symbol_Data;
Value_Start : Source_Ptr;
Value_End : Source_Ptr;
Ch : Character;
use ASCII;
begin
Def_Line_Loop :
loop
Scan.all;
exit Def_Line_Loop when Token = Tok_EOF;
if Token /= Tok_End_Of_Line then
Change_Reserved_Keyword_To_Symbol;
if Token /= Tok_Identifier then
Error_Msg ("identifier expected", Token_Ptr);
goto Cleanup;
end if;
Symbol_Name := Token_Name;
Name_Len := 0;
for Ptr in Token_Ptr .. Scan_Ptr - 1 loop
Name_Len := Name_Len + 1;
Name_Buffer (Name_Len) := Sinput.Source (Ptr);
end loop;
Original_Name := Name_Find;
Scan.all;
if Token /= Tok_Colon_Equal then
Error_Msg -- CODEFIX
("`:=` expected", Token_Ptr);
goto Cleanup;
end if;
Scan.all;
if Token = Tok_Integer_Literal then
declare
Ptr : Source_Ptr := Token_Ptr;
begin
Start_String;
while Ptr < Scan_Ptr loop
Store_String_Char (Sinput.Source (Ptr));
Ptr := Ptr + 1;
end loop;
Data := (Symbol => Symbol_Name,
Original => Original_Name,
On_The_Command_Line => False,
Is_A_String => False,
Value => End_String);
end;
Scan.all;
if Token /= Tok_End_Of_Line and then Token /= Tok_EOF then
Error_Msg ("extraneous text in definition", Token_Ptr);
goto Cleanup;
end if;
elsif Token = Tok_String_Literal then
Data := (Symbol => Symbol_Name,
Original => Original_Name,
On_The_Command_Line => False,
Is_A_String => True,
Value => String_Literal_Id);
Scan.all;
if Token /= Tok_End_Of_Line and then Token /= Tok_EOF then
Error_Msg ("extraneous text in definition", Token_Ptr);
goto Cleanup;
end if;
elsif Token = Tok_End_Of_Line or else Token = Tok_EOF then
Data := (Symbol => Symbol_Name,
Original => Original_Name,
On_The_Command_Line => False,
Is_A_String => False,
Value => Empty_String);
else
Value_Start := Token_Ptr;
Value_End := Token_Ptr - 1;
Scan_Ptr := Token_Ptr;
Value_Chars_Loop :
loop
Ch := Sinput.Source (Scan_Ptr);
case Ch is
when '_' | '.' | '0' .. '9' | 'a' .. 'z' | 'A' .. 'Z' =>
Value_End := Scan_Ptr;
Scan_Ptr := Scan_Ptr + 1;
when ' ' | HT | VT | CR | LF | FF =>
exit Value_Chars_Loop;
when others =>
Error_Msg ("illegal character", Scan_Ptr);
goto Cleanup;
end case;
end loop Value_Chars_Loop;
Scan.all;
if Token /= Tok_End_Of_Line and then Token /= Tok_EOF then
Error_Msg ("extraneous text in definition", Token_Ptr);
goto Cleanup;
end if;
Start_String;
while Value_Start <= Value_End loop
Store_String_Char (Sinput.Source (Value_Start));
Value_Start := Value_Start + 1;
end loop;
Data := (Symbol => Symbol_Name,
Original => Original_Name,
On_The_Command_Line => False,
Is_A_String => False,
Value => End_String);
end if;
-- Now that we have the value, get the symbol index
Symbol := Index_Of (Symbol_Name);
if Symbol /= No_Symbol then
-- If we already have an entry for this symbol, replace it
-- with the new value, except if the symbol was declared on
-- the command line.
if Mapping.Table (Symbol).On_The_Command_Line then
goto Continue;
end if;
else
-- As it is the first time we see this symbol, create a new
-- entry in the table.
if Mapping.Table = null then
Symbol_Table.Init (Mapping);
end if;
Symbol_Table.Increment_Last (Mapping);
Symbol := Symbol_Table.Last (Mapping);
end if;
Mapping.Table (Symbol) := Data;
goto Continue;
<<Cleanup>>
Set_Ignore_Errors (To => True);
while Token /= Tok_End_Of_Line and then Token /= Tok_EOF loop
Scan.all;
end loop;
Set_Ignore_Errors (To => False);
<<Continue>>
null;
end if;
end loop Def_Line_Loop;
end Parse_Def_File;
----------------
-- Preprocess --
----------------
procedure Preprocess (Source_Modified : out Boolean) is
Start_Of_Processing : Source_Ptr;
Cond : Boolean;
Preprocessor_Line : Boolean := False;
No_Error_Found : Boolean := True;
Modified : Boolean := False;
procedure Output (From, To : Source_Ptr);
-- Output the characters with indexes From .. To in the buffer to the
-- output file.
procedure Output_Line (From, To : Source_Ptr);
-- Output a line or the end of a line from the buffer to the output
-- file, followed by an end of line terminator. Depending on the value
-- of Deleting and the switches, the line may be commented out, blank or
-- not output at all.
------------
-- Output --
------------
procedure Output (From, To : Source_Ptr) is
begin
for J in From .. To loop
Put_Char (Sinput.Source (J));
end loop;
end Output;
-----------------
-- Output_Line --
-----------------
procedure Output_Line (From, To : Source_Ptr) is
begin
if Deleting or else Preprocessor_Line then
if Blank_Deleted_Lines then
New_EOL.all;
elsif Comment_Deleted_Lines then
Put_Char ('-');
Put_Char ('-');
Put_Char ('!');
if From < To then
Put_Char (' ');
Output (From, To);
end if;
New_EOL.all;
end if;
else
Output (From, To);
New_EOL.all;
end if;
end Output_Line;
-- Start of processing for Preprocess
begin
Start_Of_Processing := Scan_Ptr;
-- First a call to Scan, because Initialize_Scanner is not doing it
Scan.all;
Input_Line_Loop : loop
exit Input_Line_Loop when Token = Tok_EOF;
Preprocessor_Line := False;
if Token /= Tok_End_Of_Line then
-- Preprocessor line
if Token = Tok_Special and then Special_Character = '#' then
Modified := True;
Preprocessor_Line := True;
Scan.all;
case Token is
-- #if
when Tok_If =>
declare
If_Ptr : constant Source_Ptr := Token_Ptr;
begin
Scan.all;
Cond := Expression (not Deleting);
-- Check for an eventual "then"
if Token = Tok_Then then
Scan.all;
end if;
-- It is an error to have trailing characters after
-- the condition or "then".
if Token /= Tok_End_Of_Line
and then Token /= Tok_EOF
then
Error_Msg
("extraneous text on preprocessor line",
Token_Ptr);
No_Error_Found := False;
Go_To_End_Of_Line;
end if;
declare
-- Set the initial state of this new "#if". This
-- must be done before incrementing the Last of
-- the table, otherwise function Deleting does
-- not report the correct value.
New_State : constant Pp_State :=
(If_Ptr => If_Ptr,
Else_Ptr => 0,
Deleting => Deleting
or else not Cond,
Match_Seen => Deleting or else Cond);
begin
Pp_States.Increment_Last;
Pp_States.Table (Pp_States.Last) := New_State;
end;
end;
-- #elsif
when Tok_Elsif =>
Cond := False;
if Pp_States.Last = 0
or else Pp_States.Table (Pp_States.Last).Else_Ptr /= 0
then
Error_Msg ("no IF for this ELSIF", Token_Ptr);
No_Error_Found := False;
else
Cond :=
not Pp_States.Table (Pp_States.Last).Match_Seen;
end if;
Scan.all;
Cond := Expression (Cond);
-- Check for an eventual "then"
if Token = Tok_Then then
Scan.all;
end if;
-- It is an error to have trailing characters after the
-- condition or "then".
if Token /= Tok_End_Of_Line
and then Token /= Tok_EOF
then
Error_Msg
("extraneous text on preprocessor line",
Token_Ptr);
No_Error_Found := False;
Go_To_End_Of_Line;
end if;
-- Depending on the value of the condition, set the new
-- values of Deleting and Match_Seen.
if Pp_States.Last > 0 then
if Pp_States.Table (Pp_States.Last).Match_Seen then
Pp_States.Table (Pp_States.Last).Deleting := True;
else
if Cond then
Pp_States.Table (Pp_States.Last).Match_Seen :=
True;
Pp_States.Table (Pp_States.Last).Deleting :=
False;
end if;
end if;
end if;
-- #else
when Tok_Else =>
if Pp_States.Last = 0 then
Error_Msg ("no IF for this ELSE", Token_Ptr);
No_Error_Found := False;
elsif
Pp_States.Table (Pp_States.Last).Else_Ptr /= 0
then
Error_Msg -- CODEFIX
("duplicate ELSE line", Token_Ptr);
No_Error_Found := False;
end if;
-- Set the possibly new values of Deleting and Match_Seen
if Pp_States.Last > 0 then
if Pp_States.Table (Pp_States.Last).Match_Seen then
Pp_States.Table (Pp_States.Last).Deleting :=
True;
else
Pp_States.Table (Pp_States.Last).Match_Seen :=
True;
Pp_States.Table (Pp_States.Last).Deleting :=
False;
end if;
-- Set the Else_Ptr to check for illegal #elsif later
Pp_States.Table (Pp_States.Last).Else_Ptr :=
Token_Ptr;
end if;
Scan.all;
-- Error of character present after "#else"
if Token /= Tok_End_Of_Line
and then Token /= Tok_EOF
then
Error_Msg
("extraneous text on preprocessor line",
Token_Ptr);
No_Error_Found := False;
Go_To_End_Of_Line;
end if;
-- #end if;
when Tok_End =>
if Pp_States.Last = 0 then
Error_Msg ("no IF for this END", Token_Ptr);
No_Error_Found := False;
end if;
Scan.all;
if Token /= Tok_If then
Error_Msg -- CODEFIX
("IF expected", Token_Ptr);
No_Error_Found := False;
else
Scan.all;
if Token /= Tok_Semicolon then
Error_Msg -- CODEFIX
("`;` Expected", Token_Ptr);
No_Error_Found := False;
else
Scan.all;
-- Error of character present after "#end if;"
if Token /= Tok_End_Of_Line
and then Token /= Tok_EOF
then
Error_Msg
("extraneous text on preprocessor line",
Token_Ptr);
No_Error_Found := False;
end if;
end if;
end if;
-- In case of one of the errors above, skip the tokens
-- until the end of line is reached.
Go_To_End_Of_Line;
-- Decrement the depth of the #if stack
if Pp_States.Last > 0 then
Pp_States.Decrement_Last;
end if;
-- Illegal preprocessor line
when others =>
No_Error_Found := False;
if Pp_States.Last = 0 then
Error_Msg -- CODEFIX
("IF expected", Token_Ptr);
elsif
Pp_States.Table (Pp_States.Last).Else_Ptr = 0
then
Error_Msg
("IF, ELSIF, ELSE, or `END IF` expected",
Token_Ptr);
else
Error_Msg ("IF or `END IF` expected", Token_Ptr);
end if;
-- Skip to the end of this illegal line
Go_To_End_Of_Line;
end case;
-- Not a preprocessor line
else
-- Do not report errors for those lines, even if there are
-- Ada parsing errors.
Set_Ignore_Errors (To => True);
if Deleting then
Go_To_End_Of_Line;
else
while Token /= Tok_End_Of_Line
and then Token /= Tok_EOF
loop
if Token = Tok_Special
and then Special_Character = '$'
then
Modified := True;
declare
Dollar_Ptr : constant Source_Ptr := Token_Ptr;
Symbol : Symbol_Id;
begin
Scan.all;
Change_Reserved_Keyword_To_Symbol;
if Token = Tok_Identifier
and then Token_Ptr = Dollar_Ptr + 1
then
-- $symbol
Symbol := Index_Of (Token_Name);
-- If symbol exists, replace by its value
if Symbol /= No_Symbol then
Output (Start_Of_Processing, Dollar_Ptr - 1);
Start_Of_Processing := Scan_Ptr;
String_To_Name_Buffer
(Mapping.Table (Symbol).Value);
if Mapping.Table (Symbol).Is_A_String then
-- Value is an Ada string
Put_Char ('"');
for J in 1 .. Name_Len loop
Put_Char (Name_Buffer (J));
if Name_Buffer (J) = '"' then
Put_Char ('"');
end if;
end loop;
Put_Char ('"');
else
-- Value is a sequence of characters, not
-- an Ada string.
for J in 1 .. Name_Len loop
Put_Char (Name_Buffer (J));
end loop;
end if;
end if;
end if;
end;
end if;
Scan.all;
end loop;
end if;
Set_Ignore_Errors (To => False);
end if;
end if;
pragma Assert (Token = Tok_End_Of_Line or else Token = Tok_EOF);
-- At this point, the token is either end of line or EOF. The line to
-- possibly output stops just before the token.
Output_Line (Start_Of_Processing, Token_Ptr - 1);
-- If we are at the end of a line, the scan pointer is at the first
-- non-blank character (may not be the first character of the line),
-- so we have to deduct Start_Of_Processing from the token pointer.
if Token = Tok_End_Of_Line then
if Sinput.Source (Token_Ptr) = ASCII.CR
and then Sinput.Source (Token_Ptr + 1) = ASCII.LF
then
Start_Of_Processing := Token_Ptr + 2;
else
Start_Of_Processing := Token_Ptr + 1;
end if;
end if;
-- Now, scan the first token of the next line. If the token is EOF,
-- the scan pointer will not move, and the token will still be EOF.
Set_Ignore_Errors (To => True);
Scan.all;
Set_Ignore_Errors (To => False);
end loop Input_Line_Loop;
-- Report an error for any missing some "#end if;"
for Level in reverse 1 .. Pp_States.Last loop
Error_Msg ("no `END IF` for this IF", Pp_States.Table (Level).If_Ptr);
No_Error_Found := False;
end loop;
Source_Modified := No_Error_Found and Modified;
end Preprocess;
-----------------
-- Setup_Hooks --
-----------------
procedure Setup_Hooks
(Error_Msg : Error_Msg_Proc;
Scan : Scan_Proc;
Set_Ignore_Errors : Set_Ignore_Errors_Proc;
Put_Char : Put_Char_Proc;
New_EOL : New_EOL_Proc)
is
begin
pragma Assert (Already_Initialized);
Prep.Error_Msg := Error_Msg;
Prep.Scan := Scan;
Prep.Set_Ignore_Errors := Set_Ignore_Errors;
Prep.Put_Char := Put_Char;
Prep.New_EOL := New_EOL;
end Setup_Hooks;
end Prep;
| 32.016059 | 79 | 0.441486 |
22f6c22edcd9ea353c9d1aad1f3c0836824e81f3 | 8,090 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-rbtgbk.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-rbtgbk.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-rbtgbk.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.RED_BLACK_TREES.GENERIC_BOUNDED_KEYS --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
-- Tree_Type is used to implement ordered containers. This package declares
-- the tree operations that depend on keys.
with Ada.Containers.Red_Black_Trees.Generic_Bounded_Operations;
generic
with package Tree_Operations is new Generic_Bounded_Operations (<>);
use Tree_Operations.Tree_Types, Tree_Operations.Tree_Types.Implementation;
type Key_Type (<>) is limited private;
with function Is_Less_Key_Node
(L : Key_Type;
R : Node_Type) return Boolean;
with function Is_Greater_Key_Node
(L : Key_Type;
R : Node_Type) return Boolean;
package Ada.Containers.Red_Black_Trees.Generic_Bounded_Keys is
pragma Pure;
generic
with function New_Node return Count_Type;
procedure Generic_Insert_Post
(Tree : in out Tree_Type'Class;
Y : Count_Type;
Before : Boolean;
Z : out Count_Type);
-- Completes an insertion after the insertion position has been
-- determined. On output Z contains the index of the newly inserted
-- node, allocated using Allocate. If Tree is busy then
-- Program_Error is raised. If Y is 0, then Tree must be empty.
-- Otherwise Y denotes the insertion position, and Before specifies
-- whether the new node is Y's left (True) or right (False) child.
generic
with procedure Insert_Post
(T : in out Tree_Type'Class;
Y : Count_Type;
B : Boolean;
Z : out Count_Type);
procedure Generic_Conditional_Insert
(Tree : in out Tree_Type'Class;
Key : Key_Type;
Node : out Count_Type;
Inserted : out Boolean);
-- Inserts a new node in Tree, but only if the tree does not already
-- contain Key. Generic_Conditional_Insert first searches for a key
-- equivalent to Key in Tree. If an equivalent key is found, then on
-- output Node designates the node with that key and Inserted is
-- False; there is no allocation and Tree is not modified. Otherwise
-- Node designates a new node allocated using Insert_Post, and
-- Inserted is True.
generic
with procedure Insert_Post
(T : in out Tree_Type'Class;
Y : Count_Type;
B : Boolean;
Z : out Count_Type);
procedure Generic_Unconditional_Insert
(Tree : in out Tree_Type'Class;
Key : Key_Type;
Node : out Count_Type);
-- Inserts a new node in Tree. On output Node designates the new
-- node, which is allocated using Insert_Post. The node is inserted
-- immediately after already-existing equivalent keys.
generic
with procedure Insert_Post
(T : in out Tree_Type'Class;
Y : Count_Type;
B : Boolean;
Z : out Count_Type);
with procedure Unconditional_Insert_Sans_Hint
(Tree : in out Tree_Type'Class;
Key : Key_Type;
Node : out Count_Type);
procedure Generic_Unconditional_Insert_With_Hint
(Tree : in out Tree_Type'Class;
Hint : Count_Type;
Key : Key_Type;
Node : out Count_Type);
-- Inserts a new node in Tree near position Hint, to avoid having to
-- search from the root for the insertion position. If Hint is 0
-- then Generic_Unconditional_Insert_With_Hint attempts to insert
-- the new node after Tree.Last. If Hint is non-zero then if Key is
-- less than Hint, it attempts to insert the new node immediately
-- prior to Hint. Otherwise it attempts to insert the node
-- immediately following Hint. We say "attempts" above to emphasize
-- that insertions always preserve invariants with respect to key
-- order, even when there's a hint. So if Key can't be inserted
-- immediately near Hint, then the new node is inserted in the
-- normal way, by searching for the correct position starting from
-- the root.
generic
with procedure Insert_Post
(T : in out Tree_Type'Class;
Y : Count_Type;
B : Boolean;
Z : out Count_Type);
with procedure Conditional_Insert_Sans_Hint
(Tree : in out Tree_Type'Class;
Key : Key_Type;
Node : out Count_Type;
Inserted : out Boolean);
procedure Generic_Conditional_Insert_With_Hint
(Tree : in out Tree_Type'Class;
Position : Count_Type; -- the hint
Key : Key_Type;
Node : out Count_Type;
Inserted : out Boolean);
-- Inserts a new node in Tree if the tree does not already contain
-- Key, using Position as a hint about where to insert the new node.
-- See Generic_Unconditional_Insert_With_Hint for more details about
-- hint semantics.
function Find
(Tree : Tree_Type'Class;
Key : Key_Type) return Count_Type;
-- Searches Tree for the smallest node equivalent to Key
function Ceiling
(Tree : Tree_Type'Class;
Key : Key_Type) return Count_Type;
-- Searches Tree for the smallest node equal to or greater than Key
function Floor
(Tree : Tree_Type'Class;
Key : Key_Type) return Count_Type;
-- Searches Tree for the largest node less than or equal to Key
function Upper_Bound
(Tree : Tree_Type'Class;
Key : Key_Type) return Count_Type;
-- Searches Tree for the smallest node greater than Key
generic
with procedure Process (Index : Count_Type);
procedure Generic_Iteration
(Tree : Tree_Type'Class;
Key : Key_Type);
-- Calls Process for each node in Tree equivalent to Key, in order
-- from earliest in range to latest.
generic
with procedure Process (Index : Count_Type);
procedure Generic_Reverse_Iteration
(Tree : Tree_Type'Class;
Key : Key_Type);
-- Calls Process for each node in Tree equivalent to Key, but in
-- order from largest in range to earliest.
end Ada.Containers.Red_Black_Trees.Generic_Bounded_Keys;
| 41.701031 | 78 | 0.592707 |
572e57b9cc18781ee0e6d8b417cadbeeb328a667 | 3,650 | ads | Ada | source/amf/uml/amf-uml-create_link_object_actions-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-create_link_object_actions-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-create_link_object_actions-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.Create_Link_Object_Actions.Hash is
new AMF.Elements.Generic_Hash (UML_Create_Link_Object_Action, UML_Create_Link_Object_Action_Access);
| 73 | 102 | 0.408767 |
4b06409654fac7b2b71d39c62da160dff727a388 | 4,471 | adb | Ada | examples/zlibwrap/zlib/contrib/ada/mtest.adb | gahr/critcl | bceac8a8e959c40357c0ebdc0f0ec6c14408b5bf | [
"TCL"
] | 41 | 2015-03-19T09:26:55.000Z | 2022-03-22T09:41:33.000Z | examples/zlibwrap/zlib/contrib/ada/mtest.adb | apnadkarni/critcl | db00b6cd251cfdfca6c685772941e559fdf9b6a1 | [
"TCL"
] | 69 | 2015-02-06T17:30:53.000Z | 2022-03-25T16:27:43.000Z | examples/zlibwrap/zlib/contrib/ada/mtest.adb | apnadkarni/critcl | db00b6cd251cfdfca6c685772941e559fdf9b6a1 | [
"TCL"
] | 11 | 2015-02-05T15:46:39.000Z | 2021-03-24T18:43:53.000Z | ----------------------------------------------------------------
-- ZLib for Ada thick binding. --
-- --
-- Copyright (C) 2002-2003 Dmitriy Anisimkov --
-- --
-- Open source license information is in the zlib.ads file. --
----------------------------------------------------------------
-- Continuous test for ZLib multithreading. If the test would fail
-- we should provide thread safe allocation routines for the Z_Stream.
--
-- $Id: mtest.adb 66 2005-08-17 18:20:58Z andreas_kupries $
with ZLib;
with Ada.Streams;
with Ada.Numerics.Discrete_Random;
with Ada.Text_IO;
with Ada.Exceptions;
with Ada.Task_Identification;
procedure MTest is
use Ada.Streams;
use ZLib;
Stop : Boolean := False;
pragma Atomic (Stop);
subtype Visible_Symbols is Stream_Element range 16#20# .. 16#7E#;
package Random_Elements is
new Ada.Numerics.Discrete_Random (Visible_Symbols);
task type Test_Task;
task body Test_Task is
Buffer : Stream_Element_Array (1 .. 100_000);
Gen : Random_Elements.Generator;
Buffer_First : Stream_Element_Offset;
Compare_First : Stream_Element_Offset;
Deflate : Filter_Type;
Inflate : Filter_Type;
procedure Further (Item : in Stream_Element_Array);
procedure Read_Buffer
(Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
-------------
-- Further --
-------------
procedure Further (Item : in Stream_Element_Array) is
procedure Compare (Item : in Stream_Element_Array);
-------------
-- Compare --
-------------
procedure Compare (Item : in Stream_Element_Array) is
Next_First : Stream_Element_Offset := Compare_First + Item'Length;
begin
if Buffer (Compare_First .. Next_First - 1) /= Item then
raise Program_Error;
end if;
Compare_First := Next_First;
end Compare;
procedure Compare_Write is new ZLib.Write (Write => Compare);
begin
Compare_Write (Inflate, Item, No_Flush);
end Further;
-----------------
-- Read_Buffer --
-----------------
procedure Read_Buffer
(Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset)
is
Buff_Diff : Stream_Element_Offset := Buffer'Last - Buffer_First;
Next_First : Stream_Element_Offset;
begin
if Item'Length <= Buff_Diff then
Last := Item'Last;
Next_First := Buffer_First + Item'Length;
Item := Buffer (Buffer_First .. Next_First - 1);
Buffer_First := Next_First;
else
Last := Item'First + Buff_Diff;
Item (Item'First .. Last) := Buffer (Buffer_First .. Buffer'Last);
Buffer_First := Buffer'Last + 1;
end if;
end Read_Buffer;
procedure Translate is new Generic_Translate
(Data_In => Read_Buffer,
Data_Out => Further);
begin
Random_Elements.Reset (Gen);
Buffer := (others => 20);
Main : loop
for J in Buffer'Range loop
Buffer (J) := Random_Elements.Random (Gen);
Deflate_Init (Deflate);
Inflate_Init (Inflate);
Buffer_First := Buffer'First;
Compare_First := Buffer'First;
Translate (Deflate);
if Compare_First /= Buffer'Last + 1 then
raise Program_Error;
end if;
Ada.Text_IO.Put_Line
(Ada.Task_Identification.Image
(Ada.Task_Identification.Current_Task)
& Stream_Element_Offset'Image (J)
& ZLib.Count'Image (Total_Out (Deflate)));
Close (Deflate);
Close (Inflate);
exit Main when Stop;
end loop;
end loop Main;
exception
when E : others =>
Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Information (E));
Stop := True;
end Test_Task;
Test : array (1 .. 4) of Test_Task;
pragma Unreferenced (Test);
Dummy : Character;
begin
Ada.Text_IO.Get_Immediate (Dummy);
Stop := True;
end MTest;
| 28.477707 | 78 | 0.545068 |
ade955e5d0b3f29167647da3b2455b9dde62060a | 7,480 | ads | Ada | strings_edit-utf8.ads | jrcarter/Ada_GUI | 65a829c55dec91fd48a0b72f88d76137768bf4fb | [
"BSD-3-Clause"
] | 19 | 2018-03-18T18:07:14.000Z | 2022-03-30T03:10:12.000Z | strings_edit-utf8.ads | jrcarter/Ada_GUI | 65a829c55dec91fd48a0b72f88d76137768bf4fb | [
"BSD-3-Clause"
] | 4 | 2021-08-23T12:52:06.000Z | 2022-03-31T10:48:43.000Z | strings_edit-utf8.ads | jrcarter/Ada_GUI | 65a829c55dec91fd48a0b72f88d76137768bf4fb | [
"BSD-3-Clause"
] | null | null | null | -- --
-- package Strings_Edit.UTF8 Copyright (c) Dmitry A. Kazakov --
-- Interface Luebeck --
-- Spring, 2005 --
-- --
-- Last revision : 21:03 21 Apr 2009 --
-- --
-- This library 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 2 of --
-- the License, or (at your option) any later version. This library --
-- is distributed in the hope that it will be useful, but WITHOUT --
-- ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. You should have --
-- received a copy of the GNU General Public License along with --
-- this library; if not, write to the Free Software Foundation, --
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
-- --
-- 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. --
--____________________________________________________________________--
package Strings_Edit.UTF8 is
pragma Elaborate_Body (Strings_Edit.UTF8);
--
-- UTF8_Code_Point -- UFT-8 codespace
--
type Code_Point is mod 2**32;
subtype UTF8_Code_Point is Code_Point range 0..16#10FFFF#;
--
-- Script_Base -- Supported bases of sub- and superscript integers
--
subtype Script_Base is NumberBase range 2..10;
--
-- Script_Digit -- Sub- and superscript digits
--
type Script_Digit is range 0..9;
type Sign is (Minus, None, Plus);
--
-- Get -- Get one UTF-8 code point
--
-- Source - The source string
-- Pointer - The string position to start at
-- Value - The result
--
-- This procedure decodes one UTF-8 code point from the string Source.
-- It starts at Source (Pointer). After successful completion Pointer is
-- advanced to the first character following the input. The result is
-- returned through the parameter Value.
--
-- Exceptions :
--
-- Data_Error - UTF-8 syntax error
-- End_Error - Nothing found
-- Layout_Error - Pointer is not in Source'First..Source'Last + 1
--
procedure Get
( Source : String;
Pointer : in out Integer;
Value : out UTF8_Code_Point
);
--
-- Get_Backwards -- Get one UTF-8 code point
--
-- Source - The source string
-- Pointer - The string position to start at
-- Value - The result
--
-- This procedure decodes one UTF-8 code point from the string Source.
-- It starts at Source (Pointer - 1) and continues backwards. After
-- successful completion Pointer is moved to the first character of the
-- result. The result is returned through the parameter Value.
--
-- Exceptions :
--
-- Data_Error - UTF-8 syntax error
-- End_Error - Nothing found
-- Layout_Error - Pointer is not in Source'First..Source'Last + 1
--
procedure Get_Backwards
( Source : String;
Pointer : in out Integer;
Value : out UTF8_Code_Point
);
--
-- Image -- Of an UTF-8 code point
--
-- Value - The code point
--
-- Returns :
--
-- UTF-8 encoded equivalent
--
function Image (Value : UTF8_Code_Point) return String;
--
-- Put -- Put one UTF-8 code point
--
-- Destination - The target string
-- Pointer - The position where to place the character
-- Value - The code point to put
--
-- This procedure puts one UTF-8 code point into the string Source
-- starting from the position Source (Pointer). Pointer is then advanced
-- to the first character following the output.
--
-- Exceptions :
--
-- Layout_Error - Pointer is not in Destination'Range of there is no
-- room for output
--
procedure Put
( Destination : in out String;
Pointer : in out Integer;
Value : UTF8_Code_Point
);
--
-- Length -- The length of an UTF-8 string
--
-- Source - The string containing UTF-8 encoded code points
--
-- Returns :
--
-- The number of UTF-8 encoded code points in Source
--
-- Exceptions :
--
-- Data_Error - Invalid string
--
function Length (Source : String) return Natural;
--
-- Skip -- Skip UTF-8 code point
--
-- Source - UTF-8 encoded string
-- Pointer - The position of the first UTF-8 code point to skip
-- Count - The number of code points to skip
--
-- After successful completion Source (Pointer) is the first character
-- following Count skipped UTF-8 encoded code points.
--
-- Exceptions :
--
-- Data_Error - Invalid string
-- Layout_Error - Pointer is not in Source'First..Source'Last + 1
-- End_Error - Less than Count UTF-8 points to skip
--
procedure Skip
( Source : String;
Pointer : in out Integer;
Count : Natural := 1
);
--
-- Value -- Conversion to code point
--
-- Source - One UTF-8 encoded code point
--
-- Returns :
--
-- The code point
--
-- Exceptions :
--
-- Data_Error - Illegal UTF-8 string
--
function Value (Source : String) return UTF8_Code_Point;
--
-- Code_Points_Range -- A range of UTF-8 code points Low..High
--
type Code_Points_Range is record
Low : UTF8_Code_Point;
High : UTF8_Code_Point;
end record;
Full_Range : constant Code_Points_Range;
--
-- Code_Points_Ranges -- An array of ranges
--
type Code_Points_Ranges is
array (Positive range <>) of Code_Points_Range;
private
--
-- Reverse_Put -- Put one code point in reverse
--
-- Destination - The target string
-- Pointer - The position where to place the encoded point
-- Prefix - The prefix in UTF-8 encoding
-- Position - The position of the last encoded character
--
-- This procedure places Prefix & Character'Val (Position) in the
-- positions of Destination (..Pointer). Then Pointer is moved back to
-- the first position before the first character of the output.
--
-- Exceptions :
--
-- Layout_Error - No room for output
--
procedure Reverse_Put
( Destination : in out String;
Pointer : in out Integer;
Prefix : String;
Position : Natural
);
Full_Range : constant Code_Points_Range :=
( Low => UTF8_Code_Point'First,
High => UTF8_Code_Point'Last
);
end Strings_Edit.UTF8;
| 34.953271 | 73 | 0.585428 |
13517c7565a53c154d95fc6dfc41484e904baaa1 | 135 | adb | Ada | llvm-2.9/test/FrontendAda/array_constructor.adb | DependableSystemsLab/Trident | 90b38ab3ce8b7ad743986ddf66eaea7d20d921cb | [
"MIT"
] | 5 | 2018-09-23T05:44:31.000Z | 2021-09-08T18:52:37.000Z | llvm-2.9/test/FrontendAda/array_constructor.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 4 | 2019-06-13T16:27:31.000Z | 2021-06-07T07:24:31.000Z | llvm-2.9/test/FrontendAda/array_constructor.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 4 | 2018-09-23T05:44:33.000Z | 2021-04-20T00:29:11.000Z | -- RUN: %llvmgcc -S %s
procedure Array_Constructor is
A : array (Integer range <>) of Boolean := (True, False);
begin
null;
end;
| 19.285714 | 60 | 0.651852 |
13f26c896523b70b575599ac0870f198c6b5e5df | 306,670 | adb | Ada | Acceleration/memcached/hls/memcachedPipeline_prj/solution1/.autopilot/db/hashKeyResizer.bind.adb | pratik0509/HLSx_Xilinx_edit | 14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca | [
"BSD-3-Clause"
] | null | null | null | Acceleration/memcached/hls/memcachedPipeline_prj/solution1/.autopilot/db/hashKeyResizer.bind.adb | pratik0509/HLSx_Xilinx_edit | 14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca | [
"BSD-3-Clause"
] | null | null | null | Acceleration/memcached/hls/memcachedPipeline_prj/solution1/.autopilot/db/hashKeyResizer.bind.adb | pratik0509/HLSx_Xilinx_edit | 14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca | [
"BSD-3-Clause"
] | 1 | 2018-11-13T17:59:49.000Z | 2018-11-13T17:59:49.000Z | <?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>hashKeyResizer</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>5</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>5</id>
<name>in2hashKeyLength_V_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>in2hash_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>130</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>resizedKeyLength_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>resizedInitValue_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>resizedKey_V_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>109</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>keyResizerState_load</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>206</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>149</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>keyResizerLength_V_l</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>232</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>232</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>150</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>p_Val2_s</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>233</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>233</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>151</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>p_Val2_23</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>295</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>295</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>152</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>206</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>18</count>
<item_version>0</item_version>
<item>153</item>
<item>154</item>
<item>156</item>
<item>157</item>
<item>159</item>
<item>160</item>
<item>162</item>
<item>163</item>
<item>165</item>
<item>166</item>
<item>168</item>
<item>169</item>
<item>171</item>
<item>172</item>
<item>174</item>
<item>175</item>
<item>177</item>
<item>178</item>
</oprand_edges>
<opcode>switch</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.87</m_delay>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>tmp_V_48</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>309</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>309</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>432</item>
<item>433</item>
<item>434</item>
<item>435</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>309</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>309</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>436</item>
<item>437</item>
<item>634</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.20</m_delay>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>310</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>310</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>438</item>
<item>439</item>
<item>440</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>311</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>311</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>441</item>
<item>442</item>
<item>633</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.15</m_delay>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>312</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>312</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>443</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>p_Result_41_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>302</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>302</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>413</item>
<item>414</item>
<item>415</item>
<item>416</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>p_Result_40</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>302</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>302</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>418</item>
<item>419</item>
<item>420</item>
<item>421</item>
<item>423</item>
</oprand_edges>
<opcode>partset</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>302</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>302</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>424</item>
<item>425</item>
<item>632</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.20</m_delay>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>303</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>303</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>426</item>
<item>427</item>
<item>428</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>304</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>304</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>429</item>
<item>430</item>
<item>631</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.15</m_delay>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>305</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>305</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>431</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>p_Result_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>295</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>295</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>393</item>
<item>394</item>
<item>395</item>
<item>396</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>p_Result_39</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>295</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>295</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>398</item>
<item>399</item>
<item>400</item>
<item>402</item>
<item>404</item>
</oprand_edges>
<opcode>partset</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>295</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>295</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>405</item>
<item>406</item>
<item>630</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.20</m_delay>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>296</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>296</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>407</item>
<item>408</item>
<item>409</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>297</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>297</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>410</item>
<item>411</item>
<item>629</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.15</m_delay>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>298</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>298</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>412</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp_426</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>360</item>
<item>361</item>
<item>362</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>280</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>280</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>363</item>
<item>364</item>
<item>365</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.3</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>130</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>366</item>
<item>367</item>
<item>650</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>p_Val2_26</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>368</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name></name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>281</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>369</item>
<item>370</item>
<item>643</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>tmp_435</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>281</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>371</item>
<item>372</item>
<item>373</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>tmp_V_51</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>282</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>282</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>374</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>282</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>282</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>375</item>
<item>376</item>
<item>644</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.20</m_delay>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>283</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>283</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>377</item>
<item>378</item>
<item>379</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>tmp_190_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>284</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>284</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>380</item>
<item>381</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>284</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>284</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>382</item>
<item>383</item>
<item>384</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>storemerge_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>285</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>285</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>385</item>
<item>386</item>
<item>387</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.51</m_delay>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>286</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>286</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>388</item>
<item>389</item>
<item>648</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.15</m_delay>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>289</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>289</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>390</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>290</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>391</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>291</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>291</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>392</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>tmp_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>269</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>269</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>336</item>
<item>337</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.35</m_delay>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>269</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>269</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>338</item>
<item>339</item>
<item>627</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>tmp_V</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>270</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>270</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>341</item>
<item>342</item>
<item>344</item>
<item>345</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>270</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>270</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>346</item>
<item>347</item>
<item>628</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.20</m_delay>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>271</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>348</item>
<item>349</item>
<item>350</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>tmp_183_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>272</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>272</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>351</item>
<item>353</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>storemerge16_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>272</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>272</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>354</item>
<item>355</item>
<item>356</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.51</m_delay>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>273</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>273</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>357</item>
<item>358</item>
<item>626</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.15</m_delay>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>276</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>276</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>359</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>tmp_425</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>289</item>
<item>290</item>
<item>291</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>250</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>250</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>292</item>
<item>293</item>
<item>294</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>tmp_188_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>251</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>251</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>295</item>
<item>296</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.35</m_delay>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>251</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>251</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>297</item>
<item>298</item>
<item>640</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>p_Result_47_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>252</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>252</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>300</item>
<item>301</item>
<item>303</item>
<item>304</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>tmp_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.2</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>130</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>305</item>
<item>306</item>
<item>651</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>p_Val2_25</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>253</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>307</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name></name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>253</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>308</item>
<item>309</item>
<item>641</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>tmp_432</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>253</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>310</item>
<item>311</item>
<item>312</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>tmp_433</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>254</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>254</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>313</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>p_Result_38</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>254</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>254</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>315</item>
<item>316</item>
<item>317</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>254</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>254</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>318</item>
<item>319</item>
<item>642</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.20</m_delay>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>255</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>255</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>320</item>
<item>321</item>
<item>322</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>tmp_189_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>256</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>256</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>323</item>
<item>325</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>storemerge19_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>257</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>326</item>
<item>327</item>
<item>328</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>storemerge20_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>256</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>256</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>329</item>
<item>330</item>
<item>331</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.51</m_delay>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>263</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>263</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>332</item>
<item>333</item>
<item>639</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.15</m_delay>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>264</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>264</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>334</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>265</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>265</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>335</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>tmp_424</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>240</item>
<item>241</item>
<item>242</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>231</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>231</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>243</item>
<item>244</item>
<item>245</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>tmp_186_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>232</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>232</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>247</item>
<item>248</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.35</m_delay>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>232</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>232</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>249</item>
<item>250</item>
<item>636</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>p_Result_44_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>233</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>233</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>252</item>
<item>253</item>
<item>255</item>
<item>257</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>tmp_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.1</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>130</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>258</item>
<item>259</item>
<item>652</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>p_Val2_24</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>234</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>260</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name></name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>234</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>261</item>
<item>262</item>
<item>637</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>105</id>
<name>tmp_429</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>234</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>263</item>
<item>264</item>
<item>265</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name>tmp_430</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>235</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>235</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>266</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name>p_Result_s</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>235</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>235</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>268</item>
<item>269</item>
<item>270</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>108</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>235</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>235</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>271</item>
<item>272</item>
<item>638</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.20</m_delay>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>236</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>236</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>273</item>
<item>274</item>
<item>275</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>tmp_187_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>237</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>237</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>276</item>
<item>278</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>storemerge17_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>238</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>238</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>279</item>
<item>280</item>
<item>281</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name>storemerge18_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>237</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>237</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>282</item>
<item>283</item>
<item>284</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.51</m_delay>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>244</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>244</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>285</item>
<item>286</item>
<item>635</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.15</m_delay>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>114</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>245</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>245</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>287</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>246</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>246</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>288</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name>tmp</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>210</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>210</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>180</item>
<item>181</item>
<item>183</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>210</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>210</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>184</item>
<item>185</item>
<item>186</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name>tmp_427</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>188</item>
<item>189</item>
<item>190</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>122</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>210</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>210</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>191</item>
<item>192</item>
<item>193</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name>tmp_V_52</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>212</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>195</item>
<item>196</item>
<item>653</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>125</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>212</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>197</item>
<item>198</item>
<item>645</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>126</id>
<name>tmp111</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp111</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>130</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>200</item>
<item>201</item>
<item>654</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name>p_Val2_27</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>213</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>202</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>128</id>
<name></name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>213</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>203</item>
<item>204</item>
<item>646</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>tmp_438</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/hashTable/../globals.h</first>
<second>operator=</second>
</first>
<second>120</second>
</item>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>213</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>206</item>
<item>207</item>
<item>209</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_101">
<Value>
<Obj>
<type>0</type>
<id>130</id>
<name>tmp_46</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>215</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>210</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>131</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>215</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>212</item>
<item>213</item>
<item>214</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>132</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>216</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>216</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>215</item>
<item>216</item>
<item>218</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>133</id>
<name>tmp_V_53</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>217</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>217</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>219</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>134</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>217</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>217</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>220</item>
<item>221</item>
<item>647</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.20</m_delay>
</item>
<item class_id_reference="9" object_id="_106">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>218</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>218</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>223</item>
<item>224</item>
<item>225</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_107">
<Value>
<Obj>
<type>0</type>
<id>136</id>
<name>tmp_191_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>220</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>220</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>226</item>
<item>228</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_108">
<Value>
<Obj>
<type>0</type>
<id>137</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>220</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>220</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>229</item>
<item>230</item>
<item>231</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_109">
<Value>
<Obj>
<type>0</type>
<id>139</id>
<name>storemerge21_i</name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>221</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>221</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>232</item>
<item>233</item>
<item>234</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.51</m_delay>
</item>
<item class_id_reference="9" object_id="_110">
<Value>
<Obj>
<type>0</type>
<id>140</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>222</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>222</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>235</item>
<item>236</item>
<item>649</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.15</m_delay>
</item>
<item class_id_reference="9" object_id="_111">
<Value>
<Obj>
<type>0</type>
<id>141</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>225</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>237</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_112">
<Value>
<Obj>
<type>0</type>
<id>143</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>226</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>226</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>238</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_113">
<Value>
<Obj>
<type>0</type>
<id>145</id>
<name></name>
<fileName>sources/hashTable/hash.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>227</lineNumber>
<contextFuncName>hashKeyResizer</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/hashTable/hash.cpp</first>
<second>hashKeyResizer</second>
</first>
<second>227</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>239</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_114">
<Value>
<Obj>
<type>0</type>
<id>147</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>23</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_115">
<Value>
<Obj>
<type>2</type>
<id>155</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="_116">
<Value>
<Obj>
<type>2</type>
<id>158</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="_117">
<Value>
<Obj>
<type>2</type>
<id>161</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>2</content>
</item>
<item class_id_reference="16" object_id="_118">
<Value>
<Obj>
<type>2</type>
<id>164</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>3</content>
</item>
<item class_id_reference="16" object_id="_119">
<Value>
<Obj>
<type>2</type>
<id>167</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="_120">
<Value>
<Obj>
<type>2</type>
<id>170</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>5</content>
</item>
<item class_id_reference="16" object_id="_121">
<Value>
<Obj>
<type>2</type>
<id>173</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>6</content>
</item>
<item class_id_reference="16" object_id="_122">
<Value>
<Obj>
<type>2</type>
<id>176</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>
<item class_id_reference="16" object_id="_123">
<Value>
<Obj>
<type>2</type>
<id>182</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_124">
<Value>
<Obj>
<type>2</type>
<id>208</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>129</content>
</item>
<item class_id_reference="16" object_id="_125">
<Value>
<Obj>
<type>2</type>
<id>217</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>13</content>
</item>
<item class_id_reference="16" object_id="_126">
<Value>
<Obj>
<type>2</type>
<id>227</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>12</content>
</item>
<item class_id_reference="16" object_id="_127">
<Value>
<Obj>
<type>2</type>
<id>246</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>240</content>
</item>
<item class_id_reference="16" object_id="_128">
<Value>
<Obj>
<type>2</type>
<id>254</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>96</content>
</item>
<item class_id_reference="16" object_id="_129">
<Value>
<Obj>
<type>2</type>
<id>256</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>127</content>
</item>
<item class_id_reference="16" object_id="_130">
<Value>
<Obj>
<type>2</type>
<id>277</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>8</content>
</item>
<item class_id_reference="16" object_id="_131">
<Value>
<Obj>
<type>2</type>
<id>302</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_132">
<Value>
<Obj>
<type>2</type>
<id>324</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>4</content>
</item>
<item class_id_reference="16" object_id="_133">
<Value>
<Obj>
<type>2</type>
<id>343</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_134">
<Value>
<Obj>
<type>2</type>
<id>352</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>0</content>
</item>
<item class_id_reference="16" object_id="_135">
<Value>
<Obj>
<type>2</type>
<id>401</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="_136">
<Value>
<Obj>
<type>2</type>
<id>403</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="_137">
<Value>
<Obj>
<type>2</type>
<id>422</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>63</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>23</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_138">
<Obj>
<type>3</type>
<id>22</id>
<name>entry</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_139">
<Obj>
<type>3</type>
<id>28</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_140">
<Obj>
<type>3</type>
<id>35</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_141">
<Obj>
<type>3</type>
<id>42</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>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_142">
<Obj>
<type>3</type>
<id>45</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>2</count>
<item_version>0</item_version>
<item>43</item>
<item>44</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_143">
<Obj>
<type>3</type>
<id>55</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>9</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_144">
<Obj>
<type>3</type>
<id>59</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>3</count>
<item_version>0</item_version>
<item>56</item>
<item>57</item>
<item>58</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_145">
<Obj>
<type>3</type>
<id>61</id>
<name>._crit_edge12.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_146">
<Obj>
<type>3</type>
<id>63</id>
<name>._crit_edge11.i</name>
<fileName></fileName>
<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>62</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_147">
<Obj>
<type>3</type>
<id>73</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>9</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_148">
<Obj>
<type>3</type>
<id>76</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>2</count>
<item_version>0</item_version>
<item>74</item>
<item>75</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_149">
<Obj>
<type>3</type>
<id>93</id>
<name>_ifconv1</name>
<fileName></fileName>
<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>16</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_150">
<Obj>
<type>3</type>
<id>95</id>
<name>._crit_edge9.i</name>
<fileName></fileName>
<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>94</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_151">
<Obj>
<type>3</type>
<id>98</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>2</count>
<item_version>0</item_version>
<item>96</item>
<item>97</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_152">
<Obj>
<type>3</type>
<id>115</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>16</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_153">
<Obj>
<type>3</type>
<id>117</id>
<name>._crit_edge7.i</name>
<fileName></fileName>
<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>116</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_154">
<Obj>
<type>3</type>
<id>120</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>2</count>
<item_version>0</item_version>
<item>118</item>
<item>119</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_155">
<Obj>
<type>3</type>
<id>123</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>2</count>
<item_version>0</item_version>
<item>121</item>
<item>122</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_156">
<Obj>
<type>3</type>
<id>138</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>14</count>
<item_version>0</item_version>
<item>124</item>
<item>125</item>
<item>126</item>
<item>127</item>
<item>128</item>
<item>129</item>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
<item>134</item>
<item>135</item>
<item>136</item>
<item>137</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_157">
<Obj>
<type>3</type>
<id>142</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>3</count>
<item_version>0</item_version>
<item>139</item>
<item>140</item>
<item>141</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_158">
<Obj>
<type>3</type>
<id>144</id>
<name>._crit_edge6.i</name>
<fileName></fileName>
<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>143</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_159">
<Obj>
<type>3</type>
<id>146</id>
<name>._crit_edge4.i</name>
<fileName></fileName>
<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>145</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_160">
<Obj>
<type>3</type>
<id>148</id>
<name>hashKeyResizer.exit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>147</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>290</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_161">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_164">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>157</id>
<edge_type>2</edge_type>
<source_obj>120</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>158</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>160</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>163</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_174">
<id>166</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>169</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>172</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>173</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>175</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_181">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>176</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>178</id>
<edge_type>2</edge_type>
<source_obj>28</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>184</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="_186">
<id>185</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>186</id>
<edge_type>2</edge_type>
<source_obj>123</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>192</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>193</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_195">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>203</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="_199">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>208</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>214</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="_205">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>217</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>220</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="_209">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>133</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>227</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>229</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="_215">
<id>230</id>
<edge_type>2</edge_type>
<source_obj>144</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>231</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>158</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>237</id>
<edge_type>2</edge_type>
<source_obj>144</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>238</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>239</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>243</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="_228">
<id>244</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>245</id>
<edge_type>2</edge_type>
<source_obj>115</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>246</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>256</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>260</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="_239">
<id>261</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>264</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>208</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>269</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="_245">
<id>270</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>271</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="_247">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>275</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>276</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_251">
<id>278</id>
<edge_type>1</edge_type>
<source_obj>277</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_252">
<id>279</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_253">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>173</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>281</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>282</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>283</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>284</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_258">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>112</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_259">
<id>286</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>287</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>288</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_262">
<id>290</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_263">
<id>291</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_264">
<id>292</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="_265">
<id>293</id>
<edge_type>2</edge_type>
<source_obj>95</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_266">
<id>294</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_267">
<id>295</id>
<edge_type>1</edge_type>
<source_obj>246</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_268">
<id>296</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="_269">
<id>297</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_270">
<id>298</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_271">
<id>301</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_272">
<id>303</id>
<edge_type>1</edge_type>
<source_obj>302</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_273">
<id>304</id>
<edge_type>1</edge_type>
<source_obj>256</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_274">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_275">
<id>307</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="_276">
<id>308</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="_277">
<id>309</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_278">
<id>311</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_279">
<id>312</id>
<edge_type>1</edge_type>
<source_obj>208</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_280">
<id>313</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_281">
<id>316</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="_282">
<id>317</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_283">
<id>318</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="_284">
<id>319</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_285">
<id>321</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_286">
<id>322</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="_287">
<id>323</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_288">
<id>325</id>
<edge_type>1</edge_type>
<source_obj>324</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_289">
<id>326</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_290">
<id>327</id>
<edge_type>1</edge_type>
<source_obj>176</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_291">
<id>328</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_292">
<id>329</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="_293">
<id>330</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_294">
<id>331</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_295">
<id>332</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_296">
<id>333</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_297">
<id>334</id>
<edge_type>2</edge_type>
<source_obj>95</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_298">
<id>335</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_299">
<id>336</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_300">
<id>337</id>
<edge_type>1</edge_type>
<source_obj>246</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_301">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_302">
<id>339</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_303">
<id>342</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_304">
<id>344</id>
<edge_type>1</edge_type>
<source_obj>343</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_305">
<id>345</id>
<edge_type>1</edge_type>
<source_obj>256</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_306">
<id>346</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="_307">
<id>347</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_308">
<id>349</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_309">
<id>350</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_310">
<id>351</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="_311">
<id>353</id>
<edge_type>1</edge_type>
<source_obj>352</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_312">
<id>354</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="_313">
<id>355</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_314">
<id>356</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_315">
<id>357</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="_316">
<id>358</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_317">
<id>359</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_318">
<id>361</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_319">
<id>362</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_320">
<id>363</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_321">
<id>364</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_322">
<id>365</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_323">
<id>367</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_324">
<id>368</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_325">
<id>369</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_326">
<id>370</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_327">
<id>372</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_328">
<id>373</id>
<edge_type>1</edge_type>
<source_obj>208</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_329">
<id>374</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_330">
<id>375</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="_331">
<id>376</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_332">
<id>378</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_333">
<id>379</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_334">
<id>380</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_335">
<id>381</id>
<edge_type>1</edge_type>
<source_obj>227</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_336">
<id>382</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="_337">
<id>383</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_338">
<id>384</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_339">
<id>385</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_340">
<id>386</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_341">
<id>387</id>
<edge_type>1</edge_type>
<source_obj>158</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_342">
<id>388</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="_343">
<id>389</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_344">
<id>390</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_345">
<id>391</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_346">
<id>392</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_347">
<id>394</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_348">
<id>395</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_349">
<id>396</id>
<edge_type>1</edge_type>
<source_obj>256</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_350">
<id>399</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_351">
<id>400</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_352">
<id>402</id>
<edge_type>1</edge_type>
<source_obj>401</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_353">
<id>404</id>
<edge_type>1</edge_type>
<source_obj>403</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_354">
<id>405</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_355">
<id>406</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_356">
<id>408</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_357">
<id>409</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_358">
<id>410</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_359">
<id>411</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_360">
<id>412</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_361">
<id>414</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_362">
<id>415</id>
<edge_type>1</edge_type>
<source_obj>302</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_363">
<id>416</id>
<edge_type>1</edge_type>
<source_obj>256</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_364">
<id>419</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_365">
<id>420</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_366">
<id>421</id>
<edge_type>1</edge_type>
<source_obj>401</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_367">
<id>423</id>
<edge_type>1</edge_type>
<source_obj>422</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_368">
<id>424</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_369">
<id>425</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_370">
<id>427</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_371">
<id>428</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_372">
<id>429</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_373">
<id>430</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_374">
<id>431</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_375">
<id>433</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_376">
<id>434</id>
<edge_type>1</edge_type>
<source_obj>343</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_377">
<id>435</id>
<edge_type>1</edge_type>
<source_obj>256</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_378">
<id>436</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_379">
<id>437</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_380">
<id>439</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_381">
<id>440</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_382">
<id>441</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_383">
<id>442</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_384">
<id>443</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_385">
<id>589</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_386">
<id>590</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_387">
<id>591</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_388">
<id>592</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_389">
<id>593</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_390">
<id>594</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_391">
<id>595</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_392">
<id>596</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_393">
<id>597</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_394">
<id>598</id>
<edge_type>2</edge_type>
<source_obj>28</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_395">
<id>599</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_396">
<id>600</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_397">
<id>601</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_398">
<id>602</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_399">
<id>603</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_400">
<id>604</id>
<edge_type>2</edge_type>
<source_obj>55</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_401">
<id>605</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_402">
<id>606</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_403">
<id>607</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_404">
<id>608</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_405">
<id>609</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_406">
<id>610</id>
<edge_type>2</edge_type>
<source_obj>76</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_407">
<id>611</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_408">
<id>612</id>
<edge_type>2</edge_type>
<source_obj>95</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_409">
<id>613</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_410">
<id>614</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_411">
<id>615</id>
<edge_type>2</edge_type>
<source_obj>115</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_412">
<id>616</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_413">
<id>617</id>
<edge_type>2</edge_type>
<source_obj>120</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_414">
<id>618</id>
<edge_type>2</edge_type>
<source_obj>120</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_415">
<id>619</id>
<edge_type>2</edge_type>
<source_obj>123</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_416">
<id>620</id>
<edge_type>2</edge_type>
<source_obj>123</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_417">
<id>621</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_418">
<id>622</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_419">
<id>623</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_420">
<id>624</id>
<edge_type>2</edge_type>
<source_obj>144</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_421">
<id>625</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_422">
<id>626</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_423">
<id>627</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_424">
<id>628</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_425">
<id>629</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_426">
<id>630</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_427">
<id>631</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_428">
<id>632</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_429">
<id>633</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_430">
<id>634</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_431">
<id>635</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_432">
<id>636</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_433">
<id>637</id>
<edge_type>4</edge_type>
<source_obj>19</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_434">
<id>638</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_435">
<id>639</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_436">
<id>640</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_437">
<id>641</id>
<edge_type>4</edge_type>
<source_obj>19</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_438">
<id>642</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_439">
<id>643</id>
<edge_type>4</edge_type>
<source_obj>19</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_440">
<id>644</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_441">
<id>645</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_442">
<id>646</id>
<edge_type>4</edge_type>
<source_obj>19</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_443">
<id>647</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_444">
<id>648</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_445">
<id>649</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_446">
<id>650</id>
<edge_type>4</edge_type>
<source_obj>43</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_447">
<id>651</id>
<edge_type>4</edge_type>
<source_obj>74</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_448">
<id>652</id>
<edge_type>4</edge_type>
<source_obj>96</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_449">
<id>653</id>
<edge_type>4</edge_type>
<source_obj>118</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_450">
<id>654</id>
<edge_type>4</edge_type>
<source_obj>121</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_451">
<mId>1</mId>
<mTag>hashKeyResizer</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>23</count>
<item_version>0</item_version>
<item>22</item>
<item>28</item>
<item>35</item>
<item>42</item>
<item>45</item>
<item>55</item>
<item>59</item>
<item>61</item>
<item>63</item>
<item>73</item>
<item>76</item>
<item>93</item>
<item>95</item>
<item>98</item>
<item>115</item>
<item>117</item>
<item>120</item>
<item>123</item>
<item>138</item>
<item>142</item>
<item>144</item>
<item>146</item>
<item>148</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>1</mMinLatency>
<mMaxLatency>1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_452">
<states class_id="25" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_453">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>68</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_454">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_455">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_456">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_457">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_458">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_459">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_460">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_461">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_462">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_463">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_464">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_465">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_466">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_467">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_468">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_469">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_470">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_471">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_472">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_473">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_474">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_475">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_476">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_477">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_478">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_479">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_480">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_481">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_482">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_483">
<id>78</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_484">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_485">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_486">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_487">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_488">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_489">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_490">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_491">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_492">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_493">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_494">
<id>96</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_495">
<id>99</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_496">
<id>100</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_497">
<id>102</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_498">
<id>103</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_499">
<id>104</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_500">
<id>105</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_501">
<id>106</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_502">
<id>110</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_503">
<id>111</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_504">
<id>112</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_505">
<id>113</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_506">
<id>116</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_507">
<id>118</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_508">
<id>119</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_509">
<id>121</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_510">
<id>124</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_511">
<id>125</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_512">
<id>126</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_513">
<id>127</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_514">
<id>128</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_515">
<id>129</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_516">
<id>133</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_517">
<id>136</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_518">
<id>137</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_519">
<id>139</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_520">
<id>140</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_521">
<id>145</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_522">
<id>2</id>
<operations>
<count>48</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_523">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_524">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_525">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_526">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_527">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_528">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_529">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_530">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_531">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_532">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_533">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_534">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_535">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_536">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_537">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_538">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_539">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_540">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_541">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_542">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_543">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_544">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_545">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_546">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_547">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_548">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_549">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_550">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_551">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_552">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_553">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_554">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_555">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_556">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_557">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_558">
<id>107</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_559">
<id>108</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_560">
<id>109</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_561">
<id>114</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_562">
<id>122</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_563">
<id>130</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_564">
<id>131</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_565">
<id>132</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_566">
<id>134</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_567">
<id>135</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_568">
<id>141</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_569">
<id>143</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_570">
<id>147</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_571">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>102</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="35" tracking_level="0" version="0">
<count>109</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>17</first>
<second class_id="37" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>126</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>127</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>128</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>129</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>130</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>132</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>133</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>134</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>137</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>139</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>140</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>141</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>143</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>145</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>147</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="38" tracking_level="0" version="0">
<count>23</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>22</first>
<second class_id="40" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>138</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>142</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>144</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>146</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>148</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="41" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="1" version="0" object_id="_572">
<region_name>hashKeyResizer</region_name>
<basic_blocks>
<count>23</count>
<item_version>0</item_version>
<item>22</item>
<item>28</item>
<item>35</item>
<item>42</item>
<item>45</item>
<item>55</item>
<item>59</item>
<item>61</item>
<item>63</item>
<item>73</item>
<item>76</item>
<item>93</item>
<item>95</item>
<item>98</item>
<item>115</item>
<item>117</item>
<item>120</item>
<item>123</item>
<item>138</item>
<item>142</item>
<item>144</item>
<item>146</item>
<item>148</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="43" tracking_level="0" version="0">
<count>62</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>166</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>43</item>
<item>74</item>
<item>96</item>
<item>121</item>
</second>
</item>
<item>
<first>174</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>46</item>
<item>80</item>
<item>102</item>
<item>126</item>
</second>
</item>
<item>
<first>180</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</second>
</item>
<item>
<first>188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>194</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>25</item>
<item>32</item>
<item>39</item>
<item>52</item>
<item>68</item>
<item>87</item>
<item>109</item>
<item>135</item>
</second>
</item>
<item>
<first>201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
<item>
<first>208</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>216</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>26</item>
<item>33</item>
<item>40</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>129</item>
</second>
</item>
<item>
<first>230</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>56</item>
<item>139</item>
</second>
</item>
<item>
<first>238</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>57</item>
<item>140</item>
</second>
</item>
<item>
<first>244</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>77</item>
<item>99</item>
</second>
</item>
<item>
<first>249</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>78</item>
<item>100</item>
</second>
</item>
<item>
<first>255</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>66</item>
</second>
</item>
<item>
<first>265</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>24</item>
<item>67</item>
</second>
</item>
<item>
<first>271</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>29</item>
<item>79</item>
</second>
</item>
<item>
<first>280</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>101</item>
</second>
</item>
<item>
<first>289</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>293</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>348</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>372</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>376</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>382</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>404</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>408</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>414</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</second>
</item>
<item>
<first>422</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>426</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>432</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>440</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</second>
</item>
<item>
<first>448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>454</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>460</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</second>
</item>
<item>
<first>464</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</second>
</item>
<item>
<first>470</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</second>
</item>
<item>
<first>474</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</second>
</item>
<item>
<first>480</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>484</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>497</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>516</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>522</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>527</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>535</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>541</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>549</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>555</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</second>
</item>
<item>
<first>559</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="46" tracking_level="0" version="0">
<count>32</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>grp_fu_222</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>129</item>
</second>
</item>
<item>
<first>grp_fu_230</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>56</item>
<item>139</item>
</second>
</item>
<item>
<first>grp_fu_244</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>77</item>
<item>99</item>
</second>
</item>
<item>
<first>grp_fu_255</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>66</item>
</second>
</item>
<item>
<first>grp_fu_271</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>29</item>
<item>79</item>
</second>
</item>
<item>
<first>grp_fu_280</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>101</item>
</second>
</item>
<item>
<first>p_Result_38_fu_527</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>p_Result_39_fu_503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_Result_40_fu_484</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>p_Result_s_fu_541</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>p_Val2_24_fu_404</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>p_Val2_25_fu_354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>p_Val2_26_fu_302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>p_Val2_27_fu_460</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</second>
</item>
<item>
<first>storemerge16_i_fu_340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>storemerge17_i_fu_432</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>storemerge18_i_fu_440</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</second>
</item>
<item>
<first>storemerge19_i_fu_382</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>storemerge20_i_fu_390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>tmp_183_i_fu_334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>tmp_187_i_fu_426</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>tmp_189_i_fu_376</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>tmp_190_i_fu_316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>tmp_191_i_fu_474</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</second>
</item>
<item>
<first>tmp_429_fu_414</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</second>
</item>
<item>
<first>tmp_430_fu_422</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>tmp_432_fu_364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>tmp_433_fu_372</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>tmp_46_fu_555</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</second>
</item>
<item>
<first>tmp_V_51_fu_312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp_V_53_fu_470</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</second>
</item>
<item>
<first>tmp_i_fu_322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>30</count>
<item_version>0</item_version>
<item>
<first>StgValue_101_store_fu_535</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>StgValue_107_store_fu_549</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>StgValue_112_write_fu_201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
<item>
<first>StgValue_113_write_fu_208</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>StgValue_114_store_fu_559</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</second>
</item>
<item>
<first>StgValue_16_store_fu_306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>StgValue_25_store_fu_328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>StgValue_28_store_fu_348</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>StgValue_35_store_fu_358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>StgValue_41_store_fu_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>StgValue_48_store_fu_408</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>StgValue_54_store_fu_448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>StgValue_60_store_fu_454</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>StgValue_63_store_fu_464</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</second>
</item>
<item>
<first>StgValue_84_store_fu_497</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>StgValue_88_store_fu_516</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>StgValue_91_store_fu_522</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>grp_nbreadreq_fu_166</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>43</item>
<item>74</item>
<item>96</item>
<item>121</item>
</second>
</item>
<item>
<first>grp_read_fu_174</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>46</item>
<item>80</item>
<item>102</item>
<item>126</item>
</second>
</item>
<item>
<first>grp_store_fu_216</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>26</item>
<item>33</item>
<item>40</item>
</second>
</item>
<item>
<first>grp_store_fu_238</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>57</item>
<item>140</item>
</second>
</item>
<item>
<first>grp_store_fu_249</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>78</item>
<item>100</item>
</second>
</item>
<item>
<first>grp_store_fu_265</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>24</item>
<item>67</item>
</second>
</item>
<item>
<first>grp_write_fu_194</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>25</item>
<item>32</item>
<item>39</item>
<item>52</item>
<item>68</item>
<item>87</item>
<item>109</item>
<item>135</item>
</second>
</item>
<item>
<first>keyResizerLength_V_l_load_fu_293</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>keyResizerState_load_load_fu_289</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>p_Val2_23_load_fu_480</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>p_Val2_s_load_fu_298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_V_52_read_fu_188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>tmp_nbreadreq_fu_180</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="48" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>14</count>
<item_version>0</item_version>
<item>
<first>564</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>568</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>575</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>579</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>585</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>589</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>593</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>598</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>602</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>607</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</second>
</item>
<item>
<first>611</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</second>
</item>
<item>
<first>615</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>620</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</second>
</item>
<item>
<first>626</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>14</count>
<item_version>0</item_version>
<item>
<first>keyResizerState_load_reg_564</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>p_Val2_s_reg_568</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_190_i_reg_585</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>tmp_191_i_reg_626</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</second>
</item>
<item>
<first>tmp_424_reg_598</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>tmp_425_reg_589</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>tmp_426_reg_575</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_427_reg_611</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</second>
</item>
<item>
<first>tmp_430_reg_602</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>tmp_433_reg_593</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>tmp_V_51_reg_579</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp_V_52_reg_615</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>tmp_V_53_reg_620</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</second>
</item>
<item>
<first>tmp_reg_607</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="49" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="0" version="0">
<first>in2hashKeyLength_V_V</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>nbreadreq</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</second>
</item>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
</second>
</item>
<item>
<first>in2hash_V</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>nbreadreq</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>121</item>
<item>96</item>
<item>74</item>
<item>43</item>
</second>
</item>
<item>
<first>read</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>126</item>
<item>102</item>
<item>80</item>
<item>46</item>
</second>
</item>
</second>
</item>
<item>
<first>resizedInitValue_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
</second>
</item>
<item>
<first>resizedKeyLength_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
</second>
</item>
<item>
<first>resizedKey_V_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>135</item>
<item>109</item>
<item>87</item>
<item>68</item>
<item>52</item>
<item>39</item>
<item>32</item>
<item>25</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="51" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>5</first>
<second>FIFO</second>
</item>
<item>
<first>6</first>
<second>FIFO</second>
</item>
<item>
<first>7</first>
<second>FIFO</second>
</item>
<item>
<first>8</first>
<second>FIFO</second>
</item>
<item>
<first>9</first>
<second>FIFO</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 26.540026 | 105 | 0.598252 |
57ee92c4cf6115224bfcfde10140b2be5bee1df9 | 4,358 | adb | Ada | demo/src/demo.adb | VitalijBondarenko/notifyada | 6bda83bf698b97fff150e2f7bc49d0684a7eb7d5 | [
"MIT"
] | null | null | null | demo/src/demo.adb | VitalijBondarenko/notifyada | 6bda83bf698b97fff150e2f7bc49d0684a7eb7d5 | [
"MIT"
] | null | null | null | demo/src/demo.adb | VitalijBondarenko/notifyada | 6bda83bf698b97fff150e2f7bc49d0684a7eb7d5 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (c) 2014-2021 Vitalii Bondarenko <[email protected]> --
-- --
------------------------------------------------------------------------------
-- --
-- The MIT License (MIT) --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, sublicense, and/or sell copies of the Software, and to --
-- permit persons to whom the Software is furnished to do so, subject to --
-- the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY --
-- CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, --
-- TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE --
-- SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
------------------------------------------------------------------------------
with Ada.Text_IO; use Ada.Text_IO;
with Glib; use Glib;
with Glib.Glist; use Glib.Glist;
with Gtk.Enums; use Gtk.Enums;
use Gtk.Enums.String_List;
with Gtk.Main;
with Notify; use Notify;
with Notify.Notification; use Notify.Notification;
with GPS_Utils; use GPS_Utils;
procedure Demo is
Notification : Notify_Notification;
R : Boolean;
Name : String_Ptr;
Vendor : String_Ptr;
Version : String_Ptr;
Spec_Version : String_Ptr;
Server_Caps : String_List.Glist;
begin
Restore_GPS_Startup_Values;
Gtk.Main.Init;
-- Init libnotyfy.
R := Notify_Init ("Notify_Ada");
-- Create simple notification.
G_New
(Notification,
"Ada binding to the libnotify.",
"The simple notification.",
"");
Notification.Set_Timeout (NOTIFY_EXPIRES_DEFAULT);
R := Notification.Show;
Notification.Unref;
-- Create notification with icon.
G_New
(Notification,
"Ada binding to the libnotify.",
"The notification with icon.",
"media-removable");
R := Notification.Show;
Notification.Unref;
-- Create notification with customized body text.
G_New
(Notification,
"Ada binding to the libnotify.",
"Some <b>bold</b>, <u>underlined</u>, <i>italic</i>, " &
"<a href='http://www.google.com'>linked on Google</a> text",
"");
R := Notification.Show;
Notification.Unref;
-- Get and print information about server.
R := Notify_Get_Server_Info (Name, Vendor, Version, Spec_Version);
Put_Line ("Server information :");
Put_Line ("Name : " & Name.all);
Put_Line ("Vendor : " & Vendor.all);
Put_Line ("Version : " & Version.all);
Put_Line ("Spec version : " & Spec_Version.all);
New_Line;
-- Get and print information about server capabilities.
Server_Caps := Notify_Get_Server_Caps;
Put_Line ("Server capabilities :");
while Server_Caps /= String_List.Null_List loop
Put_Line (String_List.Get_Data (Server_Caps));
Server_Caps := String_List.Next (Server_Caps);
end loop;
Free_String_List (Server_Caps);
Notify_Uninit;
end Demo;
| 41.113208 | 78 | 0.530289 |
04f975c0432033087126befcb16615e77a64f6af | 7,905 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-chahan.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-chahan.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-chahan.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . C H A R A C T E R S . H A N D L I N G --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package Ada.Characters.Handling is
pragma Pure;
-- In accordance with Ada 2005 AI-362
----------------------------------------
-- Character Classification Functions --
----------------------------------------
function Is_Control (Item : Character) return Boolean;
function Is_Graphic (Item : Character) return Boolean;
function Is_Letter (Item : Character) return Boolean;
function Is_Lower (Item : Character) return Boolean;
function Is_Upper (Item : Character) return Boolean;
function Is_Basic (Item : Character) return Boolean;
function Is_Digit (Item : Character) return Boolean;
function Is_Decimal_Digit (Item : Character) return Boolean
renames Is_Digit;
function Is_Hexadecimal_Digit (Item : Character) return Boolean;
function Is_Alphanumeric (Item : Character) return Boolean;
function Is_Special (Item : Character) return Boolean;
function Is_Line_Terminator (Item : Character) return Boolean;
function Is_Mark (Item : Character) return Boolean;
function Is_Other_Format (Item : Character) return Boolean;
function Is_Punctuation_Connector (Item : Character) return Boolean;
function Is_Space (Item : Character) return Boolean;
function Is_NFKC (Item : Character) return Boolean;
---------------------------------------------------
-- Conversion Functions for Character and String --
---------------------------------------------------
function To_Lower (Item : Character) return Character;
function To_Upper (Item : Character) return Character;
function To_Basic (Item : Character) return Character;
function To_Lower (Item : String) return String;
function To_Upper (Item : String) return String;
function To_Basic (Item : String) return String;
----------------------------------------------------------------------
-- Classifications of and Conversions Between Character and ISO 646 --
----------------------------------------------------------------------
subtype ISO_646 is
Character range Character'Val (0) .. Character'Val (127);
function Is_ISO_646 (Item : Character) return Boolean;
function Is_ISO_646 (Item : String) return Boolean;
function To_ISO_646
(Item : Character;
Substitute : ISO_646 := ' ') return ISO_646;
function To_ISO_646
(Item : String;
Substitute : ISO_646 := ' ') return String;
------------------------------------------------------
-- Classifications of Wide_Character and Characters --
------------------------------------------------------
-- Ada 2005 AI 395: these functions are moved to Ada.Characters.Conversions
-- and are considered obsolete in Ada.Characters.Handling. However we do
-- not complain about this obsolescence, since in practice it is necessary
-- to use these routines when creating code that is intended to run in
-- either Ada 95 or Ada 2005 mode.
-- We do however have to flag these if the pragma No_Obsolescent_Features
-- restriction is active (see Restrict.Check_Obsolescent_2005_Entity).
function Is_Character (Item : Wide_Character) return Boolean;
function Is_String (Item : Wide_String) return Boolean;
------------------------------------------------------
-- Conversions between Wide_Character and Character --
------------------------------------------------------
-- Ada 2005 AI 395: these functions are moved to Ada.Characters.Conversions
-- and are considered obsolete in Ada.Characters.Handling. However we do
-- not complain about this obsolescence, since in practice it is necessary
-- to use these routines when creating code that is intended to run in
-- either Ada 95 or Ada 2005 mode.
-- We do however have to flag these if the pragma No_Obsolescent_Features
-- restriction is active (see Restrict.Check_Obsolescent_2005_Entity).
function To_Character
(Item : Wide_Character;
Substitute : Character := ' ') return Character;
function To_String
(Item : Wide_String;
Substitute : Character := ' ') return String;
function To_Wide_Character
(Item : Character) return Wide_Character;
function To_Wide_String
(Item : String) return Wide_String;
private
pragma Inline (Is_Alphanumeric);
pragma Inline (Is_Basic);
pragma Inline (Is_Character);
pragma Inline (Is_Control);
pragma Inline (Is_Digit);
pragma Inline (Is_Graphic);
pragma Inline (Is_Hexadecimal_Digit);
pragma Inline (Is_ISO_646);
pragma Inline (Is_Letter);
pragma Inline (Is_Line_Terminator);
pragma Inline (Is_Lower);
pragma Inline (Is_Mark);
pragma Inline (Is_Other_Format);
pragma Inline (Is_Punctuation_Connector);
pragma Inline (Is_Space);
pragma Inline (Is_Special);
pragma Inline (Is_Upper);
pragma Inline (To_Basic);
pragma Inline (To_Character);
pragma Inline (To_Lower);
pragma Inline (To_Upper);
pragma Inline (To_Wide_Character);
end Ada.Characters.Handling;
| 49.099379 | 79 | 0.540797 |
13db6d15e24869f751d96aebea517c06033541ef | 2,658 | ads | Ada | src/helios-tools-files.ads | stcarrez/helios | 770055d87eaaa70a29a8a39190ecc8aa4e31b5be | [
"Apache-2.0"
] | 1 | 2020-09-04T18:34:08.000Z | 2020-09-04T18:34:08.000Z | src/helios-tools-files.ads | stcarrez/helios | 770055d87eaaa70a29a8a39190ecc8aa4e31b5be | [
"Apache-2.0"
] | null | null | null | src/helios-tools-files.ads | stcarrez/helios | 770055d87eaaa70a29a8a39190ecc8aa4e31b5be | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- helios-tools-files -- File parsing utilities for Helios
-- Copyright (C) 2017 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.Text_IO;
with Ada.Finalization;
package Helios.Tools.Files is
subtype Position_Type is Natural range 0 .. 65535;
type Uint64_Array is array (Positive range <>) of Uint64;
type Position_Array is array (Positive range <>) of Position_Type;
type File_Extractor (Length : Position_Type := 1024;
Count : Natural := 64) is limited
new Ada.Finalization.Limited_Controlled with record
File : Ada.Text_IO.File_Type;
Is_Opened : Boolean := False;
Current_Len : Natural := 0;
Field_Count : Natural := 0;
Name_Pos : Natural := 1;
Line : String (1 .. Length);
Field_Start : Position_Array (1 .. Count);
Field_End : Position_Array (1 .. Count);
Values : Uint64_Array (1 .. Count);
end record;
-- Open the file and prepare for the extraction.
procedure Open (File : in out File_Extractor;
Path : in String);
-- Returns True if we are at end of the file.
function Is_Eof (File : in File_Extractor) return Boolean;
-- Returns true if the line named field matches the given name.
function Is_Field (File : in File_Extractor;
Name : in String) return Boolean;
-- Get the value of the field at the given position.
function Get_Value (File : in File_Extractor;
Pos : in Positive) return Uint64;
-- Get the value of the field at the given position.
function Get_Value (File : in File_Extractor;
Pos : in Positive) return String;
-- Read one line and prepare for extraction.
procedure Read (File : in out File_Extractor);
-- Close the file.
overriding
procedure Finalize (File : in out File_Extractor);
end Helios.Tools.Files;
| 38.521739 | 76 | 0.629797 |
13e973ede11aa1fdf021edd27cd422cce6f06b9d | 615 | ads | Ada | 3-mid/physics/implement/bullet/source/thin/bullet_c-pointer_pointers.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 3-mid/physics/implement/bullet/source/thin/bullet_c-pointer_pointers.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 3-mid/physics/implement/bullet/source/thin/bullet_c-pointer_pointers.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do *not* modify by hand.
--
with bullet_c.Pointers;
package bullet_c.pointer_Pointers
is
-- Shape_Pointer_Pointer
--
type Shape_Pointer_Pointer is access all bullet_c.Pointers.Shape_Pointer;
-- Object_Pointer_Pointer
--
type Object_Pointer_Pointer is access all bullet_c.Pointers.Object_Pointer;
-- Joint_Pointer_Pointer
--
type Joint_Pointer_Pointer is access all bullet_c.Pointers.Joint_Pointer;
-- Space_Pointer_Pointer
--
type Space_Pointer_Pointer is access all bullet_c.Pointers.Space_Pointer;
end bullet_c.pointer_Pointers;
| 24.6 | 78 | 0.772358 |
04ea4e7836fc34a8d0281ac8a4fc7da230b37b75 | 2,602 | adb | Ada | sources/jupyter/jupyter-start_kernel-io_pubs.adb | reznikmm/jupyter | 159f8ae87a3da8bf66e059db07b23de826d81293 | [
"MIT"
] | 4 | 2020-06-17T16:45:16.000Z | 2022-01-19T22:55:48.000Z | sources/jupyter/jupyter-start_kernel-io_pubs.adb | reznikmm/jupyter | 159f8ae87a3da8bf66e059db07b23de826d81293 | [
"MIT"
] | null | null | null | sources/jupyter/jupyter-start_kernel-io_pubs.adb | reznikmm/jupyter | 159f8ae87a3da8bf66e059db07b23de826d81293 | [
"MIT"
] | null | null | null | -- SPDX-FileCopyrightText: 2020 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
----------------------------------------------------------------
separate (Jupyter.Start_Kernel)
package body IO_Pubs is
------------
-- Stream --
------------
overriding procedure Stream
(Self : in out IO_Pub;
Name : League.Strings.Universal_String;
Text : League.Strings.Universal_String)
is
Content : League.JSON.Objects.JSON_Object;
begin
Content.Insert
(+"name",
League.JSON.Values.To_JSON_Value (Name));
Content.Insert
(+"text",
League.JSON.Values.To_JSON_Value (Text));
Send_Message
(Self.Up.IOPub,
Self.Up.Msg_Id,
-(+"stream"),
Self.Up.Key,
"stream",
Self.Request,
Content);
end Stream;
overriding procedure Display_Data
(Self : in out IO_Pub;
Data : League.JSON.Objects.JSON_Object;
Metadata : League.JSON.Objects.JSON_Object;
Transient : League.JSON.Objects.JSON_Object) is null;
overriding procedure Update_Display_Data
(Self : in out IO_Pub;
Data : League.JSON.Objects.JSON_Object;
Metadata : League.JSON.Objects.JSON_Object;
Transient : League.JSON.Objects.JSON_Object) is null;
--------------------
-- Execute_Result --
--------------------
overriding procedure Execute_Result
(Self : in out IO_Pub;
Data : League.JSON.Objects.JSON_Object;
Metadata : League.JSON.Objects.JSON_Object;
Transient : League.JSON.Objects.JSON_Object)
is
Content : League.JSON.Objects.JSON_Object;
begin
Content.Insert
(+"execution_count",
League.JSON.Values.To_JSON_Value
(League.Holders.Universal_Integer (Self.Count)));
Content.Insert (+"data", Data.To_JSON_Value);
Content.Insert (+"metadata", Metadata.To_JSON_Value);
Content.Insert (+"transient", Transient.To_JSON_Value);
Send_Message
(Self.Up.IOPub,
Self.Up.Msg_Id,
-(+"execute_result"),
Self.Up.Key,
"execute_result",
Self.Request,
Content);
end Execute_Result;
overriding procedure Execute_Error
(Self : in out IO_Pub;
Value : Jupyter.Kernels.Execution_Error) is null;
overriding procedure Clear_Output
(Self : in out IO_Pub;
Wait : Boolean) is null;
overriding procedure Debug_Event
(Self : in out IO_Pub;
Content : League.JSON.Objects.JSON_Object) is null;
end IO_Pubs;
| 28.282609 | 64 | 0.598386 |
04247a05a6540e659dc8796eceeaa431a57835e4 | 1,144 | ads | Ada | examples/utils/sdl/sdl_sdl_error_h.ads | Fabien-Chouteau/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 13 | 2018-07-31T12:11:46.000Z | 2021-11-19T14:16:46.000Z | examples/utils/sdl/sdl_sdl_error_h.ads | gregkrsak/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 1 | 2018-10-22T21:41:59.000Z | 2018-10-22T21:41:59.000Z | examples/utils/sdl/sdl_sdl_error_h.ads | gregkrsak/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 4 | 2020-07-03T10:03:13.000Z | 2022-02-10T03:35:07.000Z | pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Strings;
package SDL_SDL_error_h is
-- arg-macro: procedure SDL_OutOfMemory ()
-- SDL_Error(SDL_ENOMEM)
-- arg-macro: procedure SDL_Unsupported ()
-- SDL_Error(SDL_UNSUPPORTED)
procedure SDL_SetError (fmt : Interfaces.C.Strings.chars_ptr -- , ...
); -- ../include/SDL/SDL_error.h:43
pragma Import (C, SDL_SetError, "SDL_SetError");
function SDL_GetError return Interfaces.C.Strings.chars_ptr; -- ../include/SDL/SDL_error.h:44
pragma Import (C, SDL_GetError, "SDL_GetError");
procedure SDL_ClearError; -- ../include/SDL/SDL_error.h:45
pragma Import (C, SDL_ClearError, "SDL_ClearError");
type SDL_errorcode is
(SDL_ENOMEM,
SDL_EFREAD,
SDL_EFWRITE,
SDL_EFSEEK,
SDL_UNSUPPORTED,
SDL_LASTERROR);
pragma Convention (C, SDL_errorcode); -- ../include/SDL/SDL_error.h:62
procedure SDL_Error (code : SDL_errorcode); -- ../include/SDL/SDL_error.h:63
pragma Import (C, SDL_Error, "SDL_Error");
end SDL_SDL_error_h;
| 31.777778 | 98 | 0.673951 |
2eaa296e2537f69175c75a8923379ee0445efe86 | 4,253 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2201n.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/ce2201n.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce2201n.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE2201N.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, WRITE, AND END_OF_FILE ARE SUPPORTED FOR
-- SEQUENTIAL FILES WITH ELEMENT_TYPE CONSTRAINED RECORD TYPES.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- SEQUENTIAL FILES WITH ELEMENT_TYPE CONSTRAINED RECORD TYPES.
-- HISTORY:
-- ABW 08/17/82
-- SPS 09/15/82
-- SPS 11/09/82
-- JBG 05/02/83
-- EG 05/08/85
-- TBN 11/04/86 REVISED TEST TO OUTPUT A NOT_APPLICABLE
-- RESULT WHEN FILES ARE NOT SUPPORTED.
-- JLH 07/28/87 REMOVED THE DEPENDENCE OF RESET BEING SUPPORTED
-- AND CREATED EXTERNAL FILES RATHER THAN TEMPORARY
-- FILES.
WITH REPORT;
USE REPORT;
WITH SEQUENTIAL_IO;
PROCEDURE CE2201N IS
BEGIN
TEST ("CE2201N", "CHECK THAT READ, WRITE, AND " &
"END_OF_FILE ARE SUPPORTED FOR " &
"SEQUENTIAL FILES - CONSTRAINED RECORDS");
DECLARE
TYPE REC_DEF (DISCR : INTEGER := 18) IS
RECORD
ONE : INTEGER := 1;
TWO : INTEGER := 2;
THREE : INTEGER := 17;
FOUR : INTEGER := 2;
END RECORD;
SUBTYPE REC_DEF_2 IS REC_DEF(2);
PACKAGE SEQ_REC_DEF IS NEW SEQUENTIAL_IO (REC_DEF_2);
USE SEQ_REC_DEF;
FILE_REC_DEF : FILE_TYPE;
INCOMPLETE : EXCEPTION;
REC3 : REC_DEF(2);
ITEM_REC3 : REC_DEF(2);
BEGIN
BEGIN
CREATE (FILE_REC_DEF, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR | NAME_ERROR =>
NOT_APPLICABLE ("CREATE OF SEQUENTIAL FILE WITH " &
"MODE OUT_FILE NOT SUPPORTED");
RAISE INCOMPLETE;
END;
WRITE (FILE_REC_DEF, REC3);
CLOSE (FILE_REC_DEF);
BEGIN
OPEN (FILE_REC_DEF, IN_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("OPEN OF SEQUENTIAL FILE WITH " &
"MODE IN_FILE NOT SUPPORTED");
RAISE INCOMPLETE;
END;
IF END_OF_FILE (FILE_REC_DEF) THEN
FAILED ("WRONG END_OF_FILE VALUE FOR RECORD" &
"WITH DEFAULT");
END IF;
READ (FILE_REC_DEF, ITEM_REC3);
IF ITEM_REC3 /= (2, IDENT_INT(1),2,17,2) THEN
FAILED ("READ WRONG VALUE - RECORD WITH DEFAULT");
END IF;
IF NOT END_OF_FILE (FILE_REC_DEF) THEN
FAILED ("END OF FILE NOT TRUE - RECORD WITH DEFAULT");
END IF;
BEGIN
DELETE (FILE_REC_DEF);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
EXCEPTION
WHEN INCOMPLETE =>
NULL;
END;
RESULT;
END CE2201N;
| 34.298387 | 79 | 0.566659 |
13c030842cf2c3dd18abe07110ea5df3c03c776f | 1,714 | ads | Ada | src/projectile.ads | thomas070605/shoot-n-loot | e242d71e9fe94271fe7fd79573ab06d231564350 | [
"MIT"
] | null | null | null | src/projectile.ads | thomas070605/shoot-n-loot | e242d71e9fe94271fe7fd79573ab06d231564350 | [
"MIT"
] | null | null | null | src/projectile.ads | thomas070605/shoot-n-loot | e242d71e9fe94271fe7fd79573ab06d231564350 | [
"MIT"
] | null | null | null | -- Shoot'n'loot
-- Copyright (c) 2020 Fabien Chouteau
with GESTE;
with GESTE.Sprite;
with GESTE.Tile_Bank;
with GESTE.Maths_Types;
with GESTE.Physics;
with GESTE_Config;
package Projectile is
type Instance
(Bank : not null GESTE.Tile_Bank.Const_Ref;
Init_Frame : GESTE_Config.Tile_Index)
is tagged limited
private;
subtype Class is Instance'Class;
type Ref is access all Class;
procedure Init (This : in out Instance);
function Alive (This : Instance) return Boolean;
procedure Spawn (This : in out Instance;
Pos : GESTE.Maths_Types.Point;
Time_To_Live : GESTE.Maths_Types.Value;
Priority : GESTE.Layer_Priority)
with Post => This.Alive;
procedure Remove (This : in out Instance);
procedure Set_Sprite (This : in out Instance;
Id : GESTE_Config.Tile_Index);
function Position (This : Instance) return GESTE.Pix_Point;
procedure Set_Speed (This : in out Instance;
S : GESTE.Maths_Types.Point);
procedure Update (This : in out Instance;
Elapsed : GESTE.Maths_Types.Value);
private
type Instance
(Bank : not null GESTE.Tile_Bank.Const_Ref;
Init_Frame : GESTE_Config.Tile_Index)
is tagged limited
record
Obj : GESTE.Physics.Object;
Sprite : aliased GESTE.Sprite.Instance (Bank, Init_Frame);
Speed : GESTE.Maths_Types.Point;
Time_To_Live : GESTE.Maths_Types.Value := 0.0;
Is_Alive : Boolean := False;
end record;
end Projectile;
| 28.566667 | 74 | 0.603267 |
2ed878c5bf8799057cd173788d3cbed3b53a9aa1 | 8,166 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd2a22e.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/cd/cd2a22e.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd2a22e.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CD2A22E.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT IF A SIZE CLAUSE SPECIFYING THE SMALLEST SIZE
-- APPROPRIATE FOR AN UNSIGNED REPRESENTATION IS GIVEN FOR AN
-- ENUMERATION TYPE, THEN OPERATIONS ON VALUES OF SUCH A TYPE
-- ARE NOT AFFECTED BY THE REPRESENTATION CLAUSE.
-- HISTORY:
-- JET 08/12/87 CREATED ORIGINAL TEST.
-- PWB 05/11/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA'.
-- JRL 03/27/92 ELIMINATED REDUNDANT TESTING.
WITH REPORT; USE REPORT;
PROCEDURE CD2A22E IS
BASIC_SIZE : CONSTANT := 2;
TYPE CHECK_TYPE IS (ZERO, ONE, TWO);
FOR CHECK_TYPE'SIZE USE BASIC_SIZE;
C0 : CHECK_TYPE := ZERO;
C1 : CHECK_TYPE := ONE;
C2 : CHECK_TYPE := TWO;
TYPE ARRAY_TYPE IS ARRAY (0 .. 2) OF CHECK_TYPE;
CHARRAY : ARRAY_TYPE := (ZERO, ONE, TWO);
TYPE REC_TYPE IS RECORD
COMP0 : CHECK_TYPE := ZERO;
COMP1 : CHECK_TYPE := ONE;
COMP2 : CHECK_TYPE := TWO;
END RECORD;
CHREC : REC_TYPE;
FUNCTION IDENT (CH : CHECK_TYPE) RETURN CHECK_TYPE IS
BEGIN
IF EQUAL (3, 3) THEN
RETURN CH;
ELSE
RETURN ONE;
END IF;
END IDENT;
PROCEDURE PROC (CI0, CI2 : CHECK_TYPE;
CIO1, CIO2 : IN OUT CHECK_TYPE;
CO2 : OUT CHECK_TYPE) IS
BEGIN
IF CIO1'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR CIO1'SIZE");
END IF;
IF NOT ((IDENT (CIO1) IN CIO1 .. CIO2) AND
(CI0 NOT IN IDENT (ONE) .. CIO2)) THEN
FAILED ("INCORRECT RESULTS FOR MEMBERSHIP OPERATORS " &
"- 1");
END IF;
IF CHECK_TYPE'VAL (0) /= IDENT (CI0) OR
CHECK_TYPE'VAL (1) /= IDENT (CIO1) OR
CHECK_TYPE'VAL (2) /= IDENT (CIO2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'VAL - 1");
END IF;
IF CHECK_TYPE'PRED (CIO1) /= IDENT (CI0) OR
CHECK_TYPE'PRED (CIO2) /= IDENT (CIO1) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'PRED - 1");
END IF;
IF CHECK_TYPE'VALUE ("ZERO") /= IDENT (CI0) OR
CHECK_TYPE'VALUE ("ONE") /= IDENT (CIO1) OR
CHECK_TYPE'VALUE ("TWO") /= IDENT (CIO2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'VALUE - 1");
END IF;
CO2 := TWO;
END PROC;
BEGIN
TEST ("CD2A22E", "CHECK THAT IF A SIZE CLAUSE " &
"SPECIFYING THE SMALLEST SIZE APPROPRIATE " &
"FOR AN UNSIGNED REPRESENTATION IS GIVEN " &
"FOR AN ENUMERATION TYPE, THEN OPERATIONS " &
"ON VALUES OF SUCH A TYPE ARE NOT AFFECTED " &
"BY THE REPRESENTATION CLAUSE");
PROC (ZERO, TWO, C1, C2, C2);
IF CHECK_TYPE'SIZE /= IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'SIZE");
END IF;
IF C0'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR C0'SIZE");
END IF;
IF NOT ((C0 < IDENT (ONE)) AND(IDENT (C2) > IDENT (C1)) AND
(C1 <= IDENT (ONE)) AND(IDENT (TWO) = C2)) THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL OPERATORS - 2");
END IF;
IF CHECK_TYPE'LAST /= IDENT (TWO) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'LAST - 2");
END IF;
IF CHECK_TYPE'POS (C0) /= IDENT_INT (0) OR
CHECK_TYPE'POS (C1) /= IDENT_INT (1) OR
CHECK_TYPE'POS (C2) /= IDENT_INT (2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'POS - 2");
END IF;
IF CHECK_TYPE'SUCC (C0) /= IDENT (C1) OR
CHECK_TYPE'SUCC (C1) /= IDENT (C2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'SUCC - 2");
END IF;
IF CHECK_TYPE'IMAGE (C0) /= IDENT_STR ("ZERO") OR
CHECK_TYPE'IMAGE (C1) /= IDENT_STR ("ONE") OR
CHECK_TYPE'IMAGE (C2) /= IDENT_STR ("TWO") THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'IMAGE - 2");
END IF;
IF CHARRAY(1)'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR CHARRAY(1)'SIZE");
END IF;
IF NOT ((CHARRAY (0) < IDENT (ONE)) AND
(IDENT (CHARRAY (2)) > IDENT (CHARRAY (1))) AND
(CHARRAY (1) <= IDENT (ONE)) AND
(IDENT (TWO) = CHARRAY (2))) THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL OPERATORS - 3");
END IF;
IF NOT ((IDENT (CHARRAY (1)) IN CHARRAY (1) .. CHARRAY (2)) AND
(CHARRAY (0) NOT IN IDENT (ONE) .. CHARRAY (2))) THEN
FAILED ("INCORRECT RESULTS FOR MEMBERSHIP OPERATORS - 3");
END IF;
IF CHECK_TYPE'VAL (0) /= IDENT (CHARRAY (0)) OR
CHECK_TYPE'VAL (1) /= IDENT (CHARRAY (1)) OR
CHECK_TYPE'VAL (2) /= IDENT (CHARRAY (2)) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'VAL - 3");
END IF;
IF CHECK_TYPE'PRED (CHARRAY (1)) /= IDENT (CHARRAY (0)) OR
CHECK_TYPE'PRED (CHARRAY (2)) /= IDENT (CHARRAY (1)) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'PRED - 3");
END IF;
IF CHECK_TYPE'VALUE ("ZERO") /= IDENT (CHARRAY (0)) OR
CHECK_TYPE'VALUE ("ONE") /= IDENT (CHARRAY (1)) OR
CHECK_TYPE'VALUE ("TWO") /= IDENT (CHARRAY (2)) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'VALUE - 3");
END IF;
IF CHREC.COMP2'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR CHREC.COMP2'SIZE");
END IF;
IF NOT ((CHREC.COMP0 < IDENT (ONE)) AND
(IDENT (CHREC.COMP2) > IDENT (CHREC.COMP1)) AND
(CHREC.COMP1 <= IDENT (ONE)) AND
(IDENT (TWO) = CHREC.COMP2)) THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL OPERATORS - 4");
END IF;
IF NOT ((IDENT (CHREC.COMP1) IN CHREC.COMP1 .. CHREC.COMP2) AND
(CHREC.COMP0 NOT IN IDENT (ONE) .. CHREC.COMP2)) THEN
FAILED ("INCORRECT RESULTS FOR MEMBERSHIP OPERATORS - 4");
END IF;
IF CHECK_TYPE'POS (CHREC.COMP0) /= IDENT_INT (0) OR
CHECK_TYPE'POS (CHREC.COMP1) /= IDENT_INT (1) OR
CHECK_TYPE'POS (CHREC.COMP2) /= IDENT_INT (2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'POS - 4");
END IF;
IF CHECK_TYPE'SUCC (CHREC.COMP0) /= IDENT (CHREC.COMP1) OR
CHECK_TYPE'SUCC (CHREC.COMP1) /= IDENT (CHREC.COMP2) THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'SUCC - 4");
END IF;
IF CHECK_TYPE'IMAGE (CHREC.COMP0) /= IDENT_STR ("ZERO") OR
CHECK_TYPE'IMAGE (CHREC.COMP1) /= IDENT_STR ("ONE") OR
CHECK_TYPE'IMAGE (CHREC.COMP2) /= IDENT_STR ("TWO") THEN
FAILED ("INCORRECT VALUE FOR CHECK_TYPE'IMAGE - 4");
END IF;
RESULT;
END CD2A22E;
| 37.631336 | 79 | 0.571149 |
ad8814161583b96f5403784ca1517d7e5e4f15a3 | 5,162 | ads | Ada | source/amf/uml/amf-uml-template_bindings-collections.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-template_bindings-collections.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-template_bindings-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 © 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.Generic_Collections;
package AMF.UML.Template_Bindings.Collections is
pragma Preelaborate;
package UML_Template_Binding_Collections is
new AMF.Generic_Collections
(UML_Template_Binding,
UML_Template_Binding_Access);
type Set_Of_UML_Template_Binding is
new UML_Template_Binding_Collections.Set with null record;
Empty_Set_Of_UML_Template_Binding : constant Set_Of_UML_Template_Binding;
type Ordered_Set_Of_UML_Template_Binding is
new UML_Template_Binding_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UML_Template_Binding : constant Ordered_Set_Of_UML_Template_Binding;
type Bag_Of_UML_Template_Binding is
new UML_Template_Binding_Collections.Bag with null record;
Empty_Bag_Of_UML_Template_Binding : constant Bag_Of_UML_Template_Binding;
type Sequence_Of_UML_Template_Binding is
new UML_Template_Binding_Collections.Sequence with null record;
Empty_Sequence_Of_UML_Template_Binding : constant Sequence_Of_UML_Template_Binding;
private
Empty_Set_Of_UML_Template_Binding : constant Set_Of_UML_Template_Binding
:= (UML_Template_Binding_Collections.Set with null record);
Empty_Ordered_Set_Of_UML_Template_Binding : constant Ordered_Set_Of_UML_Template_Binding
:= (UML_Template_Binding_Collections.Ordered_Set with null record);
Empty_Bag_Of_UML_Template_Binding : constant Bag_Of_UML_Template_Binding
:= (UML_Template_Binding_Collections.Bag with null record);
Empty_Sequence_Of_UML_Template_Binding : constant Sequence_Of_UML_Template_Binding
:= (UML_Template_Binding_Collections.Sequence with null record);
end AMF.UML.Template_Bindings.Collections;
| 56.108696 | 92 | 0.531383 |
04b23d6f7b8fb044da9c52a7f6e18df7a632ebe4 | 8,332 | adb | Ada | src/qweyboard/qweyboard-languages-parser.adb | kqr/qweyboard | d4e8b8cac8450d5dbb0ed69e78d8d71dcaec91da | [
"0BSD"
] | 33 | 2017-02-25T22:20:45.000Z | 2022-02-18T01:21:58.000Z | src/qweyboard/qweyboard-languages-parser.adb | kqr/qweyboard | d4e8b8cac8450d5dbb0ed69e78d8d71dcaec91da | [
"0BSD"
] | 1 | 2017-03-09T08:05:57.000Z | 2017-03-09T08:05:57.000Z | src/qweyboard/qweyboard-languages-parser.adb | kqr/qweyboard | d4e8b8cac8450d5dbb0ed69e78d8d71dcaec91da | [
"0BSD"
] | 2 | 2017-03-08T21:32:37.000Z | 2020-01-09T21:15:30.000Z | package body Qweyboard.Languages.Parser is
procedure Finalize (State : in out Lexer_State) is
begin
if IO.Is_Open (State.File) then
IO.Close (State.File);
end if;
end Finalize;
procedure Parse (File_Name : String) is
State : Lexer_State;
begin
IO.Open (State.File, IO.In_File, File_Name, "ENCODING=UTF8,WCEM=8");
begin
Language_Spec (State);
exception
when others =>
Log.Error
("[Languages.Parser] Caught exception when parsing " &
W (File_Name) & " on line " &
W (Positive'Image (State.Line_Number)));
IO.Close (State.File);
raise;
end;
IO.Close (State.File);
end Parse;
procedure Next_Token (State : in out Lexer_State) is
Symbol : Wide_Wide_Character;
Newline : Boolean;
procedure Enter_String_State (Terminator : Wide_Wide_Character) is
begin
State.Buffer := To_Unbounded ("");
State.In_String_State := True;
State.String_Terminator := Terminator;
end Enter_String_State;
procedure Exit_String_State is
String_Value : Unbounded_Wide_Wide_String := State.Buffer;
begin
if not State.In_String_State Then
raise Parse_Error
with "Trying to exit string state without being in it";
end if;
State.In_String_State := False;
State.Current_Token := (Token_String, String_Value);
end Exit_String_State;
begin
while not IO.End_Of_File (State.File) loop
IO.Look_Ahead (State.File, Symbol, Newline);
-- Ada.Text_IO.Put_Line ("Found symbol <" & Symbol & "> and newline? " & (if Newline then "yes" else "no"));
if Newline and State.In_String_State and State.String_Terminator = Characters.LF then
Exit_String_State;
return;
elsif Newline then
State.Line_Number := State.Line_Number + 1;
Advance (State);
elsif Symbol = ' ' then
-- Other kinds of whitespace needn't be covered here because
-- they're not considered "graphic" characters
raise Parse_Error with "Whitespace not allowed in definitions";
elsif Symbol = '.' and not State.In_String_State then
Enter_String_State (Characters.LF);
Advance (State);
State.Current_Token := (Variant => Token_Period);
return;
elsif Symbol = State.String_Terminator and State.In_String_State then
Exit_String_State;
return;
elsif Symbol = State.String_Terminator then
Enter_String_State (Characters.LF);
Advance (State);
State.Current_Token := (Variant => Token_Equals);
return;
elsif Wide_Wide_Character'Pos (Symbol) > 16#20# then
if not State.In_String_State then
Enter_String_State ('=');
end if;
State.Buffer := State.Buffer & Symbol;
Advance (State);
else
raise Unexpected_Symbol;
end if;
end loop;
if State.In_String_State then
Exit_String_State;
return;
end if;
State.Current_Token := (Variant => Token_End_Of_File);
end Next_Token;
procedure Language_Spec (State : in out Lexer_State) is
begin
Next_Token (State);
while State.Current_Token.Variant /= Token_End_Of_File loop
Section (State);
end loop;
end Language_Spec;
procedure Section (State : in out Lexer_State) is
Unused : Token_Type;
begin
Unused := Expecting (State, Token_Period);
Next_Token (State);
begin
Substitutions (State);
exception
when Parse_Error =>
Keys (State);
end;
end Section;
function New_Section (State : Lexer_State) return Boolean is
begin
return State.Current_Token.Variant = Token_Period;
end New_Section;
procedure Substitutions (State : in out Lexer_State) is
Position : Substitution_Type;
Pattern : Unbounded_Wide_Wide_String;
Replacement : Unbounded_Wide_Wide_String;
Unused : Token_Type;
begin
Position_Name (State, Position);
Next_Token (State);
loop
Substitution_Body (State, Pattern, Replacement);
Next_Token (State);
User_Language.Add_Substitution (Position, Pattern, Replacement);
if New_Section (State) then
exit;
end if;
end loop;
end Substitutions;
procedure Position_Name (State : in out Lexer_State; Position : out Substitution_Type) is
Position_Name : Token_Type;
begin
Position_Name := Expecting (State, Token_String);
if Position_Name.String_Value = "left" then
Position := Left;
elsif Position_Name.String_Value = "middle" then
Position := Middle;
elsif Position_Name.String_Value = "right" then
Position := Right;
else
raise Parse_Error with
"string """ & Conversions.To_String (From_Unbounded (Position_Name.String_Value), Substitute => '?') &
""" is not one of (left, middle, right)";
end if;
end Position_Name;
procedure Substitution_Body (State : in out Lexer_State; Pattern : out Unbounded_Wide_Wide_String; Replacement : out Unbounded_Wide_Wide_String) is
Unused : Token_Type;
begin
Graphic_String (State, Pattern);
Next_Token (State);
Unused := Expecting (State, Token_Equals);
Next_Token (State);
Graphic_String (State, Replacement);
end Substitution_Body;
procedure Graphic_String (State : in out Lexer_State; Out_String : out Unbounded_Wide_Wide_String) is
Token : constant Token_Type := Expecting (State, Token_String);
begin
Out_String := Token.String_Value;
end Graphic_String;
procedure Keys (State : in out Lexer_State) is
Modifier : Softkey;
Key : Softkey;
Symbol : Wide_Wide_Character;
Unused : Token_Type;
Next : Token_Type;
begin
Key_Name (State, Modifier);
Next_Token (State);
loop
Keys_Body (State, Key, Symbol);
Next_Token (State);
User_Language.Add_Key (Modifier, Key, Symbol);
if New_Section (State) then
exit;
end if;
end loop;
end Keys;
procedure Keys_Body (State : in out Lexer_State; Out_Key : out Softkey; Out_Character : out Wide_Wide_Character) is
Unused : Token_Type;
begin
Key_Name (State, Out_Key);
Next_Token (State);
Unused := Expecting (State, Token_Equals);
Next_Token (State);
Graphic_Character (State, Out_Character);
end Keys_Body;
procedure Key_Name (State : in out Lexer_State; Out_Key : out Softkey) is
Key_Name : constant Token_Type := Expecting (State, Token_String);
begin
Out_Key := Softkey'Value (Un_W (From_Unbounded (Key_Name.String_Value)));
end Key_Name;
procedure Graphic_Character (State : in out Lexer_State; Out_Character : out Wide_Wide_Character) is
Token : constant Token_Type := Expecting (State, Token_String);
begin
if Length (Token.String_Value) > 1 then
Out_Character := Element (Token.String_Value, 1);
return;
else
raise Parse_Error with
"string """ & Un_W (From_Unbounded (Token.String_Value)) &
""" does not represent a character";
end if;
end Graphic_Character;
function Expecting (State : Lexer_State; Variant : Token_Variant) return Token_Type is
begin
if State.Current_Token.Variant = Variant then
return State.Current_Token;
else
raise Parse_Error with
"wrong token type (expected " &
Token_Variant'Image (Variant) & ", got "
& Token_Variant'Image (State.Current_Token.Variant) & ")";
end if;
end Expecting;
procedure Advance (State : Lexer_State) is
Symbol : Wide_Wide_Character;
Newline : Boolean;
begin
IO.Look_Ahead (State.File, Symbol, Newline);
if Newline then
IO.Get_Immediate (State.File, Symbol);
else
IO.Get (State.File, Symbol);
end if;
end Advance;
end Qweyboard.Languages.Parser;
| 34.288066 | 150 | 0.62794 |
adea1839b1cec673c69c4f1f16f9fb29573798ac | 3,576 | adb | Ada | bb-runtimes/src/s-macres__rpi2.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/s-macres__rpi2.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/s-macres__rpi2.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- 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. --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Reset for Raspberry Pi 2
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
use Interfaces;
RSTC : Unsigned_32
with Address => 16#3F10_001c#, Volatile, Import;
WDOG : Unsigned_32
with Address => 16#3F10_0024#, Volatile, Import;
Password : constant Unsigned_32 := 16#5a00_0000#;
begin
-- Program the watchdog
WDOG := Password or 1;
RSTC := Password or 16#20#;
loop
null;
end loop;
end Os_Exit;
----------
-- Stop --
----------
procedure Stop is
begin
Os_Exit (0);
end Stop;
end System.Machine_Reset;
| 38.869565 | 78 | 0.436521 |
227f5c10a33e288bb70c06b7f4876a4b81c4a380 | 3,071 | adb | Ada | src/natools-file_streams.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-file_streams.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-file_streams.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- Copyright (c) 2015, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
package body Natools.File_Streams is
overriding procedure Finalize (Object : in out Autoclose) is
begin
if Stream_IO.Is_Open (Object.Backend) then
Stream_IO.Close (Object.Backend);
end if;
end Finalize;
not overriding function Form (File : in File_Stream) return String is
begin
return Stream_IO.Form (File.Internal.Backend);
end Form;
not overriding function Create
(Mode : in Stream_IO.File_Mode := Stream_IO.Out_File;
Name : in String := "";
Form : in String := "")
return File_Stream is
begin
return Result : File_Stream do
Stream_IO.Create (Result.Internal.Backend, Mode, Name, Form);
end return;
end Create;
not overriding function Mode (File : in File_Stream)
return Stream_IO.File_Mode is
begin
return Stream_IO.Mode (File.Internal.Backend);
end Mode;
not overriding function Name (File : in File_Stream) return String is
begin
return Stream_IO.Name (File.Internal.Backend);
end Name;
not overriding function Open
(Mode : in Stream_IO.File_Mode;
Name : in String;
Form : in String := "")
return File_Stream is
begin
return Result : File_Stream do
Stream_IO.Open (Result.Internal.Backend, Mode, Name, Form);
end return;
end Open;
overriding procedure Read
(Stream : in out File_Stream;
Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset)
is
pragma Unmodified (Stream);
begin
Stream_IO.Read (Stream.Internal.Backend, Item, Last);
end Read;
overriding procedure Write
(Stream : in out File_Stream;
Item : in Ada.Streams.Stream_Element_Array)
is
pragma Unmodified (Stream);
begin
Stream_IO.Write (Stream.Internal.Backend, Item);
end Write;
end Natools.File_Streams;
| 33.747253 | 78 | 0.604038 |
4113395fbaf9016b86bcb469f5b909d2647b49f2 | 6,149 | ads | Ada | tools-src/gnu/gcc/gcc/ada/sem_case.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/sem_case.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/sem_case.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ C A S E --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1996-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Types; use Types;
-- Package containing all the routines to process a list of discrete choices.
-- Such lists can occur in 3 different constructs: case statements, array
-- aggregates and record variants. We have factorized what used to be 3 very
-- similar sets of routines here. If you didn't figure it out already Choi
-- in the package name stands for Choices.
package Sem_Case is
type Choice_Bounds is record
Lo : Node_Id;
Hi : Node_Id;
Node : Node_Id;
end record;
type Choice_Table_Type is array (Pos range <>) of Choice_Bounds;
-- Table type used to sort the choices present in a case statement,
-- array aggregate or record variant.
procedure No_OP (C : Node_Id);
-- The no-operation routine. Does absolutely nothing. Can be used
-- in the following generic for the parameter Process_Empty_Choice.
generic
with function Get_Alternatives (N : Node_Id) return List_Id;
-- Function needed to get to the actual list of case statement
-- alternatives, or array aggregate component associations or
-- record variants from which we can then access the actual lists
-- of discrete choices. N is the node for the original construct
-- ie a case statement, an array aggregate or a record variant.
with function Get_Choices (A : Node_Id) return List_Id;
-- Given a case statement alternative, array aggregate component
-- association or record variant A we need different access functions
-- to get to the actual list of discrete choices.
with procedure Process_Empty_Choice (Choice : Node_Id);
-- Processing to carry out for an empty Choice.
with procedure Process_Non_Static_Choice (Choice : Node_Id);
-- Processing to carry out for a non static Choice.
with procedure Process_Associated_Node (A : Node_Id);
-- Associated to each case alternative, aggregate component
-- association or record variant A there is a node or list of nodes
-- that need semantic processing. This routine implements that
-- processing.
package Generic_Choices_Processing is
function Number_Of_Choices (N : Node_Id) return Nat;
-- Iterates through the choices of N, (N can be a case statement,
-- array aggregate or record variant), counting all the Choice nodes
-- except for the Others choice.
procedure Analyze_Choices
(N : Node_Id;
Subtyp : Entity_Id;
Choice_Table : in out Choice_Table_Type;
Last_Choice : out Nat;
Raises_CE : out Boolean;
Others_Present : out Boolean);
-- From a case statement, array aggregate or record variant N, this
-- routine analyzes the corresponding list of discrete choices.
-- Subtyp is the subtype of the discrete choices. The type against
-- which the discrete choices must be resolved is its base type.
--
-- On entry Choice_Table must be big enough to contain all the
-- discrete choices encountered.
--
-- On exit Choice_Table contains all the static and non empty
-- discrete choices in sorted order. Last_Choice gives the position
-- of the last valid choice in Choice_Table, Choice_Table'First
-- contains the first. We can have Last_Choice < Choice_Table'Last
-- for one (or several) of the following reasons:
--
-- (a) The list of choices contained a non static choice
--
-- (b) The list of choices contained an empty choice
-- (something like "1 .. 0 => ")
--
-- (c) One of the bounds of a discrete choice contains an
-- error or raises constraint error.
--
-- In one of the bounds of a discrete choice raises a constraint
-- error the flag Raise_CE is set.
--
-- Finally Others_Present is set to True if an Others choice is
-- present in the list of choices.
end Generic_Choices_Processing;
end Sem_Case;
| 49.99187 | 78 | 0.560416 |
228b445d6dcee97fca58652cd51cb6a8cecfeff9 | 9,851 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd2a32a.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/cd/cd2a32a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd2a32a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CD2A32A.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 WHEN A SIZE SPECIFICATION IS GIVEN FOR AN
-- INTEGER TYPE, THEN OPERATIONS ON VALUES OF SUCH A TYPE
-- WITH THE SMALLEST APPROPRIATE SIGNED SIZE ARE NOT
-- AFFECTED BY THE REPRESENTATION CLAUSE.
-- HISTORY:
-- JET 08/12/87 CREATED ORIGINAL TEST.
-- DHH 04/10/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA', CHANGED
-- SIZE CLAUSE VALUE TO 7, CHANGED OPERATOR ON 'SIZE
-- CHECKS AND ADDED REPRESENTAION CLAUSE CHECK.
-- RJW 03/28/90 REMOVED ERRONEOUS REFERENCES TO LENGTH_CHECK.
-- JRL 03/27/92 ELIMINATED REDUNDANT TESTING.
WITH REPORT; USE REPORT;
WITH LENGTH_CHECK; -- CONTAINS A CALL TO 'FAILED'.
PROCEDURE CD2A32A IS
BASIC_SIZE : CONSTANT := 7;
TYPE INT IS RANGE -63 .. 63;
FOR INT'SIZE USE BASIC_SIZE;
I1 : INT := -63;
I2 : INT := 0;
I3 : INT := 63;
TYPE ARRAY_TYPE IS ARRAY (INTEGER RANGE -1 .. 1) OF INT;
PRAGMA PACK (ARRAY_TYPE);
INTARRAY : ARRAY_TYPE := (-63, 0, 63);
TYPE REC_TYPE IS RECORD
COMPN : INT := -63;
COMPZ : INT := 0;
COMPP : INT := 63;
END RECORD;
PRAGMA PACK (REC_TYPE);
IREC : REC_TYPE;
FUNCTION IDENT (I : INT) RETURN INT IS
BEGIN
IF EQUAL (0,0) THEN
RETURN I;
ELSE
RETURN 0;
END IF;
END IDENT;
PROCEDURE CHECK_1 IS NEW LENGTH_CHECK (INT);
PROCEDURE PROC (PIN, PIP : INT;
PIOZ, PIOP : IN OUT INT;
POP : OUT INT) IS
BEGIN
IF PIN'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR PIN'SIZE");
END IF;
FOR P1 IN IDENT (PIN) .. IDENT (PIOP) LOOP
IF NOT (P1 IN PIN .. PIP) OR
(P1 NOT IN IDENT(-63) .. IDENT(63)) THEN
FAILED ("INCORRECT RESULTS FOR MEMBERSHIP " &
"OPERATORS - 1");
END IF;
END LOOP;
IF NOT ((+PIP = PIOP) AND
(-PIN = PIP) AND
(ABS PIN = PIOP)) THEN
FAILED ("INCORRECT RESULTS FOR UNARY ARITHMETIC " &
"OPERATORS - 1");
END IF;
IF INT'VAL (-63) /= IDENT (PIN) OR
INT'VAL (0) /= IDENT (PIOZ) OR
INT'VAL (63) /= IDENT (PIOP) THEN
FAILED ("INCORRECT VALUE FOR INT'VAL - 1");
END IF;
IF INT'PRED (PIOZ) /= IDENT (-1) OR
INT'PRED (PIP) /= IDENT (62) THEN
FAILED ("INCORRECT VALUE FOR INT'PRED - 1");
END IF;
IF INT'VALUE ("-63") /= IDENT (PIN) OR
INT'VALUE ("0") /= IDENT (PIOZ) OR
INT'VALUE ("63") /= IDENT (PIOP) THEN
FAILED ("INCORRECT VALUE FOR INT'VALUE - 1");
END IF;
POP := 63;
END PROC;
BEGIN
TEST ("CD2A32A", "CHECK THAT WHEN A SIZE SPECIFICATION IS " &
"GIVEN FOR AN INTEGER TYPE, THEN " &
"OPERATIONS ON VALUES OF SUCH A TYPE WITH " &
"THE SMALLEST APPROPRIATE SIGNED SIZE ARE " &
"NOT AFFECTED BY THE REPRESENTATION CLAUSE");
CHECK_1 (I1, 7, "INT");
PROC (-63, 63, I2, I3, I3);
IF INT'SIZE /= IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR INT'SIZE");
END IF;
IF I1'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR I1'SIZE");
END IF;
IF NOT ((I1 < IDENT (0)) AND
(IDENT (I3) > IDENT (I2)) AND
(I2 <= IDENT (0)) AND
(IDENT (63) = I3)) THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL OPERATORS - 2");
END IF;
IF NOT (((I1 + I3) = I2) AND
((I2 - I3) = I1) AND
((I3 * I2) = I2) AND
((I2 / I1) = I2) AND
((I1 ** 1) = I1) AND
((I1 REM 10) = IDENT (-3)) AND
((I3 MOD 10) = IDENT (3))) THEN
FAILED ("INCORRECT RESULTS FOR BINARY ARITHMETIC " &
"OPERATORS - 2");
END IF;
IF INT'FIRST /= IDENT (-63) THEN
FAILED ("INCORRECT VALUE FOR INT'FIRST - 2");
END IF;
IF INT'POS (I1) /= IDENT_INT (-63) OR
INT'POS (I2) /= IDENT_INT ( 0) OR
INT'POS (I3) /= IDENT_INT ( 63) THEN
FAILED ("INCORRECT VALUE FOR INT'POS - 2");
END IF;
IF INT'SUCC (I1) /= IDENT (-62) OR
INT'SUCC (I2) /= IDENT (1) THEN
FAILED ("INCORRECT VALUE FOR INT'SUCC - 2");
END IF;
IF INT'IMAGE (I1) /= IDENT_STR ("-63") OR
INT'IMAGE (I2) /= IDENT_STR (" 0") OR
INT'IMAGE (I3) /= IDENT_STR (" 63") THEN
FAILED ("INCORRECT VALUE FOR INT'IMAGE - 2");
END IF;
IF INTARRAY(0)'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR INTARRAY(0)'SIZE");
END IF;
IF NOT ((INTARRAY(-1) < IDENT (0)) AND
(IDENT (INTARRAY (1)) > IDENT (INTARRAY(0))) AND
(INTARRAY(0) <= IDENT (0)) AND
(IDENT (63) = INTARRAY (1))) THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL OPERATORS - 3");
END IF;
FOR I IN IDENT (INTARRAY(-1)) .. IDENT (INTARRAY(1)) LOOP
IF NOT (I IN INTARRAY(-1) .. INTARRAY(1)) OR
(I NOT IN IDENT(-63) .. IDENT(63)) THEN
FAILED ("INCORRECT RESULTS FOR MEMBERSHIP " &
"OPERATORS - 3");
END IF;
END LOOP;
IF NOT ((+INTARRAY(-1) = INTARRAY(-1)) AND
(-INTARRAY( 1) = INTARRAY(-1)) AND
(ABS INTARRAY(-1) = INTARRAY(1))) THEN
FAILED ("INCORRECT RESULTS FOR UNARY ARITHMETIC " &
"OPERATORS - 3");
END IF;
IF INT'VAL (-63) /= IDENT (INTARRAY (-1)) OR
INT'VAL ( 0) /= IDENT (INTARRAY ( 0)) OR
INT'VAL ( 63) /= IDENT (INTARRAY ( 1)) THEN
FAILED ("INCORRECT VALUE FOR INT'VAL - 3");
END IF;
IF INT'PRED (INTARRAY (0)) /= IDENT (-1) OR
INT'PRED (INTARRAY (1)) /= IDENT (62) THEN
FAILED ("INCORRECT VALUE FOR INT'PRED - 3");
END IF;
IF INT'VALUE ("-63") /= IDENT (INTARRAY (-1)) OR
INT'VALUE ("0") /= IDENT (INTARRAY ( 0)) OR
INT'VALUE ("63") /= IDENT (INTARRAY ( 1)) THEN
FAILED ("INCORRECT VALUE FOR INT'VALUE - 3");
END IF;
IF IREC.COMPP'SIZE < IDENT_INT (BASIC_SIZE) THEN
FAILED ("INCORRECT VALUE FOR IREC.COMPP'SIZE");
END IF;
IF NOT ((IREC.COMPN < IDENT (0)) AND
(IDENT (IREC.COMPP) > IDENT (IREC.COMPZ)) AND
(IREC.COMPZ <= IDENT (0)) AND
(IDENT (63) = IREC.COMPP)) THEN
FAILED ("INCORRECT RESULTS FOR RELATIONAL OPERATORS - 4");
END IF;
FOR I IN IDENT (IREC.COMPN) .. IDENT (IREC.COMPP) LOOP
IF NOT (I IN IREC.COMPN .. IREC.COMPP) OR
(I NOT IN IDENT(-63) .. IDENT(63)) THEN
FAILED ("INCORRECT RESULTS FOR MEMBERSHIP " &
"OPERATORS - 4");
END IF;
END LOOP;
IF NOT (((IREC.COMPN + IREC.COMPP) = IREC.COMPZ) AND
((IREC.COMPZ - IREC.COMPP) = IREC.COMPN) AND
((IREC.COMPP * IREC.COMPZ) = IREC.COMPZ) AND
((IREC.COMPZ / IREC.COMPN) = IREC.COMPZ) AND
((IREC.COMPN ** 1) = IREC.COMPN) AND
((IREC.COMPN REM 10) = IDENT (-3)) AND
((IREC.COMPP MOD 10) = IDENT ( 3))) THEN
FAILED ("INCORRECT RESULTS FOR BINARY ARITHMETIC " &
"OPERATORS - 4");
END IF;
IF INT'POS (IREC.COMPN) /= IDENT_INT (-63) OR
INT'POS (IREC.COMPZ) /= IDENT_INT ( 0) OR
INT'POS (IREC.COMPP) /= IDENT_INT ( 63) THEN
FAILED ("INCORRECT VALUE FOR INT'POS - 4");
END IF;
IF INT'SUCC (IREC.COMPN) /= IDENT (-62) OR
INT'SUCC (IREC.COMPZ) /= IDENT ( 1) THEN
FAILED ("INCORRECT VALUE FOR INT'SUCC - 4");
END IF;
IF INT'IMAGE (IREC.COMPN) /= IDENT_STR ("-63") OR
INT'IMAGE (IREC.COMPZ) /= IDENT_STR (" 0") OR
INT'IMAGE (IREC.COMPP) /= IDENT_STR (" 63") THEN
FAILED ("INCORRECT VALUE FOR INT'IMAGE - 4");
END IF;
RESULT;
END CD2A32A;
| 36.084249 | 79 | 0.511725 |
4b03ca9389287e75b41843215d22eb6f55cb51cb | 3,488 | ads | Ada | tools/scitools/conf/understand/ada/ada95/g-busora.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada95/g-busora.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada95/g-busora.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- G N A T . B U B B L E _ S O R T _ A --
-- --
-- S p e c --
-- --
-- $Revision: 2 $ --
-- --
-- Copyright (c) 1994 NYU, All Rights Reserved --
-- --
-- The GNAT library is free software; you can redistribute it and/or modify --
-- it under terms of the GNU Library General Public License as published by --
-- the Free Software Foundation; either version 2, or (at your option) any --
-- later version. The GNAT library is distributed in the hope that it will --
-- be useful, but WITHOUT ANY WARRANTY; without even the implied warranty --
-- of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- Library General Public License for more details. You should have --
-- received a copy of the GNU Library General Public License along with --
-- the GNAT library; see the file COPYING.LIB. If not, write to the Free --
-- Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. --
-- --
------------------------------------------------------------------------------
-- This package provides a bubblesort routine that works with access to
-- subprogram parameters, so that it can be used with different types with
-- shared sorting code (see also Gnat.Bubble_Sort_G, the generic version)
package Gnat.Bubble_Sort_A is
pragma Preelaborate (Bubble_Sort_A);
-- The data to be sorted is assumed to be indexed by integer values from
-- 1 to N, where N is the number of items to be sorted. In addition, the
-- index value zero is used for a temporary location used during the sort.
type Move_Procedure is access procedure (From : Natural; To : Natural);
-- A pointer to a procedure that moves the data item with index From to
-- the data item with index To. An index value of zero is used for moves
-- from and to the single temporary location used by the sort.
type Lt_Function is access function (Op1, Op2 : Natural) return Boolean;
-- A pointer to a function that compares two items and returns True if
-- the item with index Op1 is less than the item with index Op2, and False
-- if the Op2 item is greater than or equal to the Op1 item.
procedure Sort (N : Positive; Move : Move_Procedure; Lt : Lt_Function);
-- This procedures sorts items indexed from 1 to N into ascending order
-- making calls to Lt to do required comparisons, and Move to move items
-- around. Note that, as described above, both Move and Lt use a single
-- temporary location with index value zero. This sort is not stable,
-- i.e. the order of equal elements in the input is not preserved.
end Gnat.Bubble_Sort_A;
| 63.418182 | 78 | 0.518922 |
a16e88b0aa70ea7885fc29afc436db9640d123c7 | 870 | adb | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/char_param/foo.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/char_param/foo.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/char_param/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2007-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
First : Character := 'a';
begin
Procedure_Result := ' ';
Same (First); -- STOP
Next (First);
end Foo;
| 31.071429 | 73 | 0.711494 |
13983b69ce7adfeefca1d34dcf3778a29614b165 | 1,883 | adb | Ada | tests/auto_counters_suite.adb | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | 5 | 2016-02-22T10:29:26.000Z | 2021-12-18T08:20:12.000Z | tests/auto_counters_suite.adb | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | 1 | 2022-02-16T03:38:08.000Z | 2022-02-20T21:11:30.000Z | tests/auto_counters_suite.adb | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | null | null | null | -- Auto_Counters_Suite
-- Unit tests for Auto_Counters packages
-- Copyright (c) 2016, James Humphry - see LICENSE file for details
with Smart_Ptrs_Tests;
with Auto_Counters_Suite.Unique_Ptrs_Tests;
with Auto_Counters_Suite.C_Resources_Tests;
with Auto_Counters_Suite.Refcounted_Flyweights_Tests;
with Auto_Counters_Suite.Refcounted_KVFlyweights_Tests;
with Basic_Counters;
with Protected_Counters;
package body Auto_Counters_Suite is
use AUnit.Test_Suites;
package Basic_Smart_Ptrs_Tests is
new Smart_Ptrs_Tests(Counters => Basic_Counters.Basic_Counters_Spec,
Counter_Type_Name => "basic counters");
Test_Basic_Smart_Ptrs : aliased Basic_Smart_Ptrs_Tests.Smart_Ptrs_Test;
package Protected_Smart_Ptrs_Tests is
new Smart_Ptrs_Tests(Counters => Protected_Counters.Protected_Counters_Spec,
Counter_Type_Name => "protected counters");
Test_Protected_Smart_Ptrs : aliased Protected_Smart_Ptrs_Tests.Smart_Ptrs_Test;
Test_Unique_Ptrs : aliased Unique_Ptrs_Tests.Unique_Ptrs_Test;
Test_C_Resources : aliased C_Resources_Tests.C_Resource_Test;
Test_Refcounted_Flyweights : aliased Refcounted_Flyweights_Tests.Refcounted_Flyweights_Test;
Test_Refcounted_KVFlyweights : aliased Refcounted_KVFlyweights_Tests.Refcounted_KVFlyweights_Test;
Result : aliased Test_Suite;
function Suite return AUnit.Test_Suites.Access_Test_Suite is
begin
Add_Test (Result'Access, Test_Basic_Smart_Ptrs'Access);
Add_Test (Result'Access, Test_Protected_Smart_Ptrs'Access);
Add_Test (Result'Access, Test_Unique_Ptrs'Access);
Add_Test (Result'Access, Test_C_Resources'Access);
Add_Test (Result'Access, Test_Refcounted_Flyweights'Access);
Add_Test (Result'Access, Test_Refcounted_KVFlyweights'Access);
return Result'Access;
end Suite;
end Auto_Counters_Suite;
| 36.211538 | 101 | 0.795539 |
3d7531d0fc957b9051d6d723c29d5f9ae77162a4 | 1,076 | adb | Ada | examples/arinc653-threads/sample-ada/cpu/part1/main.adb | Ureir/pok | 1f9e357e3f66caf56354d186c5f96f296b158ba5 | [
"BSD-2-Clause"
] | null | null | null | examples/arinc653-threads/sample-ada/cpu/part1/main.adb | Ureir/pok | 1f9e357e3f66caf56354d186c5f96f296b158ba5 | [
"BSD-2-Clause"
] | null | null | null | examples/arinc653-threads/sample-ada/cpu/part1/main.adb | Ureir/pok | 1f9e357e3f66caf56354d186c5f96f296b158ba5 | [
"BSD-2-Clause"
] | null | null | null | -- POK header
--
-- The following file is a part of the POK project. Any modification should
-- be made according to the POK licence. You CANNOT use this file or a part
-- of a file for your own project.
--
-- For more information on the POK licence, please see our LICENCE FILE
--
-- Please follow the coding guidelines described in doc/CODING_GUIDELINES
--
-- Copyright (c) 2007-2022 POK team
package body Main is
procedure Printf (String : in Interfaces.C.char_array);
pragma Import (C, Printf, "printf");
procedure Compute is
begin
loop
Printf ("beep ");
end loop;
end Compute;
procedure Main is
Ret : Return_Code_Type;
Attr : Process_Attribute_Type;
Id : Process_Id_Type;
begin
Attr.Period := 1000;
Attr.Deadline := Soft;
Attr.Time_Capacity := 1;
Attr.Stack_Size := 4096;
Attr.Entry_Point := Compute'Address;
Create_Process (Attr, Id, Ret);
Set_Partition_Mode (Normal, Ret);
end Main;
end Main;
| 28.315789 | 75 | 0.625465 |
57b0ea546d8581dcff5f44cd278023d4cd6fe61c | 1,720 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_get_property_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_get_property_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_get_property_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_get_property_reply_t is
-- Item
--
type Item is record
response_type : aliased Interfaces.Unsigned_8;
format : aliased Interfaces.Unsigned_8;
sequence : aliased Interfaces.Unsigned_16;
length : aliased Interfaces.Unsigned_32;
the_type : aliased xcb.xcb_atom_t;
bytes_after : aliased Interfaces.Unsigned_32;
value_len : aliased Interfaces.Unsigned_32;
pad0 : aliased swig.int8_t_Array (0 .. 11);
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_get_property_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_get_property_reply_t.Item,
Element_Array => xcb.xcb_get_property_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_get_property_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_get_property_reply_t.Pointer,
Element_Array => xcb.xcb_get_property_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_get_property_reply_t;
| 29.152542 | 77 | 0.663372 |
04b4054a9c6aed5cad8957766e1fc4520f44466a | 3,336 | ads | Ada | components/src/io_expander/pcf8574/pcf8574.ads | RREE/Ada_Drivers_Library | 791616adf3c742de256e37717d3376393e6f407a | [
"BSD-3-Clause"
] | null | null | null | components/src/io_expander/pcf8574/pcf8574.ads | RREE/Ada_Drivers_Library | 791616adf3c742de256e37717d3376393e6f407a | [
"BSD-3-Clause"
] | null | null | null | components/src/io_expander/pcf8574/pcf8574.ads | RREE/Ada_Drivers_Library | 791616adf3c742de256e37717d3376393e6f407a | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2022, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with HAL; use HAL;
with HAL.I2C; use HAL.I2C;
-- I2C 8-bit IO expander with quasi bidirectional I/O, no data
-- direction, no latch
package PCF8574 is
subtype PCF8574_Address is I2C_Address range 16#40# .. 16#5F#;
type PCF8574_Module (Port : not null Any_I2C_Port;
Addr : I2C_Address) is tagged limited private;
type Any_PCF8574_Module is access all PCF8574_Module'Class;
procedure Set (This : PCF8574_Module; Data : UInt8);
function Get (This : PCF8574_Module) return UInt8;
procedure Get (This : PCF8574_Module; Data : out UInt8);
-- when reading the input from keys (buttons) carefully read the
-- datasheet. The input line should be set high before reading.
-- E.g. if all lines are key input:
-- M.Set (16#FF#);
-- Keys := M.Get;
private
type PCF8574_Module (Port : not null Any_I2C_Port;
Addr : I2C_Address) is tagged limited null record;
end PCF8574;
| 52.125 | 78 | 0.550659 |
136c2b2421cbebc534a863bccf54ff02fb0b99c2 | 3,869 | ads | Ada | source/amf/ocl/amf-ocl-collection_literal_parts.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/ocl/amf-ocl-collection_literal_parts.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/ocl/amf-ocl-collection_literal_parts.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-2013, 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.UML.Typed_Elements;
package AMF.OCL.Collection_Literal_Parts is
pragma Preelaborate;
type OCL_Collection_Literal_Part is limited interface
and AMF.UML.Typed_Elements.UML_Typed_Element;
type OCL_Collection_Literal_Part_Access is
access all OCL_Collection_Literal_Part'Class;
for OCL_Collection_Literal_Part_Access'Storage_Size use 0;
end AMF.OCL.Collection_Literal_Parts;
| 64.483333 | 78 | 0.430344 |
590a8158d3e8f285d0f1838e8f08004c084f2ff3 | 130 | ads | Ada | test_suite/aoc_suite.ads | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | 3 | 2020-12-26T23:44:33.000Z | 2021-12-06T16:00:54.000Z | test_suite/aoc_suite.ads | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | test_suite/aoc_suite.ads | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | with AUnit.Test_Suites; use AUnit.Test_Suites;
package AOC_Suite is
function Suite return Access_Test_Suite;
end AOC_Suite;
| 16.25 | 46 | 0.807692 |
2e3c5fa2be6ed4423c77ca3fcfc1630b8304ce03 | 68,741 | adb | Ada | honeybee_proj/HBG/.autopilot/db/honeybee.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | null | null | null | honeybee_proj/HBG/.autopilot/db/honeybee.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | null | null | null | honeybee_proj/HBG/.autopilot/db/honeybee.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/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>honeybee</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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p1.x</originalName>
<rtlName/>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p1.z</originalName>
<rtlName/>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p1.y</originalName>
<rtlName/>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p2.x</originalName>
<rtlName/>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p2.z</originalName>
<rtlName/>
<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/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p2.y</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>edge_p2_z_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>159</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>29</item>
<item>30</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>16</id>
<name>edge_p2_y_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>31</item>
<item>32</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>17</id>
<name>edge_p2_x_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>33</item>
<item>34</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>18</id>
<name>edge_p1_z_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>36</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>19</id>
<name>edge_p1_y_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>38</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<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>20</id>
<name>edge_p1_x_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>159</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>39</item>
<item>40</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>21</id>
<name>collisions_z</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>166</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>166</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions_z</originalName>
<rtlName>grp_checkAxis_2_fu_64</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</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>22</id>
<name>collisions_y</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>167</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>167</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions_y</originalName>
<rtlName>grp_checkAxis_0_fu_96</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>collisions_x</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>168</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>168</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions_x</originalName>
<rtlName>grp_checkAxis_1_fu_80</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>or_ln170</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>170</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>170</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>or_ln170_fu_112_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>65</item>
<item>66</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>10</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>collisions</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>170</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>170</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions</originalName>
<rtlName>ap_return</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>67</item>
<item>68</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>11</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>_ln171</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>171</lineNumber>
<contextFuncName>honeybee</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>honeybee</second>
</first>
<second>171</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>69</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>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_19">
<Value>
<Obj>
<type>2</type>
<id>41</id>
<name>checkAxis_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:checkAxis.2></content>
</item>
<item class_id_reference="16" object_id="_20">
<Value>
<Obj>
<type>2</type>
<id>49</id>
<name>checkAxis_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:checkAxis.0></content>
</item>
<item class_id_reference="16" object_id="_21">
<Value>
<Obj>
<type>2</type>
<id>57</id>
<name>checkAxis_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:checkAxis.1></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_22">
<Obj>
<type>3</type>
<id>27</id>
<name>honeybee</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>32</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_23">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_24">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_25">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_26">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_27">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_28">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_29">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_30">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_31">
<id>44</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="_32">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_33">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_34">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_35">
<id>48</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_36">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_37">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_38">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_39">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_40">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_41">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_42">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_43">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_44">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_45">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_46">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_47">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_48">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_49">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_50">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_51">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_52">
<id>67</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="_53">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_55">
<mId>1</mId>
<mTag>honeybee</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>27</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>218</mMinLatency>
<mMaxLatency>218</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_56">
<states class_id="25" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_57">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_58">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_59">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_60">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_61">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_62">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_63">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_64">
<id>21</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_65">
<id>22</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_66">
<id>23</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_67">
<id>2</id>
<operations>
<count>14</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_68">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_69">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_70">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_71">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_72">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_73">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_74">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_75">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_76">
<id>21</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_77">
<id>22</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_78">
<id>23</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_79">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_80">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_81">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_82">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>-1</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="34" tracking_level="1" version="0" object_id="_83">
<dp_component_resource class_id="35" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>grp_checkAxis_0_fu_96 (checkAxis_0)</first>
<second class_id="37" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>BRAM</first>
<second>0</second>
</item>
<item>
<first>DSP48E</first>
<second>17</second>
</item>
<item>
<first>FF</first>
<second>3406</second>
</item>
<item>
<first>LUT</first>
<second>8729</second>
</item>
<item>
<first>URAM</first>
<second>0</second>
</item>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80 (checkAxis_1)</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>BRAM</first>
<second>0</second>
</item>
<item>
<first>DSP48E</first>
<second>17</second>
</item>
<item>
<first>FF</first>
<second>3406</second>
</item>
<item>
<first>LUT</first>
<second>8729</second>
</item>
<item>
<first>URAM</first>
<second>0</second>
</item>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64 (checkAxis_2)</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>BRAM</first>
<second>0</second>
</item>
<item>
<first>DSP48E</first>
<second>17</second>
</item>
<item>
<first>FF</first>
<second>3406</second>
</item>
<item>
<first>LUT</first>
<second>8601</second>
</item>
<item>
<first>URAM</first>
<second>0</second>
</item>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>3</count>
<item_version>0</item_version>
<item>
<first>ap_block_state2_on_subcall_done ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_return ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>64</second>
</item>
<item>
<first>(1P1)</first>
<second>64</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>64</second>
</item>
</second>
</item>
<item>
<first>or_ln170_fu_112_p2 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>64</second>
</item>
<item>
<first>(1P1)</first>
<second>64</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>64</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>1</count>
<item_version>0</item_version>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>3</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>4</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>grp_checkAxis_0_fu_96_ap_start_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80_ap_start_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64_ap_start_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_dsp_resource>
<count>3</count>
<item_version>0</item_version>
<item>
<first>grp_checkAxis_0_fu_96</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
</dp_dsp_resource>
<dp_component_map class_id="39" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>grp_checkAxis_0_fu_96 (checkAxis_0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80 (checkAxis_1)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64 (checkAxis_2)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
</dp_component_map>
<dp_expression_map>
<count>2</count>
<item_version>0</item_version>
<item>
<first>ap_return ( or ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>or_ln170_fu_112_p2 ( or ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="41" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>15</first>
<second class_id="43" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="44" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>27</first>
<second class_id="46" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="47" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="48" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>34</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>64</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
</second>
</item>
<item>
<first>80</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>23</item>
</second>
</item>
<item>
<first>96</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>22</item>
<item>22</item>
</second>
</item>
<item>
<first>112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="51" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>collisions_fu_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>or_ln170_fu_112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>3</count>
<item_version>0</item_version>
<item>
<first>grp_checkAxis_0_fu_96</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>22</item>
<item>22</item>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>23</item>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>6</count>
<item_version>0</item_version>
<item>
<first>edge_p1_x_read_read_fu_58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>edge_p1_y_read_read_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>edge_p1_z_read_read_fu_46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>edge_p2_x_read_read_fu_40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>edge_p2_y_read_read_fu_34</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>edge_p2_z_read_read_fu_28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>1</count>
<item_version>0</item_version>
<item>
<first>ap_return</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
</return_ports>
<dp_mem_port_nodes class_id="53" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>6</count>
<item_version>0</item_version>
<item>
<first>124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>152</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>159</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>6</count>
<item_version>0</item_version>
<item>
<first>edge_p1_x_read_reg_159</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>edge_p1_y_read_reg_152</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>edge_p1_z_read_reg_145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>edge_p2_x_read_reg_138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>edge_p2_y_read_reg_131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>edge_p2_z_read_reg_124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="54" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>edge_p1_x</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p1_y</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p1_z</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p2_x</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p2_y</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p2_z</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="56" 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>
| 31.288575 | 79 | 0.463886 |
131851470290df15ddf7803abf1f14b9746d810b | 801 | ads | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/py_range/pck.ads | 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/py_range/pck.ads | 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/py_range/pck.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2007-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/>.
with System;
package Pck is
procedure Do_Nothing (A : System.Address);
end Pck;
| 34.826087 | 73 | 0.735331 |
0449c0c31832e3c8f50fd8646d27543f94f12dd5 | 403 | ada | Ada | Task/Metronome/Ada/metronome.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2021-05-05T13:42:20.000Z | 2021-05-05T13:42:20.000Z | Task/Metronome/Ada/metronome.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Metronome/Ada/metronome.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
--This package is for the delay.
with Ada.Calendar; use Ada.Calendar;
--This package adds sound
with Ada.Characters.Latin_1;
procedure Main is
begin
Put_Line ("Hello, this is 60 BPM");
loop
Ada.Text_IO.Put (Ada.Characters.Latin_1.BEL);
delay 0.9; --Delay in seconds. If you change to 0.0 the program will crash.
end loop;
end Main;
| 17.521739 | 82 | 0.687345 |
04ba0f4a34ea9ecad9ae3072a22a41f771dd928b | 3,709 | adb | Ada | testsuite/utils/src/compare_files.adb | ellamosi/Ada_BMP_Library | c1de8ce0127dd6b264a6e5abcd721a26bf005c3f | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | testsuite/utils/src/compare_files.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | testsuite/utils/src/compare_files.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Streams;
with Ada.Streams.Stream_IO;
with GNAT.MD5; use GNAT.MD5;
package body Compare_Files is
package Hash renames GNAT.MD5;
function Binnary_Equal (A_Path, B_Path : String) return Boolean is
function Compute_Hash (Path : String) return Message_Digest;
function Compute_Hash (Path : String) return Message_Digest
is
Context : aliased GNAT.MD5.Context := GNAT.MD5.Initial_Context;
File : Ada.Streams.Stream_IO.File_Type;
Buffer : Ada.Streams.Stream_Element_Array (1 .. 4096);
Last : Ada.Streams.Stream_Element_Offset;
use type Ada.Streams.Stream_Element_Offset;
begin
Ada.Streams.Stream_IO.Open (File,
Mode => Ada.Streams.Stream_IO.In_File,
Name => Path);
loop
Ada.Streams.Stream_IO.Read (File, Item => Buffer, Last => Last);
Hash.Update (Context, Buffer (1 .. Last));
Ada.Streams.Stream_IO.Read (File, Item => Buffer, Last => Last);
exit when Last < Buffer'Last;
end loop;
Ada.Streams.Stream_IO.Close (File);
return Hash.Digest (Context);
end Compute_Hash;
begin
return Compute_Hash (A_Path) = Compute_Hash (B_Path);
end Binnary_Equal;
end Compare_Files;
| 52.239437 | 78 | 0.544082 |
048f52cb060f37b9c5bf81f3fdbfe9239a14ba5e | 1,820 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_lookup_color_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_lookup_color_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_lookup_color_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 Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_lookup_color_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;
exact_red : aliased Interfaces.Unsigned_16;
exact_green : aliased Interfaces.Unsigned_16;
exact_blue : aliased Interfaces.Unsigned_16;
visual_red : aliased Interfaces.Unsigned_16;
visual_green : aliased Interfaces.Unsigned_16;
visual_blue : aliased Interfaces.Unsigned_16;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_lookup_color_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_lookup_color_reply_t.Item,
Element_Array => xcb.xcb_lookup_color_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_lookup_color_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_lookup_color_reply_t.Pointer,
Element_Array => xcb.xcb_lookup_color_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_lookup_color_reply_t;
| 30.333333 | 77 | 0.674725 |
04eb8b0819001ecd63c3b3a1a9175affdd22d39e | 6,677 | adb | Ada | configuration-step_1.adb | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 13 | 2021-09-28T18:14:32.000Z | 2022-02-09T17:48:53.000Z | configuration-step_1.adb | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 9 | 2021-09-28T19:18:25.000Z | 2022-01-14T22:54:06.000Z | configuration-step_1.adb | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 1 | 2021-10-21T21:19:08.000Z | 2021-10-21T21:19:08.000Z | ------------------------------------------------------------------------------
-- --
-- Ada User Repository Annex (AURA) --
-- ANNEXI-STRAYLINE Reference Implementation --
-- --
-- Command Line Interface --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- 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. --
-- --
------------------------------------------------------------------------------
with Registrar.Last_Run;
with Stream_Hashing;
separate (Configuration)
procedure Step_1 (Target: in out Subsystem) is
use Unit_Names;
use type Stream_Hashing.Hash_Type;
Last_Run_Units: Registrar.Library_Units.Library_Unit_Sets.Set
renames Registrar.Last_Run.All_Library_Units;
Last_Run_Subsystems: Registrar.Subsystems.Subsystem_Sets.Set
renames Registrar.Last_Run.All_Subsystems;
Conf_Unit_Name: constant Unit_Name := Config_Unit_Name (Target);
Root_Config: constant Boolean := Target.Name.To_String = "aura";
Currently_Have_Conf: constant Boolean
:= Reg_Qs.Unit_Entered (Conf_Unit_Name);
Currently_Have_Manifest: constant Boolean
:= (not Root_Config)
and then Reg_Qs.Unit_Entered (Manifest_Unit_Name (Target));
Current_Conf_Unit: Library_Unit
:= (if Currently_Have_Conf then
Reg_Qs.Lookup_Unit (Conf_Unit_Name)
else
(others => <>));
Previously_Had_Conf: constant Boolean
:= Last_Run_Units.Contains (Current_Conf_Unit);
Last_Run_Conf_Unit: constant Library_Unit
-- This only matters if we also currently have a configuration unit
:= (if Currently_Have_Conf and then Previously_Had_Conf then
Last_Run_Units (Last_Run_Units.Find (Current_Conf_Unit))
else
(others => <>));
begin
if Currently_Have_Conf then
-- See if we can load the last-run data
if Previously_Had_Conf
and then Current_Conf_Unit.Specification_Hash
= Last_Run_Conf_Unit.Specification_Hash
and then Current_Conf_Unit.Implementation_Hash
= Last_Run_Conf_Unit.Implementation_Hash
then
-- Nice, this makes things much quicker!
declare
use Registrar.Subsystems;
Last_Run_SS: constant Subsystem
:= Last_Run_Subsystems (Last_Run_Subsystems.Find (Target));
begin
Target.Configuration := Last_Run_SS.Configuration;
Step_4 (Target);
return;
end;
else
-- We need to re-parse the configuration unit
Step_3a (Target);
return;
end if;
else
-- No configuration unit
if Currently_Have_Manifest then
-- Load the manifest. Note that this will never be true for the
-- root config since Currently_Have_Manifest will always be false
Step_2 (Target);
return;
else
-- No manifest or config. We will generate the barebones one,
-- simple because the checkout spec is a child of the config unit, so
-- we need something there.
--
-- If target is AURA, then this is the root config, and in that case,
-- it's fine if we don't have any at all - we definately don't want to
-- generate it. We also don't need to invoke complete since there is
-- nothing to update in that case
if not Root_Config then
Generate_Basic_Config (Target);
Complete (Target);
end if;
return;
end if;
end if;
end Step_1;
| 45.732877 | 79 | 0.508462 |
0400f95150720d92356a1f675938855f21b8e709 | 414 | ads | Ada | src/interface/yaml-destination.ads | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 32 | 2017-08-02T16:45:34.000Z | 2021-08-18T20:12:57.000Z | src/interface/yaml-destination.ads | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 15 | 2017-09-13T09:43:38.000Z | 2022-01-20T23:21:47.000Z | src/interface/yaml-destination.ads | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 5 | 2017-09-19T16:54:22.000Z | 2020-04-09T07:17:02.000Z | -- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with Ada.Finalization;
package Yaml.Destination is
type Instance is abstract new Ada.Finalization.Limited_Controlled with
null record;
type Pointer is access all Instance'Class;
procedure Write_Data (D : in out Instance; Buffer : String) is abstract;
end Yaml.Destination;
| 29.571429 | 75 | 0.743961 |
1a5c53e7c24f57aa258f1ec3e6e400bf2e20fc66 | 2,074 | adb | Ada | 3-mid/opengl/source/platform/egl/opengl-context.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/platform/egl/opengl-context.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/platform/egl/opengl-context.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
opengl.Display .privvy,
opengl.surface_Profile.privvy,
opengl.Surface .privvy,
egl.Binding,
System;
package body openGL.Context
is
use egl.Binding,
System;
procedure define (Self : in out Item; the_Display : access opengl.Display.item'Class;
the_surface_Profile : in opengl.surface_Profile.item)
is
use EGL,
opengl.Display .privvy,
opengl.surface_Profile.privvy;
contextAttribs : EGLint_array := (EGL_CONTEXT_CLIENT_VERSION, 2,
EGL_NONE);
begin
Self.egl_Context := eglCreateContext (to_eGL (the_Display.all),
to_eGL (the_surface_Profile),
EGL_NO_CONTEXT,
contextAttribs (contextAttribs'First)'Unchecked_Access);
if Self.egl_Context = EGL_NO_CONTEXT then
raise opengl.Error with "Unable to create an EGL Context.";
end if;
Self.Display := the_Display;
end define;
procedure make_Current (Self : in Item; read_Surface : in opengl.Surface.item;
write_Surface : in opengl.Surface.item)
is
use eGL,
opengl.Display.privvy,
opengl.Surface.privvy;
use type EGLBoolean;
Success : constant EGLBoolean := eglmakeCurrent (to_eGL (Self.Display.all),
to_eGL (read_Surface),
to_eGL (write_Surface),
Self.egl_Context);
begin
if Success = EGL_FALSE then
raise openGL.Error with "unable to make egl Context current";
end if;
end make_Current;
function egl_Context_debug (Self : in Item'Class) return egl.EGLConfig
is
begin
return self.egl_Context;
end egl_Context_debug;
end openGL.Context;
| 30.5 | 100 | 0.532787 |
dcf88e81bea7a7ad89fe473ed57867cc3e722ee6 | 852 | ads | Ada | build_gnu/binutils/gdb/testsuite/gdb.ada/null_record/bar.ads | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | 1 | 2017-05-31T21:42:12.000Z | 2017-05-31T21:42:12.000Z | build_gnu/binutils/gdb/testsuite/gdb.ada/null_record/bar.ads | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | null | null | null | build_gnu/binutils/gdb/testsuite/gdb.ada/null_record/bar.ads | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | 1 | 2019-12-17T22:04:07.000Z | 2019-12-17T22:04:07.000Z | -- Copyright 2004-2014 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Bar is
type Empty is null record;
type Void_Star is access all Empty;
procedure Do_Nothing (E : Void_Star);
end Bar;
| 35.5 | 73 | 0.733568 |
3dd332705ead92aa5e89c6e626d7c32a4c009e14 | 284 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/aggr21.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/testsuite/gnat.dg/aggr21.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/aggr21.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do run }
with Aggr21_Pkg; use Aggr21_Pkg;
procedure Aggr21 is
V : Rec;
begin
V.A := 12;
V.S (1 .. 10) := "Hello init";
V.N := 123;
Init (V);
-- Probably not reliable, but the compiler is supposed not to modify V.S
pragma Assert (V.s (1 .. 5) = "Hello");
end;
| 18.933333 | 75 | 0.591549 |
57b3f979bce19a2411f9ce063265bd4e225ec491 | 9,278 | ads | Ada | generated-sources/ada-server/mojang-sessions/src/model/com-github-asyncmc-mojang-sessions-ada-server-model-models.ads | AsyncMC/Mojang-API-Libs | b01bbd2bce44bfa2b9ed705a128cf4ecda077916 | [
"Apache-2.0"
] | null | null | null | generated-sources/ada-server/mojang-sessions/src/model/com-github-asyncmc-mojang-sessions-ada-server-model-models.ads | AsyncMC/Mojang-API-Libs | b01bbd2bce44bfa2b9ed705a128cf4ecda077916 | [
"Apache-2.0"
] | null | null | null | generated-sources/ada-server/mojang-sessions/src/model/com-github-asyncmc-mojang-sessions-ada-server-model-models.ads | AsyncMC/Mojang-API-Libs | b01bbd2bce44bfa2b9ed705a128cf4ecda077916 | [
"Apache-2.0"
] | null | null | null | -- Mojang Session API
-- No description provided (generated by Openapi Generator https://github.com/openapitools/openapi-generator)
--
-- OpenAPI spec version: 2020_06_05
--
--
-- NOTE: This package is auto generated by the swagger code generator 3.3.4.
-- https://openapi-generator.tech
-- Do not edit the class manually.
with Swagger.Streams;
with Ada.Containers.Vectors;
package com.github.asyncmc.mojang.sessions.ada.server.model.Models is
type SessionApiError_Type is
record
Error : Swagger.Nullable_UString;
Path : Swagger.Nullable_UString;
end record;
package SessionApiError_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => SessionApiError_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SessionApiError_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SessionApiError_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SessionApiError_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SessionApiError_Type_Vectors.Vector);
type PlayerSkinURL_Type is
record
Url : Swagger.UString;
end record;
package PlayerSkinURL_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => PlayerSkinURL_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerSkinURL_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerSkinURL_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerSkinURL_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerSkinURL_Type_Vectors.Vector);
type PlayerTextureURL_Type is
record
Url : Swagger.UString;
end record;
package PlayerTextureURL_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => PlayerTextureURL_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerTextureURL_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerTextureURL_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerTextureURL_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerTextureURL_Type_Vectors.Vector);
type PlayerTexture_Type is
record
S_K_I_N : com.github.asyncmc.mojang.sessions.ada.server.model.Models.PlayerSkinURL_Type;
C_A_P_E : com.github.asyncmc.mojang.sessions.ada.server.model.Models.PlayerTextureURL_Type;
end record;
package PlayerTexture_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => PlayerTexture_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerTexture_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerTexture_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerTexture_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerTexture_Type_Vectors.Vector);
type PlayerProfileTexturePropertyValue_Type is
record
Timestamp : Swagger.Long;
Profile_Id : Swagger.UString;
Profile_Name : Swagger.UString;
Signature_Required : Swagger.Nullable_Boolean;
Textures : com.github.asyncmc.mojang.sessions.ada.server.model.Models.PlayerTexture_Type;
end record;
package PlayerProfileTexturePropertyValue_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => PlayerProfileTexturePropertyValue_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerProfileTexturePropertyValue_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerProfileTexturePropertyValue_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerProfileTexturePropertyValue_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerProfileTexturePropertyValue_Type_Vectors.Vector);
type PlayerSkinMetadata_Type is
record
Model : Swagger.Nullable_UString;
end record;
package PlayerSkinMetadata_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => PlayerSkinMetadata_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerSkinMetadata_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerSkinMetadata_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerSkinMetadata_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerSkinMetadata_Type_Vectors.Vector);
type PlayerProfile_Type is
record
Id : Swagger.UString;
Name : Swagger.UString;
Legacy : Swagger.Nullable_Boolean;
Properties : com.github.asyncmc.mojang.sessions.ada.server.model.Models.PlayerProfileProperty_Type_Vectors.Vector;
end record;
package PlayerProfile_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => PlayerProfile_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerProfile_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerProfile_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerProfile_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerProfile_Type_Vectors.Vector);
type PlayerProfileProperty_Type is
record
Name : Swagger.UString;
Value : ByteArray_Type;
Signature : ByteArray_Type;
end record;
package PlayerProfileProperty_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => PlayerProfileProperty_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerProfileProperty_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PlayerProfileProperty_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerProfileProperty_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PlayerProfileProperty_Type_Vectors.Vector);
end com.github.asyncmc.mojang.sessions.ada.server.model.Models;
| 36.964143 | 121 | 0.599052 |
1a0b129d33e06503286017c64d2229ce64a489ea | 3,301 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-caldel.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/a-caldel.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-caldel.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- A D A . C A L E N D A R . D E L A Y S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2013, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This package implements Calendar.Time delays using protected objects
-- Note: the compiler generates direct calls to this interface, in the
-- processing of time types.
package Ada.Calendar.Delays is
procedure Delay_For (D : Duration);
-- Delay until an interval of length (at least) D seconds has passed, or
-- the task is aborted to at least the current ATC nesting level. This is
-- an abort completion point. The body of this procedure must perform all
-- the processing required for an abort point.
procedure Delay_Until (T : Time);
-- Delay until Clock has reached (at least) time T, or the task is aborted
-- to at least the current ATC nesting level. The body of this procedure
-- must perform all the processing required for an abort point.
function To_Duration (T : Time) return Duration;
-- Convert Time to Duration elapsed since UNIX epoch
end Ada.Calendar.Delays;
| 61.12963 | 78 | 0.471675 |
047ce4f091ed13136bcd006d52b59731a2f7645e | 10,875 | adb | Ada | src/annotation_processor/implementation/yaml-transformator-annotation-concatenation.adb | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 32 | 2017-08-02T16:45:34.000Z | 2021-08-18T20:12:57.000Z | src/annotation_processor/implementation/yaml-transformator-annotation-concatenation.adb | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 15 | 2017-09-13T09:43:38.000Z | 2022-01-20T23:21:47.000Z | src/annotation_processor/implementation/yaml-transformator-annotation-concatenation.adb | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | 5 | 2017-09-19T16:54:22.000Z | 2020-04-09T07:17:02.000Z | -- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with Ada.Unchecked_Deallocation;
package body Yaml.Transformator.Annotation.Concatenation is
procedure Put (Object : in out Instance; E : Event) is
begin
Object.State.all (Object, E);
end Put;
function Has_Next (Object : Instance) return Boolean is
(Object.Current_Exists);
function Next (Object : in out Instance) return Event is
begin
if not Object.Current_Exists then
raise Constraint_Error with "no event to retrieve";
end if;
return Ret : constant Event := Object.Current do
if Object.Current_Aliased.Exists then
Object.Current := Object.Current_Aliased.Value.Next;
case Object.Current.Kind is
when Sequence_Start =>
Object.Depth := Object.Depth + 1;
when Sequence_End =>
Object.Depth := Object.Depth - 1;
if Object.Depth = 0 then
Object.Current_Exists := False;
Object.Current_Aliased.Clear;
end if;
when others => null;
end case;
else
Object.Current_Exists := False;
end if;
end return;
end Next;
function New_Concatenation (Pool : Text.Pool.Reference;
Node_Context : Node_Context_Type;
Processor_Context : Events.Context.Reference;
Swallows_Previous : out Boolean)
return not null Pointer is
pragma Unreferenced (Node_Context);
begin
Swallows_Previous := False;
return new Instance'(Transformator.Instance with Pool => Pool,
Context => Processor_Context, others => <>);
end New_Concatenation;
procedure Initial (Object : in out Instance; E : Event) is
begin
if E.Kind /= Annotation_Start then
raise Stream_Error with
"unexpected token (expected annotation start): " & E.Kind'Img;
end if;
Object.Node_Properties := E.Annotation_Properties;
Object.Current.Start_Position := E.Start_Position;
Object.State := After_Annotation_Start'Access;
end Initial;
procedure After_Annotation_Start (Object : in out Instance; E : Event) is
begin
if E.Kind /= Annotation_End then
raise Annotation_Error with
"@@concat does not take any parameters.";
end if;
Object.State := After_Annotation_End'Access;
end After_Annotation_Start;
procedure After_Annotation_End (Object : in out Instance; E : Event) is
begin
if E.Kind /= Sequence_Start then
raise Annotation_Error with
"@@concat must be applied on a sequence.";
end if;
Object.State := After_List_Start'Access;
end After_Annotation_End;
procedure After_List_Start (Object : in out Instance; E : Event) is
begin
case E.Kind is
when Scalar =>
Object.Builder :=
new Text.Builder.Reference'(Text.Builder.Create (Object.Pool));
Object.Builder.Append (E.Content.Value);
Object.State := After_String'Access;
when Sequence_Start =>
Object.Depth := 1;
Object.Current := Event'(Kind => Sequence_Start,
Collection_Style => Any,
Collection_Properties => Default_Properties,
others => <>);
Object.Current_Exists := True;
Object.State := In_Sequence'Access;
when Alias =>
declare
use type Events.Context.Cursor;
use type Text.Reference;
Position : constant Events.Context.Cursor :=
Events.Context.Position (Object.Context, E.Target);
begin
if Position = Events.Context.No_Element then
raise Annotation_Error with "Unresolvable alias: *" &
E.Target;
end if;
declare
Stream : constant Events.Store.Stream_Reference :=
Events.Context.Retrieve (Position);
Referred : constant Event := Stream.Value.Next;
begin
case Referred.Kind is
when Scalar =>
Object.Builder :=
new Text.Builder.Reference'(Text.Builder.Create
(Object.Pool));
Object.Builder.Append (Referred.Content.Value);
Object.State := After_String'Access;
when Sequence_Start =>
Object.Depth := 1;
Object.Current := Event'(Kind => Sequence_Start,
Collection_Style => Any,
Collection_Properties =>
Object.Node_Properties,
others => <>);
Object.Current_Exists := True;
Object.State := After_Sequence'Access;
Object.Current_Aliased := Stream.Optional;
when others =>
raise Annotation_Error with
"@@concat requires a list of scalars or sequences";
end case;
end;
end;
when others =>
raise Annotation_Error with
"@@concat requires a list of scalars or sequences";
end case;
end After_List_Start;
procedure In_Sequence (Object : in out Instance; E : Event) is
begin
case E.Kind is
when Sequence_Start =>
Object.Depth := Object.Depth + 1;
Object.Current := E;
Object.Current_Exists := True;
when Sequence_End =>
Object.Depth := Object.Depth - 1;
if Object.Depth = 0 then
Object.State := After_Sequence'Access;
else
Object.Current := E;
Object.Current_Exists := True;
end if;
when others =>
Object.Current := E;
Object.Current_Exists := True;
end case;
end In_Sequence;
procedure After_Sequence (Object : in out Instance; E : Event) is
begin
case E.Kind is
when Sequence_Start =>
Object.Depth := 1;
Object.State := In_Sequence'Access;
when Alias =>
declare
use type Events.Context.Cursor;
use type Text.Reference;
Position : constant Events.Context.Cursor :=
Events.Context.Position (Object.Context, E.Target);
begin
if Position = Events.Context.No_Element then
raise Annotation_Error with "Unresolvable alias: *" &
E.Target;
end if;
declare
Stream : constant Events.Store.Stream_Reference :=
Events.Context.Retrieve (Position);
Referred : constant Event := Stream.Value.Next;
begin
if Referred.Kind = Sequence_Start then
Object.Current := Stream.Value.Next;
if Object.Current.Kind /= Sequence_End then
Object.Depth :=
(if Object.Current.Kind = Sequence_Start then
2 else 1);
Object.Current_Exists := True;
Object.Current_Aliased := Stream.Optional;
end if;
else
raise Annotation_Error with
"illegal element in sequence, expected another sequence" &
Referred.Kind'Img;
end if;
end;
end;
when Sequence_End =>
Object.Current := E;
Object.Current_Exists := True;
Object.State := After_List_End'Access;
when others =>
raise Annotation_Error with
"illegal element in sequence, expected another sequence: " &
E.Kind'Img;
end case;
end After_Sequence;
procedure After_String (Object : in out Instance; E : Event) is
procedure Free is new Ada.Unchecked_Deallocation
(Text.Builder.Reference, Builder_Pointer);
begin
case E.Kind is
when Scalar =>
Object.Builder.Append (E.Content.Value);
when Alias =>
declare
use type Events.Context.Cursor;
use type Text.Reference;
Position : constant Events.Context.Cursor :=
Events.Context.Position (Object.Context, E.Target);
begin
if Position = Events.Context.No_Element then
raise Annotation_Error with "Unresolvable alias: *" &
E.Target;
end if;
declare
Stream : constant Events.Store.Stream_Reference :=
Events.Context.Retrieve (Position);
Referred_Event : constant Event := Stream.Value.Next;
begin
if Referred_Event.Kind /= Scalar then
raise Annotation_Error with
"illegal element in concatenation sequence, expected another scalar: " &
E.Kind'Img;
end if;
Object.Builder.Append (Referred_Event.Content.Value);
end;
end;
when Sequence_End =>
Object.Current := (Kind => Scalar, Scalar_Style => Any,
Scalar_Properties => Object.Node_Properties,
Start_Position => Object.Current.Start_Position,
End_Position => E.End_Position,
Content => Object.Builder.Lock);
Object.Current_Exists := True;
Free (Object.Builder);
Object.State := After_List_End'Access;
when others =>
raise Annotation_Error with
"illegal element in concatenation sequence, expected another scalar: " &
E.Kind'Img;
end case;
end After_String;
procedure After_List_End (Object : in out Instance; E : Event) is
begin
raise Constraint_Error with
"unexpected input to @@concat (already finished)";
end After_List_End;
begin
Map.Include ("concat", New_Concatenation'Access);
end Yaml.Transformator.Annotation.Concatenation;
| 40.578358 | 95 | 0.529747 |
041f8dc7c59d1efa40a0064f95a4352f4a73b21b | 5,161 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-ztmoio.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-ztmoio.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-ztmoio.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ W I D E _ T E X T _ I O . M O D U L A R _ I O --
-- --
-- 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 Ada.Wide_Wide_Text_IO.Modular_Aux;
with System.Unsigned_Types; use System.Unsigned_Types;
with System.WCh_Con; use System.WCh_Con;
with System.WCh_WtS; use System.WCh_WtS;
package body Ada.Wide_Wide_Text_IO.Modular_IO is
subtype TFT is Ada.Wide_Wide_Text_IO.File_Type;
-- File type required for calls to routines in Aux
package Aux renames Ada.Wide_Wide_Text_IO.Modular_Aux;
---------
-- Get --
---------
procedure Get
(File : File_Type;
Item : out Num;
Width : Field := 0)
is
begin
if Num'Size > Unsigned'Size then
Aux.Get_LLU (TFT (File), Long_Long_Unsigned (Item), Width);
else
Aux.Get_Uns (TFT (File), Unsigned (Item), Width);
end if;
exception
when Constraint_Error => raise Data_Error;
end Get;
procedure Get
(Item : out Num;
Width : Field := 0)
is
begin
Get (Current_Input, Item, Width);
end Get;
procedure Get
(From : Wide_Wide_String;
Item : out Num;
Last : out Positive)
is
S : constant String := Wide_Wide_String_To_String (From, WCEM_Upper);
-- String on which we do the actual conversion. Note that the method
-- used for wide character encoding is irrelevant, since if there is
-- a character outside the Standard.Character range then the call to
-- Aux.Gets will raise Data_Error in any case.
begin
if Num'Size > Unsigned'Size then
Aux.Gets_LLU (S, Long_Long_Unsigned (Item), Last);
else
Aux.Gets_Uns (S, Unsigned (Item), Last);
end if;
exception
when Constraint_Error => raise Data_Error;
end Get;
---------
-- Put --
---------
procedure Put
(File : File_Type;
Item : Num;
Width : Field := Default_Width;
Base : Number_Base := Default_Base)
is
begin
if Num'Size > Unsigned'Size then
Aux.Put_LLU (TFT (File), Long_Long_Unsigned (Item), Width, Base);
else
Aux.Put_Uns (TFT (File), Unsigned (Item), Width, Base);
end if;
end Put;
procedure Put
(Item : Num;
Width : Field := Default_Width;
Base : Number_Base := Default_Base)
is
begin
Put (Current_Output, Item, Width, Base);
end Put;
procedure Put
(To : out Wide_Wide_String;
Item : Num;
Base : Number_Base := Default_Base)
is
S : String (To'First .. To'Last);
begin
if Num'Size > Unsigned'Size then
Aux.Puts_LLU (S, Long_Long_Unsigned (Item), Base);
else
Aux.Puts_Uns (S, Unsigned (Item), Base);
end if;
for J in S'Range loop
To (J) := Wide_Wide_Character'Val (Character'Pos (S (J)));
end loop;
end Put;
end Ada.Wide_Wide_Text_IO.Modular_IO;
| 36.34507 | 78 | 0.499903 |
4b056620049d2220f0d7671f794fedf63b8dc048 | 12,547 | adb | Ada | software/driver/fs/fat_filesystem-directories-files.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/driver/fs/fat_filesystem-directories-files.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/driver/fs/fat_filesystem-directories-files.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | -- Project: StratoX
-- Department: Real-Time Computer Systems (RCS)
-- Project: StratoX
-- Authors: Martin Becker ([email protected])
--
-- XXX! Nothing here is proven thread-safe!
with Ada.Unchecked_Conversion;
with FAT_Filesystem; use FAT_Filesystem;
-- @summary File handling for FAT FS
package body FAT_Filesystem.Directories.Files is
-------------------
-- File_Create
-------------------
function File_Create
(Parent : in out Directory_Handle;
newname : String;
Overwrite : Boolean := False;
File : out File_Handle) return Status_Code
is
subtype Entry_Data is Block (1 .. 32);
function From_Entry is new Ada.Unchecked_Conversion
(FAT_Directory_Entry, Entry_Data);
F_Entry : FAT_Directory_Entry;
Ent_Addr : FAT_Address;
Status : Status_Code;
begin
File.Is_Open := False;
if Parent.FS.Version /= FAT32 then
-- we only support FAT32 for now.
return Internal_Error;
end if;
-- find a place for another entry and return it
Status := Allocate_Entry (Parent, newname, Ent_Addr);
if Status /= OK then
if Status = Already_Exists and Overwrite then
---------------
-- Overwrite
---------------
if not Get_Entry (Parent => Parent, E_Name => newname, Ent => File.D_Entry) then
return Internal_Error;
end if;
if File.D_Entry.Attributes.Subdirectory then
return Already_Exists; -- overwrite subdirectory with file -> no!
end if;
-- wipe cluster chain in FAT..just keep first cluster
declare
cluster_cur : Unsigned_32 := File.D_Entry.Start_Cluster;
cluster_info : Unsigned_32;
FAT_updated : Boolean;
begin
Wipe_Chain_Loop :
loop
cluster_info := Parent.FS.Get_FAT (cluster_cur);
-- either points to next cluster, or indicates that
-- current cluster is bad (FIXME) or free
if cluster_cur = File.D_Entry.Start_Cluster then
-- mark as tail
FAT_updated := Parent.FS.Set_FAT (cluster_cur, LAST_CLUSTER_VALUE);
else
-- mark unused
FAT_updated := Parent.FS.Set_FAT (cluster_cur, FREE_CLUSTER_VALUE);
end if;
if not FAT_updated then
return Internal_Error;
end if;
-- check FAT entry for successor cluster
if Parent.FS.Is_Last_Cluster (cluster_info) or
Parent.FS.Is_Free_Cluster (cluster_info) -- for robustness
then
exit Wipe_Chain_Loop;
end if;
cluster_cur := cluster_info;
end loop Wipe_Chain_Loop;
end;
File.D_Entry.Size := 0;
File.D_Entry.Attributes.Archive := True; -- for backup
-- no need to write the FAT entry, yet.
else
return Status;
end if;
else
--------------
-- new file
--------------
declare
new_cluster : constant Unsigned_32 := Parent.FS.Get_Free_Cluster;
begin
if new_cluster = INVALID_CLUSTER then
return Device_Full;
end if;
-- allocate first cluster for data
if not Parent.FS.Allocate_Cluster (new_cluster)
then
return Allocation_Error;
end if;
-- read complete block to write the entry
Status := Parent.FS.Ensure_Block (Ent_Addr.Block_LBA);
if Status /= OK then
return Status;
end if;
-- fill entry attrs to make it a directory
File.D_Entry.FS := Parent.FS;
File.D_Entry.Attributes.Read_Only := False;
File.D_Entry.Attributes.Hidden := False;
File.D_Entry.Attributes.Archive := True; -- for backup: mark new files with archive flag
File.D_Entry.Attributes.System_File := False;
File.D_Entry.Attributes.Volume_Label := False;
File.D_Entry.Attributes.Subdirectory := False;
File.D_Entry.Start_Cluster := new_cluster;
File.D_Entry.Entry_Address := Ent_Addr;
File.D_Entry.Size := 0; -- file is empty, yet
Set_Name (newname, File.D_Entry);
-- encode into FAT entry
Status := Directory_To_FAT_Entry (File.D_Entry, F_Entry);
if Status /= OK then
return Status;
end if;
-- copy FAT entry to window
Parent.FS.Window (Ent_Addr.Block_Off .. Ent_Addr.Block_Off +
ENTRY_SIZE - 1) := From_Entry (F_Entry);
-- write back the window to disk
Status := Parent.FS.Write_Window (Ent_Addr.Block_LBA);
if Status /= OK then
return Status;
end if;
end;
end if;
-- set up file handle
File.FS := Parent.FS;
File.Start_Cluster := File.D_Entry.Start_Cluster;
File.Current_Cluster := File.D_Entry.Start_Cluster;
File.Current_Block := Parent.FS.Cluster_To_Block (File.D_Entry.Start_Cluster);
File.Buffer_Level := 0;
File.Mode := Write_Mode;
File.Bytes_Total := 0;
File.Is_Open := True;
return OK;
end File_Create;
-------------------
-- Update_Entry
-------------------
function Update_Entry (File : in out File_Handle) return Status_Code is
Status : Status_Code;
begin
Status := File.FS.Ensure_Block (File.D_Entry.Entry_Address.Block_LBA);
if Status /= OK then
return Status;
end if;
-- a bit of a hack, to save us from the work of re-generating the entire entry
declare
Size_Off : constant Unsigned_16 := 28;
subtype Entry_Data is Block (1 .. 4);
function Bytes_From_Size is new Ada.Unchecked_Conversion
(Unsigned_32, Entry_Data);
win_lo : constant Unsigned_16 := File.D_Entry.Entry_Address.Block_Off + Size_Off;
win_hi : constant Unsigned_16 := win_lo + 3;
begin
File.FS.Window (win_lo .. win_hi) := Bytes_From_Size (File.D_Entry.Size);
end;
Status := File.FS.Write_Window (File.D_Entry.Entry_Address.Block_LBA);
return Status;
end Update_Entry;
-------------------
-- File_Write
-------------------
function File_Write
(File : in out File_Handle;
Data : File_Data;
Status : out Status_Code) return Integer
is
n_processed : Natural := 0;
this_chunk : Natural := 0;
begin
if not File.Is_Open or File.Mode /= Write_Mode then
return -1;
end if;
if Data'Length < 1 then
return 0;
end if;
-- if buffer is full, write to disk
Write_Loop : loop
-- determine how much the buffer can take
declare
n_remain : constant Natural := Data'Length - n_processed;
cap : Natural;
begin
cap := File.Buffer'Length - File.Buffer_Level;
this_chunk := (if cap >= n_remain then n_remain else cap);
end;
-- copy max amount to buffer.
declare
newlevel : constant Natural := File.Buffer_Level + this_chunk;
buf_lo : constant Unsigned_16 := File.Buffer'First + Unsigned_16 (File.Buffer_Level);
buf_hi : constant Unsigned_16 := File.Buffer'First + Unsigned_16 (newlevel) - 1;
cnk_lo : constant Unsigned_16 := Data'First + Unsigned_16 (n_processed);
cnk_hi : constant Unsigned_16 := cnk_lo + Unsigned_16 (this_chunk) - 1;
begin
-- FIXME: save this copy if we have a full buffer. takes ~16usec
File.Buffer (buf_lo .. buf_hi) := Data (cnk_lo .. cnk_hi);
File.Buffer_Level := newlevel;
end;
-- book keeping
File.Bytes_Total := File.Bytes_Total + Unsigned_32 (this_chunk);
File.D_Entry.Size := File.Bytes_Total;
-- write buffer to disk only if full
if File.Buffer_Level = File.Buffer'Length then
File.FS.Window := File.Buffer;
Status := File.FS.Write_Window (File.Current_Block); -- ~2.7msec (too slow!)
if Status /= OK then
return n_processed;
end if;
-- now check whether the next block fits in the cluster.
-- Otherwise alloc next cluster and update FAT.
File.Current_Block := File.Current_Block + 1;
if File.Current_Block - File.FS.Cluster_To_Block (File.Current_Cluster) =
Unsigned_32 (File.FS.Number_Of_Blocks_Per_Cluster)
then
-- require another cluster
declare
New_Cluster : Unsigned_32;
begin
Status := File.FS.Append_Cluster
(Last_Cluster => File.Current_Cluster,
New_Cluster => New_Cluster);
if Status /= OK then
return n_processed;
end if;
File.Current_Cluster := New_Cluster;
File.Current_Block := File.FS.Cluster_To_Block (File.Current_Cluster);
end;
end if;
File.Buffer_Level := 0; -- now it is empty
-- update directory entry on disk (size has changed)
declare
Status_Up : Status_Code := Update_Entry (File);
pragma Unreferenced (Status_Up); -- don't care, that size is optional for us
begin
null;
end;
end if;
n_processed := n_processed + this_chunk;
exit Write_Loop when n_processed = Data'Length;
end loop Write_Loop;
return n_processed;
end File_Write;
------------------------
-- File_Open_Readonly
------------------------
function File_Open_Readonly
(Ent : in out Directory_Entry;
File : in out File_Data) return Status_Code
is
pragma Unreferenced (Ent, File);
begin
-- TODO: not yet implemented
return Internal_Error;
end File_Open_Readonly;
---------------
-- File_Read
---------------
function File_Read
(File : in out File_Handle;
Data : out File_Data) return Integer
is
pragma Unreferenced (Data);
begin
if not File.Is_Open or File.Mode /= Read_Mode then
return -1;
end if;
-- TODO: not yet implemented
File.Bytes_Total := File.Bytes_Total + 0;
return -1;
end File_Read;
----------------
-- File_Close
----------------
procedure File_Close (File : in out File_Handle) is
begin
if not File.Is_Open then
return;
end if;
if File.Mode = Write_Mode and then File.Buffer_Level > 0 then
-- flush buffer to disk
File.FS.Window := File.Buffer;
declare
Status : Status_Code := File.FS.Write_Window (File.Current_Block);
pragma Unreferenced (Status);
begin
null;
end;
-- we assume that the directory entry is already maintained by File_Write
end if;
File.Is_Open := False;
end File_Close;
----------------
-- File_Flush
----------------
function File_Flush (File : in out File_Handle) return Status_Code is
Status : Status_Code;
begin
if not File.Is_Open then
return Invalid_Object_Entry;
end if;
if File.Mode = Write_Mode and then File.Buffer_Level > 0 then
-- flush data block, even if not full
File.FS.Window := File.Buffer;
Status := File.FS.Write_Window (File.Current_Block);
-- force-update directory entry on disk
declare
Status_Up : Status_Code := Update_Entry (File);
pragma Unreferenced (Status_Up); -- don't care, that size is optional for us
begin
null;
end;
end if;
return Status;
end File_Flush;
----------------
-- File_Size
----------------
function File_Size (File : File_Handle) return Unsigned_32 is (File.Bytes_Total);
end FAT_Filesystem.Directories.Files;
| 33.63807 | 100 | 0.555671 |
047e5d7974cef69c0e8ca02d9c94c1a61d5a4348 | 44,747 | ads | Ada | arch/ARM/STM32/svd/stm32l0x3/stm32_svd-tim.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/stm32l0x3/stm32_svd-tim.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l0x3/stm32_svd-tim.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L0x3.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.TIM is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR1_CMS_Field is HAL.UInt2;
subtype CR1_CKD_Field is HAL.UInt2;
-- control register 1
type CR1_Register is record
-- Counter enable
CEN : Boolean := False;
-- Update disable
UDIS : Boolean := False;
-- Update request source
URS : Boolean := False;
-- One-pulse mode
OPM : Boolean := False;
-- Direction
DIR : Boolean := False;
-- Center-aligned mode selection
CMS : CR1_CMS_Field := 16#0#;
-- Auto-reload preload enable
ARPE : Boolean := False;
-- Clock division
CKD : CR1_CKD_Field := 16#0#;
-- unspecified
Reserved_10_31 : HAL.UInt22 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register use record
CEN at 0 range 0 .. 0;
UDIS at 0 range 1 .. 1;
URS at 0 range 2 .. 2;
OPM at 0 range 3 .. 3;
DIR at 0 range 4 .. 4;
CMS at 0 range 5 .. 6;
ARPE at 0 range 7 .. 7;
CKD at 0 range 8 .. 9;
Reserved_10_31 at 0 range 10 .. 31;
end record;
subtype CR2_MMS_Field is HAL.UInt3;
-- control register 2
type CR2_Register is record
-- unspecified
Reserved_0_2 : HAL.UInt3 := 16#0#;
-- Capture/compare DMA selection
CCDS : Boolean := False;
-- Master mode selection
MMS : CR2_MMS_Field := 16#0#;
-- TI1 selection
TI1S : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register use record
Reserved_0_2 at 0 range 0 .. 2;
CCDS at 0 range 3 .. 3;
MMS at 0 range 4 .. 6;
TI1S at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype SMCR_SMS_Field is HAL.UInt3;
subtype SMCR_TS_Field is HAL.UInt3;
subtype SMCR_ETF_Field is HAL.UInt4;
subtype SMCR_ETPS_Field is HAL.UInt2;
-- slave mode control register
type SMCR_Register is record
-- Slave mode selection
SMS : SMCR_SMS_Field := 16#0#;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Trigger selection
TS : SMCR_TS_Field := 16#0#;
-- Master/Slave mode
MSM : Boolean := False;
-- External trigger filter
ETF : SMCR_ETF_Field := 16#0#;
-- External trigger prescaler
ETPS : SMCR_ETPS_Field := 16#0#;
-- External clock enable
ECE : Boolean := False;
-- External trigger polarity
ETP : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SMCR_Register use record
SMS at 0 range 0 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
TS at 0 range 4 .. 6;
MSM at 0 range 7 .. 7;
ETF at 0 range 8 .. 11;
ETPS at 0 range 12 .. 13;
ECE at 0 range 14 .. 14;
ETP at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register is record
-- Update interrupt enable
UIE : Boolean := False;
-- Capture/Compare 1 interrupt enable
CC1IE : Boolean := False;
-- Capture/Compare 2 interrupt enable
CC2IE : Boolean := False;
-- Capture/Compare 3 interrupt enable
CC3IE : Boolean := False;
-- Capture/Compare 4 interrupt enable
CC4IE : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Trigger interrupt enable
TIE : Boolean := False;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#0#;
-- Update DMA request enable
UDE : Boolean := False;
-- Capture/Compare 1 DMA request enable
CC1DE : Boolean := False;
-- Capture/Compare 2 DMA request enable
CC2DE : Boolean := False;
-- Capture/Compare 3 DMA request enable
CC3DE : Boolean := False;
-- Capture/Compare 4 DMA request enable
CC4DE : Boolean := False;
-- unspecified
Reserved_13_13 : HAL.Bit := 16#0#;
-- Trigger DMA request enable
TDE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register use record
UIE at 0 range 0 .. 0;
CC1IE at 0 range 1 .. 1;
CC2IE at 0 range 2 .. 2;
CC3IE at 0 range 3 .. 3;
CC4IE at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TIE at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
UDE at 0 range 8 .. 8;
CC1DE at 0 range 9 .. 9;
CC2DE at 0 range 10 .. 10;
CC3DE at 0 range 11 .. 11;
CC4DE at 0 range 12 .. 12;
Reserved_13_13 at 0 range 13 .. 13;
TDE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- status register
type SR_Register is record
-- Update interrupt flag
UIF : Boolean := False;
-- Capture/compare 1 interrupt flag
CC1IF : Boolean := False;
-- Capture/Compare 2 interrupt flag
CC2IF : Boolean := False;
-- Capture/Compare 3 interrupt flag
CC3IF : Boolean := False;
-- Capture/Compare 4 interrupt flag
CC4IF : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Trigger interrupt flag
TIF : Boolean := False;
-- unspecified
Reserved_7_8 : HAL.UInt2 := 16#0#;
-- Capture/Compare 1 overcapture flag
CC1OF : Boolean := False;
-- Capture/compare 2 overcapture flag
CC2OF : Boolean := False;
-- Capture/Compare 3 overcapture flag
CC3OF : Boolean := False;
-- Capture/Compare 4 overcapture flag
CC4OF : Boolean := False;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
UIF at 0 range 0 .. 0;
CC1IF at 0 range 1 .. 1;
CC2IF at 0 range 2 .. 2;
CC3IF at 0 range 3 .. 3;
CC4IF at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TIF at 0 range 6 .. 6;
Reserved_7_8 at 0 range 7 .. 8;
CC1OF at 0 range 9 .. 9;
CC2OF at 0 range 10 .. 10;
CC3OF at 0 range 11 .. 11;
CC4OF at 0 range 12 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
-- event generation register
type EGR_Register is record
-- Write-only. Update generation
UG : Boolean := False;
-- Write-only. Capture/compare 1 generation
CC1G : Boolean := False;
-- Write-only. Capture/compare 2 generation
CC2G : Boolean := False;
-- Write-only. Capture/compare 3 generation
CC3G : Boolean := False;
-- Write-only. Capture/compare 4 generation
CC4G : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Write-only. Trigger generation
TG : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register use record
UG at 0 range 0 .. 0;
CC1G at 0 range 1 .. 1;
CC2G at 0 range 2 .. 2;
CC3G at 0 range 3 .. 3;
CC4G at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TG at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype CCMR1_Output_CC1S_Field is HAL.UInt2;
subtype CCMR1_Output_OC1M_Field is HAL.UInt3;
subtype CCMR1_Output_CC2S_Field is HAL.UInt2;
subtype CCMR1_Output_OC2M_Field is HAL.UInt3;
-- capture/compare mode register 1 (output mode)
type CCMR1_Output_Register is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Output_CC1S_Field := 16#0#;
-- Output compare 1 fast enable
OC1FE : Boolean := False;
-- Output compare 1 preload enable
OC1PE : Boolean := False;
-- Output compare 1 mode
OC1M : CCMR1_Output_OC1M_Field := 16#0#;
-- Output compare 1 clear enable
OC1CE : Boolean := False;
-- Capture/Compare 2 selection
CC2S : CCMR1_Output_CC2S_Field := 16#0#;
-- Output compare 2 fast enable
OC2FE : Boolean := False;
-- Output compare 2 preload enable
OC2PE : Boolean := False;
-- Output compare 2 mode
OC2M : CCMR1_Output_OC2M_Field := 16#0#;
-- Output compare 2 clear enable
OC2CE : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Output_Register use record
CC1S at 0 range 0 .. 1;
OC1FE at 0 range 2 .. 2;
OC1PE at 0 range 3 .. 3;
OC1M at 0 range 4 .. 6;
OC1CE at 0 range 7 .. 7;
CC2S at 0 range 8 .. 9;
OC2FE at 0 range 10 .. 10;
OC2PE at 0 range 11 .. 11;
OC2M at 0 range 12 .. 14;
OC2CE at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCMR1_Input_CC1S_Field is HAL.UInt2;
subtype CCMR1_Input_IC1PSC_Field is HAL.UInt2;
subtype CCMR1_Input_IC1F_Field is HAL.UInt4;
subtype CCMR1_Input_CC2S_Field is HAL.UInt2;
subtype CCMR1_Input_IC2PSC_Field is HAL.UInt2;
subtype CCMR1_Input_IC2F_Field is HAL.UInt4;
-- capture/compare mode register 1 (input mode)
type CCMR1_Input_Register is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Input_CC1S_Field := 16#0#;
-- Input capture 1 prescaler
IC1PSC : CCMR1_Input_IC1PSC_Field := 16#0#;
-- Input capture 1 filter
IC1F : CCMR1_Input_IC1F_Field := 16#0#;
-- Capture/compare 2 selection
CC2S : CCMR1_Input_CC2S_Field := 16#0#;
-- Input capture 2 prescaler
IC2PSC : CCMR1_Input_IC2PSC_Field := 16#0#;
-- Input capture 2 filter
IC2F : CCMR1_Input_IC2F_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Input_Register use record
CC1S at 0 range 0 .. 1;
IC1PSC at 0 range 2 .. 3;
IC1F at 0 range 4 .. 7;
CC2S at 0 range 8 .. 9;
IC2PSC at 0 range 10 .. 11;
IC2F at 0 range 12 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCMR2_Output_CC3S_Field is HAL.UInt2;
subtype CCMR2_Output_OC3M_Field is HAL.UInt3;
subtype CCMR2_Output_CC4S_Field is HAL.UInt2;
subtype CCMR2_Output_OC4M_Field is HAL.UInt3;
-- capture/compare mode register 2 (output mode)
type CCMR2_Output_Register is record
-- Capture/Compare 3 selection
CC3S : CCMR2_Output_CC3S_Field := 16#0#;
-- Output compare 3 fast enable
OC3FE : Boolean := False;
-- Output compare 3 preload enable
OC3PE : Boolean := False;
-- Output compare 3 mode
OC3M : CCMR2_Output_OC3M_Field := 16#0#;
-- Output compare 3 clear enable
OC3CE : Boolean := False;
-- Capture/Compare 4 selection
CC4S : CCMR2_Output_CC4S_Field := 16#0#;
-- Output compare 4 fast enable
OC4FE : Boolean := False;
-- Output compare 4 preload enable
OC4PE : Boolean := False;
-- Output compare 4 mode
OC4M : CCMR2_Output_OC4M_Field := 16#0#;
-- Output compare 4 clear enable
OC4CE : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR2_Output_Register use record
CC3S at 0 range 0 .. 1;
OC3FE at 0 range 2 .. 2;
OC3PE at 0 range 3 .. 3;
OC3M at 0 range 4 .. 6;
OC3CE at 0 range 7 .. 7;
CC4S at 0 range 8 .. 9;
OC4FE at 0 range 10 .. 10;
OC4PE at 0 range 11 .. 11;
OC4M at 0 range 12 .. 14;
OC4CE at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCMR2_Input_CC3S_Field is HAL.UInt2;
subtype CCMR2_Input_IC3PSC_Field is HAL.UInt2;
subtype CCMR2_Input_IC3F_Field is HAL.UInt4;
subtype CCMR2_Input_CC4S_Field is HAL.UInt2;
subtype CCMR2_Input_IC4PSC_Field is HAL.UInt2;
subtype CCMR2_Input_IC4F_Field is HAL.UInt4;
-- capture/compare mode register 2 (input mode)
type CCMR2_Input_Register is record
-- Capture/Compare 3 selection
CC3S : CCMR2_Input_CC3S_Field := 16#0#;
-- Input capture 3 prescaler
IC3PSC : CCMR2_Input_IC3PSC_Field := 16#0#;
-- Input capture 3 filter
IC3F : CCMR2_Input_IC3F_Field := 16#0#;
-- Capture/Compare 4 selection
CC4S : CCMR2_Input_CC4S_Field := 16#0#;
-- Input capture 4 prescaler
IC4PSC : CCMR2_Input_IC4PSC_Field := 16#0#;
-- Input capture 4 filter
IC4F : CCMR2_Input_IC4F_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR2_Input_Register use record
CC3S at 0 range 0 .. 1;
IC3PSC at 0 range 2 .. 3;
IC3F at 0 range 4 .. 7;
CC4S at 0 range 8 .. 9;
IC4PSC at 0 range 10 .. 11;
IC4F at 0 range 12 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- capture/compare enable register
type CCER_Register is record
-- Capture/Compare 1 output enable
CC1E : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1P : Boolean := False;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- Capture/Compare 1 output Polarity
CC1NP : Boolean := False;
-- Capture/Compare 2 output enable
CC2E : Boolean := False;
-- Capture/Compare 2 output Polarity
CC2P : Boolean := False;
-- unspecified
Reserved_6_6 : HAL.Bit := 16#0#;
-- Capture/Compare 2 output Polarity
CC2NP : Boolean := False;
-- Capture/Compare 3 output enable
CC3E : Boolean := False;
-- Capture/Compare 3 output Polarity
CC3P : Boolean := False;
-- unspecified
Reserved_10_10 : HAL.Bit := 16#0#;
-- Capture/Compare 3 output Polarity
CC3NP : Boolean := False;
-- Capture/Compare 4 output enable
CC4E : Boolean := False;
-- Capture/Compare 3 output Polarity
CC4P : Boolean := False;
-- unspecified
Reserved_14_14 : HAL.Bit := 16#0#;
-- Capture/Compare 4 output Polarity
CC4NP : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCER_Register use record
CC1E at 0 range 0 .. 0;
CC1P at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
CC1NP at 0 range 3 .. 3;
CC2E at 0 range 4 .. 4;
CC2P at 0 range 5 .. 5;
Reserved_6_6 at 0 range 6 .. 6;
CC2NP at 0 range 7 .. 7;
CC3E at 0 range 8 .. 8;
CC3P at 0 range 9 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
CC3NP at 0 range 11 .. 11;
CC4E at 0 range 12 .. 12;
CC4P at 0 range 13 .. 13;
Reserved_14_14 at 0 range 14 .. 14;
CC4NP at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CNT_CNT_L_Field is HAL.UInt16;
subtype CNT_CNT_H_Field is HAL.UInt16;
-- counter
type CNT_Register is record
-- Low counter value
CNT_L : CNT_CNT_L_Field := 16#0#;
-- High counter value (TIM2 only)
CNT_H : CNT_CNT_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNT_Register use record
CNT_L at 0 range 0 .. 15;
CNT_H at 0 range 16 .. 31;
end record;
subtype PSC_PSC_Field is HAL.UInt16;
-- prescaler
type PSC_Register is record
-- Prescaler value
PSC : PSC_PSC_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PSC_Register use record
PSC at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype ARR_ARR_L_Field is HAL.UInt16;
subtype ARR_ARR_H_Field is HAL.UInt16;
-- auto-reload register
type ARR_Register is record
-- Low Auto-reload value
ARR_L : ARR_ARR_L_Field := 16#0#;
-- High Auto-reload value (TIM2 only)
ARR_H : ARR_ARR_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ARR_Register use record
ARR_L at 0 range 0 .. 15;
ARR_H at 0 range 16 .. 31;
end record;
subtype CCR1_CCR1_L_Field is HAL.UInt16;
subtype CCR1_CCR1_H_Field is HAL.UInt16;
-- capture/compare register 1
type CCR1_Register is record
-- Low Capture/Compare 1 value
CCR1_L : CCR1_CCR1_L_Field := 16#0#;
-- High Capture/Compare 1 value (TIM2 only)
CCR1_H : CCR1_CCR1_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR1_Register use record
CCR1_L at 0 range 0 .. 15;
CCR1_H at 0 range 16 .. 31;
end record;
subtype CCR2_CCR2_L_Field is HAL.UInt16;
subtype CCR2_CCR2_H_Field is HAL.UInt16;
-- capture/compare register 2
type CCR2_Register is record
-- Low Capture/Compare 2 value
CCR2_L : CCR2_CCR2_L_Field := 16#0#;
-- High Capture/Compare 2 value (TIM2 only)
CCR2_H : CCR2_CCR2_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR2_Register use record
CCR2_L at 0 range 0 .. 15;
CCR2_H at 0 range 16 .. 31;
end record;
subtype CCR3_CCR3_L_Field is HAL.UInt16;
subtype CCR3_CCR3_H_Field is HAL.UInt16;
-- capture/compare register 3
type CCR3_Register is record
-- Low Capture/Compare value
CCR3_L : CCR3_CCR3_L_Field := 16#0#;
-- High Capture/Compare value (TIM2 only)
CCR3_H : CCR3_CCR3_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR3_Register use record
CCR3_L at 0 range 0 .. 15;
CCR3_H at 0 range 16 .. 31;
end record;
subtype CCR4_CCR4_L_Field is HAL.UInt16;
subtype CCR4_CCR4_H_Field is HAL.UInt16;
-- capture/compare register 4
type CCR4_Register is record
-- Low Capture/Compare value
CCR4_L : CCR4_CCR4_L_Field := 16#0#;
-- High Capture/Compare value (TIM2 only)
CCR4_H : CCR4_CCR4_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR4_Register use record
CCR4_L at 0 range 0 .. 15;
CCR4_H at 0 range 16 .. 31;
end record;
subtype DCR_DBA_Field is HAL.UInt5;
subtype DCR_DBL_Field is HAL.UInt5;
-- DMA control register
type DCR_Register is record
-- DMA base address
DBA : DCR_DBA_Field := 16#0#;
-- unspecified
Reserved_5_7 : HAL.UInt3 := 16#0#;
-- DMA burst length
DBL : DCR_DBL_Field := 16#0#;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DCR_Register use record
DBA at 0 range 0 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
DBL at 0 range 8 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
subtype DMAR_DMAB_Field is HAL.UInt16;
-- DMA address for full transfer
type DMAR_Register is record
-- DMA register for burst accesses
DMAB : DMAR_DMAB_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DMAR_Register use record
DMAB at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype OR_ETR_RMP_Field is HAL.UInt3;
subtype OR_TI4_RMP_Field is HAL.UInt2;
-- TIM2 option register
type OR_Register is record
-- Timer2 ETR remap
ETR_RMP : OR_ETR_RMP_Field := 16#0#;
-- Internal trigger
TI4_RMP : OR_TI4_RMP_Field := 16#0#;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR_Register use record
ETR_RMP at 0 range 0 .. 2;
TI4_RMP at 0 range 3 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
-- control register 1
type CR1_Register_1 is record
-- Counter enable
CEN : Boolean := False;
-- Update disable
UDIS : Boolean := False;
-- Update request source
URS : Boolean := False;
-- One-pulse mode
OPM : Boolean := False;
-- unspecified
Reserved_4_6 : HAL.UInt3 := 16#0#;
-- Auto-reload preload enable
ARPE : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register_1 use record
CEN at 0 range 0 .. 0;
UDIS at 0 range 1 .. 1;
URS at 0 range 2 .. 2;
OPM at 0 range 3 .. 3;
Reserved_4_6 at 0 range 4 .. 6;
ARPE at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- control register 2
type CR2_Register_1 is record
-- unspecified
Reserved_0_3 : HAL.UInt4 := 16#0#;
-- Master mode selection
MMS : CR2_MMS_Field := 16#0#;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register_1 use record
Reserved_0_3 at 0 range 0 .. 3;
MMS at 0 range 4 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register_1 is record
-- Update interrupt enable
UIE : Boolean := False;
-- unspecified
Reserved_1_7 : HAL.UInt7 := 16#0#;
-- Update DMA request enable
UDE : Boolean := False;
-- unspecified
Reserved_9_31 : HAL.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register_1 use record
UIE at 0 range 0 .. 0;
Reserved_1_7 at 0 range 1 .. 7;
UDE at 0 range 8 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
-- status register
type SR_Register_1 is record
-- Update interrupt flag
UIF : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register_1 use record
UIF at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- event generation register
type EGR_Register_1 is record
-- Write-only. Update generation
UG : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register_1 use record
UG at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype CNT_CNT_Field is HAL.UInt16;
-- counter
type CNT_Register_1 is record
-- Low counter value
CNT : CNT_CNT_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNT_Register_1 use record
CNT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype ARR_ARR_Field is HAL.UInt16;
-- auto-reload register
type ARR_Register_1 is record
-- Low Auto-reload value
ARR : ARR_ARR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ARR_Register_1 use record
ARR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register_2 is record
-- Update interrupt enable
UIE : Boolean := False;
-- Capture/Compare 1 interrupt enable
CC1IE : Boolean := False;
-- Capture/Compare 2 interrupt enable
CC2IE : Boolean := False;
-- unspecified
Reserved_3_5 : HAL.UInt3 := 16#0#;
-- Trigger interrupt enable
TIE : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register_2 use record
UIE at 0 range 0 .. 0;
CC1IE at 0 range 1 .. 1;
CC2IE at 0 range 2 .. 2;
Reserved_3_5 at 0 range 3 .. 5;
TIE at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-- status register
type SR_Register_2 is record
-- Update interrupt flag
UIF : Boolean := False;
-- Capture/compare 1 interrupt flag
CC1IF : Boolean := False;
-- Capture/Compare 2 interrupt flag
CC2IF : Boolean := False;
-- unspecified
Reserved_3_5 : HAL.UInt3 := 16#0#;
-- Trigger interrupt flag
TIF : Boolean := False;
-- unspecified
Reserved_7_8 : HAL.UInt2 := 16#0#;
-- Capture/Compare 1 overcapture flag
CC1OF : Boolean := False;
-- Capture/compare 2 overcapture flag
CC2OF : Boolean := False;
-- unspecified
Reserved_11_31 : HAL.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register_2 use record
UIF at 0 range 0 .. 0;
CC1IF at 0 range 1 .. 1;
CC2IF at 0 range 2 .. 2;
Reserved_3_5 at 0 range 3 .. 5;
TIF at 0 range 6 .. 6;
Reserved_7_8 at 0 range 7 .. 8;
CC1OF at 0 range 9 .. 9;
CC2OF at 0 range 10 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
-- event generation register
type EGR_Register_2 is record
-- Write-only. Update generation
UG : Boolean := False;
-- Write-only. Capture/compare 1 generation
CC1G : Boolean := False;
-- Write-only. Capture/compare 2 generation
CC2G : Boolean := False;
-- unspecified
Reserved_3_5 : HAL.UInt3 := 16#0#;
-- Write-only. Trigger generation
TG : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register_2 use record
UG at 0 range 0 .. 0;
CC1G at 0 range 1 .. 1;
CC2G at 0 range 2 .. 2;
Reserved_3_5 at 0 range 3 .. 5;
TG at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-- capture/compare mode register (output mode)
type CCMR1_Output_Register_1 is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Output_CC1S_Field := 16#0#;
-- Output Compare 1 fast enable
OC1FE : Boolean := False;
-- Output Compare 1 preload enable
OC1PE : Boolean := False;
-- Output Compare 1 mode
OC1M : CCMR1_Output_OC1M_Field := 16#0#;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#0#;
-- Capture/Compare 2 selection
CC2S : CCMR1_Output_CC2S_Field := 16#0#;
-- Output Compare 2 fast enable
OC2FE : Boolean := False;
-- Output Compare 2 preload enable
OC2PE : Boolean := False;
-- Output Compare 2 mode
OC2M : CCMR1_Output_OC2M_Field := 16#0#;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Output_Register_1 use record
CC1S at 0 range 0 .. 1;
OC1FE at 0 range 2 .. 2;
OC1PE at 0 range 3 .. 3;
OC1M at 0 range 4 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
CC2S at 0 range 8 .. 9;
OC2FE at 0 range 10 .. 10;
OC2PE at 0 range 11 .. 11;
OC2M at 0 range 12 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- capture/compare enable register
type CCER_Register_1 is record
-- Capture/Compare 1 output enable
CC1E : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1P : Boolean := False;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- Capture/Compare 1 output Polarity
CC1NP : Boolean := False;
-- Capture/Compare 2 output enable
CC2E : Boolean := False;
-- Capture/Compare 2 output Polarity
CC2P : Boolean := False;
-- unspecified
Reserved_6_6 : HAL.Bit := 16#0#;
-- Capture/Compare 2 output Polarity
CC2NP : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCER_Register_1 use record
CC1E at 0 range 0 .. 0;
CC1P at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
CC1NP at 0 range 3 .. 3;
CC2E at 0 range 4 .. 4;
CC2P at 0 range 5 .. 5;
Reserved_6_6 at 0 range 6 .. 6;
CC2NP at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CCR1_CCR1_Field is HAL.UInt16;
-- capture/compare register 1
type CCR1_Register_1 is record
-- Capture/Compare 1 value
CCR1 : CCR1_CCR1_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR1_Register_1 use record
CCR1 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCR2_CCR2_Field is HAL.UInt16;
-- capture/compare register 2
type CCR2_Register_1 is record
-- Capture/Compare 2 value
CCR2 : CCR2_CCR2_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR2_Register_1 use record
CCR2 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype OR_ETR_RMP_Field_1 is HAL.UInt2;
subtype OR_TI1_RMP_Field is HAL.UInt3;
-- TIM21 option register
type OR_Register_1 is record
-- Timer21 ETR remap
ETR_RMP : OR_ETR_RMP_Field_1 := 16#0#;
-- Timer21 TI1
TI1_RMP : OR_TI1_RMP_Field := 16#0#;
-- Timer21 TI2
TI2_RMP : Boolean := False;
-- unspecified
Reserved_6_31 : HAL.UInt26 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR_Register_1 use record
ETR_RMP at 0 range 0 .. 1;
TI1_RMP at 0 range 2 .. 4;
TI2_RMP at 0 range 5 .. 5;
Reserved_6_31 at 0 range 6 .. 31;
end record;
subtype OR_TI1_RMP_Field_1 is HAL.UInt2;
-- TIM22 option register
type OR_Register_2 is record
-- Timer22 ETR remap
ETR_RMP : OR_ETR_RMP_Field_1 := 16#0#;
-- Timer22 TI1
TI1_RMP : OR_TI1_RMP_Field_1 := 16#0#;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR_Register_2 use record
ETR_RMP at 0 range 0 .. 1;
TI1_RMP at 0 range 2 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
type TIM2_Disc is
(
Output,
Input);
-- General-purpose-timers
type TIM2_Peripheral
(Discriminent : TIM2_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register;
-- control register 2
CR2 : aliased CR2_Register;
-- slave mode control register
SMCR : aliased SMCR_Register;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register;
-- status register
SR : aliased SR_Register;
-- event generation register
EGR : aliased EGR_Register;
-- capture/compare enable register
CCER : aliased CCER_Register;
-- counter
CNT : aliased CNT_Register;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
-- capture/compare register 1
CCR1 : aliased CCR1_Register;
-- capture/compare register 2
CCR2 : aliased CCR2_Register;
-- capture/compare register 3
CCR3 : aliased CCR3_Register;
-- capture/compare register 4
CCR4 : aliased CCR4_Register;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
-- TIM2 option register
OR_k : aliased OR_Register;
case Discriminent is
when Output =>
-- capture/compare mode register 1 (output mode)
CCMR1_Output : aliased CCMR1_Output_Register;
-- capture/compare mode register 2 (output mode)
CCMR2_Output : aliased CCMR2_Output_Register;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register;
-- capture/compare mode register 2 (input mode)
CCMR2_Input : aliased CCMR2_Input_Register;
end case;
end record
with Unchecked_Union, Volatile;
for TIM2_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
SMCR at 16#8# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
CCR2 at 16#38# range 0 .. 31;
CCR3 at 16#3C# range 0 .. 31;
CCR4 at 16#40# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
OR_k at 16#50# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR2_Output at 16#1C# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
CCMR2_Input at 16#1C# range 0 .. 31;
end record;
-- General-purpose-timers
TIM2_Periph : aliased TIM2_Peripheral
with Import, Address => System'To_Address (16#40000000#);
-- General-purpose-timers
TIM3_Periph : aliased TIM2_Peripheral
with Import, Address => System'To_Address (16#40000400#);
-- Basic-timers
type TIM6_Peripheral is record
-- control register 1
CR1 : aliased CR1_Register_1;
-- control register 2
CR2 : aliased CR2_Register_1;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_1;
-- status register
SR : aliased SR_Register_1;
-- event generation register
EGR : aliased EGR_Register_1;
-- counter
CNT : aliased CNT_Register_1;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register_1;
end record
with Volatile;
for TIM6_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
end record;
-- Basic-timers
TIM6_Periph : aliased TIM6_Peripheral
with Import, Address => System'To_Address (16#40001000#);
-- Basic-timers
TIM7_Periph : aliased TIM6_Peripheral
with Import, Address => System'To_Address (16#40001400#);
type TIM21_Disc is
(
Output,
Input);
-- General-purpose-timers
type TIM21_Peripheral
(Discriminent : TIM21_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register;
-- control register 2
CR2 : aliased CR2_Register_1;
-- slave mode control register
SMCR : aliased SMCR_Register;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_2;
-- status register
SR : aliased SR_Register_2;
-- event generation register
EGR : aliased EGR_Register_2;
-- capture/compare enable register
CCER : aliased CCER_Register_1;
-- counter
CNT : aliased CNT_Register_1;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register_1;
-- capture/compare register 1
CCR1 : aliased CCR1_Register_1;
-- capture/compare register 2
CCR2 : aliased CCR2_Register_1;
-- TIM21 option register
OR_k : aliased OR_Register_1;
case Discriminent is
when Output =>
-- capture/compare mode register (output mode)
CCMR1_Output : aliased CCMR1_Output_Register_1;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register;
end case;
end record
with Unchecked_Union, Volatile;
for TIM21_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
SMCR at 16#8# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
CCR2 at 16#38# range 0 .. 31;
OR_k at 16#50# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
end record;
-- General-purpose-timers
TIM21_Periph : aliased TIM21_Peripheral
with Import, Address => System'To_Address (16#40010800#);
type TIM22_Disc is
(
Output,
Input);
-- General-purpose-timers
type TIM22_Peripheral
(Discriminent : TIM22_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register;
-- control register 2
CR2 : aliased CR2_Register_1;
-- slave mode control register
SMCR : aliased SMCR_Register;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_2;
-- status register
SR : aliased SR_Register_2;
-- event generation register
EGR : aliased EGR_Register_2;
-- capture/compare enable register
CCER : aliased CCER_Register_1;
-- counter
CNT : aliased CNT_Register_1;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register_1;
-- capture/compare register 1
CCR1 : aliased CCR1_Register_1;
-- capture/compare register 2
CCR2 : aliased CCR2_Register_1;
-- TIM22 option register
OR_k : aliased OR_Register_2;
case Discriminent is
when Output =>
-- capture/compare mode register (output mode)
CCMR1_Output : aliased CCMR1_Output_Register_1;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register;
end case;
end record
with Unchecked_Union, Volatile;
for TIM22_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
SMCR at 16#8# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
CCR2 at 16#38# range 0 .. 31;
OR_k at 16#50# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
end record;
-- General-purpose-timers
TIM22_Periph : aliased TIM22_Peripheral
with Import, Address => System'To_Address (16#40011400#);
end STM32_SVD.TIM;
| 33.822373 | 65 | 0.559792 |
ad68cae73a5b2d5f2de2691e0a84164b215b3084 | 1,472 | adb | Ada | dg_floats.adb | SMerrony/dgemua | 138b09f814c3576e45fe8d25303a6c2329999757 | [
"MIT"
] | 2 | 2021-03-26T08:25:38.000Z | 2021-06-08T03:10:12.000Z | dg_floats.adb | SMerrony/dgemua | 138b09f814c3576e45fe8d25303a6c2329999757 | [
"MIT"
] | null | null | null | dg_floats.adb | SMerrony/dgemua | 138b09f814c3576e45fe8d25303a6c2329999757 | [
"MIT"
] | null | null | null | -- MIT License
-- Copyright (c) 2021 Stephen Merrony
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
package body DG_Floats is
function Ada_Float_To_DG_Double (LF : in Long_Float) return Qword_T is
QW : Qword_T;
Bits, Sign, Exponent : Unsigned_64;
begin
if LF = 0.0 then
QW := 0;
else
Bits := 0;
end if;
return QW;
end Ada_Float_To_DG_Double;
end DG_Floats; | 38.736842 | 81 | 0.71875 |
04bba16e0ef02c45b8a0cc45e7e4d5ec1cd2a377 | 930 | adb | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/funcall_param/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/funcall_param/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/funcall_param/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
function Ident (P : Parameter) return Parameter is
begin
return P;
end Ident;
procedure Do_Nothing (P : in out Parameter) is
begin
null;
end Do_Nothing;
end Pck;
| 32.068966 | 73 | 0.71828 |
04a7a68735206796f0971d3319e846e8a3ad0235 | 1,538 | ads | Ada | src/arch/cores/armv7-m/m4-cpu-instructions.ads | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | null | null | null | src/arch/cores/armv7-m/m4-cpu-instructions.ads | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | null | null | null | src/arch/cores/armv7-m/m4-cpu-instructions.ads | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | null | null | null | --
-- 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.
--
--
package m4.cpu.instructions
with spark_mode => on
is
type t_svc_instruction is record
svc_num : unsigned_8;
opcode : unsigned_8 := 16#DF#;
end record
with size => 16;
procedure ISB
with inline;
procedure DSB
with inline;
procedure DMB
with inline;
-- Full Memory barrier (D+I)
-- Force data and instruction synchronisation barrier.
-- (privileged mode)
procedure full_memory_barrier
with inline;
procedure REV (value : in out unsigned_32)
with inline;
procedure REV16 (value : in out unsigned_32)
with inline;
procedure BKPT
with inline;
procedure WFI
with inline;
procedure wait_for_interrupt renames WFI;
end m4.cpu.instructions;
| 23.661538 | 79 | 0.674902 |
2ea9991ac142efc50cbfad3e5a614a3dcdcc8a43 | 375 | ada | Ada | Task/Reverse-a-string/Ada/reverse-a-string.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Reverse-a-string/Ada/reverse-a-string.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Reverse-a-string/Ada/reverse-a-string.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Text_IO; use Ada.Text_IO;
procedure Reverse_String is
function Reverse_It (Item : String) return String is
Result : String (Item'Range);
begin
for I in Item'range loop
Result (Result'Last - I + Item'First) := Item (I);
end loop;
return Result;
end Reverse_It;
begin
Put_Line (Reverse_It (Get_Line));
end Reverse_String;
| 25 | 59 | 0.666667 |
Subsets and Splits