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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5ef268044c5ec507f91592f9d0f46e4fff134342 | 5,231 | adb | Ada | aoc2018/src/day02.adb | YoannDupont/advent_of_code_2018 | 031f87cb3fec52d444cf3731ee8c2247a366cb12 | [
"MIT"
] | null | null | null | aoc2018/src/day02.adb | YoannDupont/advent_of_code_2018 | 031f87cb3fec52d444cf3731ee8c2247a366cb12 | [
"MIT"
] | null | null | null | aoc2018/src/day02.adb | YoannDupont/advent_of_code_2018 | 031f87cb3fec52d444cf3731ee8c2247a366cb12 | [
"MIT"
] | null | null | null | --------------------------------------------------------------------------------
-- An Ada implementation of the Advent Of Code 2018 --
-- --
-- Day 2: Inventory Management System --
-- --
-- The following is an MCW example (outside of data) for day 2 of AOC 2018. --
-- See: <https://adventofcode.com/2018> for the whole event. --
--------------------------------------------------------------------------------
with Ada.Text_IO;
with Ada.Strings.Unbounded;
procedure Day02 is
package ASU renames Ada.Strings.Unbounded;
-- for convenience purpose
type US_Array is array(Positive range <>) of ASU.Unbounded_String;
-- The IDs in the input data are all the same length, so we could use a
-- fixed-length String array, but it would not be very generic, and it would
-- not be suited for examples either.
type Natural_Couple is array(1..2) of Natural;
-- This data structure will be used to store two things:
-- * IDs that have exactly 2 of any letter and exactly 3 of any letter;
-- * the absolute count of IDs for the previous item.
-- I could/should use a record for that, but meh, later maybe.
type Character_Count is array(Character range 'a' .. 'z') of Natural;
-- An array indexed on characters that will be used to count occurrences.
-- This is not very generic (cough), but it will do for the input.
-- Creates the "String" array from the file name
function Read_Input(file_name : in String) return US_Array is
-- Tail-call recursion to create the final array.
function Read_Input_Rec(input : in Ada.Text_IO.File_Type; acc : in US_Array) return US_Array is
begin
if Ada.Text_IO.End_Of_File(input) then
return acc;
else
return Read_Input_Rec
(
input,
acc & (1 => ASU.To_Unbounded_String(Ada.Text_IO.Get_Line(input)))
);
end if;
end Read_Input_Rec;
F : Ada.Text_IO.File_Type;
acc : US_Array(1 .. 0);
begin
Ada.Text_IO.Open
(
File => F,
Mode => Ada.Text_IO.In_File,
Name => file_name
);
declare
result : US_Array := Read_Input_Rec(F, acc);
begin
Ada.Text_IO.Close(F);
return result;
end;
end Read_Input;
-- the number that have an ID containing exactly two of any letter and then
-- separately counting those with exactly three of any letter.
-- You can multiply those two counts together to get a rudimentary checksum.
function Checksum(nc : Natural_Couple) return Natural is
begin
return nc(1) * nc(2);
end Checksum;
function Common_Part(left, right : in String) return String is
function Common_Part_Rec(li, ri : in Positive; acc : in String) return String is
begin
if li > left'Last then
return acc;
else
return Common_Part_Rec
(
li+1,
ri+1,
acc & (if left(li) = right(ri) then (1 => left(li)) else "")
);
end if;
end Common_Part_Rec;
begin
return Common_Part_Rec(left'First, right'First, "");
end Common_Part;
function Part_1(input : in US_Array) return Natural is
total_count : Natural_Couple := (0, 0);
begin
for ID of input loop
declare
counts : Character_Count := (others => 0);
current_count : Natural_Couple := (0, 0);
begin
for C of ASU.To_String(ID) loop
counts(C) := counts(C) + 1;
end loop;
for count of counts loop
if count = 2 then
current_count(1) := 1;
elsif count = 3 then
current_count(2) := 1;
end if;
exit when current_count = (1, 1);
end loop;
total_count(1) := total_count(1) + current_count(1);
total_count(2) := total_count(2) + current_count(2);
end;
end loop;
return Checksum(total_count);
end Part_1;
function Part_2(input : in US_Array) return String is
begin
for I in input'Range loop
for J in I+1 .. input'Last loop
declare
common : constant String := Common_Part
(
ASU.To_String(input(I)),
ASU.To_String(input(J))
);
begin
if common'Length = ASU.Length(input(I)) - 1 then
return common;
end if;
end;
end loop;
end loop;
return "";
end Part_2;
input : constant US_Array := Read_Input("input/day02.txt");
begin
Ada.Text_IO.Put_Line("What is the checksum for your list of box IDs?");
Ada.Text_IO.Put_Line(Natural'Image(Part_1(input)));
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line("What letters are common between the two correct box IDs?");
Ada.Text_IO.Put_Line(Part_2(input));
end Day02;
| 35.828767 | 101 | 0.545211 |
190701388d350b5b7f1bd7023e1ae8195003c0f7 | 471 | ads | Ada | source/vampire-r3-message_page.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | 1 | 2016-12-19T13:25:14.000Z | 2016-12-19T13:25:14.000Z | source/vampire-r3-message_page.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | null | null | null | source/vampire-r3-message_page.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | null | null | null | -- The Village of Vampire by YT, このソースコードはNYSLです
procedure Vampire.R3.Message_Page (
Output : not null access Ada.Streams.Root_Stream_Type'Class;
Form : in Forms.Root_Form_Type'Class;
Template : in String;
Base_Page : in Forms.Base_Page;
Village_Id : in Tabula.Villages.Village_Id :=
Tabula.Villages.Invalid_Village_Id;
Village : access constant Tabula.Villages.Village_Type'Class := null;
Message : in String;
User_Id : in String;
User_Password : in String);
| 36.230769 | 70 | 0.772824 |
19b9f8e6f0430dfb156ae4c97477fc70ea5e6671 | 11,984 | ads | Ada | extern/gnat_sdl/gnat_sdl2/src/mmintrin_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 15 | 2020-10-07T08:56:45.000Z | 2022-02-08T23:13:22.000Z | extern/gnat_sdl/gnat_sdl2/src/mmintrin_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 20 | 2020-11-05T14:35:20.000Z | 2022-01-13T15:59:33.000Z | extern/gnat_sdl/gnat_sdl2/src/mmintrin_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 6 | 2020-10-08T15:57:06.000Z | 2021-08-31T12:03:08.000Z | pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
package mmintrin_h is
-- Copyright (C) 2002-2017 Free Software Foundation, Inc.
-- This file is part of GCC.
-- GCC 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, or (at your option)
-- any later version.
-- GCC 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.
-- 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/>.
-- Implemented from the specification included in the Intel C++ Compiler
-- User Guide and Reference, version 9.0.
-- The Intel API is flexible enough that we must allow aliasing with other
-- vector types, and their scalar components.
subtype uu_m64 is <vector>; -- d:\install\gpl2018\lib\gcc\x86_64-pc-mingw32\7.3.1\include\mmintrin.h:42
-- Unaligned version of the same type
subtype uu_m64_u is <vector>; -- d:\install\gpl2018\lib\gcc\x86_64-pc-mingw32\7.3.1\include\mmintrin.h:45
-- Internal data types for implementing the intrinsics.
subtype uu_v2si is <vector>; -- d:\install\gpl2018\lib\gcc\x86_64-pc-mingw32\7.3.1\include\mmintrin.h:48
subtype uu_v4hi is <vector>; -- d:\install\gpl2018\lib\gcc\x86_64-pc-mingw32\7.3.1\include\mmintrin.h:49
subtype uu_v8qi is <vector>; -- d:\install\gpl2018\lib\gcc\x86_64-pc-mingw32\7.3.1\include\mmintrin.h:50
subtype uu_v1di is <vector>; -- d:\install\gpl2018\lib\gcc\x86_64-pc-mingw32\7.3.1\include\mmintrin.h:51
subtype uu_v2sf is <vector>; -- d:\install\gpl2018\lib\gcc\x86_64-pc-mingw32\7.3.1\include\mmintrin.h:52
-- Empty the multimedia state.
-- skipped func _mm_empty
-- skipped func _m_empty
-- Convert I to a __m64 object. The integer is zero-extended to 64-bits.
-- skipped func _mm_cvtsi32_si64
-- skipped func _m_from_int
-- Convert I to a __m64 object.
-- Intel intrinsic.
-- skipped func _m_from_int64
-- skipped func _mm_cvtsi64_m64
-- Microsoft intrinsic.
-- skipped func _mm_cvtsi64x_si64
-- skipped func _mm_set_pi64x
-- Convert the lower 32 bits of the __m64 object into an integer.
-- skipped func _mm_cvtsi64_si32
-- skipped func _m_to_int
-- Convert the __m64 object to a 64bit integer.
-- Intel intrinsic.
-- skipped func _m_to_int64
-- skipped func _mm_cvtm64_si64
-- Microsoft intrinsic.
-- skipped func _mm_cvtsi64_si64x
-- Pack the four 16-bit values from M1 into the lower four 8-bit values of
-- the result, and the four 16-bit values from M2 into the upper four 8-bit
-- values of the result, all with signed saturation.
-- skipped func _mm_packs_pi16
-- skipped func _m_packsswb
-- Pack the two 32-bit values from M1 in to the lower two 16-bit values of
-- the result, and the two 32-bit values from M2 into the upper two 16-bit
-- values of the result, all with signed saturation.
-- skipped func _mm_packs_pi32
-- skipped func _m_packssdw
-- Pack the four 16-bit values from M1 into the lower four 8-bit values of
-- the result, and the four 16-bit values from M2 into the upper four 8-bit
-- values of the result, all with unsigned saturation.
-- skipped func _mm_packs_pu16
-- skipped func _m_packuswb
-- Interleave the four 8-bit values from the high half of M1 with the four
-- 8-bit values from the high half of M2.
-- skipped func _mm_unpackhi_pi8
-- skipped func _m_punpckhbw
-- Interleave the two 16-bit values from the high half of M1 with the two
-- 16-bit values from the high half of M2.
-- skipped func _mm_unpackhi_pi16
-- skipped func _m_punpckhwd
-- Interleave the 32-bit value from the high half of M1 with the 32-bit
-- value from the high half of M2.
-- skipped func _mm_unpackhi_pi32
-- skipped func _m_punpckhdq
-- Interleave the four 8-bit values from the low half of M1 with the four
-- 8-bit values from the low half of M2.
-- skipped func _mm_unpacklo_pi8
-- skipped func _m_punpcklbw
-- Interleave the two 16-bit values from the low half of M1 with the two
-- 16-bit values from the low half of M2.
-- skipped func _mm_unpacklo_pi16
-- skipped func _m_punpcklwd
-- Interleave the 32-bit value from the low half of M1 with the 32-bit
-- value from the low half of M2.
-- skipped func _mm_unpacklo_pi32
-- skipped func _m_punpckldq
-- Add the 8-bit values in M1 to the 8-bit values in M2.
-- skipped func _mm_add_pi8
-- skipped func _m_paddb
-- Add the 16-bit values in M1 to the 16-bit values in M2.
-- skipped func _mm_add_pi16
-- skipped func _m_paddw
-- Add the 32-bit values in M1 to the 32-bit values in M2.
-- skipped func _mm_add_pi32
-- skipped func _m_paddd
-- Add the 64-bit values in M1 to the 64-bit values in M2.
-- skipped func _mm_add_si64
-- Add the 8-bit values in M1 to the 8-bit values in M2 using signed
-- saturated arithmetic.
-- skipped func _mm_adds_pi8
-- skipped func _m_paddsb
-- Add the 16-bit values in M1 to the 16-bit values in M2 using signed
-- saturated arithmetic.
-- skipped func _mm_adds_pi16
-- skipped func _m_paddsw
-- Add the 8-bit values in M1 to the 8-bit values in M2 using unsigned
-- saturated arithmetic.
-- skipped func _mm_adds_pu8
-- skipped func _m_paddusb
-- Add the 16-bit values in M1 to the 16-bit values in M2 using unsigned
-- saturated arithmetic.
-- skipped func _mm_adds_pu16
-- skipped func _m_paddusw
-- Subtract the 8-bit values in M2 from the 8-bit values in M1.
-- skipped func _mm_sub_pi8
-- skipped func _m_psubb
-- Subtract the 16-bit values in M2 from the 16-bit values in M1.
-- skipped func _mm_sub_pi16
-- skipped func _m_psubw
-- Subtract the 32-bit values in M2 from the 32-bit values in M1.
-- skipped func _mm_sub_pi32
-- skipped func _m_psubd
-- Add the 64-bit values in M1 to the 64-bit values in M2.
-- skipped func _mm_sub_si64
-- Subtract the 8-bit values in M2 from the 8-bit values in M1 using signed
-- saturating arithmetic.
-- skipped func _mm_subs_pi8
-- skipped func _m_psubsb
-- Subtract the 16-bit values in M2 from the 16-bit values in M1 using
-- signed saturating arithmetic.
-- skipped func _mm_subs_pi16
-- skipped func _m_psubsw
-- Subtract the 8-bit values in M2 from the 8-bit values in M1 using
-- unsigned saturating arithmetic.
-- skipped func _mm_subs_pu8
-- skipped func _m_psubusb
-- Subtract the 16-bit values in M2 from the 16-bit values in M1 using
-- unsigned saturating arithmetic.
-- skipped func _mm_subs_pu16
-- skipped func _m_psubusw
-- Multiply four 16-bit values in M1 by four 16-bit values in M2 producing
-- four 32-bit intermediate results, which are then summed by pairs to
-- produce two 32-bit results.
-- skipped func _mm_madd_pi16
-- skipped func _m_pmaddwd
-- Multiply four signed 16-bit values in M1 by four signed 16-bit values in
-- M2 and produce the high 16 bits of the 32-bit results.
-- skipped func _mm_mulhi_pi16
-- skipped func _m_pmulhw
-- Multiply four 16-bit values in M1 by four 16-bit values in M2 and produce
-- the low 16 bits of the results.
-- skipped func _mm_mullo_pi16
-- skipped func _m_pmullw
-- Shift four 16-bit values in M left by COUNT.
-- skipped func _mm_sll_pi16
-- skipped func _m_psllw
-- skipped func _mm_slli_pi16
-- skipped func _m_psllwi
-- Shift two 32-bit values in M left by COUNT.
-- skipped func _mm_sll_pi32
-- skipped func _m_pslld
-- skipped func _mm_slli_pi32
-- skipped func _m_pslldi
-- Shift the 64-bit value in M left by COUNT.
-- skipped func _mm_sll_si64
-- skipped func _m_psllq
-- skipped func _mm_slli_si64
-- skipped func _m_psllqi
-- Shift four 16-bit values in M right by COUNT; shift in the sign bit.
-- skipped func _mm_sra_pi16
-- skipped func _m_psraw
-- skipped func _mm_srai_pi16
-- skipped func _m_psrawi
-- Shift two 32-bit values in M right by COUNT; shift in the sign bit.
-- skipped func _mm_sra_pi32
-- skipped func _m_psrad
-- skipped func _mm_srai_pi32
-- skipped func _m_psradi
-- Shift four 16-bit values in M right by COUNT; shift in zeros.
-- skipped func _mm_srl_pi16
-- skipped func _m_psrlw
-- skipped func _mm_srli_pi16
-- skipped func _m_psrlwi
-- Shift two 32-bit values in M right by COUNT; shift in zeros.
-- skipped func _mm_srl_pi32
-- skipped func _m_psrld
-- skipped func _mm_srli_pi32
-- skipped func _m_psrldi
-- Shift the 64-bit value in M left by COUNT; shift in zeros.
-- skipped func _mm_srl_si64
-- skipped func _m_psrlq
-- skipped func _mm_srli_si64
-- skipped func _m_psrlqi
-- Bit-wise AND the 64-bit values in M1 and M2.
-- skipped func _mm_and_si64
-- skipped func _m_pand
-- Bit-wise complement the 64-bit value in M1 and bit-wise AND it with the
-- 64-bit value in M2.
-- skipped func _mm_andnot_si64
-- skipped func _m_pandn
-- Bit-wise inclusive OR the 64-bit values in M1 and M2.
-- skipped func _mm_or_si64
-- skipped func _m_por
-- Bit-wise exclusive OR the 64-bit values in M1 and M2.
-- skipped func _mm_xor_si64
-- skipped func _m_pxor
-- Compare eight 8-bit values. The result of the comparison is 0xFF if the
-- test is true and zero if false.
-- skipped func _mm_cmpeq_pi8
-- skipped func _m_pcmpeqb
-- skipped func _mm_cmpgt_pi8
-- skipped func _m_pcmpgtb
-- Compare four 16-bit values. The result of the comparison is 0xFFFF if
-- the test is true and zero if false.
-- skipped func _mm_cmpeq_pi16
-- skipped func _m_pcmpeqw
-- skipped func _mm_cmpgt_pi16
-- skipped func _m_pcmpgtw
-- Compare two 32-bit values. The result of the comparison is 0xFFFFFFFF if
-- the test is true and zero if false.
-- skipped func _mm_cmpeq_pi32
-- skipped func _m_pcmpeqd
-- skipped func _mm_cmpgt_pi32
-- skipped func _m_pcmpgtd
-- Creates a 64-bit zero.
-- skipped func _mm_setzero_si64
-- Creates a vector of two 32-bit values; I0 is least significant.
-- skipped func _mm_set_pi32
-- Creates a vector of four 16-bit values; W0 is least significant.
-- skipped func _mm_set_pi16
-- Creates a vector of eight 8-bit values; B0 is least significant.
-- skipped func _mm_set_pi8
-- Similar, but with the arguments in reverse order.
-- skipped func _mm_setr_pi32
-- skipped func _mm_setr_pi16
-- skipped func _mm_setr_pi8
-- Creates a vector of two 32-bit values, both elements containing I.
-- skipped func _mm_set1_pi32
-- Creates a vector of four 16-bit values, all elements containing W.
-- skipped func _mm_set1_pi16
-- Creates a vector of eight 8-bit values, all elements containing B.
-- skipped func _mm_set1_pi8
end mmintrin_h;
| 28.601432 | 109 | 0.681492 |
5e0de79c227dc2ea544e464e03d61aa03a5f179e | 16,476 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-convec.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-convec.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-convec.ads | 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 . V E C T O R S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2015, 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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Iterator_Interfaces;
with Ada.Containers.Helpers;
private with Ada.Finalization;
private with Ada.Streams;
generic
type Index_Type is range <>;
type Element_Type is private;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Vectors is
pragma Annotate (CodePeer, Skip_Analysis);
pragma Preelaborate;
pragma Remote_Types;
subtype Extended_Index is Index_Type'Base
range Index_Type'First - 1 ..
Index_Type'Min (Index_Type'Base'Last - 1, Index_Type'Last) + 1;
No_Index : constant Extended_Index := Extended_Index'First;
type Vector is tagged private
with
Constant_Indexing => Constant_Reference,
Variable_Indexing => Reference,
Default_Iterator => Iterate,
Iterator_Element => Element_Type;
pragma Preelaborable_Initialization (Vector);
type Cursor is private;
pragma Preelaborable_Initialization (Cursor);
No_Element : constant Cursor;
function Has_Element (Position : Cursor) return Boolean;
package Vector_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
Empty_Vector : constant Vector;
overriding function "=" (Left, Right : Vector) return Boolean;
function To_Vector (Length : Count_Type) return Vector;
function To_Vector
(New_Item : Element_Type;
Length : Count_Type) return Vector;
function "&" (Left, Right : Vector) return Vector;
function "&" (Left : Vector; Right : Element_Type) return Vector;
function "&" (Left : Element_Type; Right : Vector) return Vector;
function "&" (Left, Right : Element_Type) return Vector;
function Capacity (Container : Vector) return Count_Type;
procedure Reserve_Capacity
(Container : in out Vector;
Capacity : Count_Type);
function Length (Container : Vector) return Count_Type;
procedure Set_Length
(Container : in out Vector;
Length : Count_Type);
function Is_Empty (Container : Vector) return Boolean;
procedure Clear (Container : in out Vector);
function To_Cursor
(Container : Vector;
Index : Extended_Index) return Cursor;
function To_Index (Position : Cursor) return Extended_Index;
function Element
(Container : Vector;
Index : Index_Type) return Element_Type;
function Element (Position : Cursor) return Element_Type;
procedure Replace_Element
(Container : in out Vector;
Index : Index_Type;
New_Item : Element_Type);
procedure Replace_Element
(Container : in out Vector;
Position : Cursor;
New_Item : Element_Type);
procedure Query_Element
(Container : Vector;
Index : Index_Type;
Process : not null access procedure (Element : Element_Type));
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
procedure Update_Element
(Container : in out Vector;
Index : Index_Type;
Process : not null access procedure (Element : in out Element_Type));
procedure Update_Element
(Container : in out Vector;
Position : Cursor;
Process : not null access procedure (Element : in out Element_Type));
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
private
with
Implicit_Dereference => Element;
type Reference_Type (Element : not null access Element_Type) is private
with
Implicit_Dereference => Element;
function Constant_Reference
(Container : aliased Vector;
Position : Cursor) return Constant_Reference_Type;
pragma Inline (Constant_Reference);
function Reference
(Container : aliased in out Vector;
Position : Cursor) return Reference_Type;
pragma Inline (Reference);
function Constant_Reference
(Container : aliased Vector;
Index : Index_Type) return Constant_Reference_Type;
pragma Inline (Constant_Reference);
function Reference
(Container : aliased in out Vector;
Index : Index_Type) return Reference_Type;
pragma Inline (Reference);
procedure Assign (Target : in out Vector; Source : Vector);
function Copy (Source : Vector; Capacity : Count_Type := 0) return Vector;
procedure Move (Target : in out Vector; Source : in out Vector);
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Vector);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Vector);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Vector;
Position : out Cursor);
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Element_Type;
Position : out Cursor;
Count : Count_Type := 1);
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
Count : Count_Type := 1);
procedure Insert
(Container : in out Vector;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1);
procedure Prepend
(Container : in out Vector;
New_Item : Vector);
procedure Prepend
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Append
(Container : in out Vector;
New_Item : Vector);
procedure Append
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Insert_Space
(Container : in out Vector;
Before : Extended_Index;
Count : Count_Type := 1);
procedure Insert_Space
(Container : in out Vector;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1);
procedure Delete
(Container : in out Vector;
Index : Extended_Index;
Count : Count_Type := 1);
procedure Delete
(Container : in out Vector;
Position : in out Cursor;
Count : Count_Type := 1);
procedure Delete_First
(Container : in out Vector;
Count : Count_Type := 1);
procedure Delete_Last
(Container : in out Vector;
Count : Count_Type := 1);
procedure Reverse_Elements (Container : in out Vector);
procedure Swap (Container : in out Vector; I, J : Index_Type);
procedure Swap (Container : in out Vector; I, J : Cursor);
function First_Index (Container : Vector) return Index_Type;
function First (Container : Vector) return Cursor;
function First_Element (Container : Vector) return Element_Type;
function Last_Index (Container : Vector) return Extended_Index;
function Last (Container : Vector) return Cursor;
function Last_Element (Container : Vector) return Element_Type;
function Next (Position : Cursor) return Cursor;
procedure Next (Position : in out Cursor);
function Previous (Position : Cursor) return Cursor;
procedure Previous (Position : in out Cursor);
function Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'First) return Extended_Index;
function Find
(Container : Vector;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor;
function Reverse_Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'Last) return Extended_Index;
function Reverse_Find
(Container : Vector;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor;
function Contains
(Container : Vector;
Item : Element_Type) return Boolean;
procedure Iterate
(Container : Vector;
Process : not null access procedure (Position : Cursor));
procedure Reverse_Iterate
(Container : Vector;
Process : not null access procedure (Position : Cursor));
function Iterate (Container : Vector)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class;
function Iterate (Container : Vector; Start : Cursor)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class;
generic
with function "<" (Left, Right : Element_Type) return Boolean is <>;
package Generic_Sorting is
function Is_Sorted (Container : Vector) return Boolean;
procedure Sort (Container : in out Vector);
procedure Merge (Target : in out Vector; Source : in out Vector);
end Generic_Sorting;
private
pragma Inline (Append);
pragma Inline (First_Index);
pragma Inline (Last_Index);
pragma Inline (Element);
pragma Inline (First_Element);
pragma Inline (Last_Element);
pragma Inline (Query_Element);
pragma Inline (Update_Element);
pragma Inline (Replace_Element);
pragma Inline (Is_Empty);
pragma Inline (Contains);
pragma Inline (Next);
pragma Inline (Previous);
use Ada.Containers.Helpers;
package Implementation is new Generic_Implementation;
use Implementation;
type Elements_Array is array (Index_Type range <>) of aliased Element_Type;
function "=" (L, R : Elements_Array) return Boolean is abstract;
type Elements_Type (Last : Extended_Index) is limited record
EA : Elements_Array (Index_Type'First .. Last);
end record;
type Elements_Access is access all Elements_Type;
use Finalization;
use Streams;
type Vector is new Controlled with record
Elements : Elements_Access := null;
Last : Extended_Index := No_Index;
TC : aliased Tamper_Counts;
end record;
overriding procedure Adjust (Container : in out Vector);
overriding procedure Finalize (Container : in out Vector);
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Vector);
for Vector'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Vector);
for Vector'Read use Read;
type Vector_Access is access all Vector;
for Vector_Access'Storage_Size use 0;
type Cursor is record
Container : Vector_Access;
Index : Index_Type := Index_Type'First;
end record;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Position : out Cursor);
for Cursor'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Position : Cursor);
for Cursor'Write use Write;
subtype Reference_Control_Type is Implementation.Reference_Control_Type;
-- It is necessary to rename this here, so that the compiler can find it
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type);
for Constant_Reference_Type'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type);
for Constant_Reference_Type'Read use Read;
type Reference_Type
(Element : not null access Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type);
for Reference_Type'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type);
for Reference_Type'Read use Read;
-- Three operations are used to optimize in the expansion of "for ... of"
-- loops: the Next(Cursor) procedure in the visible part, and the following
-- Pseudo_Reference and Get_Element_Access functions. See Exp_Ch5 for
-- details.
function Pseudo_Reference
(Container : aliased Vector'Class) return Reference_Control_Type;
pragma Inline (Pseudo_Reference);
-- Creates an object of type Reference_Control_Type pointing to the
-- container, and increments the Lock. Finalization of this object will
-- decrement the Lock.
type Element_Access is access all Element_Type;
function Get_Element_Access
(Position : Cursor) return not null Element_Access;
-- Returns a pointer to the element designated by Position.
No_Element : constant Cursor := Cursor'(null, Index_Type'First);
Empty_Vector : constant Vector := (Controlled with others => <>);
type Iterator is new Limited_Controlled and
Vector_Iterator_Interfaces.Reversible_Iterator with
record
Container : Vector_Access;
Index : Index_Type'Base;
end record
with Disable_Controlled => not T_Check;
overriding procedure Finalize (Object : in out Iterator);
overriding function First (Object : Iterator) return Cursor;
overriding function Last (Object : Iterator) return Cursor;
overriding function Next
(Object : Iterator;
Position : Cursor) return Cursor;
overriding function Previous
(Object : Iterator;
Position : Cursor) return Cursor;
end Ada.Containers.Vectors;
| 31.745665 | 79 | 0.635288 |
3835b5e21f74fd4eb409599a6b5a2ca8a16b9ac3 | 3,156 | ads | Ada | source/base/incr-nodes-ultra_roots.ads | reznikmm/increment | 0edff267d468f005f28b5d2c0c0fe23f4ff3164c | [
"MIT"
] | 5 | 2017-10-20T08:40:59.000Z | 2021-05-15T16:55:39.000Z | source/base/incr-nodes-ultra_roots.ads | reznikmm/increment | 0edff267d468f005f28b5d2c0c0fe23f4ff3164c | [
"MIT"
] | null | null | null | source/base/incr-nodes-ultra_roots.ads | reznikmm/increment | 0edff267d468f005f28b5d2c0c0fe23f4ff3164c | [
"MIT"
] | null | null | null | -- Copyright (c) 2015-2017 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Incr.Nodes.Tokens;
package Incr.Nodes.Ultra_Roots is
-- @summary
-- Ultra_Root nodes of parse trees
--
-- @description
-- This package provides implementation of ultra_root nodes
type Ultra_Root is new Node with private;
type Ultra_Root_Access is access all Ultra_Root'Class;
package Constructors is
procedure Initialize
(Self : out Ultra_Root'Class;
Root : Nodes.Node_Access);
end Constructors;
private
type Versioned_Node_Array is array (Positive range <>) of
Versioned_Nodes.Container;
type Ultra_Root is new Node with record
BOS : Nodes.Tokens.Token_Access;
Root : Versioned_Nodes.Container;
EOS : Nodes.Tokens.Token_Access;
end record;
overriding function Is_Token (Self : Ultra_Root) return Boolean;
overriding function Arity (Self : Ultra_Root) return Natural;
overriding function Kind (Self : Ultra_Root) return Node_Kind;
overriding function Child
(Self : Ultra_Root;
Index : Positive;
Time : Version_Trees.Version) return Node_Access;
overriding procedure Set_Child
(Self : aliased in out Ultra_Root;
Index : Positive;
Value : Node_Access);
overriding function Nested_Changes
(Self : Ultra_Root;
From : Version_Trees.Version;
To : Version_Trees.Version) return Boolean;
overriding function Parent
(Self : Ultra_Root;
Time : Version_Trees.Version) return Node_Access;
overriding procedure Set_Parent
(Self : in out Ultra_Root;
Value : Node_Access) is null;
overriding function Exists
(Self : Ultra_Root;
Time : Version_Trees.Version) return Boolean;
overriding function Get_Flag
(Self : Ultra_Root;
Flag : Transient_Flags) return Boolean;
overriding procedure Set_Flag
(Self : in out Ultra_Root;
Flag : Transient_Flags;
Value : Boolean := True) is null;
overriding procedure On_Commit
(Self : in out Ultra_Root;
Parent : Node_Access);
overriding procedure On_Nested_Changes
(Self : in out Ultra_Root;
Diff : Integer) is null;
overriding function Span
(Self : aliased in out Ultra_Root;
Kind : Span_Kinds;
Time : Version_Trees.Version) return Natural;
overriding procedure Discard (Self : in out Ultra_Root);
overriding procedure Discard_Parent (Self : in out Ultra_Root) is null;
overriding function Local_Changes
(Self : Ultra_Root;
From : Version_Trees.Version;
To : Version_Trees.Version) return Boolean;
overriding function Nested_Errors
(Self : Ultra_Root;
Time : Version_Trees.Version) return Boolean;
overriding function Local_Errors
(Self : Ultra_Root;
Unused : Version_Trees.Version) return Boolean is (False);
overriding procedure Set_Local_Errors
(Self : in out Ultra_Root;
Value : Boolean := True) is null;
end Incr.Nodes.Ultra_Roots;
| 27.929204 | 74 | 0.678074 |
a04dcbb0856bf10f9b1c18bb6a2bf7cb54126339 | 658 | ads | Ada | shared_data.ads | oysteinlondal/Inverted-Pendulum | 0a59e8d7bea31a255c1ca27c97430a688421f787 | [
"MIT"
] | null | null | null | shared_data.ads | oysteinlondal/Inverted-Pendulum | 0a59e8d7bea31a255c1ca27c97430a688421f787 | [
"MIT"
] | 2 | 2020-11-16T12:35:26.000Z | 2020-11-16T12:35:31.000Z | shared_data.ads | oysteinlondal/Inverted-Pendulum | 0a59e8d7bea31a255c1ca27c97430a688421f787 | [
"MIT"
] | null | null | null | with Type_Lib; use Type_Lib;
package Shared_Data is
protected type Sensor_Reading is
procedure Set (Meassured_Value : in Float);
entry Get (Value : out Float);
private
Updated : Boolean := False;
Current_Value : Float;
end Sensor_Reading;
protected type Actuator_Write is
procedure Set (Calculated_Value : in RPM; Motor : in Motor_Direction);
entry Get (Value : out RPM; Motor : out Motor_Direction);
private
Updated : Boolean := False;
Current_Value : RPM;
Current_Motor : Motor_Direction;
end Actuator_Write;
end Shared_Data; | 29.909091 | 78 | 0.630699 |
19f9d1ca660b430251d185263fbbe3627f799c18 | 1,370 | ads | Ada | src/ada-core/src/linted-reader.ads | mstewartgallus/linted | 4d4cf9390353ea045b95671474ab278456793a35 | [
"Apache-2.0"
] | null | null | null | src/ada-core/src/linted-reader.ads | mstewartgallus/linted | 4d4cf9390353ea045b95671474ab278456793a35 | [
"Apache-2.0"
] | null | null | null | src/ada-core/src/linted-reader.ads | mstewartgallus/linted | 4d4cf9390353ea045b95671474ab278456793a35 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2015,2016,2017 Steven Stewart-Gallus
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-- implied. See the License for the specific language governing
-- permissions and limitations under the License.
with Interfaces.C;
with System;
with Linted.IO_Pool;
with Linted.KOs;
with Linted.Triggers;
package Linted.Reader is
subtype Event is Linted.IO_Pool.Reader_Event;
subtype Future is Linted.IO_Pool.Read_Future;
function Future_Is_Live
(F : Future) return Boolean renames
IO_Pool.Read_Future_Is_Live;
procedure Read
(Object : KOs.KO;
Buf : System.Address;
Count : Interfaces.C.size_t;
Signaller : Triggers.Signaller;
F : out Future) renames
IO_Pool.Read;
procedure Read_Wait
(F : in out Future;
E : out Event) renames
IO_Pool.Read_Wait;
procedure Read_Poll
(F : in out Future;
E : out Event;
Init : out Boolean) renames
IO_Pool.Read_Poll;
end Linted.Reader;
| 28.541667 | 70 | 0.709489 |
a0114b89867ad2cbe5524cd3cab7d6d5640b2ea7 | 407,495 | adb | Ada | Acceleration/memcached/hls/memcachedPipeline_prj/solution1/.autopilot/db/ht_outputLogic.bind.adb | pratik0509/HLSx_Xilinx_edit | 14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca | [
"BSD-3-Clause"
] | null | null | null | Acceleration/memcached/hls/memcachedPipeline_prj/solution1/.autopilot/db/ht_outputLogic.bind.adb | pratik0509/HLSx_Xilinx_edit | 14bdbcdb3107aa225e46a0bfe7d4a2a426e9e1ca | [
"BSD-3-Clause"
] | null | null | null | Acceleration/memcached/hls/memcachedPipeline_prj/solution1/.autopilot/db/ht_outputLogic.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>ht_outputLogic</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>4</id>
<name>memWr2out_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>57</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>5</id>
<name>hashMdBuffer_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>128</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>hashKeyBuffer_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>64</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="_4">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>hashValueBuffer_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>64</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="_5">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>hashTable2Dram_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>256</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>134</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>olState_load</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>167</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>167</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>187</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>17</id>
<name>ol_keyLength_V_load</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>215</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>188</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>18</id>
<name>ol_valueLength_V_loa</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>215</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>189</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>19</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>167</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>167</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>8</count>
<item_version>0</item_version>
<item>190</item>
<item>191</item>
<item>193</item>
<item>194</item>
<item>196</item>
<item>197</item>
<item>199</item>
<item>200</item>
</oprand_edges>
<opcode>switch</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="_10">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>tmp_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>242</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>242</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>477</item>
<item>478</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="_11">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>242</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>242</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>479</item>
<item>480</item>
<item>481</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="_12">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>tmp_346</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>242</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>242</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>482</item>
<item>483</item>
<item>484</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="_13">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>242</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>242</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>485</item>
<item>486</item>
<item>487</item>
</oprand_edges>
<opcode>br</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="_14">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>tmp_136_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>242</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>242</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>488</item>
<item>489</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.18</m_delay>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>242</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>242</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>490</item>
<item>491</item>
<item>492</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>30</id>
<name>tmp_351</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>242</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>242</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>493</item>
<item>494</item>
<item>495</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="_17">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>242</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>242</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>496</item>
<item>497</item>
<item>498</item>
</oprand_edges>
<opcode>br</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="_18">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>243</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>499</item>
<item>500</item>
<item>501</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp_V_34</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>244</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>244</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>502</item>
<item>503</item>
<item>855</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="_20">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp_139_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>247</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>247</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>504</item>
<item>505</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="_21">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>tmp_140_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>247</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>247</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>506</item>
<item>507</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="_22">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp_210_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>247</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>247</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>508</item>
<item>509</item>
<item>510</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.37</m_delay>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>248</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>248</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>511</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_keyValid_V_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.keyValid.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>512</item>
<item>513</item>
<item>514</item>
<item>515</item>
</oprand_edges>
<opcode>phi</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="_25">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>ol_keyLength_V_load_1</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>215</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>516</item>
<item>517</item>
<item>518</item>
<item>519</item>
</oprand_edges>
<opcode>phi</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="_26">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp_key_V_7</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>keyWord.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>520</item>
<item>521</item>
<item>522</item>
<item>523</item>
</oprand_edges>
<opcode>phi</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="_27">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>249</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>249</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>524</item>
<item>525</item>
<item>526</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_V_35</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>250</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>250</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>527</item>
<item>528</item>
<item>856</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="_29">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>tmp_145_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>253</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>253</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>529</item>
<item>530</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.18</m_delay>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>tmp_146_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>253</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>253</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>531</item>
<item>532</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.30</m_delay>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>tmp_220_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>253</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>253</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>533</item>
<item>534</item>
<item>535</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.47</m_delay>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>253</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</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>536</item>
<item>537</item>
<item>849</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>254</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>254</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>538</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>tmp_151_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>253</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>253</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>539</item>
<item>540</item>
<item>541</item>
<item>542</item>
</oprand_edges>
<opcode>phi</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>54</id>
<name>tmp_value_V_4</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>valueWord.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>543</item>
<item>544</item>
<item>545</item>
<item>546</item>
</oprand_edges>
<opcode>phi</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="_36">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp_valueValid_V_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.valueValid.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>547</item>
<item>548</item>
<item>549</item>
<item>550</item>
</oprand_edges>
<opcode>phi</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="_37">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp_152_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>255</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>255</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>551</item>
<item>552</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.18</m_delay>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_153_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>255</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>255</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>553</item>
<item>554</item>
</oprand_edges>
<opcode>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="_39">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>or_cond1_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>255</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>255</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>555</item>
<item>556</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.48</m_delay>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>255</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</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>557</item>
<item>558</item>
<item>559</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>257</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>257</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>560</item>
<item>561</item>
<item>853</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>258</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>258</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>562</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>tmp_EOP_V_5</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.EOP.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>563</item>
<item>564</item>
<item>565</item>
<item>566</item>
</oprand_edges>
<opcode>phi</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>65</id>
<name>tmp_3</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>259</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>259</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.3</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>256</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>568</item>
<item>569</item>
<item>570</item>
<item>571</item>
<item>572</item>
<item>573</item>
<item>575</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="_45">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>259</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>259</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>576</item>
<item>577</item>
<item>578</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="_46">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>260</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>260</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>579</item>
</oprand_edges>
<opcode>br</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="_47">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>tmp_344</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>215</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>364</item>
<item>365</item>
<item>366</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="_48">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</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>367</item>
<item>368</item>
<item>369</item>
</oprand_edges>
<opcode>br</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="_49">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>tmp_134_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>215</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>370</item>
<item>371</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>73</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</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>372</item>
<item>373</item>
<item>374</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="_51">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>tmp_349</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>215</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>375</item>
<item>376</item>
<item>377</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="_52">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</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>378</item>
<item>379</item>
<item>380</item>
</oprand_edges>
<opcode>br</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="_53">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>tmp_137_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>215</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>381</item>
<item>382</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.18</m_delay>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</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>383</item>
<item>384</item>
<item>385</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>81</id>
<name>tmp_352</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>215</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>386</item>
<item>387</item>
<item>388</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="_56">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</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>389</item>
<item>390</item>
<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>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>tmp_V_31</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>216</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>216</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>392</item>
<item>393</item>
<item>857</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="_58">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>outputWord_metadata_s</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>217</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>217</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>outputWord.metadata.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>124</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>394</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="_59">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>218</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</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>395</item>
<item>396</item>
<item>397</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>tmp_V_32</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>219</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>219</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>398</item>
<item>399</item>
<item>858</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="_61">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>tmp_143_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>222</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>222</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>400</item>
<item>401</item>
</oprand_edges>
<opcode>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="_62">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>tmp_144_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>222</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>222</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>402</item>
<item>403</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.35</m_delay>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>tmp_213_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>222</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>222</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>404</item>
<item>405</item>
<item>406</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.37</m_delay>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>223</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>223</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>407</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>tmp_keyValid_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.keyValid.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>409</item>
<item>410</item>
<item>412</item>
<item>413</item>
</oprand_edges>
<opcode>phi</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="_66">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>ol_keyLength_V_load_s</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>215</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>414</item>
<item>415</item>
<item>416</item>
<item>417</item>
</oprand_edges>
<opcode>phi</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="_67">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>tmp_key_V_6</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>keyWord.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>418</item>
<item>419</item>
<item>420</item>
<item>421</item>
</oprand_edges>
<opcode>phi</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>97</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>224</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>422</item>
<item>423</item>
<item>424</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>tmp_V_33</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>425</item>
<item>426</item>
<item>859</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="_70">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>tmp_149_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>228</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>228</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>427</item>
<item>428</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.18</m_delay>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>tmp_150_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>228</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>228</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>429</item>
<item>430</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.30</m_delay>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>tmp_221_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>228</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>228</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>431</item>
<item>432</item>
<item>433</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.47</m_delay>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>228</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>228</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>434</item>
<item>435</item>
<item>852</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>229</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>229</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>436</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name>tmp_154_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>228</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>228</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>437</item>
<item>438</item>
<item>439</item>
<item>440</item>
</oprand_edges>
<opcode>phi</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="_76">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name>tmp_value_V_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>valueWord.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>441</item>
<item>442</item>
<item>443</item>
<item>444</item>
</oprand_edges>
<opcode>phi</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>108</id>
<name>tmp_valueValid_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.valueValid.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>445</item>
<item>446</item>
<item>447</item>
<item>448</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name>tmp_155_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>230</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>449</item>
<item>450</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.18</m_delay>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>tmp_156_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>230</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>451</item>
<item>452</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="_80">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>tmp_EOP_V</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>230</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.EOP.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>453</item>
<item>454</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.48</m_delay>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name>not_tmp_EOP_V_i_demo</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>230</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>455</item>
<item>456</item>
</oprand_edges>
<opcode>and</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>113</id>
<name>not_tmp_EOP_V_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>230</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>457</item>
<item>458</item>
</oprand_edges>
<opcode>xor</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>114</id>
<name>storemerge12_cast_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>230</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>230</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>459</item>
<item>460</item>
<item>461</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.49</m_delay>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>232</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</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>462</item>
<item>463</item>
<item>851</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name>tmp_2</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>236</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>236</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.2</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>256</bitwidth>
</Value>
<oprand_edges>
<count>8</count>
<item_version>0</item_version>
<item>465</item>
<item>466</item>
<item>467</item>
<item>468</item>
<item>469</item>
<item>470</item>
<item>471</item>
<item>472</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="_86">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>236</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</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>473</item>
<item>474</item>
<item>475</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="_87">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>237</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>237</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>476</item>
</oprand_edges>
<opcode>br</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="_88">
<Value>
<Obj>
<type>0</type>
<id>120</id>
<name>tmp</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>202</item>
<item>203</item>
<item>205</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="_89">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>180</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>180</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>206</item>
<item>207</item>
<item>208</item>
</oprand_edges>
<opcode>br</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="_90">
<Value>
<Obj>
<type>0</type>
<id>123</id>
<name>tmp_345</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>180</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>180</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>210</item>
<item>211</item>
<item>212</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="_91">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>180</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>180</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>213</item>
<item>214</item>
<item>215</item>
</oprand_edges>
<opcode>br</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="_92">
<Value>
<Obj>
<type>0</type>
<id>126</id>
<name>tmp128</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp128</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>57</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>217</item>
<item>218</item>
<item>860</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="_93">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name>tmp_valueLength_V_lo</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>170</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>170</second>
</item>
<item>
<first>
<first>sources/hashTable/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>181</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>220</item>
<item>221</item>
<item>223</item>
<item>225</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="_94">
<Value>
<Obj>
<type>0</type>
<id>128</id>
<name>tmp_operation_V_load</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>170</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>170</second>
</item>
<item>
<first>
<first>sources/hashTable/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>181</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>227</item>
<item>228</item>
<item>230</item>
<item>232</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="_95">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>tmp_347</name>
<fileName>sources/hashTable/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>170</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>170</second>
</item>
<item>
<first>
<first>sources/hashTable/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>181</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>234</item>
<item>235</item>
<item>237</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="_96">
<Value>
<Obj>
<type>0</type>
<id>130</id>
<name>tmp_V</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>182</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>182</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>239</item>
<item>240</item>
<item>861</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>131</id>
<name>tmp_348</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>183</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>183</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>241</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>132</id>
<name>tmp_135_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>184</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>242</item>
<item>244</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="_99">
<Value>
<Obj>
<type>0</type>
<id>133</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>184</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>245</item>
<item>246</item>
<item>247</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="_100">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name>tmp_350</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>184</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>249</item>
<item>250</item>
<item>251</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="_101">
<Value>
<Obj>
<type>0</type>
<id>136</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>184</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>252</item>
<item>253</item>
<item>254</item>
</oprand_edges>
<opcode>br</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="_102">
<Value>
<Obj>
<type>0</type>
<id>138</id>
<name>tmp_138_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>184</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>255</item>
<item>257</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="_103">
<Value>
<Obj>
<type>0</type>
<id>139</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>184</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>258</item>
<item>259</item>
<item>260</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="_104">
<Value>
<Obj>
<type>0</type>
<id>141</id>
<name>tmp_353</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>184</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>261</item>
<item>262</item>
<item>263</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="_105">
<Value>
<Obj>
<type>0</type>
<id>142</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>184</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>264</item>
<item>265</item>
<item>266</item>
</oprand_edges>
<opcode>br</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="_106">
<Value>
<Obj>
<type>0</type>
<id>144</id>
<name>p_Result_25</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>189</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>189</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>267</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="_107">
<Value>
<Obj>
<type>0</type>
<id>145</id>
<name>tmp_45_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>182</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>182</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>269</item>
<item>270</item>
<item>272</item>
<item>274</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="_108">
<Value>
<Obj>
<type>0</type>
<id>146</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>193</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>193</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>275</item>
<item>276</item>
<item>277</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>148</id>
<name>p_Result_s</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>194</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>194</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>279</item>
<item>280</item>
<item>281</item>
<item>283</item>
<item>285</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="_110">
<Value>
<Obj>
<type>0</type>
<id>149</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>194</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>194</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>286</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_111">
<Value>
<Obj>
<type>0</type>
<id>151</id>
<name>p_Result_33_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>196</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>196</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>288</item>
<item>289</item>
<item>290</item>
<item>291</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="_112">
<Value>
<Obj>
<type>0</type>
<id>152</id>
<name>tmp_V_29</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>197</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>197</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>293</item>
<item>294</item>
<item>863</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="_113">
<Value>
<Obj>
<type>0</type>
<id>153</id>
<name>tmp_141_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>199</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>199</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>295</item>
<item>297</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.18</m_delay>
</item>
<item class_id_reference="9" object_id="_114">
<Value>
<Obj>
<type>0</type>
<id>154</id>
<name>tmp_142_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>199</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>199</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>298</item>
<item>300</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.30</m_delay>
</item>
<item class_id_reference="9" object_id="_115">
<Value>
<Obj>
<type>0</type>
<id>155</id>
<name>storemerge_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>199</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>199</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>301</item>
<item>302</item>
<item>304</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.47</m_delay>
</item>
<item class_id_reference="9" object_id="_116">
<Value>
<Obj>
<type>0</type>
<id>156</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>199</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>199</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>305</item>
<item>306</item>
<item>850</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_117">
<Value>
<Obj>
<type>0</type>
<id>157</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>307</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_118">
<Value>
<Obj>
<type>0</type>
<id>159</id>
<name>p_Val2_20</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>308</item>
<item>309</item>
<item>310</item>
<item>311</item>
</oprand_edges>
<opcode>phi</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="_119">
<Value>
<Obj>
<type>0</type>
<id>160</id>
<name>tmp_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>valueWord.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>313</item>
<item>314</item>
<item>315</item>
<item>316</item>
</oprand_edges>
<opcode>phi</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="_120">
<Value>
<Obj>
<type>0</type>
<id>161</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>201</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>201</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>317</item>
<item>318</item>
<item>319</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_121">
<Value>
<Obj>
<type>0</type>
<id>163</id>
<name>tmp_V_30</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>202</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>202</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>320</item>
<item>321</item>
<item>862</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="_122">
<Value>
<Obj>
<type>0</type>
<id>164</id>
<name>tmp_147_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>204</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>204</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>322</item>
<item>324</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_123">
<Value>
<Obj>
<type>0</type>
<id>165</id>
<name>tmp_148_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>204</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>204</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>325</item>
<item>327</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.35</m_delay>
</item>
<item class_id_reference="9" object_id="_124">
<Value>
<Obj>
<type>0</type>
<id>166</id>
<name>tmp_218_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>204</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>204</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>328</item>
<item>329</item>
<item>330</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.37</m_delay>
</item>
<item class_id_reference="9" object_id="_125">
<Value>
<Obj>
<type>0</type>
<id>167</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>205</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>205</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>331</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_126">
<Value>
<Obj>
<type>0</type>
<id>169</id>
<name>ol_keyLength_V_new_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>183</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>183</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>332</item>
<item>333</item>
<item>334</item>
<item>335</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_127">
<Value>
<Obj>
<type>0</type>
<id>170</id>
<name>tmp_key_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>keyWord.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>336</item>
<item>337</item>
<item>338</item>
<item>339</item>
</oprand_edges>
<opcode>phi</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="_128">
<Value>
<Obj>
<type>0</type>
<id>171</id>
<name>tmp_356</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>206</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>72</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>340</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="_129">
<Value>
<Obj>
<type>0</type>
<id>172</id>
<name>tmp_46_i</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>207</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>207</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>342</item>
<item>343</item>
<item>345</item>
<item>347</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="_130">
<Value>
<Obj>
<type>0</type>
<id>173</id>
<name>tmp_1</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>207</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>207</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.1</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>256</bitwidth>
</Value>
<oprand_edges>
<count>8</count>
<item_version>0</item_version>
<item>349</item>
<item>350</item>
<item>351</item>
<item>352</item>
<item>353</item>
<item>354</item>
<item>355</item>
<item>356</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="_131">
<Value>
<Obj>
<type>0</type>
<id>174</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>207</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>207</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>358</item>
<item>359</item>
<item>360</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="_132">
<Value>
<Obj>
<type>0</type>
<id>175</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>208</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>208</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>361</item>
<item>362</item>
<item>854</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_133">
<Value>
<Obj>
<type>0</type>
<id>176</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>209</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>209</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>363</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_134">
<Value>
<Obj>
<type>0</type>
<id>178</id>
<name>ol_keyLength_V_flag_s</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.keyValid.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>26</count>
<item_version>0</item_version>
<item>580</item>
<item>581</item>
<item>582</item>
<item>583</item>
<item>584</item>
<item>585</item>
<item>586</item>
<item>587</item>
<item>588</item>
<item>589</item>
<item>590</item>
<item>591</item>
<item>592</item>
<item>593</item>
<item>594</item>
<item>595</item>
<item>596</item>
<item>597</item>
<item>598</item>
<item>599</item>
<item>600</item>
<item>601</item>
<item>602</item>
<item>603</item>
<item>604</item>
<item>605</item>
</oprand_edges>
<opcode>phi</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="_135">
<Value>
<Obj>
<type>0</type>
<id>179</id>
<name>ol_keyLength_V_new_7</name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>183</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>183</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>26</count>
<item_version>0</item_version>
<item>607</item>
<item>608</item>
<item>609</item>
<item>610</item>
<item>611</item>
<item>612</item>
<item>613</item>
<item>614</item>
<item>615</item>
<item>616</item>
<item>617</item>
<item>618</item>
<item>619</item>
<item>620</item>
<item>621</item>
<item>622</item>
<item>623</item>
<item>624</item>
<item>625</item>
<item>626</item>
<item>627</item>
<item>628</item>
<item>629</item>
<item>630</item>
<item>631</item>
<item>632</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.00</m_delay>
</item>
<item class_id_reference="9" object_id="_136">
<Value>
<Obj>
<type>0</type>
<id>180</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>633</item>
<item>634</item>
<item>635</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="_137">
<Value>
<Obj>
<type>0</type>
<id>182</id>
<name></name>
<fileName>sources/hashTable/hashTable.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>183</lineNumber>
<contextFuncName>ht_outputLogic</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/hashTable.cpp</first>
<second>ht_outputLogic</second>
</first>
<second>183</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>636</item>
<item>637</item>
<item>848</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>1</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_138">
<Value>
<Obj>
<type>0</type>
<id>183</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>638</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="_139">
<Value>
<Obj>
<type>0</type>
<id>185</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>27</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_140">
<Value>
<Obj>
<type>2</type>
<id>192</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_141">
<Value>
<Obj>
<type>2</type>
<id>195</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_142">
<Value>
<Obj>
<type>2</type>
<id>198</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_143">
<Value>
<Obj>
<type>2</type>
<id>204</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="_144">
<Value>
<Obj>
<type>2</type>
<id>222</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="_145">
<Value>
<Obj>
<type>2</type>
<id>224</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>47</content>
</item>
<item class_id_reference="16" object_id="_146">
<Value>
<Obj>
<type>2</type>
<id>229</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>48</content>
</item>
<item class_id_reference="16" object_id="_147">
<Value>
<Obj>
<type>2</type>
<id>231</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>55</content>
</item>
<item class_id_reference="16" object_id="_148">
<Value>
<Obj>
<type>2</type>
<id>236</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>56</content>
</item>
<item class_id_reference="16" object_id="_149">
<Value>
<Obj>
<type>2</type>
<id>243</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="_150">
<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>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_151">
<Value>
<Obj>
<type>2</type>
<id>271</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>104</content>
</item>
<item class_id_reference="16" object_id="_152">
<Value>
<Obj>
<type>2</type>
<id>273</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>111</content>
</item>
<item class_id_reference="16" object_id="_153">
<Value>
<Obj>
<type>2</type>
<id>282</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_154">
<Value>
<Obj>
<type>2</type>
<id>284</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>23</content>
</item>
<item class_id_reference="16" object_id="_155">
<Value>
<Obj>
<type>2</type>
<id>296</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_156">
<Value>
<Obj>
<type>2</type>
<id>299</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>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>65528</content>
</item>
<item class_id_reference="16" object_id="_157">
<Value>
<Obj>
<type>2</type>
<id>303</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>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_158">
<Value>
<Obj>
<type>2</type>
<id>312</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="_159">
<Value>
<Obj>
<type>2</type>
<id>323</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_160">
<Value>
<Obj>
<type>2</type>
<id>326</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>248</content>
</item>
<item class_id_reference="16" object_id="_161">
<Value>
<Obj>
<type>2</type>
<id>344</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>113</content>
</item>
<item class_id_reference="16" object_id="_162">
<Value>
<Obj>
<type>2</type>
<id>346</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="_163">
<Value>
<Obj>
<type>2</type>
<id>408</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_164">
<Value>
<Obj>
<type>2</type>
<id>411</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_165">
<Value>
<Obj>
<type>2</type>
<id>574</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>125</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_166">
<Value>
<Obj>
<type>2</type>
<id>606</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>4</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>37</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_167">
<Obj>
<type>3</type>
<id>20</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>4</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_168">
<Obj>
<type>3</type>
<id>23</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>21</item>
<item>22</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_169">
<Obj>
<type>3</type>
<id>26</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>24</item>
<item>25</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_170">
<Obj>
<type>3</type>
<id>29</id>
<name>._crit_edge35.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>2</count>
<item_version>0</item_version>
<item>27</item>
<item>28</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_171">
<Obj>
<type>3</type>
<id>32</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>30</item>
<item>31</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_172">
<Obj>
<type>3</type>
<id>34</id>
<name>._crit_edge39.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>33</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_173">
<Obj>
<type>3</type>
<id>40</id>
<name>._crit_edge44.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>5</count>
<item_version>0</item_version>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_174">
<Obj>
<type>3</type>
<id>45</id>
<name>._crit_edge43.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>4</count>
<item_version>0</item_version>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_175">
<Obj>
<type>3</type>
<id>52</id>
<name>._crit_edge46.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>6</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_176">
<Obj>
<type>3</type>
<id>60</id>
<name>._crit_edge45.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>7</count>
<item_version>0</item_version>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_177">
<Obj>
<type>3</type>
<id>63</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>61</item>
<item>62</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_178">
<Obj>
<type>3</type>
<id>68</id>
<name>._crit_edge47.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>4</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
<item>66</item>
<item>67</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_179">
<Obj>
<type>3</type>
<id>71</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>69</item>
<item>70</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_180">
<Obj>
<type>3</type>
<id>74</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>72</item>
<item>73</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_181">
<Obj>
<type>3</type>
<id>77</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>75</item>
<item>76</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_182">
<Obj>
<type>3</type>
<id>80</id>
<name>._crit_edge20.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>2</count>
<item_version>0</item_version>
<item>78</item>
<item>79</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_183">
<Obj>
<type>3</type>
<id>83</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>81</item>
<item>82</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_184">
<Obj>
<type>3</type>
<id>87</id>
<name>._crit_edge24.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>3</count>
<item_version>0</item_version>
<item>84</item>
<item>85</item>
<item>86</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_185">
<Obj>
<type>3</type>
<id>93</id>
<name>._crit_edge29.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>5</count>
<item_version>0</item_version>
<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="_186">
<Obj>
<type>3</type>
<id>98</id>
<name>._crit_edge28.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>4</count>
<item_version>0</item_version>
<item>94</item>
<item>95</item>
<item>96</item>
<item>97</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_187">
<Obj>
<type>3</type>
<id>105</id>
<name>._crit_edge31.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>6</count>
<item_version>0</item_version>
<item>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
<item>104</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_188">
<Obj>
<type>3</type>
<id>119</id>
<name>._crit_edge30.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>13</count>
<item_version>0</item_version>
<item>106</item>
<item>107</item>
<item>108</item>
<item>109</item>
<item>110</item>
<item>111</item>
<item>112</item>
<item>113</item>
<item>114</item>
<item>115</item>
<item>116</item>
<item>117</item>
<item>118</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_189">
<Obj>
<type>3</type>
<id>122</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>120</item>
<item>121</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_190">
<Obj>
<type>3</type>
<id>125</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>123</item>
<item>124</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_191">
<Obj>
<type>3</type>
<id>134</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>8</count>
<item_version>0</item_version>
<item>126</item>
<item>127</item>
<item>128</item>
<item>129</item>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_192">
<Obj>
<type>3</type>
<id>137</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>135</item>
<item>136</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_193">
<Obj>
<type>3</type>
<id>140</id>
<name>._crit_edge8.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>2</count>
<item_version>0</item_version>
<item>138</item>
<item>139</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_194">
<Obj>
<type>3</type>
<id>143</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>141</item>
<item>142</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_195">
<Obj>
<type>3</type>
<id>147</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>3</count>
<item_version>0</item_version>
<item>144</item>
<item>145</item>
<item>146</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_196">
<Obj>
<type>3</type>
<id>150</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>148</item>
<item>149</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_197">
<Obj>
<type>3</type>
<id>158</id>
<name>._crit_edge16.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>7</count>
<item_version>0</item_version>
<item>151</item>
<item>152</item>
<item>153</item>
<item>154</item>
<item>155</item>
<item>156</item>
<item>157</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_198">
<Obj>
<type>3</type>
<id>162</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>159</item>
<item>160</item>
<item>161</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_199">
<Obj>
<type>3</type>
<id>168</id>
<name>._crit_edge18.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>5</count>
<item_version>0</item_version>
<item>163</item>
<item>164</item>
<item>165</item>
<item>166</item>
<item>167</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_200">
<Obj>
<type>3</type>
<id>177</id>
<name>._crit_edge17.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>8</count>
<item_version>0</item_version>
<item>169</item>
<item>170</item>
<item>171</item>
<item>172</item>
<item>173</item>
<item>174</item>
<item>175</item>
<item>176</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_201">
<Obj>
<type>3</type>
<id>181</id>
<name>._crit_edge5.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>3</count>
<item_version>0</item_version>
<item>178</item>
<item>179</item>
<item>180</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_202">
<Obj>
<type>3</type>
<id>184</id>
<name>mergeST.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>2</count>
<item_version>0</item_version>
<item>182</item>
<item>183</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_203">
<Obj>
<type>3</type>
<id>186</id>
<name>ht_outputLogic.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>185</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>455</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_204">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>189</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="_207">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>191</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>194</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>195</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>197</id>
<edge_type>2</edge_type>
<source_obj>71</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>198</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>200</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>207</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>208</id>
<edge_type>2</edge_type>
<source_obj>125</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>214</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>215</id>
<edge_type>2</edge_type>
<source_obj>134</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>221</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="_227">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>222</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>224</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>229</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>231</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>235</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="_233">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>241</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="_236">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>246</id>
<edge_type>2</edge_type>
<source_obj>137</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>247</id>
<edge_type>2</edge_type>
<source_obj>140</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>253</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>254</id>
<edge_type>2</edge_type>
<source_obj>140</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_247">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>256</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>259</id>
<edge_type>2</edge_type>
<source_obj>147</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>260</id>
<edge_type>2</edge_type>
<source_obj>143</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_251">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_252">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_253">
<id>264</id>
<edge_type>1</edge_type>
<source_obj>141</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>265</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>266</id>
<edge_type>2</edge_type>
<source_obj>147</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>270</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_258">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>271</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_259">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>273</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>275</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>276</id>
<edge_type>2</edge_type>
<source_obj>150</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_262">
<id>277</id>
<edge_type>2</edge_type>
<source_obj>158</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_263">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_264">
<id>281</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_265">
<id>283</id>
<edge_type>1</edge_type>
<source_obj>282</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_266">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>284</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_267">
<id>286</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_268">
<id>289</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_269">
<id>290</id>
<edge_type>1</edge_type>
<source_obj>282</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_270">
<id>291</id>
<edge_type>1</edge_type>
<source_obj>284</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_271">
<id>294</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>152</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_272">
<id>295</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_273">
<id>297</id>
<edge_type>1</edge_type>
<source_obj>296</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_274">
<id>298</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>154</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_275">
<id>300</id>
<edge_type>1</edge_type>
<source_obj>299</source_obj>
<sink_obj>154</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_276">
<id>301</id>
<edge_type>1</edge_type>
<source_obj>153</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_277">
<id>302</id>
<edge_type>1</edge_type>
<source_obj>154</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_278">
<id>304</id>
<edge_type>1</edge_type>
<source_obj>303</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_279">
<id>305</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>156</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_280">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>156</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_281">
<id>307</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>157</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_282">
<id>308</id>
<edge_type>1</edge_type>
<source_obj>148</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_283">
<id>309</id>
<edge_type>2</edge_type>
<source_obj>150</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_284">
<id>310</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_285">
<id>311</id>
<edge_type>2</edge_type>
<source_obj>158</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_286">
<id>313</id>
<edge_type>1</edge_type>
<source_obj>312</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_287">
<id>314</id>
<edge_type>2</edge_type>
<source_obj>150</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_288">
<id>315</id>
<edge_type>1</edge_type>
<source_obj>152</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_289">
<id>316</id>
<edge_type>2</edge_type>
<source_obj>158</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_290">
<id>317</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_291">
<id>318</id>
<edge_type>2</edge_type>
<source_obj>168</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_292">
<id>319</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_293">
<id>321</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_294">
<id>322</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_295">
<id>324</id>
<edge_type>1</edge_type>
<source_obj>323</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_296">
<id>325</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>165</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_297">
<id>327</id>
<edge_type>1</edge_type>
<source_obj>326</source_obj>
<sink_obj>165</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_298">
<id>328</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_299">
<id>329</id>
<edge_type>1</edge_type>
<source_obj>165</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_300">
<id>330</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_301">
<id>331</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>167</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_302">
<id>332</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_303">
<id>333</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_304">
<id>334</id>
<edge_type>1</edge_type>
<source_obj>166</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_305">
<id>335</id>
<edge_type>2</edge_type>
<source_obj>168</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_306">
<id>336</id>
<edge_type>1</edge_type>
<source_obj>312</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_307">
<id>337</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_308">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>163</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_309">
<id>339</id>
<edge_type>2</edge_type>
<source_obj>168</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_310">
<id>340</id>
<edge_type>1</edge_type>
<source_obj>159</source_obj>
<sink_obj>171</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_311">
<id>343</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_312">
<id>345</id>
<edge_type>1</edge_type>
<source_obj>344</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_313">
<id>347</id>
<edge_type>1</edge_type>
<source_obj>346</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_314">
<id>350</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_315">
<id>351</id>
<edge_type>1</edge_type>
<source_obj>160</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_316">
<id>352</id>
<edge_type>1</edge_type>
<source_obj>172</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_317">
<id>353</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_318">
<id>354</id>
<edge_type>1</edge_type>
<source_obj>145</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_319">
<id>355</id>
<edge_type>1</edge_type>
<source_obj>144</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_320">
<id>356</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_321">
<id>359</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>174</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_322">
<id>360</id>
<edge_type>1</edge_type>
<source_obj>173</source_obj>
<sink_obj>174</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_323">
<id>361</id>
<edge_type>1</edge_type>
<source_obj>195</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_324">
<id>362</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_325">
<id>363</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>176</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_326">
<id>365</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_327">
<id>366</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_328">
<id>367</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="_329">
<id>368</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_330">
<id>369</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_331">
<id>370</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_332">
<id>371</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_333">
<id>372</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_334">
<id>373</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_335">
<id>374</id>
<edge_type>2</edge_type>
<source_obj>80</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_336">
<id>376</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_337">
<id>377</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_338">
<id>378</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_339">
<id>379</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_340">
<id>380</id>
<edge_type>2</edge_type>
<source_obj>80</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_341">
<id>381</id>
<edge_type>1</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="_342">
<id>382</id>
<edge_type>1</edge_type>
<source_obj>303</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_343">
<id>383</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_344">
<id>384</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_345">
<id>385</id>
<edge_type>2</edge_type>
<source_obj>87</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_346">
<id>387</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_347">
<id>388</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_348">
<id>389</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="_349">
<id>390</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_350">
<id>391</id>
<edge_type>2</edge_type>
<source_obj>87</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_351">
<id>393</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_352">
<id>394</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="_353">
<id>395</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_354">
<id>396</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_355">
<id>397</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_356">
<id>399</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_357">
<id>400</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_358">
<id>401</id>
<edge_type>1</edge_type>
<source_obj>323</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_359">
<id>402</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_360">
<id>403</id>
<edge_type>1</edge_type>
<source_obj>326</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_361">
<id>404</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_362">
<id>405</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="_363">
<id>406</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_364">
<id>407</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_365">
<id>409</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_366">
<id>410</id>
<edge_type>2</edge_type>
<source_obj>87</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_367">
<id>412</id>
<edge_type>1</edge_type>
<source_obj>411</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_368">
<id>413</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_369">
<id>414</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_370">
<id>415</id>
<edge_type>2</edge_type>
<source_obj>87</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_371">
<id>416</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_372">
<id>417</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="_373">
<id>418</id>
<edge_type>1</edge_type>
<source_obj>312</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_374">
<id>419</id>
<edge_type>2</edge_type>
<source_obj>87</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_375">
<id>420</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_376">
<id>421</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_377">
<id>422</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_378">
<id>423</id>
<edge_type>2</edge_type>
<source_obj>105</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_379">
<id>424</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_380">
<id>426</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_381">
<id>427</id>
<edge_type>1</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="_382">
<id>428</id>
<edge_type>1</edge_type>
<source_obj>296</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_383">
<id>429</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_384">
<id>430</id>
<edge_type>1</edge_type>
<source_obj>299</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_385">
<id>431</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_386">
<id>432</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_387">
<id>433</id>
<edge_type>1</edge_type>
<source_obj>303</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_388">
<id>434</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="_389">
<id>435</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_390">
<id>436</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_391">
<id>437</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="_392">
<id>438</id>
<edge_type>2</edge_type>
<source_obj>105</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_393">
<id>439</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_394">
<id>440</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_395">
<id>441</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_396">
<id>442</id>
<edge_type>2</edge_type>
<source_obj>105</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_397">
<id>443</id>
<edge_type>1</edge_type>
<source_obj>312</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_398">
<id>444</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_399">
<id>445</id>
<edge_type>1</edge_type>
<source_obj>411</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_400">
<id>446</id>
<edge_type>2</edge_type>
<source_obj>105</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_401">
<id>447</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_402">
<id>448</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_403">
<id>449</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_404">
<id>450</id>
<edge_type>1</edge_type>
<source_obj>303</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_405">
<id>451</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_406">
<id>452</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_407">
<id>453</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_408">
<id>454</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_409">
<id>455</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_410">
<id>456</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="_411">
<id>457</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="_412">
<id>458</id>
<edge_type>1</edge_type>
<source_obj>411</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_413">
<id>459</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_414">
<id>460</id>
<edge_type>1</edge_type>
<source_obj>198</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_415">
<id>461</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_416">
<id>462</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_417">
<id>463</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_418">
<id>466</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_419">
<id>467</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_420">
<id>468</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_421">
<id>469</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_422">
<id>470</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_423">
<id>471</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_424">
<id>472</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_425">
<id>474</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_426">
<id>475</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_427">
<id>476</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_428">
<id>477</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="_429">
<id>478</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_430">
<id>479</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_431">
<id>480</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_432">
<id>481</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_433">
<id>483</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_434">
<id>484</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_435">
<id>485</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="_436">
<id>486</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_437">
<id>487</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_438">
<id>488</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_439">
<id>489</id>
<edge_type>1</edge_type>
<source_obj>303</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_440">
<id>490</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_441">
<id>491</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_442">
<id>492</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_443">
<id>494</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_444">
<id>495</id>
<edge_type>1</edge_type>
<source_obj>204</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_445">
<id>496</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="_446">
<id>497</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_447">
<id>498</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_448">
<id>499</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_449">
<id>500</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_450">
<id>501</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_451">
<id>503</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_452">
<id>504</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_453">
<id>505</id>
<edge_type>1</edge_type>
<source_obj>323</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_454">
<id>506</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_455">
<id>507</id>
<edge_type>1</edge_type>
<source_obj>326</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_456">
<id>508</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_457">
<id>509</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="_458">
<id>510</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_459">
<id>511</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_460">
<id>512</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_461">
<id>513</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_462">
<id>514</id>
<edge_type>1</edge_type>
<source_obj>411</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_463">
<id>515</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_464">
<id>516</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_465">
<id>517</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_466">
<id>518</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_467">
<id>519</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_468">
<id>520</id>
<edge_type>1</edge_type>
<source_obj>312</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_469">
<id>521</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_470">
<id>522</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_471">
<id>523</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_472">
<id>524</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_473">
<id>525</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_474">
<id>526</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_475">
<id>528</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_476">
<id>529</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_477">
<id>530</id>
<edge_type>1</edge_type>
<source_obj>296</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_478">
<id>531</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_479">
<id>532</id>
<edge_type>1</edge_type>
<source_obj>299</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_480">
<id>533</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_481">
<id>534</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_482">
<id>535</id>
<edge_type>1</edge_type>
<source_obj>303</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_483">
<id>536</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_484">
<id>537</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_485">
<id>538</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_486">
<id>539</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_487">
<id>540</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_488">
<id>541</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="_489">
<id>542</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_490">
<id>543</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_491">
<id>544</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_492">
<id>545</id>
<edge_type>1</edge_type>
<source_obj>312</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_493">
<id>546</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_494">
<id>547</id>
<edge_type>1</edge_type>
<source_obj>411</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_495">
<id>548</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_496">
<id>549</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_497">
<id>550</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="_498">
<id>551</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_499">
<id>552</id>
<edge_type>1</edge_type>
<source_obj>303</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_500">
<id>553</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_501">
<id>554</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_502">
<id>555</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_503">
<id>556</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_504">
<id>557</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_505">
<id>558</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_506">
<id>559</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_507">
<id>560</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_508">
<id>561</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_509">
<id>562</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_510">
<id>563</id>
<edge_type>1</edge_type>
<source_obj>411</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_511">
<id>564</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_512">
<id>565</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_513">
<id>566</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_514">
<id>569</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_515">
<id>570</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_516">
<id>571</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="_517">
<id>572</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_518">
<id>573</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_519">
<id>575</id>
<edge_type>1</edge_type>
<source_obj>574</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_520">
<id>577</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_521">
<id>578</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_522">
<id>579</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_523">
<id>580</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_524">
<id>581</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_525">
<id>582</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_526">
<id>583</id>
<edge_type>2</edge_type>
<source_obj>125</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_527">
<id>584</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_528">
<id>585</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_529">
<id>586</id>
<edge_type>1</edge_type>
<source_obj>411</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_530">
<id>587</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_531">
<id>588</id>
<edge_type>1</edge_type>
<source_obj>411</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_532">
<id>589</id>
<edge_type>2</edge_type>
<source_obj>143</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_533">
<id>590</id>
<edge_type>1</edge_type>
<source_obj>411</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_534">
<id>591</id>
<edge_type>2</edge_type>
<source_obj>137</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_535">
<id>592</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_536">
<id>593</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_537">
<id>594</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_538">
<id>595</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_539">
<id>596</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_540">
<id>597</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_541">
<id>598</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_542">
<id>599</id>
<edge_type>2</edge_type>
<source_obj>71</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_543">
<id>600</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_544">
<id>601</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_545">
<id>602</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_546">
<id>603</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_547">
<id>604</id>
<edge_type>1</edge_type>
<source_obj>408</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_548">
<id>605</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_549">
<id>607</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_550">
<id>608</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_551">
<id>609</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_552">
<id>610</id>
<edge_type>2</edge_type>
<source_obj>125</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_553">
<id>611</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_554">
<id>612</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_555">
<id>613</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_556">
<id>614</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_557">
<id>615</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_558">
<id>616</id>
<edge_type>2</edge_type>
<source_obj>143</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_559">
<id>617</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_560">
<id>618</id>
<edge_type>2</edge_type>
<source_obj>137</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_561">
<id>619</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_562">
<id>620</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_563">
<id>621</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_564">
<id>622</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_565">
<id>623</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_566">
<id>624</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_567">
<id>625</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_568">
<id>626</id>
<edge_type>2</edge_type>
<source_obj>71</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_569">
<id>627</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_570">
<id>628</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_571">
<id>629</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_572">
<id>630</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_573">
<id>631</id>
<edge_type>1</edge_type>
<source_obj>606</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_574">
<id>632</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_575">
<id>633</id>
<edge_type>1</edge_type>
<source_obj>178</source_obj>
<sink_obj>180</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_576">
<id>634</id>
<edge_type>2</edge_type>
<source_obj>186</source_obj>
<sink_obj>180</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_577">
<id>635</id>
<edge_type>2</edge_type>
<source_obj>184</source_obj>
<sink_obj>180</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_578">
<id>636</id>
<edge_type>1</edge_type>
<source_obj>179</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_579">
<id>637</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_580">
<id>638</id>
<edge_type>2</edge_type>
<source_obj>186</source_obj>
<sink_obj>183</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_581">
<id>785</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_582">
<id>786</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_583">
<id>787</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_584">
<id>788</id>
<edge_type>2</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="_585">
<id>789</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_586">
<id>790</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_587">
<id>791</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_588">
<id>792</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_589">
<id>793</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_590">
<id>794</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_591">
<id>795</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_592">
<id>796</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_593">
<id>797</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_594">
<id>798</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_595">
<id>799</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_596">
<id>800</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_597">
<id>801</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_598">
<id>802</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_599">
<id>803</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_600">
<id>804</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_601">
<id>805</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_602">
<id>806</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_603">
<id>807</id>
<edge_type>2</edge_type>
<source_obj>71</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_604">
<id>808</id>
<edge_type>2</edge_type>
<source_obj>71</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_605">
<id>809</id>
<edge_type>2</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="_606">
<id>810</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_607">
<id>811</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_608">
<id>812</id>
<edge_type>2</edge_type>
<source_obj>77</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_609">
<id>813</id>
<edge_type>2</edge_type>
<source_obj>80</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_610">
<id>814</id>
<edge_type>2</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="_611">
<id>815</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_612">
<id>816</id>
<edge_type>2</edge_type>
<source_obj>83</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_613">
<id>817</id>
<edge_type>2</edge_type>
<source_obj>87</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_614">
<id>818</id>
<edge_type>2</edge_type>
<source_obj>87</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_615">
<id>819</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_616">
<id>820</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_617">
<id>821</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_618">
<id>822</id>
<edge_type>2</edge_type>
<source_obj>105</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_619">
<id>823</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_620">
<id>824</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_621">
<id>825</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_622">
<id>826</id>
<edge_type>2</edge_type>
<source_obj>125</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_623">
<id>827</id>
<edge_type>2</edge_type>
<source_obj>125</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_624">
<id>828</id>
<edge_type>2</edge_type>
<source_obj>134</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_625">
<id>829</id>
<edge_type>2</edge_type>
<source_obj>134</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_626">
<id>830</id>
<edge_type>2</edge_type>
<source_obj>137</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_627">
<id>831</id>
<edge_type>2</edge_type>
<source_obj>137</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_628">
<id>832</id>
<edge_type>2</edge_type>
<source_obj>140</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_629">
<id>833</id>
<edge_type>2</edge_type>
<source_obj>140</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_630">
<id>834</id>
<edge_type>2</edge_type>
<source_obj>143</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_631">
<id>835</id>
<edge_type>2</edge_type>
<source_obj>143</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_632">
<id>836</id>
<edge_type>2</edge_type>
<source_obj>147</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_633">
<id>837</id>
<edge_type>2</edge_type>
<source_obj>147</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_634">
<id>838</id>
<edge_type>2</edge_type>
<source_obj>150</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_635">
<id>839</id>
<edge_type>2</edge_type>
<source_obj>158</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_636">
<id>840</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_637">
<id>841</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_638">
<id>842</id>
<edge_type>2</edge_type>
<source_obj>168</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_639">
<id>843</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_640">
<id>844</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>184</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_641">
<id>845</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>186</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_642">
<id>846</id>
<edge_type>2</edge_type>
<source_obj>184</source_obj>
<sink_obj>186</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_643">
<id>848</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_644">
<id>849</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_645">
<id>850</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>156</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_646">
<id>851</id>
<edge_type>4</edge_type>
<source_obj>16</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_647">
<id>852</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_648">
<id>853</id>
<edge_type>4</edge_type>
<source_obj>16</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_649">
<id>854</id>
<edge_type>4</edge_type>
<source_obj>16</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_650">
<id>855</id>
<edge_type>4</edge_type>
<source_obj>24</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_651">
<id>856</id>
<edge_type>4</edge_type>
<source_obj>30</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_652">
<id>857</id>
<edge_type>4</edge_type>
<source_obj>69</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_653">
<id>858</id>
<edge_type>4</edge_type>
<source_obj>75</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_654">
<id>859</id>
<edge_type>4</edge_type>
<source_obj>81</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_655">
<id>860</id>
<edge_type>4</edge_type>
<source_obj>120</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_656">
<id>861</id>
<edge_type>4</edge_type>
<source_obj>123</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_657">
<id>862</id>
<edge_type>4</edge_type>
<source_obj>135</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_658">
<id>863</id>
<edge_type>4</edge_type>
<source_obj>141</source_obj>
<sink_obj>152</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="_659">
<mId>1</mId>
<mTag>ht_outputLogic</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>37</count>
<item_version>0</item_version>
<item>20</item>
<item>23</item>
<item>26</item>
<item>29</item>
<item>32</item>
<item>34</item>
<item>40</item>
<item>45</item>
<item>52</item>
<item>60</item>
<item>63</item>
<item>68</item>
<item>71</item>
<item>74</item>
<item>77</item>
<item>80</item>
<item>83</item>
<item>87</item>
<item>93</item>
<item>98</item>
<item>105</item>
<item>119</item>
<item>122</item>
<item>125</item>
<item>134</item>
<item>137</item>
<item>140</item>
<item>143</item>
<item>147</item>
<item>150</item>
<item>158</item>
<item>162</item>
<item>168</item>
<item>177</item>
<item>181</item>
<item>184</item>
<item>186</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="_660">
<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="_661">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>113</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_662">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_663">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_664">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_665">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_666">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_667">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_668">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_669">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_670">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_671">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_672">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_673">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_674">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_675">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_676">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_677">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_678">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_679">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_680">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_681">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_682">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_683">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_684">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_685">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_686">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_687">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_688">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_689">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_690">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_691">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_692">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_693">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_694">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_695">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_696">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_697">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_698">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_699">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_700">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_701">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_702">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_703">
<id>78</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_704">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_705">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_706">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_707">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_708">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_709">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_710">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_711">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_712">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_713">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_714">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_715">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_716">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_717">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_718">
<id>99</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_719">
<id>100</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_720">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_721">
<id>102</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_722">
<id>103</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_723">
<id>104</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_724">
<id>106</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_725">
<id>109</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_726">
<id>110</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_727">
<id>111</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_728">
<id>112</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_729">
<id>113</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_730">
<id>114</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_731">
<id>115</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_732">
<id>118</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_733">
<id>120</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_734">
<id>121</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_735">
<id>123</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_736">
<id>124</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_737">
<id>126</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_738">
<id>127</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_739">
<id>128</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_740">
<id>129</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_741">
<id>130</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_742">
<id>131</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_743">
<id>132</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_744">
<id>133</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_745">
<id>135</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_746">
<id>136</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_747">
<id>138</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_748">
<id>139</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_749">
<id>141</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_750">
<id>142</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_751">
<id>144</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_752">
<id>146</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_753">
<id>148</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_754">
<id>149</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_755">
<id>151</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_756">
<id>152</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_757">
<id>153</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_758">
<id>154</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_759">
<id>155</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_760">
<id>156</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_761">
<id>157</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_762">
<id>161</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_763">
<id>163</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_764">
<id>164</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_765">
<id>165</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_766">
<id>166</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_767">
<id>167</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_768">
<id>169</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_769">
<id>175</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_770">
<id>176</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_771">
<id>178</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_772">
<id>179</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_773">
<id>180</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_774">
<id>182</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_775">
<id>2</id>
<operations>
<count>28</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_776">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_777">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_778">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_779">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_780">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_781">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_782">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_783">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_784">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_785">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_786">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_787">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_788">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_789">
<id>96</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_790">
<id>107</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_791">
<id>108</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_792">
<id>116</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_793">
<id>117</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_794">
<id>145</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_795">
<id>159</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_796">
<id>160</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_797">
<id>170</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_798">
<id>171</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_799">
<id>172</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_800">
<id>173</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_801">
<id>174</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_802">
<id>183</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_803">
<id>185</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="_804">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>183</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>134</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>16</first>
<second class_id="37" tracking_level="0" version="0">
<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>21</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>1</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>0</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>72</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>79</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>84</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>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>0</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>0</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>0</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>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>0</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>0</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>118</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>121</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>124</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>0</first>
<second>0</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>132</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>133</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>138</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>141</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>142</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>144</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>145</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>146</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>148</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>149</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>151</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>152</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>153</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>154</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>155</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>156</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>157</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>159</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>160</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>161</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>163</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>164</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>165</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>166</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>167</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>169</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>170</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>171</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>172</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>173</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>174</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>175</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>176</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>178</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>179</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>180</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>182</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>183</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>185</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>37</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>20</first>
<second class_id="40" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>71</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>77</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>93</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>105</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>122</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>134</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>140</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>143</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>147</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>150</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>158</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>162</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>168</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>177</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>181</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>184</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>186</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="_805">
<region_name>ht_outputLogic</region_name>
<basic_blocks>
<count>37</count>
<item_version>0</item_version>
<item>20</item>
<item>23</item>
<item>26</item>
<item>29</item>
<item>32</item>
<item>34</item>
<item>40</item>
<item>45</item>
<item>52</item>
<item>60</item>
<item>63</item>
<item>68</item>
<item>71</item>
<item>74</item>
<item>77</item>
<item>80</item>
<item>83</item>
<item>87</item>
<item>93</item>
<item>98</item>
<item>105</item>
<item>119</item>
<item>122</item>
<item>125</item>
<item>134</item>
<item>137</item>
<item>140</item>
<item>143</item>
<item>147</item>
<item>150</item>
<item>158</item>
<item>162</item>
<item>168</item>
<item>177</item>
<item>181</item>
<item>184</item>
<item>186</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>76</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>180</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>24</item>
<item>75</item>
<item>135</item>
</second>
</item>
<item>
<first>188</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>30</item>
<item>81</item>
<item>141</item>
</second>
</item>
<item>
<first>196</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>35</item>
<item>88</item>
<item>163</item>
</second>
</item>
<item>
<first>202</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>99</item>
<item>152</item>
</second>
</item>
<item>
<first>208</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>69</item>
<item>123</item>
</second>
</item>
<item>
<first>216</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>84</item>
<item>130</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>120</item>
</second>
</item>
<item>
<first>230</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>126</item>
</second>
</item>
<item>
<first>236</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>66</item>
<item>117</item>
<item>174</item>
</second>
</item>
<item>
<first>246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>267</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>297</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>169</item>
</second>
</item>
<item>
<first>315</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</second>
</item>
<item>
<first>360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</second>
</item>
<item>
<first>403</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>414</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>426</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>451</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>462</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>474</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>485</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</second>
</item>
<item>
<first>495</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>160</item>
</second>
</item>
<item>
<first>506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>170</item>
</second>
</item>
<item>
<first>513</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>72</item>
</second>
</item>
<item>
<first>518</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>27</item>
<item>78</item>
</second>
</item>
<item>
<first>523</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>89</item>
</second>
</item>
<item>
<first>528</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>90</item>
</second>
</item>
<item>
<first>533</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>38</item>
<item>91</item>
</second>
</item>
<item>
<first>543</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>47</item>
<item>100</item>
</second>
</item>
<item>
<first>548</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>48</item>
<item>101</item>
</second>
</item>
<item>
<first>553</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>102</item>
</second>
</item>
<item>
<first>563</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>50</item>
<item>103</item>
</second>
</item>
<item>
<first>583</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>587</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>596</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>605</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>611</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>617</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>623</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>629</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>633</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</second>
</item>
<item>
<first>639</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>645</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>651</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</second>
</item>
<item>
<first>657</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>663</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>671</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>677</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</second>
</item>
<item>
<first>687</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</second>
</item>
<item>
<first>697</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>705</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
<item>
<first>712</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>718</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</second>
</item>
<item>
<first>724</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>728</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</second>
</item>
<item>
<first>740</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>151</item>
</second>
</item>
<item>
<first>750</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>153</item>
</second>
</item>
<item>
<first>756</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</second>
</item>
<item>
<first>762</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>155</item>
</second>
</item>
<item>
<first>770</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>156</item>
</second>
</item>
<item>
<first>776</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</second>
</item>
<item>
<first>782</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</second>
</item>
<item>
<first>788</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>166</item>
</second>
</item>
<item>
<first>797</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>175</item>
</second>
</item>
<item>
<first>803</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>182</item>
</second>
</item>
<item>
<first>809</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>826</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
<item>
<first>843</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>145</item>
</second>
</item>
<item>
<first>852</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>171</item>
</second>
</item>
<item>
<first>856</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>172</item>
</second>
</item>
<item>
<first>865</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>173</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="46" tracking_level="0" version="0">
<count>58</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>grp_fu_513</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>72</item>
</second>
</item>
<item>
<first>grp_fu_518</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>27</item>
<item>78</item>
</second>
</item>
<item>
<first>grp_fu_523</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>89</item>
</second>
</item>
<item>
<first>grp_fu_528</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>90</item>
</second>
</item>
<item>
<first>grp_fu_533</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>38</item>
<item>91</item>
</second>
</item>
<item>
<first>grp_fu_543</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>47</item>
<item>100</item>
</second>
</item>
<item>
<first>grp_fu_548</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>48</item>
<item>101</item>
</second>
</item>
<item>
<first>grp_fu_553</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>102</item>
</second>
</item>
<item>
<first>not_tmp_EOP_V_i_demo_fu_651</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>112</item>
</second>
</item>
<item>
<first>not_tmp_EOP_V_i_fu_657</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>ol_keyLength_V_flag_s_phi_fu_315</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</second>
</item>
<item>
<first>ol_keyLength_V_load_1_phi_fu_258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>ol_keyLength_V_load_s_phi_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>ol_keyLength_V_new_7_phi_fu_360</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</second>
</item>
<item>
<first>ol_keyLength_V_new_i_phi_fu_306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>169</item>
</second>
</item>
<item>
<first>or_cond1_i_fu_617</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>outputWord_metadata_s_fu_629</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>p_Result_25_fu_724</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>p_Result_33_i_fu_740</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>151</item>
</second>
</item>
<item>
<first>p_Result_s_fu_728</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</second>
</item>
<item>
<first>p_Val2_20_phi_fu_485</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</second>
</item>
<item>
<first>storemerge12_cast_i_fu_663</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>storemerge_i_fu_762</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>155</item>
</second>
</item>
<item>
<first>tmp_135_i_fu_712</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>tmp_138_i_fu_718</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</second>
</item>
<item>
<first>tmp_141_i_fu_750</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>153</item>
</second>
</item>
<item>
<first>tmp_142_i_fu_756</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</second>
</item>
<item>
<first>tmp_147_i_fu_776</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</second>
</item>
<item>
<first>tmp_148_i_fu_782</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</second>
</item>
<item>
<first>tmp_151_i_phi_fu_267</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>tmp_152_i_fu_605</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp_153_i_fu_611</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp_154_i_phi_fu_297</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>tmp_155_i_fu_633</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</second>
</item>
<item>
<first>tmp_156_i_fu_639</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>tmp_1_fu_865</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>173</item>
</second>
</item>
<item>
<first>tmp_218_i_fu_788</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>166</item>
</second>
</item>
<item>
<first>tmp_2_fu_826</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
<item>
<first>tmp_347_fu_697</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>tmp_348_fu_705</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
<item>
<first>tmp_356_fu_852</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>171</item>
</second>
</item>
<item>
<first>tmp_3_fu_809</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>tmp_45_i_fu_843</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>145</item>
</second>
</item>
<item>
<first>tmp_46_i_fu_856</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>172</item>
</second>
</item>
<item>
<first>tmp_EOP_V_5_phi_fu_439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>tmp_EOP_V_fu_645</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>tmp_keyValid_V_3_phi_fu_246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>tmp_keyValid_V_phi_fu_276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>tmp_key_V_6_phi_fu_451</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>tmp_key_V_7_phi_fu_403</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_key_V_phi_fu_506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>170</item>
</second>
</item>
<item>
<first>tmp_operation_V_load_fu_687</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>128</item>
</second>
</item>
<item>
<first>tmp_valueLength_V_lo_fu_677</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>127</item>
</second>
</item>
<item>
<first>tmp_valueValid_V_2_phi_fu_426</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp_valueValid_V_phi_fu_474</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>tmp_value_V_3_phi_fu_462</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>tmp_value_V_4_phi_fu_414</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp_value_V_phi_fu_495</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>160</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>18</count>
<item_version>0</item_version>
<item>
<first>StgValue_101_store_fu_770</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>156</item>
</second>
</item>
<item>
<first>StgValue_110_store_fu_797</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>175</item>
</second>
</item>
<item>
<first>StgValue_115_store_fu_803</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>182</item>
</second>
</item>
<item>
<first>StgValue_35_store_fu_623</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>StgValue_72_store_fu_671</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>grp_nbreadreq_fu_180</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>24</item>
<item>75</item>
<item>135</item>
</second>
</item>
<item>
<first>grp_nbreadreq_fu_188</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>30</item>
<item>81</item>
<item>141</item>
</second>
</item>
<item>
<first>grp_nbreadreq_fu_208</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>69</item>
<item>123</item>
</second>
</item>
<item>
<first>grp_read_fu_196</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>35</item>
<item>88</item>
<item>163</item>
</second>
</item>
<item>
<first>grp_read_fu_202</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>99</item>
<item>152</item>
</second>
</item>
<item>
<first>grp_read_fu_216</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>84</item>
<item>130</item>
</second>
</item>
<item>
<first>grp_store_fu_563</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>50</item>
<item>103</item>
</second>
</item>
<item>
<first>grp_write_fu_236</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>66</item>
<item>117</item>
<item>174</item>
</second>
</item>
<item>
<first>olState_load_load_fu_583</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>ol_keyLength_V_load_load_fu_587</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>ol_valueLength_V_loa_load_fu_596</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp128_read_fu_230</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>126</item>
</second>
</item>
<item>
<first>tmp_nbreadreq_fu_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>120</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>43</count>
<item_version>0</item_version>
<item>
<first>243</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>264</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>273</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>285</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>303</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>169</item>
</second>
</item>
<item>
<first>312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</second>
</item>
<item>
<first>357</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</second>
</item>
<item>
<first>399</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>434</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>447</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>458</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>469</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>482</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</second>
</item>
<item>
<first>491</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>160</item>
</second>
</item>
<item>
<first>502</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>170</item>
</second>
</item>
<item>
<first>569</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>35</item>
<item>88</item>
<item>163</item>
</second>
</item>
<item>
<first>576</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>99</item>
<item>152</item>
</second>
</item>
<item>
<first>882</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>886</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>890</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>894</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>898</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>905</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>909</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>913</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>917</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>921</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>925</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>930</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>935</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>120</item>
</second>
</item>
<item>
<first>939</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>943</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>948</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</second>
</item>
<item>
<first>955</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>959</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>963</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</second>
</item>
<item>
<first>967</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>141</item>
</second>
</item>
<item>
<first>971</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>976</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>43</count>
<item_version>0</item_version>
<item>
<first>olState_load_reg_882</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>ol_keyLength_V_flag_s_reg_312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</second>
</item>
<item>
<first>ol_keyLength_V_load_1_reg_255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>ol_keyLength_V_load_s_reg_285</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>ol_keyLength_V_new_7_reg_357</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</second>
</item>
<item>
<first>ol_keyLength_V_new_i_reg_303</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>169</item>
</second>
</item>
<item>
<first>outputWord_metadata_s_reg_925</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>p_Result_25_reg_971</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>p_Result_s_reg_976</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</second>
</item>
<item>
<first>p_Val2_20_reg_482</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</second>
</item>
<item>
<first>reg_569</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>35</item>
<item>88</item>
<item>163</item>
</second>
</item>
<item>
<first>reg_576</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>99</item>
<item>152</item>
</second>
</item>
<item>
<first>tmp_134_i_reg_909</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>tmp_135_i_reg_955</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>tmp_136_i_reg_894</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>tmp_137_i_reg_917</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>tmp_138_i_reg_963</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</second>
</item>
<item>
<first>tmp_151_i_reg_264</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>tmp_154_i_reg_294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>tmp_344_reg_905</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>tmp_345_reg_939</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>tmp_346_reg_890</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp_347_reg_943</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>tmp_349_reg_913</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>tmp_350_reg_959</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>tmp_351_reg_898</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>tmp_352_reg_921</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>tmp_353_reg_967</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>141</item>
</second>
</item>
<item>
<first>tmp_EOP_V_5_reg_434</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>tmp_EOP_V_reg_930</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>tmp_V_reg_948</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</second>
</item>
<item>
<first>tmp_i_reg_886</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>tmp_keyValid_V_3_reg_243</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>tmp_keyValid_V_reg_273</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>tmp_key_V_6_reg_447</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>tmp_key_V_7_reg_399</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_key_V_reg_502</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>170</item>
</second>
</item>
<item>
<first>tmp_reg_935</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>120</item>
</second>
</item>
<item>
<first>tmp_valueValid_V_2_reg_421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp_valueValid_V_reg_469</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>tmp_value_V_3_reg_458</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>tmp_value_V_4_reg_410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp_value_V_reg_491</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>160</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>19</count>
<item_version>0</item_version>
<item>
<first>243</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>264</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>273</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>285</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>303</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>169</item>
</second>
</item>
<item>
<first>312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</second>
</item>
<item>
<first>357</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</second>
</item>
<item>
<first>399</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>434</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>447</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>458</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>469</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>482</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</second>
</item>
<item>
<first>491</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>160</item>
</second>
</item>
<item>
<first>502</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>170</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>19</count>
<item_version>0</item_version>
<item>
<first>ol_keyLength_V_flag_s_reg_312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</second>
</item>
<item>
<first>ol_keyLength_V_load_1_reg_255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>ol_keyLength_V_load_s_reg_285</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>ol_keyLength_V_new_7_reg_357</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</second>
</item>
<item>
<first>ol_keyLength_V_new_i_reg_303</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>169</item>
</second>
</item>
<item>
<first>p_Val2_20_reg_482</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</second>
</item>
<item>
<first>tmp_151_i_reg_264</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>tmp_154_i_reg_294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>tmp_EOP_V_5_reg_434</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>tmp_keyValid_V_3_reg_243</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>tmp_keyValid_V_reg_273</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>tmp_key_V_6_reg_447</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>tmp_key_V_7_reg_399</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_key_V_reg_502</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>170</item>
</second>
</item>
<item>
<first>tmp_valueValid_V_2_reg_421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp_valueValid_V_reg_469</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>tmp_value_V_3_reg_458</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>tmp_value_V_4_reg_410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp_value_V_reg_491</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>160</item>
</second>
</item>
</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>hashKeyBuffer_V_V</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>nbreadreq</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>135</item>
<item>75</item>
<item>24</item>
</second>
</item>
<item>
<first>read</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>163</item>
<item>88</item>
<item>35</item>
</second>
</item>
</second>
</item>
<item>
<first>hashMdBuffer_V_V</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>nbreadreq</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>123</item>
<item>69</item>
</second>
</item>
<item>
<first>read</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>130</item>
<item>84</item>
</second>
</item>
</second>
</item>
<item>
<first>hashTable2Dram_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>174</item>
<item>117</item>
<item>66</item>
</second>
</item>
</second>
</item>
<item>
<first>hashValueBuffer_V_V</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>nbreadreq</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>141</item>
<item>81</item>
<item>30</item>
</second>
</item>
<item>
<first>read</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>152</item>
<item>99</item>
<item>46</item>
</second>
</item>
</second>
</item>
<item>
<first>memWr2out_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>120</item>
</second>
</item>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>126</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>4</first>
<second>FIFO</second>
</item>
<item>
<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>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 26.220642 | 105 | 0.602999 |
5e5b42d3b410ad4a99827c9dfb32f18cf612465b | 18,597 | adb | Ada | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/call.sched.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-06-18T16:51:39.000Z | 2020-06-18T16:51:39.000Z | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/call.sched.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | null | null | null | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/call.sched.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-03-18T00:43:22.000Z | 2020-03-18T00:43:22.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>call</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>in_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_stream.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>out_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_stream.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>288</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>4</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>slice_stream_V_value</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>172</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</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>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>172</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>slice_stream.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>96</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>19</item>
<item>20</item>
<item>21</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
<item>25</item>
<item>135</item>
<item>136</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</fileDirectory>
<lineNumber>219</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>219</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>2</type>
<id>16</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_8">
<Value>
<Obj>
<type>2</type>
<id>18</id>
<name>call_Loop_LB2D_buf_p</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:call_Loop_LB2D_buf_p></content>
</item>
<item class_id_reference="16" object_id="_9">
<Value>
<Obj>
<type>2</type>
<id>22</id>
<name>call_Loop_LB2D_shift</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:call_Loop_LB2D_shift></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="_10">
<Obj>
<type>3</type>
<id>15</id>
<name>call</name>
<fileName></fileName>
<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>8</item>
<item>12</item>
<item>13</item>
<item>14</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_11">
<id>17</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_12">
<id>19</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_13">
<id>20</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_14">
<id>21</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_15">
<id>23</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_16">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_17">
<id>25</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_18">
<id>135</id>
<edge_type>4</edge_type>
<source_obj>12</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_19">
<id>136</id>
<edge_type>4</edge_type>
<source_obj>12</source_obj>
<sink_obj>13</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_20">
<mId>1</mId>
<mTag>call</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>15</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2077921</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>1</mIsDfPipe>
<mDfPipe class_id="23" tracking_level="1" version="0" object_id="_21">
<port_list class_id="24" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port_list>
<process_list 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="_22">
<type>0</type>
<name>call_Loop_LB2D_buf_p_U0</name>
<ssdmobj_id>12</ssdmobj_id>
<pins class_id="27" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_23">
<port class_id="29" tracking_level="1" version="0" object_id="_24">
<name>in_stream_V_value_V</name>
<dir>0</dir>
<type>0</type>
</port>
<inst class_id="30" tracking_level="1" version="0" object_id="_25">
<type>0</type>
<name>call_Loop_LB2D_buf_p_U0</name>
<ssdmobj_id>12</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_26">
<port class_id_reference="29" object_id="_27">
<name>slice_stream_V_value_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_25"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_28">
<type>0</type>
<name>call_Loop_LB2D_shift_U0</name>
<ssdmobj_id>13</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_29">
<port class_id_reference="29" object_id="_30">
<name>slice_stream_V_value_V</name>
<dir>0</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_31">
<type>0</type>
<name>call_Loop_LB2D_shift_U0</name>
<ssdmobj_id>13</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_32">
<port class_id_reference="29" object_id="_33">
<name>out_stream_V_value_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_31"></inst>
</item>
</pins>
</item>
</process_list>
<channel_list class_id="31" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="1" version="0" object_id="_34">
<type>1</type>
<name>slice_stream_V_value</name>
<ssdmobj_id>8</ssdmobj_id>
<ctype>0</ctype>
<depth>1</depth>
<bitwidth>96</bitwidth>
<source class_id_reference="28" object_id="_35">
<port class_id_reference="29" object_id="_36">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_25"></inst>
</source>
<sink class_id_reference="28" object_id="_37">
<port class_id_reference="29" object_id="_38">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_31"></inst>
</sink>
</item>
</channel_list>
<net_list class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</net_list>
</mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="36" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="37" tracking_level="0" version="0">
<first>8</first>
<second class_id="38" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="39" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>15</first>
<second class_id="41" tracking_level="0" version="0">
<first>0</first>
<second>3</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="42" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="1" version="0" object_id="_39">
<region_name>call</region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</basic_blocks>
<nodes>
<count>12</count>
<item_version>0</item_version>
<item>3</item>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>16</region_type>
<interval>0</interval>
<pipe_depth>0</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="44" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="45" 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="46" 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="47" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="48" 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>
| 29.148903 | 140 | 0.61725 |
8b6badb944ef04313b35a48f112d6f663bf6b8e4 | 1,980 | ads | Ada | tier-1/clib/source/thin/clib.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/clib/source/thin/clib.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/clib/source/thin/clib.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do *not* modify by hand.
--
with Swig;
with Interfaces.C;
with Interfaces.C.Pointers;
with Interfaces.C.Strings;
with System;
package clib is
-- time_t
--
subtype time_t is Interfaces.C.long;
type time_t_array is
array (Interfaces.C.size_t range <>) of aliased clib.time_t;
-- FILE
--
subtype FILE is Swig.void;
type FILE_array is
array (Interfaces.C.size_t range <>) of aliased clib.FILE;
use type Interfaces.C.long;
a_SYS_CDEFS_H : constant := 1;
a_LIBC_LIMITS_H_a : constant := 1;
MB_LEN_MAX : constant := 16;
a_LIMITS_H : constant := 1;
CHAR_BIT : constant := 8;
SCHAR_MIN : constant := -128;
SCHAR_MAX : constant := 127;
UCHAR_MAX : constant := 255;
CHAR_MIN : constant := -128;
CHAR_MAX : constant := 127;
SHRT_MIN : constant := -32768;
SHRT_MAX : constant := 32767;
USHRT_MAX : constant := 65535;
INT_MAX : constant := 2147483647;
UINT_MAX : aliased constant Interfaces.C.unsigned := 4294967295;
LONG_MAX : aliased constant Interfaces.C.long := 2147483647;
LONG_MIN : aliased constant Interfaces.C.long := -2147483648;
ULONG_MAX : aliased constant Interfaces.C.unsigned_long := 4294967295;
a_LOCALE_H : constant := 1;
a_MATH_H : constant := 1;
end clib;
| 41.25 | 77 | 0.447475 |
5e6d1d0380da0f5a63153bfa10ba31f48f0b8254 | 5,067 | ads | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-valuer.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-valuer.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-valuer.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L U E _ R --
-- --
-- S p e c --
-- --
-- Copyright (C) 2020-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains routines for scanning real values for use in
-- Text_IO.Decimal_IO, Fixed_IO, Float_IO and the Value attribute.
with System.Unsigned_Types; use System.Unsigned_Types;
generic
type Uns is mod <>;
Precision_Limit : Uns;
Round : Boolean;
package System.Value_R is
pragma Preelaborate;
function Scan_Raw_Real
(Str : String;
Ptr : not null access Integer;
Max : Integer;
Base : out Unsigned;
Scale : out Integer;
Extra : out Unsigned;
Minus : out Boolean) return Uns;
-- This function scans the string starting at Str (Ptr.all) for a valid
-- real literal according to the syntax described in (RM 3.5(43)). The
-- substring scanned extends no further than Str (Max). There are three
-- cases for the return:
--
-- If a valid real is found after scanning past any initial spaces, then
-- Ptr.all is updated past the last character of the real (but trailing
-- spaces are not scanned out) and the Base, Scale, Extra and Minus out
-- parameters are set; if Val is the result of the call, then the real
-- represented by the literal is equal to
--
-- (Val * Base + Extra) * (Base ** (Scale - 1))
--
-- with the negative sign if Minus is true.
--
-- If no valid real is found, then Ptr.all points either to an initial
-- non-blank character, or to Max + 1 if the field is all spaces and the
-- exception Constraint_Error is raised.
--
-- If a syntactically valid real is scanned, but the value is out of
-- range, or, in the based case, the base value is out of range or there
-- is an out of range digit, then Ptr.all points past the real literal,
-- and Constraint_Error is raised.
--
-- Note: these rules correspond to the requirements for leaving the
-- pointer positioned in Text_Io.Get
--
-- Note: if Str is null, i.e. if Max is less than Ptr, then this is a
-- special case of an all-blank string, and Ptr is unchanged, and hence
-- is greater than Max as required in this case.
--
-- Note: this routine should not be called with Str'Last = Positive'Last.
-- If this occurs Program_Error is raised with a message noting that this
-- case is not supported. Most such cases are eliminated by the caller.
function Value_Raw_Real
(Str : String;
Base : out Unsigned;
Scale : out Integer;
Extra : out Unsigned;
Minus : out Boolean) return Uns;
-- Used in computing X'Value (Str) where X is a real type. Str is the
-- string argument of the attribute. Constraint_Error is raised if the
-- string is malformed.
end System.Value_R;
| 49.676471 | 78 | 0.494573 |
5ecc66d7259b4274ab6a72e2f632605e1b3a0a81 | 1,681 | ads | Ada | src/util.ads | docandrew/YOTROC | 502fd34441e81c41002a99ab6f5e3a763c1d7c56 | [
"Unlicense"
] | 4 | 2020-01-08T20:06:41.000Z | 2022-03-11T22:29:51.000Z | src/util.ads | docandrew/YOTROC | 502fd34441e81c41002a99ab6f5e3a763c1d7c56 | [
"Unlicense"
] | null | null | null | src/util.ads | docandrew/YOTROC | 502fd34441e81c41002a99ab6f5e3a763c1d7c56 | [
"Unlicense"
] | null | null | null | with Interfaces; use Interfaces;
with Ada.Text_IO;
with Ada.Unchecked_Conversion;
package util is
function rawLongFloatBits is new Ada.Unchecked_Conversion(Long_Float, Unsigned_64);
function rawFloatBits is new Ada.Unchecked_Conversion(Float, Unsigned_32);
function toDouble is new Ada.Unchecked_Conversion(Unsigned_64, Long_Float);
function fromFloatImmediate is new Ada.Unchecked_Conversion(Unsigned_32, Float);
type HexDigitRange is range 0..15;
type HexDigitsType is array (HexDigitRange) of Character;
hexdigits : constant HexDigitsType := "0123456789ABCDEF";
type DigitRange is range 0..9;
type DigitsType is array (DigitRange) of Character;
decdigits : constant DigitsType := "0123456789";
subtype HexString32 is String (1..10);
subtype HexString64 is String (1..18);
subtype DecString32 is String (1..11);
-- Convert unsigned integers to hex strings
function toHexString(r : in Unsigned_32) return HexString32;
function toHexString(r : in Unsigned_64) return HexString64;
--function toString(r : Integer) return String;
subtype byteOffset is Natural range 0..7;
-- utility functions for setting certiain bytes in a word
procedure setByte(byte : in byteOffset; val : in Unsigned_8; word : in out Unsigned_64);
procedure setLoWord(val : in Unsigned_32; word : in out Unsigned_64);
procedure setHiWord(val : in Unsigned_32; word : in out Unsigned_64);
function getHiWord(word : in Unsigned_64) return Unsigned_32;
function getLoWord(word : in Unsigned_64) return Unsigned_32;
function getByte(byte : in byteOffset; word : in Unsigned_64) return Unsigned_8;
end util;
| 42.025 | 92 | 0.750149 |
04b87d6894e4171799bcc3c83bfc31bc6a12b576 | 24,771 | ads | Ada | tools/scitools/conf/understand/ada/ada12/a-cohase.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/a-cohase.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/a-cohase.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . H A S H E D _ S E T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2012, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Iterator_Interfaces;
private with Ada.Containers.Hash_Tables;
private with Ada.Streams;
private with Ada.Finalization;
generic
type Element_Type is private;
with function Hash (Element : Element_Type) return Hash_Type;
with function Equivalent_Elements
(Left, Right : Element_Type) return Boolean;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Hashed_Sets is
pragma Preelaborate;
pragma Remote_Types;
type Set is tagged private
with
Constant_Indexing => Constant_Reference,
Default_Iterator => Iterate,
Iterator_Element => Element_Type;
pragma Preelaborable_Initialization (Set);
type Cursor is private;
pragma Preelaborable_Initialization (Cursor);
Empty_Set : constant Set;
-- Set objects declared without an initialization expression are
-- initialized to the value Empty_Set.
No_Element : constant Cursor;
-- Cursor objects declared without an initialization expression are
-- initialized to the value No_Element.
function Has_Element (Position : Cursor) return Boolean;
-- Equivalent to Position /= No_Element
package Set_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
function "=" (Left, Right : Set) return Boolean;
-- For each element in Left, set equality attempts to find the equal
-- element in Right; if a search fails, then set equality immediately
-- returns False. The search works by calling Hash to find the bucket in
-- the Right set that corresponds to the Left element. If the bucket is
-- non-empty, the search calls the generic formal element equality operator
-- to compare the element (in Left) to the element of each node in the
-- bucket (in Right); the search terminates when a matching node in the
-- bucket is found, or the nodes in the bucket are exhausted. (Note that
-- element equality is called here, not Equivalent_Elements. Set equality
-- is the only operation in which element equality is used. Compare set
-- equality to Equivalent_Sets, which does call Equivalent_Elements.)
function Equivalent_Sets (Left, Right : Set) return Boolean;
-- Similar to set equality, with the difference that the element in Left is
-- compared to the elements in Right using the generic formal
-- Equivalent_Elements operation instead of element equality.
function To_Set (New_Item : Element_Type) return Set;
-- Constructs a singleton set comprising New_Element. To_Set calls Hash to
-- determine the bucket for New_Item.
function Capacity (Container : Set) return Count_Type;
-- Returns the current capacity of the set. Capacity is the maximum length
-- before which rehashing in guaranteed not to occur.
procedure Reserve_Capacity (Container : in out Set; Capacity : Count_Type);
-- Adjusts the current capacity, by allocating a new buckets array. If the
-- requested capacity is less than the current capacity, then the capacity
-- is contracted (to a value not less than the current length). If the
-- requested capacity is greater than the current capacity, then the
-- capacity is expanded (to a value not less than what is requested). In
-- either case, the nodes are rehashed from the old buckets array onto the
-- new buckets array (Hash is called once for each existing element in
-- order to compute the new index), and then the old buckets array is
-- deallocated.
function Length (Container : Set) return Count_Type;
-- Returns the number of items in the set
function Is_Empty (Container : Set) return Boolean;
-- Equivalent to Length (Container) = 0
procedure Clear (Container : in out Set);
-- Removes all of the items from the set
function Element (Position : Cursor) return Element_Type;
-- Returns the element of the node designated by the cursor
procedure Replace_Element
(Container : in out Set;
Position : Cursor;
New_Item : Element_Type);
-- If New_Item is equivalent (as determined by calling Equivalent_Elements)
-- to the element of the node designated by Position, then New_Element is
-- assigned to that element. Otherwise, it calls Hash to determine the
-- bucket for New_Item. If the bucket is not empty, then it calls
-- Equivalent_Elements for each node in that bucket to determine whether
-- New_Item is equivalent to an element in that bucket. If
-- Equivalent_Elements returns True then Program_Error is raised (because
-- an element may appear only once in the set); otherwise, New_Item is
-- assigned to the node designated by Position, and the node is moved to
-- its new bucket.
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
-- Calls Process with the element (having only a constant view) of the node
-- designed by the cursor.
type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
function Constant_Reference
(Container : aliased Set;
Position : Cursor) return Constant_Reference_Type;
pragma Inline (Constant_Reference);
procedure Assign (Target : in out Set; Source : Set);
function Copy (Source : Set; Capacity : Count_Type := 0) return Set;
procedure Move (Target : in out Set; Source : in out Set);
-- Clears Target (if it's not empty), and then moves (not copies) the
-- buckets array and nodes from Source to Target.
procedure Insert
(Container : in out Set;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean);
-- Conditionally inserts New_Item into the set. If New_Item is already in
-- the set, then Inserted returns False and Position designates the node
-- containing the existing element (which is not modified). If New_Item is
-- not already in the set, then Inserted returns True and Position
-- designates the newly-inserted node containing New_Item. The search for
-- an existing element works as follows. Hash is called to determine
-- New_Item's bucket; if the bucket is non-empty, then Equivalent_Elements
-- is called to compare New_Item to the element of each node in that
-- bucket. If the bucket is empty, or there were no equivalent elements in
-- the bucket, the search "fails" and the New_Item is inserted in the set
-- (and Inserted returns True); otherwise, the search "succeeds" (and
-- Inserted returns False).
procedure Insert (Container : in out Set; New_Item : Element_Type);
-- Attempts to insert New_Item into the set, performing the usual insertion
-- search (which involves calling both Hash and Equivalent_Elements); if
-- the search succeeds (New_Item is equivalent to an element already in the
-- set, and so was not inserted), then this operation raises
-- Constraint_Error. (This version of Insert is similar to Replace, but
-- having the opposite exception behavior. It is intended for use when you
-- want to assert that the item is not already in the set.)
procedure Include (Container : in out Set; New_Item : Element_Type);
-- Attempts to insert New_Item into the set. If an element equivalent to
-- New_Item is already in the set (the insertion search succeeded, and
-- hence New_Item was not inserted), then the value of New_Item is assigned
-- to the existing element. (This insertion operation only raises an
-- exception if cursor tampering occurs. It is intended for use when you
-- want to insert the item in the set, and you don't care whether an
-- equivalent element is already present.)
procedure Replace (Container : in out Set; New_Item : Element_Type);
-- Searches for New_Item in the set; if the search fails (because an
-- equivalent element was not in the set), then it raises
-- Constraint_Error. Otherwise, the existing element is assigned the value
-- New_Item. (This is similar to Insert, but with the opposite exception
-- behavior. It is intended for use when you want to assert that the item
-- is already in the set.)
procedure Exclude (Container : in out Set; Item : Element_Type);
-- Searches for Item in the set, and if found, removes its node from the
-- set and then deallocates it. The search works as follows. The operation
-- calls Hash to determine the item's bucket; if the bucket is not empty,
-- it calls Equivalent_Elements to compare Item to the element of each node
-- in the bucket. (This is the deletion analog of Include. It is intended
-- for use when you want to remove the item from the set, but don't care
-- whether the item is already in the set.)
procedure Delete (Container : in out Set; Item : Element_Type);
-- Searches for Item in the set (which involves calling both Hash and
-- Equivalent_Elements). If the search fails, then the operation raises
-- Constraint_Error. Otherwise it removes the node from the set and then
-- deallocates it. (This is the deletion analog of non-conditional
-- Insert. It is intended for use when you want to assert that the item is
-- already in the set.)
procedure Delete (Container : in out Set; Position : in out Cursor);
-- Removes the node designated by Position from the set, and then
-- deallocates the node. The operation calls Hash to determine the bucket,
-- and then compares Position to each node in the bucket until there's a
-- match (it does not call Equivalent_Elements).
procedure Union (Target : in out Set; Source : Set);
-- The operation first calls Reserve_Capacity if the current capacity is
-- less than the sum of the lengths of Source and Target. It then iterates
-- over the Source set, and conditionally inserts each element into Target.
function Union (Left, Right : Set) return Set;
-- The operation first copies the Left set to the result, and then iterates
-- over the Right set to conditionally insert each element into the result.
function "or" (Left, Right : Set) return Set renames Union;
procedure Intersection (Target : in out Set; Source : Set);
-- Iterates over the Target set (calling First and Next), calling Find to
-- determine whether the element is in Source. If an equivalent element is
-- not found in Source, the element is deleted from Target.
function Intersection (Left, Right : Set) return Set;
-- Iterates over the Left set, calling Find to determine whether the
-- element is in Right. If an equivalent element is found, it is inserted
-- into the result set.
function "and" (Left, Right : Set) return Set renames Intersection;
procedure Difference (Target : in out Set; Source : Set);
-- Iterates over the Source (calling First and Next), calling Find to
-- determine whether the element is in Target. If an equivalent element is
-- found, it is deleted from Target.
function Difference (Left, Right : Set) return Set;
-- Iterates over the Left set, calling Find to determine whether the
-- element is in the Right set. If an equivalent element is not found, the
-- element is inserted into the result set.
function "-" (Left, Right : Set) return Set renames Difference;
procedure Symmetric_Difference (Target : in out Set; Source : Set);
-- The operation first calls Reserve_Capacity if the current capacity is
-- less than the sum of the lengths of Source and Target. It then iterates
-- over the Source set, searching for the element in Target (calling Hash
-- and Equivalent_Elements). If an equivalent element is found, it is
-- removed from Target; otherwise it is inserted into Target.
function Symmetric_Difference (Left, Right : Set) return Set;
-- The operation first iterates over the Left set. It calls Find to
-- determine whether the element is in the Right set. If no equivalent
-- element is found, the element from Left is inserted into the result. The
-- operation then iterates over the Right set, to determine whether the
-- element is in the Left set. If no equivalent element is found, the Right
-- element is inserted into the result.
function "xor" (Left, Right : Set) return Set
renames Symmetric_Difference;
function Overlap (Left, Right : Set) return Boolean;
-- Iterates over the Left set (calling First and Next), calling Find to
-- determine whether the element is in the Right set. If an equivalent
-- element is found, the operation immediately returns True. The operation
-- returns False if the iteration over Left terminates without finding any
-- equivalent element in Right.
function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
-- Iterates over Subset (calling First and Next), calling Find to determine
-- whether the element is in Of_Set. If no equivalent element is found in
-- Of_Set, the operation immediately returns False. The operation returns
-- True if the iteration over Subset terminates without finding an element
-- not in Of_Set (that is, every element in Subset is equivalent to an
-- element in Of_Set).
function First (Container : Set) return Cursor;
-- Returns a cursor that designates the first non-empty bucket, by
-- searching from the beginning of the buckets array.
function Next (Position : Cursor) return Cursor;
-- Returns a cursor that designates the node that follows the current one
-- designated by Position. If Position designates the last node in its
-- bucket, the operation calls Hash to compute the index of this bucket,
-- and searches the buckets array for the first non-empty bucket, starting
-- from that index; otherwise, it simply follows the link to the next node
-- in the same bucket.
procedure Next (Position : in out Cursor);
-- Equivalent to Position := Next (Position)
function Find
(Container : Set;
Item : Element_Type) return Cursor;
-- Searches for Item in the set. Find calls Hash to determine the item's
-- bucket; if the bucket is not empty, it calls Equivalent_Elements to
-- compare Item to each element in the bucket. If the search succeeds, Find
-- returns a cursor designating the node containing the equivalent element;
-- otherwise, it returns No_Element.
function Contains (Container : Set; Item : Element_Type) return Boolean;
-- Equivalent to Find (Container, Item) /= No_Element
function Equivalent_Elements (Left, Right : Cursor) return Boolean;
-- Returns the result of calling Equivalent_Elements with the elements of
-- the nodes designated by cursors Left and Right.
function Equivalent_Elements
(Left : Cursor;
Right : Element_Type) return Boolean;
-- Returns the result of calling Equivalent_Elements with element of the
-- node designated by Left and element Right.
function Equivalent_Elements
(Left : Element_Type;
Right : Cursor) return Boolean;
-- Returns the result of calling Equivalent_Elements with element Left and
-- the element of the node designated by Right.
procedure Iterate
(Container : Set;
Process : not null access procedure (Position : Cursor));
-- Calls Process for each node in the set
function Iterate
(Container : Set) return Set_Iterator_Interfaces.Forward_Iterator'Class;
generic
type Key_Type (<>) is private;
with function Key (Element : Element_Type) return Key_Type;
with function Hash (Key : Key_Type) return Hash_Type;
with function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
package Generic_Keys is
function Key (Position : Cursor) return Key_Type;
-- Applies generic formal operation Key to the element of the node
-- designated by Position.
function Element (Container : Set; Key : Key_Type) return Element_Type;
-- Searches (as per the key-based Find) for the node containing Key, and
-- returns the associated element.
procedure Replace
(Container : in out Set;
Key : Key_Type;
New_Item : Element_Type);
-- Searches (as per the key-based Find) for the node containing Key, and
-- then replaces the element of that node (as per the element-based
-- Replace_Element).
procedure Exclude (Container : in out Set; Key : Key_Type);
-- Searches for Key in the set, and if found, removes its node from the
-- set and then deallocates it. The search works by first calling Hash
-- (on Key) to determine the bucket; if the bucket is not empty, it
-- calls Equivalent_Keys to compare parameter Key to the value of
-- generic formal operation Key applied to element of each node in the
-- bucket.
procedure Delete (Container : in out Set; Key : Key_Type);
-- Deletes the node containing Key as per Exclude, with the difference
-- that Constraint_Error is raised if Key is not found.
function Find (Container : Set; Key : Key_Type) return Cursor;
-- Searches for the node containing Key, and returns a cursor
-- designating the node. The search works by first calling Hash (on Key)
-- to determine the bucket. If the bucket is not empty, the search
-- compares Key to the element of each node in the bucket, and returns
-- the matching node. The comparison itself works by applying the
-- generic formal Key operation to the element of the node, and then
-- calling generic formal operation Equivalent_Keys.
function Contains (Container : Set; Key : Key_Type) return Boolean;
-- Equivalent to Find (Container, Key) /= No_Element
procedure Update_Element_Preserving_Key
(Container : in out Set;
Position : Cursor;
Process : not null access
procedure (Element : in out Element_Type));
-- Calls Process with the element of the node designated by Position,
-- but with the restriction that the key-value of the element is not
-- modified. The operation first makes a copy of the value returned by
-- applying generic formal operation Key on the element of the node, and
-- then calls Process with the element. The operation verifies that the
-- key-part has not been modified by calling generic formal operation
-- Equivalent_Keys to compare the saved key-value to the value returned
-- by applying generic formal operation Key to the post-Process value of
-- element. If the key values compare equal then the operation
-- completes. Otherwise, the node is removed from the set and
-- Program_Error is raised.
type Reference_Type (Element : not null access Element_Type) is private
with Implicit_Dereference => Element;
function Reference_Preserving_Key
(Container : aliased in out Set;
Position : Cursor) return Reference_Type;
function Constant_Reference
(Container : aliased Set;
Key : Key_Type) return Constant_Reference_Type;
function Reference_Preserving_Key
(Container : aliased in out Set;
Key : Key_Type) return Reference_Type;
private
type Reference_Type (Element : not null access Element_Type)
is null record;
use Ada.Streams;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type);
for Reference_Type'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type);
for Reference_Type'Write use Write;
end Generic_Keys;
private
pragma Inline (Next);
type Node_Type;
type Node_Access is access Node_Type;
type Node_Type is limited record
Element : aliased Element_Type;
Next : Node_Access;
end record;
package HT_Types is
new Hash_Tables.Generic_Hash_Table_Types (Node_Type, Node_Access);
type Set is new Ada.Finalization.Controlled with record
HT : HT_Types.Hash_Table_Type;
end record;
overriding procedure Adjust (Container : in out Set);
overriding procedure Finalize (Container : in out Set);
use HT_Types;
use Ada.Finalization;
use Ada.Streams;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Set);
for Set'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Set);
for Set'Read use Read;
type Set_Access is access all Set;
for Set_Access'Storage_Size use 0;
type Cursor is record
Container : Set_Access;
Node : Node_Access;
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Cursor);
for Cursor'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Cursor);
for Cursor'Read use Read;
type Reference_Control_Type is
new Controlled with record
Container : Set_Access;
end record;
overriding procedure Adjust (Control : in out Reference_Control_Type);
pragma Inline (Adjust);
overriding procedure Finalize (Control : in out Reference_Control_Type);
pragma Inline (Finalize);
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
record
Control : Reference_Control_Type;
end record;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type);
for Constant_Reference_Type'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type);
for Constant_Reference_Type'Write use Write;
Empty_Set : constant Set := (Controlled with HT => (null, 0, 0, 0));
No_Element : constant Cursor := (Container => null, Node => null);
end Ada.Containers.Hashed_Sets;
| 45.285192 | 79 | 0.668887 |
8b6fdd48174d52ab29864be7c108d1ff21c6b37e | 17,162 | ads | Ada | Trident/obj/b__main.ads | alexbarker/Nuclear_Submarine_Control_System | 5c198bbf959a77f32e421553055558aef8e0be5c | [
"MIT"
] | 1 | 2021-04-04T12:56:50.000Z | 2021-04-04T12:56:50.000Z | Trident/obj/b__main.ads | alexbarker/Nuclear_Submarine_Control_System | 5c198bbf959a77f32e421553055558aef8e0be5c | [
"MIT"
] | null | null | null | Trident/obj/b__main.ads | alexbarker/Nuclear_Submarine_Control_System | 5c198bbf959a77f32e421553055558aef8e0be5c | [
"MIT"
] | null | null | null | pragma Warnings (Off);
pragma Ada_95;
with System;
with System.Parameters;
with System.Secondary_Stack;
package ada_main is
gnat_argc : Integer;
gnat_argv : System.Address;
gnat_envp : System.Address;
pragma Import (C, gnat_argc);
pragma Import (C, gnat_argv);
pragma Import (C, gnat_envp);
gnat_exit_status : Integer;
pragma Import (C, gnat_exit_status);
GNAT_Version : constant String :=
"GNAT Version: Community 2018 (20180523-73)" & ASCII.NUL;
pragma Export (C, GNAT_Version, "__gnat_version");
Ada_Main_Program_Name : constant String := "_ada_main" & ASCII.NUL;
pragma Export (C, Ada_Main_Program_Name, "__gnat_ada_main_program_name");
procedure adainit;
pragma Export (C, adainit, "adainit");
procedure adafinal;
pragma Export (C, adafinal, "adafinal");
function main
(argc : Integer;
argv : System.Address;
envp : System.Address)
return Integer;
pragma Export (C, main, "main");
type Version_32 is mod 2 ** 32;
u00001 : constant Version_32 := 16#1c853a6a#;
pragma Export (C, u00001, "mainB");
u00002 : constant Version_32 := 16#050ff2f0#;
pragma Export (C, u00002, "system__standard_libraryB");
u00003 : constant Version_32 := 16#35869f17#;
pragma Export (C, u00003, "system__standard_libraryS");
u00004 : constant Version_32 := 16#76789da1#;
pragma Export (C, u00004, "adaS");
u00005 : constant Version_32 := 16#927a893f#;
pragma Export (C, u00005, "ada__text_ioB");
u00006 : constant Version_32 := 16#25015822#;
pragma Export (C, u00006, "ada__text_ioS");
u00007 : constant Version_32 := 16#b11c5006#;
pragma Export (C, u00007, "ada__exceptionsB");
u00008 : constant Version_32 := 16#2ccb9557#;
pragma Export (C, u00008, "ada__exceptionsS");
u00009 : constant Version_32 := 16#5726abed#;
pragma Export (C, u00009, "ada__exceptions__last_chance_handlerB");
u00010 : constant Version_32 := 16#41e5552e#;
pragma Export (C, u00010, "ada__exceptions__last_chance_handlerS");
u00011 : constant Version_32 := 16#32a08138#;
pragma Export (C, u00011, "systemS");
u00012 : constant Version_32 := 16#ae860117#;
pragma Export (C, u00012, "system__soft_linksB");
u00013 : constant Version_32 := 16#77a38a8e#;
pragma Export (C, u00013, "system__soft_linksS");
u00014 : constant Version_32 := 16#87be2c0f#;
pragma Export (C, u00014, "system__secondary_stackB");
u00015 : constant Version_32 := 16#77347921#;
pragma Export (C, u00015, "system__secondary_stackS");
u00016 : constant Version_32 := 16#86dbf443#;
pragma Export (C, u00016, "system__parametersB");
u00017 : constant Version_32 := 16#7a4cd513#;
pragma Export (C, u00017, "system__parametersS");
u00018 : constant Version_32 := 16#ced09590#;
pragma Export (C, u00018, "system__storage_elementsB");
u00019 : constant Version_32 := 16#1f63cb3c#;
pragma Export (C, u00019, "system__storage_elementsS");
u00020 : constant Version_32 := 16#75bf515c#;
pragma Export (C, u00020, "system__soft_links__initializeB");
u00021 : constant Version_32 := 16#5697fc2b#;
pragma Export (C, u00021, "system__soft_links__initializeS");
u00022 : constant Version_32 := 16#41837d1e#;
pragma Export (C, u00022, "system__stack_checkingB");
u00023 : constant Version_32 := 16#bc1fead0#;
pragma Export (C, u00023, "system__stack_checkingS");
u00024 : constant Version_32 := 16#34742901#;
pragma Export (C, u00024, "system__exception_tableB");
u00025 : constant Version_32 := 16#6f0ee87a#;
pragma Export (C, u00025, "system__exception_tableS");
u00026 : constant Version_32 := 16#ce4af020#;
pragma Export (C, u00026, "system__exceptionsB");
u00027 : constant Version_32 := 16#5ac3ecce#;
pragma Export (C, u00027, "system__exceptionsS");
u00028 : constant Version_32 := 16#80916427#;
pragma Export (C, u00028, "system__exceptions__machineB");
u00029 : constant Version_32 := 16#3bad9081#;
pragma Export (C, u00029, "system__exceptions__machineS");
u00030 : constant Version_32 := 16#aa0563fc#;
pragma Export (C, u00030, "system__exceptions_debugB");
u00031 : constant Version_32 := 16#4c2a78fc#;
pragma Export (C, u00031, "system__exceptions_debugS");
u00032 : constant Version_32 := 16#6c2f8802#;
pragma Export (C, u00032, "system__img_intB");
u00033 : constant Version_32 := 16#307b61fa#;
pragma Export (C, u00033, "system__img_intS");
u00034 : constant Version_32 := 16#39df8c17#;
pragma Export (C, u00034, "system__tracebackB");
u00035 : constant Version_32 := 16#6c825ffc#;
pragma Export (C, u00035, "system__tracebackS");
u00036 : constant Version_32 := 16#9ed49525#;
pragma Export (C, u00036, "system__traceback_entriesB");
u00037 : constant Version_32 := 16#32fb7748#;
pragma Export (C, u00037, "system__traceback_entriesS");
u00038 : constant Version_32 := 16#9ad5ad12#;
pragma Export (C, u00038, "system__traceback__symbolicB");
u00039 : constant Version_32 := 16#c84061d1#;
pragma Export (C, u00039, "system__traceback__symbolicS");
u00040 : constant Version_32 := 16#179d7d28#;
pragma Export (C, u00040, "ada__containersS");
u00041 : constant Version_32 := 16#701f9d88#;
pragma Export (C, u00041, "ada__exceptions__tracebackB");
u00042 : constant Version_32 := 16#20245e75#;
pragma Export (C, u00042, "ada__exceptions__tracebackS");
u00043 : constant Version_32 := 16#e865e681#;
pragma Export (C, u00043, "system__bounded_stringsB");
u00044 : constant Version_32 := 16#455da021#;
pragma Export (C, u00044, "system__bounded_stringsS");
u00045 : constant Version_32 := 16#74f70e62#;
pragma Export (C, u00045, "system__crtlS");
u00046 : constant Version_32 := 16#d5de7583#;
pragma Export (C, u00046, "system__dwarf_linesB");
u00047 : constant Version_32 := 16#f4013fc9#;
pragma Export (C, u00047, "system__dwarf_linesS");
u00048 : constant Version_32 := 16#5b4659fa#;
pragma Export (C, u00048, "ada__charactersS");
u00049 : constant Version_32 := 16#8f637df8#;
pragma Export (C, u00049, "ada__characters__handlingB");
u00050 : constant Version_32 := 16#3b3f6154#;
pragma Export (C, u00050, "ada__characters__handlingS");
u00051 : constant Version_32 := 16#4b7bb96a#;
pragma Export (C, u00051, "ada__characters__latin_1S");
u00052 : constant Version_32 := 16#e6d4fa36#;
pragma Export (C, u00052, "ada__stringsS");
u00053 : constant Version_32 := 16#96df1a3f#;
pragma Export (C, u00053, "ada__strings__mapsB");
u00054 : constant Version_32 := 16#1e526bec#;
pragma Export (C, u00054, "ada__strings__mapsS");
u00055 : constant Version_32 := 16#a21ad5cd#;
pragma Export (C, u00055, "system__bit_opsB");
u00056 : constant Version_32 := 16#0765e3a3#;
pragma Export (C, u00056, "system__bit_opsS");
u00057 : constant Version_32 := 16#0626fdbb#;
pragma Export (C, u00057, "system__unsigned_typesS");
u00058 : constant Version_32 := 16#92f05f13#;
pragma Export (C, u00058, "ada__strings__maps__constantsS");
u00059 : constant Version_32 := 16#5ab55268#;
pragma Export (C, u00059, "interfacesS");
u00060 : constant Version_32 := 16#a0d3d22b#;
pragma Export (C, u00060, "system__address_imageB");
u00061 : constant Version_32 := 16#934c1c02#;
pragma Export (C, u00061, "system__address_imageS");
u00062 : constant Version_32 := 16#ec78c2bf#;
pragma Export (C, u00062, "system__img_unsB");
u00063 : constant Version_32 := 16#99d2c14c#;
pragma Export (C, u00063, "system__img_unsS");
u00064 : constant Version_32 := 16#d7aac20c#;
pragma Export (C, u00064, "system__ioB");
u00065 : constant Version_32 := 16#ace27677#;
pragma Export (C, u00065, "system__ioS");
u00066 : constant Version_32 := 16#3080f2ca#;
pragma Export (C, u00066, "system__mmapB");
u00067 : constant Version_32 := 16#08d13e5f#;
pragma Export (C, u00067, "system__mmapS");
u00068 : constant Version_32 := 16#92d882c5#;
pragma Export (C, u00068, "ada__io_exceptionsS");
u00069 : constant Version_32 := 16#a82e20f9#;
pragma Export (C, u00069, "system__mmap__os_interfaceB");
u00070 : constant Version_32 := 16#8f4541b8#;
pragma Export (C, u00070, "system__mmap__os_interfaceS");
u00071 : constant Version_32 := 16#35737c3a#;
pragma Export (C, u00071, "system__os_libB");
u00072 : constant Version_32 := 16#d8e681fb#;
pragma Export (C, u00072, "system__os_libS");
u00073 : constant Version_32 := 16#ec4d5631#;
pragma Export (C, u00073, "system__case_utilB");
u00074 : constant Version_32 := 16#0d75376c#;
pragma Export (C, u00074, "system__case_utilS");
u00075 : constant Version_32 := 16#2a8e89ad#;
pragma Export (C, u00075, "system__stringsB");
u00076 : constant Version_32 := 16#52b6adad#;
pragma Export (C, u00076, "system__stringsS");
u00077 : constant Version_32 := 16#769e25e6#;
pragma Export (C, u00077, "interfaces__cB");
u00078 : constant Version_32 := 16#467817d8#;
pragma Export (C, u00078, "interfaces__cS");
u00079 : constant Version_32 := 16#40d3d043#;
pragma Export (C, u00079, "system__object_readerB");
u00080 : constant Version_32 := 16#ec38df4d#;
pragma Export (C, u00080, "system__object_readerS");
u00081 : constant Version_32 := 16#1a74a354#;
pragma Export (C, u00081, "system__val_lliB");
u00082 : constant Version_32 := 16#a8846798#;
pragma Export (C, u00082, "system__val_lliS");
u00083 : constant Version_32 := 16#afdbf393#;
pragma Export (C, u00083, "system__val_lluB");
u00084 : constant Version_32 := 16#7cd4aac9#;
pragma Export (C, u00084, "system__val_lluS");
u00085 : constant Version_32 := 16#269742a9#;
pragma Export (C, u00085, "system__val_utilB");
u00086 : constant Version_32 := 16#9e0037c6#;
pragma Export (C, u00086, "system__val_utilS");
u00087 : constant Version_32 := 16#d7bf3f29#;
pragma Export (C, u00087, "system__exception_tracesB");
u00088 : constant Version_32 := 16#167fa1a2#;
pragma Export (C, u00088, "system__exception_tracesS");
u00089 : constant Version_32 := 16#d178f226#;
pragma Export (C, u00089, "system__win32S");
u00090 : constant Version_32 := 16#8c33a517#;
pragma Export (C, u00090, "system__wch_conB");
u00091 : constant Version_32 := 16#29dda3ea#;
pragma Export (C, u00091, "system__wch_conS");
u00092 : constant Version_32 := 16#9721e840#;
pragma Export (C, u00092, "system__wch_stwB");
u00093 : constant Version_32 := 16#04cc8feb#;
pragma Export (C, u00093, "system__wch_stwS");
u00094 : constant Version_32 := 16#a831679c#;
pragma Export (C, u00094, "system__wch_cnvB");
u00095 : constant Version_32 := 16#266a1919#;
pragma Export (C, u00095, "system__wch_cnvS");
u00096 : constant Version_32 := 16#ece6fdb6#;
pragma Export (C, u00096, "system__wch_jisB");
u00097 : constant Version_32 := 16#a61a0038#;
pragma Export (C, u00097, "system__wch_jisS");
u00098 : constant Version_32 := 16#10558b11#;
pragma Export (C, u00098, "ada__streamsB");
u00099 : constant Version_32 := 16#67e31212#;
pragma Export (C, u00099, "ada__streamsS");
u00100 : constant Version_32 := 16#d398a95f#;
pragma Export (C, u00100, "ada__tagsB");
u00101 : constant Version_32 := 16#12a0afb8#;
pragma Export (C, u00101, "ada__tagsS");
u00102 : constant Version_32 := 16#796f31f1#;
pragma Export (C, u00102, "system__htableB");
u00103 : constant Version_32 := 16#b66232d2#;
pragma Export (C, u00103, "system__htableS");
u00104 : constant Version_32 := 16#089f5cd0#;
pragma Export (C, u00104, "system__string_hashB");
u00105 : constant Version_32 := 16#143c59ac#;
pragma Export (C, u00105, "system__string_hashS");
u00106 : constant Version_32 := 16#73d2d764#;
pragma Export (C, u00106, "interfaces__c_streamsB");
u00107 : constant Version_32 := 16#b1330297#;
pragma Export (C, u00107, "interfaces__c_streamsS");
u00108 : constant Version_32 := 16#ec083f01#;
pragma Export (C, u00108, "system__file_ioB");
u00109 : constant Version_32 := 16#95d1605d#;
pragma Export (C, u00109, "system__file_ioS");
u00110 : constant Version_32 := 16#86c56e5a#;
pragma Export (C, u00110, "ada__finalizationS");
u00111 : constant Version_32 := 16#95817ed8#;
pragma Export (C, u00111, "system__finalization_rootB");
u00112 : constant Version_32 := 16#7d52f2a8#;
pragma Export (C, u00112, "system__finalization_rootS");
u00113 : constant Version_32 := 16#cf3f1b90#;
pragma Export (C, u00113, "system__file_control_blockS");
u00114 : constant Version_32 := 16#7268f812#;
pragma Export (C, u00114, "system__img_boolB");
u00115 : constant Version_32 := 16#c779f0d3#;
pragma Export (C, u00115, "system__img_boolS");
u00116 : constant Version_32 := 16#273384e4#;
pragma Export (C, u00116, "system__img_enum_newB");
u00117 : constant Version_32 := 16#53ec87f8#;
pragma Export (C, u00117, "system__img_enum_newS");
u00118 : constant Version_32 := 16#4a2a7486#;
pragma Export (C, u00118, "tridentB");
u00119 : constant Version_32 := 16#9f7507a7#;
pragma Export (C, u00119, "tridentS");
u00120 : constant Version_32 := 16#5dc07a5a#;
pragma Export (C, u00120, "system__memoryB");
u00121 : constant Version_32 := 16#6bdde70c#;
pragma Export (C, u00121, "system__memoryS");
-- BEGIN ELABORATION ORDER
-- ada%s
-- ada.characters%s
-- ada.characters.latin_1%s
-- interfaces%s
-- system%s
-- system.img_bool%s
-- system.img_bool%b
-- system.img_enum_new%s
-- system.img_enum_new%b
-- system.img_int%s
-- system.img_int%b
-- system.io%s
-- system.io%b
-- system.parameters%s
-- system.parameters%b
-- system.crtl%s
-- interfaces.c_streams%s
-- interfaces.c_streams%b
-- system.storage_elements%s
-- system.storage_elements%b
-- system.stack_checking%s
-- system.stack_checking%b
-- system.string_hash%s
-- system.string_hash%b
-- system.htable%s
-- system.htable%b
-- system.strings%s
-- system.strings%b
-- system.traceback_entries%s
-- system.traceback_entries%b
-- system.unsigned_types%s
-- system.img_uns%s
-- system.img_uns%b
-- system.wch_con%s
-- system.wch_con%b
-- system.wch_jis%s
-- system.wch_jis%b
-- system.wch_cnv%s
-- system.wch_cnv%b
-- system.traceback%s
-- system.traceback%b
-- system.case_util%s
-- system.standard_library%s
-- system.exception_traces%s
-- ada.exceptions%s
-- system.wch_stw%s
-- system.val_util%s
-- system.val_llu%s
-- system.val_lli%s
-- system.os_lib%s
-- system.bit_ops%s
-- ada.characters.handling%s
-- ada.exceptions.traceback%s
-- system.secondary_stack%s
-- system.case_util%b
-- system.address_image%s
-- system.bounded_strings%s
-- system.soft_links%s
-- system.exception_table%s
-- system.exception_table%b
-- ada.io_exceptions%s
-- ada.strings%s
-- ada.containers%s
-- system.exceptions%s
-- system.exceptions%b
-- ada.exceptions.last_chance_handler%s
-- system.exceptions_debug%s
-- system.exceptions_debug%b
-- system.exception_traces%b
-- system.memory%s
-- system.memory%b
-- system.wch_stw%b
-- system.val_util%b
-- system.val_llu%b
-- system.val_lli%b
-- interfaces.c%s
-- system.win32%s
-- system.mmap%s
-- system.mmap.os_interface%s
-- system.mmap.os_interface%b
-- system.mmap%b
-- system.os_lib%b
-- system.bit_ops%b
-- ada.strings.maps%s
-- ada.strings.maps.constants%s
-- ada.characters.handling%b
-- ada.exceptions.traceback%b
-- system.exceptions.machine%s
-- system.exceptions.machine%b
-- system.secondary_stack%b
-- system.address_image%b
-- system.bounded_strings%b
-- system.soft_links.initialize%s
-- system.soft_links.initialize%b
-- system.soft_links%b
-- ada.exceptions.last_chance_handler%b
-- system.standard_library%b
-- system.object_reader%s
-- system.dwarf_lines%s
-- system.dwarf_lines%b
-- interfaces.c%b
-- ada.strings.maps%b
-- system.traceback.symbolic%s
-- system.traceback.symbolic%b
-- ada.exceptions%b
-- system.object_reader%b
-- ada.tags%s
-- ada.tags%b
-- ada.streams%s
-- ada.streams%b
-- system.file_control_block%s
-- system.finalization_root%s
-- system.finalization_root%b
-- ada.finalization%s
-- system.file_io%s
-- system.file_io%b
-- ada.text_io%s
-- ada.text_io%b
-- trident%s
-- trident%b
-- main%b
-- END ELABORATION ORDER
end ada_main;
| 42.063725 | 78 | 0.673115 |
4bb98754804fdcdfcdcdf04e67030e683d395fad | 924 | ads | Ada | Sources/Globe_3d/models/dreadnought.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-21T09:40:34.000Z | 2019-09-21T09:40:34.000Z | Sources/Globe_3d/models/dreadnought.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | null | null | null | Sources/Globe_3d/models/dreadnought.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-25T12:29:27.000Z | 2019-09-25T12:29:27.000Z | -- * Output of max2ada.ms, a GMax / 3D Studio Max script for exporting to GLOBE_3D
--
-- * Copy and paste these lines from the Listener into a
-- text editor, and save the package as an .ada file.
-- * Alternatively, use the GMaxSLGRAB.exe tool.
-- * For GNAT, you must save the specification as an .ads file
-- and the body as an .adb file, or run gnatchop on the whole .ada file.
-- Title : Dreadnought
-- Subject : Dreadnought class Heavy Cruiser : a space cruiser inspired by Sulaco from Aliens.
-- Author : Xenodroid
-- File name : dreadnought_g3d.gmax
-- File path : C:\Ada\GL\3dmodels\dreadnought\
with GLOBE_3D;
package Dreadnought is
procedure Create (
object : in out GLOBE_3D.p_Object_3D;
scale : GLOBE_3D.Real;
centre : GLOBE_3D.Point_3D;
alum_001,
grumnoir,
tole_001,
alum_002 : GLOBE_3D.Image_ID
);
end Dreadnought;
| 30.8 | 96 | 0.666667 |
8b0651d2422a744abb665762536cce96f1a728a5 | 917 | adb | Ada | src/my_generic_package.adb | thierr26/gnatdoc_test | 20e4001f23d325e4e9d4a9aa9656353d193706b1 | [
"Unlicense"
] | null | null | null | src/my_generic_package.adb | thierr26/gnatdoc_test | 20e4001f23d325e4e9d4a9aa9656353d193706b1 | [
"Unlicense"
] | null | null | null | src/my_generic_package.adb | thierr26/gnatdoc_test | 20e4001f23d325e4e9d4a9aa9656353d193706b1 | [
"Unlicense"
] | null | null | null | package body My_Generic_Package is
----------------------------------------------------------------------------
function Is_Flat (A : Array_Type) return Boolean
is (
A'Length < 2
or else (for all K in Index_Type'Succ (A'First) .. A'Last
=> A(K) = A(A'First))
);
----------------------------------------------------------------------------
function Is_Monotone (A : Array_Type) return Boolean
is (
A'Length < 3
or else (for all K in Index_Type'Succ (A'First) .. A'Last
=> A(K) < A(Index_Type'Pred (K))
or A(K) = A(Index_Type'Pred (K)))
or else (for all K in Index_Type'Succ (A'First) .. A'Last
=> A(Index_Type'Pred (K)) < A(K)
or A(K) = A(Index_Type'Pred (K)))
);
----------------------------------------------------------------------------
end My_Generic_Package;
| 32.75 | 79 | 0.391494 |
9a0f31dae78384e3789ebbaf9930c52065a79a28 | 762 | ads | Ada | mat/src/parser/mat-expressions-parser_tokens.ads | stcarrez/mat | fb242feb5662b8130680cd06e50da7ef40b95bd7 | [
"Apache-2.0"
] | 7 | 2015-01-18T23:04:30.000Z | 2021-04-06T14:07:56.000Z | mat/src/parser/mat-expressions-parser_tokens.ads | stcarrez/mat | fb242feb5662b8130680cd06e50da7ef40b95bd7 | [
"Apache-2.0"
] | null | null | null | mat/src/parser/mat-expressions-parser_tokens.ads | stcarrez/mat | fb242feb5662b8130680cd06e50da7ef40b95bd7 | [
"Apache-2.0"
] | null | null | null | pragma Style_Checks (Off);
package Mat.Expressions.Parser_Tokens is
subtype yystype is MAT.Expressions.yystype;
YYLVal, YYVal : YYSType;
type Token is
(End_Of_Input, Error, T_Name, T_Int,
T_String, T_Select, T_With,
T_At, T_By, T_In,
T_Not, T_Or, T_And,
T_Size, T_Addr, T_From,
T_Begin, T_End, T_To,
T_Reallocation, T_All, T_Unot,
T_Within, T_Use, T_After,
T_Before, T_Direct, T_Is,
T_Malloc, T_Realloc, T_Free,
T_Leak, T_No_Free, T_Thread,
T_Range, T_Event, T_Time,
T_Lt, T_Le, T_Gt,
T_Ge, T_Ne, T_Eq,
T_Has, '[', ']',
'(', ')', ',' );
Syntax_Error : exception;
end Mat.Expressions.Parser_Tokens;
| 26.275862 | 46 | 0.582677 |
19d477f35988a99b1be83c9c5cf8f52c1de90f82 | 5,091 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/g-boubuf.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/g-boubuf.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/g-boubuf.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . B O U N D E D _ B U F F E R S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2003-2006, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This package provides a thread-safe generic bounded buffer abstraction.
-- Instances are useful directly or as parts of the implementations of other
-- abstractions, such as mailboxes.
-- Bounded_Buffer is declared explicitly as a protected type, rather than as
-- a simple limited private type completed as a protected type, so that
-- clients may make calls accordingly (i.e., conditional/timed entry calls).
with System;
generic
type Element is private;
-- The type of the values contained within buffer objects
package GNAT.Bounded_Buffers is
pragma Pure;
type Content is array (Positive range <>) of Element;
-- Content is an internal artefact that cannot be hidden because protected
-- types cannot contain type declarations.
Default_Ceiling : constant System.Priority := System.Default_Priority;
-- A convenience value for the Ceiling discriminant
protected type Bounded_Buffer
(Capacity : Positive;
-- Objects of type Bounded_Buffer specify the maximum number of Element
-- values they can hold via the discriminant Capacity.
Ceiling : System.Priority)
-- Users must specify the ceiling priority for the object. If the
-- Real-Time Systems Annex is not in use this value is not important.
is
pragma Priority (Ceiling);
entry Insert (Item : Element);
-- Insert Item into the buffer, blocks caller until space is available
entry Remove (Item : out Element);
-- Remove next available Element from buffer. Blocks caller until an
-- Element is available.
function Empty return Boolean;
-- Returns whether the instance contains any Elements.
-- Note: State may change immediately after call returns.
function Full return Boolean;
-- Returns whether any space remains within the instance.
-- Note: State may change immediately after call returns.
function Extent return Natural;
-- Returns the number of Element values currently held
-- within the instance.
-- Note: State may change immediately after call returns.
private
Values : Content (1 .. Capacity);
-- The container for the values held by the buffer instance
Next_In : Positive := 1;
-- The index of the next Element inserted. Wraps around
Next_Out : Positive := 1;
-- The index of the next Element removed. Wraps around
Count : Natural := 0;
-- The number of Elements currently held
end Bounded_Buffer;
end GNAT.Bounded_Buffers;
| 48.951923 | 78 | 0.551954 |
3873edb4a8d72a4f7679296087d81300e7177617 | 3,709 | ads | Ada | src/core/concurrent/util-concurrent-pools.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 60 | 2015-01-18T23:05:34.000Z | 2022-03-20T18:56:30.000Z | src/core/concurrent/util-concurrent-pools.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 20 | 2016-09-15T16:41:30.000Z | 2022-03-29T22:02:32.000Z | src/core/concurrent/util-concurrent-pools.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 10 | 2015-02-13T04:00:45.000Z | 2022-03-20T18:57:54.000Z | -----------------------------------------------------------------------
-- util-concurrent-pools -- Concurrent Pools
-- Copyright (C) 2011, 2015, 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 Ada.Finalization;
-- The <b>Util.Concurrent.Pools</b> generic defines a pool of objects which
-- can be shared by multiple threads. First, the pool is configured to have
-- a number of objects by using the <b>Set_Size</b> procedure. Then, a thread
-- that needs an object uses the <b>Get_Instance</b> to get an object.
-- The object is removed from the pool. As soon as the thread has finished,
-- it puts back the object in the pool using the <b>Release</b> procedure.
--
-- The <b>Get_Instance</b> entry will block until an object is available.
generic
type Element_Type is private;
package Util.Concurrent.Pools is
pragma Preelaborate;
FOREVER : constant Duration := -1.0;
-- Exception raised if the Get_Instance timeout exceeded.
Timeout : exception;
-- Pool of objects
type Pool is limited new Ada.Finalization.Limited_Controlled with private;
-- Get an element instance from the pool.
-- Wait until one instance gets available.
procedure Get_Instance (From : in out Pool;
Item : out Element_Type;
Wait : in Duration := FOREVER);
-- Put the element back to the pool.
procedure Release (Into : in out Pool;
Item : in Element_Type);
-- Set the pool size.
procedure Set_Size (Into : in out Pool;
Capacity : in Positive);
-- Get the number of available elements in the pool.
procedure Get_Available (From : in out Pool;
Available : out Natural);
-- Release the pool elements.
overriding
procedure Finalize (Object : in out Pool);
private
-- To store the pool elements, we use an array which is allocated dynamically
-- by the <b>Set_Size</b> protected operation. The generated code is smaller
-- compared to the use of Ada vectors container.
type Element_Array is array (Positive range <>) of Element_Type;
type Element_Array_Access is access all Element_Array;
Null_Element_Array : constant Element_Array_Access := null;
-- Pool of objects
protected type Protected_Pool is
-- Get an element instance from the pool.
-- Wait until one instance gets available.
entry Get_Instance (Item : out Element_Type);
-- Put the element back to the pool.
procedure Release (Item : in Element_Type);
-- Set the pool size.
procedure Set_Size (Capacity : in Natural);
-- Get the number of available elements.
function Get_Available return Natural;
private
Available : Natural := 0;
Elements : Element_Array_Access := Null_Element_Array;
end Protected_Pool;
type Pool is limited new Ada.Finalization.Limited_Controlled with record
List : Protected_Pool;
end record;
end Util.Concurrent.Pools;
| 36.722772 | 81 | 0.65732 |
a04058dce2f3127ac8aec68f9971087506c1f2b7 | 5,618 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-imgenu.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/s-imgenu.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/s-imgenu.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ E N U M --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 2000 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Unchecked_Conversion;
package body System.Img_Enum is
-------------------------
-- Image_Enumeration_8 --
-------------------------
function Image_Enumeration_8
(Pos : Natural;
Names : String;
Indexes : System.Address)
return String
is
type Natural_8 is range 0 .. 2 ** 7 - 1;
type Index_Table is array (Natural) of Natural_8;
type Index_Table_Ptr is access Index_Table;
function To_Index_Table_Ptr is
new Unchecked_Conversion (System.Address, Index_Table_Ptr);
IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
Start : Natural := Natural (IndexesT (Pos));
Next : Natural := Natural (IndexesT (Pos + 1));
subtype Result_Type is String (1 .. Next - Start);
-- We need this result type to force the result to have the
-- required lower bound of 1, rather than the slice bounds.
begin
return Result_Type (Names (Start .. Next - 1));
end Image_Enumeration_8;
--------------------------
-- Image_Enumeration_16 --
--------------------------
function Image_Enumeration_16
(Pos : Natural;
Names : String;
Indexes : System.Address)
return String
is
type Natural_16 is range 0 .. 2 ** 15 - 1;
type Index_Table is array (Natural) of Natural_16;
type Index_Table_Ptr is access Index_Table;
function To_Index_Table_Ptr is
new Unchecked_Conversion (System.Address, Index_Table_Ptr);
IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
Start : Natural := Natural (IndexesT (Pos));
Next : Natural := Natural (IndexesT (Pos + 1));
subtype Result_Type is String (1 .. Next - Start);
-- We need this result type to force the result to have the
-- required lower bound of 1, rather than the slice bounds.
begin
return Result_Type (Names (Start .. Next - 1));
end Image_Enumeration_16;
--------------------------
-- Image_Enumeration_32 --
--------------------------
function Image_Enumeration_32
(Pos : Natural;
Names : String;
Indexes : System.Address)
return String
is
type Natural_32 is range 0 .. 2 ** 31 - 1;
type Index_Table is array (Natural) of Natural_32;
type Index_Table_Ptr is access Index_Table;
function To_Index_Table_Ptr is
new Unchecked_Conversion (System.Address, Index_Table_Ptr);
IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
Start : Natural := Natural (IndexesT (Pos));
Next : Natural := Natural (IndexesT (Pos + 1));
subtype Result_Type is String (1 .. Next - Start);
-- We need this result type to force the result to have the
-- required lower bound of 1, rather than the slice bounds.
begin
return Result_Type (Names (Start .. Next - 1));
end Image_Enumeration_32;
end System.Img_Enum;
| 42.885496 | 78 | 0.509078 |
8b7b5533e578d26a5a9a64da3403a1c877f54cd4 | 1,738 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_glx_get_mapdv_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_mapdv_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_mapdv_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with swig;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_get_mapdv_reply_t is
-- Item
--
type Item is record
response_type : aliased Interfaces.Unsigned_8;
pad0 : aliased Interfaces.Unsigned_8;
sequence : aliased Interfaces.Unsigned_16;
length : aliased Interfaces.Unsigned_32;
pad1 : aliased swig.int8_t_Array (0 .. 3);
n : aliased Interfaces.Unsigned_32;
datum : aliased xcb.xcb_glx_float64_t;
pad2 : aliased swig.int8_t_Array (0 .. 7);
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_glx_get_mapdv_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_mapdv_reply_t.Item,
Element_Array => xcb.xcb_glx_get_mapdv_reply_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_glx_get_mapdv_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_mapdv_reply_t.Pointer,
Element_Array => xcb.xcb_glx_get_mapdv_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_mapdv_reply_t;
| 29.457627 | 78 | 0.651323 |
5e2320adcdff41ab1861acc2ad793b59b3632593 | 12,728 | adb | Ada | external/ncurses/Ada95/samples/ncurses2-demo_panels.adb | Arogon-project/arogon | f226e910348e1799daa478ab5191ced1777f8aa6 | [
"BSD-3-Clause"
] | 6 | 2019-06-24T03:09:47.000Z | 2022-02-06T13:50:34.000Z | external/ncurses/Ada95/samples/ncurses2-demo_panels.adb | Arogon-project/arogon | f226e910348e1799daa478ab5191ced1777f8aa6 | [
"BSD-3-Clause"
] | null | null | null | external/ncurses/Ada95/samples/ncurses2-demo_panels.adb | Arogon-project/arogon | f226e910348e1799daa478ab5191ced1777f8aa6 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- ncurses --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 2000-2011,2018 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Eugene V. Melaragno <[email protected]> 2000
-- Version Control
-- $Revision: 1.8 $
-- $Date: 2018/07/07 23:31:02 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with ncurses2.util; use ncurses2.util;
with Terminal_Interface.Curses; use Terminal_Interface.Curses;
with Terminal_Interface.Curses.Panels; use Terminal_Interface.Curses.Panels;
with Terminal_Interface.Curses.Panels.User_Data;
with ncurses2.genericPuts;
procedure ncurses2.demo_panels (nap_mseci : Integer) is
function mkpanel (color : Color_Number;
rows : Line_Count;
cols : Column_Count;
tly : Line_Position;
tlx : Column_Position) return Panel;
procedure rmpanel (pan : in out Panel);
procedure pflush;
procedure wait_a_while (msec : Integer);
procedure saywhat (text : String);
procedure fill_panel (pan : Panel);
nap_msec : Integer := nap_mseci;
function mkpanel (color : Color_Number;
rows : Line_Count;
cols : Column_Count;
tly : Line_Position;
tlx : Column_Position) return Panel is
win : Window;
pan : Panel := Null_Panel;
begin
win := New_Window (rows, cols, tly, tlx);
if Null_Window /= win then
pan := New_Panel (win);
if pan = Null_Panel then
Delete (win);
elsif Has_Colors then
declare
fg, bg : Color_Number;
begin
if color = Blue then
fg := White;
else
fg := Black;
end if;
bg := color;
Init_Pair (Color_Pair (color), fg, bg);
Set_Background (win, (Ch => ' ',
Attr => Normal_Video,
Color => Color_Pair (color)));
end;
else
Set_Background (win, (Ch => ' ',
Attr => (Bold_Character => True,
others => False),
Color => Color_Pair (color)));
end if;
end if;
return pan;
end mkpanel;
procedure rmpanel (pan : in out Panel) is
win : Window := Panel_Window (pan);
begin
Delete (pan);
Delete (win);
end rmpanel;
procedure pflush is
begin
Update_Panels;
Update_Screen;
end pflush;
procedure wait_a_while (msec : Integer) is
begin
-- The C version had some #ifdef blocks here
if msec = 1 then
Getchar;
else
Nap_Milli_Seconds (msec);
end if;
end wait_a_while;
procedure saywhat (text : String) is
begin
Move_Cursor (Line => Lines - 1, Column => 0);
Clear_To_End_Of_Line;
Add (Str => text);
end saywhat;
-- from sample-curses_demo.adb
type User_Data is new String (1 .. 2);
type User_Data_Access is access all User_Data;
package PUD is new Panels.User_Data (User_Data, User_Data_Access);
use PUD;
procedure fill_panel (pan : Panel) is
win : constant Window := Panel_Window (pan);
num : constant Character := Get_User_Data (pan).all (2);
tmp6 : String (1 .. 6) := "-panx-";
maxy : Line_Count;
maxx : Column_Count;
begin
Move_Cursor (win, 1, 1);
tmp6 (5) := num;
Add (win, Str => tmp6);
Clear_To_End_Of_Line (win);
Box (win);
Get_Size (win, maxy, maxx);
for y in 2 .. maxy - 3 loop
for x in 1 .. maxx - 3 loop
Move_Cursor (win, y, x);
Add (win, num);
end loop;
end loop;
exception
when Curses_Exception => null;
end fill_panel;
modstr : constant array (0 .. 5) of String (1 .. 5) :=
("test ",
"TEST ",
"(**) ",
"*()* ",
"<--> ",
"LAST "
);
package p is new ncurses2.genericPuts (1024);
use p;
use p.BS;
-- the C version said register int y, x;
tmpb : BS.Bounded_String;
begin
Refresh;
for y in 0 .. Integer (Lines - 2) loop
for x in 0 .. Integer (Columns - 1) loop
myPut (tmpb, (y + x) mod 10);
myAdd (Str => tmpb);
end loop;
end loop;
for y in 0 .. 4 loop
declare
p1, p2, p3, p4, p5 : Panel;
U1 : constant User_Data_Access := new User_Data'("p1");
U2 : constant User_Data_Access := new User_Data'("p2");
U3 : constant User_Data_Access := new User_Data'("p3");
U4 : constant User_Data_Access := new User_Data'("p4");
U5 : constant User_Data_Access := new User_Data'("p5");
begin
p1 := mkpanel (Red, Lines / 2 - 2, Columns / 8 + 1, 0, 0);
Set_User_Data (p1, U1);
p2 := mkpanel (Green, Lines / 2 + 1, Columns / 7, Lines / 4,
Columns / 10);
Set_User_Data (p2, U2);
p3 := mkpanel (Yellow, Lines / 4, Columns / 10, Lines / 2,
Columns / 9);
Set_User_Data (p3, U3);
p4 := mkpanel (Blue, Lines / 2 - 2, Columns / 8, Lines / 2 - 2,
Columns / 3);
Set_User_Data (p4, U4);
p5 := mkpanel (Magenta, Lines / 2 - 2, Columns / 8, Lines / 2,
Columns / 2 - 2);
Set_User_Data (p5, U5);
fill_panel (p1);
fill_panel (p2);
fill_panel (p3);
fill_panel (p4);
fill_panel (p5);
Hide (p4);
Hide (p5);
pflush;
saywhat ("press any key to continue");
wait_a_while (nap_msec);
saywhat ("h3 s1 s2 s4 s5; press any key to continue");
Move (p1, 0, 0);
Hide (p3);
Show (p1);
Show (p2);
Show (p4);
Show (p5);
pflush;
wait_a_while (nap_msec);
saywhat ("s1; press any key to continue");
Show (p1);
pflush;
wait_a_while (nap_msec);
saywhat ("s2; press any key to continue");
Show (p2);
pflush;
wait_a_while (nap_msec);
saywhat ("m2; press any key to continue");
Move (p2, Lines / 3 + 1, Columns / 8);
pflush;
wait_a_while (nap_msec);
saywhat ("s3;");
Show (p3);
pflush;
wait_a_while (nap_msec);
saywhat ("m3; press any key to continue");
Move (p3, Lines / 4 + 1, Columns / 15);
pflush;
wait_a_while (nap_msec);
saywhat ("b3; press any key to continue");
Bottom (p3);
pflush;
wait_a_while (nap_msec);
saywhat ("s4; press any key to continue");
Show (p4);
pflush;
wait_a_while (nap_msec);
saywhat ("s5; press any key to continue");
Show (p5);
pflush;
wait_a_while (nap_msec);
saywhat ("t3; press any key to continue");
Top (p3);
pflush;
wait_a_while (nap_msec);
saywhat ("t1; press any key to continue");
Top (p1);
pflush;
wait_a_while (nap_msec);
saywhat ("t2; press any key to continue");
Top (p2);
pflush;
wait_a_while (nap_msec);
saywhat ("t3; press any key to continue");
Top (p3);
pflush;
wait_a_while (nap_msec);
saywhat ("t4; press any key to continue");
Top (p4);
pflush;
wait_a_while (nap_msec);
for itmp in 0 .. 5 loop
declare
w4 : constant Window := Panel_Window (p4);
w5 : constant Window := Panel_Window (p5);
begin
saywhat ("m4; press any key to continue");
Move_Cursor (w4, Lines / 8, 1);
Add (w4, modstr (itmp));
Move (p4, Lines / 6, Column_Position (itmp) * (Columns / 8));
Move_Cursor (w5, Lines / 6, 1);
Add (w5, modstr (itmp));
pflush;
wait_a_while (nap_msec);
saywhat ("m5; press any key to continue");
Move_Cursor (w4, Lines / 6, 1);
Add (w4, modstr (itmp));
Move (p5, Lines / 3 - 1, (Column_Position (itmp) * 10) + 6);
Move_Cursor (w5, Lines / 8, 1);
Add (w5, modstr (itmp));
pflush;
wait_a_while (nap_msec);
end;
end loop;
saywhat ("m4; press any key to continue");
Move (p4, Lines / 6, 6 * (Columns / 8));
-- Move(p4, Lines / 6, itmp * (Columns / 8));
pflush;
wait_a_while (nap_msec);
saywhat ("t5; press any key to continue");
Top (p5);
pflush;
wait_a_while (nap_msec);
saywhat ("t2; press any key to continue");
Top (p2);
pflush;
wait_a_while (nap_msec);
saywhat ("t1; press any key to continue");
Top (p1);
pflush;
wait_a_while (nap_msec);
saywhat ("d2; press any key to continue");
rmpanel (p2);
pflush;
wait_a_while (nap_msec);
saywhat ("h3; press any key to continue");
Hide (p3);
pflush;
wait_a_while (nap_msec);
saywhat ("d1; press any key to continue");
rmpanel (p1);
pflush;
wait_a_while (nap_msec);
saywhat ("d4; press any key to continue");
rmpanel (p4);
pflush;
wait_a_while (nap_msec);
saywhat ("d5; press any key to continue");
rmpanel (p5);
pflush;
wait_a_while (nap_msec);
if nap_msec = 1 then
exit;
else
nap_msec := 100;
end if;
end;
end loop;
Erase;
End_Windows;
end ncurses2.demo_panels;
| 33.319372 | 78 | 0.47698 |
1919ff2186f2c20fc3cffac75d1a3ecde98f0150 | 2,988 | ads | Ada | src/shared/generic/lsc-internal-pad32.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 30 | 2018-05-18T09:11:50.000Z | 2021-05-18T16:29:14.000Z | src/shared/generic/lsc-internal-pad32.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 15 | 2018-12-13T07:53:36.000Z | 2019-09-24T19:43:35.000Z | src/shared/generic/lsc-internal-pad32.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 3 | 2019-04-04T17:41:29.000Z | 2021-05-07T22:28:46.000Z | -------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- Copyright (C) 2010, Alexander Senier
-- Copyright (C) 2010, secunet Security Networks AG
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
--
-- * Neither the name of the nor the names of its contributors may be used
-- to endorse or promote products derived from this software without
-- specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
-- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with LSC.Internal.Types;
use type LSC.Internal.Types.Word32;
use type LSC.Internal.Types.Word64;
use type LSC.Internal.Types.Index;
-------------------------------------------------------------------------------
-- Cryptographic padding for arrays of 32-bit words
-------------------------------------------------------------------------------
package LSC.Internal.Pad32
is
pragma Pure;
-- Terminate a Word32 array
--
-- The array @Block@ is terminated by setting the bit at (@Length@ + 1) to 1
-- and all following bits to 0.
--
procedure Block_Terminate
(Block : in out Types.Word32_Array_Type;
Length : in Types.Word64)
--
-- <strong> NOTE: The postcondition currently does not completely express
-- the intended behaviour of the operation! </strong>
--
with
Depends => (Block =>+ Length),
Pre =>
Length / 32 + 1 <= Block'Length,
Post =>
(for all I in Types.Index range
Block'First + Types.Index (Length / 32) + 1 .. Block'Last => (Block (I) = 0));
end LSC.Internal.Pad32;
| 43.941176 | 90 | 0.620817 |
04233e655d35f4be5405b47255a2f2d3d773ad83 | 25,748 | adb | Ada | runtime/ravenscar-sfp-stm32f427/math/s-libdou.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | runtime/ravenscar-sfp-stm32f427/math/s-libdou.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | runtime/ravenscar-sfp-stm32f427/math/s-libdou.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . L I B M _ D O U B L E --
-- --
-- B o d y --
-- --
-- Copyright (C) 2014-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. --
-- --
-- --
-- --
-- --
-- --
-- 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 Ada Cert Math specific version of s-libdou.adb
-- When Cody and Waite implementation is cited, it refers to the
-- Software Manual for the Elementary Functions by William J. Cody, Jr.
-- and William Waite, published by Prentice-Hall Series in Computational
-- Mathematics. Copyright 1980. ISBN 0-13-822064-6.
-- When Hart implementation is cited, it refers to
-- "Computer Approximations" by John F. Hart, published by Krieger.
-- Copyright 1968, Reprinted 1978 w/ corrections. ISBN 0-88275-642-7.
with Ada.Numerics; use Ada.Numerics;
with System.Libm; use System.Libm;
with System.Libm_Double.Squareroot;
package body System.Libm_Double is
subtype LF is Long_Float;
pragma Assert (LF'Machine_Radix = 2);
pragma Assert (LF'Machine_Mantissa = 53);
LF_HM : constant Integer := Long_Float'Machine_Mantissa / 2;
Sqrt_Epsilon_LF : constant Long_Float :=
Sqrt_2 ** (1 - Long_Float'Machine_Mantissa);
type Long_Float_Table is array (Positive range <>) of Long_Float;
-- A1 (i) = Float (2**((1-i)/16))
A1_Tab_LF : constant Long_Float_Table :=
(1.0,
Long_Float'Machine (Root16_Half),
Long_Float'Machine (Root16_Half**2),
Long_Float'Machine (Root16_Half**3),
Long_Float'Machine (Root16_Half**4),
Long_Float'Machine (Root16_Half**5),
Long_Float'Machine (Root16_Half**6),
Long_Float'Machine (Root16_Half**7),
Long_Float'Machine (Root16_Half**8),
Long_Float'Machine (Root16_Half**9),
Long_Float'Machine (Root16_Half**10),
Long_Float'Machine (Root16_Half**11),
Long_Float'Machine (Root16_Half**12),
Long_Float'Machine (Root16_Half**13),
Long_Float'Machine (Root16_Half**14),
Long_Float'Machine (Root16_Half**15),
0.5);
-- A2 (i) = 2**((1-2i)/16) - A1(2i)
A2_Tab_LF : constant Long_Float_Table :=
(Root16_Half - Long_Float'Machine (Root16_Half),
Root16_Half**3 - Long_Float'Machine (Root16_Half**3),
Root16_Half**5 - Long_Float'Machine (Root16_Half**5),
Root16_Half**7 - Long_Float'Machine (Root16_Half**7),
Root16_Half**9 - Long_Float'Machine (Root16_Half**9),
Root16_Half**11 - Long_Float'Machine (Root16_Half**11),
Root16_Half**13 - Long_Float'Machine (Root16_Half**13),
Root16_Half**15 - Long_Float'Machine (Root16_Half**15));
-- Intermediary functions
function Reconstruct_Pow
(Z : Long_Float;
P : Integer;
M : Integer) return Long_Float;
procedure Reduce_044
(X : Long_Float;
Reduced_X : out Long_Float;
P : out Integer)
with Post => abs (Reduced_X) < 0.044;
function Reduce_1_16 (X : Long_Float) return Long_Float
with Post => abs (X - Reduce_1_16'Result) <= 0.0625;
function Reduce_1_16 (X : Long_Float) return Long_Float is
(LF'Machine_Rounding (X * 16.0) * (1.0 / 16.0));
package Long_Float_Approximations is
new Generic_Approximations (Long_Float, Mantissa => 53);
use Long_Float_Approximations;
-- Local declarations
procedure Reduce_Half_Pi_Large (X : in out LF; N : LF; Q : out Quadrant);
procedure Split_Veltkamp (X : Long_Float; X_Hi, X_Lo : out Long_Float)
with Post => X = X_Hi + X_Lo;
function Multiply_Add (X, Y, Z : LF) return LF is (X * Y + Z);
-- The following functions reduce a positive X into the range
-- -ln (2) / 2 .. ln (2) / 2
-- It returns a reduced X and an integer N such that:
-- X'Old = X'New + N * Log (2)
-- It is used by Exp function
-- The result should be correctly rounded
procedure Reduce_Ln_2 (X : in out Long_Float; N : out Integer)
with Pre => abs (X) <= Long_Float'Ceiling
(Long_Float'Pred (709.78271_28337_79350_29149_8) * Inv_Ln_2);
-- @llr Reduce_Ln_2 Long_Float
-- The following is postcondition doesn't hold. Suspicious "=" ???
-- Post => abs (X) <= Ln_2 / 2.0 and
-- X'Old = X + Long_Float (N) * Ln_2;
-- The reduction is used by the Sin, Cos and Tan functions.
procedure Reduce_Half_Pi (X : in out Long_Float; Q : out Quadrant)
with Pre => X >= 0.0,
Post => abs (X) <= Max_Red_Trig_Arg;
-- @llr Reduce_Half_Pi Long_Float
-- The following functions reduce a positive X into the range
-- -(Pi/4 + E) .. Pi/4 + E, with E a small fraction of Pi.
--
-- The reason the normalization is not strict is that the computation of
-- the number of times to subtract half Pi is not exact. The rounding
-- error is worst for large arguments, where the number of bits behind
-- the radix point reduces to half the mantissa bits.
-- While it would be possible to correct for this, the polynomial
-- approximations work well for values slightly outside the -Pi/4 .. Pi/4
-- interval, so it is easier for both error analysis and implementation
-- to leave the reduction non-strict, and assume the reduced argument is
-- within -0.26 * Pi .. 0.26 * Pi rather than a quarter of pi.
-- The reduction is guaranteed to be correct to within 0.501 ulp for
-- values of X for which Ada's accuracy guarantees apply:
-- abs X <= 2.0**(T'Machine_Mantissa / 2)
-- For values outside this range, an attempt is made to have significance
-- decrease only proportionally with increase of magnitued. In any case,
-- for all finite arguments, the reduction will succeed, though the reduced
-- value may not agree with the mathematically correct value in even its
-- sign.
---------------------
-- Reconstruct_Pow --
---------------------
function Reconstruct_Pow
(Z : Long_Float;
P : Integer;
M : Integer) return Long_Float
is
-- Cody and Waite implementation (in "**" function page 84)
-- The following computation is carried out in two steps. First add 1 to
-- Z and multiply by 2**(-P/16). Then multiply the result by 2**M.
Result : Long_Float;
begin
Result := A1_Tab_LF (P + 1) * Z;
return Long_Float'Scaling (Result, M);
end Reconstruct_Pow;
----------------
-- Reduce_044 --
----------------
procedure Reduce_044
(X : Long_Float;
Reduced_X : out Long_Float;
P : out Integer)
is
-- Cody and Waite implementation (in "**" function page 84)
-- The output is:
-- P is the biggest odd Integer in range 1 .. 15 such that
-- 2^((1-P)/16) <= X.
-- Reduced_X equals 2 * (X-2^(-P/16)) / (X + 2^(-P/16)).
-- abs (Reduced_X) <= max (2^(2-P/16)-2^(1-P/16)) <= 0.443.
begin
P := 1;
if X <= A1_Tab_LF (9) then
P := 9;
end if;
if X <= A1_Tab_LF (P + 4) then
P := P + 4;
end if;
if X <= A1_Tab_LF (P + 2) then
P := P + 2;
end if;
Reduced_X := (X - A1_Tab_LF (P + 1)) - A2_Tab_LF ((P + 1) / 2);
Reduced_X := Reduced_X / (X + A1_Tab_LF (P + 1));
Reduced_X := Reduced_X + Reduced_X;
end Reduce_044;
--------------------
-- Instantiations --
--------------------
package Instantiations is
function Acos is new Generic_Acos (LF);
function Atan2 is new Generic_Atan2 (LF);
end Instantiations;
--------------------
-- Split_Veltkamp --
--------------------
procedure Split_Veltkamp (X : Long_Float; X_Hi, X_Lo : out Long_Float) is
M : constant LF := 0.5 + 2.0**(1 - LF'Machine_Mantissa / 2);
begin
X_Hi := X * M - (X * M - X);
X_Lo := X - X_Hi;
end Split_Veltkamp;
-----------------
-- Reduce_Ln_2 --
-----------------
procedure Reduce_Ln_2 (X : in out Long_Float; N : out Integer) is
L1 : constant := Long_Float'Leading_Part (Ln_2, LF_HM);
L2 : constant := Long_Float'Leading_Part (Ln_2 - L1, LF_HM);
L3 : constant := Ln_2 - L2 - L1;
XN : constant Long_Float := Long_Float'Rounding (X * Inv_Ln_2);
begin
-- The argument passed to the function is smaller than Ymax * 1/log(2)
-- No overflow is possible for N (Ymax is the largest machine number
-- less than Log (LF'Last)).
N := Integer (XN);
X := ((X - XN * L1) - XN * L2) - XN * L3;
if X < -Ln_2 / 2.0 then
X := X + Ln_2;
N := N - 1;
end if;
if X > Ln_2 / 2.0 then
X := X - Ln_2;
N := N + 1;
end if;
end Reduce_Ln_2;
--------------------
-- Reduce_Half_Pi --
--------------------
procedure Reduce_Half_Pi (X : in out Long_Float; Q : out Quadrant) is
K : constant := Pi / 2.0;
Bits_N : constant := 3;
Max_N : constant := 2.0**Bits_N - 1.0;
Max_X : constant LF := LF'Pred (K * Max_N); -- About 3.5 * Pi
Bits_C : constant := LF'Machine_Mantissa - Bits_N;
C1 : constant LF := LF'Leading_Part (K, Bits_C);
C2 : constant LF := K - C1;
N : constant LF := LF'Machine_Rounding (X * K**(-1));
begin
if not X'Valid then
X := X - X;
Q := 0;
elsif abs X > Max_X then
Reduce_Half_Pi_Large (X, N, Q);
else
pragma Assert (if X'Valid then abs N <= Max_N);
X := (X - N * C1) - N * C2;
Q := Integer (N) mod 4;
end if;
end Reduce_Half_Pi;
--------------------------
-- Reduce_Half_Pi_Large --
--------------------------
procedure Reduce_Half_Pi_Large (X : in out LF; N : LF; Q : out Quadrant) is
type Int_64 is range -2**63 .. 2**63 - 1; -- used for conversions
HM : constant Positive := LF'Machine_Mantissa / 2;
C1 : constant LF := LF'Leading_Part (Half_Pi, HM);
C2 : constant LF := LF'Leading_Part (Half_Pi - C1, HM);
C3 : constant LF := LF'Leading_Part (Half_Pi - C1 - C2, HM);
C4 : constant LF := Half_Pi - C1 - C2 - C3;
K : LF := N;
K_Hi : LF;
K_Lo : LF;
begin
Q := 0;
loop
Split_Veltkamp (X => K, X_Hi => K_Hi, X_Lo => K_Lo);
X := Multiply_Add (-K_Hi, C1, X);
X := Multiply_Add (-K_Hi, C2, Multiply_Add (-K_Lo, C1, X));
X := Multiply_Add (-K_Hi, C3, Multiply_Add (-K_Lo, C2, X));
X := Multiply_Add (-K_Hi, C4, Multiply_Add (-K_Lo, C3, X));
X := Multiply_Add (-K_Lo, C4, X);
if abs K < 2.0**62 then
Q := Quadrant ((Int_64 (Q) + Int_64 (N)) mod 4);
elsif abs K_Lo <= 2.0**62 then
Q := Quadrant ((Int_64 (Q) + Int_64 (N)) mod 4);
end if;
exit when X in -0.26 * Pi .. 0.26 * Pi;
K := LF'Machine_Rounding (X * Half_Pi**(-1));
end loop;
end Reduce_Half_Pi_Large;
----------
-- Acos --
----------
function Acos (X : LF) return LF is (Instantiations.Acos (X));
-----------
-- Acosh --
-----------
function Acosh (X : LF) return LF is
-- Math based implementation using Log1p: x-> Log (1+x)
T : constant LF := X - 1.0;
begin
if X > 1.0 / Sqrt_Epsilon_LF then
return Log (X) + Ln_2;
elsif X < 2.0 then
return Log1p (T + Sqrt (2.0 * T + T * T));
else
return Log (X + Sqrt ((X - 1.0) * (X + 1.0)));
end if;
end Acosh;
----------
-- Asin --
----------
function Asin (X : LF) return LF is (Long_Float_Approximations.Asin (X));
-----------
-- Asinh --
-----------
function Asinh (X : LF) return LF is
-- Math based implementation using Log1p: x-> Log (1+x)
Y : constant LF := abs X;
G : constant LF := X * X;
Res : LF;
begin
if Y < Sqrt_Epsilon_LF then
Res := Y;
elsif Y > 1.0 / Sqrt_Epsilon_LF then
Res := Log (Y) + Ln_2;
elsif Y < 2.0 then
Res := Log1p (Y + G / (1.0 + Sqrt (G + 1.0)));
else
Res := Log (Y + Sqrt (G + 1.0));
end if;
return LF'Copy_Sign (Res, X);
end Asinh;
----------
-- Atan --
----------
function Atan (X : LF) return LF is (Instantiations.Atan2 (X, 1.0));
-----------
-- Atan2 --
-----------
function Atan2 (Y, X : LF) return LF is (Instantiations.Atan2 (Y, X));
-----------
-- Atanh --
-----------
function Atanh (X : LF) return LF is
-- Math based implementation using Log1p: x-> Log (1+x)
(if X >= 0.0
then Log1p (2.0 * X / (1.0 - X)) / 2.0
else -Log1p (-2.0 * X / (1.0 + X)) / 2.0);
---------
-- Cos --
---------
function Cos (X : LF) return LF is
-- Math based implementation using Hart constants
Y : LF := abs (X);
Q : Quadrant;
Result : LF;
begin
Reduce_Half_Pi (Y, Q);
if Q mod 2 = 0 then
Result := Approx_Cos (Y);
else
Result := Approx_Sin (Y);
end if;
return (if Q = 1 or else Q = 2 then -Result else Result);
end Cos;
----------
-- Cosh --
----------
function Cosh (X : LF) return LF is
-- Cody and Waite implementation (page 217)
Y : constant LF := abs (X);
-- Because the overflow threshold for cosh(X) is beyond the overflow
-- threshold for exp(X), it appears natural to reformulate the
-- computation as:
-- Cosh (X) = Exp (X - Log (2))
-- But because Log (2) is not an exact machine number, the finite word
-- length of the machine implies that the absolute error in X - Log (2),
-- hence the transmitted error in Cosh (X) is proportional to the
-- magnitude of X even when X is error-free.
-- To avoid this problem, we revise the computation to
-- Cosh (X) = V/2 * exp(X - Log (V))
-- where Log (V) is an exact machine number slightly larger than Log (2)
-- with the last few digits of its significand zero.
Ln_V : constant := 8#0.542714#;
-- Machine value slightly above Ln_2
V_2 : constant := 0.24999_30850_04514_99336;
-- V**(-2)
V_2_1 : constant := 0.13830_27787_96019_02638E-4;
-- V / 2 - 1
Y_Bar : constant Long_Float := 709.78271_28933_83973_096;
-- Y_Bar is the last floating point for which exp (Y) does not overflow
-- and exp (-Y) does not underflow
W : LF;
Z : LF;
begin
if Y >= Y_Bar then
W := Y - Ln_V;
Z := Exp (W);
Z := Z + V_2 / Z;
return Z + V_2_1 * Z; -- rewriting of V/2 * Z
else
Z := Exp (Y);
return (Z + 1.0 / Z) / 2.0;
end if;
end Cosh;
---------
-- Exp --
---------
function Exp (X : LF) return LF is
-- Cody and Waite implementation (page 60)
N : Integer;
Y : LF := X;
R : LF;
Ymax : constant LF := LF'Pred (709.78271_28337_79350_29149_8);
-- The largest machine number less than Log (LF'Last)
begin
if abs (Y) < 2.0**(-LF'Machine_Mantissa - 1) then
return 1.0;
end if;
if abs Y > Ymax then
return (if Y > 0.0 then Infinity else 0.0);
end if;
Reduce_Ln_2 (Y, N);
R := Approx_Exp (Y);
return Long_Float'Scaling (R, N);
end Exp;
----------
-- Exp2 --
----------
function Exp2 (X : LF) return LF is
-- Implementation based on Cody and Waite Exp implementation (page 217)
-- but using Hart constants
N : Integer;
Y : LF := X;
R : LF;
Result : LF;
begin
if abs Y < 2.0**(-LF'Machine_Mantissa - 1) then
return 1.0;
end if;
if abs Y > LF'Pred (LF (LF'Machine_Emax)) then
return (if Y > 0.0 then Infinity else 0.0);
end if;
-- If X > Log(LF'Emax) ???
N := Integer (X);
Y := Y - Long_Float (N);
R := Approx_Exp2 (Y);
Result := Long_Float'Scaling (R, N + 1);
if Result /= Result then
Result := (if X < LF'First then 0.0 else Infinity);
end if;
return Result;
end Exp2;
---------
-- Log --
---------
function Log (X : LF) return LF is
-- Cody and Waite implementation (page 35)
Exponent_X : constant Integer := LF'Exponent (X);
XN : LF := LF (Exponent_X);
Mantissa_X : LF := LF'Scaling (X, -Exponent_X);
HM : constant Integer := LF'Machine_Mantissa / 2;
L1 : constant LF := LF'Leading_Part (Ln_2, HM);
L2 : constant LF := Ln_2 - L1;
Result : LF;
begin
if X <= 0.0 then
if X < 0.0 then
return NaN;
else
return -Infinity;
end if;
-- Making sure X is in Sqrt (0.5) .. Sqrt (2)
elsif X > Long_Float'Last then
return X;
elsif Mantissa_X <= Sqrt_Half then
XN := XN - 1.0;
Mantissa_X := Mantissa_X * 2.0;
end if;
Result := Approx_Log (Mantissa_X);
Result := (XN * L2 + Result) + XN * L1;
return Result;
end Log;
-----------
-- Log1p --
-----------
function Log1p (X : LF) return LF is
-- Quick implementation of Log1p not accurate to the Ada regular Log
-- requirements, but accurate enough to compute inverse hyperbolic
-- functions.
begin
if 1.0 + X = 1.0 then
return X;
elsif X > LF'Last then
return X;
else
return Log (1.0 + X) * (X / ((1.0 + X) - 1.0));
end if;
end Log1p;
----------
-- Log2 --
----------
function Log2 (X : LF) return LF is
-- Quick implementation of Log2 not accurate to the Ada regular Log
-- (base e) requirement on the whole definition interval but accurate
-- enough on 0 .. 2**(-1/16).
(Log (X) * (1.0 / Ln_2));
---------
-- Pow --
---------
function Pow (Left, Right : LF) return LF is
-- Cody and Waite implementation (page 84)
One_Over_Sixteen : constant := 0.0625;
M : constant Integer := LF'Exponent (Left);
G : constant LF := LF'Fraction (Left);
Y : constant LF := Right;
Z : LF;
P : Integer;
U2, U1, Y1, Y2, W1, W2, W : LF;
MM, PP, IW1, I : Integer;
Is_Special : Boolean;
Special_Result : LF;
procedure Pow_Special_Cases is new Generic_Pow_Special_Cases (LF);
begin
-- Special values
Pow_Special_Cases (Left, Right, Is_Special, Special_Result);
if Is_Special then
return Special_Result;
else
-- Left**Right is calculated using the formula
-- 2**(Right * Log2 (Left))
Reduce_044 (G, Z, P);
-- At this point, Z <= 0.044
U2 := Approx_Power_Log (Z);
U1 := LF (M * 16 - P) * 0.0625; -- U2 + U1 = Log2 (Left)
-- Forming the pseudo extended precision product of U * Right
Y1 := Reduce_1_16 (Y);
Y2 := Y - Y1;
W := U2 * Y + U1 * Y2;
W1 := Reduce_1_16 (W);
W2 := W - W1;
W := W1 + U1 * Y1;
W1 := Reduce_1_16 (W);
W2 := W2 + (W - W1);
W := Reduce_1_16 (W2);
IW1 := Integer (16.0 * (W1 + W));
W2 := W2 - W;
if W2 > 0.0 then
W2 := W2 - One_Over_Sixteen;
IW1 := 1 + IW1;
end if;
if IW1 < 0 then
I := 0;
else
I := 1;
end if;
MM := Integer (IW1 / 16) + I;
PP := 16 * MM - IW1;
Z := Approx_Exp2 (W2);
return Reconstruct_Pow (Z, PP, MM);
end if;
end Pow;
---------
-- Sin --
---------
function Sin (X : LF) return LF is
-- Math based implementation using Hart constants
Y : LF := abs X;
Q : Quadrant;
Result : LF;
begin
Reduce_Half_Pi (Y, Q);
if Q mod 2 = 0 then
Result := Approx_Sin (Y);
else
Result := Approx_Cos (Y);
end if;
return LF'Copy_Sign (1.0, X) * (if Q >= 2 then -Result else Result);
end Sin;
----------
-- Sinh --
----------
function Sinh (X : LF) return LF is
-- Cody and Waite implementation (page 217)
Sign : constant LF := LF'Copy_Sign (1.0, X);
Y : constant LF := abs X;
-- Because the overflow threshold for sinh(X) is beyond the overflow
-- threshold for exp(X), it appears natural to reformulate the
-- computation as:
-- Sinh (X) = Exp (X - Log (2))
-- But because Log (2) is not an exact machine number, the finite word
-- length of the machine implies that the absolute error in X - Log (2),
-- hence the transmitted error in Sinh (X) is proportional to the
-- magnitude of X even when X is error-free. To avoid this problem, we
-- revise the computation to:
-- Sinh (X) = V/2 * exp(X - Log (V))
-- where Log (V) is an exact machine number slightly larger than Log (2)
-- with the last few digits of its significand zero.
Ln_V : constant := 8#0.542714#;
-- Machine value slightly above Ln_2
V_2 : constant := 0.24999_30850_04514_99336;
-- V**(-2)
V_2_1 : constant := 0.13830_27787_96019_02638E-4;
-- V / 2 - 1
Y_Bar : constant Long_Float := 709.78271_28933_83973_096;
-- The last floating point for which exp (X) does not overflow and
-- exp (-x) does not underflow
W : LF;
Z : LF;
begin
if Y <= 1.0 then
return Approx_Sinh (X);
end if;
if Y >= Y_Bar then
W := Y - Ln_V;
Z := Exp (W);
Z := Z - V_2 / Z;
return Sign * (Z + V_2_1 * Z); -- rewriting of V/2 * Z
else
Z := Exp (Y);
return Sign * ((Z - 1.0 / Z) / 2.0);
end if;
end Sinh;
----------
-- Sqrt --
----------
function Sqrt (X : Long_Float) return Long_Float renames
System.Libm_Double.Squareroot.Sqrt;
---------
-- Tan --
---------
function Tan (X : LF) return LF is
-- Math based implementation using Hart constants
Y : LF := abs X;
N : Integer;
begin
if abs X < LF'Last then
Reduce_Half_Pi (Y, N);
else
return Infinity / Infinity;
end if;
-- The reconstruction is included in the algebraic fraction in
-- Approx_Tan function.
if N mod 2 = 0 then
return Approx_Tan (Y) * LF'Copy_Sign (1.0, X);
else
return Approx_Cot (Y) * LF'Copy_Sign (1.0, X);
end if;
end Tan;
----------
-- Tanh --
----------
function Tanh (X : LF) return LF is
-- Cody and Waite implementation (page 239)
F : constant LF := abs (X);
Xbig : constant := Ln_2 * LF (1 + LF'Machine_Mantissa);
LN_3_2 : constant := 0.54930_61443_34054_84570;
Result : LF;
begin
if F > Xbig then
Result := 1.0;
else
if F > LN_3_2 then
Result := 1.0 - 2.0 / (Exp (2.0 * F) + 1.0);
else
Result := Approx_Tanh (F);
end if;
end if;
return LF'Copy_Sign (Result, X);
end Tanh;
end System.Libm_Double;
| 29.028185 | 79 | 0.506835 |
03aa7b7c90e3723890cc307920f73d8ad9a5dd0a | 5,175 | adb | Ada | Assignment/passwordmanager.adb | vivianjia123/Password-Manager | c61523beb327b5a11be7fbdb04bf0d7569c8a1d6 | [
"MIT"
] | null | null | null | Assignment/passwordmanager.adb | vivianjia123/Password-Manager | c61523beb327b5a11be7fbdb04bf0d7569c8a1d6 | [
"MIT"
] | null | null | null | Assignment/passwordmanager.adb | vivianjia123/Password-Manager | c61523beb327b5a11be7fbdb04bf0d7569c8a1d6 | [
"MIT"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
with Ada.Containers; use Ada.Containers;
with Ada.Characters; use Ada.Characters;
with PIN;
with PasswordDatabase;
package body PasswordManager with SPARK_Mode is
-- Initiates the Password Manager
procedure Init(Pin_Input : in String;
Manager_Information : out Information) is
begin
-- Sets the Master Pin and Password Manager state to Locked
-- also initates the database
Manager_Information.Master_Pin := PIN.From_String(Pin_Input);
Manager_Information.Is_Locked := True;
PasswordDatabase.Init(Manager_Information.Master_Database);
end;
-- Determines current lock status of Password Manager
function Lock_Status(Manager_Information: in Information) return Boolean is
begin
if(Manager_Information.Is_Locked = True) then
return True;
end if;
return False;
end;
-- Only executes Unlock_Manager if the current state is unlocked
procedure Execute_Unlock(Manager_Information : in out Information;
Pin_Input : in PIN.PIN) is
begin
if (PIN."="(Manager_Information.Master_Pin,Pin_Input)
and Manager_Information.Is_Locked) then
Unlock_Manager(Manager_Information, Pin_Input);
end if;
end;
-- Changes Password Manager State to Unlocked
procedure Unlock_Manager(Manager_Information : in out Information;
Pin_Input : in PIN.PIN) is
begin
-- Password Manager is unlocked
Manager_Information.Is_Locked := False;
end;
-- Only executes Lock_Manager if the current state is unlocked
procedure Execute_Lock(Manager_Information : in out Information;
Pin_Input : in PIN.PIN) is
begin
if (Manager_Information.Is_Locked= False) then
Lock_Manager(Manager_Information, Pin_Input);
end if;
end;
-- Changes Password Manager State to Locked
procedure Lock_Manager(Manager_Information : in out Information;
Pin_Input : in PIN.PIN) is
begin
-- Password Manager is set to locked and MasterPin is set to
-- Pin supplied by user
Manager_Information.Master_Pin := Pin_Input;
Manager_Information.Is_Locked := True;
end;
-- Only executes Get Command if requirements are met
procedure Execute_Get_Command(Manager_Information : in Information;
Input_Url : in PasswordDatabase.URL) is
begin
-- If Password Manager is unlocked and Database contains entry
-- for the Url then call Put Command
if (PasswordDatabase.Has_Password_For
(Manager_Information.Master_Database,Input_Url) and
Manager_Information.Is_Locked = False) then
Get_Database(Manager_Information, Input_Url);
end if;
end;
-- Carries out Get Command
procedure Get_Database(Manager_Information : in Information;
Input_Url : in PasswordDatabase.URL) is
begin
-- Returns associated password
Put_Line (PasswordDatabase.To_String
(PasswordDatabase.Get
(Manager_Information.Master_Database,Input_Url)));
end;
-- Only executes Put Command if requirements are met
procedure Execute_Put_Command(Manager_Information : in out Information;
Input_Url : in PasswordDatabase.URL;
Input_Pwd : in PasswordDatabase.Password) is
begin
-- If Password Manager is unlocked and entries are
-- within maximum entry range then store entry to Database
if (Manager_Information.Is_Locked = False
and StoredDatabaseLength(Manager_Information)
< PasswordDatabase.Max_Entries) then
Put_Database(Manager_Information, Input_Url, Input_Pwd);
end if;
end;
-- Carries out Put Command
procedure Put_Database(Manager_Information : in out Information;
Input_Url : in PasswordDatabase.URL;
Input_Pwd : in PasswordDatabase.Password) is
begin
-- Put associated entry into database
PasswordDatabase.Put(Manager_Information.Master_Database,
Input_Url, Input_Pwd);
end;
-- Only executes Rem Command if requirements are met
procedure Execute_Rem_Command(Manager_Information : in out Information;
Input_Url : in PasswordDatabase.URL) is
begin
-- If Password Manager is unlocked and Database contains entry
-- for the Url then call Rem Command
if (PasswordDatabase.Has_Password_For
(Manager_Information.Master_Database, Input_Url) and
Manager_Information.Is_Locked = False) then
Rem_Database(Manager_Information, Input_Url);
end if;
end;
-- Carries out Rem Command
procedure Rem_Database(Manager_Information : in out Information;
Input_Url : in PasswordDatabase.URL) is
begin
-- Remove the associated entry
PasswordDatabase.Remove(Manager_Information.Master_Database, Input_Url);
end;
end PasswordManager;
| 36.964286 | 78 | 0.670338 |
03ef3da1fa62a2047f007c0002536e62f600e43e | 97,348 | ads | Ada | src/gnat/snames.ads | Letractively/ada-gen | d06d03821057f9177f2350e32dd09e467df08612 | [
"Apache-2.0"
] | null | null | null | src/gnat/snames.ads | Letractively/ada-gen | d06d03821057f9177f2350e32dd09e467df08612 | [
"Apache-2.0"
] | null | null | null | src/gnat/snames.ads | Letractively/ada-gen | d06d03821057f9177f2350e32dd09e467df08612 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S N A M E S --
-- --
-- T e m p l a t e --
-- --
-- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Namet; use Namet;
package Snames is
-- This package contains definitions of standard names (i.e. entries in the
-- Names table) that are used throughout the GNAT compiler. It also contains
-- the definitions of some enumeration types whose definitions are tied to
-- the order of these preset names.
------------------
-- Preset Names --
------------------
-- The following are preset entries in the names table, which are entered
-- at the start of every compilation for easy access. Note that the order
-- of initialization of these names in the body must be coordinated with
-- the order of names in this table.
-- Note: a name may not appear more than once in the following list. If
-- additional pragmas or attributes are introduced which might otherwise
-- cause a duplicate, then list it only once in this table, and adjust the
-- definition of the functions for testing for pragma names and attribute
-- names, and returning their ID values. Of course everything is simpler
-- if no such duplications occur!
-- First we have the one character names used to optimize the lookup
-- process for one character identifiers (to avoid the hashing in this
-- case) There are a full 256 of these, but only the entries for lower
-- case and upper case letters have identifiers
-- The lower case letter entries are used for one character identifiers
-- appearing in the source, for example in pragma Interface (C).
Name_A : constant Name_Id := First_Name_Id + Character'Pos ('a');
Name_B : constant Name_Id := First_Name_Id + Character'Pos ('b');
Name_C : constant Name_Id := First_Name_Id + Character'Pos ('c');
Name_D : constant Name_Id := First_Name_Id + Character'Pos ('d');
Name_E : constant Name_Id := First_Name_Id + Character'Pos ('e');
Name_F : constant Name_Id := First_Name_Id + Character'Pos ('f');
Name_G : constant Name_Id := First_Name_Id + Character'Pos ('g');
Name_H : constant Name_Id := First_Name_Id + Character'Pos ('h');
Name_I : constant Name_Id := First_Name_Id + Character'Pos ('i');
Name_J : constant Name_Id := First_Name_Id + Character'Pos ('j');
Name_K : constant Name_Id := First_Name_Id + Character'Pos ('k');
Name_L : constant Name_Id := First_Name_Id + Character'Pos ('l');
Name_M : constant Name_Id := First_Name_Id + Character'Pos ('m');
Name_N : constant Name_Id := First_Name_Id + Character'Pos ('n');
Name_O : constant Name_Id := First_Name_Id + Character'Pos ('o');
Name_P : constant Name_Id := First_Name_Id + Character'Pos ('p');
Name_Q : constant Name_Id := First_Name_Id + Character'Pos ('q');
Name_R : constant Name_Id := First_Name_Id + Character'Pos ('r');
Name_S : constant Name_Id := First_Name_Id + Character'Pos ('s');
Name_T : constant Name_Id := First_Name_Id + Character'Pos ('t');
Name_U : constant Name_Id := First_Name_Id + Character'Pos ('u');
Name_V : constant Name_Id := First_Name_Id + Character'Pos ('v');
Name_W : constant Name_Id := First_Name_Id + Character'Pos ('w');
Name_X : constant Name_Id := First_Name_Id + Character'Pos ('x');
Name_Y : constant Name_Id := First_Name_Id + Character'Pos ('y');
Name_Z : constant Name_Id := First_Name_Id + Character'Pos ('z');
-- The upper case letter entries are used by expander code for local
-- variables that do not require unique names (e.g. formal parameter
-- names in constructed procedures)
Name_uA : constant Name_Id := First_Name_Id + Character'Pos ('A');
Name_uB : constant Name_Id := First_Name_Id + Character'Pos ('B');
Name_uC : constant Name_Id := First_Name_Id + Character'Pos ('C');
Name_uD : constant Name_Id := First_Name_Id + Character'Pos ('D');
Name_uE : constant Name_Id := First_Name_Id + Character'Pos ('E');
Name_uF : constant Name_Id := First_Name_Id + Character'Pos ('F');
Name_uG : constant Name_Id := First_Name_Id + Character'Pos ('G');
Name_uH : constant Name_Id := First_Name_Id + Character'Pos ('H');
Name_uI : constant Name_Id := First_Name_Id + Character'Pos ('I');
Name_uJ : constant Name_Id := First_Name_Id + Character'Pos ('J');
Name_uK : constant Name_Id := First_Name_Id + Character'Pos ('K');
Name_uL : constant Name_Id := First_Name_Id + Character'Pos ('L');
Name_uM : constant Name_Id := First_Name_Id + Character'Pos ('M');
Name_uN : constant Name_Id := First_Name_Id + Character'Pos ('N');
Name_uO : constant Name_Id := First_Name_Id + Character'Pos ('O');
Name_uP : constant Name_Id := First_Name_Id + Character'Pos ('P');
Name_uQ : constant Name_Id := First_Name_Id + Character'Pos ('Q');
Name_uR : constant Name_Id := First_Name_Id + Character'Pos ('R');
Name_uS : constant Name_Id := First_Name_Id + Character'Pos ('S');
Name_uT : constant Name_Id := First_Name_Id + Character'Pos ('T');
Name_uU : constant Name_Id := First_Name_Id + Character'Pos ('U');
Name_uV : constant Name_Id := First_Name_Id + Character'Pos ('V');
Name_uW : constant Name_Id := First_Name_Id + Character'Pos ('W');
Name_uX : constant Name_Id := First_Name_Id + Character'Pos ('X');
Name_uY : constant Name_Id := First_Name_Id + Character'Pos ('Y');
Name_uZ : constant Name_Id := First_Name_Id + Character'Pos ('Z');
-- Note: the following table is read by the utility program XSNAMES and
-- its format should not be changed without coordinating with this program.
N : constant Name_Id := First_Name_Id + 256;
-- Synonym used in standard name definitions
-- Names referenced in snames.h
Name_uParent : constant Name_Id := N + 000;
Name_uTag : constant Name_Id := N + 001;
Name_Off : constant Name_Id := N + 002;
Name_Space : constant Name_Id := N + 003;
Name_Time : constant Name_Id := N + 004;
-- Names of aspects for which there are no matching pragmas or attributes
-- so that they need to be included for aspect specification use.
Name_Post : constant Name_Id := N + 005;
Name_Pre : constant Name_Id := N + 006;
-- Some special names used by the expander. Note that the lower case u's
-- at the start of these names get translated to extra underscores. These
-- names are only referenced internally by expander generated code.
Name_uAbort_Signal : constant Name_Id := N + 007;
Name_uAlignment : constant Name_Id := N + 008;
Name_uAssign : constant Name_Id := N + 009;
Name_uATCB : constant Name_Id := N + 010;
Name_uChain : constant Name_Id := N + 011;
Name_uClean : constant Name_Id := N + 012;
Name_uController : constant Name_Id := N + 013;
Name_uCPU : constant Name_Id := N + 014;
Name_uEntry_Bodies : constant Name_Id := N + 015;
Name_uExpunge : constant Name_Id := N + 016;
Name_uFinal_List : constant Name_Id := N + 017;
Name_uIdepth : constant Name_Id := N + 018;
Name_uInit : constant Name_Id := N + 019;
Name_uLocal_Final_List : constant Name_Id := N + 020;
Name_uMaster : constant Name_Id := N + 021;
Name_uObject : constant Name_Id := N + 022;
Name_uPostconditions : constant Name_Id := N + 023;
Name_uPriority : constant Name_Id := N + 024;
Name_uProcess_ATSD : constant Name_Id := N + 025;
Name_uRelative_Deadline : constant Name_Id := N + 026;
Name_uResult : constant Name_Id := N + 027;
Name_uSecondary_Stack : constant Name_Id := N + 028;
Name_uService : constant Name_Id := N + 029;
Name_uSize : constant Name_Id := N + 030;
Name_uStack : constant Name_Id := N + 031;
Name_uTags : constant Name_Id := N + 032;
Name_uTask : constant Name_Id := N + 033;
Name_uTask_Id : constant Name_Id := N + 034;
Name_uTask_Info : constant Name_Id := N + 035;
Name_uTask_Name : constant Name_Id := N + 036;
Name_uTrace_Sp : constant Name_Id := N + 037;
-- Names of predefined primitives used in the expansion of dispatching
-- requeue and select statements, Abort, 'Callable and 'Terminated.
Name_uDisp_Asynchronous_Select : constant Name_Id := N + 038;
Name_uDisp_Conditional_Select : constant Name_Id := N + 039;
Name_uDisp_Get_Prim_Op_Kind : constant Name_Id := N + 040;
Name_uDisp_Get_Task_Id : constant Name_Id := N + 041;
Name_uDisp_Requeue : constant Name_Id := N + 042;
Name_uDisp_Timed_Select : constant Name_Id := N + 043;
-- Names of routines in Ada.Finalization, needed by expander
Name_Initialize : constant Name_Id := N + 044;
Name_Adjust : constant Name_Id := N + 045;
Name_Finalize : constant Name_Id := N + 046;
-- Names of fields declared in System.Finalization_Implementation,
-- needed by the expander when generating code for finalization.
Name_Next : constant Name_Id := N + 047;
Name_Prev : constant Name_Id := N + 048;
-- Names of allocation routines, also needed by expander
Name_Allocate : constant Name_Id := N + 049;
Name_Deallocate : constant Name_Id := N + 050;
Name_Dereference : constant Name_Id := N + 051;
-- Names of Text_IO generic subpackages (see Rtsfind.Text_IO_Kludge)
First_Text_IO_Package : constant Name_Id := N + 052;
Name_Decimal_IO : constant Name_Id := N + 052;
Name_Enumeration_IO : constant Name_Id := N + 053;
Name_Fixed_IO : constant Name_Id := N + 054;
Name_Float_IO : constant Name_Id := N + 055;
Name_Integer_IO : constant Name_Id := N + 056;
Name_Modular_IO : constant Name_Id := N + 057;
Last_Text_IO_Package : constant Name_Id := N + 057;
subtype Text_IO_Package_Name is Name_Id
range First_Text_IO_Package .. Last_Text_IO_Package;
-- Some miscellaneous names used for error detection/recovery
Name_Const : constant Name_Id := N + 058;
Name_Error : constant Name_Id := N + 059;
Name_Go : constant Name_Id := N + 060;
Name_Put : constant Name_Id := N + 061;
Name_Put_Line : constant Name_Id := N + 062;
Name_To : constant Name_Id := N + 063;
-- Name used by the integrated preprocessor
Name_Defined : constant Name_Id := N + 064;
-- Names for packages that are treated specially by the compiler
Name_Exception_Traces : constant Name_Id := N + 065;
Name_Finalization : constant Name_Id := N + 066;
Name_Finalization_Root : constant Name_Id := N + 067;
Name_Interfaces : constant Name_Id := N + 068;
Name_Most_Recent_Exception : constant Name_Id := N + 069;
Name_Standard : constant Name_Id := N + 070;
Name_System : constant Name_Id := N + 071;
Name_Text_IO : constant Name_Id := N + 072;
Name_Wide_Text_IO : constant Name_Id := N + 073;
Name_Wide_Wide_Text_IO : constant Name_Id := N + 074;
-- Names of implementations of the distributed systems annex
First_PCS_Name : constant Name_Id := N + 075;
Name_No_DSA : constant Name_Id := N + 075;
Name_GARLIC_DSA : constant Name_Id := N + 076;
Name_PolyORB_DSA : constant Name_Id := N + 077;
Last_PCS_Name : constant Name_Id := N + 077;
subtype PCS_Names is Name_Id
range First_PCS_Name .. Last_PCS_Name;
-- Names of identifiers used in expanding distribution stubs
Name_Addr : constant Name_Id := N + 078;
Name_Async : constant Name_Id := N + 079;
Name_Get_Active_Partition_ID : constant Name_Id := N + 080;
Name_Get_RCI_Package_Receiver : constant Name_Id := N + 081;
Name_Get_RCI_Package_Ref : constant Name_Id := N + 082;
Name_Origin : constant Name_Id := N + 083;
Name_Params : constant Name_Id := N + 084;
Name_Partition : constant Name_Id := N + 085;
Name_Partition_Interface : constant Name_Id := N + 086;
Name_Ras : constant Name_Id := N + 087;
Name_uCall : constant Name_Id := N + 088;
Name_RCI_Name : constant Name_Id := N + 089;
Name_Receiver : constant Name_Id := N + 090;
Name_Rpc : constant Name_Id := N + 091;
Name_Subp_Id : constant Name_Id := N + 092;
Name_Operation : constant Name_Id := N + 093;
Name_Argument : constant Name_Id := N + 094;
Name_Arg_Modes : constant Name_Id := N + 095;
Name_Handler : constant Name_Id := N + 096;
Name_Target : constant Name_Id := N + 097;
Name_Req : constant Name_Id := N + 098;
Name_Obj_TypeCode : constant Name_Id := N + 099;
Name_Stub : constant Name_Id := N + 100;
-- Operator Symbol entries. The actual names have an upper case O at
-- the start in place of the Op_ prefix (e.g. the actual name that
-- corresponds to Name_Op_Abs is "Oabs".
First_Operator_Name : constant Name_Id := N + 101;
Name_Op_Abs : constant Name_Id := N + 101; -- "abs"
Name_Op_And : constant Name_Id := N + 102; -- "and"
Name_Op_Mod : constant Name_Id := N + 103; -- "mod"
Name_Op_Not : constant Name_Id := N + 104; -- "not"
Name_Op_Or : constant Name_Id := N + 105; -- "or"
Name_Op_Rem : constant Name_Id := N + 106; -- "rem"
Name_Op_Xor : constant Name_Id := N + 107; -- "xor"
Name_Op_Eq : constant Name_Id := N + 108; -- "="
Name_Op_Ne : constant Name_Id := N + 109; -- "/="
Name_Op_Lt : constant Name_Id := N + 110; -- "<"
Name_Op_Le : constant Name_Id := N + 111; -- "<="
Name_Op_Gt : constant Name_Id := N + 112; -- ">"
Name_Op_Ge : constant Name_Id := N + 113; -- ">="
Name_Op_Add : constant Name_Id := N + 114; -- "+"
Name_Op_Subtract : constant Name_Id := N + 115; -- "-"
Name_Op_Concat : constant Name_Id := N + 116; -- "&"
Name_Op_Multiply : constant Name_Id := N + 117; -- "*"
Name_Op_Divide : constant Name_Id := N + 118; -- "/"
Name_Op_Expon : constant Name_Id := N + 119; -- "**"
Last_Operator_Name : constant Name_Id := N + 119;
-- Names for all pragmas recognized by GNAT. The entries with the comment
-- "Ada 83" are pragmas that are defined in Ada 83, but not in Ada 95.
-- These pragmas are fully implemented in all modes (Ada 83, Ada 95, and
-- Ada 2005). In Ada 95 and Ada 2005 modes, they are technically considered
-- to be implementation dependent pragmas.
-- The entries marked GNAT are pragmas that are defined by GNAT and that
-- are implemented in all modes (Ada 83, Ada 95, and Ada 2005) Complete
-- descriptions of the syntax of these implementation dependent pragmas
-- may be found in the appropriate section in unit Sem_Prag in file
-- sem-prag.adb, and they are documented in the GNAT reference manual.
-- The entries marked Ada 05 are Ada 2005 pragmas. They are implemented
-- in Ada 83 and Ada 95 mode as well, where they are technically considered
-- to be implementation dependent pragmas.
-- The entries marked Ada 12 are Ada 2012 pragmas. They are implemented
-- in Ada 83, Ada 95, and Ada 2005 mode as well, where they are technically
-- considered to be implementation dependent pragmas.
-- The entries marked VMS are VMS specific pragmas that are recognized
-- only in OpenVMS versions of GNAT. They are ignored in other versions
-- with an appropriate warning.
-- The entries marked AAMP are AAMP specific pragmas that are recognized
-- only in GNAT for the AAMP. They are ignored in other versions with
-- appropriate warnings.
First_Pragma_Name : constant Name_Id := N + 120;
-- Configuration pragmas are grouped at start. Note that there is a list
-- of these names in the GNAT Users guide, be sure to update this list if
-- a new configuration pragma is added.
Name_Ada_83 : constant Name_Id := N + 120; -- GNAT
Name_Ada_95 : constant Name_Id := N + 121; -- GNAT
Name_Ada_05 : constant Name_Id := N + 122; -- GNAT
Name_Ada_2005 : constant Name_Id := N + 123; -- GNAT
Name_Ada_12 : constant Name_Id := N + 124; -- GNAT
Name_Ada_2012 : constant Name_Id := N + 125; -- GNAT
Name_Assertion_Policy : constant Name_Id := N + 126; -- Ada 05
Name_Assume_No_Invalid_Values : constant Name_Id := N + 127; -- GNAT
Name_C_Pass_By_Copy : constant Name_Id := N + 128; -- GNAT
Name_Check_Name : constant Name_Id := N + 129; -- GNAT
Name_Check_Policy : constant Name_Id := N + 130; -- GNAT
Name_Compile_Time_Error : constant Name_Id := N + 131; -- GNAT
Name_Compile_Time_Warning : constant Name_Id := N + 132; -- GNAT
Name_Compiler_Unit : constant Name_Id := N + 133; -- GNAT
Name_Component_Alignment : constant Name_Id := N + 134; -- GNAT
Name_Convention_Identifier : constant Name_Id := N + 135; -- GNAT
Name_Debug_Policy : constant Name_Id := N + 136; -- GNAT
Name_Detect_Blocking : constant Name_Id := N + 137; -- Ada 05
Name_Default_Storage_Pool : constant Name_Id := N + 138; -- Ada 12
Name_Discard_Names : constant Name_Id := N + 139;
Name_Elaboration_Checks : constant Name_Id := N + 140; -- GNAT
Name_Eliminate : constant Name_Id := N + 141; -- GNAT
Name_Extend_System : constant Name_Id := N + 142; -- GNAT
Name_Extensions_Allowed : constant Name_Id := N + 143; -- GNAT
Name_External_Name_Casing : constant Name_Id := N + 144; -- GNAT
-- Note: Fast_Math is not in this list because its name matches -- GNAT
-- the name of the corresponding attribute. However, it is
-- included in the definition of the type Pragma_Id, and the
-- functions Get_Pragma_Id, Is_[Configuration_]Pragma_Id, and
-- correctly recognize and process Fast_Math.
Name_Favor_Top_Level : constant Name_Id := N + 145; -- GNAT
Name_Float_Representation : constant Name_Id := N + 146; -- GNAT
Name_Implicit_Packing : constant Name_Id := N + 147; -- GNAT
Name_Initialize_Scalars : constant Name_Id := N + 148; -- GNAT
Name_Interrupt_State : constant Name_Id := N + 149; -- GNAT
Name_License : constant Name_Id := N + 150; -- GNAT
Name_Locking_Policy : constant Name_Id := N + 151;
Name_Long_Float : constant Name_Id := N + 152; -- VMS
Name_No_Run_Time : constant Name_Id := N + 153; -- GNAT
Name_No_Strict_Aliasing : constant Name_Id := N + 154; -- GNAT
Name_Normalize_Scalars : constant Name_Id := N + 155;
Name_Optimize_Alignment : constant Name_Id := N + 156; -- GNAT
Name_Persistent_BSS : constant Name_Id := N + 157; -- GNAT
Name_Polling : constant Name_Id := N + 158; -- GNAT
Name_Priority_Specific_Dispatching : constant Name_Id := N + 159; -- Ada 05
Name_Profile : constant Name_Id := N + 160; -- Ada 05
Name_Profile_Warnings : constant Name_Id := N + 161; -- GNAT
Name_Propagate_Exceptions : constant Name_Id := N + 162; -- GNAT
Name_Queuing_Policy : constant Name_Id := N + 163;
Name_Ravenscar : constant Name_Id := N + 164; -- GNAT
Name_Restricted_Run_Time : constant Name_Id := N + 165; -- GNAT
Name_Restrictions : constant Name_Id := N + 166;
Name_Restriction_Warnings : constant Name_Id := N + 167; -- GNAT
Name_Reviewable : constant Name_Id := N + 168;
Name_Short_Circuit_And_Or : constant Name_Id := N + 169; -- GNAT
Name_Short_Descriptors : constant Name_Id := N + 170; -- GNAT
Name_Source_File_Name : constant Name_Id := N + 171; -- GNAT
Name_Source_File_Name_Project : constant Name_Id := N + 172; -- GNAT
Name_Style_Checks : constant Name_Id := N + 173; -- GNAT
Name_Suppress : constant Name_Id := N + 174;
Name_Suppress_Exception_Locations : constant Name_Id := N + 175; -- GNAT
Name_Task_Dispatching_Policy : constant Name_Id := N + 176;
Name_Universal_Data : constant Name_Id := N + 177; -- AAMP
Name_Unsuppress : constant Name_Id := N + 178; -- Ada 05
Name_Use_VADS_Size : constant Name_Id := N + 179; -- GNAT
Name_Validity_Checks : constant Name_Id := N + 180; -- GNAT
Name_Warnings : constant Name_Id := N + 181; -- GNAT
Name_Wide_Character_Encoding : constant Name_Id := N + 182; -- GNAT
Last_Configuration_Pragma_Name : constant Name_Id := N + 182;
-- Remaining pragma names
Name_Abort_Defer : constant Name_Id := N + 183; -- GNAT
Name_All_Calls_Remote : constant Name_Id := N + 184;
Name_Annotate : constant Name_Id := N + 185; -- GNAT
-- Note: AST_Entry is not in this list because its name matches -- VMS
-- the name of the corresponding attribute. However, it is
-- included in the definition of the type Pragma_Id, and the
-- functions Get_Pragma_Id and Is_Pragma_Id correctly recognize
-- and process Name_AST_Entry.
Name_Assert : constant Name_Id := N + 186; -- Ada 05
Name_Asynchronous : constant Name_Id := N + 187;
Name_Atomic : constant Name_Id := N + 188;
Name_Atomic_Components : constant Name_Id := N + 189;
Name_Attach_Handler : constant Name_Id := N + 190;
Name_Check : constant Name_Id := N + 191; -- GNAT
Name_CIL_Constructor : constant Name_Id := N + 192; -- GNAT
Name_Comment : constant Name_Id := N + 193; -- GNAT
Name_Common_Object : constant Name_Id := N + 194; -- GNAT
Name_Complete_Representation : constant Name_Id := N + 195; -- GNAT
Name_Complex_Representation : constant Name_Id := N + 196; -- GNAT
Name_Controlled : constant Name_Id := N + 197;
Name_Convention : constant Name_Id := N + 198;
Name_CPP_Class : constant Name_Id := N + 199; -- GNAT
Name_CPP_Constructor : constant Name_Id := N + 200; -- GNAT
Name_CPP_Virtual : constant Name_Id := N + 201; -- GNAT
Name_CPP_Vtable : constant Name_Id := N + 202; -- GNAT
Name_CPU : constant Name_Id := N + 203; -- Ada 12
Name_Debug : constant Name_Id := N + 204; -- GNAT
Name_Dimension : constant Name_Id := N + 205; -- GNAT
Name_Elaborate : constant Name_Id := N + 206; -- Ada 83
Name_Elaborate_All : constant Name_Id := N + 207;
Name_Elaborate_Body : constant Name_Id := N + 208;
Name_Export : constant Name_Id := N + 209;
Name_Export_Exception : constant Name_Id := N + 210; -- VMS
Name_Export_Function : constant Name_Id := N + 211; -- GNAT
Name_Export_Object : constant Name_Id := N + 212; -- GNAT
Name_Export_Procedure : constant Name_Id := N + 213; -- GNAT
Name_Export_Value : constant Name_Id := N + 214; -- GNAT
Name_Export_Valued_Procedure : constant Name_Id := N + 215; -- GNAT
Name_External : constant Name_Id := N + 216; -- GNAT
Name_Finalize_Storage_Only : constant Name_Id := N + 217; -- GNAT
Name_Ident : constant Name_Id := N + 218; -- VMS
Name_Implemented : constant Name_Id := N + 219; -- Ada 12
Name_Import : constant Name_Id := N + 220;
Name_Import_Exception : constant Name_Id := N + 221; -- VMS
Name_Import_Function : constant Name_Id := N + 222; -- GNAT
Name_Import_Object : constant Name_Id := N + 223; -- GNAT
Name_Import_Procedure : constant Name_Id := N + 224; -- GNAT
Name_Import_Valued_Procedure : constant Name_Id := N + 225; -- GNAT
Name_Independent : constant Name_Id := N + 226; -- Ada 12
Name_Independent_Components : constant Name_Id := N + 227; -- Ada 12
Name_Inline : constant Name_Id := N + 228;
Name_Inline_Always : constant Name_Id := N + 229; -- GNAT
Name_Inline_Generic : constant Name_Id := N + 230; -- GNAT
Name_Inspection_Point : constant Name_Id := N + 231;
-- Note: Interface is not in this list because its name -- GNAT
-- matches an Ada 05 keyword. However it is included in
-- the definition of the type Attribute_Id, and the functions
-- Get_Pragma_Id and Is_Pragma_Id correctly recognize and
-- process Name_Storage_Size.
Name_Interface_Name : constant Name_Id := N + 232; -- GNAT
Name_Interrupt_Handler : constant Name_Id := N + 233;
Name_Interrupt_Priority : constant Name_Id := N + 234;
Name_Invariant : constant Name_Id := N + 235; -- GNAT
Name_Java_Constructor : constant Name_Id := N + 236; -- GNAT
Name_Java_Interface : constant Name_Id := N + 237; -- GNAT
Name_Keep_Names : constant Name_Id := N + 238; -- GNAT
Name_Link_With : constant Name_Id := N + 239; -- GNAT
Name_Linker_Alias : constant Name_Id := N + 240; -- GNAT
Name_Linker_Constructor : constant Name_Id := N + 241; -- GNAT
Name_Linker_Destructor : constant Name_Id := N + 242; -- GNAT
Name_Linker_Options : constant Name_Id := N + 243;
Name_Linker_Section : constant Name_Id := N + 244; -- GNAT
Name_List : constant Name_Id := N + 245;
Name_Machine_Attribute : constant Name_Id := N + 246; -- GNAT
Name_Main : constant Name_Id := N + 247; -- GNAT
Name_Main_Storage : constant Name_Id := N + 248; -- GNAT
Name_Memory_Size : constant Name_Id := N + 249; -- Ada 83
Name_No_Body : constant Name_Id := N + 250; -- GNAT
Name_No_Return : constant Name_Id := N + 251; -- Ada 05
Name_Obsolescent : constant Name_Id := N + 252; -- GNAT
Name_Optimize : constant Name_Id := N + 253;
Name_Ordered : constant Name_Id := N + 254; -- GNAT
Name_Pack : constant Name_Id := N + 255;
Name_Page : constant Name_Id := N + 256;
Name_Passive : constant Name_Id := N + 257; -- GNAT
Name_Postcondition : constant Name_Id := N + 258; -- GNAT
Name_Precondition : constant Name_Id := N + 259; -- GNAT
Name_Predicate : constant Name_Id := N + 260; -- GNAT
Name_Preelaborable_Initialization : constant Name_Id := N + 261; -- Ada 05
Name_Preelaborate : constant Name_Id := N + 262;
Name_Preelaborate_05 : constant Name_Id := N + 263; -- GNAT
-- Note: Priority is not in this list because its name matches
-- the name of the corresponding attribute. However, it is
-- included in the definition of the type Pragma_Id, and the
-- functions Get_Pragma_Id and Is_Pragma_Id correctly recognize
-- and process Priority. Priority is a standard Ada 95 pragma.
Name_Psect_Object : constant Name_Id := N + 264; -- VMS
Name_Pure : constant Name_Id := N + 265;
Name_Pure_05 : constant Name_Id := N + 266; -- GNAT
Name_Pure_Function : constant Name_Id := N + 267; -- GNAT
Name_Relative_Deadline : constant Name_Id := N + 268; -- Ada 05
Name_Remote_Call_Interface : constant Name_Id := N + 269;
Name_Remote_Types : constant Name_Id := N + 270;
Name_Share_Generic : constant Name_Id := N + 271; -- GNAT
Name_Shared : constant Name_Id := N + 272; -- Ada 83
Name_Shared_Passive : constant Name_Id := N + 273;
-- Note: Storage_Size is not in this list because its name
-- matches the name of the corresponding attribute. However,
-- it is included in the definition of the type Attribute_Id,
-- and the functions Get_Pragma_Id and Is_Pragma_Id correctly
-- recognize and process Name_Storage_Size.
-- Note: Storage_Unit is also omitted from the list because
-- of a clash with an attribute name, and is treated similarly.
Name_Source_Reference : constant Name_Id := N + 274; -- GNAT
Name_Static_Elaboration_Desired : constant Name_Id := N + 275; -- GNAT
Name_Stream_Convert : constant Name_Id := N + 276; -- GNAT
Name_Subtitle : constant Name_Id := N + 277; -- GNAT
Name_Suppress_All : constant Name_Id := N + 278; -- GNAT
Name_Suppress_Debug_Info : constant Name_Id := N + 279; -- GNAT
Name_Suppress_Initialization : constant Name_Id := N + 280; -- GNAT
Name_System_Name : constant Name_Id := N + 281; -- Ada 83
Name_Task_Info : constant Name_Id := N + 282; -- GNAT
Name_Task_Name : constant Name_Id := N + 283; -- GNAT
Name_Task_Storage : constant Name_Id := N + 284; -- VMS
Name_Thread_Local_Storage : constant Name_Id := N + 285; -- GNAT
Name_Time_Slice : constant Name_Id := N + 286; -- GNAT
Name_Title : constant Name_Id := N + 287; -- GNAT
Name_Unchecked_Union : constant Name_Id := N + 288; -- Ada 05
Name_Unimplemented_Unit : constant Name_Id := N + 289; -- GNAT
Name_Universal_Aliasing : constant Name_Id := N + 290; -- GNAT
Name_Unmodified : constant Name_Id := N + 291; -- GNAT
Name_Unreferenced : constant Name_Id := N + 292; -- GNAT
Name_Unreferenced_Objects : constant Name_Id := N + 293; -- GNAT
Name_Unreserve_All_Interrupts : constant Name_Id := N + 294; -- GNAT
Name_Volatile : constant Name_Id := N + 295;
Name_Volatile_Components : constant Name_Id := N + 296;
Name_Weak_External : constant Name_Id := N + 297; -- GNAT
Last_Pragma_Name : constant Name_Id := N + 297;
-- Language convention names for pragma Convention/Export/Import/Interface
-- Note that Name_C is not included in this list, since it was already
-- declared earlier in the context of one-character identifier names
-- (where the order is critical to the fast look up process).
-- Note: there are no convention names corresponding to the conventions
-- Entry and Protected, this is because these conventions cannot be
-- specified by a pragma.
First_Convention_Name : constant Name_Id := N + 298;
Name_Ada : constant Name_Id := N + 298;
Name_Assembler : constant Name_Id := N + 299;
Name_CIL : constant Name_Id := N + 300;
Name_COBOL : constant Name_Id := N + 301;
Name_CPP : constant Name_Id := N + 302;
Name_Fortran : constant Name_Id := N + 303;
Name_Intrinsic : constant Name_Id := N + 304;
Name_Java : constant Name_Id := N + 305;
Name_Stdcall : constant Name_Id := N + 306;
Name_Stubbed : constant Name_Id := N + 307;
Last_Convention_Name : constant Name_Id := N + 307;
-- The following names are preset as synonyms for Assembler
Name_Asm : constant Name_Id := N + 308;
Name_Assembly : constant Name_Id := N + 309;
-- The following names are preset as synonyms for C
Name_Default : constant Name_Id := N + 310;
-- Name_External (previously defined as pragma)
-- The following names are preset as synonyms for CPP
Name_C_Plus_Plus : constant Name_Id := N + 311;
-- The following names are present as synonyms for Stdcall
Name_DLL : constant Name_Id := N + 312;
Name_Win32 : constant Name_Id := N + 313;
-- Other special names used in processing pragmas
Name_As_Is : constant Name_Id := N + 314;
Name_Assertion : constant Name_Id := N + 315;
Name_Attribute_Name : constant Name_Id := N + 316;
Name_Body_File_Name : constant Name_Id := N + 317;
Name_Boolean_Entry_Barriers : constant Name_Id := N + 318;
Name_By_Any : constant Name_Id := N + 319;
Name_By_Entry : constant Name_Id := N + 320;
Name_By_Protected_Procedure : constant Name_Id := N + 321;
Name_Casing : constant Name_Id := N + 322;
Name_Code : constant Name_Id := N + 323;
Name_Component : constant Name_Id := N + 324;
Name_Component_Size_4 : constant Name_Id := N + 325;
Name_Copy : constant Name_Id := N + 326;
Name_D_Float : constant Name_Id := N + 327;
Name_Descriptor : constant Name_Id := N + 328;
Name_Dot_Replacement : constant Name_Id := N + 329;
Name_Dynamic : constant Name_Id := N + 330;
Name_Entity : constant Name_Id := N + 331;
Name_Entry_Count : constant Name_Id := N + 332;
Name_External_Name : constant Name_Id := N + 333;
Name_First_Optional_Parameter : constant Name_Id := N + 334;
Name_Form : constant Name_Id := N + 335;
Name_G_Float : constant Name_Id := N + 336;
Name_Gcc : constant Name_Id := N + 337;
Name_Gnat : constant Name_Id := N + 338;
Name_GPL : constant Name_Id := N + 339;
Name_IEEE_Float : constant Name_Id := N + 340;
Name_Ignore : constant Name_Id := N + 341;
Name_Info : constant Name_Id := N + 342;
Name_Internal : constant Name_Id := N + 343;
Name_Link_Name : constant Name_Id := N + 344;
Name_Lowercase : constant Name_Id := N + 345;
Name_Max_Entry_Queue_Depth : constant Name_Id := N + 346;
Name_Max_Entry_Queue_Length : constant Name_Id := N + 347;
Name_Max_Size : constant Name_Id := N + 348;
Name_Mechanism : constant Name_Id := N + 349;
Name_Message : constant Name_Id := N + 350;
Name_Mixedcase : constant Name_Id := N + 351;
Name_Modified_GPL : constant Name_Id := N + 352;
Name_Name : constant Name_Id := N + 353;
Name_NCA : constant Name_Id := N + 354;
Name_No : constant Name_Id := N + 355;
Name_No_Dependence : constant Name_Id := N + 356;
Name_No_Dynamic_Attachment : constant Name_Id := N + 357;
Name_No_Dynamic_Interrupts : constant Name_Id := N + 358;
Name_No_Requeue : constant Name_Id := N + 359;
Name_No_Requeue_Statements : constant Name_Id := N + 360;
Name_No_Task_Attributes : constant Name_Id := N + 361;
Name_No_Task_Attributes_Package : constant Name_Id := N + 362;
Name_On : constant Name_Id := N + 363;
Name_Policy : constant Name_Id := N + 364;
Name_Parameter_Types : constant Name_Id := N + 365;
Name_Reference : constant Name_Id := N + 366;
Name_Restricted : constant Name_Id := N + 367;
Name_Result_Mechanism : constant Name_Id := N + 368;
Name_Result_Type : constant Name_Id := N + 369;
Name_Runtime : constant Name_Id := N + 370;
Name_SB : constant Name_Id := N + 371;
Name_Secondary_Stack_Size : constant Name_Id := N + 372;
Name_Section : constant Name_Id := N + 373;
Name_Semaphore : constant Name_Id := N + 374;
Name_Short_Descriptor : constant Name_Id := N + 375;
Name_Simple_Barriers : constant Name_Id := N + 376;
Name_Spec_File_Name : constant Name_Id := N + 377;
Name_State : constant Name_Id := N + 378;
Name_Static : constant Name_Id := N + 379;
Name_Stack_Size : constant Name_Id := N + 380;
Name_Subunit_File_Name : constant Name_Id := N + 381;
Name_Task_Stack_Size_Default : constant Name_Id := N + 382;
Name_Task_Type : constant Name_Id := N + 383;
Name_Time_Slicing_Enabled : constant Name_Id := N + 384;
Name_Top_Guard : constant Name_Id := N + 385;
Name_UBA : constant Name_Id := N + 386;
Name_UBS : constant Name_Id := N + 387;
Name_UBSB : constant Name_Id := N + 388;
Name_Unit_Name : constant Name_Id := N + 389;
Name_Unknown : constant Name_Id := N + 390;
Name_Unrestricted : constant Name_Id := N + 391;
Name_Uppercase : constant Name_Id := N + 392;
Name_User : constant Name_Id := N + 393;
Name_VAX_Float : constant Name_Id := N + 394;
Name_VMS : constant Name_Id := N + 395;
Name_Vtable_Ptr : constant Name_Id := N + 396;
Name_Working_Storage : constant Name_Id := N + 397;
-- Names of recognized attributes. The entries with the comment "Ada 83"
-- are attributes that are defined in Ada 83, but not in Ada 95. These
-- attributes are implemented in both Ada 83 and Ada 95 modes in GNAT.
-- The entries marked GNAT are attributes that are defined by GNAT
-- and implemented in both Ada 83 and Ada 95 modes. Full descriptions
-- of these implementation dependent attributes may be found in the
-- appropriate section in package Sem_Attr in file sem-attr.ads.
-- The entries marked VMS are recognized only in OpenVMS implementations
-- of GNAT, and are treated as illegal in all other contexts.
First_Attribute_Name : constant Name_Id := N + 398;
Name_Abort_Signal : constant Name_Id := N + 398; -- GNAT
Name_Access : constant Name_Id := N + 399;
Name_Address : constant Name_Id := N + 400;
Name_Address_Size : constant Name_Id := N + 401; -- GNAT
Name_Aft : constant Name_Id := N + 402;
Name_Alignment : constant Name_Id := N + 403;
Name_Asm_Input : constant Name_Id := N + 404; -- GNAT
Name_Asm_Output : constant Name_Id := N + 405; -- GNAT
Name_AST_Entry : constant Name_Id := N + 406; -- VMS
Name_Bit : constant Name_Id := N + 407; -- GNAT
Name_Bit_Order : constant Name_Id := N + 408;
Name_Bit_Position : constant Name_Id := N + 409; -- GNAT
Name_Body_Version : constant Name_Id := N + 410;
Name_Callable : constant Name_Id := N + 411;
Name_Caller : constant Name_Id := N + 412;
Name_Code_Address : constant Name_Id := N + 413; -- GNAT
Name_Compiler_Version : constant Name_Id := N + 414; -- GNAT
Name_Component_Size : constant Name_Id := N + 415;
Name_Compose : constant Name_Id := N + 416;
Name_Constrained : constant Name_Id := N + 417;
Name_Count : constant Name_Id := N + 418;
Name_Default_Bit_Order : constant Name_Id := N + 419; -- GNAT
Name_Definite : constant Name_Id := N + 420;
Name_Delta : constant Name_Id := N + 421;
Name_Denorm : constant Name_Id := N + 422;
Name_Digits : constant Name_Id := N + 423;
Name_Elaborated : constant Name_Id := N + 424; -- GNAT
Name_Emax : constant Name_Id := N + 425; -- Ada 83
Name_Enabled : constant Name_Id := N + 426; -- GNAT
Name_Enum_Rep : constant Name_Id := N + 427; -- GNAT
Name_Enum_Val : constant Name_Id := N + 428; -- GNAT
Name_Epsilon : constant Name_Id := N + 429; -- Ada 83
Name_Exponent : constant Name_Id := N + 430;
Name_External_Tag : constant Name_Id := N + 431;
Name_Fast_Math : constant Name_Id := N + 432; -- GNAT
Name_First : constant Name_Id := N + 433;
Name_First_Bit : constant Name_Id := N + 434;
Name_Fixed_Value : constant Name_Id := N + 435; -- GNAT
Name_Fore : constant Name_Id := N + 436;
Name_Has_Access_Values : constant Name_Id := N + 437; -- GNAT
Name_Has_Discriminants : constant Name_Id := N + 438; -- GNAT
Name_Has_Tagged_Values : constant Name_Id := N + 439; -- GNAT
Name_Identity : constant Name_Id := N + 440;
Name_Img : constant Name_Id := N + 441; -- GNAT
Name_Integer_Value : constant Name_Id := N + 442; -- GNAT
Name_Invalid_Value : constant Name_Id := N + 443; -- GNAT
Name_Large : constant Name_Id := N + 444; -- Ada 83
Name_Last : constant Name_Id := N + 445;
Name_Last_Bit : constant Name_Id := N + 446;
Name_Leading_Part : constant Name_Id := N + 447;
Name_Length : constant Name_Id := N + 448;
Name_Machine_Emax : constant Name_Id := N + 449;
Name_Machine_Emin : constant Name_Id := N + 450;
Name_Machine_Mantissa : constant Name_Id := N + 451;
Name_Machine_Overflows : constant Name_Id := N + 452;
Name_Machine_Radix : constant Name_Id := N + 453;
Name_Machine_Rounding : constant Name_Id := N + 454; -- Ada 05
Name_Machine_Rounds : constant Name_Id := N + 455;
Name_Machine_Size : constant Name_Id := N + 456; -- GNAT
Name_Mantissa : constant Name_Id := N + 457; -- Ada 83
Name_Max_Alignment_For_Allocation : constant Name_Id := N + 458; -- Ada 12
Name_Max_Size_In_Storage_Elements : constant Name_Id := N + 459;
Name_Maximum_Alignment : constant Name_Id := N + 460; -- GNAT
Name_Mechanism_Code : constant Name_Id := N + 461; -- GNAT
Name_Mod : constant Name_Id := N + 462; -- Ada 05
Name_Model_Emin : constant Name_Id := N + 463;
Name_Model_Epsilon : constant Name_Id := N + 464;
Name_Model_Mantissa : constant Name_Id := N + 465;
Name_Model_Small : constant Name_Id := N + 466;
Name_Modulus : constant Name_Id := N + 467;
Name_Null_Parameter : constant Name_Id := N + 468; -- GNAT
Name_Object_Size : constant Name_Id := N + 469; -- GNAT
Name_Old : constant Name_Id := N + 470; -- GNAT
Name_Partition_ID : constant Name_Id := N + 471;
Name_Passed_By_Reference : constant Name_Id := N + 472; -- GNAT
Name_Pool_Address : constant Name_Id := N + 473;
Name_Pos : constant Name_Id := N + 474;
Name_Position : constant Name_Id := N + 475;
Name_Priority : constant Name_Id := N + 476; -- Ada 05
Name_Range : constant Name_Id := N + 477;
Name_Range_Length : constant Name_Id := N + 478; -- GNAT
Name_Ref : constant Name_Id := N + 479; -- GNAT
Name_Result : constant Name_Id := N + 480; -- GNAT
Name_Round : constant Name_Id := N + 481;
Name_Safe_Emax : constant Name_Id := N + 482; -- Ada 83
Name_Safe_First : constant Name_Id := N + 483;
Name_Safe_Large : constant Name_Id := N + 484; -- Ada 83
Name_Safe_Last : constant Name_Id := N + 485;
Name_Safe_Small : constant Name_Id := N + 486; -- Ada 83
Name_Scale : constant Name_Id := N + 487;
Name_Scaling : constant Name_Id := N + 488;
Name_Signed_Zeros : constant Name_Id := N + 489;
Name_Size : constant Name_Id := N + 490;
Name_Small : constant Name_Id := N + 491;
Name_Storage_Size : constant Name_Id := N + 492;
Name_Storage_Unit : constant Name_Id := N + 493; -- GNAT
Name_Stream_Size : constant Name_Id := N + 494; -- Ada 05
Name_Tag : constant Name_Id := N + 495;
Name_Target_Name : constant Name_Id := N + 496; -- GNAT
Name_Terminated : constant Name_Id := N + 497;
Name_To_Address : constant Name_Id := N + 498; -- GNAT
Name_Type_Class : constant Name_Id := N + 499; -- GNAT
Name_Type_Key : constant Name_Id := N + 500; -- GNAT
Name_UET_Address : constant Name_Id := N + 501; -- GNAT
Name_Unbiased_Rounding : constant Name_Id := N + 502;
Name_Unchecked_Access : constant Name_Id := N + 503;
Name_Unconstrained_Array : constant Name_Id := N + 504;
Name_Universal_Literal_String : constant Name_Id := N + 505; -- GNAT
Name_Unrestricted_Access : constant Name_Id := N + 506; -- GNAT
Name_VADS_Size : constant Name_Id := N + 507; -- GNAT
Name_Val : constant Name_Id := N + 508;
Name_Valid : constant Name_Id := N + 509;
Name_Value_Size : constant Name_Id := N + 510; -- GNAT
Name_Version : constant Name_Id := N + 511;
Name_Wchar_T_Size : constant Name_Id := N + 512; -- GNAT
Name_Wide_Wide_Width : constant Name_Id := N + 513; -- Ada 05
Name_Wide_Width : constant Name_Id := N + 514;
Name_Width : constant Name_Id := N + 515;
Name_Word_Size : constant Name_Id := N + 516; -- GNAT
-- Attributes that designate attributes returning renamable functions,
-- i.e. functions that return other than a universal value and that
-- have non-universal arguments.
First_Renamable_Function_Attribute : constant Name_Id := N + 517;
Name_Adjacent : constant Name_Id := N + 517;
Name_Ceiling : constant Name_Id := N + 518;
Name_Copy_Sign : constant Name_Id := N + 519;
Name_Floor : constant Name_Id := N + 520;
Name_Fraction : constant Name_Id := N + 521;
Name_From_Any : constant Name_Id := N + 522; -- GNAT
Name_Image : constant Name_Id := N + 523;
Name_Input : constant Name_Id := N + 524;
Name_Machine : constant Name_Id := N + 525;
Name_Max : constant Name_Id := N + 526;
Name_Min : constant Name_Id := N + 527;
Name_Model : constant Name_Id := N + 528;
Name_Pred : constant Name_Id := N + 529;
Name_Remainder : constant Name_Id := N + 530;
Name_Rounding : constant Name_Id := N + 531;
Name_Succ : constant Name_Id := N + 532;
Name_To_Any : constant Name_Id := N + 533; -- GNAT
Name_Truncation : constant Name_Id := N + 534;
Name_TypeCode : constant Name_Id := N + 535; -- GNAT
Name_Value : constant Name_Id := N + 536;
Name_Wide_Image : constant Name_Id := N + 537;
Name_Wide_Wide_Image : constant Name_Id := N + 538;
Name_Wide_Value : constant Name_Id := N + 539;
Name_Wide_Wide_Value : constant Name_Id := N + 540;
Last_Renamable_Function_Attribute : constant Name_Id := N + 540;
-- Attributes that designate procedures
First_Procedure_Attribute : constant Name_Id := N + 541;
Name_Output : constant Name_Id := N + 541;
Name_Read : constant Name_Id := N + 542;
Name_Write : constant Name_Id := N + 543;
Last_Procedure_Attribute : constant Name_Id := N + 543;
-- Remaining attributes are ones that return entities
First_Entity_Attribute_Name : constant Name_Id := N + 544;
Name_Elab_Body : constant Name_Id := N + 544; -- GNAT
Name_Elab_Spec : constant Name_Id := N + 545; -- GNAT
Name_Storage_Pool : constant Name_Id := N + 546;
-- These attributes are the ones that return types
First_Type_Attribute_Name : constant Name_Id := N + 547;
Name_Base : constant Name_Id := N + 547;
Name_Class : constant Name_Id := N + 548;
Name_Stub_Type : constant Name_Id := N + 549;
Last_Type_Attribute_Name : constant Name_Id := N + 549;
Last_Entity_Attribute_Name : constant Name_Id := N + 549;
Last_Attribute_Name : constant Name_Id := N + 549;
-- Names of recognized locking policy identifiers
-- Note: policies are identified by the first character of the
-- name (e.g. C for Ceiling_Locking). If new policy names are added,
-- the first character must be distinct.
First_Locking_Policy_Name : constant Name_Id := N + 550;
Name_Ceiling_Locking : constant Name_Id := N + 550;
Name_Inheritance_Locking : constant Name_Id := N + 551;
Last_Locking_Policy_Name : constant Name_Id := N + 551;
-- Names of recognized queuing policy identifiers
-- Note: policies are identified by the first character of the
-- name (e.g. F for FIFO_Queuing). If new policy names are added,
-- the first character must be distinct.
First_Queuing_Policy_Name : constant Name_Id := N + 552;
Name_FIFO_Queuing : constant Name_Id := N + 552;
Name_Priority_Queuing : constant Name_Id := N + 553;
Last_Queuing_Policy_Name : constant Name_Id := N + 553;
-- Names of recognized task dispatching policy identifiers
-- Note: policies are identified by the first character of the
-- name (e.g. F for FIFO_Within_Priorities). If new policy names
-- are added, the first character must be distinct.
First_Task_Dispatching_Policy_Name : constant Name_Id := N + 554;
Name_EDF_Across_Priorities : constant Name_Id := N + 554;
Name_FIFO_Within_Priorities : constant Name_Id := N + 555;
Name_Non_Preemptive_Within_Priorities : constant Name_Id := N + 556;
Name_Round_Robin_Within_Priorities : constant Name_Id := N + 557;
Last_Task_Dispatching_Policy_Name : constant Name_Id := N + 557;
-- Names of recognized checks for pragma Suppress
First_Check_Name : constant Name_Id := N + 558;
Name_Access_Check : constant Name_Id := N + 558;
Name_Accessibility_Check : constant Name_Id := N + 559;
Name_Alignment_Check : constant Name_Id := N + 560; -- GNAT
Name_Discriminant_Check : constant Name_Id := N + 561;
Name_Division_Check : constant Name_Id := N + 562;
Name_Elaboration_Check : constant Name_Id := N + 563;
Name_Index_Check : constant Name_Id := N + 564;
Name_Length_Check : constant Name_Id := N + 565;
Name_Overflow_Check : constant Name_Id := N + 566;
Name_Range_Check : constant Name_Id := N + 567;
Name_Storage_Check : constant Name_Id := N + 568;
Name_Tag_Check : constant Name_Id := N + 569;
Name_Validity_Check : constant Name_Id := N + 570; -- GNAT
Name_All_Checks : constant Name_Id := N + 571;
Last_Check_Name : constant Name_Id := N + 571;
-- Names corresponding to reserved keywords, excluding those already
-- declared in the attribute list (Access, Delta, Digits, Mod, Range).
-- Note: Name_Some is here even though for now we do not treat it as being
-- reserved. We treat it instead as an unreserved keyword. This may change
-- in the future, but in any case it belongs in the following list.
Name_Abort : constant Name_Id := N + 572;
Name_Abs : constant Name_Id := N + 573;
Name_Accept : constant Name_Id := N + 574;
Name_And : constant Name_Id := N + 575;
Name_All : constant Name_Id := N + 576;
Name_Array : constant Name_Id := N + 577;
Name_At : constant Name_Id := N + 578;
Name_Begin : constant Name_Id := N + 579;
Name_Body : constant Name_Id := N + 580;
Name_Case : constant Name_Id := N + 581;
Name_Constant : constant Name_Id := N + 582;
Name_Declare : constant Name_Id := N + 583;
Name_Delay : constant Name_Id := N + 584;
Name_Do : constant Name_Id := N + 585;
Name_Else : constant Name_Id := N + 586;
Name_Elsif : constant Name_Id := N + 587;
Name_End : constant Name_Id := N + 588;
Name_Entry : constant Name_Id := N + 589;
Name_Exception : constant Name_Id := N + 590;
Name_Exit : constant Name_Id := N + 591;
Name_For : constant Name_Id := N + 592;
Name_Function : constant Name_Id := N + 593;
Name_Generic : constant Name_Id := N + 594;
Name_Goto : constant Name_Id := N + 595;
Name_If : constant Name_Id := N + 596;
Name_In : constant Name_Id := N + 597;
Name_Is : constant Name_Id := N + 598;
Name_Limited : constant Name_Id := N + 599;
Name_Loop : constant Name_Id := N + 600;
Name_New : constant Name_Id := N + 601;
Name_Not : constant Name_Id := N + 602;
Name_Null : constant Name_Id := N + 603;
Name_Of : constant Name_Id := N + 604;
Name_Or : constant Name_Id := N + 605;
Name_Others : constant Name_Id := N + 606;
Name_Out : constant Name_Id := N + 607;
Name_Package : constant Name_Id := N + 608;
Name_Pragma : constant Name_Id := N + 609;
Name_Private : constant Name_Id := N + 610;
Name_Procedure : constant Name_Id := N + 611;
Name_Raise : constant Name_Id := N + 612;
Name_Record : constant Name_Id := N + 613;
Name_Rem : constant Name_Id := N + 614;
Name_Renames : constant Name_Id := N + 615;
Name_Return : constant Name_Id := N + 616;
Name_Reverse : constant Name_Id := N + 617;
Name_Select : constant Name_Id := N + 618;
Name_Separate : constant Name_Id := N + 619;
Name_Some : constant Name_Id := N + 620;
Name_Subtype : constant Name_Id := N + 621;
Name_Task : constant Name_Id := N + 622;
Name_Terminate : constant Name_Id := N + 623;
Name_Then : constant Name_Id := N + 624;
Name_Type : constant Name_Id := N + 625;
Name_Use : constant Name_Id := N + 626;
Name_When : constant Name_Id := N + 627;
Name_While : constant Name_Id := N + 628;
Name_With : constant Name_Id := N + 629;
Name_Xor : constant Name_Id := N + 630;
-- Names of intrinsic subprograms
-- Note: Asm is missing from this list, since Asm is a legitimate
-- convention name. So is To_Address, which is a GNAT attribute.
First_Intrinsic_Name : constant Name_Id := N + 631;
Name_Divide : constant Name_Id := N + 631;
Name_Enclosing_Entity : constant Name_Id := N + 632;
Name_Exception_Information : constant Name_Id := N + 633;
Name_Exception_Message : constant Name_Id := N + 634;
Name_Exception_Name : constant Name_Id := N + 635;
Name_File : constant Name_Id := N + 636;
Name_Generic_Dispatching_Constructor : constant Name_Id := N + 637;
Name_Import_Address : constant Name_Id := N + 638;
Name_Import_Largest_Value : constant Name_Id := N + 639;
Name_Import_Value : constant Name_Id := N + 640;
Name_Is_Negative : constant Name_Id := N + 641;
Name_Line : constant Name_Id := N + 642;
Name_Rotate_Left : constant Name_Id := N + 643;
Name_Rotate_Right : constant Name_Id := N + 644;
Name_Shift_Left : constant Name_Id := N + 645;
Name_Shift_Right : constant Name_Id := N + 646;
Name_Shift_Right_Arithmetic : constant Name_Id := N + 647;
Name_Source_Location : constant Name_Id := N + 648;
Name_Unchecked_Conversion : constant Name_Id := N + 649;
Name_Unchecked_Deallocation : constant Name_Id := N + 650;
Name_To_Pointer : constant Name_Id := N + 651;
Last_Intrinsic_Name : constant Name_Id := N + 651;
-- Names used in processing intrinsic calls
Name_Free : constant Name_Id := N + 652;
-- Reserved words used only in Ada 95
First_95_Reserved_Word : constant Name_Id := N + 653;
Name_Abstract : constant Name_Id := N + 653;
Name_Aliased : constant Name_Id := N + 654;
Name_Protected : constant Name_Id := N + 655;
Name_Until : constant Name_Id := N + 656;
Name_Requeue : constant Name_Id := N + 657;
Name_Tagged : constant Name_Id := N + 658;
Last_95_Reserved_Word : constant Name_Id := N + 658;
subtype Ada_95_Reserved_Words is
Name_Id range First_95_Reserved_Word .. Last_95_Reserved_Word;
-- Miscellaneous names used in semantic checking
Name_Raise_Exception : constant Name_Id := N + 659;
-- Additional reserved words and identifiers used in GNAT Project Files
-- Note that Name_External is already previously declared
-- The names with the -- GPR annotation are only used in gprbuild
Name_Aggregate : constant Name_Id := N + 660;
Name_Archive_Builder : constant Name_Id := N + 661;
Name_Archive_Builder_Append_Option : constant Name_Id := N + 662;
Name_Archive_Indexer : constant Name_Id := N + 663;
Name_Archive_Suffix : constant Name_Id := N + 664;
Name_Binder : constant Name_Id := N + 665;
Name_Body_Suffix : constant Name_Id := N + 666;
Name_Builder : constant Name_Id := N + 667;
Name_Compiler : constant Name_Id := N + 668;
Name_Compiler_Command : constant Name_Id := N + 669; -- GPR
Name_Config_Body_File_Name : constant Name_Id := N + 670;
Name_Config_Body_File_Name_Index : constant Name_Id := N + 671;
Name_Config_Body_File_Name_Pattern : constant Name_Id := N + 672;
Name_Config_File_Switches : constant Name_Id := N + 673;
Name_Config_File_Unique : constant Name_Id := N + 674;
Name_Config_Spec_File_Name : constant Name_Id := N + 675;
Name_Config_Spec_File_Name_Index : constant Name_Id := N + 676;
Name_Config_Spec_File_Name_Pattern : constant Name_Id := N + 677;
Name_Configuration : constant Name_Id := N + 678;
Name_Cross_Reference : constant Name_Id := N + 679;
Name_Default_Language : constant Name_Id := N + 680;
Name_Default_Switches : constant Name_Id := N + 681;
Name_Dependency_Driver : constant Name_Id := N + 682;
Name_Dependency_Switches : constant Name_Id := N + 683;
Name_Driver : constant Name_Id := N + 684;
Name_Excluded_Source_Dirs : constant Name_Id := N + 685;
Name_Excluded_Source_Files : constant Name_Id := N + 686;
Name_Excluded_Source_List_File : constant Name_Id := N + 687;
Name_Exec_Dir : constant Name_Id := N + 688;
Name_Executable : constant Name_Id := N + 689;
Name_Executable_Suffix : constant Name_Id := N + 690;
Name_Extends : constant Name_Id := N + 691;
Name_External_As_List : constant Name_Id := N + 692;
Name_Externally_Built : constant Name_Id := N + 693;
Name_Finder : constant Name_Id := N + 694;
Name_Global_Compilation_Switches : constant Name_Id := N + 695;
Name_Global_Configuration_Pragmas : constant Name_Id := N + 696;
Name_Global_Config_File : constant Name_Id := N + 697; -- GPR
Name_Gnatls : constant Name_Id := N + 698;
Name_Gnatstub : constant Name_Id := N + 699;
Name_Gnu : constant Name_Id := N + 700;
Name_Ide : constant Name_Id := N + 701;
Name_Ignore_Source_Sub_Dirs : constant Name_Id := N + 702;
Name_Implementation : constant Name_Id := N + 703;
Name_Implementation_Exceptions : constant Name_Id := N + 704;
Name_Implementation_Suffix : constant Name_Id := N + 705;
Name_Include_Switches : constant Name_Id := N + 706;
Name_Include_Path : constant Name_Id := N + 707;
Name_Include_Path_File : constant Name_Id := N + 708;
Name_Inherit_Source_Path : constant Name_Id := N + 709;
Name_Languages : constant Name_Id := N + 710;
Name_Leading_Library_Options : constant Name_Id := N + 711;
Name_Leading_Required_Switches : constant Name_Id := N + 712;
Name_Leading_Switches : constant Name_Id := N + 713;
Name_Library : constant Name_Id := N + 714;
Name_Library_Ali_Dir : constant Name_Id := N + 715;
Name_Library_Auto_Init : constant Name_Id := N + 716;
Name_Library_Auto_Init_Supported : constant Name_Id := N + 717;
Name_Library_Builder : constant Name_Id := N + 718;
Name_Library_Dir : constant Name_Id := N + 719;
Name_Library_GCC : constant Name_Id := N + 720;
Name_Library_Install_Name_Option : constant Name_Id := N + 721;
Name_Library_Interface : constant Name_Id := N + 722;
Name_Library_Kind : constant Name_Id := N + 723;
Name_Library_Name : constant Name_Id := N + 724;
Name_Library_Major_Minor_Id_Supported : constant Name_Id := N + 725;
Name_Library_Options : constant Name_Id := N + 726;
Name_Library_Partial_Linker : constant Name_Id := N + 727;
Name_Library_Reference_Symbol_File : constant Name_Id := N + 728;
Name_Library_Src_Dir : constant Name_Id := N + 729;
Name_Library_Support : constant Name_Id := N + 730;
Name_Library_Symbol_File : constant Name_Id := N + 731;
Name_Library_Symbol_Policy : constant Name_Id := N + 732;
Name_Library_Version : constant Name_Id := N + 733;
Name_Library_Version_Switches : constant Name_Id := N + 734;
Name_Linker : constant Name_Id := N + 735;
Name_Linker_Executable_Option : constant Name_Id := N + 736;
Name_Linker_Lib_Dir_Option : constant Name_Id := N + 737;
Name_Linker_Lib_Name_Option : constant Name_Id := N + 738;
Name_Local_Config_File : constant Name_Id := N + 739; -- GPR
Name_Local_Configuration_Pragmas : constant Name_Id := N + 740;
Name_Locally_Removed_Files : constant Name_Id := N + 741;
Name_Map_File_Option : constant Name_Id := N + 742;
Name_Mapping_File_Switches : constant Name_Id := N + 743;
Name_Mapping_Spec_Suffix : constant Name_Id := N + 744;
Name_Mapping_Body_Suffix : constant Name_Id := N + 745;
Name_Max_Command_Line_Length : constant Name_Id := N + 746;
Name_Metrics : constant Name_Id := N + 747;
Name_Multi_Unit_Object_Separator : constant Name_Id := N + 748;
Name_Multi_Unit_Switches : constant Name_Id := N + 749;
Name_Naming : constant Name_Id := N + 750;
Name_None : constant Name_Id := N + 751;
Name_Object_File_Suffix : constant Name_Id := N + 752;
Name_Object_File_Switches : constant Name_Id := N + 753;
Name_Object_Generated : constant Name_Id := N + 754;
Name_Object_List : constant Name_Id := N + 755;
Name_Objects_Linked : constant Name_Id := N + 756;
Name_Objects_Path : constant Name_Id := N + 757;
Name_Objects_Path_File : constant Name_Id := N + 758;
Name_Object_Dir : constant Name_Id := N + 759;
Name_Option_List : constant Name_Id := N + 760;
Name_Path_Syntax : constant Name_Id := N + 761;
Name_Pic_Option : constant Name_Id := N + 762;
Name_Pretty_Printer : constant Name_Id := N + 763;
Name_Prefix : constant Name_Id := N + 764;
Name_Project : constant Name_Id := N + 765;
Name_Project_Dir : constant Name_Id := N + 766;
Name_Project_Files : constant Name_Id := N + 767;
Name_Project_Path : constant Name_Id := N + 768;
Name_Response_File_Format : constant Name_Id := N + 769;
Name_Response_File_Switches : constant Name_Id := N + 770;
Name_Roots : constant Name_Id := N + 771; -- GPR
Name_Required_Switches : constant Name_Id := N + 772;
Name_Run_Path_Option : constant Name_Id := N + 773;
Name_Run_Path_Origin : constant Name_Id := N + 774;
Name_Separate_Run_Path_Options : constant Name_Id := N + 775;
Name_Shared_Library_Minimum_Switches : constant Name_Id := N + 776;
Name_Shared_Library_Prefix : constant Name_Id := N + 777;
Name_Shared_Library_Suffix : constant Name_Id := N + 778;
Name_Separate_Suffix : constant Name_Id := N + 779;
Name_Source_Dirs : constant Name_Id := N + 780;
Name_Source_Files : constant Name_Id := N + 781;
Name_Source_List_File : constant Name_Id := N + 782;
Name_Spec : constant Name_Id := N + 783;
Name_Spec_Suffix : constant Name_Id := N + 784;
Name_Specification : constant Name_Id := N + 785;
Name_Specification_Exceptions : constant Name_Id := N + 786;
Name_Specification_Suffix : constant Name_Id := N + 787;
Name_Stack : constant Name_Id := N + 788;
Name_Switches : constant Name_Id := N + 789;
Name_Symbolic_Link_Supported : constant Name_Id := N + 790;
Name_Synchronize : constant Name_Id := N + 791;
Name_Toolchain_Description : constant Name_Id := N + 792;
Name_Toolchain_Version : constant Name_Id := N + 793;
Name_Trailing_Required_Switches : constant Name_Id := N + 794;
Name_Runtime_Library_Dir : constant Name_Id := N + 795;
Name_Runtime_Source_Dir : constant Name_Id := N + 796;
-- Other miscellaneous names used in front end
Name_Unaligned_Valid : constant Name_Id := N + 797;
-- Names used to implement iterators over predefined containers
Name_Cursor : constant Name_Id := N + 798;
Name_Element : constant Name_Id := N + 799;
Name_Element_Type : constant Name_Id := N + 800;
Name_No_Element : constant Name_Id := N + 801;
Name_Previous : constant Name_Id := N + 802;
-- Ada 05 reserved words
First_2005_Reserved_Word : constant Name_Id := N + 803;
Name_Interface : constant Name_Id := N + 803;
Name_Overriding : constant Name_Id := N + 804;
Name_Synchronized : constant Name_Id := N + 805;
Last_2005_Reserved_Word : constant Name_Id := N + 805;
subtype Ada_2005_Reserved_Words is
Name_Id range First_2005_Reserved_Word .. Last_2005_Reserved_Word;
-- Mark last defined name for consistency check in Snames body
Last_Predefined_Name : constant Name_Id := N + 805;
---------------------------------------
-- Subtypes Defining Name Categories --
---------------------------------------
subtype Any_Operator_Name is Name_Id range
First_Operator_Name .. Last_Operator_Name;
subtype Configuration_Pragma_Names is Name_Id range
First_Pragma_Name .. Last_Configuration_Pragma_Name;
------------------------------
-- Attribute ID Definitions --
------------------------------
type Attribute_Id is (
Attribute_Abort_Signal,
Attribute_Access,
Attribute_Address,
Attribute_Address_Size,
Attribute_Aft,
Attribute_Alignment,
Attribute_Asm_Input,
Attribute_Asm_Output,
Attribute_AST_Entry,
Attribute_Bit,
Attribute_Bit_Order,
Attribute_Bit_Position,
Attribute_Body_Version,
Attribute_Callable,
Attribute_Caller,
Attribute_Code_Address,
Attribute_Compiler_Version,
Attribute_Component_Size,
Attribute_Compose,
Attribute_Constrained,
Attribute_Count,
Attribute_Default_Bit_Order,
Attribute_Definite,
Attribute_Delta,
Attribute_Denorm,
Attribute_Digits,
Attribute_Elaborated,
Attribute_Emax,
Attribute_Enabled,
Attribute_Enum_Rep,
Attribute_Enum_Val,
Attribute_Epsilon,
Attribute_Exponent,
Attribute_External_Tag,
Attribute_Fast_Math,
Attribute_First,
Attribute_First_Bit,
Attribute_Fixed_Value,
Attribute_Fore,
Attribute_Has_Access_Values,
Attribute_Has_Discriminants,
Attribute_Has_Tagged_Values,
Attribute_Identity,
Attribute_Img,
Attribute_Integer_Value,
Attribute_Invalid_Value,
Attribute_Large,
Attribute_Last,
Attribute_Last_Bit,
Attribute_Leading_Part,
Attribute_Length,
Attribute_Machine_Emax,
Attribute_Machine_Emin,
Attribute_Machine_Mantissa,
Attribute_Machine_Overflows,
Attribute_Machine_Radix,
Attribute_Machine_Rounding,
Attribute_Machine_Rounds,
Attribute_Machine_Size,
Attribute_Mantissa,
Attribute_Max_Alignment_For_Allocation,
Attribute_Max_Size_In_Storage_Elements,
Attribute_Maximum_Alignment,
Attribute_Mechanism_Code,
Attribute_Mod,
Attribute_Model_Emin,
Attribute_Model_Epsilon,
Attribute_Model_Mantissa,
Attribute_Model_Small,
Attribute_Modulus,
Attribute_Null_Parameter,
Attribute_Object_Size,
Attribute_Old,
Attribute_Partition_ID,
Attribute_Passed_By_Reference,
Attribute_Pool_Address,
Attribute_Pos,
Attribute_Position,
Attribute_Priority,
Attribute_Range,
Attribute_Range_Length,
Attribute_Ref,
Attribute_Result,
Attribute_Round,
Attribute_Safe_Emax,
Attribute_Safe_First,
Attribute_Safe_Large,
Attribute_Safe_Last,
Attribute_Safe_Small,
Attribute_Scale,
Attribute_Scaling,
Attribute_Signed_Zeros,
Attribute_Size,
Attribute_Small,
Attribute_Storage_Size,
Attribute_Storage_Unit,
Attribute_Stream_Size,
Attribute_Tag,
Attribute_Target_Name,
Attribute_Terminated,
Attribute_To_Address,
Attribute_Type_Class,
Attribute_Type_Key,
Attribute_UET_Address,
Attribute_Unbiased_Rounding,
Attribute_Unchecked_Access,
Attribute_Unconstrained_Array,
Attribute_Universal_Literal_String,
Attribute_Unrestricted_Access,
Attribute_VADS_Size,
Attribute_Val,
Attribute_Valid,
Attribute_Value_Size,
Attribute_Version,
Attribute_Wchar_T_Size,
Attribute_Wide_Wide_Width,
Attribute_Wide_Width,
Attribute_Width,
Attribute_Word_Size,
-- Attributes designating renamable functions
Attribute_Adjacent,
Attribute_Ceiling,
Attribute_Copy_Sign,
Attribute_Floor,
Attribute_Fraction,
Attribute_From_Any,
Attribute_Image,
Attribute_Input,
Attribute_Machine,
Attribute_Max,
Attribute_Min,
Attribute_Model,
Attribute_Pred,
Attribute_Remainder,
Attribute_Rounding,
Attribute_Succ,
Attribute_To_Any,
Attribute_Truncation,
Attribute_TypeCode,
Attribute_Value,
Attribute_Wide_Image,
Attribute_Wide_Wide_Image,
Attribute_Wide_Value,
Attribute_Wide_Wide_Value,
-- Attributes designating procedures
Attribute_Output,
Attribute_Read,
Attribute_Write,
-- Entity attributes (includes type attributes)
Attribute_Elab_Body,
Attribute_Elab_Spec,
Attribute_Storage_Pool,
-- Type attributes
Attribute_Base,
Attribute_Class,
Attribute_Stub_Type);
type Attribute_Class_Array is array (Attribute_Id) of Boolean;
-- Type used to build attribute classification flag arrays
------------------------------------
-- Convention Name ID Definitions --
------------------------------------
type Convention_Id is (
-- The native-to-Ada (non-foreign) conventions come first. These include
-- the ones defined in the RM, plus Stubbed.
Convention_Ada,
Convention_Intrinsic,
Convention_Entry,
Convention_Protected,
Convention_Stubbed,
-- The remaining conventions are foreign language conventions
Convention_Assembler, -- also Asm, Assembly
Convention_C, -- also Default, External
Convention_CIL,
Convention_COBOL,
Convention_CPP,
Convention_Fortran,
Convention_Java,
Convention_Stdcall); -- also DLL, Win32
-- Note: Convention C_Pass_By_Copy is allowed only for record
-- types (where it is treated like C except that the appropriate
-- flag is set in the record type). Recognizing this convention
-- is specially handled in Sem_Prag.
for Convention_Id'Size use 8;
-- Plenty of space for expansion
subtype Foreign_Convention is
Convention_Id range Convention_Assembler .. Convention_Id'Last;
-----------------------------------
-- Locking Policy ID Definitions --
-----------------------------------
type Locking_Policy_Id is (
Locking_Policy_Inheritance_Locking,
Locking_Policy_Ceiling_Locking);
---------------------------
-- Pragma ID Definitions --
---------------------------
type Pragma_Id is (
-- Configuration pragmas
-- Note: This list is in the GNAT users guide, so be sure that if any
-- additions or deletions are made to the following list, they are
-- properly reflected in the users guide.
Pragma_Ada_83,
Pragma_Ada_95,
Pragma_Ada_05,
Pragma_Ada_2005,
Pragma_Ada_12,
Pragma_Ada_2012,
Pragma_Assertion_Policy,
Pragma_Assume_No_Invalid_Values,
Pragma_C_Pass_By_Copy,
Pragma_Check_Name,
Pragma_Check_Policy,
Pragma_Compile_Time_Error,
Pragma_Compile_Time_Warning,
Pragma_Compiler_Unit,
Pragma_Component_Alignment,
Pragma_Convention_Identifier,
Pragma_Debug_Policy,
Pragma_Detect_Blocking,
Pragma_Default_Storage_Pool,
Pragma_Discard_Names,
Pragma_Elaboration_Checks,
Pragma_Eliminate,
Pragma_Extend_System,
Pragma_Extensions_Allowed,
Pragma_External_Name_Casing,
Pragma_Favor_Top_Level,
Pragma_Float_Representation,
Pragma_Implicit_Packing,
Pragma_Initialize_Scalars,
Pragma_Interrupt_State,
Pragma_License,
Pragma_Locking_Policy,
Pragma_Long_Float,
Pragma_No_Run_Time,
Pragma_No_Strict_Aliasing,
Pragma_Normalize_Scalars,
Pragma_Optimize_Alignment,
Pragma_Persistent_BSS,
Pragma_Polling,
Pragma_Priority_Specific_Dispatching,
Pragma_Profile,
Pragma_Profile_Warnings,
Pragma_Propagate_Exceptions,
Pragma_Queuing_Policy,
Pragma_Ravenscar,
Pragma_Restricted_Run_Time,
Pragma_Restrictions,
Pragma_Restriction_Warnings,
Pragma_Reviewable,
Pragma_Short_Circuit_And_Or,
Pragma_Short_Descriptors,
Pragma_Source_File_Name,
Pragma_Source_File_Name_Project,
Pragma_Style_Checks,
Pragma_Suppress,
Pragma_Suppress_Exception_Locations,
Pragma_Task_Dispatching_Policy,
Pragma_Universal_Data,
Pragma_Unsuppress,
Pragma_Use_VADS_Size,
Pragma_Validity_Checks,
Pragma_Warnings,
Pragma_Wide_Character_Encoding,
-- Remaining (non-configuration) pragmas
Pragma_Abort_Defer,
Pragma_All_Calls_Remote,
Pragma_Annotate,
Pragma_Assert,
Pragma_Asynchronous,
Pragma_Atomic,
Pragma_Atomic_Components,
Pragma_Attach_Handler,
Pragma_Check,
Pragma_CIL_Constructor,
Pragma_Comment,
Pragma_Common_Object,
Pragma_Complete_Representation,
Pragma_Complex_Representation,
Pragma_Controlled,
Pragma_Convention,
Pragma_CPP_Class,
Pragma_CPP_Constructor,
Pragma_CPP_Virtual,
Pragma_CPP_Vtable,
Pragma_CPU,
Pragma_Debug,
Pragma_Dimension,
Pragma_Elaborate,
Pragma_Elaborate_All,
Pragma_Elaborate_Body,
Pragma_Export,
Pragma_Export_Exception,
Pragma_Export_Function,
Pragma_Export_Object,
Pragma_Export_Procedure,
Pragma_Export_Value,
Pragma_Export_Valued_Procedure,
Pragma_External,
Pragma_Finalize_Storage_Only,
Pragma_Ident,
Pragma_Implemented,
Pragma_Import,
Pragma_Import_Exception,
Pragma_Import_Function,
Pragma_Import_Object,
Pragma_Import_Procedure,
Pragma_Import_Valued_Procedure,
Pragma_Independent,
Pragma_Independent_Components,
Pragma_Inline,
Pragma_Inline_Always,
Pragma_Inline_Generic,
Pragma_Inspection_Point,
Pragma_Interface_Name,
Pragma_Interrupt_Handler,
Pragma_Interrupt_Priority,
Pragma_Invariant,
Pragma_Java_Constructor,
Pragma_Java_Interface,
Pragma_Keep_Names,
Pragma_Link_With,
Pragma_Linker_Alias,
Pragma_Linker_Constructor,
Pragma_Linker_Destructor,
Pragma_Linker_Options,
Pragma_Linker_Section,
Pragma_List,
Pragma_Machine_Attribute,
Pragma_Main,
Pragma_Main_Storage,
Pragma_Memory_Size,
Pragma_No_Body,
Pragma_No_Return,
Pragma_Obsolescent,
Pragma_Optimize,
Pragma_Ordered,
Pragma_Pack,
Pragma_Page,
Pragma_Passive,
Pragma_Postcondition,
Pragma_Precondition,
Pragma_Predicate,
Pragma_Preelaborable_Initialization,
Pragma_Preelaborate,
Pragma_Preelaborate_05,
Pragma_Psect_Object,
Pragma_Pure,
Pragma_Pure_05,
Pragma_Pure_Function,
Pragma_Relative_Deadline,
Pragma_Remote_Call_Interface,
Pragma_Remote_Types,
Pragma_Share_Generic,
Pragma_Shared,
Pragma_Shared_Passive,
Pragma_Source_Reference,
Pragma_Static_Elaboration_Desired,
Pragma_Stream_Convert,
Pragma_Subtitle,
Pragma_Suppress_All,
Pragma_Suppress_Debug_Info,
Pragma_Suppress_Initialization,
Pragma_System_Name,
Pragma_Task_Info,
Pragma_Task_Name,
Pragma_Task_Storage,
Pragma_Thread_Local_Storage,
Pragma_Time_Slice,
Pragma_Title,
Pragma_Unchecked_Union,
Pragma_Unimplemented_Unit,
Pragma_Universal_Aliasing,
Pragma_Unmodified,
Pragma_Unreferenced,
Pragma_Unreferenced_Objects,
Pragma_Unreserve_All_Interrupts,
Pragma_Volatile,
Pragma_Volatile_Components,
Pragma_Weak_External,
-- The following pragmas are on their own, out of order, because of the
-- special processing required to deal with the fact that their names
-- match existing attribute names.
Pragma_AST_Entry,
Pragma_Fast_Math,
Pragma_Interface,
Pragma_Priority,
Pragma_Storage_Size,
Pragma_Storage_Unit,
-- The value to represent an unknown or unrecognized pragma
Unknown_Pragma);
-----------------------------------
-- Queuing Policy ID definitions --
-----------------------------------
type Queuing_Policy_Id is (
Queuing_Policy_FIFO_Queuing,
Queuing_Policy_Priority_Queuing);
--------------------------------------------
-- Task Dispatching Policy ID definitions --
--------------------------------------------
type Task_Dispatching_Policy_Id is (
Task_Dispatching_FIFO_Within_Priorities);
-- Id values used to identify task dispatching policies
-----------------
-- Subprograms --
-----------------
procedure Initialize;
-- Called to initialize the preset names in the names table
function Is_Attribute_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of a recognized attribute
function Is_Entity_Attribute_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of a recognized entity attribute,
-- i.e. an attribute reference that returns an entity.
function Is_Procedure_Attribute_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of a recognized attribute that
-- designates a procedure (and can therefore appear as a statement).
function Is_Function_Attribute_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of a recognized attribute
-- that designates a renameable function, and can therefore appear in
-- a renaming statement. Note that not all attributes designating
-- functions are renamable, in particular, those returning a universal
-- value cannot be renamed.
function Is_Type_Attribute_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of a recognized type attribute,
-- i.e. an attribute reference that returns a type
function Is_Convention_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of one of the recognized
-- language conventions, as required by pragma Convention, Import,
-- Export, Interface. Returns True if so. Also returns True for a
-- name that has been specified by a Convention_Identifier pragma.
-- If neither case holds, returns False.
function Is_Keyword_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is one of the (reserved) keyword names. This
-- includes all the keywords defined in the Ada standard (taking into
-- effect the Ada version). It also includes additional keywords in
-- contexts where additional keywords have been added. For example, in the
-- context of parsing project files, keywords such as PROJECT are included.
function Is_Locking_Policy_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of a recognized locking policy
function Is_Operator_Symbol_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of an operator symbol
function Is_Pragma_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of a recognized pragma. Note that
-- pragmas AST_Entry, Fast_Math, Priority, Storage_Size, and Storage_Unit
-- are recognized as pragmas by this function even though their names are
-- separate from the other pragma names. For this reason, clients should
-- always use this function, rather than do range tests on Name_Id values.
function Is_Configuration_Pragma_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of a recognized configuration
-- pragma. Note that pragma Fast_Math is recognized as a configuration
-- pragma by this function even though its name is separate from other
-- configuration pragma names. For this reason, clients should always
-- use this function, rather than do range tests on Name_Id values.
function Is_Queuing_Policy_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of a recognized queuing policy
function Is_Task_Dispatching_Policy_Name (N : Name_Id) return Boolean;
-- Test to see if the name N is the name of a recognized task
-- dispatching policy.
function Get_Attribute_Id (N : Name_Id) return Attribute_Id;
-- Returns Id of attribute corresponding to given name. It is an error to
-- call this function with a name that is not the name of a attribute.
function Get_Convention_Id (N : Name_Id) return Convention_Id;
-- Returns Id of language convention corresponding to given name. It is
-- an error to call this function with a name that is not the name of a
-- convention, or one that has been previously recorded using a call to
-- Record_Convention_Identifier.
function Get_Convention_Name (C : Convention_Id) return Name_Id;
-- Returns the name of language convention corresponding to given
-- convention id.
function Get_Locking_Policy_Id (N : Name_Id) return Locking_Policy_Id;
-- Returns Id of locking policy corresponding to given name. It is an error
-- to call this function with a name that is not the name of a check.
function Get_Pragma_Id (N : Name_Id) return Pragma_Id;
-- Returns Id of pragma corresponding to given name. Returns Unknown_Pragma
-- if N is not a name of a known (Ada defined or GNAT-specific) pragma.
-- Note that the function also works correctly for names of pragmas that
-- are not included in the main list of pragma Names (AST_Entry, Priority,
-- Storage_Size, and Storage_Unit (e.g. Name_Storage_Size returns
-- Pragma_Storage_Size).
function Get_Queuing_Policy_Id (N : Name_Id) return Queuing_Policy_Id;
-- Returns Id of queuing policy corresponding to given name. It is an error
-- to call this function with a name that is not the name of a check.
function Get_Task_Dispatching_Policy_Id
(N : Name_Id) return Task_Dispatching_Policy_Id;
-- Returns Id of task dispatching policy corresponding to given name. It
-- is an error to call this function with a name that is not the name of
-- a defined check.
procedure Record_Convention_Identifier
(Id : Name_Id;
Convention : Convention_Id);
-- A call to this procedure, resulting from an occurrence of a pragma
-- Convention_Identifier, records that from now on an occurrence of Id
-- will be recognized as a name for the specified convention.
private
pragma Inline (Is_Attribute_Name);
pragma Inline (Is_Entity_Attribute_Name);
pragma Inline (Is_Type_Attribute_Name);
pragma Inline (Is_Locking_Policy_Name);
pragma Inline (Is_Operator_Symbol_Name);
pragma Inline (Is_Queuing_Policy_Name);
pragma Inline (Is_Pragma_Name);
pragma Inline (Is_Task_Dispatching_Policy_Name);
end Snames;
| 54.052193 | 79 | 0.569585 |
a03c5275c3cf1a4b8413a13066c4fbdcefb33da7 | 487 | adb | Ada | ejercicios2/eliminar_tercer_elemento_ordenada.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | ejercicios2/eliminar_tercer_elemento_ordenada.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | ejercicios2/eliminar_tercer_elemento_ordenada.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | with vectores; use vectores;
procedure eliminar_tercer_elemento_ordenada (V: in out Vector_de_enteros) is
-- pre: los elementos de la lista estan ordenados
-- post: si hay tres o mas elementos, el tercer elemento quedara eliminado
-- y la lista mantendra el orden
Inicio: Integer;
begin
Inicio:=V'First+2;
if V'Length >= 3 then
for I in Inicio..V'Last-1 loop
V(I):=V(I+1);
end loop;
V(V'Last):=-1;
end if;
end eliminar_tercer_elemento_ordenada;
| 17.392857 | 77 | 0.691992 |
03858d35aca1e821062e8bffbc8b1ca1026f0dc1 | 1,087 | ads | Ada | source/a-enumer.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/a-enumer.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/a-enumer.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- extended unit
package Ada.Enumeration is
-- Interfaces.C.Pointers-like utilities for enumeration types.
pragma Pure;
generic
type Enum is (<>);
type Distance is range <>;
package Arithmetic is
function "+" (Left : Enum; Right : Distance) return Enum
with Convention => Intrinsic;
function "+" (Left : Distance; Right : Enum) return Enum
with Convention => Intrinsic;
function "-" (Left : Enum; Right : Distance) return Enum
with Convention => Intrinsic;
function "-" (Left, Right : Enum) return Distance
with Convention => Intrinsic;
pragma Pure_Function ("+");
pragma Pure_Function ("-");
pragma Inline_Always ("+");
pragma Inline_Always ("-");
procedure Increment (Ref : in out Enum)
with Convention => Intrinsic;
procedure Decrement (Ref : in out Enum)
with Convention => Intrinsic;
pragma Inline_Always (Increment);
pragma Inline_Always (Decrement);
end Arithmetic;
end Ada.Enumeration;
| 29.378378 | 66 | 0.632935 |
3886da80bc5cf544580c61544e47fd70c4476c04 | 2,046 | ads | Ada | http-request.ads | zorodc/ada-http1 | 7ff6ccd5add273fc27edc128c5a2447c64687a96 | [
"0BSD"
] | null | null | null | http-request.ads | zorodc/ada-http1 | 7ff6ccd5add273fc27edc128c5a2447c64687a96 | [
"0BSD"
] | null | null | null | http-request.ads | zorodc/ada-http1 | 7ff6ccd5add273fc27edc128c5a2447c64687a96 | [
"0BSD"
] | null | null | null | package HTTP.Request with SPARK_Mode => On
is
package Sliced is
type Header is record
Key : Indexes;
Val : Indexes;
end record;
subtype Header_Index is Natural range 1 .. 20;
type Header_List is array (Header_Index) of Header;
type Request_Line is record
Kind : Indexes; -- Get, Post, ect.
Path : Indexes;
Vers : Indexes;
end record;
type Request is record
Line : Request_Line;
Headers : Header_List;
Cnt : Natural := 0;
end record;
end Sliced;
type As_Stored is null record; -- TODO;
type As_Sliced is new Sliced.Request;
type Parse_State is private;
-- Note: Parse is a separate nested pacakge.
package Parse is
type Context is private;
procedure One_Char (Ctx : in out Context; Char: in Character);
procedure Str_Read (Ctx : in out Context; Str : in String; Cnt: out Natural);
procedure Debug (Ctx : in Context; Str : in String);
private
type Context is record
State : Parse_State;
Split : As_Sliced; -- TODO: Better names for ``Count''
Count : Positive := 1; -- Position of incoming char (1st, 2nd, ..)
end record;
end Parse;
private
type Parse_State is (
-- Request Header --
Kind, -- Kind: The request method type; Get, Post, ect.
Path,
Pref, -- HTTP version preferred by client.
Line, -- Waiting for the rest of the carriage return sequence.
Head, -- Gathering the name of header (Part preceeded by colon ':').
SSep, -- Remainder of separator, following colon; (a single space).
HBod, -- Body of header. (Following the colon and space);
-- Final CRLF; HTTP Requests terminated by an additional CRLF sequence;
-- These states represent this final evenuality.
Term, -- Remainder of terminal CRLF sequence (the LF ('\n') part);
Done, -- Done reading all the header sections!
Overread, -- A character was fed after all header sections done with!
Err -- Error state; Signals that an error occurred.
) with Default_Value => Kind;
end HTTP.Request;
| 31.96875 | 80 | 0.667155 |
4bac3211c91ba52dc1bde58ca6c85867b9e9f113 | 2,555 | ads | Ada | src/api/agate-api-static_semaphore.ads | Fabien-Chouteau/AGATE | cd8dbc54c1c70379c833e7cd710e2326ad6e9a91 | [
"BSD-3-Clause"
] | 3 | 2017-12-23T10:25:07.000Z | 2021-06-09T13:47:19.000Z | src/api/agate-api-static_semaphore.ads | Fabien-Chouteau/AGATE | cd8dbc54c1c70379c833e7cd710e2326ad6e9a91 | [
"BSD-3-Clause"
] | null | null | null | src/api/agate-api-static_semaphore.ads | Fabien-Chouteau/AGATE | cd8dbc54c1c70379c833e7cd710e2326ad6e9a91 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017-2018, Fabien Chouteau --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
generic
initial_Count : Semaphore_Count := 0;
Name : String;
package AGATE.API.Static_Semaphore is
function ID return Semaphore_ID;
end AGATE.API.Static_Semaphore;
| 63.875 | 78 | 0.522896 |
4b7c52d5f481fbfe4112e2997db8845cf88f471c | 31,050 | adb | Ada | 3-mid/opengl/source/lean/io/opengl-io.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/lean/io/opengl-io.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/lean/io/opengl-io.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
openGL.Images,
openGL.Viewport,
openGL.Tasks,
openGL.Errors,
GID,
GL.Binding,
GL.safe,
GL.Pointers,
ada.unchecked_Conversion,
ada.Calendar,
ada.Characters.handling,
System;
package body openGL.IO
is
use ada.Characters.handling,
ada.Streams.Stream_IO;
use type Index_t;
--------
-- Face
--
function Vertices_of (Self : in Face) return Vertices
is
begin
case Self.Kind
is
when Triangle => return Self.Tri;
when Quad => return Self.Quad;
when Polygon => return Self.Poly.all;
end case;
end Vertices_of;
procedure set_Vertex_in (Self : in out Face; Which : in long_Index_t;
To : in Vertex)
is
begin
case Self.Kind
is
when Triangle => Self.Tri (Which) := To;
when Quad => Self.Quad (Which) := To;
when Polygon => Self.Poly (Which) := To;
end case;
end set_Vertex_in;
procedure destroy (Self : in out Face)
is
procedure free is new ada.unchecked_Deallocation (Vertices, Vertices_view);
begin
if Self.Kind = Polygon
then
free (Self.Poly);
end if;
end destroy;
-------------
-- Operations
--
function current_Frame return Image
is
use GL,
GL.Binding,
GL.Pointers,
Texture;
Extent : constant Extent_2d := openGL.Viewport.Extent;
Frame : Image (1 .. Index_t (Extent.Width),
1 .. Index_t (Extent.Height));
begin
glReadPixels (0, 0,
GLsizei (Extent.Width),
GLsizei (Extent.Height),
to_GL (Format' (Texture.RGB)),
GL_UNSIGNED_BYTE,
to_GLvoid_access (Frame (1, 1).Red'Access));
return Frame;
end current_Frame;
---------
-- Forge
--
function to_height_Map (image_Filename : in asset_Name;
Scale : in Real := 1.0) return height_Map_view
is
File : Ada.Streams.Stream_IO.File_Type;
Image : GID.Image_Descriptor;
up_Name : constant String := To_Upper (to_String (image_Filename));
next_Frame : ada.Calendar.Day_Duration := 0.0;
begin
open (File, in_File, to_String (image_Filename));
GID.load_Image_Header (Image,
Stream (File).all,
try_tga => image_Filename'Length >= 4
and then up_Name (up_Name'Last - 3 .. up_Name'Last) = ".TGA");
declare
image_Width : constant Positive := GID.Pixel_Width (Image);
image_Height : constant Positive := GID.Pixel_Height (Image);
the_Heights : constant access height_Map := new height_Map' (1 .. Index_t (image_height) =>
(1 .. Index_t (image_width) => <>));
procedure load_raw_Image
is
subtype primary_Color_range is GL.GLubyte;
Row, Col : Index_t;
procedure set_X_Y (x, y : Natural)
is
begin
Col := Index_t (X + 1);
Row := Index_t (Y + 1);
end Set_X_Y;
procedure put_Pixel (Red, Green, Blue : primary_Color_range;
Alpha : primary_Color_range)
is
pragma Warnings (Off, alpha); -- Alpha is just ignored.
use type GL.GLubyte, Real;
begin
the_Heights (Row, Col) := (Real (Red) + Real (Green) + Real (Blue))
/ (3.0 * 255.0)
* Scale;
if Col = Index_t (image_Width)
then
Row := Row + 1;
Col := 1;
else
Col := Col + 1;
end if;
-- ^ GID requires us to look to next pixel on the right for next time.
end put_Pixel;
procedure Feedback (Percents : Natural) is null;
procedure load_Image is new GID.load_Image_contents (primary_Color_range,
set_X_Y,
put_Pixel,
Feedback,
GID.fast);
begin
load_Image (Image, next_Frame);
end load_Raw_image;
begin
load_raw_Image;
close (File);
return the_Heights.all'unchecked_Access;
end;
end to_height_Map;
function fetch_Image (Stream : in ada.Streams.Stream_IO.Stream_access;
try_TGA : in Boolean) return Image
is
begin
return Images.fetch_Image (Stream, try_TGA);
end fetch_Image;
function to_Image (image_Filename : in asset_Name) return Image
is
File : ada.Streams.Stream_IO.File_type;
up_Name : constant String := to_Upper (to_String (image_Filename));
begin
open (File, In_File, to_String (image_Filename));
declare
the_Image : constant Image
:= fetch_Image (Stream (File),
try_TGA => image_Filename'Length >= 4
and then up_Name (up_Name'Last - 3 .. up_Name'Last) = ".TGA");
begin
close (File);
return the_Image;
end;
end to_Image;
function to_lucid_Image (image_Filename : in asset_Name) return lucid_Image
is
Unused : aliased Boolean;
begin
return to_lucid_Image (image_Filename, Unused'Access);
end to_lucid_Image;
function to_lucid_Image (image_Filename : in asset_Name;
is_Lucid : access Boolean) return lucid_Image
is
File : ada.Streams.Stream_IO.File_type;
the_Image : GID.Image_Descriptor;
up_Name : constant String := to_Upper (to_String (image_Filename));
next_Frame : ada.Calendar.Day_Duration := 0.0;
begin
open (File, in_File, to_String (image_Filename));
GID.load_Image_Header (the_Image,
Stream (File).all,
try_TGA => image_Filename'Length >= 4
and then up_Name (up_Name'Last - 3 .. up_Name'Last) = ".TGA");
declare
image_Width : constant Positive := GID.Pixel_Width (the_Image);
image_Height : constant Positive := GID.Pixel_Height (the_Image);
Frame : lucid_Image (1 .. Index_t (image_Height),
1 .. Index_t (image_Width));
procedure load_raw_Image
is
subtype primary_Color_range is GL.GLubyte;
Row, Col : Index_t;
procedure set_X_Y (X, Y : Natural)
is
begin
Col := Index_t (X + 1);
Row := Index_t (Y + 1);
end set_X_Y;
procedure put_Pixel (Red, Green, Blue : primary_Color_range;
Alpha : primary_Color_range)
is
use type GL.GLubyte, Real;
begin
Frame (Row, Col) := ((Red, Green, Blue), Alpha);
if Col = Index_t (image_Width)
then -- GID requires us to look to next pixel on the right for next time.
Row := Row + 1;
Col := 1;
else
Col := Col + 1;
end if;
if Alpha /= Opaque
then
is_Lucid.all := True;
end if;
end put_Pixel;
procedure Feedback (Percents : Natural) is null;
procedure load_Image is new GID.load_Image_contents (primary_Color_range,
set_X_Y,
put_Pixel,
Feedback,
GID.fast);
begin
load_Image (the_Image, next_Frame);
end Load_raw_image;
begin
is_Lucid.all := False;
load_raw_Image;
close (File);
return Frame;
end;
end to_lucid_Image;
function to_Texture (image_Filename : in asset_Name) return Texture.Object
is
use Texture;
is_Lucid : aliased Boolean;
the_lucid_Image : constant lucid_Image := to_lucid_Image (image_Filename, is_Lucid'Access);
the_Texture : Texture.Object := Forge.to_Texture (Texture.Dimensions' (the_lucid_Image'Length (2),
the_lucid_Image'Length (1)));
begin
if is_Lucid
then
set_Image (the_Texture, the_lucid_Image);
else
declare
the_opaque_Image : constant Image := to_Image (the_lucid_Image);
begin
set_Image (the_Texture, the_opaque_Image);
end;
end if;
return the_Texture;
end to_Texture;
procedure destroy (Self : in out Model)
is
procedure free is new ada.unchecked_Deallocation (bone_Weights, bone_Weights_view);
procedure free is new ada.unchecked_Deallocation (bone_Weights_array, bone_Weights_array_view);
begin
free (Self.Sites);
free (Self.Coords);
free (Self.Normals);
if Self.Weights /= null
then
for Each in Self.Weights'Range
loop
free (Self.Weights (Each));
end loop;
free (Self.Weights);
end if;
for Each in Self.Faces'Range
loop
destroy (Self.Faces (Each));
end loop;
free (Self.Faces);
end destroy;
--------------------------------
--- Screenshot and Video Capture
--
type U8 is mod 2 ** 8; for U8 'Size use 8;
type U16 is mod 2 ** 16; for U16'Size use 16;
type U32 is mod 2 ** 32; for U32'Size use 32;
type I32 is range -2 ** 31 .. 2 ** 31 - 1;
for I32'Size use 32;
generic
type Number is mod <>;
S : Stream_Access;
procedure write_Intel_x86_Number (N : in Number);
procedure write_Intel_x86_Number (N : in Number)
is
M : Number := N;
Bytes : constant Integer := Number'Size / 8;
begin
for i in 1 .. bytes
loop
U8'write (S, U8 (M mod 256));
M := M / 256;
end loop;
end write_Intel_x86_Number;
procedure write_raw_BGR_Frame (Stream : Stream_Access;
Width, Height : Natural)
is
use GL,
GL.Binding,
openGL.Texture;
-- 4-byte padding for .bmp/.avi formats is the same as GL's default
-- padding: see glPixelStore, GL_[UN]PACK_ALIGNMENT = 4 as initial value.
-- http://www.openGL.org/sdk/docs/man/xhtml/glPixelStore.xml
--
padded_row_Size : constant Positive := 4 * Integer (Float'Ceiling (Float (Width) * 3.0 / 4.0));
-- (in bytes)
type temp_Bitmap_type is array (Natural range <>) of aliased gl.GLUbyte;
PicData: temp_Bitmap_type (0 .. (padded_row_Size + 4) * (Height + 4) - 1);
-- No dynamic allocation needed!
-- The "+4" are there to avoid parity address problems when GL writes to the buffer.
type Loc_pointer is new gl.safe.GLvoid_Pointer;
function convert is new ada.unchecked_Conversion (System.Address, Loc_pointer);
-- This method is functionally identical as GNAT's Unrestricted_Access
-- but has no type safety (cf GNAT Docs).
pragma no_strict_Aliasing (Loc_pointer); -- Recommended by GNAT 2005+.
pPicData : Loc_pointer;
data_Max : constant Integer := padded_row_Size * Height - 1;
-- Workaround for the severe xxx'Read xxx'Write performance
-- problems in the GNAT and ObjectAda compilers (as in 2009)
-- This is possible if and only if Byte = Stream_Element and
-- arrays types are both packed the same way.
--
type Byte_array is array (Integer range <>) of aliased GLUByte;
subtype Size_Test_a is Byte_array (1 .. 19);
subtype Size_Test_b is ada.Streams.Stream_Element_array (1 .. 19);
workaround_possible: constant Boolean := Size_Test_a'Size = Size_Test_b'Size
and then Size_Test_a'Alignment = Size_Test_b'Alignment;
begin
Tasks.check;
pPicData:= Convert (PicData (0)'Address);
GLReadPixels (0, 0,
GLSizei (Width),
GLSizei (Height),
to_GL (Texture.BGR),
GL.GL_UNSIGNED_BYTE,
pPicData);
Errors.log;
if workaround_possible
then
declare
use ada.Streams;
SE_Buffer : Stream_Element_array (0 .. Stream_Element_Offset (PicData'Last));
for SE_Buffer'Address use PicData'Address;
pragma import (Ada, SE_Buffer);
begin
ada.Streams.write (Stream.all, SE_Buffer (0 .. Stream_Element_Offset (data_Max)));
end;
else
temp_Bitmap_type'write (Stream, PicData (0 .. data_Max));
end if;
end write_raw_BGR_Frame;
procedure write_raw_BGRA_Frame (Stream : Stream_access;
Width, Height : Natural)
is
use GL,
GL.Binding,
Texture;
-- 4-byte padding for .bmp/.avi formats is the same as GL's default
-- padding: see glPixelStore, GL_[UN]PACK_ALIGNMENT = 4 as initial value.
-- http://www.openGL.org/sdk/docs/man/xhtml/glPixelStore.xml
--
padded_row_Size : constant Positive:= 4 * Integer (Float'Ceiling (Float (Width)));
-- (in bytes)
type temp_Bitmap_type is array (Natural range <>) of aliased gl.GLUbyte;
PicData: temp_Bitmap_type (0.. (padded_row_size + 4) * (height + 4) - 1);
-- No dynamic allocation needed!
-- The "+4" are there to avoid parity address problems when GL writes
-- to the buffer.
type Loc_pointer is new gl.safe.GLvoid_Pointer;
function convert is new ada.unchecked_Conversion (System.Address, Loc_pointer);
-- This method is functionally identical as GNAT's Unrestricted_Access
-- but has no type safety (cf GNAT Docs).
pragma no_strict_Aliasing (loc_pointer); -- Recommended by GNAT 2005+.
pPicData : Loc_pointer;
data_Max : constant Integer := padded_row_Size * Height - 1;
-- Workaround for the severe xxx'Read xxx'Write performance
-- problems in the GNAT and ObjectAda compilers (as in 2009)
-- This is possible if and only if Byte = Stream_Element and
-- arrays types are both packed the same way.
--
type Byte_array is array (Integer range <>) of aliased GLUByte;
subtype Size_Test_a is Byte_Array (1..19);
subtype Size_Test_b is ada.Streams.Stream_Element_array (1 .. 19);
workaround_possible: constant Boolean := Size_Test_a'Size = Size_Test_b'Size
and then Size_Test_a'Alignment = Size_Test_b'Alignment;
begin
Tasks.check;
pPicData:= convert (PicData (0)'Address);
GLReadPixels (0, 0,
GLSizei (width),
GLSizei (height),
to_GL (openGL.Texture.BGRA),
GL.GL_UNSIGNED_BYTE,
pPicData);
Errors.log;
if workaround_possible
then
declare
use ada.Streams;
SE_Buffer : Stream_Element_array (0 .. Stream_Element_Offset (PicData'Last));
for SE_Buffer'Address use PicData'Address;
pragma Import (Ada, SE_Buffer);
begin
ada.Streams.write (Stream.all, SE_Buffer (0 .. Stream_Element_Offset (data_Max)));
end;
else
temp_Bitmap_type'write (Stream, PicData (0 .. data_Max));
end if;
end write_raw_BGRA_Frame;
-------------
-- Screenshot
--
subtype FXPT2DOT30 is U32;
type CIEXYZ is
record
ciexyzX : FXPT2DOT30;
ciexyzY : FXPT2DOT30;
ciexyzZ : FXPT2DOT30;
end record;
type CIEXYZTRIPLE is
record
ciexyzRed : CIEXYZ;
ciexyzGreen : CIEXYZ;
ciexyzBlue : CIEXYZ;
end record;
type BITMAPFILEHEADER is
record
bfType : U16;
bfSize : U32;
bfReserved1 : U16 := 0;
bfReserved2 : U16 := 0;
bfOffBits : U32;
end record;
pragma pack (BITMAPFILEHEADER);
for BITMAPFILEHEADER'Size use 8 * 14;
type BITMAPINFOHEADER is
record
biSize : U32;
biWidth : I32;
biHeight : I32;
biPlanes : U16;
biBitCount : U16;
biCompression : U32;
biSizeImage : U32;
biXPelsPerMeter : I32 := 0;
biYPelsPerMeter : I32 := 0;
biClrUsed : U32 := 0;
biClrImportant : U32 := 0;
end record;
pragma pack (BITMAPINFOHEADER);
for BITMAPINFOHEADER'Size use 8 * 40;
type BITMAPV4HEADER is
record
Core : BITMAPINFOHEADER;
bV4RedMask : U32;
bV4GreenMask : U32;
bV4BlueMask : U32;
bV4AlphaMask : U32;
bV4CSType : U32;
bV4Endpoints : CIEXYZTRIPLE;
bV4GammaRed : U32;
bV4GammaGreen : U32;
bV4GammaBlue : U32;
end record;
pragma pack (BITMAPV4HEADER);
for BITMAPV4HEADER'Size use 8 * 108;
procedure opaque_Screenshot (Filename : in String)
is
use GL,
GL.Binding;
File : ada.Streams.Stream_IO.File_Type;
FileInfo : BITMAPINFOHEADER;
FileHeader : BITMAPFILEHEADER;
Viewport : array (0 .. 3) of aliased GLint;
begin
Tasks.check;
glGetIntegerv (GL_VIEWPORT,
Viewport (0)'Unchecked_Access);
Errors.log;
FileHeader.bfType := 16#4D42#; -- 'BM'
FileHeader.bfOffBits := BITMAPINFOHEADER'Size / 8
+ BITMAPFILEHEADER'Size / 8;
FileInfo.biSize := BITMAPINFOHEADER'Size / 8;
FileInfo.biWidth := I32 (Viewport (2));
FileInfo.biHeight := I32 (Viewport (3));
FileInfo.biPlanes := 1;
FileInfo.biBitCount := 24;
FileInfo.biCompression := 0;
FileInfo.biSizeImage := U32 ( 4
* Integer (Float'Ceiling (Float (FileInfo.biWidth) * 3.0 / 4.0))
* Integer (FileInfo.biHeight));
FileHeader.bfSize := FileHeader.bfOffBits + FileInfo.biSizeImage;
create (File, out_File, Filename);
declare
procedure write_Intel is new write_Intel_x86_Number (U16, Stream (File));
procedure write_Intel is new write_Intel_x86_Number (U32, Stream (File));
function convert is new ada.unchecked_Conversion (I32, U32);
begin
-- ** Endian-safe: ** --
write_Intel (FileHeader.bfType);
write_Intel (FileHeader.bfSize);
write_Intel (FileHeader.bfReserved1);
write_Intel (FileHeader.bfReserved2);
write_Intel (FileHeader.bfOffBits);
--
write_Intel ( FileInfo.biSize);
write_Intel (convert (FileInfo.biWidth));
write_Intel (convert (FileInfo.biHeight));
write_Intel ( FileInfo.biPlanes);
write_Intel ( FileInfo.biBitCount);
write_Intel ( FileInfo.biCompression);
write_Intel ( FileInfo.biSizeImage);
write_Intel (convert (FileInfo.biXPelsPerMeter));
write_Intel (convert (FileInfo.biYPelsPerMeter));
write_Intel ( FileInfo.biClrUsed);
write_Intel ( FileInfo.biClrImportant);
--
write_raw_BGR_Frame (Stream (File),
Integer (Viewport (2)),
Integer (Viewport (3)));
Close (File);
exception
when others =>
Close (File);
raise;
end;
end opaque_Screenshot;
procedure lucid_Screenshot (Filename : in String)
is
use GL,
GL.Binding;
File : ada.Streams.Stream_IO.File_type;
FileHeader : BITMAPFILEHEADER;
FileInfo : BITMAPV4HEADER;
Viewport : array (0 .. 3) of aliased GLint;
begin
Tasks.check;
glGetIntegerv (GL_VIEWPORT,
Viewport (0)'Unchecked_Access);
Errors.log;
FileHeader.bfType := 16#4D42#; -- 'BM'
FileHeader.bfOffBits := BITMAPV4HEADER 'Size / 8
+ BITMAPFILEHEADER'Size / 8;
FileInfo.Core.biSize := BITMAPV4HEADER'Size / 8;
FileInfo.Core.biWidth := I32 (Viewport (2));
FileInfo.Core.biHeight := I32 (Viewport (3));
FileInfo.Core.biPlanes := 1;
FileInfo.Core.biBitCount := 32;
FileInfo.Core.biCompression := 3;
FileInfo.Core.biSizeImage := U32 ( 4 -- 4-byte padding for '.bmp/.avi' formats.
* Integer (Float'Ceiling (Float (FileInfo.Core.biWidth)))
* Integer (FileInfo.Core.biHeight));
FileInfo.bV4RedMask := 16#00FF0000#;
FileInfo.bV4GreenMask := 16#0000FF00#;
FileInfo.bV4BlueMask := 16#000000FF#;
FileInfo.bV4AlphaMask := 16#FF000000#;
FileInfo.bV4CSType := 0;
FileInfo.bV4Endpoints := (others => (others => 0));
FileInfo.bV4GammaRed := 0;
FileInfo.bV4GammaGreen := 0;
FileInfo.bV4GammaBlue := 0;
FileHeader.bfSize := FileHeader.bfOffBits + FileInfo.Core.biSizeImage;
Create (File, out_File, Filename);
declare
procedure write_Intel is new write_Intel_x86_Number (U16, Stream (File));
procedure write_Intel is new write_Intel_x86_Number (U32, Stream (File));
function convert is new ada.unchecked_Conversion (I32, U32);
begin
-- ** Endian-safe: ** --
write_Intel (FileHeader.bfType);
write_Intel (FileHeader.bfSize);
write_Intel (FileHeader.bfReserved1);
write_Intel (FileHeader.bfReserved2);
write_Intel (FileHeader.bfOffBits);
--
write_Intel ( FileInfo.Core.biSize);
write_Intel (convert (FileInfo.Core.biWidth));
write_Intel (convert (FileInfo.Core.biHeight));
write_Intel ( FileInfo.Core.biPlanes);
write_Intel ( FileInfo.Core.biBitCount);
write_Intel ( FileInfo.Core.biCompression);
write_Intel ( FileInfo.Core.biSizeImage);
write_Intel (convert (FileInfo.Core.biXPelsPerMeter));
write_Intel (convert (FileInfo.Core.biYPelsPerMeter));
write_Intel ( FileInfo.Core.biClrUsed);
write_Intel ( FileInfo.Core.biClrImportant);
write_Intel (FileInfo.bV4RedMask);
write_Intel (FileInfo.bV4GreenMask);
write_Intel (FileInfo.bV4BlueMask);
write_Intel (FileInfo.bV4AlphaMask);
write_Intel (FileInfo.bV4CSType);
write_Intel (FileInfo.bV4Endpoints.ciexyzRed.ciexyzX);
write_Intel (FileInfo.bV4Endpoints.ciexyzRed.ciexyzY);
write_Intel (FileInfo.bV4Endpoints.ciexyzRed.ciexyzZ);
write_Intel (FileInfo.bV4Endpoints.ciexyzGreen.ciexyzX);
write_Intel (FileInfo.bV4Endpoints.ciexyzGreen.ciexyzY);
write_Intel (FileInfo.bV4Endpoints.ciexyzGreen.ciexyzZ);
write_Intel (FileInfo.bV4Endpoints.ciexyzBlue.ciexyzX);
write_Intel (FileInfo.bV4Endpoints.ciexyzBlue.ciexyzY);
write_Intel (FileInfo.bV4Endpoints.ciexyzBlue.ciexyzZ);
write_Intel (FileInfo.bV4GammaRed);
write_Intel (FileInfo.bV4GammaGreen);
write_Intel (FileInfo.bV4GammaBlue);
write_raw_BGRA_Frame (Stream (File),
Integer (Viewport (2)),
Integer (Viewport (3)));
close (File);
exception
when others =>
Close (File);
raise;
end;
end lucid_Screenshot;
procedure Screenshot (Filename : in String; with_Alpha : in Boolean := False)
is
begin
if with_Alpha
then lucid_Screenshot (Filename);
else opaque_Screenshot (Filename);
end if;
end Screenshot;
----------------
-- Video Capture
--
-- We define global variables since it is not expected
-- that more that one capture is taken at the same time.
--
avi : ada.Streams.Stream_IO.File_type;
frames : Natural;
rate : Positive;
width, height : Positive;
bmp_size : U32;
procedure write_RIFF_Headers
is
-- Written 1st time to take place (but # of frames unknown)
-- Written 2nd time for setting # of frames, sizes, etc.
--
calc_bmp_size : constant U32 := U32 (((width)) * height * 3);
-- !! stuff to multiple of 4 !!
index_size : constant U32 := U32 (frames) * 16;
movie_size : constant U32 := 4 + U32 (frames) * (calc_bmp_size + 8);
second_list_size : constant U32 := 4 + 64 + 48;
first_list_size : constant U32 := (4 + 64) + (8 + second_list_size);
file_size : constant U32 := 8 + (8 + first_list_size) + (4 + movie_size) + (8 + index_size);
Stream : constant Stream_access := ada.Streams.Stream_IO.Stream (avi);
procedure write_Intel is new write_Intel_x86_Number (U16, Stream);
procedure write_Intel is new write_Intel_x86_Number (U32, Stream);
microseconds_per_frame : constant U32 := U32 (1_000_000.0 / long_Float (rate));
begin
bmp_size := calc_bmp_size;
String'write (Stream, "RIFF");
U32 'write (Stream, file_size);
String'write (Stream, "AVI ");
String'write (Stream, "LIST");
write_Intel (first_list_size);
String'write (Stream, "hdrl");
String'write (Stream, "avih");
write_Intel (U32' (56));
-- Begin of AVI Header
write_Intel (microseconds_per_frame);
write_Intel (U32'(0)); -- MaxBytesPerSec
write_Intel (U32'(0)); -- Reserved1
write_Intel (U32'(16)); -- Flags (16 = has an index)
write_Intel (U32 (frames));
write_Intel (U32'(0)); -- InitialFrames
write_Intel (U32'(1)); -- Streams
write_Intel (bmp_size);
write_Intel (U32 (width));
write_Intel (U32 (height));
write_Intel (U32'(0)); -- Scale
write_Intel (U32'(0)); -- Rate
write_Intel (U32'(0)); -- Start
write_Intel (U32'(0)); -- Length
-- End of AVI Header
String'write (Stream, "LIST");
write_Intel (second_list_size);
String'write (Stream, "strl");
-- Begin of Str
String'write (Stream, "strh");
write_Intel (U32'(56));
String'write (Stream, "vids");
String'write (Stream, "DIB ");
write_Intel (U32'(0)); -- flags
write_Intel (U32'(0)); -- priority
write_Intel (U32'(0)); -- initial frames
write_Intel (microseconds_per_frame); -- Scale
write_Intel (U32'(1_000_000)); -- Rate
write_Intel (U32'(0)); -- Start
write_Intel (U32 (frames)); -- Length
write_Intel (bmp_size); -- SuggestedBufferSize
write_Intel (U32'(0)); -- Quality
write_Intel (U32'(0)); -- SampleSize
write_Intel (U32'(0));
write_Intel (U16 (width));
write_Intel (U16 (height));
-- End of Str
String'write (Stream, "strf");
write_Intel (U32'(40));
-- Begin of BMI
write_Intel (U32'(40)); -- BM header size (like BMP)
write_Intel (U32 (width));
write_Intel (U32 (height));
write_Intel (U16'(1)); -- Planes
write_Intel (U16'(24)); -- BitCount
write_Intel (U32'(0)); -- Compression
write_Intel (bmp_size); -- SizeImage
write_Intel (U32'(3780)); -- XPelsPerMeter
write_Intel (U32'(3780)); -- YPelsPerMeter
write_Intel (U32'(0)); -- ClrUsed
write_Intel (U32'(0)); -- ClrImportant
-- End of BMI
String'write (Stream, "LIST");
write_Intel (movie_size);
String'write (Stream, "movi");
end Write_RIFF_headers;
procedure start_Capture (AVI_Name : String;
frame_Rate : Positive)
is
use GL,
GL.Binding;
Viewport : array (0 .. 3) of aliased GLint;
begin
Tasks.check;
create (Avi, out_File, AVI_Name);
Frames := 0;
Rate := frame_Rate;
glGetIntegerv (GL_VIEWPORT,
Viewport (0)'unchecked_Access);
Errors.log;
Width := Positive (Viewport (2));
Height := Positive (Viewport (3));
-- NB: GL viewport resizing should be blocked during the video capture !
write_RIFF_Headers;
end start_Capture;
procedure capture_Frame
is
S : constant Stream_Access := Stream (Avi);
procedure Write_Intel is new Write_Intel_x86_number (U32, s);
begin
String'write (S, "00db");
write_Intel (bmp_Size);
write_raw_BGR_frame (S, Width, Height);
Frames := Frames + 1;
end capture_Frame;
procedure stop_Capture
is
index_Size : constant U32 := U32 (Frames) * 16;
S : constant Stream_Access := Stream (Avi);
ChunkOffset : U32 := 4;
procedure write_Intel is new write_Intel_x86_Number (U32, S);
begin
-- Write the index section
--
String'write (S, "idx1");
write_Intel (index_Size);
for f in 1 .. Frames
loop
String'write (S, "00db");
write_Intel (U32'(16)); -- Keyframe.
write_Intel (ChunkOffset);
ChunkOffset := ChunkOffset + bmp_Size + 8;
write_Intel (bmp_Size);
end loop;
Set_Index (avi, 1); -- Go back to file beginning.
write_RIFF_Headers; -- Rewrite headers with correct data.
close (Avi);
end stop_Capture;
end openGL.IO;
| 32.076446 | 119 | 0.548245 |
9aabbc4e406879ac3b8f6527c2788e2c8d37b334 | 12,940 | adb | Ada | ga_lib/src/ga_utilities.adb | rogermc2/GA_Ada | 0b55eb5691ac1c543c79c9a06ffdbe2e47e8f1be | [
"ISC"
] | 3 | 2019-04-12T01:09:55.000Z | 2021-02-24T18:17:32.000Z | ga_lib/src/ga_utilities.adb | rogermc2/GA_Ada | 0b55eb5691ac1c543c79c9a06ffdbe2e47e8f1be | [
"ISC"
] | 1 | 2020-08-12T10:10:25.000Z | 2020-08-12T10:10:25.000Z | ga_lib/src/ga_utilities.adb | rogermc2/GA_Ada | 0b55eb5691ac1c543c79c9a06ffdbe2e47e8f1be | [
"ISC"
] | 1 | 2019-04-12T01:14:15.000Z | 2019-04-12T01:14:15.000Z |
with Ada.Strings.Unbounded;
with Ada.Text_IO; use Ada.Text_IO;
with Utilities;
package body GA_Utilities is
function Multivector_Size (MV : Multivectors.Multivector) return Integer is
theBlades : constant Blade.Blade_List := Multivectors.Blades (MV);
begin
return Integer (theBlades.Length);
end Multivector_Size;
-- ------------------------------------------------------------------------
procedure Print_Bitmap (Name : String; Bitmap : Interfaces.Unsigned_32) is
use Interfaces;
BM : Unsigned_32 := Bitmap;
Bit_String : String (1 .. 32) := (others => '0');
begin
New_Line;
Put_Line (Name & " Bitmap:");
for index in 1 .. 32 loop
if (BM and 1) /= 0 then
Bit_String (33 - index) := '1';
end if;
BM := BM / 2;
end loop;
Put_Line (Bit_String);
end Print_Bitmap;
-- ------------------------------------------------------------------------
procedure Print_Blade (Name : String; B : Blade.Basis_Blade) is
begin
New_Line;
Put_Line (Name);
Put_Line (" Bitmap and Weight:");
Put_Line (Interfaces.Unsigned_32'Image (Blade.Bitmap (B)) &
" " & Float'Image (Blade.Weight (B)));
New_Line;
end Print_Blade;
-- ------------------------------------------------------------------------
procedure Print_Blade_List (Name : String; BL : Blade.Blade_List) is
use Blade;
use Blade_List_Package;
aBlade : Basis_Blade;
Curs : Cursor := BL.First;
begin
New_Line;
Put_Line (Name);
Put_Line ("Blades, Bitmap and Weight:");
while Has_Element (Curs) loop
aBlade := Element (Curs);
Put_Line (Interfaces.Unsigned_32'Image (Bitmap (aBlade)) &
" " & Float'Image (Weight (aBlade)));
Next (Curs);
end loop;
New_Line;
exception
when others =>
Put_Line ("An exception occurred in GA_Utilities.Print_Blade_List.");
raise;
end Print_Blade_List;
-- ------------------------------------------------------------------------
procedure Print_Blade_String (Name : String; B : Blade.Basis_Blade;
MV_Names : Blade_Types.Basis_Vector_Names) is
use Ada.Strings.Unbounded;
use Multivectors;
MV : constant Multivector := New_Multivector (B);
begin
Put_Line (Name & ":");
Put_Line (To_String (Multivector_String (MV, MV_Names)));
end Print_Blade_String;
-- ------------------------------------------------------------------------
procedure Print_Blade_String_Array (Name : String;
BB_Array : Blade.Basis_Blade_Array;
MV_Names : Blade_Types.Basis_Vector_Names) is
begin
for index in BB_Array'Range loop
GA_Utilities.Print_Blade_String (Name, BB_Array (index), MV_Names);
end loop;
end Print_Blade_String_Array;
-- ------------------------------------------------------------------------
procedure Print_E3_Vector (Name : String; aVector : E3GA.E3_Vector) is
begin
Utilities.Print_Vector (Name, aVector);
end Print_E3_Vector;
-- ------------------------------------------------------------------------
procedure Print_E3_Vector_Array
(Name : String; anArray : GL.Types.Singles.Vector3_Array) is
use GL.Types;
begin
Put_Line (Name & ": ");
for Index in anArray'First .. anArray'Last loop
Put (Int'Image (Index) & ": ");
Print_E3_Vector (Name, anArray (Index));
if Index mod 10 = 0 then
New_Line;
end if;
end loop;
New_Line;
end Print_E3_Vector_Array;
-- ------------------------------------------------------------------------
procedure Print_Float_3D (Name : String; aVector : GA_Maths.Float_3D) is
begin
if Name = "" then
Put (" ");
else
Put (Name & ": ");
end if;
for Index in aVector'Range loop
Put (Float'Image (aVector (Index)) & " ");
end loop;
New_Line;
end Print_Float_3D;
-- ------------------------------------------------------------------------
procedure Print_Float_Array
(Name : String; anArray : GA_Maths.Float_Vector) is
begin
Put_Line (Name & ": ");
for Index in anArray'First .. anArray'Last loop
Put (Float'Image (anArray (Index)) & " ");
if Index mod 6 = 0 then
New_Line;
end if;
end loop;
New_Line;
end Print_Float_Array;
-- ------------------------------------------------------------------------
procedure Print_Integer_Array (Name : String; anArray : GA_Maths.Integer_Array) is
begin
Put_Line (Name & ": ");
for Index in anArray'First .. anArray'Last loop
Put (Integer'Image (anArray (Index)) & " ");
if Index mod 3 = 0 then
New_Line;
end if;
end loop;
New_Line;
end Print_Integer_Array;
-- ------------------------------------------------------------------------
procedure Print_Matrix (Name : String; aMatrix : GA_Maths.GA_Matrix3) is
begin
Put_Line (Name & ":");
for Row in 1 .. 3 loop
for Column in 1 .. 3 loop
Put (float'Image (aMatrix (Row, Column)) & " ");
end loop;
New_Line;
end loop;
New_Line;
end Print_Matrix;
-- ------------------------------------------------------------------------
procedure Print_Matrix (Name : String; aMatrix : Real_Matrix) is
use GA_Maths;
begin
if Name /= "" then
Put_Line (Name & ":");
end if;
Put_Line ("Size:" & Integer'Image (aMatrix'Length) & " X"
& Integer'Image (aMatrix'Length (2)));
for Row in aMatrix'Range (1) loop
for Column in aMatrix'Range (2) loop
Put (Float_3'Image (Float_3 (aMatrix (Row, Column))) & " ");
end loop;
New_Line;
end loop;
New_Line;
end Print_Matrix;
-- ------------------------------------------------------------------------
procedure Print_Matrix (Name : String; aMatrix : Real_Matrix;
Start, Last : GA_Maths.Array_I2) is
use GA_Maths;
L_Row : constant Integer := Minimum (aMatrix'Length(1), Last (1));
L_Col : constant Integer := Minimum (aMatrix'Length(2), Last (2));
begin
if Name /= "" then
Put_Line (Name & ":");
end if;
Put_Line ("Size:" & Integer'Image (aMatrix'Length (1)) & " X"
& Integer'Image (aMatrix'Length (2)));
Put ("Rows:" & Integer'Image (Start (1)) & " .."
& Integer'Image (L_Row));
Put_Line (" Columns:" & Integer'Image (Start (2)) & " .."
& Integer'Image (L_Col));
for Row in Start (1) .. L_Row loop
for Column in Start (2) .. L_Col loop
Put (Float_3'Image (Float_3 (aMatrix (Row, Column))) & " ");
end loop;
New_Line;
end loop;
New_Line;
end Print_Matrix;
-- ------------------------------------------------------------------------
procedure Print_Metric (Name : String; aMetric : Metric.Metric_Record) is
use Metric;
Dim : constant Integer := aMetric.Dim;
begin
New_Line;
Put_Line (Name);
Put_Line ("Dimension: " & Integer'Image (Dim));
Print_Matrix ("", Real_Matrix ((Matrix (aMetric))));
Put_Line ("Is_Diagonal: " & Boolean'Image (Is_Diagonal (aMetric)));
Put_Line ("Is_Euclidean: " & Boolean'Image (Is_Euclidean (aMetric)));
Put_Line ("Is_Anti_Euclidean: " & Boolean'Image (Is_Anti_Euclidean (aMetric)));
New_Line;
end Print_Metric;
-- ------------------------------------------------------------------------
procedure Print_Multivector (Name : String; MV : Multivectors.Multivector) is
use Blade;
use Multivectors;
use Blade_List_Package;
theBlades : constant Blade_List := Blades (MV);
aBlade : Blade.Basis_Blade;
Curs : Cursor := theBlades.First;
begin
if Name /= "" then
Put_Line (Name);
end if;
Put_Line ("MV Type: " & MV_Type'Image (MV_Kind (MV)));
Put_Line ("MV Size: " & Integer'Image (Multivector_Size (MV)));
Put_Line ("Grade Use Bitmap: " & GA_Maths.Grade_Usage'Image (Grade_Use (MV)));
Put_Line ("Multivector Blades, Bitmap and Weight:");
while Has_Element (Curs) loop
aBlade := Element (Curs);
Put_Line (Interfaces.Unsigned_32'Image (Blade.Bitmap (aBlade)) &
" " & Float'Image (Blade.Weight (aBlade)));
Next (Curs);
end loop;
New_Line;
exception
when others =>
Put_Line ("An exception occurred in GA_Utilities.Print_Multivector.");
raise;
end Print_Multivector;
-- ------------------------------------------------------------------------
procedure Print_Multivector_Info (Name : String;
Info : Multivector_Type.MV_Type_Record) is
use Multivector_Type;
begin
Put_Line (Name);
Put_Line ("Zero " & boolean'Image (Zero (Info)));
Put_Line ("MV Type " & MV_Type'Image (MV_Kind (Info)));
Put_Line ("Grade " & Integer'Image (MV_Grade (Info)));
Put_Line ("Grade use " & Interfaces.Unsigned_32'Image (Grade_Use (Info)));
Put_Line ("Parity " & Parity_Type'Image (Parity (Info)));
exception
when others =>
Put_Line ("An exception occurred in GA_Utilities.Print_Multivector_Info.");
raise;
end Print_Multivector_Info;
-- ------------------------------------------------------------------------
procedure Print_Multivector_List (Name : String;
MV_List : Multivectors.Multivector_List) is
use Multivectors;
MV_List_Length : constant Integer := List_Length (MV_List);
MV : Multivector;
begin
New_Line;
if MV_List_Length < 1 then
Put_Line (Name & " is empty.");
else
Put_Line (Name & ":");
for index in 1 .. MV_List_Length loop
MV := Get_Multivector (MV_List, index);
Print_Multivector ("", MV);
end loop;
end if;
exception
when others =>
Put_Line ("An exception occurred in GA_Utilities.Print_Multivector_List.");
raise;
end Print_Multivector_List;
-- ------------------------------------------------------------------------
procedure Print_Multivector_List_String
(Name : String; MV_List : Multivectors.Multivector_List;
MV_Names : Blade_Types.Basis_Vector_Names) is
use Multivectors;
MV_List_Length : constant Integer := List_Length (MV_List);
MV : Multivector;
begin
New_Line;
if MV_List_Length < 1 then
Put_Line (Name & " is empty.");
else
Put_Line (Name & ", List Length" & Integer'Image (MV_List_Length) & ":");
for index in 1 .. MV_List_Length loop
MV := Get_Multivector (MV_List, index);
Print_Multivector_String ("", MV, MV_Names);
end loop;
end if;
exception
when others =>
Put_Line ("An exception occurred in GA_Utilities.Print_Multivector_List_String.");
raise;
end Print_Multivector_List_String;
-- ------------------------------------------------------------------------
procedure Print_Multivector_String (Name : String; MV : Multivectors.Multivector;
MV_Names : Blade_Types.Basis_Vector_Names) is
use Ada.Strings.Unbounded;
begin
if Name /= "" then
Put (Name & ": ");
end if;
Put_Line (To_String (Multivectors.Multivector_String (MV, MV_Names)));
exception
when others =>
Put_Line ("An exception occurred in GA_Utilities.Print_Multivector_String.");
raise;
end Print_Multivector_String;
-- ------------------------------------------------------------------------
procedure Print_Vertex (Name : String; Vertex : Multivectors.M_Vector) is
use Blade;
use Multivectors;
use Blade_List_Package;
theBlades : constant Blade_List := Blades (Vertex);
aBlade : Blade.Basis_Blade;
Curs : Cursor := theBlades.First;
begin
Put (Name & ": ");
while Has_Element (Curs) loop
aBlade := Element (Curs);
Put (Float'Image (Blade.Weight (aBlade)) & " ");
Next (Curs);
end loop;
New_Line;
exception
when others =>
Put_Line ("An exception occurred in GA_Utilities.Print_Vertex.");
raise;
end Print_Vertex;
-- ------------------------------------------------------------------------
end GA_Utilities;
| 34.052632 | 91 | 0.51306 |
9aa06a6aa4f4ea7365753431a2f5d12c92ca7e85 | 37,526 | ads | Ada | arch/ARM/STM32/svd/stm32l5x2/stm32_svd-tsc.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/stm32l5x2/stm32_svd-tsc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l5x2/stm32_svd-tsc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L5x2.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.TSC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_MCV_Field is HAL.UInt3;
subtype CR_PGPSC_Field is HAL.UInt3;
subtype CR_SSD_Field is HAL.UInt7;
subtype CR_CTPL_Field is HAL.UInt4;
subtype CR_CTPH_Field is HAL.UInt4;
-- control register
type CR_Register is record
-- Touch sensing controller enable
TSCE : Boolean := False;
-- Start a new acquisition
START : Boolean := False;
-- Acquisition mode
AM : Boolean := False;
-- Synchronization pin polarity
SYNCPOL : Boolean := False;
-- I/O Default mode
IODEF : Boolean := False;
-- Max count value
MCV : CR_MCV_Field := 16#0#;
-- unspecified
Reserved_8_11 : HAL.UInt4 := 16#0#;
-- pulse generator prescaler
PGPSC : CR_PGPSC_Field := 16#0#;
-- Spread spectrum prescaler
SSPSC : Boolean := False;
-- Spread spectrum enable
SSE : Boolean := False;
-- Spread spectrum deviation
SSD : CR_SSD_Field := 16#0#;
-- Charge transfer pulse low
CTPL : CR_CTPL_Field := 16#0#;
-- Charge transfer pulse high
CTPH : CR_CTPH_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
TSCE at 0 range 0 .. 0;
START at 0 range 1 .. 1;
AM at 0 range 2 .. 2;
SYNCPOL at 0 range 3 .. 3;
IODEF at 0 range 4 .. 4;
MCV at 0 range 5 .. 7;
Reserved_8_11 at 0 range 8 .. 11;
PGPSC at 0 range 12 .. 14;
SSPSC at 0 range 15 .. 15;
SSE at 0 range 16 .. 16;
SSD at 0 range 17 .. 23;
CTPL at 0 range 24 .. 27;
CTPH at 0 range 28 .. 31;
end record;
-- interrupt enable register
type IER_Register is record
-- End of acquisition interrupt enable
EOAIE : Boolean := False;
-- Max count error interrupt enable
MCEIE : 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 IER_Register use record
EOAIE at 0 range 0 .. 0;
MCEIE at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-- interrupt clear register
type ICR_Register is record
-- End of acquisition interrupt clear
EOAIC : Boolean := False;
-- Max count error interrupt clear
MCEIC : 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 ICR_Register use record
EOAIC at 0 range 0 .. 0;
MCEIC at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-- interrupt status register
type ISR_Register is record
-- End of acquisition flag
EOAF : Boolean := False;
-- Max count error flag
MCEF : 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 ISR_Register use record
EOAF at 0 range 0 .. 0;
MCEF at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-- IOHCR_G1_IO array
type IOHCR_G1_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOHCR_G1_IO
type IOHCR_G1_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G1_IO as a value
Val : HAL.UInt4;
when True =>
-- G1_IO as an array
Arr : IOHCR_G1_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOHCR_G1_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOHCR_G2_IO array
type IOHCR_G2_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOHCR_G2_IO
type IOHCR_G2_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G2_IO as a value
Val : HAL.UInt4;
when True =>
-- G2_IO as an array
Arr : IOHCR_G2_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOHCR_G2_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOHCR_G3_IO array
type IOHCR_G3_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOHCR_G3_IO
type IOHCR_G3_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G3_IO as a value
Val : HAL.UInt4;
when True =>
-- G3_IO as an array
Arr : IOHCR_G3_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOHCR_G3_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOHCR_G4_IO array
type IOHCR_G4_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOHCR_G4_IO
type IOHCR_G4_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G4_IO as a value
Val : HAL.UInt4;
when True =>
-- G4_IO as an array
Arr : IOHCR_G4_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOHCR_G4_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOHCR_G5_IO array
type IOHCR_G5_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOHCR_G5_IO
type IOHCR_G5_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G5_IO as a value
Val : HAL.UInt4;
when True =>
-- G5_IO as an array
Arr : IOHCR_G5_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOHCR_G5_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOHCR_G6_IO array
type IOHCR_G6_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOHCR_G6_IO
type IOHCR_G6_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G6_IO as a value
Val : HAL.UInt4;
when True =>
-- G6_IO as an array
Arr : IOHCR_G6_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOHCR_G6_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOHCR_G7_IO array
type IOHCR_G7_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOHCR_G7_IO
type IOHCR_G7_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G7_IO as a value
Val : HAL.UInt4;
when True =>
-- G7_IO as an array
Arr : IOHCR_G7_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOHCR_G7_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOHCR_G8_IO array
type IOHCR_G8_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOHCR_G8_IO
type IOHCR_G8_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G8_IO as a value
Val : HAL.UInt4;
when True =>
-- G8_IO as an array
Arr : IOHCR_G8_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOHCR_G8_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- I/O hysteresis control register
type IOHCR_Register is record
-- G1_IO1
G1_IO : IOHCR_G1_IO_Field := (As_Array => False, Val => 16#1#);
-- G2_IO1
G2_IO : IOHCR_G2_IO_Field := (As_Array => False, Val => 16#1#);
-- G3_IO1
G3_IO : IOHCR_G3_IO_Field := (As_Array => False, Val => 16#1#);
-- G4_IO1
G4_IO : IOHCR_G4_IO_Field := (As_Array => False, Val => 16#1#);
-- G5_IO1
G5_IO : IOHCR_G5_IO_Field := (As_Array => False, Val => 16#1#);
-- G6_IO1
G6_IO : IOHCR_G6_IO_Field := (As_Array => False, Val => 16#1#);
-- G7_IO1
G7_IO : IOHCR_G7_IO_Field := (As_Array => False, Val => 16#1#);
-- G8_IO1
G8_IO : IOHCR_G8_IO_Field := (As_Array => False, Val => 16#1#);
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOHCR_Register use record
G1_IO at 0 range 0 .. 3;
G2_IO at 0 range 4 .. 7;
G3_IO at 0 range 8 .. 11;
G4_IO at 0 range 12 .. 15;
G5_IO at 0 range 16 .. 19;
G6_IO at 0 range 20 .. 23;
G7_IO at 0 range 24 .. 27;
G8_IO at 0 range 28 .. 31;
end record;
-- IOASCR_G1_IO array
type IOASCR_G1_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOASCR_G1_IO
type IOASCR_G1_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G1_IO as a value
Val : HAL.UInt4;
when True =>
-- G1_IO as an array
Arr : IOASCR_G1_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOASCR_G1_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOASCR_G2_IO array
type IOASCR_G2_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOASCR_G2_IO
type IOASCR_G2_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G2_IO as a value
Val : HAL.UInt4;
when True =>
-- G2_IO as an array
Arr : IOASCR_G2_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOASCR_G2_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOASCR_G3_IO array
type IOASCR_G3_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOASCR_G3_IO
type IOASCR_G3_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G3_IO as a value
Val : HAL.UInt4;
when True =>
-- G3_IO as an array
Arr : IOASCR_G3_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOASCR_G3_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOASCR_G4_IO array
type IOASCR_G4_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOASCR_G4_IO
type IOASCR_G4_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G4_IO as a value
Val : HAL.UInt4;
when True =>
-- G4_IO as an array
Arr : IOASCR_G4_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOASCR_G4_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOASCR_G5_IO array
type IOASCR_G5_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOASCR_G5_IO
type IOASCR_G5_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G5_IO as a value
Val : HAL.UInt4;
when True =>
-- G5_IO as an array
Arr : IOASCR_G5_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOASCR_G5_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOASCR_G6_IO array
type IOASCR_G6_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOASCR_G6_IO
type IOASCR_G6_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G6_IO as a value
Val : HAL.UInt4;
when True =>
-- G6_IO as an array
Arr : IOASCR_G6_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOASCR_G6_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOASCR_G7_IO array
type IOASCR_G7_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOASCR_G7_IO
type IOASCR_G7_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G7_IO as a value
Val : HAL.UInt4;
when True =>
-- G7_IO as an array
Arr : IOASCR_G7_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOASCR_G7_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOASCR_G8_IO array
type IOASCR_G8_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOASCR_G8_IO
type IOASCR_G8_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G8_IO as a value
Val : HAL.UInt4;
when True =>
-- G8_IO as an array
Arr : IOASCR_G8_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOASCR_G8_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- I/O analog switch control register
type IOASCR_Register is record
-- G1_IO1
G1_IO : IOASCR_G1_IO_Field := (As_Array => False, Val => 16#0#);
-- G2_IO1
G2_IO : IOASCR_G2_IO_Field := (As_Array => False, Val => 16#0#);
-- G3_IO1
G3_IO : IOASCR_G3_IO_Field := (As_Array => False, Val => 16#0#);
-- G4_IO1
G4_IO : IOASCR_G4_IO_Field := (As_Array => False, Val => 16#0#);
-- G5_IO1
G5_IO : IOASCR_G5_IO_Field := (As_Array => False, Val => 16#0#);
-- G6_IO1
G6_IO : IOASCR_G6_IO_Field := (As_Array => False, Val => 16#0#);
-- G7_IO1
G7_IO : IOASCR_G7_IO_Field := (As_Array => False, Val => 16#0#);
-- G8_IO1
G8_IO : IOASCR_G8_IO_Field := (As_Array => False, Val => 16#0#);
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOASCR_Register use record
G1_IO at 0 range 0 .. 3;
G2_IO at 0 range 4 .. 7;
G3_IO at 0 range 8 .. 11;
G4_IO at 0 range 12 .. 15;
G5_IO at 0 range 16 .. 19;
G6_IO at 0 range 20 .. 23;
G7_IO at 0 range 24 .. 27;
G8_IO at 0 range 28 .. 31;
end record;
-- IOSCR_G1_IO array
type IOSCR_G1_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOSCR_G1_IO
type IOSCR_G1_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G1_IO as a value
Val : HAL.UInt4;
when True =>
-- G1_IO as an array
Arr : IOSCR_G1_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOSCR_G1_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOSCR_G2_IO array
type IOSCR_G2_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOSCR_G2_IO
type IOSCR_G2_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G2_IO as a value
Val : HAL.UInt4;
when True =>
-- G2_IO as an array
Arr : IOSCR_G2_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOSCR_G2_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOSCR_G3_IO array
type IOSCR_G3_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOSCR_G3_IO
type IOSCR_G3_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G3_IO as a value
Val : HAL.UInt4;
when True =>
-- G3_IO as an array
Arr : IOSCR_G3_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOSCR_G3_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOSCR_G4_IO array
type IOSCR_G4_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOSCR_G4_IO
type IOSCR_G4_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G4_IO as a value
Val : HAL.UInt4;
when True =>
-- G4_IO as an array
Arr : IOSCR_G4_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOSCR_G4_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOSCR_G5_IO array
type IOSCR_G5_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOSCR_G5_IO
type IOSCR_G5_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G5_IO as a value
Val : HAL.UInt4;
when True =>
-- G5_IO as an array
Arr : IOSCR_G5_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOSCR_G5_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOSCR_G6_IO array
type IOSCR_G6_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOSCR_G6_IO
type IOSCR_G6_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G6_IO as a value
Val : HAL.UInt4;
when True =>
-- G6_IO as an array
Arr : IOSCR_G6_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOSCR_G6_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOSCR_G7_IO array
type IOSCR_G7_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOSCR_G7_IO
type IOSCR_G7_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G7_IO as a value
Val : HAL.UInt4;
when True =>
-- G7_IO as an array
Arr : IOSCR_G7_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOSCR_G7_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOSCR_G8_IO array
type IOSCR_G8_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOSCR_G8_IO
type IOSCR_G8_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G8_IO as a value
Val : HAL.UInt4;
when True =>
-- G8_IO as an array
Arr : IOSCR_G8_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOSCR_G8_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- I/O sampling control register
type IOSCR_Register is record
-- G1_IO1
G1_IO : IOSCR_G1_IO_Field := (As_Array => False, Val => 16#0#);
-- G2_IO1
G2_IO : IOSCR_G2_IO_Field := (As_Array => False, Val => 16#0#);
-- G3_IO1
G3_IO : IOSCR_G3_IO_Field := (As_Array => False, Val => 16#0#);
-- G4_IO1
G4_IO : IOSCR_G4_IO_Field := (As_Array => False, Val => 16#0#);
-- G5_IO1
G5_IO : IOSCR_G5_IO_Field := (As_Array => False, Val => 16#0#);
-- G6_IO1
G6_IO : IOSCR_G6_IO_Field := (As_Array => False, Val => 16#0#);
-- G7_IO1
G7_IO : IOSCR_G7_IO_Field := (As_Array => False, Val => 16#0#);
-- G8_IO1
G8_IO : IOSCR_G8_IO_Field := (As_Array => False, Val => 16#0#);
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOSCR_Register use record
G1_IO at 0 range 0 .. 3;
G2_IO at 0 range 4 .. 7;
G3_IO at 0 range 8 .. 11;
G4_IO at 0 range 12 .. 15;
G5_IO at 0 range 16 .. 19;
G6_IO at 0 range 20 .. 23;
G7_IO at 0 range 24 .. 27;
G8_IO at 0 range 28 .. 31;
end record;
-- IOCCR_G1_IO array
type IOCCR_G1_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOCCR_G1_IO
type IOCCR_G1_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G1_IO as a value
Val : HAL.UInt4;
when True =>
-- G1_IO as an array
Arr : IOCCR_G1_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOCCR_G1_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOCCR_G2_IO array
type IOCCR_G2_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOCCR_G2_IO
type IOCCR_G2_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G2_IO as a value
Val : HAL.UInt4;
when True =>
-- G2_IO as an array
Arr : IOCCR_G2_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOCCR_G2_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOCCR_G3_IO array
type IOCCR_G3_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOCCR_G3_IO
type IOCCR_G3_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G3_IO as a value
Val : HAL.UInt4;
when True =>
-- G3_IO as an array
Arr : IOCCR_G3_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOCCR_G3_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOCCR_G4_IO array
type IOCCR_G4_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOCCR_G4_IO
type IOCCR_G4_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G4_IO as a value
Val : HAL.UInt4;
when True =>
-- G4_IO as an array
Arr : IOCCR_G4_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOCCR_G4_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOCCR_G5_IO array
type IOCCR_G5_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOCCR_G5_IO
type IOCCR_G5_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G5_IO as a value
Val : HAL.UInt4;
when True =>
-- G5_IO as an array
Arr : IOCCR_G5_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOCCR_G5_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOCCR_G6_IO array
type IOCCR_G6_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOCCR_G6_IO
type IOCCR_G6_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G6_IO as a value
Val : HAL.UInt4;
when True =>
-- G6_IO as an array
Arr : IOCCR_G6_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOCCR_G6_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOCCR_G7_IO array
type IOCCR_G7_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOCCR_G7_IO
type IOCCR_G7_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G7_IO as a value
Val : HAL.UInt4;
when True =>
-- G7_IO as an array
Arr : IOCCR_G7_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOCCR_G7_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- IOCCR_G8_IO array
type IOCCR_G8_IO_Field_Array is array (1 .. 4) of Boolean
with Component_Size => 1, Size => 4;
-- Type definition for IOCCR_G8_IO
type IOCCR_G8_IO_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- G8_IO as a value
Val : HAL.UInt4;
when True =>
-- G8_IO as an array
Arr : IOCCR_G8_IO_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for IOCCR_G8_IO_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- I/O channel control register
type IOCCR_Register is record
-- G1_IO1
G1_IO : IOCCR_G1_IO_Field := (As_Array => False, Val => 16#0#);
-- G2_IO1
G2_IO : IOCCR_G2_IO_Field := (As_Array => False, Val => 16#0#);
-- G3_IO1
G3_IO : IOCCR_G3_IO_Field := (As_Array => False, Val => 16#0#);
-- G4_IO1
G4_IO : IOCCR_G4_IO_Field := (As_Array => False, Val => 16#0#);
-- G5_IO1
G5_IO : IOCCR_G5_IO_Field := (As_Array => False, Val => 16#0#);
-- G6_IO1
G6_IO : IOCCR_G6_IO_Field := (As_Array => False, Val => 16#0#);
-- G7_IO1
G7_IO : IOCCR_G7_IO_Field := (As_Array => False, Val => 16#0#);
-- G8_IO1
G8_IO : IOCCR_G8_IO_Field := (As_Array => False, Val => 16#0#);
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOCCR_Register use record
G1_IO at 0 range 0 .. 3;
G2_IO at 0 range 4 .. 7;
G3_IO at 0 range 8 .. 11;
G4_IO at 0 range 12 .. 15;
G5_IO at 0 range 16 .. 19;
G6_IO at 0 range 20 .. 23;
G7_IO at 0 range 24 .. 27;
G8_IO at 0 range 28 .. 31;
end record;
-- I/O group control status register
type IOGCSR_Register is record
-- Analog I/O group x enable
G1E : Boolean := False;
-- Analog I/O group x enable
G2E : Boolean := False;
-- Analog I/O group x enable
G3E : Boolean := False;
-- Analog I/O group x enable
G4E : Boolean := False;
-- Analog I/O group x enable
G5E : Boolean := False;
-- Analog I/O group x enable
G6E : Boolean := False;
-- Analog I/O group x enable
G7E : Boolean := False;
-- Analog I/O group x enable
G8E : Boolean := False;
-- unspecified
Reserved_8_15 : HAL.UInt8 := 16#0#;
-- Read-only. Analog I/O group x status
G1S : Boolean := False;
-- Read-only. Analog I/O group x status
G2S : Boolean := False;
-- Read-only. Analog I/O group x status
G3S : Boolean := False;
-- Read-only. Analog I/O group x status
G4S : Boolean := False;
-- Read-only. Analog I/O group x status
G5S : Boolean := False;
-- Read-only. Analog I/O group x status
G6S : Boolean := False;
-- Read-only. Analog I/O group x status
G7S : Boolean := False;
-- Read-only. Analog I/O group x status
G8S : Boolean := False;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOGCSR_Register use record
G1E at 0 range 0 .. 0;
G2E at 0 range 1 .. 1;
G3E at 0 range 2 .. 2;
G4E at 0 range 3 .. 3;
G5E at 0 range 4 .. 4;
G6E at 0 range 5 .. 5;
G7E at 0 range 6 .. 6;
G8E at 0 range 7 .. 7;
Reserved_8_15 at 0 range 8 .. 15;
G1S at 0 range 16 .. 16;
G2S at 0 range 17 .. 17;
G3S at 0 range 18 .. 18;
G4S at 0 range 19 .. 19;
G5S at 0 range 20 .. 20;
G6S at 0 range 21 .. 21;
G7S at 0 range 22 .. 22;
G8S at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype IOG1CR_CNT_Field is HAL.UInt14;
-- I/O group x counter register
type IOG1CR_Register is record
-- Read-only. Counter value
CNT : IOG1CR_CNT_Field;
-- unspecified
Reserved_14_31 : HAL.UInt18;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOG1CR_Register use record
CNT at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
subtype IOG2CR_CNT_Field is HAL.UInt14;
-- I/O group x counter register
type IOG2CR_Register is record
-- Read-only. Counter value
CNT : IOG2CR_CNT_Field;
-- unspecified
Reserved_14_31 : HAL.UInt18;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOG2CR_Register use record
CNT at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
subtype IOG3CR_CNT_Field is HAL.UInt14;
-- I/O group x counter register
type IOG3CR_Register is record
-- Read-only. Counter value
CNT : IOG3CR_CNT_Field;
-- unspecified
Reserved_14_31 : HAL.UInt18;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOG3CR_Register use record
CNT at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
subtype IOG4CR_CNT_Field is HAL.UInt14;
-- I/O group x counter register
type IOG4CR_Register is record
-- Read-only. Counter value
CNT : IOG4CR_CNT_Field;
-- unspecified
Reserved_14_31 : HAL.UInt18;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOG4CR_Register use record
CNT at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
subtype IOG5CR_CNT_Field is HAL.UInt14;
-- I/O group x counter register
type IOG5CR_Register is record
-- Read-only. Counter value
CNT : IOG5CR_CNT_Field;
-- unspecified
Reserved_14_31 : HAL.UInt18;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOG5CR_Register use record
CNT at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
subtype IOG6CR_CNT_Field is HAL.UInt14;
-- I/O group x counter register
type IOG6CR_Register is record
-- Read-only. Counter value
CNT : IOG6CR_CNT_Field;
-- unspecified
Reserved_14_31 : HAL.UInt18;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOG6CR_Register use record
CNT at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
subtype IOG7CR_CNT_Field is HAL.UInt14;
-- I/O group x counter register
type IOG7CR_Register is record
-- Read-only. Counter value
CNT : IOG7CR_CNT_Field;
-- unspecified
Reserved_14_31 : HAL.UInt18;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOG7CR_Register use record
CNT at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
subtype IOG8CR_CNT_Field is HAL.UInt14;
-- I/O group x counter register
type IOG8CR_Register is record
-- Read-only. Counter value
CNT : IOG8CR_CNT_Field;
-- unspecified
Reserved_14_31 : HAL.UInt18;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IOG8CR_Register use record
CNT at 0 range 0 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Touch sensing controller
type TSC_Peripheral is record
-- control register
CR : aliased CR_Register;
-- interrupt enable register
IER : aliased IER_Register;
-- interrupt clear register
ICR : aliased ICR_Register;
-- interrupt status register
ISR : aliased ISR_Register;
-- I/O hysteresis control register
IOHCR : aliased IOHCR_Register;
-- I/O analog switch control register
IOASCR : aliased IOASCR_Register;
-- I/O sampling control register
IOSCR : aliased IOSCR_Register;
-- I/O channel control register
IOCCR : aliased IOCCR_Register;
-- I/O group control status register
IOGCSR : aliased IOGCSR_Register;
-- I/O group x counter register
IOG1CR : aliased IOG1CR_Register;
-- I/O group x counter register
IOG2CR : aliased IOG2CR_Register;
-- I/O group x counter register
IOG3CR : aliased IOG3CR_Register;
-- I/O group x counter register
IOG4CR : aliased IOG4CR_Register;
-- I/O group x counter register
IOG5CR : aliased IOG5CR_Register;
-- I/O group x counter register
IOG6CR : aliased IOG6CR_Register;
-- I/O group x counter register
IOG7CR : aliased IOG7CR_Register;
-- I/O group x counter register
IOG8CR : aliased IOG8CR_Register;
end record
with Volatile;
for TSC_Peripheral use record
CR at 16#0# range 0 .. 31;
IER at 16#4# range 0 .. 31;
ICR at 16#8# range 0 .. 31;
ISR at 16#C# range 0 .. 31;
IOHCR at 16#10# range 0 .. 31;
IOASCR at 16#18# range 0 .. 31;
IOSCR at 16#20# range 0 .. 31;
IOCCR at 16#28# range 0 .. 31;
IOGCSR at 16#30# range 0 .. 31;
IOG1CR at 16#34# range 0 .. 31;
IOG2CR at 16#38# range 0 .. 31;
IOG3CR at 16#3C# range 0 .. 31;
IOG4CR at 16#40# range 0 .. 31;
IOG5CR at 16#44# range 0 .. 31;
IOG6CR at 16#48# range 0 .. 31;
IOG7CR at 16#4C# range 0 .. 31;
IOG8CR at 16#50# range 0 .. 31;
end record;
-- Touch sensing controller
SEC_TSC_Periph : aliased TSC_Peripheral
with Import, Address => System'To_Address (16#50024000#);
-- Touch sensing controller
TSC_Periph : aliased TSC_Peripheral
with Import, Address => System'To_Address (16#40024000#);
end STM32_SVD.TSC;
| 28.955247 | 70 | 0.571497 |
19dcbef7db9ca5ca40931b73d3cdac6f51198573 | 4,165 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/g-bubsor.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/g-bubsor.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/g-bubsor.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . B U B B L E _ S O R T --
-- --
-- S p e c --
-- --
-- Copyright (C) 1995-2005, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Sort Utility (Using Bubblesort Algorithm)
-- 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 and GNAT.Bubble_Sort_A. These are older
-- versions of this routine. In some cases GNAT.Bubble_Sort_G may be a
-- little faster than GNAT.Bubble_Sort, at the expense of generic code
-- duplication and a less convenient interface. The generic version also
-- has the advantage of being Pure, while this unit can only be Preelaborate.
package GNAT.Bubble_Sort is
pragma Preelaborate;
-- 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.
type Xchg_Procedure is access procedure (Op1, Op2 : Natural);
-- A pointer to a procedure that exchanges the two data items whose
-- index values are Op1 and Op2.
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 value Op1 is less than the item with Index value
-- Op2, and False if the Op1 item is greater than or equal to the Op2
-- item.
procedure Sort (N : Natural; Xchg : Xchg_Procedure; Lt : Lt_Function);
-- This procedures sorts items in the range from 1 to N into ascending
-- order making calls to Lt to do required comparisons, and calls to
-- Xchg to exchange items. The sort is stable, that is the order of
-- equal items in the input is preserved.
end GNAT.Bubble_Sort;
| 60.362319 | 78 | 0.531092 |
037c7a890f04d52d9e0cb18078aa1f8108c52405 | 2,491 | ads | Ada | arch/RISC-V/src/rv32/riscv-types.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/RISC-V/src/rv32/riscv-types.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/RISC-V/src/rv32/riscv-types.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2020, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with HAL;
package RISCV.Types is
XLEN : constant := 32;
subtype Unsigned_XLEN is HAL.UInt32;
end RISCV.Types;
| 60.756098 | 78 | 0.511843 |
ad28a24d5465190246f84cc3251715c577dc99c7 | 3,549 | adb | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-expllu.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-expllu.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-expllu.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . X P _ B M L --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Unsigned_Types; use System.Unsigned_Types;
package body System.Exp_LLU is
----------------------------
-- Exp_Long_Long_Unsigned --
----------------------------
function Exp_Long_Long_Unsigned
(Left : Long_Long_Unsigned;
Right : Natural)
return Long_Long_Unsigned
is
Result : Long_Long_Unsigned := 1;
Factor : Long_Long_Unsigned := Left;
Exp : Natural := Right;
begin
-- We use the standard logarithmic approach, Exp gets shifted right
-- testing successive low order bits and Factor is the value of the
-- base raised to the next power of 2.
-- Note: it is not worth special casing the cases of base values -1,0,+1
-- since the expander does this when the base is a literal, and other
-- cases will be extremely rare.
if Exp /= 0 then
loop
if Exp rem 2 /= 0 then
Result := Result * Factor;
end if;
Exp := Exp / 2;
exit when Exp = 0;
Factor := Factor * Factor;
end loop;
end if;
return Result;
end Exp_Long_Long_Unsigned;
end System.Exp_LLU;
| 47.32 | 79 | 0.43308 |
1983b94294f4aeabe61afb1b536fb4b2a3ba3e53 | 3,959 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cc/cc3240a.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/cc/cc3240a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cc/cc3240a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CC3240A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT A FORMAL PRIVATE AND LIMITED PRIVATE TYPE DENOTES ITS
-- ACTUAL PARAMETER, AND OPERATIONS OF THE FORMAL TYPE ARE
-- IDENTIFIED WITH CORRESPONDING OPERATIONS OF THE ACTUAL TYPE
-- WHEN THE FORMAL TYPE IS A TYPE WITH DISCRIMINANTS.
-- HISTORY:
-- RJW 10/13/88 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
PROCEDURE CC3240A IS
BEGIN
TEST ("CC3240A", "CHECK THAT A FORMAL PRIVATE OR LIMITED " &
"PRIVATE TYPE DENOTES ITS ACTUAL PARAMETER AND " &
"OPERATIONS OF THE FORMAL TYPE ARE IDENTIFIED " &
"WITH CORRESPONDING OPERATIONS OF THE ACTUAL " &
"TYPE, WHEN THE FORMAL TYPE IS A TYPE " &
"WITH DISCRIMINANTS");
DECLARE
GENERIC
TYPE T(A : INTEGER) IS PRIVATE;
PACKAGE P IS
SUBTYPE S IS T;
TX : T(5);
END P;
TYPE REC (L : INTEGER) IS
RECORD
A : INTEGER;
END RECORD;
PACKAGE P1 IS NEW P (REC);
USE P1;
BEGIN
TX := (L => 5, A => 7);
IF NOT (TX IN REC) THEN
FAILED ("MEMBERSHIP TEST - PRIVATE");
END IF;
IF TX.A /= 7 OR TX.L /= 5 THEN
FAILED ("SELECTED COMPONENTS - PRIVATE");
END IF;
IF S(TX) /= REC(TX) THEN
FAILED ("EXPLICIT CONVERSION - PRIVATE");
END IF;
IF NOT TX'CONSTRAINED THEN
FAILED ("'CONSTRAINED - PRIVATE");
END IF;
END;
DECLARE
TYPE REC(L : INTEGER) IS
RECORD
A : INTEGER;
END RECORD;
GENERIC
TYPE T(A : INTEGER) IS LIMITED PRIVATE;
TX : IN OUT T;
PACKAGE LP IS
SUBTYPE S IS T;
END LP;
R : REC (5) := (5, 7);
PACKAGE BODY LP IS
BEGIN
IF (TX IN S) /= (R IN REC) THEN
FAILED ("MEMBERSHIP TEST - LIMITED PRIVATE");
END IF;
IF TX.A /= 5 THEN
FAILED ("SELECTED COMPONENTS - LIMITED PRIVATE");
END IF;
IF (S(TX) IN S) /= (REC(R) IN REC) THEN
FAILED ("EXPLICIT CONVERSION - LIMITED PRIVATE");
END IF;
IF NOT TX'CONSTRAINED THEN
FAILED ("'CONSTRAINED - LIMITED PRIVATE");
END IF;
END LP;
PACKAGE P1 IS NEW LP (REC, R);
USE P1;
BEGIN
NULL;
END;
RESULT;
END CC3240A;
| 32.186992 | 79 | 0.533468 |
1976b25b588a9100dcd4e890366ef468a773c6f6 | 250 | ads | Ada | source/calendar/machine-pc-freebsd/s-naexti.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/calendar/machine-pc-freebsd/s-naexti.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/calendar/machine-pc-linux-gnu/s-naexti.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 POSIX (Darwin, FreeBSD, or Linux)
package System.Native_Execution_Time is
subtype CPU_Time is Duration;
function Clock return CPU_Time;
end System.Native_Execution_Time;
| 25 | 73 | 0.8 |
03c048072397fdd8106ed14b84c1ad5d4f775c7a | 3,325 | ads | Ada | source/nodes/program-nodes-defining_identifiers.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-defining_identifiers.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-defining_identifiers.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Elements.Defining_Identifiers;
with Program.Element_Visitors;
package Program.Nodes.Defining_Identifiers is
pragma Preelaborate;
type Defining_Identifier is
new Program.Nodes.Node
and Program.Elements.Defining_Identifiers.Defining_Identifier
and Program.Elements.Defining_Identifiers.Defining_Identifier_Text
with private;
function Create
(Identifier_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Defining_Identifier;
type Implicit_Defining_Identifier is
new Program.Nodes.Node
and Program.Elements.Defining_Identifiers.Defining_Identifier
with private;
function Create
(Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Defining_Identifier
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Defining_Identifier is
abstract new Program.Nodes.Node
and Program.Elements.Defining_Identifiers.Defining_Identifier
with null record;
procedure Initialize (Self : in out Base_Defining_Identifier'Class);
overriding procedure Visit
(Self : not null access Base_Defining_Identifier;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Is_Defining_Identifier
(Self : Base_Defining_Identifier)
return Boolean;
overriding function Is_Defining_Name
(Self : Base_Defining_Identifier)
return Boolean;
type Defining_Identifier is
new Base_Defining_Identifier
and Program.Elements.Defining_Identifiers.Defining_Identifier_Text
with record
Identifier_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Defining_Identifier_Text
(Self : in out Defining_Identifier)
return Program.Elements.Defining_Identifiers
.Defining_Identifier_Text_Access;
overriding function Identifier_Token
(Self : Defining_Identifier)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Image (Self : Defining_Identifier) return Text;
type Implicit_Defining_Identifier is
new Base_Defining_Identifier
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Defining_Identifier_Text
(Self : in out Implicit_Defining_Identifier)
return Program.Elements.Defining_Identifiers
.Defining_Identifier_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Defining_Identifier)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Defining_Identifier)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Defining_Identifier)
return Boolean;
overriding function Image (Self : Implicit_Defining_Identifier) return Text;
end Program.Nodes.Defining_Identifiers;
| 31.666667 | 79 | 0.747068 |
8bf4ec703ee0dd7634d0fbab699ee635b1d03749 | 13,824 | ads | Ada | testutil/ahven/ahven-framework.ads | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | testutil/ahven/ahven-framework.ads | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | testutil/ahven/ahven-framework.ads | Letractively/ada-util | e4c63b93635dc07c46e95f12ba02d18903b307b3 | [
"Apache-2.0"
] | null | null | null | --
-- Copyright (c) 2007-2009 Tero Koskinen <[email protected]>
--
-- 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.
--
with Ada.Finalization;
with Ahven;
with Ahven.Listeners;
with Ahven.SList;
with Ahven.AStrings;
pragma Elaborate_All (Ahven);
pragma Elaborate_All (Ahven.SList);
package Ahven.Framework is
Three_Hours : constant := 10800.0;
subtype Test_Duration is Duration range 0.0 .. Three_Hours;
type Test_Count_Type is new Natural;
-- Type for the test count. This effectively
-- limits the amount tests to whatever Natural is.
--
-- Although, in practice when adding tests the limit
-- is not checked.
type Test is abstract new Ada.Finalization.Controlled with null record;
-- A type, which provides the base for Test_Case and
-- Test_Suite types.
type Test_Class_Access is access all Test'Class;
procedure Set_Up (T : in out Test);
-- Set_Up is called before executing the test procedure.
--
-- By default, the procedure does nothing, but derived
-- types can overwrite this method and add their own
-- customisations.
--
-- One should not call this explicitly by herself.
-- The framework calls it when necessary.
procedure Tear_Down (T : in out Test);
-- Tear_Down is called after the test procedure is executed.
--
-- By default, the procedure does nothing, but derived
-- types can overwrite this method and add their own
-- customisations.
--
-- One should not call this explicitly by herself.
-- The framework calls it when necessary.
function Get_Name (T : Test) return String is abstract;
-- Return the name of the test.
--
-- Types derived from the Test type are required to overwrite
-- this procedure.
procedure Run (T : in out Test;
Listener : in out Listeners.Result_Listener'Class);
-- Run the test and place the test result to Result.
--
-- Calls Run (T, Listener, Timeout) with Timeout value 0.0.
procedure Run (T : in out Test;
Listener : in out Listeners.Result_Listener'Class;
Timeout : Test_Duration)
is abstract;
-- Run the test and place the test result to Result.
-- Timeout specifies the maximum runtime for a single test.
--
-- Types derived from the Test type are required to overwrite
-- this procedure.
procedure Run (T : in out Test;
Test_Name : String;
Listener : in out Listeners.Result_Listener'Class);
-- Run the test and place the test result to Result.
--
-- Calls Run (T, Test_Name, Listener, Timeout) with Timeout value 0.0.
procedure Run (T : in out Test;
Test_Name : String;
Listener : in out Listeners.Result_Listener'Class;
Timeout : Test_Duration)
is abstract;
-- Run the test with given name and place the test result to Result.
-- Timeout specifies the maximum runtime for a single test.
-- Notice: If multiple tests have same name this might call all of
-- them.
--
-- Types derived from the Test type are required to overwrite
-- this procedure.
function Test_Count (T : Test) return Test_Count_Type is abstract;
-- Return the amount of tests (test routines) which will be executed when
-- the Run (T) procedure is called.
function Test_Count (T : Test; Test_Name : String)
return Test_Count_Type is abstract;
-- Return the amount of tests (test routines) which will be executed when
-- the Run (T, Test_Name) procedure is called.
procedure Execute (T : in out Test'Class;
Listener : in out Listeners.Result_Listener'Class;
Timeout : Test_Duration);
-- Call Test class' Run method and place the test outcome to Result.
-- The procedure calls Start_Test of every listener before calling
-- the Run procedure and End_Test after calling the Run procedure.
--
-- This procedure is meant to be called from Runner package(s).
-- There should be no need for other to use this.
procedure Execute (T : in out Test'Class;
Test_Name : String;
Listener : in out Listeners.Result_Listener'Class;
Timeout : Test_Duration);
-- Same as Execute above, but call the Run procedure which
-- takes Test_Name parameter.
type Test_Case is abstract new Test with private;
-- The base type for other test cases.
function Get_Name (T : Test_Case) return String;
-- Return the name of the test case.
procedure Run (T : in out Test_Case;
Listener : in out Listeners.Result_Listener'Class;
Timeout : Test_Duration);
-- Run Test_Case's test routines.
procedure Run (T : in out Test_Case;
Test_Name : String;
Listener : in out Listeners.Result_Listener'Class;
Timeout : Test_Duration);
-- Run Test_Case's test routine which matches to the Name.
function Test_Count (T : Test_Case) return Test_Count_Type;
-- Implementation of Test_Count (T : Test).
function Test_Count (T : Test_Case; Test_Name : String)
return Test_Count_Type;
-- Implementation of Test_Count (T : Test, Test_Name : String).
procedure Finalize (T : in out Test_Case);
-- Finalize procedure of the Test_Case.
procedure Set_Name (T : in out Test_Case; Name : String);
-- Set Test_Case's name.
--
-- If longer than 160 characters, the name is truncated
-- to 160 characters.
type Object_Test_Routine_Access is
access procedure (T : in out Test_Case'Class);
-- A pointer to a test routine which takes Test_Case'Class object
-- as an argument.
--
-- For this kind of test routines, the framework will
-- call Set_Up and Tear_Down routines before and after
-- test routine execution.
type Simple_Test_Routine_Access is access procedure;
-- A pointer to a test routine which does not take arguments.
procedure Add_Test_Routine (T : in out Test_Case'Class;
Routine : Object_Test_Routine_Access;
Name : String);
-- Register a test routine to the Test_Case object.
--
-- The routine must have signature
-- "procedure R (T : in out Test_Case'Class)".
procedure Add_Test_Routine (T : in out Test_Case'Class;
Routine : Simple_Test_Routine_Access;
Name : String);
-- Register a simple test routine to the Test_Case.
--
-- The routine must have signature
-- "procedure R".
type Test_Suite is new Test with private;
-- A collection of Tests.
--
-- You can either fill a Test_Suite object with Test_Case objects
-- or nest multiple Test_Suite objects. You can even mix
-- Test_Case and Test_Suite objects, if necessary.
type Test_Suite_Access is access all Test_Suite;
function Create_Suite (Suite_Name : String)
return Test_Suite_Access;
-- Create a new Test_Suite.
-- Caller must free the returned Test_Suite using Release_Suite.
function Create_Suite (Suite_Name : String)
return Test_Suite;
-- Create a new Test_Suite. The suite and its children are
-- released automatically.
procedure Add_Test (Suite : in out Test_Suite; T : Test_Class_Access);
-- Add a Test to the suite. The suite frees the Test automatically
-- when it is no longer needed.
procedure Add_Test (Suite : in out Test_Suite; T : Test_Suite_Access);
-- Add a Test suite to the suite. The suite frees the Test automatically
-- when it is no longer needed.
--
-- This is a helper function, which internally calls
-- Add_Test (Suite : in out Test_Suite; T : Test_Class_Access).
procedure Add_Static_Test
(Suite : in out Test_Suite; T : Test'Class);
-- Add a Test to the suite. This procedure is meant for statically
-- allocated Test_Case objects.
--
-- Please note, that a copy of the Test'Class object is saved to
-- the suite. Original test object is not modified and changes
-- made to it after adding the test are not propagated to
-- the added object.
function Get_Name (T : Test_Suite) return String;
-- Return the name of Test_Suite.
procedure Run (T : in out Test_Suite;
Listener : in out Listeners.Result_Listener'Class;
Timeout : Test_Duration);
-- Run Test_Suite's Test_Cases.
procedure Run (T : in out Test_Suite;
Test_Name : String;
Listener : in out Listeners.Result_Listener'Class;
Timeout : Test_Duration);
-- Run test suite's child which matches to the given name.
function Test_Count (T : Test_Suite) return Test_Count_Type;
-- Implementation of Test_Count (T : Test).
function Test_Count (T : Test_Suite; Test_Name : String)
return Test_Count_Type;
-- Implementation of Test_Count (T : Test, Test_Name : String).
procedure Adjust (T : in out Test_Suite);
-- Adjust procedure of Test_Suite.
-- Handles the copying of the structure properly
procedure Finalize (T : in out Test_Suite);
-- Finalize procedure of Test_Suite. Frees all added Tests.
procedure Release_Suite (T : Test_Suite_Access);
-- Release the memory of Test_Suite.
-- All added tests are released automatically.
private
type Command_Object_Enum is (SIMPLE, OBJECT);
type Test_Command (Command_Kind : Command_Object_Enum := SIMPLE) is record
Name : AStrings.Bounded_String;
case Command_Kind is
when SIMPLE =>
Simple_Routine : Simple_Test_Routine_Access;
when OBJECT =>
Object_Routine : Object_Test_Routine_Access;
end case;
end record;
-- Name attribute tells the name of the test routine.
procedure Run (Command : Test_Command; T : in out Test_Case'Class);
-- Run the specified command.
-- Calls Set_Up and Tear_Down if necessary.
package Test_Command_List is
new Ahven.SList (Element_Type => Test_Command);
type Test_Case is abstract new Test with record
Routines : Test_Command_List.List := Test_Command_List.Empty_List;
Name : AStrings.Bounded_String := AStrings.Null_Bounded_String;
end record;
-- Our test case type. It holds a list of test routines
-- (test command objects) and the name of the test case.
procedure Run_Command (Command : Test_Command;
Info : Listeners.Context;
Timeout : Test_Duration;
Listener : in out Listeners.Result_Listener'Class;
T : in out Test_Case'Class);
-- Handle dispatching to the right Run (Command : Test_Command)
-- procedure and record test routine result to the Result object.
--
-- Timeout parameter defines the longest time the test is allowed
-- to run. Value 0.0 means infinite time.
type Test_Class_Wrapper is record
Ptr : Test_Class_Access;
end record;
package Test_List is
new Ahven.SList (Element_Type => Test_Class_Wrapper);
package Indefinite_Test_List is
type List is new Ada.Finalization.Controlled with private;
Empty_List : constant List;
procedure Append (Target : in out List; Node_Data : Test'Class);
-- Append an element at the end of the list.
procedure Clear (Target : in out List);
-- Remove all elements from the list.
generic
with procedure Action (T : in out Test'Class) is <>;
procedure For_Each (Target : List);
-- A generic procedure for walk through every item
-- in the list and call Action procedure for them.
private
type Node;
type Node_Access is access Node;
procedure Remove (Ptr : Node_Access);
-- A procedure to release memory pointed by Ptr.
type Node is record
Next : Node_Access := null;
Data : Test_Class_Access := null;
end record;
type List is new Ada.Finalization.Controlled with record
First : Node_Access := null;
Last : Node_Access := null;
end record;
procedure Initialize (Target : in out List);
procedure Finalize (Target : in out List);
procedure Adjust (Target : in out List);
Empty_List : constant List :=
(Ada.Finalization.Controlled with First => null,
Last => null);
end Indefinite_Test_List;
type Test_Suite is new Test with record
Suite_Name : AStrings.Bounded_String := AStrings.Null_Bounded_String;
Test_Cases : Test_List.List := Test_List.Empty_List;
Static_Test_Cases : Indefinite_Test_List.List :=
Indefinite_Test_List.Empty_List;
end record;
-- A suite type which holds a list of test cases and the name
-- of the suite.
end Ahven.Framework;
| 37.770492 | 77 | 0.65842 |
1e5207bb93b9a773eb23ef459c88a0c08a49ec58 | 379 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/atomic1.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/atomic1.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/atomic1.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
-- { dg-options "-O0 -fdump-tree-gimple" }
with Atomic1_Pkg; use Atomic1_Pkg;
procedure Atomic1 is
C_16 : constant R16 := (2, 3, 5, 7);
C_32 : constant R32 := (1, 1, 2, 3, 5, 8, 13, 5);
begin
V_16 := C_16;
V_32 := C_32;
end;
-- { dg-final { scan-tree-dump-times "v_16" 1 "gimple"} }
-- { dg-final { scan-tree-dump-times "v_32" 1 "gimple"} }
| 21.055556 | 57 | 0.583113 |
195ede886f428c992b4cd46f1c319cc564f1d347 | 402 | ads | Ada | tools/SPARK2005/packages/polypaver/pp_f_elementary.ads | michalkonecny/polypaver | 7a1541a85523f5ecbef44b7f5e09680d9a5c1ca6 | [
"BSD-3-Clause"
] | 1 | 2015-07-01T14:50:00.000Z | 2015-07-01T14:50:00.000Z | tools/SPARK2005/packages/polypaver/pp_f_elementary.ads | michalkonecny/polypaver | 7a1541a85523f5ecbef44b7f5e09680d9a5c1ca6 | [
"BSD-3-Clause"
] | null | null | null | tools/SPARK2005/packages/polypaver/pp_f_elementary.ads | michalkonecny/polypaver | 7a1541a85523f5ecbef44b7f5e09680d9a5c1ca6 | [
"BSD-3-Clause"
] | null | null | null | -- A SPARK wrapper for some elementary functions.
-- The PolyPaver SPARK pre-processor will replace any call
-- of these functions with their equivalent from package
-- PP_F_Rounded, supplying a value for the additional Prec parameter.
package PP_F_Elementary is
function Pi return Float;
function Exp (X : Float) return Float;
function Sqrt (X : Float) return Float;
end PP_F_Elementary;
| 28.714286 | 69 | 0.766169 |
304c8ff911da11f1518b7d4d6587a82dc4991dca | 2,858 | ads | Ada | tools/scitools/conf/understand/ada/ada12/a-einuoc.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/a-einuoc.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/a-einuoc.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . E X C E P T I O N S . I S _ N U L L _ O C C U R R E N C E --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-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. --
-- --
-- --
-- --
-- --
-- --
-- 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 a GNAT-specific child function of Ada.Exceptions. It provides
-- clearly missing functionality for its parent package, and most reasonably
-- would simply be an added function to that package, but this change cannot
-- be made in a conforming manner.
function Ada.Exceptions.Is_Null_Occurrence
(X : Exception_Occurrence) return Boolean;
pragma Preelaborate (Ada.Exceptions.Is_Null_Occurrence);
-- This function yields True if X is Null_Occurrence, and False otherwise
| 69.707317 | 78 | 0.385584 |
1907e0498637d8bab3989f18f1e166b85db69365 | 5,992 | ads | Ada | arch/ARM/cortex_m/src/cm4f/cortex_m_svd-dwt.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/cortex_m/src/cm4f/cortex_m_svd-dwt.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/cortex_m/src/cm4f/cortex_m_svd-dwt.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | -- This spec has been automatically generated from cm4f.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
-- Data Watchpoint Trace
package Cortex_M_SVD.DWT is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CTRL_POSTPRESET_Field is HAL.UInt4;
subtype CTRL_POSTINIT_Field is HAL.UInt4;
subtype CTRL_SYNCTAP_Field is HAL.UInt2;
subtype CTRL_Reserved_13_15_Field is HAL.UInt3;
subtype CTRL_NUMCOMP_Field is HAL.UInt4;
-- Control Register
type CTRL_Register is record
-- enable cycle counter
CYCCNTENA : Boolean := False;
-- ???
POSTPRESET : CTRL_POSTPRESET_Field := 16#0#;
-- ???
POSTINIT : CTRL_POSTINIT_Field := 16#0#;
-- ???
CYCTAP : Boolean := False;
-- ???
SYNCTAP : CTRL_SYNCTAP_Field := 16#0#;
-- enable POSTCNT as timer for PC sample packets
PCSAMPLENA : Boolean := False;
-- Reserved bits 13..15
Reserved_13_15 : CTRL_Reserved_13_15_Field := 16#0#;
-- enable interrupt event tracing
EXCTRCENA : Boolean := False;
-- enable CPI count event
CPIEVTENA : Boolean := False;
-- enable interrupt overhead event
EXCEVTENA : Boolean := False;
-- enable Sleep count event
SLEEPEVTENA : Boolean := False;
-- enable Load Store Unit (LSU) count event
LSUEVTENA : Boolean := False;
-- enable Folded instruction count event
FOLDEVTENA : Boolean := False;
-- enable Cycle count event
CYCEVTENA : Boolean := False;
-- Read-only. Reserved bit 23
Reserved_23 : Boolean := False;
-- No profiling counters
NOPRFCNT : Boolean := False;
-- No cycle counter
NOCYCCNT : Boolean := False;
-- No external match signals
NOEXTTRIG : Boolean := False;
-- No trace sampling and exception tracing
NOTRCPKT : Boolean := False;
-- Number of comparators
NUMCOMP : CTRL_NUMCOMP_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CTRL_Register use record
CYCCNTENA at 0 range 0 .. 0;
POSTPRESET at 0 range 1 .. 4;
POSTINIT at 0 range 5 .. 8;
CYCTAP at 0 range 9 .. 9;
SYNCTAP at 0 range 10 .. 11;
PCSAMPLENA at 0 range 12 .. 12;
Reserved_13_15 at 0 range 13 .. 15;
EXCTRCENA at 0 range 16 .. 16;
CPIEVTENA at 0 range 17 .. 17;
EXCEVTENA at 0 range 18 .. 18;
SLEEPEVTENA at 0 range 19 .. 19;
LSUEVTENA at 0 range 20 .. 20;
FOLDEVTENA at 0 range 21 .. 21;
CYCEVTENA at 0 range 22 .. 22;
Reserved_23 at 0 range 23 .. 23;
NOPRFCNT at 0 range 24 .. 24;
NOCYCCNT at 0 range 25 .. 25;
NOEXTTRIG at 0 range 26 .. 26;
NOTRCPKT at 0 range 27 .. 27;
NUMCOMP at 0 range 28 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Data Watchpoint Trace
type DWT_Peripheral is record
-- Control Register
CTRL : aliased CTRL_Register;
-- Cycle Count Register
CYCCNT : aliased HAL.UInt32;
-- CPI Count Register
CPICNT : aliased HAL.UInt32;
-- Exception Overhead Count Register
EXCCNT : aliased HAL.UInt32;
-- Sleep Count Register
SLEEPCNT : aliased HAL.UInt32;
-- LSU Count Register
LSUCNT : aliased HAL.UInt32;
-- Folded-instruction Count Register
FOLDCNT : aliased HAL.UInt32;
-- Program Counter Sample Register
PCSR : aliased HAL.UInt32;
-- Comparator Register 0
COMP0 : aliased HAL.UInt32;
-- Mask Register 0
MASK0 : aliased HAL.UInt32;
-- Function Register 0
FUNCTION0 : aliased HAL.UInt32;
-- Reserved 0
RESERVED0 : aliased HAL.UInt32;
-- Comparator Register 1
COMP1 : aliased HAL.UInt32;
-- Mask Register 1
MASK1 : aliased HAL.UInt32;
-- Function Register 1
FUNCTION1 : aliased HAL.UInt32;
-- Reserved 1
RESERVED1 : aliased HAL.UInt32;
-- Comparator Register 2
COMP2 : aliased HAL.UInt32;
-- Mask Register 2
MASK2 : aliased HAL.UInt32;
-- Function Register 2
FUNCTION2 : aliased HAL.UInt32;
-- Reserved 2
RESERVED2 : aliased HAL.UInt32;
-- Comparator Register 3
COMP3 : aliased HAL.UInt32;
-- Mask Register 3
MASK3 : aliased HAL.UInt32;
-- Function Register 3
FUNCTION3 : aliased HAL.UInt32;
end record
with Volatile;
for DWT_Peripheral use record
CTRL at 16#0# range 0 .. 31;
CYCCNT at 16#4# range 0 .. 31;
CPICNT at 16#8# range 0 .. 31;
EXCCNT at 16#C# range 0 .. 31;
SLEEPCNT at 16#10# range 0 .. 31;
LSUCNT at 16#14# range 0 .. 31;
FOLDCNT at 16#18# range 0 .. 31;
PCSR at 16#1C# range 0 .. 31;
COMP0 at 16#20# range 0 .. 31;
MASK0 at 16#24# range 0 .. 31;
FUNCTION0 at 16#28# range 0 .. 31;
RESERVED0 at 16#2C# range 0 .. 31;
COMP1 at 16#30# range 0 .. 31;
MASK1 at 16#34# range 0 .. 31;
FUNCTION1 at 16#38# range 0 .. 31;
RESERVED1 at 16#3C# range 0 .. 31;
COMP2 at 16#40# range 0 .. 31;
MASK2 at 16#44# range 0 .. 31;
FUNCTION2 at 16#48# range 0 .. 31;
RESERVED2 at 16#4C# range 0 .. 31;
COMP3 at 16#50# range 0 .. 31;
MASK3 at 16#54# range 0 .. 31;
FUNCTION3 at 16#58# range 0 .. 31;
end record;
-- Data Watchpoint Trace
DWT_Periph : aliased DWT_Peripheral
with Import, Address => DWT_Base;
end Cortex_M_SVD.DWT;
| 33.47486 | 60 | 0.566923 |
1ee4e874354c67024fa33e98254e2c4c2b1e13c2 | 5,138 | ads | Ada | include/sf.ads | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | include/sf.ads | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | include/sf.ads | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | --//////////////////////////////////////////////////////////
-- //
-- // SFML - Simple and Fast Multimedia Library
-- // Copyright (C) 2007-2009 Laurent Gomila ([email protected])
-- //
-- // This software is provided 'as-is', without any express or implied warranty.
-- // In no event will the authors be held liable for any damages arising from the use of this software.
-- //
-- // Permission is granted to anyone to use this software for any purpose,
-- // including commercial applications, and to alter it and redistribute it freely,
-- // subject to the following restrictions:
-- //
-- // 1. The origin of this software must not be misrepresented;
-- // you must not claim that you wrote the original software.
-- // If you use this software in a product, an acknowledgment
-- // in the product documentation would be appreciated but is not required.
-- //
-- // 2. Altered source versions must be plainly marked as such,
-- // and must not be misrepresented as being the original software.
-- //
-- // 3. This notice may not be removed or altered from any source distribution.
-- //
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
-- SFML - Simple and Fast Multimedia Library
-- Copyright (C) 2007-2015 Laurent Gomila ([email protected])
-- This software is provided 'as-is', without any express or implied warranty.
-- In no event will the authors be held liable for any damages arising from the use of this software.
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it freely,
-- subject to the following restrictions:
-- 1. The origin of this software must not be misrepresented;
-- you must not claim that you wrote the original software.
-- If you use this software in a product, an acknowledgment
-- in the product documentation would be appreciated but is not required.
-- 2. Altered source versions must be plainly marked as such,
-- and must not be misrepresented as being the original software.
-- 3. This notice may not be removed or altered from any source distribution.
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
with Interfaces.C;
with System;
with Ada.Strings.Unbounded;
--/ @image ASFML_Logo.svg
--/ @summary
--/ ASFML: Ada binding to the SFML library
--/
--/ @description
--/ Root package of all the packages provided by SFML. Direct children are the
--/ SFML modules: Audio, Graphics, Network, System and Window.
package Sf is
--//////////////////////////////////////////////////////////
-- // Define the CSFML version
--//////////////////////////////////////////////////////////
Version_Major : constant := 2;
Version_Minor : constant := 5;
Version_Patch : constant := 0;
--//////////////////////////////////////////////////////////
-- // Define a portable boolean type
--//////////////////////////////////////////////////////////
type sfBool is new Boolean;
for sfBool'Size use Interfaces.C.Int'Size;
for sfBool use (False => 0, True => 1);
sfFalse : sfBool renames False;
sfTrue : sfBool renames True;
--//////////////////////////////////////////////////////////
-- // Define portable types
--//////////////////////////////////////////////////////////
-- // 8 bits integer types
type sfInt8 is range -128 .. 127;
for sfInt8'SIZE use 8;
type sfInt8_Ptr is access all sfInt8;
pragma Convention (C, sfInt8);
pragma Convention (C, sfInt8_Ptr);
type sfUint8 is mod 256;
for sfUint8'SIZE use 8;
type sfUint8_Ptr is access all sfUint8;
pragma Convention (C, sfUint8);
pragma Convention (C, sfUint8_Ptr);
-- // 16 bits integer types
type sfInt16 is new Interfaces.Integer_16;
type sfInt16_Ptr is access all sfInt16;
pragma Convention (C, sfInt16);
pragma Convention (C, sfInt16_Ptr);
type sfUint16 is mod 2 ** sfInt16'SIZE;
type sfUint16_Ptr is access all sfUint16;
pragma Convention (C, sfUint16);
pragma Convention (C, sfUint16_Ptr);
-- // 32 bits integer types
type sfInt32 is new Integer;
type sfInt32_Ptr is access all sfInt32;
pragma Convention (C, sfInt32);
pragma Convention (C, sfInt32_Ptr);
type sfUint32 is mod 2 ** sfInt32'SIZE;
type sfUint32_Ptr is access all sfUint32;
pragma Convention (C, sfUint32);
pragma Convention (C, sfUint32_Ptr);
-- // 64 bits integer types
type sfInt64 is new Interfaces.Integer_64;
type sfInt64_Ptr is access all sfInt64;
pragma Convention (C, sfInt64);
pragma Convention (C, sfInt64_Ptr);
type sfUint64 is new Interfaces.Unsigned_64;
type sfUint64_Ptr is access all sfUint64;
pragma Convention (C, sfUint64_Ptr);
-- // size_t
type sfSize_t is mod 2 ** Standard'ADDRESS_SIZE;
type sfSize_t_Ptr is access all sfSize_t;
pragma Convention (C, sfSize_t);
pragma Convention (C, sfSize_t_Ptr);
type sfArrayOfStrings is array (sfSize_t range <>) of
Ada.Strings.Unbounded.Unbounded_String;
end Sf;
| 38.631579 | 104 | 0.618529 |
1ec3f6397bdad06e169b8251a4a470c9a16a70ce | 10,480 | ads | Ada | source/streams/a-nateio.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/streams/a-nateio.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/streams/a-nateio.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- implementation unit
with Ada.IO_Exceptions;
with Ada.IO_Modes;
with Ada.Streams.Naked_Stream_IO.Standard_Files;
with System.Native_IO;
with System.Native_Text_IO;
package Ada.Naked_Text_IO is
-- the parameter Form
Default_Form : constant System.Native_Text_IO.Packed_Form := (
Stream_Form => Streams.Naked_Stream_IO.Default_Form,
External => IO_Modes.By_Target,
New_Line => IO_Modes.By_Target);
procedure Set (
Form : in out System.Native_Text_IO.Packed_Form;
Keyword : String;
Item : String);
function Pack (Form : String) return System.Native_Text_IO.Packed_Form;
procedure Unpack (
Form : System.Native_Text_IO.Packed_Form;
Result : out Streams.Naked_Stream_IO.Form_String;
Last : out Natural);
-- non-controlled
type Text_Type (<>) is limited private;
type Non_Controlled_File_Type is access all Text_Type;
procedure Create (
File : in out Non_Controlled_File_Type;
Mode : IO_Modes.File_Mode := IO_Modes.Out_File;
Name : String := "";
Form : System.Native_Text_IO.Packed_Form := Default_Form);
procedure Open (
File : in out Non_Controlled_File_Type;
Mode : IO_Modes.File_Mode;
Name : String;
Form : System.Native_Text_IO.Packed_Form := Default_Form);
procedure Close (
File : aliased in out Non_Controlled_File_Type;
Raise_On_Error : Boolean := True);
procedure Delete (File : aliased in out Non_Controlled_File_Type);
procedure Reset (
File : aliased in out Non_Controlled_File_Type;
Mode : IO_Modes.File_Mode);
function Mode (File : Non_Controlled_File_Type) return IO_Modes.File_Mode;
function Name (File : Non_Controlled_File_Type) return String;
function Form (File : Non_Controlled_File_Type)
return System.Native_Text_IO.Packed_Form;
function External (File : Non_Controlled_File_Type)
return IO_Modes.File_External;
pragma Inline (External);
function Is_Open (File : Non_Controlled_File_Type) return Boolean;
pragma Inline (Is_Open);
procedure Flush (File : Non_Controlled_File_Type);
procedure Set_Size (
File : Non_Controlled_File_Type;
Line_Length, Page_Length : Natural);
procedure Set_Line_Length (File : Non_Controlled_File_Type; To : Natural);
procedure Set_Page_Length (File : Non_Controlled_File_Type; To : Natural);
procedure Size (
File : Non_Controlled_File_Type;
Line_Length, Page_Length : out Natural);
function Line_Length (File : Non_Controlled_File_Type) return Natural;
function Page_Length (File : Non_Controlled_File_Type) return Natural;
pragma Inline (Line_Length);
pragma Inline (Page_Length);
procedure New_Line (
File : Non_Controlled_File_Type;
Spacing : Positive := 1);
procedure Skip_Line (
File : Non_Controlled_File_Type;
Spacing : Positive := 1);
function End_Of_Line (File : Non_Controlled_File_Type) return Boolean;
procedure New_Page (File : Non_Controlled_File_Type);
procedure Skip_Page (File : Non_Controlled_File_Type);
function End_Of_Page (File : Non_Controlled_File_Type) return Boolean;
function End_Of_File (File : Non_Controlled_File_Type) return Boolean;
procedure Set_Col (File : Non_Controlled_File_Type; To : Positive);
procedure Set_Line (File : Non_Controlled_File_Type; To : Positive);
procedure Position (
File : Non_Controlled_File_Type;
Col, Line : out Positive);
function Col (File : Non_Controlled_File_Type) return Positive;
function Line (File : Non_Controlled_File_Type) return Positive;
function Page (File : Non_Controlled_File_Type) return Positive;
pragma Inline (Col);
pragma Inline (Line);
pragma Inline (Page);
procedure Get (
File : Non_Controlled_File_Type;
Item : out Character);
procedure Get (
File : Non_Controlled_File_Type;
Item : out Wide_Character);
procedure Get (
File : Non_Controlled_File_Type;
Item : out Wide_Wide_Character);
procedure Put (
File : Non_Controlled_File_Type;
Item : Character);
procedure Put (
File : Non_Controlled_File_Type;
Item : Wide_Character);
procedure Put (
File : Non_Controlled_File_Type;
Item : Wide_Wide_Character);
procedure Look_Ahead (
File : Non_Controlled_File_Type;
Item : out Character;
End_Of_Line : out Boolean);
procedure Look_Ahead (
File : Non_Controlled_File_Type;
Item : out Wide_Character;
End_Of_Line : out Boolean);
procedure Look_Ahead (
File : Non_Controlled_File_Type;
Item : out Wide_Wide_Character;
End_Of_Line : out Boolean);
procedure Skip_Ahead (File : Non_Controlled_File_Type);
procedure Get_Immediate (
File : Non_Controlled_File_Type;
Item : out Character);
procedure Get_Immediate (
File : Non_Controlled_File_Type;
Item : out Wide_Character);
procedure Get_Immediate (
File : Non_Controlled_File_Type;
Item : out Wide_Wide_Character);
procedure Get_Immediate (
File : Non_Controlled_File_Type;
Item : out Character;
Available : out Boolean);
procedure Get_Immediate (
File : Non_Controlled_File_Type;
Item : out Wide_Character;
Available : out Boolean);
procedure Get_Immediate (
File : Non_Controlled_File_Type;
Item : out Wide_Wide_Character;
Available : out Boolean);
-- handle of stream for non-controlled
procedure Open (
File : in out Non_Controlled_File_Type;
Mode : IO_Modes.File_Mode;
Stream : not null access Streams.Root_Stream_Type'Class;
Name : String := "";
Form : System.Native_Text_IO.Packed_Form := Default_Form);
function Stream (File : not null Non_Controlled_File_Type)
return not null access Streams.Root_Stream_Type'Class;
function Stream_IO (File : Non_Controlled_File_Type)
return not null
access Streams.Naked_Stream_IO.Non_Controlled_File_Type;
pragma Inline (Stream_IO);
function Terminal_Handle (File : Non_Controlled_File_Type)
return System.Native_IO.Handle_Type;
-- standard I/O
Standard_Input : constant Non_Controlled_File_Type;
Standard_Output : constant Non_Controlled_File_Type;
Standard_Error : constant Non_Controlled_File_Type;
-- exceptions
Status_Error : exception
renames IO_Exceptions.Status_Error;
Mode_Error : exception
renames IO_Exceptions.Mode_Error;
Use_Error : exception
renames IO_Exceptions.Use_Error;
Device_Error : exception
renames IO_Exceptions.Device_Error;
End_Error : exception
renames IO_Exceptions.End_Error;
Data_Error : exception
renames IO_Exceptions.Data_Error;
Layout_Error : exception
renames IO_Exceptions.Layout_Error;
private
type Virtual_Mark_Type is (None, EOP, EOP_EOF, EOF);
pragma Discard_Names (Virtual_Mark_Type);
type Text_Type is record -- "limited" prevents No_Elaboration_Code
Stream : System.Address := -- access Streams.Root_Stream_Type'Class
System.Null_Address;
File : aliased Streams.Naked_Stream_IO.Non_Controlled_File_Type;
Name : System.Native_IO.Name_Pointer; -- used when File is not assigned
Line : Natural := 1;
Page : Natural := 1;
Col : Natural := 1;
Line_Length : Natural := 0;
Page_Length : Natural := 0;
Last : Natural := 0;
Ahead_Last : Natural := 0; -- one-character Length, only In_File mode
Ahead_Col : Natural := 0; -- one-character Col
Looked_Ahead_Last : Natural := 0;
Looked_Ahead_Second : String (1 .. 3); -- second of surrogate pair
Buffer : System.Native_Text_IO.Buffer_Type;
End_Of_File : Boolean := False;
Virtual_Mark : Virtual_Mark_Type := None;
Mode : IO_Modes.File_Mode;
External : IO_Modes.File_External;
New_Line : IO_Modes.File_New_Line;
end record;
pragma Suppress_Initialization (Text_Type);
Standard_Input_Text : aliased Text_Type := (
Stream => System.Null_Address, -- be overwritten
File => Streams.Naked_Stream_IO.Standard_Files.Standard_Input,
Name => null,
Line => 1,
Page => 1,
Col => 1,
Line_Length => 0,
Page_Length => 0,
Last => 0,
Ahead_Last => 0,
Ahead_Col => 0,
Looked_Ahead_Last => 0,
Looked_Ahead_Second => (others => Character'Val (0)),
Buffer => (others => Character'Val (0)),
End_Of_File => False,
Virtual_Mark => None,
Mode => IO_Modes.In_File,
External => System.Native_Text_IO.Default_External, -- be overwritten
New_Line => System.Native_Text_IO.Default_New_Line);
Standard_Output_Text : aliased Text_Type := (
Stream => System.Null_Address, -- be overwritten
File => Streams.Naked_Stream_IO.Standard_Files.Standard_Output,
Name => null,
Line => 1,
Page => 1,
Col => 1,
Line_Length => 0,
Page_Length => 0,
Last => 0,
Ahead_Last => 0,
Ahead_Col => 0,
Looked_Ahead_Last => 0,
Looked_Ahead_Second => (others => Character'Val (0)),
Buffer => (others => Character'Val (0)),
End_Of_File => False,
Virtual_Mark => None,
Mode => IO_Modes.Out_File,
External => System.Native_Text_IO.Default_External, -- be overwritten
New_Line => System.Native_Text_IO.Default_New_Line);
Standard_Error_Text : aliased Text_Type := (
Stream => System.Null_Address, -- be overwritten
File => Streams.Naked_Stream_IO.Standard_Files.Standard_Error,
Name => null,
Line => 1,
Page => 1,
Col => 1,
Line_Length => 0,
Page_Length => 0,
Last => 0,
Ahead_Last => 0,
Ahead_Col => 0,
Looked_Ahead_Last => 0,
Looked_Ahead_Second => (others => Character'Val (0)),
Buffer => (others => Character'Val (0)),
End_Of_File => False,
Virtual_Mark => None,
Mode => IO_Modes.Out_File,
External => System.Native_Text_IO.Default_External, -- be overwritten
New_Line => System.Native_Text_IO.Default_New_Line);
Standard_Input : constant Non_Controlled_File_Type :=
Standard_Input_Text'Access;
Standard_Output : constant Non_Controlled_File_Type :=
Standard_Output_Text'Access;
Standard_Error : constant Non_Controlled_File_Type :=
Standard_Error_Text'Access;
end Ada.Naked_Text_IO;
| 33.482428 | 77 | 0.69208 |
5ed06737a0d953dea56792b7e53403c09c831457 | 4,133 | adb | Ada | src/geste-grid.adb | Fabien-Chouteau/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 13 | 2018-07-31T12:11:46.000Z | 2021-11-19T14:16:46.000Z | src/geste-grid.adb | gregkrsak/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 1 | 2018-10-22T21:41:59.000Z | 2018-10-22T21:41:59.000Z | src/geste-grid.adb | gregkrsak/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 4 | 2020-07-03T10:03:13.000Z | 2022-02-10T03:35:07.000Z | ------------------------------------------------------------------------------
-- --
-- GESTE --
-- --
-- Copyright (C) 2018 Fabien Chouteau --
-- --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package body GESTE.Grid is
-----------------
-- Update_Size --
-----------------
overriding
procedure Update_Size (This : in out Instance) is
begin
This.A_Width := This.Data'Length (1) * Tile_Size;
This.A_Height := This.Data'Length (2) * Tile_Size;
end Update_Size;
---------
-- Pix --
---------
overriding
function Pix (This : Instance;
X, Y : Integer)
return Output_Color
is
Tile_ID : Tile_Index;
C : Color_Index;
begin
Tile_ID := This.Data (This.Data'First (1) + (X / Tile_Size),
This.Data'First (2) + (Y / Tile_Size));
if Tile_ID = No_Tile then
return Transparent;
else
C := This.Bank.Tiles (Tile_ID) (X mod Tile_Size, Y mod Tile_Size);
return This.Bank.Palette (C);
end if;
end Pix;
--------------
-- Collides --
--------------
overriding
function Collides (This : Instance;
X, Y : Integer)
return Boolean
is
Tile_ID : Tile_Index;
begin
Tile_ID := This.Data (This.Data'First (1) + (X / Tile_Size),
This.Data'First (2) + (Y / Tile_Size));
if Tile_ID = No_Tile or else This.Bank.Collisions = null then
return False;
else
return This.Bank.Collisions (Tile_ID) (X mod Tile_Size,
Y mod Tile_Size);
end if;
end Collides;
end GESTE.Grid;
| 43.968085 | 78 | 0.474474 |
03fe45ec914a8d40cfdea6184588190ccd9626b5 | 3,647 | ads | Ada | source/amf/uml/amf-uml-reclassify_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-reclassify_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-reclassify_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.Reclassify_Object_Actions.Hash is
new AMF.Elements.Generic_Hash (UML_Reclassify_Object_Action, UML_Reclassify_Object_Action_Access);
| 72.94 | 100 | 0.408281 |
9a40c6f6be3def95f47a41220de50ad4f1a375f6 | 3,818 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-parame.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-parame.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-parame.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . P A R A M E T E R S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-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. --
-- --
-- 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 (used on all native platforms) version of this package
pragma Compiler_Unit_Warning;
package body System.Parameters is
-------------------------
-- Adjust_Storage_Size --
-------------------------
function Adjust_Storage_Size (Size : Size_Type) return Size_Type is
begin
if Size = Unspecified_Size then
return Default_Stack_Size;
elsif Size < Minimum_Stack_Size then
return Minimum_Stack_Size;
else
return Size;
end if;
end Adjust_Storage_Size;
------------------------
-- Default_Stack_Size --
------------------------
function Default_Stack_Size return Size_Type is
Default_Stack_Size : Integer;
pragma Import (C, Default_Stack_Size, "__gl_default_stack_size");
begin
if Default_Stack_Size = -1 then
return 2 * 1024 * 1024;
else
return Size_Type (Default_Stack_Size);
end if;
end Default_Stack_Size;
------------------------
-- Minimum_Stack_Size --
------------------------
function Minimum_Stack_Size return Size_Type is
begin
-- 12K is required for stack-checking to work reliably on most platforms
-- when using the GCC scheme to propagate an exception in the ZCX case.
-- 16K is the value of PTHREAD_STACK_MIN under Linux, so is a reasonable
-- default.
return 16 * 1024;
end Minimum_Stack_Size;
end System.Parameters;
| 46 | 79 | 0.459403 |
5ea3e636fbde7128ec41cbda2d55bf6660fecf8e | 5,096 | ads | Ada | source/amf/utp/amf-utp-test_objectives-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/utp/amf-utp-test_objectives-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/utp/amf-utp-test_objectives-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.Utp.Test_Objectives.Collections is
pragma Preelaborate;
package Utp_Test_Objective_Collections is
new AMF.Generic_Collections
(Utp_Test_Objective,
Utp_Test_Objective_Access);
type Set_Of_Utp_Test_Objective is
new Utp_Test_Objective_Collections.Set with null record;
Empty_Set_Of_Utp_Test_Objective : constant Set_Of_Utp_Test_Objective;
type Ordered_Set_Of_Utp_Test_Objective is
new Utp_Test_Objective_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_Utp_Test_Objective : constant Ordered_Set_Of_Utp_Test_Objective;
type Bag_Of_Utp_Test_Objective is
new Utp_Test_Objective_Collections.Bag with null record;
Empty_Bag_Of_Utp_Test_Objective : constant Bag_Of_Utp_Test_Objective;
type Sequence_Of_Utp_Test_Objective is
new Utp_Test_Objective_Collections.Sequence with null record;
Empty_Sequence_Of_Utp_Test_Objective : constant Sequence_Of_Utp_Test_Objective;
private
Empty_Set_Of_Utp_Test_Objective : constant Set_Of_Utp_Test_Objective
:= (Utp_Test_Objective_Collections.Set with null record);
Empty_Ordered_Set_Of_Utp_Test_Objective : constant Ordered_Set_Of_Utp_Test_Objective
:= (Utp_Test_Objective_Collections.Ordered_Set with null record);
Empty_Bag_Of_Utp_Test_Objective : constant Bag_Of_Utp_Test_Objective
:= (Utp_Test_Objective_Collections.Bag with null record);
Empty_Sequence_Of_Utp_Test_Objective : constant Sequence_Of_Utp_Test_Objective
:= (Utp_Test_Objective_Collections.Sequence with null record);
end AMF.Utp.Test_Objectives.Collections;
| 55.391304 | 88 | 0.524529 |
5e7a2d7a371a1e99ceaba1a0e5536d0c8779c3c7 | 2,598 | ads | Ada | ada/core/agar-config.ads | charlesdaniels/libagar | 099ce716e2ca01a7904b23f22610bf589295f5b5 | [
"BSD-2-Clause"
] | 1 | 2019-09-17T20:20:42.000Z | 2019-09-17T20:20:42.000Z | ada/core/agar-config.ads | kalatestimine/libagar | f830265ad00a82d4cddd8b59943bd3887ebb1486 | [
"BSD-2-Clause"
] | null | null | null | ada/core/agar-config.ads | kalatestimine/libagar | f830265ad00a82d4cddd8b59943bd3887ebb1486 | [
"BSD-2-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- AGAR CORE LIBRARY --
-- A G A R . C O N F I G --
-- S p e c --
-- --
-- Copyright (c) 2018, Julien Nadeau Carriere ([email protected]) --
-- Copyright (c) 2010, coreland ([email protected]) --
-- --
-- Permission to use, copy, modify, and/or distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
with Interfaces.C;
with Interfaces.C.Strings;
--
-- Interface to Agar "application preferences" object. For a list of the
-- built-in settings, see AG_Config(3), "CONFIGURATION PARAMETERS". Extra,
-- application-specific settings can be defined using Agar.Variable.
--
package Agar.Config is
function Load return Boolean;
-- Load previously saved configuration settings from the data directory.
function Save return Boolean;
-- Save configuration settings to the application data directory.
private
package C renames Interfaces.C;
package CS renames Interfaces.C.Strings;
function AG_ConfigFind
(Name : in CS.chars_ptr;
Dest_Path : in CS.chars_ptr;
Dest_Len : in C.size_t) return C.int
with Import, Convention => C, Link_Name => "AG_ConfigFind";
function AG_ConfigLoad return C.int
with Import, Convention => C, Link_Name => "AG_ConfigLoad";
function AG_ConfigSave return C.int
with Import, Convention => C, Link_Name => "AG_ConfigSave";
end Agar.Config;
| 47.236364 | 78 | 0.552348 |
5e85c4aff5731b74778b3bba41dc53e6b9a45a02 | 6,156 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-bignum.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-bignum.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-bignum.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . B I G N U M S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2012-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
with System.Generic_Bignums;
with System.Secondary_Stack; use System.Secondary_Stack;
with System.Shared_Bignums; use System.Shared_Bignums;
with System.Storage_Elements; use System.Storage_Elements;
package body System.Bignums is
function Allocate_Bignum (D : Digit_Vector; Neg : Boolean) return Bignum;
-- Allocate Bignum value with the given contents
procedure Free_Bignum (X : in out Bignum) is null;
-- No op when using the secondary stack
function To_Bignum (X : aliased in out Bignum) return Bignum is (X);
---------------------
-- Allocate_Bignum --
---------------------
function Allocate_Bignum (D : Digit_Vector; Neg : Boolean) return Bignum is
Addr : aliased Address;
begin
-- Note: The approach used here is designed to avoid strict aliasing
-- warnings that appeared previously using unchecked conversion.
SS_Allocate (Addr, Storage_Offset (4 + 4 * D'Length));
declare
B : Bignum;
for B'Address use Addr'Address;
pragma Import (Ada, B);
BD : Bignum_Data (D'Length);
for BD'Address use Addr;
pragma Import (Ada, BD);
-- Expose a writable view of discriminant BD.Len so that we can
-- initialize it. We need to use the exact layout of the record
-- to ensure that the Length field has 24 bits as expected.
type Bignum_Data_Header is record
Len : Length;
Neg : Boolean;
end record;
for Bignum_Data_Header use record
Len at 0 range 0 .. 23;
Neg at 3 range 0 .. 7;
end record;
BDH : Bignum_Data_Header;
for BDH'Address use BD'Address;
pragma Import (Ada, BDH);
pragma Assert (BDH.Len'Size = BD.Len'Size);
begin
BDH.Len := D'Length;
BDH.Neg := Neg;
B.D := D;
return B;
end;
end Allocate_Bignum;
package Sec_Stack_Bignums is new System.Generic_Bignums
(Bignum, Allocate_Bignum, Free_Bignum, To_Bignum);
function Big_Add (X, Y : Bignum) return Bignum
renames Sec_Stack_Bignums.Big_Add;
function Big_Sub (X, Y : Bignum) return Bignum
renames Sec_Stack_Bignums.Big_Sub;
function Big_Mul (X, Y : Bignum) return Bignum
renames Sec_Stack_Bignums.Big_Mul;
function Big_Div (X, Y : Bignum) return Bignum
renames Sec_Stack_Bignums.Big_Div;
function Big_Exp (X, Y : Bignum) return Bignum
renames Sec_Stack_Bignums.Big_Exp;
function Big_Mod (X, Y : Bignum) return Bignum
renames Sec_Stack_Bignums.Big_Mod;
function Big_Rem (X, Y : Bignum) return Bignum
renames Sec_Stack_Bignums.Big_Rem;
function Big_Neg (X : Bignum) return Bignum
renames Sec_Stack_Bignums.Big_Neg;
function Big_Abs (X : Bignum) return Bignum
renames Sec_Stack_Bignums.Big_Abs;
function Big_EQ (X, Y : Bignum) return Boolean
renames Sec_Stack_Bignums.Big_EQ;
function Big_NE (X, Y : Bignum) return Boolean
renames Sec_Stack_Bignums.Big_NE;
function Big_GE (X, Y : Bignum) return Boolean
renames Sec_Stack_Bignums.Big_GE;
function Big_LE (X, Y : Bignum) return Boolean
renames Sec_Stack_Bignums.Big_LE;
function Big_GT (X, Y : Bignum) return Boolean
renames Sec_Stack_Bignums.Big_GT;
function Big_LT (X, Y : Bignum) return Boolean
renames Sec_Stack_Bignums.Big_LT;
function Bignum_In_LLI_Range (X : Bignum) return Boolean
renames Sec_Stack_Bignums.Bignum_In_LLI_Range;
function To_Bignum (X : Long_Long_Integer) return Bignum
renames Sec_Stack_Bignums.To_Bignum;
function From_Bignum (X : Bignum) return Long_Long_Integer
renames Sec_Stack_Bignums.From_Bignum;
end System.Bignums;
| 41.04 | 78 | 0.556043 |
032b17a8b3c2c829e309c700b38456d3ace01953 | 1,553 | ads | Ada | 3-mid/impact/source/3d/collision/dispatch/impact-d3-collision-algorithm-activating.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/3d/collision/dispatch/impact-d3-collision-algorithm-activating.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/3d/collision/dispatch/impact-d3-collision-algorithm-activating.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with impact.d3.collision.Algorithm,
impact.d3.Object,
impact.d3.Dispatcher,
impact.d3.collision.manifold_Result;
package impact.d3.collision.Algorithm.activating
--
-- This class is not enabled yet (work-in-progress) to more aggressively activate objects.
--
is
type Item is abstract new impact.d3.collision.Algorithm.item with private;
procedure define (Self : in out Item; ci : in AlgorithmConstructionInfo;
colObj0, colObj1 : access impact.d3.Object.item'Class);
-- package Forge
-- is
-- function to_activating_Algorithm (ci : in AlgorithmConstructionInfo) return Item;
-- function to_activating_Algorithm (ci : in AlgorithmConstructionInfo;
-- colObj0, colObj1 : access impact.d3.Object.item'Class ) return Item;
-- end Forge;
overriding procedure destruct (Self : in out Item);
overriding function calculateTimeOfImpact (Self : in Item; body0, body1 : access impact.d3.Object.item'Class;
dispatchInfo : in impact.d3.Dispatcher.DispatcherInfo;
resultOut : access impact.d3.collision.manifold_Result.item) return math.Real;
private
type Item is abstract new impact.d3.collision.Algorithm.item with
record
null;
end record;
end impact.d3.collision.Algorithm.activating;
| 30.45098 | 135 | 0.602704 |
1efbb3dc2d1c762bc88c82930088f1a0e37b91c1 | 4,248 | ads | Ada | firehog/ncurses/Ada95/samples/sample-menu_demo-aux.ads | KipodAfterFree/KAF-2019-FireHog | 5f6ee3c3c3329459bc9daeabc1a16ff4619508d9 | [
"MIT"
] | null | null | null | firehog/ncurses/Ada95/samples/sample-menu_demo-aux.ads | KipodAfterFree/KAF-2019-FireHog | 5f6ee3c3c3329459bc9daeabc1a16ff4619508d9 | [
"MIT"
] | null | null | null | firehog/ncurses/Ada95/samples/sample-menu_demo-aux.ads | KipodAfterFree/KAF-2019-FireHog | 5f6ee3c3c3329459bc9daeabc1a16ff4619508d9 | [
"MIT"
] | 1 | 2019-12-26T10:18:16.000Z | 2019-12-26T10:18:16.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Menu_Demo.Aux --
-- --
-- S P E C --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer <[email protected]> 1996
-- Version Control
-- $Revision: 1.5 $
-- Binding Version 00.93
------------------------------------------------------------------------------
with Terminal_Interface.Curses; use Terminal_Interface.Curses;
with Terminal_Interface.Curses.Panels; use Terminal_Interface.Curses.Panels;
with Terminal_Interface.Curses.Menus; use Terminal_Interface.Curses.Menus;
package Sample.Menu_Demo.Aux is
procedure Geometry (M : in Menu;
L : out Line_Count;
C : out Column_Count;
Y : out Line_Position;
X : out Column_Position);
-- Calculate the geometry for a panel beeing able to be used to display
-- the menu.
function Create (M : Menu;
Title : String;
Lin : Line_Position;
Col : Column_Position) return Panel;
-- Create a panel decorated with a frame and the title at the specified
-- position. The dimension of the panel is derived from the menus layout.
procedure Destroy (M : in Menu;
P : in out Panel);
-- Destroy all the windowing structures associated with this menu and
-- panel.
function Get_Request (M : Menu; P : Panel) return Key_Code;
-- Centralized request driver for all menus in this sample. This
-- gives us a common key binding for all menus.
end Sample.Menu_Demo.Aux;
| 59 | 78 | 0.472458 |
3da0054beb2d1826806a9c0575b2e0d06a4ce148 | 4,151 | adb | Ada | firmware/coreboot/3rdparty/libgfxinit/common/skylake/hw-gfx-gma-plls.adb | fabiojna02/OpenCellular | 45b6a202d6b2e2485c89955b9a6da920c4d56ddb | [
"CC-BY-4.0",
"BSD-3-Clause"
] | 1 | 2019-11-04T07:11:25.000Z | 2019-11-04T07:11:25.000Z | firmware/coreboot/3rdparty/libgfxinit/common/skylake/hw-gfx-gma-plls.adb | aimin-wang/OpenCellular | 5308146bf7edf43cc81c0e4d15305b711117070a | [
"CC-BY-4.0",
"BSD-3-Clause"
] | 13 | 2018-10-12T21:29:09.000Z | 2018-10-25T20:06:51.000Z | firmware/coreboot/3rdparty/libgfxinit/common/skylake/hw-gfx-gma-plls.adb | aimin-wang/OpenCellular | 5308146bf7edf43cc81c0e4d15305b711117070a | [
"CC-BY-4.0",
"BSD-3-Clause"
] | null | null | null | --
-- Copyright (C) 2015-2016 secunet Security Networks AG
--
-- 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 2 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.
--
with HW.GFX.GMA.PLLs.DPLL_0;
with HW.GFX.GMA.PLLs.DPLL;
with HW.Debug;
with GNAT.Source_Info;
package body HW.GFX.GMA.PLLs
with
Refined_State => (State => PLLs)
is
type Count_Range is new Natural range 0 .. 2;
type PLL_State is record
Use_Count : Count_Range;
Used_For_DP : Boolean;
Link_Rate : DP_Bandwidth;
Mode : Mode_Type;
end record;
type PLL_State_Array is array (Configurable_DPLLs) of PLL_State;
PLLs : PLL_State_Array;
procedure Initialize
is
begin
PLLs :=
(Configurable_DPLLs =>
(Use_Count => 0,
Used_For_DP => False,
Link_Rate => DP_Bandwidth'First,
Mode => Invalid_Mode));
end Initialize;
procedure Alloc_Configurable
(Port_Cfg : in Port_Config;
PLL : out T;
Success : out Boolean)
with
Pre => True
is
function Config_Matches (PE : PLL_State) return Boolean
is
begin
return
PE.Used_For_DP = (Port_Cfg.Display = DP) and
((PE.Used_For_DP and PE.Link_Rate = Port_Cfg.DP.Bandwidth) or
(not PE.Used_For_DP and PE.Mode = Port_Cfg.Mode));
end Config_Matches;
begin
-- try to find shareable PLL
for P in Configurable_DPLLs loop
Success := PLLs (P).Use_Count /= 0 and
PLLs (P).Use_Count /= Count_Range'Last and
Config_Matches (PLLs (P));
if Success then
PLL := P;
PLLs (PLL).Use_Count := PLLs (PLL).Use_Count + 1;
return;
end if;
end loop;
-- try to find free PLL
for P in Configurable_DPLLs loop
if PLLs (P).Use_Count = 0 then
PLL := P;
DPLL.On (PLL, Port_Cfg, Success);
if Success then
PLLs (PLL) :=
(Use_Count => 1,
Used_For_DP => Port_Cfg.Display = DP,
Link_Rate => Port_Cfg.DP.Bandwidth,
Mode => Port_Cfg.Mode);
end if;
return;
end if;
end loop;
PLL := Invalid;
end Alloc_Configurable;
procedure Alloc
(Port_Cfg : in Port_Config;
PLL : out T;
Success : out Boolean)
is
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
if Port_Cfg.Port = DIGI_A then
DPLL_0.Check_Link_Rate (Port_Cfg.DP.Bandwidth, Success);
else
Success := False;
end if;
if Success then
PLL := DPLL0;
else
Alloc_Configurable (Port_Cfg, PLL, Success);
end if;
end Alloc;
procedure Free (PLL : T)
is
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
if PLL in Configurable_DPLLs then
if PLLs (PLL).Use_Count /= 0 then
PLLs (PLL).Use_Count := PLLs (PLL).Use_Count - 1;
if PLLs (PLL).Use_Count = 0 then
DPLL.Off (PLL);
end if;
end if;
end if;
end Free;
procedure All_Off
is
begin
pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity));
for PLL in Configurable_DPLLs loop
DPLL.Off (PLL);
end loop;
end All_Off;
function Register_Value (PLL : T) return Word32
is
begin
return
(if PLL = DPLL0 then DPLL_0.Register_Value
elsif PLL in Configurable_DPLLs then DPLL.Register_Value (PLL)
else 0);
end Register_Value;
end HW.GFX.GMA.PLLs;
| 27.130719 | 73 | 0.585401 |
0369b49de896be55bb16a07082603df295436db5 | 812 | ads | Ada | stm32f4/stm32gd-exti-irq.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | stm32f4/stm32gd-exti-irq.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | stm32f4/stm32gd-exti-irq.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | with STM32_SVD.Interrupts; use STM32_SVD.Interrupts;
with STM32_SVD.EXTI;
package STM32GD.EXTI.IRQ is
protected IRQ_Handler is
entry Wait;
procedure Cancel;
function Status (Line : External_Line_Number) return Boolean;
procedure Reset_Status (Line : External_Line_Number);
procedure Handler;
pragma Attach_Handler (Handler, EXTI0);
pragma Attach_Handler (Handler, EXTI1);
pragma Attach_Handler (Handler, EXTI2);
pragma Attach_Handler (Handler, EXTI3);
pragma Attach_Handler (Handler, EXTI4);
pragma Attach_Handler (Handler, EXTI9_5);
pragma Attach_Handler (Handler, EXTI15_10);
private
EXTI_Status : STM32_SVD.EXTI.PR_Register;
Cancelled : Boolean;
Triggered : Boolean;
end IRQ_Handler;
end STM32GD.EXTI.IRQ;
| 30.074074 | 67 | 0.711823 |
a0b5879048ab8d0fa783d88a29ca1ac59416f261 | 49,385 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-taskin.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-taskin.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-taskin.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 --
-- --
-- S Y S T E M . T A S K I N G --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides necessary type definitions for compiler interface
-- Note: the compiler generates direct calls to this interface, via Rtsfind.
-- Any changes to this interface may require corresponding compiler changes.
with Ada.Exceptions;
with Ada.Unchecked_Conversion;
with System.Parameters;
with System.Task_Info;
with System.Soft_Links;
with System.Task_Primitives;
with System.Stack_Usage;
with System.Multiprocessors;
package System.Tasking is
pragma Preelaborate;
-------------------
-- Locking Rules --
-------------------
-- The following rules must be followed at all times, to prevent
-- deadlock and generally ensure correct operation of locking.
-- Never lock a lock unless abort is deferred
-- Never undefer abort while holding a lock
-- Overlapping critical sections must be properly nested, and locks must
-- be released in LIFO order. E.g., the following is not allowed:
-- Lock (X);
-- ...
-- Lock (Y);
-- ...
-- Unlock (X);
-- ...
-- Unlock (Y);
-- Locks with lower (smaller) level number cannot be locked
-- while holding a lock with a higher level number. (The level
-- 1. System.Tasking.PO_Simple.Protection.L (any PO lock)
-- 2. System.Tasking.Initialization.Global_Task_Lock (in body)
-- 3. System.Task_Primitives.Operations.Single_RTS_Lock
-- 4. System.Tasking.Ada_Task_Control_Block.LL.L (any TCB lock)
-- Clearly, there can be no circular chain of hold-and-wait
-- relationships involving locks in different ordering levels.
-- We used to have Global_Task_Lock before Protection.L but this was
-- clearly wrong since there can be calls to "new" inside protected
-- operations. The new ordering prevents these failures.
-- Sometimes we need to hold two ATCB locks at the same time. To allow us
-- to order the locking, each ATCB is given a unique serial number. If one
-- needs to hold locks on two ATCBs at once, the lock with lower serial
-- number must be locked first. We avoid holding three or more ATCB locks,
-- because that can easily lead to complications that cause race conditions
-- and deadlocks.
-- We don't always need to check the serial numbers, since the serial
-- numbers are assigned sequentially, and so:
-- . The parent of a task always has a lower serial number.
-- . The activator of a task always has a lower serial number.
-- . The environment task has a lower serial number than any other task.
-- . If the activator of a task is different from the task's parent,
-- the parent always has a lower serial number than the activator.
---------------------------------
-- Task_Id related definitions --
---------------------------------
type Ada_Task_Control_Block;
type Task_Id is access all Ada_Task_Control_Block;
for Task_Id'Size use System.Task_Primitives.Task_Address_Size;
Null_Task : constant Task_Id;
type Task_List is array (Positive range <>) of Task_Id;
function Self return Task_Id;
pragma Inline (Self);
-- This is the compiler interface version of this function. Do not call
-- from the run-time system.
function To_Task_Id is
new Ada.Unchecked_Conversion
(System.Task_Primitives.Task_Address, Task_Id);
function To_Address is
new Ada.Unchecked_Conversion
(Task_Id, System.Task_Primitives.Task_Address);
-----------------------
-- Enumeration types --
-----------------------
type Task_States is
(Unactivated,
-- TCB initialized but not task has not been created.
-- It cannot be executing.
-- Activating,
-- -- ??? Temporarily at end of list for GDB compatibility
-- -- Task has been created and is being made Runnable.
-- Active states
-- For all states from here down, the task has been activated.
-- For all states from here down, except for Terminated, the task
-- may be executing.
-- Activator = null iff it has not yet completed activating.
Runnable,
-- Task is not blocked for any reason known to Ada.
-- (It may be waiting for a mutex, though.)
-- It is conceptually "executing" in normal mode.
Terminated,
-- The task is terminated, in the sense of ARM 9.3 (5).
-- Any dependents that were waiting on terminate
-- alternatives have been awakened and have terminated themselves.
Activator_Sleep,
-- Task is waiting for created tasks to complete activation
Acceptor_Sleep,
-- Task is waiting on an accept or select with terminate
-- Acceptor_Delay_Sleep,
-- -- ??? Temporarily at end of list for GDB compatibility
-- -- Task is waiting on an selective wait statement
Entry_Caller_Sleep,
-- Task is waiting on an entry call
Async_Select_Sleep,
-- Task is waiting to start the abortable part of an
-- asynchronous select statement.
Delay_Sleep,
-- Task is waiting on a select statement with only a delay
-- alternative open.
Master_Completion_Sleep,
-- Master completion has two phases.
-- In Phase 1 the task is sleeping in Complete_Master
-- having completed a master within itself,
-- and is waiting for the tasks dependent on that master to become
-- terminated or waiting on a terminate Phase.
Master_Phase_2_Sleep,
-- In Phase 2 the task is sleeping in Complete_Master
-- waiting for tasks on terminate alternatives to finish
-- terminating.
-- The following are special uses of sleep, for server tasks
-- within the run-time system.
Interrupt_Server_Idle_Sleep,
Interrupt_Server_Blocked_Interrupt_Sleep,
Timer_Server_Sleep,
AST_Server_Sleep,
Asynchronous_Hold,
-- The task has been held by Asynchronous_Task_Control.Hold_Task
Interrupt_Server_Blocked_On_Event_Flag,
-- The task has been blocked on a system call waiting for a
-- completion event/signal to occur.
Activating,
-- Task has been created and is being made Runnable
Acceptor_Delay_Sleep
-- Task is waiting on an selective wait statement
);
type Call_Modes is
(Simple_Call, Conditional_Call, Asynchronous_Call, Timed_Call);
type Select_Modes is (Simple_Mode, Else_Mode, Terminate_Mode, Delay_Mode);
subtype Delay_Modes is Integer;
-------------------------------
-- Entry related definitions --
-------------------------------
Null_Entry : constant := 0;
Max_Entry : constant := Integer'Last;
Interrupt_Entry : constant := -2;
Cancelled_Entry : constant := -1;
type Entry_Index is range Interrupt_Entry .. Max_Entry;
Null_Task_Entry : constant := Null_Entry;
Max_Task_Entry : constant := Max_Entry;
type Task_Entry_Index is new Entry_Index
range Null_Task_Entry .. Max_Task_Entry;
type Entry_Call_Record;
type Entry_Call_Link is access all Entry_Call_Record;
type Entry_Queue is record
Head : Entry_Call_Link;
Tail : Entry_Call_Link;
end record;
type Task_Entry_Queue_Array is
array (Task_Entry_Index range <>) of Entry_Queue;
-- A data structure which contains the string names of entries and entry
-- family members.
type String_Access is access all String;
----------------------------------
-- Entry_Call_Record definition --
----------------------------------
type Entry_Call_State is
(Never_Abortable,
-- the call is not abortable, and never can be
Not_Yet_Abortable,
-- the call is not abortable, but may become so
Was_Abortable,
-- the call is not abortable, but once was
Now_Abortable,
-- the call is abortable
Done,
-- the call has been completed
Cancelled
-- the call was asynchronous, and was cancelled
);
pragma Ordered (Entry_Call_State);
-- Never_Abortable is used for calls that are made in a abort deferred
-- region (see ARM 9.8(5-11), 9.8 (20)). Such a call is never abortable.
-- The Was_ vs. Not_Yet_ distinction is needed to decide whether it is OK
-- to advance into the abortable part of an async. select stmt. That is
-- allowed iff the mode is Now_ or Was_.
-- Done indicates the call has been completed, without cancellation, or no
-- call has been made yet at this ATC nesting level, and so aborting the
-- call is no longer an issue. Completion of the call does not necessarily
-- indicate "success"; the call may be returning an exception if
-- Exception_To_Raise is non-null.
-- Cancelled indicates the call was cancelled, and so aborting the call is
-- no longer an issue.
-- The call is on an entry queue unless State >= Done, in which case it may
-- or may not be still Onqueue.
-- Please do not modify the order of the values, without checking all uses
-- of this type. We rely on partial "monotonicity" of
-- Entry_Call_Record.State to avoid locking when we access this value for
-- certain tests. In particular:
-- 1) Once State >= Done, we can rely that the call has been
-- completed. If State >= Done, it will not
-- change until the task does another entry call at this level.
-- 2) Once State >= Was_Abortable, we can rely that the call has
-- been queued abortably at least once, and so the check for
-- whether it is OK to advance to the abortable part of an
-- async. select statement does not need to lock anything.
type Restricted_Entry_Call_Record is record
Self : Task_Id;
-- ID of the caller
Mode : Call_Modes;
State : Entry_Call_State;
pragma Atomic (State);
-- Indicates part of the state of the call.
--
-- Protection: If the call is not on a queue, it should only be
-- accessed by Self, and Self does not need any lock to modify this
-- field.
--
-- Once the call is on a queue, the value should be something other
-- than Done unless it is cancelled, and access is controller by the
-- "server" of the queue -- i.e., the lock of Checked_To_Protection
-- (Call_Target) if the call record is on the queue of a PO, or the
-- lock of Called_Target if the call is on the queue of a task. See
-- comments on type declaration for more details.
Uninterpreted_Data : System.Address;
-- Data passed by the compiler
Exception_To_Raise : Ada.Exceptions.Exception_Id;
-- The exception to raise once this call has been completed without
-- being aborted.
end record;
pragma Suppress_Initialization (Restricted_Entry_Call_Record);
-------------------------------------------
-- Task termination procedure definition --
-------------------------------------------
-- We need to redefine here these types (already defined in
-- Ada.Task_Termination) for avoiding circular dependencies.
type Cause_Of_Termination is (Normal, Abnormal, Unhandled_Exception);
-- Possible causes for task termination:
--
-- Normal means that the task terminates due to completing the
-- last sentence of its body, or as a result of waiting on a
-- terminate alternative.
-- Abnormal means that the task terminates because it is being aborted
-- handled_Exception means that the task terminates because of exception
-- raised by the execution of its task_body.
type Termination_Handler is access protected procedure
(Cause : Cause_Of_Termination;
T : Task_Id;
X : Ada.Exceptions.Exception_Occurrence);
-- Used to represent protected procedures to be executed when task
-- terminates.
------------------------------------
-- Dispatching domain definitions --
------------------------------------
-- We need to redefine here these types (already defined in
-- System.Multiprocessor.Dispatching_Domains) for avoiding circular
-- dependencies.
type Dispatching_Domain is
array (System.Multiprocessors.CPU range <>) of Boolean;
-- A dispatching domain needs to contain the set of processors belonging
-- to it. This is a processor mask where a True indicates that the
-- processor belongs to the dispatching domain.
-- Do not use the full range of CPU_Range because it would create a very
-- long array. This way we can use the exact range of processors available
-- in the system.
type Dispatching_Domain_Access is access Dispatching_Domain;
System_Domain : Dispatching_Domain_Access;
-- All processors belong to default system dispatching domain at start up.
-- We use a pointer which creates the actual variable for the reasons
-- explained bellow in Dispatching_Domain_Tasks.
Dispatching_Domains_Frozen : Boolean := False;
-- True when the main procedure has been called. Hence, no new dispatching
-- domains can be created when this flag is True.
type Array_Allocated_Tasks is
array (System.Multiprocessors.CPU range <>) of Natural;
-- At start-up time, we need to store the number of tasks attached to
-- concrete processors within the system domain (we can only create
-- dispatching domains with processors belonging to the system domain and
-- without tasks allocated).
type Array_Allocated_Tasks_Access is access Array_Allocated_Tasks;
Dispatching_Domain_Tasks : Array_Allocated_Tasks_Access;
-- We need to store whether there are tasks allocated to concrete
-- processors in the default system dispatching domain because we need to
-- check it before creating a new dispatching domain. Two comments about
-- why we use a pointer here and not in package Dispatching_Domains:
--
-- 1) We use an array created dynamically in procedure Initialize which
-- is called at the beginning of the initialization of the run-time
-- library. Declaring a static array here in the spec would not work
-- across different installations because it would get the value of
-- Number_Of_CPUs from the machine where the run-time library is built,
-- and not from the machine where the application is executed. That is
-- the reason why we create the array (CPU'First .. Number_Of_CPUs) at
-- execution time in the procedure body, ensuring that the function
-- Number_Of_CPUs is executed at execution time (the same trick as we
-- use for System_Domain).
--
-- 2) We have moved this declaration from package Dispatching_Domains
-- because when we use a pragma CPU, the affinity is passed through the
-- call to Create_Task. Hence, at this point, we may need to update the
-- number of tasks associated to the processor, but we do not want to
-- force a dependency from this package on Dispatching_Domains.
------------------------------------
-- Task related other definitions --
------------------------------------
type Activation_Chain is limited private;
-- Linked list of to-be-activated tasks, linked through
-- Activation_Link. The order of tasks on the list is irrelevant, because
-- the priority rules will ensure that they actually start activating in
-- priority order.
type Activation_Chain_Access is access all Activation_Chain;
type Task_Procedure_Access is access procedure (Arg : System.Address);
type Access_Boolean is access all Boolean;
function Detect_Blocking return Boolean;
pragma Inline (Detect_Blocking);
-- Return whether the Detect_Blocking pragma is enabled
function Storage_Size (T : Task_Id) return System.Parameters.Size_Type;
-- Retrieve from the TCB of the task the allocated size of its stack,
-- either the system default or the size specified by a pragma. This is in
-- general a non-static value that can depend on discriminants of the task.
type Bit_Array is array (Integer range <>) of Boolean;
pragma Pack (Bit_Array);
subtype Debug_Event_Array is Bit_Array (1 .. 16);
Global_Task_Debug_Event_Set : Boolean := False;
-- Set True when running under debugger control and a task debug event
-- signal has been requested.
----------------------------------------------
-- Ada_Task_Control_Block (ATCB) definition --
----------------------------------------------
-- Notes on protection (synchronization) of TRTS data structures
-- Any field of the TCB can be written by the activator of a task when the
-- task is created, since no other task can access the new task's
-- state until creation is complete.
-- The protection for each field is described in a comment starting with
-- "Protection:".
-- When a lock is used to protect an ATCB field, this lock is simply named
-- Some protection is described in terms of tasks related to the
-- ATCB being protected. These are:
-- Self: The task which is controlled by this ATCB
-- Acceptor: A task accepting a call from Self
-- Caller: A task calling an entry of Self
-- Parent: The task executing the master on which Self depends
-- Dependent: A task dependent on Self
-- Activator: The task that created Self and initiated its activation
-- Created: A task created and activated by Self
-- Note: The order of the fields is important to implement efficiently
-- tasking support under gdb.
-- Currently gdb relies on the order of the State, Parent, Base_Priority,
-- Task_Image, Task_Image_Len, Call and LL fields.
-------------------------
-- Common ATCB section --
-------------------------
-- Section used by all GNARL implementations (regular and restricted)
type Common_ATCB is limited record
State : Task_States;
pragma Atomic (State);
-- Encodes some basic information about the state of a task,
-- including whether it has been activated, whether it is sleeping,
-- and whether it is terminated.
--
-- Protection: Self.L
Parent : Task_Id;
-- The task on which this task depends.
-- See also Master_Level and Master_Within.
Base_Priority : System.Any_Priority;
-- Base priority, not changed during entry calls, only changed
-- via dynamic priorities package.
--
-- Protection: Only written by Self, accessed by anyone
Base_CPU : System.Multiprocessors.CPU_Range;
-- Base CPU, only changed via dispatching domains package.
--
-- Protection: Self.L
Current_Priority : System.Any_Priority;
-- Active priority, except that the effects of protected object
-- priority ceilings are not reflected. This only reflects explicit
-- priority changes and priority inherited through task activation
-- and rendezvous.
--
-- Ada 95 notes: In Ada 95, this field will be transferred to the
-- Priority field of an Entry_Calls component when an entry call is
-- initiated. The Priority of the Entry_Calls component will not change
-- for the duration of the call. The accepting task can use it to boost
-- its own priority without fear of its changing in the meantime.
--
-- This can safely be used in the priority ordering of entry queues.
-- Once a call is queued, its priority does not change.
--
-- Since an entry call cannot be made while executing a protected
-- action, the priority of a task will never reflect a priority ceiling
-- change at the point of an entry call.
--
-- Protection: Only written by Self, and only accessed when Acceptor
-- accepts an entry or when Created activates, at which points Self is
-- suspended.
Protected_Action_Nesting : Natural;
pragma Atomic (Protected_Action_Nesting);
-- The dynamic level of protected action nesting for this task. This
-- field is needed for checking whether potentially blocking operations
-- are invoked from protected actions. pragma Atomic is used because it
-- can be read/written from protected interrupt handlers.
Task_Image : String (1 .. System.Parameters.Max_Task_Image_Length);
-- Hold a string that provides a readable id for task, built from the
-- variable of which it is a value or component.
Task_Image_Len : Natural;
-- Actual length of Task_Image
Call : Entry_Call_Link;
-- The entry call that has been accepted by this task.
--
-- Protection: Self.L. Self will modify this field when Self.Accepting
-- is False, and will not need the mutex to do so. Once a task sets
-- Pending_ATC_Level = 0, no other task can access this field.
LL : aliased Task_Primitives.Private_Data;
-- Control block used by the underlying low-level tasking service
-- (GNULLI).
--
-- Protection: This is used only by the GNULLI implementation, which
-- takes care of all of its synchronization.
Task_Arg : System.Address;
-- The argument to task procedure. Provide a handle for discriminant
-- information.
--
-- Protection: Part of the synchronization between Self and Activator.
-- Activator writes it, once, before Self starts executing. Thereafter,
-- Self only reads it.
Task_Alternate_Stack : System.Address;
-- The address of the alternate signal stack for this task, if any
--
-- Protection: Only accessed by Self
Task_Entry_Point : Task_Procedure_Access;
-- Information needed to call the procedure containing the code for
-- the body of this task.
--
-- Protection: Part of the synchronization between Self and Activator.
-- Activator writes it, once, before Self starts executing. Self reads
-- it, once, as part of its execution.
Compiler_Data : System.Soft_Links.TSD;
-- Task-specific data needed by the compiler to store per-task
-- structures.
--
-- Protection: Only accessed by Self
All_Tasks_Link : Task_Id;
-- Used to link this task to the list of all tasks in the system
--
-- Protection: RTS_Lock
Activation_Link : Task_Id;
-- Used to link this task to a list of tasks to be activated
--
-- Protection: Only used by Activator
Activator : Task_Id;
pragma Atomic (Activator);
-- The task that created this task, either by declaring it as a task
-- object or by executing a task allocator. The value is null iff Self
-- has completed activation.
--
-- Protection: Set by Activator before Self is activated, and
-- only modified by Self after that. Can be read by any task via
-- Ada.Task_Identification.Activation_Is_Complete; hence Atomic.
Wait_Count : Natural;
-- This count is used by a task that is waiting for other tasks. At all
-- other times, the value should be zero. It is used differently in
-- several different states. Since a task cannot be in more than one of
-- these states at the same time, a single counter suffices.
--
-- Protection: Self.L
-- Activator_Sleep
-- This is the number of tasks that this task is activating, i.e. the
-- children that have started activation but have not completed it.
--
-- Protection: Self.L and Created.L. Both mutexes must be locked, since
-- Self.Activation_Count and Created.State must be synchronized.
-- Master_Completion_Sleep (phase 1)
-- This is the number dependent tasks of a master being completed by
-- Self that are activated, but have not yet terminated, and are not
-- waiting on a terminate alternative.
-- Master_Completion_2_Sleep (phase 2)
-- This is the count of tasks dependent on a master being completed by
-- Self which are waiting on a terminate alternative.
Elaborated : Access_Boolean;
-- Pointer to a flag indicating that this task's body has been
-- elaborated. The flag is created and managed by the
-- compiler-generated code.
--
-- Protection: The field itself is only accessed by Activator. The flag
-- that it points to is updated by Master and read by Activator; access
-- is assumed to be atomic.
Activation_Failed : Boolean;
-- Set to True if activation of a chain of tasks fails,
-- so that the activator should raise Tasking_Error.
Task_Info : System.Task_Info.Task_Info_Type;
-- System-specific attributes of the task as specified by the
-- Task_Info pragma.
Analyzer : System.Stack_Usage.Stack_Analyzer;
-- For storing information used to measure the stack usage
Global_Task_Lock_Nesting : Natural;
-- This is the current nesting level of calls to
-- System.Tasking.Initialization.Lock_Task. This allows a task to call
-- Lock_Task multiple times without deadlocking. A task only locks
-- Global_Task_Lock when its Global_Task_Lock_Nesting goes from 0 to 1,
-- and only unlocked when it goes from 1 to 0.
--
-- Protection: Only accessed by Self
Fall_Back_Handler : Termination_Handler;
-- This is the fall-back handler that applies to the dependent tasks of
-- the task.
--
-- Protection: Self.L
Specific_Handler : Termination_Handler;
-- This is the specific handler that applies only to this task, and not
-- any of its dependent tasks.
--
-- Protection: Self.L
Debug_Events : Debug_Event_Array;
-- Word length array of per task debug events, of which 11 kinds are
-- currently defined in System.Tasking.Debugging package.
Domain : Dispatching_Domain_Access;
-- Domain is the dispatching domain to which the task belongs. It is
-- only changed via dispatching domains package. This field is made
-- part of the Common_ATCB, even when restricted run-times (namely
-- Ravenscar) do not use it, because this way the field is always
-- available to the underlying layers to set the affinity and we do not
-- need to do different things depending on the situation.
--
-- Protection: Self.L
Secondary_Stack_Size : System.Parameters.Size_Type;
-- Secondary_Stack_Size is the size of the secondary stack for the
-- task. Defined here since it is the responsibility of the task to
-- creates its own secondary stack.
--
-- Protected: Only accessed by Self
end record;
---------------------------------------
-- Restricted_Ada_Task_Control_Block --
---------------------------------------
-- This type should only be used by the restricted GNARLI and by restricted
-- GNULL implementations to allocate an ATCB (see System.Task_Primitives.
-- Operations.New_ATCB) that will take significantly less memory.
-- Note that the restricted GNARLI should only access fields that are
-- present in the Restricted_Ada_Task_Control_Block structure.
type Restricted_Ada_Task_Control_Block (Entry_Num : Task_Entry_Index) is
limited record
Common : Common_ATCB;
-- The common part between various tasking implementations
Entry_Call : aliased Restricted_Entry_Call_Record;
-- Protection: This field is used on entry call "queues" associated
-- with protected objects, and is protected by the protected object
-- lock.
end record;
pragma Suppress_Initialization (Restricted_Ada_Task_Control_Block);
Interrupt_Manager_ID : Task_Id;
-- This task ID is declared here to break circular dependencies.
-- Also declare Interrupt_Manager_ID after Task_Id is known, to avoid
-- generating unneeded finalization code.
-----------------------
-- List of all Tasks --
-----------------------
All_Tasks_List : Task_Id;
-- Global linked list of all tasks
------------------------------------------
-- Regular (non restricted) definitions --
------------------------------------------
--------------------------------
-- Master Related Definitions --
--------------------------------
subtype Master_Level is Integer;
subtype Master_ID is Master_Level;
-- Normally, a task starts out with internal master nesting level one
-- larger than external master nesting level. It is incremented by one by
-- Enter_Master, which is called in the task body only if the compiler
-- thinks the task may have dependent tasks. It is set to 1 for the
-- environment task, the level 2 is reserved for server tasks of the
-- run-time system (the so called "independent tasks"), and the level 3 is
-- for the library level tasks. Foreign threads which are detected by
-- the run-time have a level of 0, allowing these tasks to be easily
-- distinguished if needed.
Foreign_Task_Level : constant Master_Level := 0;
Environment_Task_Level : constant Master_Level := 1;
Independent_Task_Level : constant Master_Level := 2;
Library_Task_Level : constant Master_Level := 3;
-------------------
-- Priority info --
-------------------
Unspecified_Priority : constant Integer := System.Priority'First - 1;
Priority_Not_Boosted : constant Integer := System.Priority'First - 1;
-- Definition of Priority actually has to come from the RTS configuration
subtype Rendezvous_Priority is Integer
range Priority_Not_Boosted .. System.Any_Priority'Last;
-------------------
-- Affinity info --
-------------------
Unspecified_CPU : constant := -1;
-- No affinity specified
------------------------------------
-- Rendezvous related definitions --
------------------------------------
No_Rendezvous : constant := 0;
Max_Select : constant Integer := Integer'Last;
-- RTS-defined
subtype Select_Index is Integer range No_Rendezvous .. Max_Select;
-- type Select_Index is range No_Rendezvous .. Max_Select;
subtype Positive_Select_Index is
Select_Index range 1 .. Select_Index'Last;
type Accept_Alternative is record
Null_Body : Boolean;
S : Task_Entry_Index;
end record;
type Accept_List is
array (Positive_Select_Index range <>) of Accept_Alternative;
type Accept_List_Access is access constant Accept_List;
-----------------------------------
-- ATC_Level related definitions --
-----------------------------------
Max_ATC_Nesting : constant Natural := 20;
subtype ATC_Level_Base is Integer range 0 .. Max_ATC_Nesting;
ATC_Level_Infinity : constant ATC_Level_Base := ATC_Level_Base'Last;
subtype ATC_Level is ATC_Level_Base range 0 .. ATC_Level_Base'Last - 1;
subtype ATC_Level_Index is ATC_Level range 1 .. ATC_Level'Last;
----------------------------------
-- Entry_Call_Record definition --
----------------------------------
type Entry_Call_Record is record
Self : Task_Id;
-- ID of the caller
Mode : Call_Modes;
State : Entry_Call_State;
pragma Atomic (State);
-- Indicates part of the state of the call
--
-- Protection: If the call is not on a queue, it should only be
-- accessed by Self, and Self does not need any lock to modify this
-- field. Once the call is on a queue, the value should be something
-- other than Done unless it is cancelled, and access is controller by
-- the "server" of the queue -- i.e., the lock of Checked_To_Protection
-- (Call_Target) if the call record is on the queue of a PO, or the
-- lock of Called_Target if the call is on the queue of a task. See
-- comments on type declaration for more details.
Uninterpreted_Data : System.Address;
-- Data passed by the compiler
Exception_To_Raise : Ada.Exceptions.Exception_Id;
-- The exception to raise once this call has been completed without
-- being aborted.
Prev : Entry_Call_Link;
Next : Entry_Call_Link;
Level : ATC_Level;
-- One of Self and Level are redundant in this implementation, since
-- each Entry_Call_Record is at Self.Entry_Calls (Level). Since we must
-- have access to the entry call record to be reading this, we could
-- get Self from Level, or Level from Self. However, this requires
-- non-portable address arithmetic.
E : Entry_Index;
Prio : System.Any_Priority;
-- The above fields are those that there may be some hope of packing.
-- They are gathered together to allow for compilers that lay records
-- out contiguously, to allow for such packing.
Called_Task : Task_Id;
pragma Atomic (Called_Task);
-- Use for task entry calls. The value is null if the call record is
-- not in use. Conversely, unless State is Done and Onqueue is false,
-- Called_Task points to an ATCB.
--
-- Protection: Called_Task.L
Called_PO : System.Address;
pragma Atomic (Called_PO);
-- Similar to Called_Task but for protected objects
--
-- Note that the previous implementation tried to merge both
-- Called_Task and Called_PO but this ended up in many unexpected
-- complications (e.g having to add a magic number in the ATCB, which
-- caused gdb lots of confusion) with no real gain since the
-- Lock_Server implementation still need to loop around chasing for
-- pointer changes even with a single pointer.
Acceptor_Prev_Call : Entry_Call_Link;
-- For task entry calls only
Acceptor_Prev_Priority : Rendezvous_Priority := Priority_Not_Boosted;
-- For task entry calls only. The priority of the most recent prior
-- call being serviced. For protected entry calls, this function should
-- be performed by GNULLI ceiling locking.
Cancellation_Attempted : Boolean := False;
pragma Atomic (Cancellation_Attempted);
-- Cancellation of the call has been attempted.
-- Consider merging this into State???
With_Abort : Boolean := False;
-- Tell caller whether the call may be aborted
-- ??? consider merging this with Was_Abortable state
Needs_Requeue : Boolean := False;
-- Temporary to tell acceptor of task entry call that
-- Exceptional_Complete_Rendezvous needs to do requeue.
end record;
------------------------------------
-- Task related other definitions --
------------------------------------
type Access_Address is access all System.Address;
-- Anonymous pointer used to implement task attributes (see s-tataat.adb
-- and a-tasatt.adb)
pragma No_Strict_Aliasing (Access_Address);
-- This type is used in contexts where aliasing may be an issue (see
-- for example s-tataat.adb), so we avoid any incorrect aliasing
-- assumptions.
----------------------------------------------
-- Ada_Task_Control_Block (ATCB) definition --
----------------------------------------------
type Entry_Call_Array is array (ATC_Level_Index) of
aliased Entry_Call_Record;
type Atomic_Address is mod Memory_Size;
pragma Atomic (Atomic_Address);
type Attribute_Array is
array (1 .. Parameters.Max_Attribute_Count) of Atomic_Address;
-- Array of task attributes. The value (Atomic_Address) will either be
-- converted to a task attribute if it fits, or to a pointer to a record
-- by Ada.Task_Attributes.
type Task_Serial_Number is mod 2 ** Long_Long_Integer'Size;
-- Used to give each task a unique serial number. We want 64-bits for this
-- type to get as much uniqueness as possible (2**64 is operationally
-- infinite in this context, but 2**32 perhaps could recycle). We use
-- Long_Long_Integer (which in the normal case is always 64-bits) rather
-- than 64-bits explicitly to allow codepeer to analyze this unit when
-- a target configuration file forces the maximum integer size to 32.
type Ada_Task_Control_Block (Entry_Num : Task_Entry_Index) is limited record
Common : Common_ATCB;
-- The common part between various tasking implementations
Entry_Calls : Entry_Call_Array;
-- An array of entry calls
--
-- Protection: The elements of this array are on entry call queues
-- associated with protected objects or task entries, and are protected
-- by the protected object lock or Acceptor.L, respectively.
New_Base_Priority : System.Any_Priority;
-- New value for Base_Priority (for dynamic priorities package)
--
-- Protection: Self.L
Open_Accepts : Accept_List_Access;
-- This points to the Open_Accepts array of accept alternatives passed
-- to the RTS by the compiler-generated code to Selective_Wait. It is
-- non-null iff this task is ready to accept an entry call.
--
-- Protection: Self.L
Chosen_Index : Select_Index;
-- The index in Open_Accepts of the entry call accepted by a selective
-- wait executed by this task.
--
-- Protection: Written by both Self and Caller. Usually protected by
-- Self.L. However, once the selection is known to have been written it
-- can be accessed without protection. This happens after Self has
-- updated it itself using information from a suspended Caller, or
-- after Caller has updated it and awakened Self.
Master_of_Task : Master_Level;
-- The task executing the master of this task, and the ID of this task's
-- master (unique only among masters currently active within Parent).
--
-- Protection: Set by Activator before Self is activated, and read
-- after Self is activated.
Master_Within : Master_Level;
-- The ID of the master currently executing within this task; that is,
-- the most deeply nested currently active master.
--
-- Protection: Only written by Self, and only read by Self or by
-- dependents when Self is attempting to exit a master. Since Self will
-- not write this field until the master is complete, the
-- synchronization should be adequate to prevent races.
Alive_Count : Natural := 0;
-- Number of tasks directly dependent on this task (including itself)
-- that are still "alive", i.e. not terminated.
--
-- Protection: Self.L
Awake_Count : Natural := 0;
-- Number of tasks directly dependent on this task (including itself)
-- still "awake", i.e., are not terminated and not waiting on a
-- terminate alternative.
--
-- Invariant: Awake_Count <= Alive_Count
-- Protection: Self.L
-- Beginning of flags
Aborting : Boolean := False;
pragma Atomic (Aborting);
-- Self is in the process of aborting. While set, prevents multiple
-- abort signals from being sent by different aborter while abort
-- is acted upon. This is essential since an aborter which calls
-- Abort_To_Level could set the Pending_ATC_Level to yet a lower level
-- (than the current level), may be preempted and would send the
-- abort signal when resuming execution. At this point, the abortee
-- may have completed abort to the proper level such that the
-- signal (and resulting abort exception) are not handled any more.
-- In other words, the flag prevents a race between multiple aborters
--
-- Protection: protected by atomic access.
ATC_Hack : Boolean := False;
pragma Atomic (ATC_Hack);
-- ?????
-- Temporary fix, to allow Undefer_Abort to reset Aborting in the
-- handler for Abort_Signal that encloses an async. entry call.
-- For the longer term, this should be done via code in the
-- handler itself.
Callable : Boolean := True;
-- It is OK to call entries of this task
Dependents_Aborted : Boolean := False;
-- This is set to True by whichever task takes responsibility for
-- aborting the dependents of this task.
--
-- Protection: Self.L
Interrupt_Entry : Boolean := False;
-- Indicates if one or more Interrupt Entries are attached to the task.
-- This flag is needed for cleaning up the Interrupt Entry bindings.
Pending_Action : Boolean := False;
-- Unified flag indicating some action needs to be take when abort
-- next becomes undeferred. Currently set if:
-- . Pending_Priority_Change is set
-- . Pending_ATC_Level is changed
-- . Requeue involving POs
-- (Abortable field may have changed and the Wait_Until_Abortable
-- has to recheck the abortable status of the call.)
-- . Exception_To_Raise is non-null
--
-- Protection: Self.L
--
-- This should never be reset back to False outside of the procedure
-- Do_Pending_Action, which is called by Undefer_Abort. It should only
-- be set to True by Set_Priority and Abort_To_Level.
Pending_Priority_Change : Boolean := False;
-- Flag to indicate pending priority change (for dynamic priorities
-- package). The base priority is updated on the next abort
-- completion point (aka. synchronization point).
--
-- Protection: Self.L
Terminate_Alternative : Boolean := False;
-- Task is accepting Select with Terminate Alternative
--
-- Protection: Self.L
-- End of flags
-- Beginning of counts
ATC_Nesting_Level : ATC_Level := 1;
-- The dynamic level of ATC nesting (currently executing nested
-- asynchronous select statements) in this task.
-- Protection: Self_ID.L. Only Self reads or updates this field.
-- Decrementing it deallocates an Entry_Calls component, and care must
-- be taken that all references to that component are eliminated before
-- doing the decrement. This in turn will require locking a protected
-- object (for a protected entry call) or the Acceptor's lock (for a
-- task entry call). No other task should attempt to read or modify
-- this value.
Deferral_Level : Natural := 1;
-- This is the number of times that Defer_Abort has been called by
-- this task without a matching Undefer_Abort call. Abortion is only
-- allowed when this zero. It is initially 1, to protect the task at
-- startup.
-- Protection: Only updated by Self; access assumed to be atomic
Pending_ATC_Level : ATC_Level_Base := ATC_Level_Infinity;
-- The ATC level to which this task is currently being aborted. If the
-- value is zero, the entire task has "completed". That may be via
-- abort, exception propagation, or normal exit. If the value is
-- ATC_Level_Infinity, the task is not being aborted to any level. If
-- the value is positive, the task has not completed. This should ONLY
-- be modified by Abort_To_Level and Exit_One_ATC_Level.
--
-- Protection: Self.L
Serial_Number : Task_Serial_Number;
-- Monotonic counter to provide some way to check locking rules/ordering
Known_Tasks_Index : Integer := -1;
-- Index in the System.Tasking.Debug.Known_Tasks array
User_State : Long_Integer := 0;
-- User-writeable location, for use in debugging tasks; also provides a
-- simple task specific data.
Free_On_Termination : Boolean := False;
-- Deallocate the ATCB when the task terminates. This flag is normally
-- False, and is set True when Unchecked_Deallocation is called on a
-- non-terminated task so that the associated storage is automatically
-- reclaimed when the task terminates.
Attributes : Attribute_Array := (others => 0);
-- Task attributes
-- IMPORTANT Note: the Entry_Queues field is last for efficiency of
-- access to other fields, do not put new fields after this one.
Entry_Queues : Task_Entry_Queue_Array (1 .. Entry_Num);
-- An array of task entry queues
--
-- Protection: Self.L. Once a task has set Self.Stage to Completing, it
-- has exclusive access to this field.
end record;
--------------------
-- Initialization --
--------------------
procedure Initialize;
-- This procedure constitutes the first part of the initialization of the
-- GNARL. This includes creating data structures to make the initial thread
-- into the environment task. The last part of the initialization is done
-- in System.Tasking.Initialization or System.Tasking.Restricted.Stages.
-- All the initializations used to be in Tasking.Initialization, but this
-- is no longer possible with the run time simplification (including
-- optimized PO and the restricted run time) since one cannot rely on
-- System.Tasking.Initialization being present, as was done before.
procedure Initialize_ATCB
(Self_ID : Task_Id;
Task_Entry_Point : Task_Procedure_Access;
Task_Arg : System.Address;
Parent : Task_Id;
Elaborated : Access_Boolean;
Base_Priority : System.Any_Priority;
Base_CPU : System.Multiprocessors.CPU_Range;
Domain : Dispatching_Domain_Access;
Task_Info : System.Task_Info.Task_Info_Type;
Stack_Size : System.Parameters.Size_Type;
Secondary_Stack_Size : System.Parameters.Size_Type;
T : Task_Id;
Success : out Boolean);
-- Initialize fields of the TCB for task T, and link into global TCB
-- structures. Call this only with abort deferred and holding RTS_Lock.
-- Self_ID is the calling task (normally the activator of T). Success is
-- set to indicate whether the TCB was successfully initialized.
private
Null_Task : constant Task_Id := null;
type Activation_Chain is limited record
T_ID : Task_Id;
end record;
-- Activation_Chain is an in-out parameter of initialization procedures and
-- it must be passed by reference because the init proc may terminate
-- abnormally after creating task components, and these must be properly
-- registered for removal (Expunge_Unactivated_Tasks). The "limited" forces
-- Activation_Chain to be a by-reference type; see RM-6.2(4).
function Number_Of_Entries (Self_Id : Task_Id) return Entry_Index;
-- Given a task, return the number of entries it contains
end System.Tasking;
| 41.1199 | 79 | 0.64797 |
5e41d45f2f38908667b24e4e4030f4ff6935b70e | 4,880 | adb | Ada | src/latin_utils/latin_utils-inflections_package-ending_record_io.adb | Alex-Vasile/whitakers-words | 9fa16606d97842746fea0379839f40c959c53d56 | [
"FTL"
] | 204 | 2015-06-12T21:22:55.000Z | 2022-03-28T10:50:16.000Z | src/latin_utils/latin_utils-inflections_package-ending_record_io.adb | Alex-Vasile/whitakers-words | 9fa16606d97842746fea0379839f40c959c53d56 | [
"FTL"
] | 98 | 2015-06-15T22:17:04.000Z | 2021-10-01T18:17:55.000Z | src/latin_utils/latin_utils-inflections_package-ending_record_io.adb | Alex-Vasile/whitakers-words | 9fa16606d97842746fea0379839f40c959c53d56 | [
"FTL"
] | 50 | 2015-06-16T22:42:24.000Z | 2021-12-29T16:53:08.000Z | -- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired)
--
-- Copyright William A. Whitaker (1936–2010)
--
-- This is a free program, which means it is proper to copy it and pass
-- it on to your friends. Consider it a developmental item for which
-- there is no charge. However, just for form, it is Copyrighted
-- (c). Permission is hereby freely given for any and all use of program
-- and data. You can sell it as your own, but at least tell me.
--
-- This version is distributed without obligation, but the developer
-- would appreciate comments and suggestions.
--
-- All parts of the WORDS system, source code and data files, are made freely
-- available to anyone who wishes to use them, for whatever purpose.
separate (Latin_Utils.Inflections_Package)
package body Ending_Record_IO is
---------------------------------------------------------------------------
Blanks : constant Ending := (others => ' ');
---------------------------------------------------------------------------
procedure Get (File : in File_Type; Item : out Ending_Record)
is
Ending_Length : Ending_Size_Type := 0;
Ending_Suf : Ending := (others => ' ');
Spacer : Character := ' ';
begin
Ending_Suf := Blanks;
Ada.Integer_Text_IO.Get (File, Ending_Length);
if Ending_Length = 0 then
Item := Null_Ending_Record;
else
Get (File, Spacer);
Get (File, Ending_Suf (1 .. Ending_Length));
Item := (Ending_Length, Ending_Suf);
end if;
end Get;
---------------------------------------------------------------------------
procedure Get (Item : out Ending_Record)
is
Ending_Length : Ending_Size_Type := 0;
Ending_Suf : Ending := (others => ' ');
Spacer : Character := ' ';
begin
Ending_Suf := Blanks;
Ada.Integer_Text_IO.Get (Ending_Length);
if Ending_Length = 0 then
Item := Null_Ending_Record;
else
Get (Spacer);
Get (Ending_Suf (1 .. Ending_Length));
Item := (Ending_Length, Ending_Suf);
end if;
end Get;
---------------------------------------------------------------------------
procedure Put (File : in File_Type; Item : in Ending_Record) is
begin
Ada.Integer_Text_IO.Put (File, Item.Size, 1);
Put (File, ' ');
Put
(File,
Item.Suf (1 .. Item.Size) & Blanks (Item.Size + 1 .. Max_Ending_Size)
);
end Put;
---------------------------------------------------------------------------
procedure Put (Item : in Ending_Record) is
begin
Ada.Integer_Text_IO.Put (Item.Size, 1);
Put (' ');
Put
(Item.Suf (1 .. Item.Size) &
Blanks (Item.Size + 1 .. Max_Ending_Size)
);
end Put;
---------------------------------------------------------------------------
procedure Get
(Source : in String;
Target : out Ending_Record;
Last : out Integer
)
is
Ending_Length : Ending_Size_Type := 0;
Ending_Suf : Ending := (others => ' ');
-- Used for computing lower bounds of substrings
Low : Integer := Source'First - 1;
begin
Ending_Suf := Blanks;
Ada.Integer_Text_IO.Get
(Source (Low + 1 .. Source'Last), Ending_Length, Low);
if Ending_Length = 0 then
Target := Null_Ending_Record;
Last := Low;
else
Low := Low + 1;
Ending_Suf := Source (Low + 1 .. Low + Ending_Length) &
Blanks (Ending_Length + 1 .. Max_Ending_Size);
Last := Low + Ending_Length;
Target := (Ending_Length, Ending_Suf (1 .. Ending_Length) &
Blanks (Ending_Length + 1 .. Max_Ending_Size));
end if;
exception
when others =>
Ada.Text_IO.Put_Line ("ENDING ERROR " & Source);
raise;
end Get;
---------------------------------------------------------------------------
procedure Put (Target : out String; Item : in Ending_Record)
is
-- Used for computing bounds of substrings
Low : Integer := Target'First - 1;
High : Integer := Low + 2;
begin
Ada.Integer_Text_IO.Put (Target (Low + 1 .. High), Item.Size);
High := High + 1;
Target (High) := ' ';
if Item.Size > 0 then
Low := High;
High := Low + Item.Size;
Target (Low + 1 .. High) := Item.Suf (1 .. Item.Size);
end if;
-- Being very careful here, first to fill out to the MAX_ENDING_SIZE
Low := High;
High := Low + Max_Ending_Size - Item.Size;
Target (Low + 1 .. High) := (others => ' ');
-- Then to fill out the rest of the out String, if any
Target (High + 1 .. Target'Last) := (others => ' ');
end Put;
---------------------------------------------------------------------------
end Ending_Record_IO;
| 33.424658 | 79 | 0.514959 |
5e6a18f3fabc25e23a7e981a77c03b55adc43840 | 1,797 | adb | Ada | src/model/l_system/error/lse-model-l_system-error-missing_rule.adb | 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.adb | 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.adb | 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.
-------------------------------------------------------------------------------
package body LSE.Model.L_System.Error.Missing_Rule is
function Initialize return Instance
is
begin
return Instance '(Error => Error_Type.Missing_Rule);
end Initialize;
function Get_Error (This : Instance) return String
is
pragma Unreferenced (This);
begin
return "No Growth Rule found";
end Get_Error;
end LSE.Model.L_System.Error.Missing_Rule;
| 39.933333 | 79 | 0.671675 |
a08237e622db934aa5dedc2c31272272233e3101 | 3,685 | ads | Ada | source/amf/uml/amf-uml-holders-visibility_kinds.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-holders-visibility_kinds.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-holders-visibility_kinds.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 League.Holders.Generic_Enumerations;
package AMF.UML.Holders.Visibility_Kinds is
new League.Holders.Generic_Enumerations
(AMF.UML.UML_Visibility_Kind);
pragma Preelaborate (AMF.UML.Holders.Visibility_Kinds);
| 70.865385 | 78 | 0.410041 |
5e58cf8033962c22f0ce23d9d6ab58fd88bd1f3f | 2,308 | ads | Ada | tests/util_tests.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 30 | 2018-05-18T09:11:50.000Z | 2021-05-18T16:29:14.000Z | tests/util_tests.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 15 | 2018-12-13T07:53:36.000Z | 2019-09-24T19:43:35.000Z | tests/util_tests.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 3 | 2019-04-04T17:41:29.000Z | 2021-05-07T22:28:46.000Z | -------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- @author Alexander Senier
-- @date 2019-01-16
--
-- Copyright (C) 2018 Componolit GmbH
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
--
-- * Neither the name of the nor the names of its contributors may be used
-- to endorse or promote products derived from this software without
-- specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
-- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with AUnit; use AUnit;
with AUnit.Test_Cases; use AUnit.Test_Cases;
-- @summary Tests test utility functions
package Util_Tests is
type Test_Case is new Test_Cases.Test_Case with null record;
procedure Register_Tests (T: in out Test_Case);
-- Register routines to be run
function Name (T : Test_Case) return Message_String;
-- Provide name identifying the test case
end Util_Tests;
| 44.384615 | 80 | 0.678076 |
a09439262a4baae6657fd5130415cb6e41ef7881 | 623 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/lto9_pkg1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/lto9_pkg1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/lto9_pkg1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | with Lto9_Pkg2;
package Lto9_Pkg1 is
subtype Lengths is Natural range 0 .. 50;
type Subscriber (NLen, ALen: Lengths := 50) is record
Name : String(1 .. NLen);
Address : String(1 .. ALen);
end record;
type Subscriber_Ptr is access all Subscriber;
package District_Subscription_Lists is new Lto9_Pkg2
(Element_Type => Subscriber,
Element_Ptr => Subscriber_Ptr,
Size => 100);
District_01_Subscribers : District_Subscription_Lists.List_Type;
New_Subscriber_01 : aliased Subscriber :=
(12, 23, "Brown, Silas", "King's Pyland, Dartmoor");
end Lto9_Pkg1;
| 24.92 | 67 | 0.677368 |
03ab9958240b94ea4eecc0d37ef5101c4d2fa063 | 107,505 | adb | Ada | src/asis/asis-elements.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/asis/asis-elements.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/asis/asis-elements.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | ------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A S I S . E L E M E N T S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2012, Free Software Foundation, Inc. --
-- --
-- ASIS-for-GNAT is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 2, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be use- --
-- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- --
-- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General --
-- Public License for more details. You should have received a copy of the --
-- GNU General Public License distributed with ASIS-for-GNAT; see file --
-- COPYING. If not, write to the Free Software Foundation, 51 Franklin --
-- Street, Fifth Floor, Boston, MA 02110-1301, USA. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the --
-- Software Engineering Laboratory of the Swiss Federal Institute of --
-- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the --
-- Scientific Research Computer Center of Moscow State University (SRCC --
-- MSU), Russia, with funding partially provided by grants from the Swiss --
-- National Science Foundation and the Swiss Academy of Engineering --
-- Sciences. ASIS-for-GNAT is now maintained by AdaCore --
-- (http://www.adacore.com). --
-- --
------------------------------------------------------------------------------
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Ada.Unchecked_Conversion;
with Interfaces; use Interfaces;
with GNAT.HTable;
with Asis.Clauses;
with Asis.Compilation_Units;
with Asis.Declarations; use Asis.Declarations;
with Asis.Definitions;
with Asis.Errors; use Asis.Errors;
with Asis.Exceptions; use Asis.Exceptions;
with Asis.Extensions;
with Asis.Limited_Views; use Asis.Limited_Views;
with Asis.Statements;
with Asis.Set_Get; use Asis.Set_Get;
with A4G.A_Output; use A4G.A_Output;
with A4G.A_Sem; use A4G.A_Sem;
with A4G.A_Sinput; use A4G.A_Sinput;
with A4G.A_Types;
with A4G.Asis_Tables; use A4G.Asis_Tables;
with A4G.Contt; use A4G.Contt;
with A4G.Contt.UT; use A4G.Contt.UT;
with A4G.Encl_El; use A4G.Encl_El;
with A4G.Knd_Conv; use A4G.Knd_Conv;
with A4G.Mapping; use A4G.Mapping;
with A4G.Vcheck; use A4G.Vcheck;
with Atree; use Atree;
with Einfo; use Einfo;
with Namet; use Namet;
with Nlists; use Nlists;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Snames; use Snames;
with Stand; use Stand;
package body Asis.Elements is
function "=" (Left, Right : Element) return Boolean
renames Asis.Set_Get."=";
Package_Name : constant String := "Asis.Elements.";
------------------------------------------------------------------------------
---------------------------
-- ASIS 2005 Draft stuff --
---------------------------
----------------------------
-- Access_Definition_Kind --
----------------------------
function Access_Definition_Kind
(Definition : Asis.Definition)
return Asis.Access_Definition_Kinds
is
begin
Check_Validity (Definition, Package_Name & "Access_Definition_Kind");
return Access_Definition_Kind_From_Internal (Int_Kind (Definition));
end Access_Definition_Kind;
--------------------
-- Interface_Kind --
--------------------
function Interface_Kind
(Definition : Asis.Definition)
return Asis.Interface_Kinds
is
begin
Check_Validity (Definition, Package_Name & "Interface_Kind");
return Interface_Kind_From_Internal (Int_Kind (Definition));
end Interface_Kind;
------------------------
-- Is_Not_Null_Return --
------------------------
function Is_Not_Null_Return
(Element : Asis.Element)
return Boolean
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Arg_Node : Node_Id := Node (Element);
Result : Boolean := False;
begin
Check_Validity (Element, Package_Name & "Is_Not_Null_Return");
case Arg_Kind is
when A_Function_Declaration |
A_Function_Body_Declaration |
A_Function_Renaming_Declaration |
A_Function_Body_Stub |
A_Generic_Function_Declaration |
A_Formal_Function_Declaration =>
Arg_Node := Specification (Arg_Node);
Result := Null_Exclusion_Present (Arg_Node);
when An_Access_To_Function |
An_Access_To_Protected_Function |
An_Anonymous_Access_To_Function |
An_Anonymous_Access_To_Protected_Function =>
Result := Null_Exclusion_Present (Arg_Node);
when others =>
null;
end case;
return Result;
end Is_Not_Null_Return;
------------------------
-- Is_Prefix_Notation --
------------------------
function Is_Prefix_Notation (Call : Asis.Element) return Boolean is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Call);
Arg_Node : constant Node_Id := R_Node (Call);
Result : Boolean := False;
begin
Check_Validity (Call, Package_Name & "Is_Prefix_Notation");
if Arg_Kind = A_Procedure_Call_Statement then
if Is_Rewrite_Substitution (Arg_Node)
and then
Nkind (Original_Node (Arg_Node)) = Nkind (Arg_Node)
and then
Nkind (Sinfo.Name (Arg_Node)) = N_Identifier
and then
Nkind (Sinfo.Name (Original_Node (Arg_Node))) =
N_Selected_Component
then
Result := True;
end if;
elsif Arg_Kind = A_Function_Call
and then
Is_Rewrite_Substitution (Arg_Node)
then
-- If prefix notation is used for a function call, the corresponding
-- A_Function_Call element is based on the rewritten node and the
-- original node is not used at all
if Node (Call) = Arg_Node then
Result := Is_Rewritten_Function_Prefix_Notation (Arg_Node);
elsif Nkind (Arg_Node) = N_Explicit_Dereference then
-- This is a case of *implicit* dereference :(
Result :=
Is_Rewritten_Impl_Deref_Function_Prefix_Notation (Node (Call));
end if;
end if;
return Result;
end Is_Prefix_Notation;
-----------------------------------
-- From ARG ASIS 2005 definition --
-----------------------------------
------------------
-- Has_Abstract --
------------------
function Has_Abstract (Element : Asis.Element) return Boolean is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Arg_Node : Node_Id;
Result : Boolean := False;
begin
Check_Validity (Element, Package_Name & "Has_Abstract");
case Arg_Kind is
when An_Ordinary_Type_Declaration =>
Arg_Node := Sinfo.Type_Definition (Node (Element));
when A_Formal_Procedure_Declaration |
A_Formal_Function_Declaration |
A_Function_Declaration |
A_Private_Type_Declaration |
A_Private_Extension_Declaration |
A_Procedure_Declaration |
A_Private_Extension_Definition |
A_Tagged_Private_Type_Definition |
Internal_Type_Kinds |
A_Formal_Tagged_Private_Type_Definition |
A_Formal_Derived_Type_Definition =>
Arg_Node := Node (Element);
when others =>
return False;
end case;
Result := Nkind (Arg_Node) = N_Abstract_Subprogram_Declaration
or else
Nkind (Arg_Node) = N_Formal_Abstract_Subprogram_Declaration
or else
Abstract_Present (Arg_Node);
return Result;
exception
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Has_Abstract",
Ex => Ex,
Arg_Element => Element);
end Has_Abstract;
-----------------
-- Has_Aliased --
-----------------
function Has_Aliased (Element : Asis.Element) return Boolean is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Result : Boolean := False;
begin
Check_Validity (Element, Package_Name & "Has_Aliased");
case Arg_Kind is
when A_Constant_Declaration |
A_Deferred_Constant_Declaration |
A_Return_Variable_Specification |
A_Return_Constant_Specification |
A_Variable_Declaration |
A_Component_Definition |
A_Parameter_Specification =>
Result := Aliased_Present (Node (Element));
when others =>
return False;
end case;
return Result;
exception
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Has_Aliased",
Ex => Ex,
Arg_Element => Element);
end Has_Aliased;
-----------------
-- Has_Limited --
-----------------
function Has_Limited (Element : Asis.Element) return Boolean is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Arg_Node : Node_Id;
Result : Boolean := False;
begin
Check_Validity (Element, Package_Name & "Has_Limited");
case Arg_Kind is
when A_With_Clause |
A_Private_Type_Declaration |
A_Private_Extension_Declaration |
Internal_Type_Kinds |
A_Private_Type_Definition |
A_Tagged_Private_Type_Definition |
A_Private_Extension_Definition |
A_Formal_Private_Type_Definition |
A_Formal_Tagged_Private_Type_Definition |
A_Formal_Derived_Type_Definition =>
Arg_Node := Node (Element);
when An_Ordinary_Type_Declaration =>
Arg_Node := Sinfo.Type_Definition (Node (Element));
when others => return False;
end case;
Result := Limited_Present (Arg_Node);
return Result;
exception
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Has_Limited",
Ex => Ex,
Arg_Element => Element);
end Has_Limited;
-----------------
-- Has_Private --
-----------------
function Has_Private (Element : Asis.Element) return Boolean is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
begin
Check_Validity (Element, Package_Name & "Has_Private");
-- There is no case when a type definition element may contain PRIVATE
case Arg_Kind is
when A_With_Clause =>
return Private_Present (Node (Element));
when A_Private_Extension_Declaration |
A_Private_Type_Declaration |
A_Private_Type_Definition |
A_Tagged_Private_Type_Definition |
A_Private_Extension_Definition |
A_Formal_Private_Type_Definition |
A_Formal_Tagged_Private_Type_Definition =>
return True;
when others => return False;
end case;
exception
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Has_Private",
Ex => Ex,
Arg_Element => Element);
end Has_Private;
-------------------
-- Has_Protected --
-------------------
function Has_Protected (Element : Asis.Element) return Boolean is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
begin
Check_Validity (Element, Package_Name & "Has_Protected");
-- If our interpretation is correct, there is nothing to compute here,
-- and the result is completely defined by the argument kind
case Arg_Kind is
when A_Protected_Definition |
A_Protected_Body_Declaration |
A_Protected_Type_Declaration |
A_Single_Protected_Declaration |
A_Protected_Body_Stub |
A_Protected_Interface |
A_Formal_Protected_Interface =>
return True;
when others =>
return False;
end case;
exception
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Has_Protected",
Ex => Ex,
Arg_Element => Element);
end Has_Protected;
-----------------
-- Has_Reverse --
-----------------
function Has_Reverse (Element : Asis.Element) return Boolean is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Arg_Node : Node_Id;
Result : Boolean := False;
begin
Check_Validity (Element, Package_Name & "Has_Reverse");
case Arg_Kind is
when A_Loop_Parameter_Specification |
A_Generalized_Iterator_Specification |
An_Element_Iterator_Specification =>
Arg_Node := Node (Element);
Result := Reverse_Present (Arg_Node);
when others =>
null;
end case;
return Result;
exception
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Has_Reverse",
Ex => Ex,
Arg_Element => Element);
end Has_Reverse;
----------------------
-- Has_Synchronized --
----------------------
function Has_Synchronized (Element : Asis.Element) return Boolean is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Result : Boolean := False;
begin
Check_Validity (Element, Package_Name & "Has_Synchronized");
case Arg_Kind is
when A_Synchronized_Interface |
A_Formal_Synchronized_Interface =>
Result := True;
when A_Private_Extension_Definition |
A_Formal_Derived_Type_Definition =>
Result := Synchronized_Present (R_Node (Element));
when others =>
null;
end case;
return Result;
exception
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Has_Synchronized",
Ex => Ex,
Arg_Element => Element);
end Has_Synchronized;
----------------
-- Has_Tagged --
----------------
function Has_Tagged (Element : Asis.Element) return Boolean is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Result : Boolean := False;
begin
Check_Validity (Element, Package_Name & "Has_Tagged");
case Arg_Kind is
when A_Tagged_Incomplete_Type_Declaration |
A_Tagged_Private_Type_Definition |
A_Tagged_Record_Type_Definition |
A_Formal_Tagged_Private_Type_Definition =>
Result := True;
when A_Formal_Incomplete_Type_Declaration =>
Result :=
Tagged_Present (Sinfo.Formal_Type_Definition (Node (Element)));
when others =>
null;
end case;
return Result;
exception
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Has_Tagged",
Ex => Ex,
Arg_Element => Element);
end Has_Tagged;
---------------
-- Has_Task --
---------------
function Has_Task (Element : Asis.Element) return Boolean is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Result : Boolean := False;
begin
Check_Validity (Element, Package_Name & "Has_Task");
case Arg_Kind is
when A_Task_Definition |
A_Task_Type_Declaration |
A_Single_Task_Declaration |
A_Task_Body_Declaration |
A_Task_Body_Stub |
A_Task_Interface |
A_Formal_Task_Interface =>
Result := True;
when others =>
null;
end case;
return Result;
exception
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Has_Task",
Ex => Ex,
Arg_Element => Element);
end Has_Task;
------------------------
-- Has_Null_Exclusion --
------------------------
function Has_Null_Exclusion
(Element : Asis.Element)
return Boolean
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Arg_Node : Node_Id;
begin
Check_Validity (Element, Package_Name & "Has_Null_Exclusion");
case Arg_Kind is
when Internal_Access_Definition_Kinds |
Internal_Access_Type_Kinds |
A_Parameter_Specification =>
Arg_Node := Node (Element);
when A_Discriminant_Specification =>
Arg_Node := Node (Element);
if not Null_Exclusion_Present (Arg_Node) then
Arg_Node := Discriminant_Type (Arg_Node);
if Nkind (Arg_Node) /= N_Access_Definition then
return False;
end if;
end if;
when An_Object_Renaming_Declaration |
A_Formal_Object_Declaration =>
Arg_Node := Node (Element);
if not Null_Exclusion_Present (Arg_Node)
and then
Present (Access_Definition (Arg_Node))
then
Arg_Node := Access_Definition (Arg_Node);
end if;
when A_Subtype_Indication =>
Arg_Node := Parent (Node (Element));
when others =>
return False;
end case;
return Null_Exclusion_Present (Arg_Node);
exception
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Has_Null_Exclusion",
Ex => Ex,
Arg_Element => Element);
end Has_Null_Exclusion;
------------------------------------------------------------------------------
function Unit_Declaration
(Compilation_Unit : Asis.Compilation_Unit)
return Asis.Declaration
is
Unit_Kind : Asis.Unit_Kinds;
Unit_Declaration_Node : Node_Id;
Special_Case : Special_Cases := Not_A_Special_Case;
begin
Check_Validity (Compilation_Unit, Package_Name & "Unit_Declaration");
Reset_Context (Encl_Cont_Id (Compilation_Unit));
Unit_Kind := Kind (Compilation_Unit);
if Unit_Kind = Not_A_Unit then
Raise_ASIS_Inappropriate_Compilation_Unit
(Package_Name & "Unit_Declaration");
end if;
if Unit_Kind = A_Nonexistent_Declaration or else
Unit_Kind = A_Nonexistent_Body or else
Unit_Kind = An_Unknown_Unit or else
Unit_Kind = A_Configuration_Compilation
then
return Nil_Element;
end if;
if Is_Standard (Compilation_Unit) then
Special_Case := Explicit_From_Standard;
Unit_Declaration_Node := Standard_Package_Node;
else
Unit_Declaration_Node := Unit (Top (Compilation_Unit));
end if;
if Has_Limited_View_Only (Compilation_Unit) then
Special_Case := From_Limited_View;
end if;
if Unit_Kind = A_Procedure_Body_Subunit or else
Unit_Kind = A_Function_Body_Subunit or else
Unit_Kind = A_Package_Body_Subunit or else
Unit_Kind = A_Task_Body_Subunit or else
Unit_Kind = A_Protected_Body_Subunit
then
-- one step down the tree is required. No Asis Element can correspond
-- to the N_Subunit Node
Unit_Declaration_Node := Proper_Body (Unit_Declaration_Node);
end if;
return Node_To_Element_New (Node => Unit_Declaration_Node,
Spec_Case => Special_Case,
In_Unit => Compilation_Unit);
exception
when ASIS_Inappropriate_Compilation_Unit =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Unit_Declaration");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Unit_Declaration",
Ex => Ex,
Arg_CU => Compilation_Unit);
end Unit_Declaration;
-----------------------------------------------------------------------------
function Enclosing_Compilation_Unit
(Element : Asis.Element)
return Asis.Compilation_Unit
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
begin
Check_Validity (Element, Package_Name & "Enclosing_Compilation_Unit");
if Arg_Kind = Not_An_Element then
Raise_ASIS_Inappropriate_Element
(Package_Name & "Enclosing_Compilation_Unit",
Wrong_Kind => Arg_Kind);
end if;
return Encl_Unit (Element);
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Element,
Outer_Call => Package_Name & "Enclosing_Compilation_Unit");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Enclosing_Compilation_Unit",
Ex => Ex,
Arg_Element => Element);
end Enclosing_Compilation_Unit;
-----------------------------------------------------------------------------
function Context_Clause_Elements
(Compilation_Unit : Asis.Compilation_Unit;
Include_Pragmas : Boolean := False)
return Asis.Context_Clause_List
is
Unit_Kind : Asis.Unit_Kinds; -- Compilation_Unit kind
List_Before : List_Id;
begin
Check_Validity
(Compilation_Unit, Package_Name & "Context_Clause_Elements");
Unit_Kind := Kind (Compilation_Unit);
if Unit_Kind = Not_A_Unit then
Raise_ASIS_Inappropriate_Compilation_Unit
(Package_Name & "Context_Clause_Elements");
end if;
if Is_Standard (Compilation_Unit) or else
Unit_Kind = A_Nonexistent_Declaration or else
Unit_Kind = A_Nonexistent_Body or else
Unit_Kind = An_Unknown_Unit or else
Unit_Kind = A_Configuration_Compilation or else
Has_Limited_View_Only (Compilation_Unit)
then
-- The last part of the condition comes from the GNAT compilation
-- model. But it seems that it should be in the definition of
-- this query in the ASIS Standard
return Nil_Element_List;
end if;
List_Before := Context_Items (Top (Compilation_Unit));
return N_To_E_List_New
(List => List_Before,
Include_Pragmas => Include_Pragmas,
In_Unit => Compilation_Unit);
exception
when ASIS_Inappropriate_Compilation_Unit =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Context_Clause_Elements",
Bool_Par => Include_Pragmas);
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Context_Clause_Elements",
Ex => Ex,
Arg_CU => Compilation_Unit,
Bool_Par_ON => Include_Pragmas);
end Context_Clause_Elements;
------------------------------------------------------------------------------
function Configuration_Pragmas
(The_Context : Asis.Context)
return Asis.Pragma_Element_List
is
begin
Check_Validity (The_Context, Package_Name & "Configuration_Pragmas");
-- In the GNAT environment, "a list of pragmas that apply to all future
-- compilation_unit elements compiled into The_Context" is defined by
-- the -gnatA and -gnatec options used when calling the compiler and
-- by the content of configuration file(s) at the moment of the compiler
-- call. These things cannot be detected from the set of tree files
-- making up the Context, so the only thing we can do is to return
-- Nil_Element_List
return Nil_Element_List;
exception
when ASIS_Inappropriate_Context =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Configuration_Pragmas");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Configuration_Pragmas",
Ex => Ex);
end Configuration_Pragmas;
-----------------------------------------------------------------------------
function Compilation_Pragmas
(Compilation_Unit : Asis.Compilation_Unit)
return Asis.Pragma_Element_List
is
Unit_Kind : Asis.Unit_Kinds;
Config_Prgms : List_Id := No_List;
List_Before : List_Id;
Next_Pragma : Node_Id;
List_After : List_Id;
begin
Check_Validity (Compilation_Unit,
Package_Name & "Compilation_Pragmas");
Unit_Kind := Kind (Compilation_Unit);
if Unit_Kind = Not_A_Unit then
Raise_ASIS_Inappropriate_Compilation_Unit
(Package_Name & "Compilation_Pragmas");
end if;
if Is_Standard (Compilation_Unit) or else
Unit_Kind = A_Nonexistent_Declaration or else
Unit_Kind = A_Nonexistent_Body or else
Unit_Kind = An_Unknown_Unit or else
Unit_Kind = A_Configuration_Compilation or else
Has_Limited_View_Only (Compilation_Unit)
then
-- The last part of the condition is GNAT-specific
return Nil_Element_List;
end if;
Reset_Context (Encl_Cont_Id (Compilation_Unit));
-- For the GNAT compilation model, we consider that configuration
-- pragmas from the configuration file(s) are applied to the main unit
-- of the compilation only. So if some unit belonging to the Context
-- is compiled only as a supporter of some other units, but not on
-- their own, the result of Compilation_Pragmas applied to this unit
-- does not include any configuration pragmas from the configuration
-- file(s).
if Asis.Extensions.Is_Main_Unit_In_Tree (Compilation_Unit) then
Reset_Main_Tree (Compilation_Unit);
Config_Prgms :=
Config_Pragmas (Aux_Decls_Node (Top (Compilation_Unit)));
end if;
List_Before := Context_Items (Top (Compilation_Unit));
List_After := Pragmas_After (Aux_Decls_Node (Top (Compilation_Unit)));
Set_Element_List
(List => Config_Prgms,
Include_Pragmas => True,
Node_Knd => N_Pragma,
Special_Case => Configuration_File_Pragma,
In_Unit => Compilation_Unit,
Append => False);
-- The middle part - pragmas from the context clause - we have to
-- compose by hands, because we can add to the result only the
-- configuration pragmas
if Present (List_Before) then
Next_Pragma := First (List_Before);
Next_Pragma := Get_Next_Configuration_Pragma (Next_Pragma);
while Present (Next_Pragma) loop
Internal_Asis_Element_Table.Append
(Node_To_Element_New
(Node => Next_Pragma,
In_Unit => Compilation_Unit));
Next_Pragma := Get_Next_Configuration_Pragma (Next (Next_Pragma));
end loop;
end if;
Set_Element_List
(List => List_After,
Include_Pragmas => True,
Node_Knd => N_Pragma,
In_Unit => Compilation_Unit,
Append => True);
return Asis.Pragma_Element_List
(Internal_Asis_Element_Table.Table
(1 .. Internal_Asis_Element_Table.Last));
exception
when ASIS_Inappropriate_Compilation_Unit =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Compilation_Pragmas");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Compilation_Pragmas",
Ex => Ex,
Arg_CU => Compilation_Unit);
end Compilation_Pragmas;
------------------------------------------------------------------------------
function Element_Kind
(Element : Asis.Element)
return Asis.Element_Kinds
is
begin
Check_Validity (Element, Package_Name & "Element_Kind");
return Kind (Element);
end Element_Kind;
-----------------------------------------------------------------------------
function Pragma_Kind
(Pragma_Element : Asis.Pragma_Element)
return Asis.Pragma_Kinds
is
begin
Check_Validity (Pragma_Element, Package_Name & "Pragma_Kind");
return Pragma_Kind_From_Internal (Int_Kind (Pragma_Element));
end Pragma_Kind;
-----------------------------------------------------------------------------
function Defining_Name_Kind
(Defining_Name : Asis.Defining_Name)
return Asis.Defining_Name_Kinds
is
begin
Check_Validity (Defining_Name, Package_Name & "Defining_Name_Kind");
return Defining_Name_Kind_From_Internal (Int_Kind (Defining_Name));
end Defining_Name_Kind;
-----------------------------------------------------------------------------
function Declaration_Kind
(Declaration : Asis.Declaration)
return Asis.Declaration_Kinds
is
begin
Check_Validity (Declaration, Package_Name & "Declaration_Kind");
return Declaration_Kind_From_Internal (Int_Kind (Declaration));
end Declaration_Kind;
----------------
-- Trait_Kind --
----------------
function Trait_Kind (Element : Asis.Element) return Asis.Trait_Kinds is
-- Trait-related flag values:
Is_Abstract : Boolean;
Is_Limited : Boolean;
Is_Aliased : Boolean;
Is_Private : Boolean;
Arg_Node : Node_Id;
Result : Asis.Trait_Kinds := An_Ordinary_Trait;
begin
Check_Validity (Element, Package_Name & "Trait_Kind");
-- ASIS_Element_Kinds.Trait_Kinds literals and GNAT tree flags mapping:
--
-- (This nice piece of documentation is for ASIS/Ada 95 only, we have not
-- extended it for Ada 2005)
--
-- type Trait_Kinds is (
--
-- Not_A_Trait, --> Unexpected element, its node always has no
-- -- corresponding flags and its kind does not belong
-- -- to the Node Kinds for which A_Private_Trait could
-- -- be determined
--
-- An_Ordinary_Trait, --> all flags are set off, and the node kind
-- does not belong to the Node Kinds for which
-- A_Private_Trait could be determined
--
-- An_Aliased_Trait, --> Aliased_Present set ON
--
-- An_Access_Definition_Trait, --> no special flag, could be defined
-- -- on the base of the presence of
-- -- the N_Access_Definition node as the
-- -- child node of the argument node
--
-- A_Reverse_Trait, --> Reverse_Present set ON
--
-- A_Private_Trait, --> except the case of
-- A_Formal_Derived_Type_Definition,
-- -- no special flag is presented in the corresponding
-- -- node, the A_Private_Trait could be defined
-- -- on the base of Node Kinds and setting other
-- -- flags OFF;
-- -- for A_Formal_Derived_Type_Definition -
-- -- Private_Present set ON
--
-- A_Limited_Trait, --> Limited_Present set ON and corresponding node
-- -- does not belong to the Node Kinds for which
-- -- A_Private_Trait could be defined
--
-- A_Limited_Private_Trait, --> Limited_Present set ON and corresponding
-- -- node belongs to the Node Kinds for which
-- -- A_Private_Trait could be defined
--
-- An_Abstract_Trait, --> For types: Abstract_Present set ON and
-- -- corresponding node does not belong to the
-- -- Node Kinds for which A_Private_Trait could be
-- -- defined;
-- -- For subprograms: no special flag, could be
-- -- defined on the base of the Node Kind of the
-- -- argument node
--
-- An_Abstract_Private_Trait, --> except the case of
-- -- A_Formal_Derived_Type_Definition,
-- -- Abstract_Present set ON and corresponding
-- -- node belongs to the Node Kinds for which
-- -- A_Private_Trait could be defined;
-- -- for A_Formal_Derived_Type_Definition -
-- -- Abstract_Present set ON and
-- -- Private_Present set ON
--
-- An_Abstract_Limited_Trait, --> Abstract_Present set ON,
-- -- Limited_Present set ON
-- -- and corresponding node does not belong
-- -- to the Node Kinds for which
-- -- A_Private_Trait could be defined
--
-- An_Abstract_Limited_Private_Trait); --> Abstract_Present set ON,
-- -- Limited_Present set ON and
-- -- corresponding node belongs
-- -- to Node Kinds for which
-- -- A_Private_Trait could be defined
--
----------------------------------------------------------------------------
-- Expected Argument_Kinds: -> Corresponding tree Nodes:
-- Possible Trait values: --> Provided trait-related flags and
-- combination of their values
-- corresponding to the Trait value
----------------------------------------------------------------------------
--
-- Expected Declaration_Kinds:
-- ==========================
--
-- A_Private_Type_Declaration -> N_Private_Type_Declaration (*1*)
-- A_Private_Trait --> Abstract_Present = OFF
-- Limited_Present = OFF
--
-- A_Limited_Private_Trait --> Abstract_Present = OFF
-- Limited_Present = ON
--
-- An_Abstract_Private_Trait --> Abstract_Present = ON
-- Limited_Present = OFF
--
-- An_Abstract_Limited_Private_Trait --> Abstract_Present = ON
-- Limited_Present = ON
-----------------------------------------------
-- A_Private_Extension_Declaration -> N_Private_Extension_Declaration (*2*)
-- A_Private_Trait --> Abstract_Present = OFF
--
-- An_Abstract_Private_Trait --> Abstract_Present = ON
-----------------------------------------------
-- A_Variable_Declaration -> N_Object_Declaration (*3*)
-- An_Ordinary_Trait --> Aliased_Present = OFF
--
-- An_Aliased_Trait --> Aliased_Present = ON
-----------------------------------------------
-- A_Constant_Declaration -> N_Object_Declaration (*3*)
-- An_Ordinary_Trait --> Aliased_Present = OFF
--
-- An_Aliased_Trait --> Aliased_Present = ON
-----------------------------------------------
-- A_Deferred_Constant_Declaration -> N_Object_Declaration (*3*)
-- An_Ordinary_Trait --> Aliased_Present = OFF
--
-- An_Aliased_Trait --> Aliased_Present = ON
-----------------------------------------------
-- A_Discriminant_Specification -> N_Discriminant_Specification (*4*)
-- Has no trait-related flags
--
-- An_Ordinary_Trait --> Nkind(Discriminant_Type(Definition.Node))
-- /= N_Access_Definition
-- An_Access_Definition_Trait--> Nkind(Discriminant_Type(Definition.Node))
-- = N_Access_Definition
-----------------------------------------------
-- A_Loop_Parameter_Specification -> N_Loop_Parameter_Specification (*5*)
-- A_Generalized_Iterator_Specification -> N_Iterator_Specification (*5*)
-- An_Element_Iterator_Specification -> N_Iterator_Specification (*5*)
--
-- An_Ordinary_Trait --> Reverse_Present = OFF
--
-- A_Reverse_Trait --> Reverse_Present = ON
-----------------------------------------------
-- A_Procedure_Declaration -> N_Subprogram_Declaration (*6*)
-- An_Ordinary_Trait --> No flag needed to determine the trait
-- -> N_Abstract_Subprogram_Declaration
-- An_Abstract_Trait --> No flag needed to determine the trait
-----------------------------------------------
-- A_Function_Declaration -> N_Subprogram_Declaration (*6*)
-- An_Ordinary_Trait --> No flag needed to determine the trait
-- -> N_Abstract_Subprogram_Declaration
-- An_Abstract_Trait --> No flag needed to determine the trait
-----------------------------------------------
-- A_Parameter_Specification -> N_Parameter_Specification (*4*)
-- Has no trait-related flags
--
-- An_Ordinary_Trait --> Nkind(Parameter_Type(Definition.Node))
-- /= N_Access_Definition
-- An_Access_Definition_Trait --> Nkind(Parameter_Type(Definition.Node))
-- = N_Access_Definition
-----------------------------------------------
--
-- Expected Definition_Kinds:
-- =========================
--
-- A_Component_Definition -> N_Subtype_Indication (*10*)
-- N_Identifier
-- N_Expanded_Name
-- An_Ordinary_Trait --> Aliased_Present set OFF in the PARENT node
-- An_Aliased_Trait --> Aliased_Present set ON in the PARENT nod
--
-- A_Private_Type_Definition -> N_Private_Type_Declaration (*1*)
-- The situation is just the same as for A_Private_Type_Declaration
-----------------------------------------------
-- A_Tagged_Private_Type_Definition-> N_Private_Type_Declaration (*1*)
-- The situation is just the same as for A_Private_Type_Declaration
-----------------------------------------------
-- A_Private_Extension_Definition -> N_Private_Extension_Declaration (*2*)
-- The situation is just the same as for N_Private_Extension_Declaration
-----------------------------------------------
--
-- Expected Type_Kinds:
-- ===================
--
-----------------------------------------------
-- A_Derived_Type_Definition -> N_Derived_Type_Definition (*7*)
-- An_Ordinary_Trait --> Abstract_Present = OFF
--
-- An_Abstract_Trait --> Abstract_Present = ON
-----------------------------------------------
-- A_Derived_Record_Extension_Definition -> N_Derived_Type_Definition (*7*)
-- An_Ordinary_Trait --> Abstract_Present = OFF
--
-- An_Abstract_Trait --> Abstract_Present = ON
-----------------------------------------------
-- A_Record_Type_Definition -> N_Record_Definition (*8*)
-- An_Ordinary_Trait --> Abstract_Present = OFF
-- Limited_Present = OFF
--
-- An_Abstract_Trait --> Abstract_Present = ON
-- Limited_Present = OFF
--
-- A_Limited_Trait --> Abstract_Present = OFF
-- Limited_Present = ON
--
-- An_Abstract_Limited_Trait --> Abstract_Present = ON
-- Limited_Present = ON
-----------------------------------------------
-- A_Tagged_Record_Type_Definition -> N_Record_Definition (*8*)
-- An_Ordinary_Trait --> Abstract_Present = OFF
-- Limited_Present = OFF
--
-- An_Abstract_Trait --> Abstract_Present = ON
-- Limited_Present = OFF
--
-- A_Limited_Trait --> Abstract_Present = OFF
-- Limited_Present = ON
--
-- An_Abstract_Limited_Trait --> Abstract_Present = ON
-- Limited_Present = ON
-----------------------------------------------
--
-- Expected Formal_Type_Kinds:
-- ==========================
--
-- A_Formal_Private_Type_Definition -> N_Formal_Private_Type_Definition
-- (*1*)
-- The situation is just the same as for A_Private_Type_Declaration
-----------------------------------------------
-- A_Formal_Tagged_Private_Type_Definition ->
-- N_Formal_Private_Type_Definition (*1*)
--
-- The situation is just the same as for A_Private_Type_Declaration
-----------------------------------------------
-- A_Formal_Derived_Type_Definition -> N_Formal_Derived_Type_Definition(*9*)
-- An_Ordinary_Trait --> Abstract_Present = OFF
-- Private_Present = OFF
--
-- An_Abstract_Trait --> Abstract_Present = ON
-- Private_Present = OFF
--
-- A_Private_Trait --> Abstract_Present = OFF
-- Private_Present = ON
--
-- An_Abstract_Private_Trait --> Abstract_Present = ON
-- Private_Present = ON
------------------------------------------------------------------------------
Arg_Node := Node (Element);
case Int_Kind (Element) is
-- expected argument:
when -- (*1*)
A_Private_Type_Declaration
| A_Private_Type_Definition
| A_Tagged_Private_Type_Definition
| A_Formal_Private_Type_Definition
| A_Formal_Tagged_Private_Type_Definition =>
Is_Abstract := Abstract_Present (Arg_Node);
Is_Limited := Limited_Present (Arg_Node);
if Is_Abstract and Is_Limited then
Result := An_Abstract_Limited_Private_Trait;
elsif Is_Abstract then
Result := An_Abstract_Private_Trait;
elsif Is_Limited then
Result := A_Limited_Private_Trait;
else
Result := A_Private_Trait;
end if;
when -- (*2*)
A_Private_Extension_Declaration
| A_Private_Extension_Definition =>
Is_Abstract := Abstract_Present (Arg_Node);
if Is_Abstract then
Result := An_Abstract_Private_Trait;
else
Result := A_Private_Trait;
end if;
when -- (*3*)
A_Variable_Declaration
| A_Constant_Declaration
| A_Deferred_Constant_Declaration =>
Is_Aliased := Aliased_Present (Arg_Node);
if Is_Aliased then
Result := An_Aliased_Trait;
end if;
when -- (*4*)
A_Discriminant_Specification
| A_Parameter_Specification =>
-- --|A2005 start
if Null_Exclusion_Present (Arg_Node) then
Result := A_Null_Exclusion_Trait;
elsif Int_Kind (Element) = A_Parameter_Specification
and then
Aliased_Present (Arg_Node)
then
Result := An_Aliased_Trait;
end if;
-- --|A2005 end
when -- (*5*)
A_Loop_Parameter_Specification |
A_Generalized_Iterator_Specification |
An_Element_Iterator_Specification =>
if Reverse_Present (Arg_Node) then
Result := A_Reverse_Trait;
end if;
when -- (*6*)
A_Procedure_Declaration
| A_Function_Declaration =>
if Nkind (Arg_Node) = N_Abstract_Subprogram_Declaration then
Result := An_Abstract_Trait;
end if;
-- --|A2005 start
when
A_Formal_Procedure_Declaration
| A_Formal_Function_Declaration =>
if Nkind (Arg_Node) = N_Formal_Abstract_Subprogram_Declaration then
Result := An_Abstract_Trait;
end if;
-- --|A2005 end
when -- (*7*)
A_Derived_Type_Definition
| A_Derived_Record_Extension_Definition =>
if Abstract_Present (Arg_Node) then
Result := An_Abstract_Trait;
end if;
when -- (*8*)
A_Record_Type_Definition
| A_Tagged_Record_Type_Definition =>
Is_Abstract := Abstract_Present (Arg_Node);
Is_Limited := Limited_Present (Arg_Node);
if Is_Abstract and Is_Limited then
Result := An_Abstract_Limited_Trait;
elsif Is_Abstract then
Result := An_Abstract_Trait;
elsif Is_Limited then
Result := A_Limited_Trait;
end if;
when -- (*9*)
A_Formal_Derived_Type_Definition =>
Is_Abstract := Abstract_Present (Arg_Node);
Is_Limited := Limited_Present (Arg_Node);
Is_Private := Private_Present (Arg_Node);
if Is_Abstract and Is_Limited and Is_Private then
Result := An_Abstract_Limited_Private_Trait;
elsif Is_Abstract and Is_Limited then
Result := An_Abstract_Limited_Trait;
elsif Is_Abstract and Is_Private then
Result := An_Abstract_Private_Trait;
elsif Is_Limited and Is_Private then
Result := A_Limited_Private_Trait;
elsif Is_Abstract then
Result := An_Abstract_Trait;
elsif Is_Limited then
Result := A_Limited_Trait;
elsif Is_Private then
Result := A_Private_Trait;
end if;
when -- (*10*)
A_Component_Definition =>
if Aliased_Present (R_Node (Element)) then
Result := An_Aliased_Trait;
end if;
-- --|A2005 start
when A_With_Clause =>
Is_Limited := Limited_Present (Arg_Node);
Is_Private := Private_Present (Arg_Node);
if Is_Limited then
if Is_Private then
Result := A_Limited_Private_Trait;
else
Result := A_Limited_Trait;
end if;
elsif Is_Private then
Result := A_Private_Trait;
end if;
when Internal_Access_Type_Kinds =>
if Null_Exclusion_Present (Arg_Node) then
Result := A_Null_Exclusion_Trait;
end if;
when Internal_Access_Definition_Kinds =>
if Present (Sinfo.Access_To_Subprogram_Definition (Arg_Node)) then
Arg_Node := Sinfo.Access_To_Subprogram_Definition (Arg_Node);
end if;
if Null_Exclusion_Present (Arg_Node) then
Result := A_Null_Exclusion_Trait;
end if;
when A_Subtype_Indication =>
Arg_Node := Parent (Arg_Node);
if Null_Exclusion_Present (Arg_Node) then
Result := A_Null_Exclusion_Trait;
end if;
-- --|A2005 end
when others =>
-- unexpected argument:
Result := Not_A_Trait;
end case;
return Result;
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Element,
Outer_Call => Package_Name & "Trait_Kind");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Trait_Kind",
Ex => Ex,
Arg_Element => Element);
end Trait_Kind;
------------------------------------------------------------------------------
function Declaration_Origin
(Declaration : Asis.Declaration)
return Asis.Declaration_Origins
is
begin
-- The implementation may require revising when the semantic queries
-- and implicit elements are implemented.
Check_Validity (Declaration, Package_Name & "Declaration_Origin");
if Int_Kind (Declaration) not in Internal_Declaration_Kinds then
return Not_A_Declaration_Origin;
elsif not Is_From_Implicit (Declaration) then
return An_Explicit_Declaration;
elsif Is_From_Inherited (Declaration) then
return An_Implicit_Inherited_Declaration;
else
return An_Implicit_Predefined_Declaration;
end if;
end Declaration_Origin;
-----------------------------------------------------------------------------
function Mode_Kind
(Declaration : Asis.Declaration)
return Asis.Mode_Kinds
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Declaration);
Arg_Node : Node_Id;
begin
Check_Validity (Declaration, Package_Name & "Mode_Kind");
if not (Arg_Kind = A_Parameter_Specification or else
Arg_Kind = A_Formal_Object_Declaration)
then
return Not_A_Mode;
end if;
Arg_Node := Node (Declaration);
if In_Present (Arg_Node) and then Out_Present (Arg_Node) then
return An_In_Out_Mode;
elsif In_Present (Arg_Node) then
return An_In_Mode;
elsif Out_Present (Arg_Node) then
return An_Out_Mode;
else
return A_Default_In_Mode;
end if;
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Declaration,
Outer_Call => Package_Name & "Mode_Kind");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Mode_Kind",
Ex => Ex,
Arg_Element => Declaration);
end Mode_Kind;
-----------------------------------------------------------------------------
function Default_Kind
(Declaration : Asis.Generic_Formal_Parameter)
return Asis.Subprogram_Default_Kinds
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Declaration);
Arg_Node : Node_Id;
begin
Check_Validity (Declaration, Package_Name & "Default_Kind");
Arg_Node := Node (Declaration);
if not (Arg_Kind = A_Formal_Procedure_Declaration or else
Arg_Kind = A_Formal_Function_Declaration)
then
return Not_A_Default;
elsif Box_Present (Arg_Node) then
return A_Box_Default;
elsif Present (Default_Name (Arg_Node)) then
return A_Name_Default;
elsif Nkind (Specification (Arg_Node)) = N_Procedure_Specification
and then
Null_Present (Specification (Arg_Node))
then
return A_Null_Default;
else
return A_Nil_Default;
end if;
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Declaration,
Outer_Call => Package_Name & "Default_Kind");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Default_Kind",
Ex => Ex,
Arg_Element => Declaration);
end Default_Kind;
-----------------------------------------------------------------------------
function Definition_Kind
(Definition : Asis.Definition)
return Asis.Definition_Kinds
is
begin
Check_Validity (Definition, Package_Name & "Definition_Kind");
return Definition_Kind_From_Internal (Int_Kind (Definition));
end Definition_Kind;
-----------------------------------------------------------------------------
function Type_Kind
(Definition : Asis.Type_Definition)
return Asis.Type_Kinds
is
begin
Check_Validity (Definition, Package_Name & "Type_Kind");
return Type_Kind_From_Internal (Int_Kind (Definition));
end Type_Kind;
-----------------------------------------------------------------------------
function Formal_Type_Kind
(Definition : Asis.Type_Definition)
return Asis.Formal_Type_Kinds
is
begin
Check_Validity (Definition, Package_Name & "Formal_Type_Kind");
return Formal_Type_Kind_From_Internal (Int_Kind (Definition));
end Formal_Type_Kind;
-----------------------------------------------------------------------------
function Access_Type_Kind
(Definition : Asis.Type_Definition)
return Asis.Access_Type_Kinds
is
begin
Check_Validity (Definition, Package_Name & "Access_Type_Kind");
return Access_Type_Kind_From_Internal (Int_Kind (Definition));
end Access_Type_Kind;
-----------------------------------------------------------------------------
function Root_Type_Kind
(Definition : Asis.Type_Definition)
return Asis.Root_Type_Kinds
is
begin
Check_Validity (Definition, Package_Name & "Root_Type_Kind");
return Root_Type_Kind_From_Internal (Int_Kind (Definition));
end Root_Type_Kind;
-----------------------------------------------------------------------------
function Constraint_Kind
(Definition : Asis.Definition)
return Asis.Constraint_Kinds
is
begin
Check_Validity (Definition, Package_Name & "Constraint_Kind");
return Constraint_Kind_From_Internal (Int_Kind (Definition));
end Constraint_Kind;
-----------------------------------------------------------------------------
function Discrete_Range_Kind
(Definition : Asis.Definition)
return Asis.Discrete_Range_Kinds
is
begin
Check_Validity (Definition, "Discrete_Range_Kind.Expression_Kind");
return Discrete_Range_Kind_From_Internal (Int_Kind (Definition));
end Discrete_Range_Kind;
-----------------------------------------------------------------------------
function Expression_Kind
(Expression : Asis.Expression)
return Asis.Expression_Kinds
is
begin
Check_Validity (Expression, Package_Name & "Expression_Kind");
return Expression_Kind_From_Internal (Int_Kind (Expression));
end Expression_Kind;
-----------------------------------------------------------------------------
function Operator_Kind
(Element : Asis.Element)
return Asis.Operator_Kinds
is
begin
Check_Validity (Element, Package_Name & "Operator_Kind");
return Operator_Kind_From_Internal (Int_Kind (Element));
end Operator_Kind;
-----------------------------------------------------------------------------
function Attribute_Kind
(Expression : Asis.Expression)
return Asis.Attribute_Kinds
is
begin
Check_Validity (Expression, Package_Name & "Attribute_Kind");
return Attribute_Kind_From_Internal (Int_Kind (Expression));
end Attribute_Kind;
-----------------------------------------------------------------------------
function Association_Kind
(Association : Asis.Association)
return Asis.Association_Kinds
is
begin
Check_Validity (Association, Package_Name & "Association_Kind");
return Association_Kind_From_Internal (Int_Kind (Association));
end Association_Kind;
-----------------------------------------------------------------------------
function Statement_Kind
(Statement : Asis.Statement)
return Asis.Statement_Kinds
is
begin
Check_Validity (Statement, Package_Name & "Statement_Kind");
return Statement_Kind_From_Internal (Int_Kind (Statement));
end Statement_Kind;
-----------------------------------------------------------------------------
function Path_Kind (Path : Asis.Path) return Asis.Path_Kinds is
begin
Check_Validity (Path, Package_Name & "Clause_Kind");
return Path_Kind_From_Internal (Int_Kind (Path));
end Path_Kind;
-----------------------------------------------------------------------------
function Clause_Kind (Clause : Asis.Clause) return Asis.Clause_Kinds is
begin
Check_Validity (Clause, Package_Name & "Clause_Kind");
return Clause_Kind_From_Internal (Int_Kind (Clause));
end Clause_Kind;
-----------------------------------------------------------------------------
function Representation_Clause_Kind
(Clause : Asis.Clause)
return Asis.Representation_Clause_Kinds
is
begin
Check_Validity (Clause, Package_Name & "Representation_Clause_Kind");
return Representation_Clause_Kind_From_Internal (Int_Kind (Clause));
end Representation_Clause_Kind;
-----------------------------------------------------------------------------
function Is_Nil (Right : Asis.Element) return Boolean is
begin
return Right = Asis.Nil_Element;
end Is_Nil;
-----------------------------------------------------------------------------
function Is_Nil (Right : Asis.Element_List) return Boolean is
begin
return Right'Length = 0;
end Is_Nil;
-----------------------------------------------------------------------------
function Is_Equal
(Left : Asis.Element;
Right : Asis.Element)
return Boolean
is
C_Left : Context_Id;
C_Right : Context_Id;
U_Left : Unit_Id;
U_Right : Unit_Id;
CU_Left : Compilation_Unit;
CU_Right : Compilation_Unit;
N_Left : Node_Id;
N_Right : Node_Id;
Result : Boolean := False;
begin
Check_Validity (Left, Package_Name & "Is_Equal");
Check_Validity (Right, Package_Name & "Is_Equal");
-- To minimize the performance penalties, we are trying to filter
-- out simple cases first. These are (more or less) simple cases
-- when the function should return False
-- First, checking the case when one of the arguments is Nil_Element
if Int_Kind (Left) = Not_An_Element or else
Int_Kind (Right) = Not_An_Element
then
return (Int_Kind (Left) = Int_Kind (Right));
end if;
-- Then, we are checking if the basic properties of the argument are
-- the same
if not (Special_Case (Left) = Special_Case (Right) and then
Int_Kind (Left) = Int_Kind (Right) and then
Character_Code (Left) = Character_Code (Right) and then
Is_From_Implicit (Left) = Is_From_Implicit (Right) and then
Is_From_Inherited (Left) = Is_From_Inherited (Right) and then
Is_From_Instance (Left) = Is_From_Instance (Right) and then
Normalization_Case (Left) = Normalization_Case (Right) and then
Parenth_Count (Left) = Parenth_Count (Right))
then
return False;
end if;
-- Now, checking that arguments are from the same Ada unit
C_Left := Encl_Cont_Id (Left);
U_Left := Encl_Unit_Id (Left);
C_Right := Encl_Cont_Id (Right);
U_Right := Encl_Unit_Id (Right);
if C_Left = C_Right then
if U_Left /= U_Right then
return False;
end if;
else
-- This case is a bit more complicated: we have to compare names
-- and time stamps of enclosed units
if U_Left = Standard_Id or else U_Right = Standard_Id then
if U_Left /= U_Right then
return False;
end if;
else
if Time_Stamp (C_Left, U_Left) /=
Time_Stamp (C_Right, U_Right)
then
return False;
end if;
-- Here we have to compare unit names. Let's check unit kind
-- and class first
CU_Left := Encl_Unit (Left);
CU_Right := Encl_Unit (Right);
if not (Kind (CU_Left) = Kind (CU_Right) and then
Class (CU_Left) = Class (CU_Right))
then
return False;
end if;
-- And now - unit names. This case does not seem to be
-- encountered very often, so we simply use Unit_Full_Name
-- query to avoid manual Context switching:
if Asis.Compilation_Units.Unit_Full_Name (CU_Left) /=
Asis.Compilation_Units.Unit_Full_Name (CU_Right)
then
return False;
end if;
end if;
end if;
-- And if we are here, we are in the following situation: both Left
-- and Right are non-nil Elements, they have all their properties
-- the same and they are from the same Compilation_Unit.
-- And now we have to check if they represents the same construct.
if U_Left = Standard_Id or else
(C_Left = C_Right
and then
Encl_Tree (Left) = Encl_Tree (Right))
then
-- In Standard, we may just compare the node values.
-- In the same tree we may do the same
return R_Node (Left) = R_Node (Right);
end if;
-- In case of configuration pragmas and components thereof we are very
-- conservative - two elements can be equal only if there are from
-- the same tree. The reason for this is that in ASIS we have no
-- means to control that the content of the configuration files
-- is the same in different trees.
if Special_Case (Left) = Configuration_File_Pragma then
return Encl_Tree (Left) = Encl_Tree (Right) and then
R_Node (Left) = R_Node (Right);
end if;
-- And if we are here, we have to compare Elements obtained from
-- different trees
if not Is_From_Instance (Left) then
-- May be, we have to use source-trace-based approach for
-- all cases....????
return Rel_Sloc (Left) = Rel_Sloc (Right);
end if;
-- If we are here, we have to compare node traces.
Reset_Context (C_Left);
N_Left := R_Node (Left);
Create_Node_Trace (N_Left);
Reset_Context (C_Right);
N_Right := R_Node (Right);
Result := True;
for J in Node_Trace.First .. Node_Trace.Last loop
if No (N_Right) or else
not Is_Equal (N_Right, Node_Trace.Table (J))
then
Result := False;
exit;
end if;
N_Right := A4G.Asis_Tables.Enclosing_Scope (N_Right);
end loop;
return Result;
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information (Outer_Call => Package_Name & "Is_Equal");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Is_Equal",
Ex => Ex,
Arg_Element => Left,
Arg_Element_2 => Right);
end Is_Equal;
-----------------------------------------------------------------------------
function Is_Identical
(Left : Asis.Element;
Right : Asis.Element)
return Boolean
is
C_Left : Context_Id;
C_Right : Context_Id;
begin
Check_Validity (Left, Package_Name & "Is_Identical");
Check_Validity (Right, Package_Name & "Is_Identical");
C_Left := Encl_Cont_Id (Left);
C_Right := Encl_Cont_Id (Right);
if C_Left /= C_Right then
return False;
else
return Is_Equal (Left, Right);
end if;
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information (Outer_Call => Package_Name & "Is_Identical");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Is_Identical",
Ex => Ex,
Arg_Element => Left,
Arg_Element_2 => Right);
end Is_Identical;
------------------------------------------------------------------------------
-- The general principle of the implementation
-- of the Is_Part_Of_... functions:
--
-- These functions simply returns the corresponding flag value from the
-- Element passed as their argument. All necessary work should be done
-- during the creation of the Element when these flags are set
--
-- All of them (as well as the function Declaration_Origin above) will
-- require revisiting during semantic queries implementation
------------------------------------------------------------------------------
function Is_Part_Of_Implicit (Element : Asis.Element) return Boolean is
begin
Check_Validity (Element, Package_Name & "Is_Part_Of_Implicit");
return Is_From_Implicit (Element) or else
Normalization_Case (Element) in Normalized_Association;
-- for normalized associations Is_Part_Of_Implicit is not set ON ???
-- unless the association is from some enclosing implicit construct. ???
end Is_Part_Of_Implicit;
-----------------------------------------------------------------------------
function Is_Part_Of_Inherited (Element : Asis.Element) return Boolean is
begin
Check_Validity (Element, Package_Name & "Is_Part_Of_Inherited");
return Is_From_Inherited (Element);
end Is_Part_Of_Inherited;
-----------------------------------------------------------------------------
function Is_Part_Of_Instance (Element : Asis.Element) return Boolean is
begin
Check_Validity (Element, Package_Name & "Is_Part_Of_Instance");
return Is_From_Instance (Element);
end Is_Part_Of_Instance;
-----------------------------------------------------------------------------
function Enclosing_Element
(Element : Asis.Element)
return Asis.Element
is
Argument_Kind : constant Internal_Element_Kinds := Int_Kind (Element);
Arg_Spec_Case : constant Special_Cases := Special_Case (Element);
begin
Check_Validity (Element, Package_Name & "Enclosing_Element");
if Argument_Kind = Not_An_Element then
Raise_ASIS_Inappropriate_Element
(Diagnosis => Package_Name & "Enclosing_Element",
Wrong_Kind => Argument_Kind);
end if;
-- if the argument is an expanded generic declaration we have
-- to return the corresponding instantiation:
if Arg_Spec_Case in Expanded_Spec then
return Corresponding_Instantiation (Element);
end if;
-- if the argument is from an expanded generic declaration,
-- we have to be careful when coming from some top-level component
-- of the expanded declaration to the declaration itself - we
-- need to set the Special_Case field properly
if Is_From_Instance (Element) and then
not Is_From_Implicit (Element)
then
if Arg_Spec_Case in
Dummy_Base_Attribute_Designator .. Dummy_Class_Attribute_Prefix
then
declare
Result : Asis.Element := Element;
begin
Set_Special_Case (Result, Not_A_Special_Case);
if Arg_Spec_Case = Dummy_Class_Attribute_Designator
or else
Arg_Spec_Case = Dummy_Class_Attribute_Prefix
then
Set_Int_Kind (Result, A_Class_Attribute);
elsif Arg_Spec_Case = Dummy_Base_Attribute_Designator
or else
Arg_Spec_Case = Dummy_Base_Attribute_Prefix
then
Set_Int_Kind (Result, A_Base_Attribute);
end if;
return Result;
end;
else
return Enclosing_For_Explicit_Instance_Component (Element);
end if;
end if;
if not (Is_From_Implicit (Element) or else
Is_From_Inherited (Element))
or else
-- 'floating' labels in Ada 2012
Statement_Kind (Element) = A_Null_Statement
then
return Enclosing_Element_For_Explicit (Element);
elsif Is_From_Limited_View (Element) then
return Enclosing_Element_For_Limited_View (Element);
else
return Enclosing_Element_For_Implicit (Element);
end if;
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Element,
Outer_Call => Package_Name & "Enclosing_Element");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Enclosing_Element",
Ex => Ex,
Arg_Element => Element);
end Enclosing_Element;
------------------------------------------------------------------------------
function Enclosing_Element
(Element : Asis.Element;
Expected_Enclosing_Element : Asis.Element)
return Asis.Element
is
begin
Check_Validity
(Element,
Package_Name & "Enclosing_Element (the Element parameter)");
Check_Validity
(Expected_Enclosing_Element,
Package_Name &
"Enclosing_Element (the Expected_Enclosing_Element parameter)");
return Enclosing_Element (Element);
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Element,
Outer_Call => Package_Name & "Enclosing_Element");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Enclosing_Element",
Ex => Ex,
Arg_Element => Element,
Arg_Element_2 => Expected_Enclosing_Element);
end Enclosing_Element;
-----------------------------------------------------------------------------
function Pragmas
(The_Element : Asis.Element)
return Asis.Pragma_Element_List
is
-- This implementation is based on the following statement in the function
-- documentation:
--
-- This interface returns exactly those pragmas that would be returned by the
-- various interfaces, that accept these same argument kinds, and that
-- return Declaration_Lists and Statement_Lists, where the inclusion of
-- Pragmas is controlled by an Include_Pragmas parameter.
--
-- The general idea of the implementation is straightforward - to get
-- the "full" Element_List by the call of the corresponding interface
-- with Include_Pragmas => True, and then select only A_Pragma elements
-- from this intermediate result.
--
-- Some loss of effectiveness could be considered as the disadvantage of
-- this approach, but its advantages are:
--
-- - it saves implementation efforts;
-- - it allows to check whether the documentation fragment cited above
-- is really correct;
-- - it saves the debugging efforts on the first prototyping stage
-- (there is no need for the special debugging of this function
-- if other ASIS interfaces used for its implementation work correctly);
-- - it is more convenient for incremental development
-- - it yields the vendor-independent implementation of this function
Context_Internal_Kind : Internal_Element_Kinds;
function Extract_Pragmas
(List : Asis.Element_List)
return Asis.Pragma_Element_List;
-- function extracts Elements of A_Pragma kind from its
-- List parameter and returns the new List constructed from these
-- Pragma Elements (in their order of appearance) as its result
function Extract_Pragmas
(List : Asis.Element_List)
return Asis.Pragma_Element_List
is
Pragma_List : Asis.Pragma_Element_List (List'Range);
Pragma_List_Actual_Lenght : Asis.ASIS_Integer := 0;
begin
for I in List'Range loop
if Element_Kind (List (I)) = A_Pragma then
Pragma_List_Actual_Lenght := Pragma_List_Actual_Lenght + 1;
Pragma_List (Pragma_List_Actual_Lenght) := List (I);
end if;
end loop;
return Pragma_List (1 .. Pragma_List_Actual_Lenght);
end Extract_Pragmas;
begin -- Pragmas
Check_Validity (The_Element, Package_Name & "Pragmas");
Context_Internal_Kind := Int_Kind (The_Element);
if not -- Appropriate Element_Kinds:
(Context_Internal_Kind in Internal_Statement_Path_Kinds
or else Context_Internal_Kind = An_Exception_Handler
-- Appropriate Declaration_Kinds:
or else Context_Internal_Kind = A_Procedure_Body_Declaration
or else Context_Internal_Kind = A_Function_Body_Declaration
or else Context_Internal_Kind = A_Package_Declaration
or else Context_Internal_Kind = A_Package_Body_Declaration
or else Context_Internal_Kind = A_Task_Body_Declaration
or else Context_Internal_Kind = A_Protected_Body_Declaration
or else Context_Internal_Kind = An_Entry_Body_Declaration
or else Context_Internal_Kind = A_Generic_Procedure_Declaration
or else Context_Internal_Kind = A_Generic_Function_Declaration
or else Context_Internal_Kind = A_Generic_Package_Declaration
-- Appropriate Definition_Kinds:
or else Context_Internal_Kind = A_Record_Definition
or else Context_Internal_Kind = A_Variant_Part
or else Context_Internal_Kind = A_Variant
or else Context_Internal_Kind = A_Task_Definition
or else Context_Internal_Kind = A_Protected_Definition
-- Appropriate Statement_Kinds:
or else Context_Internal_Kind = A_Loop_Statement
or else Context_Internal_Kind = A_While_Loop_Statement
or else Context_Internal_Kind = A_For_Loop_Statement
or else Context_Internal_Kind = A_Block_Statement
or else Context_Internal_Kind = An_Accept_Statement
-- Representation_Clause_Kinds:
or else Context_Internal_Kind = A_Record_Representation_Clause)
then
Raise_ASIS_Inappropriate_Element
(Diagnosis => Package_Name & "Pragmas",
Wrong_Kind => Context_Internal_Kind);
end if;
case Context_Internal_Kind is
-- Appropriate Element_Kinds:
when Internal_Path_Kinds =>
-- A_Path: (pragmas from the statement list)
return Extract_Pragmas (
Asis.Statements.Sequence_Of_Statements (
Path => The_Element,
Include_Pragmas => True));
when An_Exception_Handler =>
-- (pragmas from the statement list)
return Extract_Pragmas (
Asis.Statements.Handler_Statements (
Handler => The_Element,
Include_Pragmas => True));
-- Appropriate Declaration_Kinds:
when A_Procedure_Body_Declaration -- (pragmas from decl region
| A_Function_Body_Declaration -- + statements)
| A_Package_Body_Declaration -- !! SEE OPEN_PROBLEMS.1 BELOW
| A_Task_Body_Declaration
| An_Entry_Body_Declaration =>
return (Extract_Pragmas (
Asis.Declarations.Body_Declarative_Items (
Declaration => The_Element,
Include_Pragmas => True))
&
Extract_Pragmas (
Asis.Declarations.Body_Statements (
Declaration => The_Element,
Include_Pragmas => True)));
when A_Package_Declaration =>
-- (pragmas from visible + private decl regions)
return (Extract_Pragmas (
Asis.Declarations.Visible_Part_Declarative_Items (
Declaration => The_Element,
Include_Pragmas => True))
&
Extract_Pragmas (
Asis.Declarations.Private_Part_Declarative_Items (
Declaration => The_Element,
Include_Pragmas => True)));
when A_Protected_Body_Declaration =>
-- (pragmas from decl region)
return Extract_Pragmas (
Asis.Declarations.Protected_Operation_Items (
Declaration => The_Element,
Include_Pragmas => True));
when A_Generic_Procedure_Declaration
| A_Generic_Function_Declaration =>
-- (pragmas from formal decl region
return Extract_Pragmas (
Asis.Declarations.Generic_Formal_Part (
Declaration => The_Element,
Include_Pragmas => True));
when A_Generic_Package_Declaration =>
-- (pragmas from formal + visible + private decl regions)
return (Extract_Pragmas (
Asis.Declarations.Generic_Formal_Part (
Declaration => The_Element,
Include_Pragmas => True))
&
Extract_Pragmas (
Asis.Declarations.Visible_Part_Declarative_Items (
Declaration => The_Element,
Include_Pragmas => True))
&
Extract_Pragmas (
Asis.Declarations.Private_Part_Declarative_Items (
Declaration => The_Element,
Include_Pragmas => True)));
-- Appropriate Definition_Kinds:
when A_Record_Definition
| A_Variant =>
-- (pragmas from the component list)
return Extract_Pragmas (
Asis.Definitions.Record_Components (
Definition => The_Element,
Include_Pragmas => True));
when A_Variant_Part =>
-- (pragmas from between variants)
return Extract_Pragmas (
Asis.Definitions.Variants (
Variant_Part => The_Element,
Include_Pragmas => True));
when A_Task_Definition
| A_Protected_Definition =>
-- (pragmas from visible + private decl regions)
return (Extract_Pragmas (
Asis.Definitions.Visible_Part_Items (
Definition => The_Element,
Include_Pragmas => True))
&
Extract_Pragmas (
Asis.Definitions.Private_Part_Items (
Definition => The_Element,
Include_Pragmas => True)));
-- Appropriate Statement_Kinds:
when A_Loop_Statement
| A_While_Loop_Statement
| A_For_Loop_Statement =>
-- (pragmas from statement list)
return Extract_Pragmas (
Asis.Statements.Loop_Statements (
Statement => The_Element,
Include_Pragmas => True));
when A_Block_Statement =>
-- (pragmas from decl region + statements)
return (Extract_Pragmas (
Asis.Statements.Block_Declarative_Items (
Statement => The_Element,
Include_Pragmas => True))
&
Extract_Pragmas (
Asis.Statements.Block_Statements (
Statement => The_Element,
Include_Pragmas => True)));
when An_Accept_Statement =>
-- (pragmas from statement list+ pragma immediately preceding
-- the first exception handler, if any)
-- !! SEE OPEN_PROBLEMS.2 BELOW
return (Extract_Pragmas (
Asis.Statements.Accept_Body_Statements (
Statement => The_Element,
Include_Pragmas => True))
&
Extract_Pragmas (
Asis.Statements.Accept_Body_Exception_Handlers (
Statement => The_Element,
Include_Pragmas => True)));
-- Appropriate Representation_Clause_Kinds:
when A_Record_Representation_Clause =>
-- (pragmas from component specifications)
return Extract_Pragmas (
Asis.Clauses.Component_Clauses (
Clause => The_Element,
Include_Pragmas => True));
when others =>
-- Should never been reached !!!
raise Internal_Implementation_Error;
end case;
exception
when ASIS_Inappropriate_Element =>
Add_Call_Information (Outer_Call => Package_Name & "Pragmas");
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => The_Element,
Outer_Call => Package_Name & "Pragmas");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Pragmas",
Ex => Ex,
Arg_Element => The_Element);
end Pragmas;
------------------------------------------------------------------------------
-- PARTIALLY IMPLEMENTED
---------------------------
-- Corresponding_Pragmas --
---------------------------
function Corresponding_Pragmas
(Element : Asis.Element)
return Asis.Pragma_Element_List
is
Next_Rep_Node : Node_Id;
Next_Pragma_Node : Node_Id := Empty;
Arg_Node : Node_Id;
begin
Check_Validity (Element, Package_Name & "Corresponding_Pragmas");
if not (Element_Kind (Element) = A_Declaration
or else
Element_Kind (Element) = A_Statement)
then
Raise_ASIS_Inappropriate_Element
(Diagnosis => Package_Name & "Corresponding_Pragmas",
Wrong_Kind => Int_Kind (Element));
end if;
-- At the moment, this is a partial implementation:
-- - for A_Statement argument Nil_Element_List is always returned;
-- - for A_Declaration argument that represents
-- - for A_Declaration argument that corresponds to a unit declaration
-- from the compilation unit or to the proper body of subunit, nothing
-- is returned.
-- - implicit inherited declarations are not properly processed
-- - the result list contains representation pragmas only
if Element_Kind (Element) = A_Statement then
return Nil_Element_List;
else
Asis_Element_Table.Init;
case Declaration_Kind (Element) is
when A_Procedure_Declaration |
A_Function_Declaration |
A_Procedure_Body_Declaration |
A_Function_Body_Declaration |
A_Procedure_Renaming_Declaration |
A_Function_Renaming_Declaration |
An_Entry_Declaration |
A_Procedure_Body_Stub |
A_Function_Body_Stub |
A_Procedure_Instantiation |
A_Function_Instantiation =>
-- Overloadable entities, pragmas are not chained.
-- At the moment we can process only explicit stuff.
-- First, collect Pre- and Postcondition pragmas, if any.
Arg_Node := R_Node (Element);
case Declaration_Kind (Element) is
when A_Procedure_Declaration |
A_Function_Declaration =>
if Is_List_Member (Arg_Node) then
Next_Pragma_Node := Next (Arg_Node);
else
-- Spec of a library-level subprogram
Next_Pragma_Node := Aux_Decls_Node (Parent (Arg_Node));
if Present (Pragmas_After (Next_Pragma_Node)) then
Next_Pragma_Node :=
First (Pragmas_After (Next_Pragma_Node));
else
Next_Pragma_Node := Empty;
end if;
end if;
when A_Procedure_Body_Declaration |
A_Function_Body_Declaration =>
Next_Pragma_Node := First (Sinfo.Declarations (Arg_Node));
while Present (Next_Pragma_Node)
and then
not Comes_From_Source
(Original_Node (Next_Pragma_Node))
loop
Next_Pragma_Node := Next (Next_Pragma_Node);
end loop;
when others => null;
end case;
while Present (Next_Pragma_Node)
and then
Nkind (Next_Pragma_Node) = N_Pragma
loop
if Comes_From_Source (Original_Node (Next_Pragma_Node))
and then
(Pragma_Name (Original_Node (Next_Pragma_Node)) in
Name_Postcondition .. Name_Precondition)
-- SCz
-- or else
-- Pragma_Name (Original_Node (Next_Pragma_Node)) =
-- Name_Test_Case
-- or else
-- Pragma_Name (Original_Node (Next_Pragma_Node)) =
-- Name_Contract_Case)
then
Asis_Element_Table.Append
(Node_To_Element_New
(Starting_Element => Element,
Node => Next_Pragma_Node));
end if;
Next_Pragma_Node := Next (Next_Pragma_Node);
while Present (Next_Pragma_Node)
and then
not Comes_From_Source (Original_Node (Next_Pragma_Node))
loop
Next_Pragma_Node := Next (Next_Pragma_Node);
end loop;
end loop;
-- Now - general processing of all the other pragmas that can be
-- semantically associated with the argument
if not Is_Part_Of_Implicit (Element)
and then
Enclosing_Element (Element) /= Nil_Element
then
case Nkind (Arg_Node) is
when N_Subprogram_Declaration |
N_Abstract_Subprogram_Declaration |
N_Subprogram_Body |
N_Subprogram_Renaming_Declaration |
N_Subprogram_Body_Stub =>
Arg_Node := Defining_Unit_Name (Specification (Arg_Node));
when N_Entry_Declaration =>
Arg_Node := Defining_Identifier (Arg_Node);
when N_Procedure_Instantiation |
N_Function_Instantiation =>
Arg_Node := Defining_Unit_Name (Arg_Node);
when others =>
pragma Assert (False);
null;
end case;
Next_Rep_Node := R_Node (Element);
Next_Rep_Node := Next (Next_Rep_Node);
while Present (Next_Rep_Node) loop
if Nkind (Next_Rep_Node) = N_Pragma
and then
Is_Applied_To (Next_Rep_Node, Arg_Node)
then
Asis_Element_Table.Append
(Node_To_Element_New
(Starting_Element => Element,
Node => Next_Rep_Node));
end if;
Next_Rep_Node := Next (Next_Rep_Node);
end loop;
-- In case if the argument declaration is in the visible part
-- of the package spec, traverse the private part:
Next_Rep_Node := Parent (R_Node (Element));
if Nkind (Next_Rep_Node) = N_Package_Specification
and then
List_Containing (R_Node (Element)) =
Visible_Declarations (Next_Rep_Node)
then
Next_Rep_Node :=
First (Private_Declarations (Next_Rep_Node));
while Present (Next_Rep_Node) loop
if Nkind (Next_Rep_Node) = N_Pragma
and then
Is_Applied_To (Next_Rep_Node, Arg_Node)
then
Asis_Element_Table.Append
(Node_To_Element_New
(Starting_Element => Element,
Node => Next_Rep_Node));
end if;
Next_Rep_Node := Next (Next_Rep_Node);
end loop;
end if;
end if;
when others =>
-- Non-overloadable entity. This implementation is not good,
-- but we have to deal with an error in query definition -
-- the query should actually be applied to an entity, but not
-- to a declaration that can define more than one entity.
declare
Decl_Names : constant Element_List := Names (Element);
Next_Name : Asis.Element;
begin
for J in Decl_Names'Range loop
Next_Name := Decl_Names (J);
if Defining_Name_Kind (Next_Name) =
A_Defining_Expanded_Name
then
Next_Name := Defining_Selector (Next_Name);
end if;
Next_Rep_Node := First_Rep_Item (R_Node (Next_Name));
while Present (Next_Rep_Node) loop
if Nkind (Next_Rep_Node) = N_Pragma then
Asis_Element_Table.Append
(Node_To_Element_New
(Starting_Element => Element,
Node => Next_Rep_Node));
end if;
Next_Rep_Node := Next_Rep_Item (Next_Rep_Node);
end loop;
end loop;
end;
end case;
return Asis.Pragma_Element_List
(Asis_Element_Table.Table (1 .. Asis_Element_Table.Last));
end if;
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Element,
Outer_Call => Package_Name & "Corresponding_Pragmas");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Corresponding_Pragmas",
Ex => Ex,
Arg_Element => Element);
end Corresponding_Pragmas;
-----------------------------------------------------------------------------
function Pragma_Name_Image
(Pragma_Element : Asis.Pragma_Element)
return Wide_String
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Pragma_Element);
Arg_Node : Node_Id;
Image_Start : Source_Ptr;
Image_End : Source_Ptr;
begin
Check_Validity (Pragma_Element, Package_Name & "Pragma_Name_Image");
if Arg_Kind not in Internal_Pragma_Kinds then
Raise_ASIS_Inappropriate_Element
(Diagnosis => Package_Name & "Pragma_Name_Image",
Wrong_Kind => Arg_Kind);
end if;
Arg_Node := Node (Pragma_Element);
Image_Start := Next_Identifier (Sloc (Arg_Node) + 5);
Image_End := Get_Word_End (P => Image_Start,
In_Word => In_Identifier'Access);
return Get_Wide_Word (Image_Start, Image_End);
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Pragma_Element,
Outer_Call => Package_Name & "Pragma_Name_Image");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Pragma_Name_Image",
Ex => Ex,
Arg_Element => Pragma_Element);
end Pragma_Name_Image;
-----------------------------------------------------------------------------
function Pragma_Argument_Associations
(Pragma_Element : Asis.Pragma_Element)
return Asis.Association_List
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Pragma_Element);
Arg_Node : Node_Id;
begin
Check_Validity
(Pragma_Element, Package_Name & "Pragma_Argument_Associations");
if Arg_Kind not in Internal_Pragma_Kinds then
Raise_ASIS_Inappropriate_Element
(Diagnosis => Package_Name & "Pragma_Argument_Associations",
Wrong_Kind => Arg_Kind);
end if;
Arg_Node := Node (Pragma_Element);
return N_To_E_List_New
(List => Pragma_Argument_Associations (Arg_Node),
Internal_Kind => A_Pragma_Argument_Association,
Starting_Element => Pragma_Element);
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Pragma_Element,
Outer_Call => Package_Name & "Pragma_Argument_Associations");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Pragma_Argument_Associations",
Ex => Ex,
Arg_Element => Pragma_Element);
end Pragma_Argument_Associations;
-----------------------------------------------------------------------------
function Debug_Image (Element : Asis.Element) return Wide_String is
LT : String renames A4G.A_Types.ASIS_Line_Terminator;
begin
Check_Validity (Element, Package_Name & "Debug_Image");
Debug_String (Element);
return To_Wide_String (
LT & "Element Debug_Image:" & LT &
Debug_Buffer (1 .. Debug_Buffer_Len));
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Element,
Outer_Call => Package_Name & "Debug_Image");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Debug_Image",
Ex => Ex,
Arg_Element => Element);
end Debug_Image;
-----------------------------------------------------------------------------
-- The following constants are used in the computation of hash values for
-- Elements which are not from Standard:
Line_Pos : constant Natural := 6;
Bit_Pos : constant Natural := 1;
Impl_Pos : Natural renames Bit_Pos;
Inh_Pos : Natural renames Bit_Pos;
Inst_Pos : Natural renames Bit_Pos;
Kind_Pos : constant Natural := 8;
Col_Pos : constant Natural := 4;
Name_Pos : constant Natural := 9;
Spec_Pos : constant Natural := 2;
Max_Names : constant Unsigned_32 := 2 ** Name_Pos;
Max_Cols : constant Unsigned_32 := 2 ** Col_Pos;
Max_Kinds : constant Unsigned_32 := 2 ** Kind_Pos;
Max_Lines : constant Unsigned_32 := 2 ** Line_Pos;
Max_Specs : constant Unsigned_32 := 2 ** Spec_Pos;
subtype Unit_Name_Hash_Range is Integer range 0 .. Integer (Max_Names) - 1;
function Ada_Name_Hash is new GNAT.HTable.Hash (Unit_Name_Hash_Range);
function Hash (Element : Asis.Element) return Asis.ASIS_Integer is
N : Node_Id;
S : Source_Ptr;
L : Physical_Line_Number;
C : Column_Number;
Result : Unsigned_32 := 0;
function Get_Ada_Name return String;
-- Returns Ada name of the Element's enclosing unit appended with 'S' if
-- the unit is a spec unit and with 'B' if it is a body unit. Returns
-- null string for Nil_Element
function Get_Ada_Name return String is
CU : Asis.Compilation_Unit;
Spec_Or_Body : Character := 'B';
begin
if Is_Nil (Element) then
return "";
else
CU := Enclosing_Compilation_Unit (Element);
if Asis.Compilation_Units.Unit_Kind (CU) in
A_Procedure .. A_Generic_Package_Renaming
then
Spec_Or_Body := 'S';
end if;
return To_String
(Asis.Compilation_Units.Unit_Full_Name (CU)) & Spec_Or_Body;
end if;
end Get_Ada_Name;
function To_ASIS_Integer is new
Ada.Unchecked_Conversion
(Source => Unsigned_32,
Target => Asis.ASIS_Integer);
begin
Check_Validity (Element, Package_Name & "Hash");
-- The hash value for Elements is first created as 32-bit unsigned
-- integer and then converted into ASIS_Integer
--
-- Different approaches are used to create this 32-bit unsigned
-- integer value for Elements which are and which are not from the
-- predefined Standard package.
--
-- For Elements from Standard:
-- - If Element represents the An_Enumeration_Literal_Specification
-- or A_Defining_Character_Literal from types Character or
-- Standard_Character, the corresponding character code is used
-- as hash value
-- - otherwise the Node Id of the Element is used as hash value;
--
-- For Elements which are not from Standard the 32 bits are first
-- filled in by the following information:
--
-- 0 .. 8 - the hash value computed from the Ada name of enclosing
-- unit
-- 9 - Is_Part_Of_Implicit
-- 10 .. 13 - column in the source file computed from the Sloc of
-- Element's Node reference
-- 14 - Is_Part_Of_Inherited
-- 15 .. 22 - Internal kind (converted to 'Pos value)
-- 23 - Is_Part_Of_Instance
-- 24 .. 29 - line in the source file computed from the Sloc of
-- Element's Node reference
-- 30 .. 31 - Special_Case (converted to 'Pos value)
--
-- All the values are reduced modulo the corresponding values to fit
-- the corresponding range. In case of extended generic code, line
-- and column are computed as the sum of all the lines and columns
-- in the chain of the source references corresponding to the
-- instantiation
--
-- After creating such a value, it is rotated right by the number of
-- the lines computed from Sloc of Element's Node reference
if Encl_Unit_Id (Element) = Standard_Id then
if Character_Code (Element) /= 0 then
Result := Result + (Unsigned_32 (Character_Code (Element)));
else
N := Node_Value (Element);
Result := Unsigned_32 (N);
end if;
elsif not Is_Nil (Element) then
N := Node (Element);
S := Sloc (N);
L := Get_Physical_Line_Number (Sloc (N));
C := Get_Column_Number (Sloc (N));
S := Instantiation_Location (S);
while S /= No_Location loop
L := L + Get_Physical_Line_Number (Sloc (N));
C := C + Get_Column_Number (Sloc (N));
S := Instantiation_Location (S);
end loop;
-- Special Case:
Result := Result +
(Unsigned_32 (
Special_Cases'Pos (Special_Case (Element))) mod Max_Specs);
Result := Shift_Left (Result, Line_Pos);
-- Line:
Result := Result + (Unsigned_32 (L) mod Max_Lines);
Result := Shift_Left (Result, Inst_Pos);
-- Is_Part_Of_Instance
if Is_From_Instance (Element) then
Result := Result + 1;
end if;
Result := Shift_Left (Result, Kind_Pos);
-- Internal kind:
Result := Result +
(Internal_Element_Kinds'Pos (Int_Kind (Element)) mod Max_Kinds);
Result := Shift_Left (Result, Inh_Pos);
-- Is_Part_Of_Inherited
if Is_From_Inherited (Element) then
Result := Result + 1;
end if;
Result := Shift_Left (Result, Col_Pos);
-- Column:
Result := Result + (Unsigned_32 (C) mod Max_Cols);
Result := Shift_Left (Result, Impl_Pos);
-- Is_Part_Of_Implicit:
if Is_From_Implicit (Element) then
Result := Result + 1;
end if;
Result := Shift_Left (Result, Name_Pos);
-- Hash value computed from the name of enclosed unit:
Result := Result + Unsigned_32 (Ada_Name_Hash (Get_Ada_Name));
-- And now, rotating Result
Result := Rotate_Right (Result, Natural (L));
end if;
return To_ASIS_Integer (Result);
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Argument => Element,
Outer_Call => Package_Name & "Hash");
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Hash",
Ex => Ex,
Arg_Element => Element);
end Hash;
-----------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Processing of the Ada extensions that most likely will be included in --
-- Ada 2015 and that are already implemented in GNAT --
------------------------------------------------------------------------------
end Asis.Elements;
| 36.221361 | 79 | 0.543165 |
adc6a3c692ab843a9b683ae0f53d8a94e72614df | 4,800 | ads | Ada | samples/client/petstore/ada/src/client/samples-petstore-clients.ads | timgclark/openapi-generator | 468d80be4beff74de33a2dd1d533f855030038d5 | [
"Apache-2.0"
] | 4 | 2020-07-24T07:02:57.000Z | 2022-01-08T17:37:38.000Z | samples/client/petstore/ada/src/client/samples-petstore-clients.ads | timgclark/openapi-generator | 468d80be4beff74de33a2dd1d533f855030038d5 | [
"Apache-2.0"
] | 10 | 2021-03-09T14:12:46.000Z | 2022-02-27T11:42:16.000Z | samples/client/petstore/ada/src/client/samples-petstore-clients.ads | timgclark/openapi-generator | 468d80be4beff74de33a2dd1d533f855030038d5 | [
"Apache-2.0"
] | 5 | 2020-11-26T05:13:41.000Z | 2021-04-09T15:58:18.000Z | -- OpenAPI Petstore
-- This is a sample server Petstore server. For this sample, you can use the api key `special_key` to test the authorization filters.
--
-- The version of the OpenAPI document: 1.0.0
--
--
-- NOTE: This package is auto generated by OpenAPI-Generator 4.2.3-SNAPSHOT.
-- https://openapi-generator.tech
-- Do not edit the class manually.
with Samples.Petstore.Models;
with Swagger.Clients;
package Samples.Petstore.Clients is
type Client_Type is new Swagger.Clients.Client_Type with null record;
-- Add a new pet to the store
procedure Add_Pet
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.Pet_Type);
-- Deletes a pet
procedure Delete_Pet
(Client : in out Client_Type;
Pet_Id : in Swagger.Long;
Api_Key : in Swagger.Nullable_UString);
-- Finds Pets by status
-- Multiple status values can be provided with comma separated strings
procedure Find_Pets_By_Status
(Client : in out Client_Type;
Status : in Swagger.UString_Vectors.Vector;
Result : out Samples.Petstore.Models.Pet_Type_Vectors.Vector);
-- Finds Pets by tags
-- Multiple tags can be provided with comma separated strings. Use tag1, tag2, tag3 for testing.
procedure Find_Pets_By_Tags
(Client : in out Client_Type;
Tags : in Swagger.UString_Vectors.Vector;
Result : out Samples.Petstore.Models.Pet_Type_Vectors.Vector);
-- Find pet by ID
-- Returns a single pet
procedure Get_Pet_By_Id
(Client : in out Client_Type;
Pet_Id : in Swagger.Long;
Result : out Samples.Petstore.Models.Pet_Type);
-- Update an existing pet
procedure Update_Pet
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.Pet_Type);
-- Updates a pet in the store with form data
procedure Update_Pet_With_Form
(Client : in out Client_Type;
Pet_Id : in Swagger.Long;
Name : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString);
-- uploads an image
procedure Upload_File
(Client : in out Client_Type;
Pet_Id : in Swagger.Long;
Additional_Metadata : in Swagger.Nullable_UString;
File : in Swagger.File_Part_Type;
Result : out Samples.Petstore.Models.ApiResponse_Type);
-- Delete purchase order by ID
-- For valid response try integer IDs with value < 1000. Anything above 1000 or nonintegers will generate API errors
procedure Delete_Order
(Client : in out Client_Type;
Order_Id : in Swagger.UString);
-- Returns pet inventories by status
-- Returns a map of status codes to quantities
procedure Get_Inventory
(Client : in out Client_Type;
Result : out Swagger.Integer_Map);
-- Find purchase order by ID
-- For valid response try integer IDs with value <= 5 or > 10. Other values will generated exceptions
procedure Get_Order_By_Id
(Client : in out Client_Type;
Order_Id : in Swagger.Long;
Result : out Samples.Petstore.Models.Order_Type);
-- Place an order for a pet
procedure Place_Order
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.Order_Type;
Result : out Samples.Petstore.Models.Order_Type);
-- Create user
-- This can only be done by the logged in user.
procedure Create_User
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.User_Type);
-- Creates list of users with given input array
procedure Create_Users_With_Array_Input
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.User_Type_Vectors.Vector);
-- Creates list of users with given input array
procedure Create_Users_With_List_Input
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.User_Type_Vectors.Vector);
-- Delete user
-- This can only be done by the logged in user.
procedure Delete_User
(Client : in out Client_Type;
Username : in Swagger.UString);
-- Get user by user name
procedure Get_User_By_Name
(Client : in out Client_Type;
Username : in Swagger.UString;
Result : out Samples.Petstore.Models.User_Type);
-- Logs user into the system
procedure Login_User
(Client : in out Client_Type;
Username : in Swagger.UString;
Password : in Swagger.UString;
Result : out Swagger.UString);
-- Logs out current logged in user session
procedure Logout_User
(Client : in out Client_Type);
-- Updated user
-- This can only be done by the logged in user.
procedure Update_User
(Client : in out Client_Type;
Username : in Swagger.UString;
P_Body : in Samples.Petstore.Models.User_Type);
end Samples.Petstore.Clients;
| 34.042553 | 134 | 0.690417 |
5eca6ee4949be257460f3f9cf753507c18eeecec | 771 | adb | Ada | 1A/S5/PIM/tps/tp5/exemple_integer_io.adb | MOUDDENEHamza/ENSEEIHT | a90b1dee0c8d18a9578153a357278d99405bb534 | [
"Apache-2.0"
] | 4 | 2020-05-02T12:32:32.000Z | 2022-01-12T20:20:35.000Z | PIM/TP7_Modules_Genericite/exemple_integer_io.adb | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | 2 | 2021-01-14T20:03:26.000Z | 2022-01-30T01:10:00.000Z | PIM/TP7_Modules_Genericite/exemple_integer_io.adb | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | 13 | 2020-11-11T21:28:11.000Z | 2022-02-19T13:54:22.000Z | with Ada.Text_IO; use Ada.Text_IO;
with Integer_IO; use Integer_IO;
-- utiliser les opérations de Integer_IO.
procedure Exemple_Integer_IO is
Nombre: Integer;
begin
Put ("10 = ");
Afficher (10);
New_Line;
Put ("0 = ");
Afficher (0);
New_Line;
Put ("Integer'Last = ");
Afficher (Integer'Last);
New_Line;
loop
Put ("Nombre (0 pour quitter) : ");
Saisir (Nombre);
if Nombre /= -1 then
Put ("Vous avez saisi : ");
Afficher (Nombre);
New_Line;
else
Put_Line ("Ce n'est pas un entier naturel !");
Skip_Line; -- vider le buffer d'entrée (jusqu'à EOL)
end if;
exit when Nombre = 0;
end loop;
end Exemple_Integer_IO;
| 22.028571 | 65 | 0.55642 |
1e174b3ea835d24d35b35663bfcf8ee0b665f075 | 50 | ada | Ada | Task/Flow-control-structures/Ada/flow-control-structures-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Flow-control-structures/Ada/flow-control-structures-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Flow-control-structures/Ada/flow-control-structures-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | <<Top>>
Put_Line("Hello, World");
goto Top;
| 12.5 | 28 | 0.56 |
302b82496f7c43dab60e2f67ab4a36277d485251 | 2,863 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-fore.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-fore.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-fore.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . F O R E --
-- --
-- S p e c --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- This package contains the routine used for the 'Fore attribute
package System.Fore is
pragma Pure;
function Fore (Lo, Hi : Long_Long_Float) return Natural;
-- Compute Fore attribute value for a fixed-point type. The parameters
-- are the low and high bounds values, converted to Long_Long_Float.
end System.Fore;
| 65.068182 | 78 | 0.445686 |
38cab863426d5d28ba2fe1c0594e065232f92760 | 3,029 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-assert.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-assert.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-assert.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . A S S E R T I O N S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-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. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides support for assertions (including pragma Assert,
-- pragma Debug, and Precondition/Postcondition/Predicate/Invariant aspects
-- and their corresponding pragmas).
-- This unit may be used directly from an application program by providing
-- an appropriate WITH, and the interface can be expected to remain stable.
pragma Compiler_Unit_Warning;
package System.Assertions is
Assert_Failure : exception;
-- Exception raised when assertion fails
procedure Raise_Assert_Failure (Msg : String);
pragma No_Return (Raise_Assert_Failure);
-- Called to raise Assert_Failure with given message
end System.Assertions;
| 59.392157 | 78 | 0.455926 |
03d40176638acdab3c55f52468bd7a36c17cc424 | 1,778 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_glx_get_visual_configs_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_visual_configs_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_visual_configs_reply_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with swig;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_get_visual_configs_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;
num_visuals : aliased Interfaces.Unsigned_32;
num_properties : aliased Interfaces.Unsigned_32;
pad1 : aliased swig.int8_t_Array (0 .. 15);
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_visual_configs_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_visual_configs_reply_t.Item,
Element_Array => xcb.xcb_glx_get_visual_configs_reply_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_visual_configs_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_visual_configs_reply_t.Pointer,
Element_Array => xcb.xcb_glx_get_visual_configs_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_visual_configs_reply_t;
| 29.633333 | 78 | 0.672666 |
1e8e475dde154ce75a2afda2d593bee6b9699230 | 1,042 | ads | Ada | src/Ada/syscalls/ewok-syscalls-yield.ads | wookey-project/ewok-legacy | c973752dac3a0ebe3f7cfca062f50744578f051b | [
"Apache-2.0"
] | null | null | null | src/Ada/syscalls/ewok-syscalls-yield.ads | wookey-project/ewok-legacy | c973752dac3a0ebe3f7cfca062f50744578f051b | [
"Apache-2.0"
] | null | null | null | src/Ada/syscalls/ewok-syscalls-yield.ads | wookey-project/ewok-legacy | c973752dac3a0ebe3f7cfca062f50744578f051b | [
"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.
--
--
with ewok.tasks_shared; use ewok.tasks_shared;
package ewok.syscalls.yield
with spark_mode => off
is
procedure sys_yield
(caller_id : in ewok.tasks_shared.t_task_id;
mode : in ewok.tasks_shared.t_task_mode);
end ewok.syscalls.yield;
| 29.771429 | 79 | 0.698656 |
a08e1072422574a047befdb3e847eec07ce2fdcd | 508 | ads | Ada | tests/stories-test_data-tests-steptexts_container-test_data-tests.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | tests/stories-test_data-tests-steptexts_container-test_data-tests.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | tests/stories-test_data-tests-steptexts_container-test_data-tests.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- This package has been generated automatically by GNATtest.
-- Do not edit any part of it, see GNATtest documentation for more details.
-- begin read only
with Gnattest_Generated;
package Stories.Test_Data.Tests.StepTexts_Container.Test_Data.Tests is
type Test is new GNATtest_Generated.GNATtest_Standard.Stories.Test_Data
.Tests
.StepTexts_Container
.Test_Data
.New_Test with
null record;
end Stories.Test_Data.Tests.StepTexts_Container.Test_Data.Tests;
-- end read only
| 28.222222 | 76 | 0.773622 |
03a655edbf0194f9648382a6200b2d676a2db1e3 | 2,132 | ads | Ada | .emacs.d/elpa/wisi-3.1.3/wisitoken-bnf-output_elisp_common.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/wisitoken-bnf-output_elisp_common.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/wisitoken-bnf-output_elisp_common.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- Subprograms common to Output_Elisp and Output_Ada_Emacs
--
-- Copyright (C) 2012, 2013, 2015, 2017, 2018, 2019 Free Software Foundation, Inc.
--
-- The WisiToken package 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 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.
pragma License (Modified_GPL);
package WisiToken.BNF.Output_Elisp_Common is
function Find_Elisp_ID (List : in WisiToken.BNF.String_Lists.List; Elisp_Name : in String) return Integer;
function Elisp_Name_To_Ada
(Elisp_Name : in String;
Append_ID : in Boolean;
Trim : in Integer)
return String;
-- Drop Trim chars from beginning of Elisp_Name, capitalize.
procedure Indent_Keyword_Table
(Output_File_Root : in String;
Label : in String;
Keywords : in String_Pair_Lists.List;
Image : access function (Name : in Ada.Strings.Unbounded.Unbounded_String) return String);
procedure Indent_Token_Table
(Output_File_Root : in String;
Label : in String;
Tokens : in Token_Lists.List;
Image : access function (Name : in Ada.Strings.Unbounded.Unbounded_String) return String);
procedure Indent_Name_Table
(Output_File_Root : in String;
Label : in String;
Names : in String_Lists.List);
procedure Indent_Repair_Image
(Output_File_Root : in String;
Label : in String;
Tokens : in WisiToken.BNF.Tokens);
end WisiToken.BNF.Output_Elisp_Common;
| 38.763636 | 109 | 0.675422 |
19b82e413525dc448fa17671d027fde22ee2f82c | 5,127 | adb | Ada | examples/stm32_h405/lcd_test/src/lcd_test.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | examples/stm32_h405/lcd_test/src/lcd_test.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | examples/stm32_h405/lcd_test/src/lcd_test.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2020, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with STM32.GPIO; use STM32.GPIO;
with STM32.SPI; use STM32.SPI;
with STM32.Device; use STM32.Device;
with STM32_H405; use STM32_H405;
with HAL.Bitmap; use HAL.Bitmap;
with HAL.SPI; use HAL.SPI;
with PCD8544; use PCD8544;
with Ravenscar_Time;
procedure LCD_Test is
procedure Configure_GPIO;
procedure Configure_SPI;
LCD_SPI : STM32.SPI.SPI_Port renames SPI_2;
LCD_CLK : GPIO_Point renames EXT2_16;
LCD_DIN : GPIO_Point renames EXT2_19;
LCD_RST : GPIO_Point renames EXT2_9;
LCD_CS : GPIO_Point renames EXT2_17;
LCD_DC : GPIO_Point renames EXT2_2;
procedure Configure_GPIO is
begin
Enable_Clock (LCD_DIN & LCD_CLK & LCD_RST & LCD_DC & LCD_CS);
Configure_IO (LCD_RST & LCD_DC & LCD_CS,
(Resistors => Pull_Up,
Mode => Mode_Out,
Output_Type => Push_Pull,
Speed => Speed_25MHz));
Configure_IO (LCD_DIN & LCD_CLK,
(Resistors => Pull_Up,
Mode => Mode_AF,
AF_Output_Type => Push_Pull,
AF_Speed => Speed_25MHz,
AF => GPIO_AF_SPI2_5));
end Configure_GPIO;
procedure Configure_SPI is
begin
Enable_Clock (LCD_SPI);
Configure (LCD_SPI,
(Direction => D2Lines_FullDuplex,
Mode => Master,
Data_Size => Data_Size_8b,
Clock_Polarity => High,
Clock_Phase => P2Edge,
Slave_Management => Software_Managed,
Baud_Rate_Prescaler => BRP_8,
First_Bit => MSB,
CRC_Poly => 0));
Enable (LCD_SPI);
end Configure_SPI;
Display : PCD8544_Device
(Port => LCD_SPI'Access,
RST => LCD_RST'Access,
CS => LCD_CS'Access,
DC => LCD_DC'Access,
Time => Ravenscar_Time.Delays);
Bitmap : Any_Bitmap_Buffer;
Cursor : Rect :=
(Position => (0, 0),
Width => 8,
Height => 8);
begin
Configure_GPIO;
Configure_SPI;
Display.Initialize;
Display.Initialize_Layer
(Layer => 1,
Mode => M_1,
X => 0,
Y => 0,
Width => Display.Width,
Height => Display.Height);
Bitmap := Display.Hidden_Buffer (1);
loop
for X in 0 .. ((Display.Width / Cursor.Width) - 1) loop
for Y in 0 .. ((Display.Height / Cursor.Height) - 1) loop
Bitmap.Set_Source (White);
Bitmap.Fill;
Cursor.Position := (X * Cursor.Width, Y * Cursor.Height);
Bitmap.Set_Source (Black);
Bitmap.Fill_Rect (Cursor);
Display.Update_Layers;
delay 0.250;
end loop;
end loop;
end loop;
end LCD_Test;
| 40.690476 | 78 | 0.536766 |
5e09005e0f1862894922f210506cd1f492ab8dea | 2,609 | ads | Ada | tools/scitools/conf/understand/ada/ada05/s-pack27.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/ada05/s-pack27.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada05/s-pack27.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 2 7 --
-- --
-- S p e c --
-- --
-- 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. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 27
package System.Pack_27 is
pragma Preelaborate;
Bits : constant := 27;
type Bits_27 is mod 2 ** Bits;
for Bits_27'Size use Bits;
function Get_27 (Arr : System.Address; N : Natural) return Bits_27;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_27 (Arr : System.Address; N : Natural; E : Bits_27);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
end System.Pack_27;
| 49.226415 | 78 | 0.439632 |
9a6faa7435c74ab3cb47f69fab47755198c2cc8d | 3,584 | ads | Ada | firehog/ncurses/Ada95/ada_include/terminal_interface-curses-text_io-fixed_io.ads | KipodAfterFree/KAF-2019-FireHog | 5f6ee3c3c3329459bc9daeabc1a16ff4619508d9 | [
"MIT"
] | 1 | 2019-04-02T20:28:58.000Z | 2019-04-02T20:28:58.000Z | Ada95/ada_include/terminal_interface-curses-text_io-fixed_io.ads | mitchelhaan/ncurses | 0b8ae5088202164ecc1769aa255ed1aad283d2ae | [
"X11"
] | null | null | null | Ada95/ada_include/terminal_interface-curses-text_io-fixed_io.ads | mitchelhaan/ncurses | 0b8ae5088202164ecc1769aa255ed1aad283d2ae | [
"X11"
] | 1 | 2019-12-26T10:18:16.000Z | 2019-12-26T10:18:16.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Text_IO.Fixed_IO --
-- --
-- S P E C --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer <[email protected]> 1996
-- Version Control:
-- $Revision: 1.7 $
-- Binding Version 00.93
------------------------------------------------------------------------------
generic
type Num is delta <>;
package Terminal_Interface.Curses.Text_IO.Fixed_IO is
Default_Fore : Field := Num'Fore;
Default_Aft : Field := Num'Aft;
Default_Exp : Field := 0;
procedure Put
(Win : in Window;
Item : in Num;
Fore : in Field := Default_Fore;
Aft : in Field := Default_Aft;
Exp : in Field := Default_Exp);
procedure Put
(Item : in Num;
Fore : in Field := Default_Fore;
Aft : in Field := Default_Aft;
Exp : in Field := Default_Exp);
private
pragma Inline (Put);
end Terminal_Interface.Curses.Text_IO.Fixed_IO;
| 53.492537 | 78 | 0.445871 |
19be439ea60332e3572304c56926012c7f6962d0 | 1,682 | adb | Ada | regtests/mysql/ado_mysql_harness.adb | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | regtests/mysql/ado_mysql_harness.adb | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | regtests/mysql/ado_mysql_harness.adb | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- ADO Databases -- Database Objects
-- Copyright (C) 2009, 2010 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 ADO.Testsuite;
with ADO.Drivers.Mysql;
with Regtests;
with Util.Tests;
with Util.Properties;
procedure ADO_Mysql_Harness is
procedure Initialize (Props : in Util.Properties.Manager);
procedure Harness is new Util.Tests.Harness (ADO.Testsuite.Suite,
Initialize);
-- ------------------------------
-- Initialization procedure: setup the database
-- ------------------------------
procedure Initialize (Props : in Util.Properties.Manager) is
DB : constant String := Props.Get ("test.database",
"mysql://localhost:3306/ado?user=testado&password=ado");
begin
ADO.Drivers.Mysql.Initialize;
Regtests.Initialize (DB);
end Initialize;
begin
Harness ("ado-tests.xml");
end ADO_Mysql_Harness;
| 36.565217 | 97 | 0.600476 |
305b4f1ace83aab06dcd90ff904b764f134e2e35 | 482 | adb | Ada | icasrc/emergencyvehicleoverride.adb | bhayward93/Ada-Traffic-Light-Sim | 046bdc537a1365191aea142f31d36db53adf6e30 | [
"MIT"
] | null | null | null | icasrc/emergencyvehicleoverride.adb | bhayward93/Ada-Traffic-Light-Sim | 046bdc537a1365191aea142f31d36db53adf6e30 | [
"MIT"
] | null | null | null | icasrc/emergencyvehicleoverride.adb | bhayward93/Ada-Traffic-Light-Sim | 046bdc537a1365191aea142f31d36db53adf6e30 | [
"MIT"
] | null | null | null | with trafficlightswitcher;
with HWIF; use HWIF;
with HWIF_Types; use HWIF_Types;
procedure EmergencyVehicleOverride (dir : in Direction) is
begin
for DirectionElement in Direction'Range loop --Itterate through Directions
if Traffic_Light(DirectionElement) /= Traffic_Light(dir) and
Traffic_Light(DirectionElement) = 4
then --amber guarding needed?
TrafficLightSwitcher(dir);
end if;
end loop;
delay 1.0; -- Change this delay
end;
| 26.777778 | 83 | 0.719917 |
5e29cc65eac09f832ab296873ee44d17696016b4 | 265,707 | adb | Ada | Vivado_HLS_Tutorial/Design_Analysis/lab1/dct_prj/solution4/.autopilot/db/dct_dct_2d.bind.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Design_Analysis/lab1/dct_prj/solution4/.autopilot/db/dct_dct_2d.bind.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Design_Analysis/lab1/dct_prj/solution4/.autopilot/db/dct_dct_2d.bind.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="11">
<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>dct_dct_2d</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>in_block_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block[0]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>8</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>in_block_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block[1]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>8</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>in_block_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block[2]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>8</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>in_block_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block[3]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>8</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>in_block_4</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block[4]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>8</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>in_block_5</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block[5]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>8</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>in_block_6</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block[6]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>8</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_8">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>in_block_7</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block[7]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>8</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_9">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>out_block</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_block</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>64</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>96</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>row_outbuf</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>150</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>col_outbuf</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>151</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>col_inbuf_0</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[0]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>152</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>col_inbuf_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[1]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>153</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>col_inbuf_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[2]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>col_inbuf_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[3]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>155</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>col_inbuf_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[4]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>156</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>col_inbuf_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[5]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>157</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>col_inbuf_6</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[6]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>158</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>col_inbuf_7</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf[7]</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</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>160</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>162</item>
<item>163</item>
<item>164</item>
<item>165</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>exitcond5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</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>166</item>
<item>168</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>i_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>169</item>
<item>171</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</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>172</item>
<item>173</item>
<item>174</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>20</count>
<item_version>0</item_version>
<item>176</item>
<item>177</item>
<item>178</item>
<item>179</item>
<item>180</item>
<item>181</item>
<item>182</item>
<item>183</item>
<item>184</item>
<item>185</item>
<item>186</item>
<item>187</item>
<item>392</item>
<item>393</item>
<item>394</item>
<item>395</item>
<item>396</item>
<item>397</item>
<item>398</item>
<item>399</item>
</oprand_edges>
<opcode>call</opcode>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</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>188</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>indvar_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>189</item>
<item>190</item>
<item>192</item>
<item>193</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>j</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>194</item>
<item>195</item>
<item>196</item>
<item>197</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>i_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>198</item>
<item>199</item>
<item>200</item>
<item>201</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>exitcond_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>202</item>
<item>204</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>indvar_flatten_next</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>205</item>
<item>207</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</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>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>208</item>
<item>209</item>
<item>210</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>exitcond</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</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>214</item>
<item>215</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>i_1_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>216</item>
<item>217</item>
<item>218</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>j_s</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>219</item>
<item>220</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>j_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>221</item>
<item>222</item>
<item>223</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>tmp_s</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>224</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</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>225</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>tmp</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>227</item>
<item>228</item>
<item>230</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>p_addr_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>231</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>p_addr1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>232</item>
<item>233</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>tmp_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>234</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>row_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>235</item>
<item>237</item>
<item>238</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>row_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>239</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>tmp_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</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>240</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>16</count>
<item_version>0</item_version>
<item>241</item>
<item>242</item>
<item>243</item>
<item>244</item>
<item>246</item>
<item>247</item>
<item>249</item>
<item>250</item>
<item>252</item>
<item>253</item>
<item>255</item>
<item>256</item>
<item>258</item>
<item>259</item>
<item>261</item>
<item>262</item>
</oprand_edges>
<opcode>switch</opcode>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>col_inbuf_6_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>380</item>
<item>381</item>
<item>382</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>383</item>
<item>384</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>385</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>col_inbuf_5_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>374</item>
<item>375</item>
<item>376</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>377</item>
<item>378</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>379</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>col_inbuf_4_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>368</item>
<item>369</item>
<item>370</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>371</item>
<item>372</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>373</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>col_inbuf_3_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>362</item>
<item>363</item>
<item>364</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>365</item>
<item>366</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>367</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>col_inbuf_2_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>356</item>
<item>357</item>
<item>358</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>359</item>
<item>360</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>361</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>col_inbuf_1_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>350</item>
<item>351</item>
<item>352</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>353</item>
<item>354</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>355</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>col_inbuf_0_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>344</item>
<item>345</item>
<item>346</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>347</item>
<item>348</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>349</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>col_inbuf_7_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>386</item>
<item>387</item>
<item>388</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>389</item>
<item>390</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</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>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>i_6</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>211</item>
<item>212</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>213</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>i_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>263</item>
<item>264</item>
<item>265</item>
<item>266</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name>exitcond2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</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>267</item>
<item>268</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name>i_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>269</item>
<item>270</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</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>273</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>20</count>
<item_version>0</item_version>
<item>274</item>
<item>275</item>
<item>276</item>
<item>277</item>
<item>278</item>
<item>279</item>
<item>280</item>
<item>281</item>
<item>282</item>
<item>283</item>
<item>284</item>
<item>285</item>
<item>400</item>
<item>401</item>
<item>402</item>
<item>403</item>
<item>404</item>
<item>405</item>
<item>406</item>
<item>407</item>
</oprand_edges>
<opcode>call</opcode>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</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>286</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name>indvar_flatten1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>287</item>
<item>288</item>
<item>289</item>
<item>290</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>114</id>
<name>j_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>291</item>
<item>292</item>
<item>293</item>
<item>294</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name>i_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>295</item>
<item>296</item>
<item>297</item>
<item>298</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name>exitcond_flatten1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>299</item>
<item>300</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name>indvar_flatten_next1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>301</item>
<item>302</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>303</item>
<item>304</item>
<item>305</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>122</id>
<name>exitcond1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>306</item>
<item>307</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>123</id>
<name>i_3_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>308</item>
<item>309</item>
<item>310</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name>j_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>311</item>
<item>312</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>125</id>
<name>j_1_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>313</item>
<item>314</item>
<item>315</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>tmp_4_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</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>316</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>130</id>
<name>tmp_3_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</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>317</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>131</id>
<name>tmp_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>318</item>
<item>319</item>
<item>320</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>132</id>
<name>p_addr2_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</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>321</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>133</id>
<name>p_addr5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</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>322</item>
<item>323</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>134</id>
<name>tmp_6</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</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>324</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name>col_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>325</item>
<item>326</item>
<item>327</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>136</id>
<name>col_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>328</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>137</id>
<name>tmp_7</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>329</item>
<item>330</item>
<item>331</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>138</id>
<name>p_addr3_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</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>332</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>139</id>
<name>p_addr4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</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>333</item>
<item>334</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>140</id>
<name>tmp_8</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</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>335</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_101">
<Value>
<Obj>
<type>0</type>
<id>141</id>
<name>out_block_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>336</item>
<item>337</item>
<item>338</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>142</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</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>339</item>
<item>340</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>144</id>
<name>i_7</name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>341</item>
<item>342</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>145</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>343</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>147</id>
<name></name>
<fileName>dct.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>96</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>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>16</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_106">
<Value>
<Obj>
<type>2</type>
<id>149</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_107">
<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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_108">
<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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_109">
<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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_110">
<Value>
<Obj>
<type>2</type>
<id>175</id>
<name>dct_dct_1d</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:dct_dct_1d></content>
</item>
<item class_id_reference="16" object_id="_111">
<Value>
<Obj>
<type>2</type>
<id>191</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_112">
<Value>
<Obj>
<type>2</type>
<id>203</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_113">
<Value>
<Obj>
<type>2</type>
<id>206</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_114">
<Value>
<Obj>
<type>2</type>
<id>229</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_115">
<Value>
<Obj>
<type>2</type>
<id>236</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="_116">
<Value>
<Obj>
<type>2</type>
<id>245</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>248</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>251</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>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>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>257</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>260</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>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>19</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_122">
<Obj>
<type>3</type>
<id>29</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>11</count>
<item_version>0</item_version>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_123">
<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>4</count>
<item_version>0</item_version>
<item>30</item>
<item>31</item>
<item>33</item>
<item>34</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_124">
<Obj>
<type>3</type>
<id>39</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>37</item>
<item>38</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_125">
<Obj>
<type>3</type>
<id>46</id>
<name>.preheader7.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_126">
<Obj>
<type>3</type>
<id>66</id>
<name>.preheader7</name>
<fileName></fileName>
<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>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_127">
<Obj>
<type>3</type>
<id>70</id>
<name>branch6</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>67</item>
<item>68</item>
<item>69</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_128">
<Obj>
<type>3</type>
<id>74</id>
<name>branch5</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>71</item>
<item>72</item>
<item>73</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_129">
<Obj>
<type>3</type>
<id>78</id>
<name>branch4</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>75</item>
<item>76</item>
<item>77</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_130">
<Obj>
<type>3</type>
<id>82</id>
<name>branch3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>79</item>
<item>80</item>
<item>81</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_131">
<Obj>
<type>3</type>
<id>86</id>
<name>branch2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>83</item>
<item>84</item>
<item>85</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_132">
<Obj>
<type>3</type>
<id>90</id>
<name>branch1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>87</item>
<item>88</item>
<item>89</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_133">
<Obj>
<type>3</type>
<id>94</id>
<name>branch0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>93</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_134">
<Obj>
<type>3</type>
<id>98</id>
<name>branch7</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>95</item>
<item>96</item>
<item>97</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_135">
<Obj>
<type>3</type>
<id>102</id>
<name>ifBlock</name>
<fileName></fileName>
<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>100</item>
<item>101</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_136">
<Obj>
<type>3</type>
<id>108</id>
<name>.preheader6</name>
<fileName></fileName>
<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>103</item>
<item>104</item>
<item>106</item>
<item>107</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_137">
<Obj>
<type>3</type>
<id>112</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>110</item>
<item>111</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_138">
<Obj>
<type>3</type>
<id>119</id>
<name>.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>113</item>
<item>114</item>
<item>115</item>
<item>116</item>
<item>117</item>
<item>118</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_139">
<Obj>
<type>3</type>
<id>146</id>
<name>.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>20</count>
<item_version>0</item_version>
<item>122</item>
<item>123</item>
<item>124</item>
<item>125</item>
<item>129</item>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
<item>134</item>
<item>135</item>
<item>136</item>
<item>137</item>
<item>138</item>
<item>139</item>
<item>140</item>
<item>141</item>
<item>142</item>
<item>144</item>
<item>145</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_140">
<Obj>
<type>3</type>
<id>148</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>147</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>268</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_141">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>160</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>163</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>165</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>169</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>173</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>174</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>175</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>188</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>190</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>191</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>193</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>195</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>197</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>201</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>206</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>209</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>210</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>213</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>101</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>229</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_214">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_215">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_216">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_217">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_218">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_219">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_220">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_221">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_222">
<id>242</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_223">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>229</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_224">
<id>244</id>
<edge_type>2</edge_type>
<source_obj>94</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_225">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>245</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_226">
<id>247</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_227">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>248</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_228">
<id>250</id>
<edge_type>2</edge_type>
<source_obj>86</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_229">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>251</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_230">
<id>253</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_231">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_232">
<id>256</id>
<edge_type>2</edge_type>
<source_obj>78</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_233">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>257</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_234">
<id>259</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_235">
<id>261</id>
<edge_type>1</edge_type>
<source_obj>260</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_236">
<id>262</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_237">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_238">
<id>264</id>
<edge_type>2</edge_type>
<source_obj>112</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_239">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_240">
<id>266</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_241">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_242">
<id>268</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_243">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>106</sink_obj>
</item>
<item class_id_reference="20" object_id="_244">
<id>270</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>106</sink_obj>
</item>
<item class_id_reference="20" object_id="_245">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>107</sink_obj>
</item>
<item class_id_reference="20" object_id="_246">
<id>272</id>
<edge_type>2</edge_type>
<source_obj>112</source_obj>
<sink_obj>107</sink_obj>
</item>
<item class_id_reference="20" object_id="_247">
<id>273</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>107</sink_obj>
</item>
<item class_id_reference="20" object_id="_248">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>175</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_249">
<id>275</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_250">
<id>276</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_251">
<id>277</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_252">
<id>278</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_253">
<id>279</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_254">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_255">
<id>281</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_256">
<id>282</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_257">
<id>283</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_258">
<id>284</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_259">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_260">
<id>286</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_261">
<id>287</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_262">
<id>288</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_263">
<id>289</id>
<edge_type>1</edge_type>
<source_obj>191</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_264">
<id>290</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_265">
<id>291</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>114</sink_obj>
</item>
<item class_id_reference="20" object_id="_266">
<id>292</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>114</sink_obj>
</item>
<item class_id_reference="20" object_id="_267">
<id>293</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>114</sink_obj>
</item>
<item class_id_reference="20" object_id="_268">
<id>294</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>114</sink_obj>
</item>
<item class_id_reference="20" object_id="_269">
<id>295</id>
<edge_type>1</edge_type>
<source_obj>144</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_270">
<id>296</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_271">
<id>297</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_272">
<id>298</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_273">
<id>299</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_274">
<id>300</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_275">
<id>301</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_276">
<id>302</id>
<edge_type>1</edge_type>
<source_obj>206</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_277">
<id>303</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>118</sink_obj>
</item>
<item class_id_reference="20" object_id="_278">
<id>304</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>118</sink_obj>
</item>
<item class_id_reference="20" object_id="_279">
<id>305</id>
<edge_type>2</edge_type>
<source_obj>148</source_obj>
<sink_obj>118</sink_obj>
</item>
<item class_id_reference="20" object_id="_280">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_281">
<id>307</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_282">
<id>308</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>123</sink_obj>
</item>
<item class_id_reference="20" object_id="_283">
<id>309</id>
<edge_type>1</edge_type>
<source_obj>161</source_obj>
<sink_obj>123</sink_obj>
</item>
<item class_id_reference="20" object_id="_284">
<id>310</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>123</sink_obj>
</item>
<item class_id_reference="20" object_id="_285">
<id>311</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_286">
<id>312</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_287">
<id>313</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>125</sink_obj>
</item>
<item class_id_reference="20" object_id="_288">
<id>314</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>125</sink_obj>
</item>
<item class_id_reference="20" object_id="_289">
<id>315</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>125</sink_obj>
</item>
<item class_id_reference="20" object_id="_290">
<id>316</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>129</sink_obj>
</item>
<item class_id_reference="20" object_id="_291">
<id>317</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>130</sink_obj>
</item>
<item class_id_reference="20" object_id="_292">
<id>319</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>131</sink_obj>
</item>
<item class_id_reference="20" object_id="_293">
<id>320</id>
<edge_type>1</edge_type>
<source_obj>229</source_obj>
<sink_obj>131</sink_obj>
</item>
<item class_id_reference="20" object_id="_294">
<id>321</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>132</sink_obj>
</item>
<item class_id_reference="20" object_id="_295">
<id>322</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>133</sink_obj>
</item>
<item class_id_reference="20" object_id="_296">
<id>323</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>133</sink_obj>
</item>
<item class_id_reference="20" object_id="_297">
<id>324</id>
<edge_type>1</edge_type>
<source_obj>133</source_obj>
<sink_obj>134</sink_obj>
</item>
<item class_id_reference="20" object_id="_298">
<id>325</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>135</sink_obj>
</item>
<item class_id_reference="20" object_id="_299">
<id>326</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>135</sink_obj>
</item>
<item class_id_reference="20" object_id="_300">
<id>327</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>135</sink_obj>
</item>
<item class_id_reference="20" object_id="_301">
<id>328</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>136</sink_obj>
</item>
<item class_id_reference="20" object_id="_302">
<id>330</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_303">
<id>331</id>
<edge_type>1</edge_type>
<source_obj>229</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_304">
<id>332</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>138</sink_obj>
</item>
<item class_id_reference="20" object_id="_305">
<id>333</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>139</sink_obj>
</item>
<item class_id_reference="20" object_id="_306">
<id>334</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>139</sink_obj>
</item>
<item class_id_reference="20" object_id="_307">
<id>335</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>140</sink_obj>
</item>
<item class_id_reference="20" object_id="_308">
<id>336</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>141</sink_obj>
</item>
<item class_id_reference="20" object_id="_309">
<id>337</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>141</sink_obj>
</item>
<item class_id_reference="20" object_id="_310">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>141</sink_obj>
</item>
<item class_id_reference="20" object_id="_311">
<id>339</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>142</sink_obj>
</item>
<item class_id_reference="20" object_id="_312">
<id>340</id>
<edge_type>1</edge_type>
<source_obj>141</source_obj>
<sink_obj>142</sink_obj>
</item>
<item class_id_reference="20" object_id="_313">
<id>341</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>144</sink_obj>
</item>
<item class_id_reference="20" object_id="_314">
<id>342</id>
<edge_type>1</edge_type>
<source_obj>170</source_obj>
<sink_obj>144</sink_obj>
</item>
<item class_id_reference="20" object_id="_315">
<id>343</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>145</sink_obj>
</item>
<item class_id_reference="20" object_id="_316">
<id>344</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_317">
<id>345</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_318">
<id>346</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_319">
<id>347</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_320">
<id>348</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_321">
<id>349</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_322">
<id>350</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_323">
<id>351</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_324">
<id>352</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_325">
<id>353</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_326">
<id>354</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_327">
<id>355</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_328">
<id>356</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_329">
<id>357</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_330">
<id>358</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_331">
<id>359</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_332">
<id>360</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_333">
<id>361</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_334">
<id>362</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_335">
<id>363</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_336">
<id>364</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_337">
<id>365</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_338">
<id>366</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_339">
<id>367</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_340">
<id>368</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_341">
<id>369</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_342">
<id>370</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_343">
<id>371</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_344">
<id>372</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_345">
<id>373</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_346">
<id>374</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_347">
<id>375</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_348">
<id>376</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_349">
<id>377</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_350">
<id>378</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_351">
<id>379</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_352">
<id>380</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_353">
<id>381</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_354">
<id>382</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_355">
<id>383</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_356">
<id>384</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_357">
<id>385</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_358">
<id>386</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_359">
<id>387</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_360">
<id>388</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_361">
<id>389</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_362">
<id>390</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_363">
<id>391</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>97</sink_obj>
</item>
<item class_id_reference="20" object_id="_364">
<id>392</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_365">
<id>393</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_366">
<id>394</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_367">
<id>395</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_368">
<id>396</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_369">
<id>397</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_370">
<id>398</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_371">
<id>399</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_372">
<id>400</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_373">
<id>401</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_374">
<id>402</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_375">
<id>403</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_376">
<id>404</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_377">
<id>405</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_378">
<id>406</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_379">
<id>407</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_380">
<id>474</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_381">
<id>475</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_382">
<id>476</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_383">
<id>477</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_384">
<id>478</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>108</sink_obj>
</item>
<item class_id_reference="20" object_id="_385">
<id>479</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_386">
<id>480</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_387">
<id>481</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_388">
<id>482</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_389">
<id>483</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_390">
<id>484</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_391">
<id>485</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_392">
<id>486</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_393">
<id>487</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_394">
<id>488</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_395">
<id>489</id>
<edge_type>2</edge_type>
<source_obj>74</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_396">
<id>490</id>
<edge_type>2</edge_type>
<source_obj>78</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_397">
<id>491</id>
<edge_type>2</edge_type>
<source_obj>82</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_398">
<id>492</id>
<edge_type>2</edge_type>
<source_obj>86</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_399">
<id>493</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_400">
<id>494</id>
<edge_type>2</edge_type>
<source_obj>94</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_401">
<id>495</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_402">
<id>496</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_403">
<id>497</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>119</sink_obj>
</item>
<item class_id_reference="20" object_id="_404">
<id>498</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>112</sink_obj>
</item>
<item class_id_reference="20" object_id="_405">
<id>499</id>
<edge_type>2</edge_type>
<source_obj>112</source_obj>
<sink_obj>108</sink_obj>
</item>
<item class_id_reference="20" object_id="_406">
<id>500</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>148</sink_obj>
</item>
<item class_id_reference="20" object_id="_407">
<id>501</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>146</sink_obj>
</item>
<item class_id_reference="20" object_id="_408">
<id>502</id>
<edge_type>2</edge_type>
<source_obj>146</source_obj>
<sink_obj>119</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_409">
<mId>1</mId>
<mTag>dct_dct_2d</mTag>
<mType>0</mType>
<sub_regions>
<count>6</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</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>373</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_410">
<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>29</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_411">
<mId>3</mId>
<mTag>Row_DCT_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>39</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>120</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_412">
<mId>4</mId>
<mTag>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>11</count>
<item_version>0</item_version>
<item>46</item>
<item>66</item>
<item>70</item>
<item>74</item>
<item>78</item>
<item>82</item>
<item>86</item>
<item>90</item>
<item>94</item>
<item>98</item>
<item>102</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>64</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_413">
<mId>5</mId>
<mTag>Col_DCT_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>108</item>
<item>112</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>120</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_414">
<mId>6</mId>
<mTag>Xpose_Col_Outer_Loop_Xpose_Col_Inner_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>119</item>
<item>146</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>64</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_415">
<mId>7</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>148</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_416">
<states class_id="25" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_417">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_418">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_419">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_420">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_421">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_422">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_423">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_424">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_425">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_426">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_427">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_428">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_429">
<id>2</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_430">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_431">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_432">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_433">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_434">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_435">
<id>37</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_436">
<id>3</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_437">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_438">
<id>37</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_439">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_440">
<id>4</id>
<operations>
<count>20</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_441">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_442">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_443">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_444">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_445">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_446">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_447">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_448">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_449">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_450">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_451">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_452">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_453">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_454">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_455">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_456">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_457">
<id>63</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_458">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_459">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_460">
<id>100</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_461">
<id>5</id>
<operations>
<count>33</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_462">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_463">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_464">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_465">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_466">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_467">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_468">
<id>63</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_469">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_470">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_471">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_472">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_473">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_474">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_475">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_476">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_477">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_478">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_479">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_480">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_481">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_482">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_483">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_484">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_485">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_486">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_487">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_488">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_489">
<id>93</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_490">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_491">
<id>96</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_492">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_493">
<id>99</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_494">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_495">
<id>6</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_496">
<id>103</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_497">
<id>104</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_498">
<id>105</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_499">
<id>106</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_500">
<id>107</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_501">
<id>110</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_502">
<id>7</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_503">
<id>109</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_504">
<id>110</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_505">
<id>111</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_506">
<id>8</id>
<operations>
<count>18</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_507">
<id>113</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_508">
<id>114</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_509">
<id>115</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_510">
<id>116</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_511">
<id>117</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_512">
<id>118</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_513">
<id>122</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_514">
<id>123</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_515">
<id>124</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_516">
<id>125</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_517">
<id>130</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_518">
<id>131</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_519">
<id>132</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_520">
<id>133</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_521">
<id>134</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_522">
<id>135</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_523">
<id>136</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_524">
<id>144</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_525">
<id>9</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_526">
<id>120</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_527">
<id>121</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_528">
<id>126</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_529">
<id>127</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_530">
<id>128</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_531">
<id>129</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_532">
<id>136</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_533">
<id>137</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_534">
<id>138</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_535">
<id>139</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_536">
<id>140</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_537">
<id>141</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_538">
<id>142</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_539">
<id>143</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_540">
<id>145</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_541">
<id>10</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_542">
<id>147</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_543">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>104</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_544">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>107</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>31</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_545">
<inState>2</inState>
<outState>4</outState>
<condition>
<id>106</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>31</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_546">
<inState>3</inState>
<outState>2</outState>
<condition>
<id>110</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_547">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>120</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>104</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_548">
<inState>6</inState>
<outState>8</outState>
<condition>
<id>119</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>104</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_549">
<inState>7</inState>
<outState>6</outState>
<condition>
<id>123</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_550">
<inState>5</inState>
<outState>4</outState>
<condition>
<id>131</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_551">
<inState>4</inState>
<outState>6</outState>
<condition>
<id>130</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>43</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_552">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>132</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>43</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_553">
<inState>9</inState>
<outState>8</outState>
<condition>
<id>134</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_554">
<inState>8</inState>
<outState>10</outState>
<condition>
<id>133</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>116</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_555">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>135</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>116</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_556">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>0</count>
<item_version>0</item_version>
</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>0</count>
<item_version>0</item_version>
</dp_multiplexer_resource>
<dp_register_resource>
<count>0</count>
<item_version>0</item_version>
</dp_register_resource>
<dp_component_map class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>0</count>
<item_version>0</item_version>
</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="39" tracking_level="0" version="0">
<count>96</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>18</first>
<second class_id="41" tracking_level="0" version="0">
<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>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>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>33</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>3</first>
<second>1</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>129</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>130</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>132</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>133</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>134</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>4</first>
<second>1</second>
</second>
</item>
<item>
<first>137</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>138</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>139</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>140</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>141</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>142</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>144</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>145</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>147</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="42" tracking_level="0" version="0">
<count>19</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="0" version="0">
<first>29</first>
<second class_id="44" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>146</first>
<second>
<first>4</first>
<second>5</second>
</second>
</item>
<item>
<first>148</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="45" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="1" version="0" object_id="_557">
<region_name>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</region_name>
<basic_blocks>
<count>11</count>
<item_version>0</item_version>
<item>46</item>
<item>66</item>
<item>70</item>
<item>74</item>
<item>78</item>
<item>82</item>
<item>86</item>
<item>90</item>
<item>94</item>
<item>98</item>
<item>102</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>
<item class_id_reference="46" object_id="_558">
<region_name>Xpose_Col_Outer_Loop_Xpose_Col_Inner_Loop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>119</item>
<item>146</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="47" tracking_level="0" version="0">
<count>76</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="0" version="0">
<first>100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>104</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>136</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>146</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>63</item>
<item>63</item>
</second>
</item>
<item>
<first>151</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>163</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>169</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>181</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>205</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>211</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>217</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>223</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>229</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>235</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>241</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>247</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>253</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>136</item>
<item>136</item>
</second>
</item>
<item>
<first>258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>141</item>
</second>
</item>
<item>
<first>265</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>142</item>
</second>
</item>
<item>
<first>275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>320</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>332</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>361</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>37</item>
<item>37</item>
<item>110</item>
<item>110</item>
</second>
</item>
<item>
<first>404</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>416</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>422</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>428</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>434</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>442</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>456</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>460</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>468</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>472</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>478</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>487</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>493</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>504</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>510</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>516</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
<item>
<first>522</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</second>
</item>
<item>
<first>528</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>122</item>
</second>
</item>
<item>
<first>534</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>542</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>548</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>556</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</second>
</item>
<item>
<first>560</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
<item>
<first>568</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>572</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</second>
</item>
<item>
<first>578</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</second>
</item>
<item>
<first>583</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>589</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>592</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>137</item>
</second>
</item>
<item>
<first>599</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</second>
</item>
<item>
<first>603</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>139</item>
</second>
</item>
<item>
<first>609</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="50" tracking_level="0" version="0">
<count>64</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first>col_inbuf_0_addr_gep_fu_223</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>col_inbuf_0_alloca_fu_108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>col_inbuf_1_addr_gep_fu_211</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>col_inbuf_1_alloca_fu_112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>col_inbuf_2_addr_gep_fu_199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>col_inbuf_2_alloca_fu_116</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>col_inbuf_3_addr_gep_fu_187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>col_inbuf_3_alloca_fu_120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>col_inbuf_4_addr_gep_fu_175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>col_inbuf_4_alloca_fu_124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>col_inbuf_5_addr_gep_fu_163</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>col_inbuf_5_alloca_fu_128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>col_inbuf_6_addr_gep_fu_151</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>col_inbuf_6_alloca_fu_132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>col_inbuf_7_addr_gep_fu_235</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>col_inbuf_7_alloca_fu_136</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>col_outbuf_addr_gep_fu_247</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>col_outbuf_alloca_fu_104</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>exitcond1_fu_528</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>122</item>
</second>
</item>
<item>
<first>exitcond2_fu_504</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>exitcond5_fu_404</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>exitcond_flatten1_fu_516</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_416</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>exitcond_fu_428</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>i_1_mid2_fu_434</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>i_1_phi_fu_309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>i_2_phi_fu_320</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>i_3_mid2_fu_534</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>i_3_phi_fu_354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>i_4_fu_410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>i_5_fu_510</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>i_6_fu_487</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>i_7_fu_583</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>i_phi_fu_275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>indvar_flatten1_phi_fu_332</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>indvar_flatten_next1_fu_522</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_422</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>j_1_mid2_fu_548</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>j_1_phi_fu_343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>j_2_fu_542</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</second>
</item>
<item>
<first>j_mid2_fu_448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>j_phi_fu_298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>j_s_fu_442</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>out_block_addr_gep_fu_258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>141</item>
</second>
</item>
<item>
<first>p_addr1_fu_472</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>p_addr2_cast_fu_568</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>132</item>
</second>
</item>
<item>
<first>p_addr3_cast_fu_599</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>138</item>
</second>
</item>
<item>
<first>p_addr4_fu_603</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>139</item>
</second>
</item>
<item>
<first>p_addr5_fu_572</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>133</item>
</second>
</item>
<item>
<first>p_addr_cast_fu_468</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>row_outbuf_addr_gep_fu_140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>row_outbuf_alloca_fu_100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_1_fu_483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>tmp_3_fu_478</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>tmp_3_trn_cast_fu_556</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</second>
</item>
<item>
<first>tmp_4_fu_560</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</second>
</item>
<item>
<first>tmp_4_trn_cast_fu_589</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>tmp_6_fu_578</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</second>
</item>
<item>
<first>tmp_7_fu_592</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>137</item>
</second>
</item>
<item>
<first>tmp_8_fu_609</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
<item>
<first>tmp_fu_460</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp_s_fu_493</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>tmp_trn_cast_fu_456</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_dct_dct_1d_fu_361</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>37</item>
<item>37</item>
<item>110</item>
<item>110</item>
</second>
</item>
</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="52" tracking_level="0" version="0">
<count>29</count>
<item_version>0</item_version>
<item class_id="53" tracking_level="0" version="0">
<first class_id="54" tracking_level="0" version="0">
<first>col_inbuf_0</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_0</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_1</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_1</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_2</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_2</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_3</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_3</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_4</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_4</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_5</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_5</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_6</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_6</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_7</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>96</item>
</second>
</item>
<item>
<first>
<first>col_inbuf_7</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>
<first>col_outbuf</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>136</item>
<item>136</item>
</second>
</item>
<item>
<first>
<first>col_outbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_0</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>110</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_1</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>110</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_2</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>110</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_3</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>110</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_4</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>110</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_5</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>110</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_6</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>110</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table_7</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>110</item>
</second>
</item>
<item>
<first>
<first>out_block</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>142</item>
</second>
</item>
<item>
<first>
<first>row_outbuf</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>63</item>
<item>63</item>
</second>
</item>
<item>
<first>
<first>row_outbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>24</count>
<item_version>0</item_version>
<item>
<first>271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>305</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>339</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>614</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>618</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>623</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>627</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>632</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>638</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>643</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>647</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>652</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>656</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>661</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
<item>
<first>665</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</second>
</item>
<item>
<first>670</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>675</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>681</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>686</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>24</count>
<item_version>0</item_version>
<item>
<first>col_outbuf_addr_reg_681</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>exitcond2_reg_652</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>exitcond5_reg_614</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>exitcond_flatten1_reg_661</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_623</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>i_1_reg_305</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>i_2_reg_316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>i_3_mid2_reg_670</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>i_3_reg_350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>i_4_reg_618</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>i_5_reg_656</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>i_6_reg_647</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>i_7_reg_686</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</second>
</item>
<item>
<first>i_reg_271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>indvar_flatten1_reg_328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>indvar_flatten_next1_reg_665</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_627</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>j_1_mid2_reg_675</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</second>
</item>
<item>
<first>j_1_reg_339</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>j_mid2_reg_632</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>j_reg_294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>row_outbuf_addr_reg_638</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>tmp_1_reg_643</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>8</count>
<item_version>0</item_version>
<item>
<first>271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>305</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>339</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>8</count>
<item_version>0</item_version>
<item>
<first>i_1_reg_305</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>i_2_reg_316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>i_3_reg_350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>i_reg_271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>indvar_flatten1_reg_328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>113</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>j_1_reg_339</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>114</item>
</second>
</item>
<item>
<first>j_reg_294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="55" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first>out_block(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>142</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="57" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="58" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
<item>
<first>3</first>
<second>RAM</second>
</item>
<item>
<first>4</first>
<second>RAM</second>
</item>
<item>
<first>5</first>
<second>RAM</second>
</item>
<item>
<first>6</first>
<second>RAM</second>
</item>
<item>
<first>7</first>
<second>RAM</second>
</item>
<item>
<first>8</first>
<second>RAM</second>
</item>
<item>
<first>9</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>10</count>
<item_version>0</item_version>
<item>
<first>18</first>
<second>RAM</second>
</item>
<item>
<first>19</first>
<second>RAM</second>
</item>
<item>
<first>20</first>
<second>RAM</second>
</item>
<item>
<first>21</first>
<second>RAM</second>
</item>
<item>
<first>22</first>
<second>RAM</second>
</item>
<item>
<first>23</first>
<second>RAM</second>
</item>
<item>
<first>24</first>
<second>RAM</second>
</item>
<item>
<first>25</first>
<second>RAM</second>
</item>
<item>
<first>26</first>
<second>RAM</second>
</item>
<item>
<first>27</first>
<second>RAM</second>
</item>
</node2core>
</syndb>
</boost_serialization>
| 24.733035 | 98 | 0.584147 |
19e704b7618ed809e44a7c1aff9d255c716564e0 | 27,800 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-expect.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-expect.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-expect.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . E X P E C T --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-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. --
-- --
------------------------------------------------------------------------------
-- Currently this package is implemented on all native GNAT ports. It is not
-- yet implemented for any of the cross-ports (e.g. it is not available for
-- VxWorks or LynxOS).
-- -----------
-- -- Usage --
-- -----------
-- This package provides a set of subprograms similar to what is available
-- with the standard Tcl Expect tool.
-- It allows you to easily spawn and communicate with an external process.
-- You can send commands or inputs to the process, and compare the output
-- with some expected regular expression.
-- Usage example:
-- Non_Blocking_Spawn
-- (Fd, "ftp",
-- (1 => new String' ("machine@domain")));
-- Timeout := 10_000; -- 10 seconds
-- Expect (Fd, Result, Regexp_Array'(+"\(user\)", +"\(passwd\)"),
-- Timeout);
-- case Result is
-- when 1 => Send (Fd, "my_name"); -- matched "user"
-- when 2 => Send (Fd, "my_passwd"); -- matched "passwd"
-- when Expect_Timeout => null; -- timeout
-- when others => null;
-- end case;
-- Close (Fd);
-- You can also combine multiple regular expressions together, and get the
-- specific string matching a parenthesis pair by doing something like this:
-- If you expect either "lang=optional ada" or "lang=ada" from the external
-- process, you can group the two together, which is more efficient, and
-- simply get the name of the language by doing:
-- declare
-- Matched : Match_Array (0 .. 2);
-- begin
-- Expect (Fd, Result, "lang=(optional)? ([a-z]+)", Matched);
-- Put_Line ("Seen: " &
-- Expect_Out (Fd) (Matched (2).First .. Matched (2).Last));
-- end;
-- Alternatively, you might choose to use a lower-level interface to the
-- processes, where you can give your own input and output filters every
-- time characters are read from or written to the process.
-- procedure My_Filter
-- (Descriptor : Process_Descriptor'Class;
-- Str : String;
-- User_Data : System.Address)
-- is
-- begin
-- Put_Line (Str);
-- end;
-- Non_Blocking_Spawn
-- (Fd, "tail",
-- (new String' ("-f"), new String' ("a_file")));
-- Add_Filter (Fd, My_Filter'Access, Output);
-- Expect (Fd, Result, "", 0); -- wait forever
-- The above example should probably be run in a separate task, since it is
-- blocking on the call to Expect.
-- Both examples can be combined, for instance to systematically print the
-- output seen by expect, even though you still want to let Expect do the
-- filtering. You can use the Trace_Filter subprogram for such a filter.
-- If you want to get the output of a simple command, and ignore any previous
-- existing output, it is recommended to do something like:
-- Expect (Fd, Result, ".*", Timeout => 0);
-- -- Empty the buffer, by matching everything (after checking
-- -- if there was any input).
-- Send (Fd, "command");
-- Expect (Fd, Result, ".."); -- match only on the output of command
-- -----------------
-- -- Task Safety --
-- -----------------
-- This package is not task-safe: there should not be concurrent calls to the
-- functions defined in this package. In other words, separate tasks must not
-- access the facilities of this package without synchronization that
-- serializes access.
with System;
with GNAT.OS_Lib;
with GNAT.Regpat;
package GNAT.Expect is
type Process_Id is new Integer;
Invalid_Pid : constant Process_Id := -1;
Null_Pid : constant Process_Id := 0;
type Filter_Type is (Output, Input, Died);
-- The signals that are emitted by the Process_Descriptor upon state change
-- in the child. One can connect to any of these signals through the
-- Add_Filter subprograms.
--
-- Output => Every time new characters are read from the process
-- associated with Descriptor, the filter is called with
-- these new characters in the argument.
--
-- Note that output is generated only when the program is
-- blocked in a call to Expect.
--
-- Input => Every time new characters are written to the process
-- associated with Descriptor, the filter is called with
-- these new characters in the argument.
-- Note that input is generated only by calls to Send.
--
-- Died => The child process has died, or was explicitly killed
type Process_Descriptor is tagged private;
-- Contains all the components needed to describe a process handled
-- in this package, including a process identifier, file descriptors
-- associated with the standard input, output and error, and the buffer
-- needed to handle the expect calls.
type Process_Descriptor_Access is access Process_Descriptor'Class;
------------------------
-- Spawning a process --
------------------------
procedure Non_Blocking_Spawn
(Descriptor : out Process_Descriptor'Class;
Command : String;
Args : GNAT.OS_Lib.Argument_List;
Buffer_Size : Natural := 4096;
Err_To_Out : Boolean := False);
-- This call spawns a new process and allows sending commands to
-- the process and/or automatic parsing of the output.
--
-- The expect buffer associated with that process can contain at most
-- Buffer_Size characters. Older characters are simply discarded when this
-- buffer is full. Beware that if the buffer is too big, this could slow
-- down the Expect calls if the output not is matched, since Expect has to
-- match all the regexp against all the characters in the buffer. If
-- Buffer_Size is 0, there is no limit (i.e. all the characters are kept
-- till Expect matches), but this is slower.
--
-- If Err_To_Out is True, then the standard error of the spawned process is
-- connected to the standard output. This is the only way to get the Expect
-- subprograms to also match on output on standard error.
--
-- Invalid_Process is raised if the process could not be spawned.
--
-- For information about spawning processes from tasking programs, see the
-- "NOTE: Spawn in tasking programs" in System.OS_Lib (s-os_lib.ads).
procedure Close (Descriptor : in out Process_Descriptor);
-- Terminate the process and close the pipes to it. It implicitly does the
-- 'wait' command required to clean up the process table. This also frees
-- the buffer associated with the process id. Raise Invalid_Process if the
-- process id is invalid.
procedure Close
(Descriptor : in out Process_Descriptor;
Status : out Integer);
-- Same as above, but also returns the exit status of the process, as set
-- for example by the procedure GNAT.OS_Lib.OS_Exit.
procedure Send_Signal
(Descriptor : Process_Descriptor;
Signal : Integer);
-- Send a given signal to the process. Raise Invalid_Process if the process
-- id is invalid.
procedure Interrupt (Descriptor : in out Process_Descriptor);
-- Interrupt the process (the equivalent of Ctrl-C on unix and windows)
-- and call close if the process dies.
function Get_Input_Fd
(Descriptor : Process_Descriptor) return GNAT.OS_Lib.File_Descriptor;
-- Return the input file descriptor associated with Descriptor
function Get_Output_Fd
(Descriptor : Process_Descriptor) return GNAT.OS_Lib.File_Descriptor;
-- Return the output file descriptor associated with Descriptor
function Get_Error_Fd
(Descriptor : Process_Descriptor) return GNAT.OS_Lib.File_Descriptor;
-- Return the error output file descriptor associated with Descriptor
function Get_Pid
(Descriptor : Process_Descriptor) return Process_Id;
-- Return the process id associated with a given process descriptor
function Get_Command_Output
(Command : String;
Arguments : GNAT.OS_Lib.Argument_List;
Input : String;
Status : not null access Integer;
Err_To_Out : Boolean := False) return String;
-- Execute Command with the specified Arguments and Input, and return the
-- generated standard output data as a single string. If Err_To_Out is
-- True, generated standard error output is included as well. On return,
-- Status is set to the command's exit status.
--------------------
-- Adding filters --
--------------------
-- This is a rather low-level interface to subprocesses, since basically
-- the filtering is left entirely to the user. See the Expect subprograms
-- below for higher level functions.
type Filter_Function is access
procedure
(Descriptor : Process_Descriptor'Class;
Str : String;
User_Data : System.Address := System.Null_Address);
-- Function called every time new characters are read from or written to
-- the process.
--
-- Str is a string of all these characters.
--
-- User_Data, if specified, is user specific data that will be passed to
-- the filter. Note that no checks are done on this parameter, so it should
-- be used with caution.
procedure Add_Filter
(Descriptor : in out Process_Descriptor;
Filter : Filter_Function;
Filter_On : Filter_Type := Output;
User_Data : System.Address := System.Null_Address;
After : Boolean := False);
-- Add a new filter for one of the filter types. This filter will be run
-- before all the existing filters, unless After is set True, in which case
-- it will be run after existing filters. User_Data is passed as is to the
-- filter procedure.
procedure Remove_Filter
(Descriptor : in out Process_Descriptor;
Filter : Filter_Function);
-- Remove a filter from the list of filters (whatever the type of the
-- filter).
procedure Trace_Filter
(Descriptor : Process_Descriptor'Class;
Str : String;
User_Data : System.Address := System.Null_Address);
-- Function that can be used as a filter and that simply outputs Str on
-- Standard_Output. This is mainly used for debugging purposes.
-- User_Data is ignored.
procedure Lock_Filters (Descriptor : in out Process_Descriptor);
-- Temporarily disables all output and input filters. They will be
-- reactivated only when Unlock_Filters has been called as many times as
-- Lock_Filters.
procedure Unlock_Filters (Descriptor : in out Process_Descriptor);
-- Unlocks the filters. They are reactivated only if Unlock_Filters
-- has been called as many times as Lock_Filters.
------------------
-- Sending data --
------------------
procedure Send
(Descriptor : in out Process_Descriptor;
Str : String;
Add_LF : Boolean := True;
Empty_Buffer : Boolean := False);
-- Send a string to the file descriptor.
--
-- The string is not formatted in any way, except if Add_LF is True, in
-- which case an ASCII.LF is added at the end, so that Str is recognized
-- as a command by the external process.
--
-- If Empty_Buffer is True, any input waiting from the process (or in the
-- buffer) is first discarded before the command is sent. The output
-- filters are of course called as usual.
-----------------------------------------------------------
-- Working on the output (single process, simple regexp) --
-----------------------------------------------------------
type Expect_Match is new Integer;
Expect_Full_Buffer : constant Expect_Match := -1;
-- If the buffer was full and some characters were discarded
Expect_Timeout : constant Expect_Match := -2;
-- If no output matching the regexps was found before the timeout
function "+" (S : String) return GNAT.OS_Lib.String_Access;
-- Allocate some memory for the string. This is merely a convenience
-- function to help create the array of regexps in the call to Expect.
procedure Expect
(Descriptor : in out Process_Descriptor;
Result : out Expect_Match;
Regexp : String;
Timeout : Integer := 10_000;
Full_Buffer : Boolean := False);
-- Wait till a string matching Fd can be read from Fd, and return 1 if a
-- match was found.
--
-- It consumes all the characters read from Fd until a match found, and
-- then sets the return values for the subprograms Expect_Out and
-- Expect_Out_Match.
--
-- The empty string "" will never match, and can be used if you only want
-- to match after a specific timeout. Beware that if Timeout is -1 at the
-- time, the current task will be blocked forever.
--
-- This command times out after Timeout milliseconds (or never if Timeout
-- is -1). In that case, Expect_Timeout is returned. The value returned by
-- Expect_Out and Expect_Out_Match are meaningless in that case.
--
-- Note that using a timeout of 0ms leads to unpredictable behavior, since
-- the result depends on whether the process has already sent some output
-- the first time Expect checks, and this depends on the operating system.
--
-- The regular expression must obey the syntax described in GNAT.Regpat.
--
-- If Full_Buffer is True, then Expect will match if the buffer was too
-- small and some characters were about to be discarded. In that case,
-- Expect_Full_Buffer is returned.
procedure Expect
(Descriptor : in out Process_Descriptor;
Result : out Expect_Match;
Regexp : GNAT.Regpat.Pattern_Matcher;
Timeout : Integer := 10_000;
Full_Buffer : Boolean := False);
-- Same as the previous one, but with a precompiled regular expression.
-- This is more efficient however, especially if you are using this
-- expression multiple times, since this package won't need to recompile
-- the regexp every time.
procedure Expect
(Descriptor : in out Process_Descriptor;
Result : out Expect_Match;
Regexp : String;
Matched : out GNAT.Regpat.Match_Array;
Timeout : Integer := 10_000;
Full_Buffer : Boolean := False);
-- Same as above, but it is now possible to get the indexes of the
-- substrings for the parentheses in the regexp (see the example at the
-- top of this package, as well as the documentation in the package
-- GNAT.Regpat).
--
-- Matched'First should be 0, and this index will contain the indexes for
-- the whole string that was matched. The index 1 will contain the indexes
-- for the first parentheses-pair, and so on.
------------
-- Expect --
------------
procedure Expect
(Descriptor : in out Process_Descriptor;
Result : out Expect_Match;
Regexp : GNAT.Regpat.Pattern_Matcher;
Matched : out GNAT.Regpat.Match_Array;
Timeout : Integer := 10_000;
Full_Buffer : Boolean := False);
-- Same as above, but with a precompiled regular expression
-------------------------------------------------------------
-- Working on the output (single process, multiple regexp) --
-------------------------------------------------------------
type Regexp_Array is array (Positive range <>) of GNAT.OS_Lib.String_Access;
type Pattern_Matcher_Access is access all GNAT.Regpat.Pattern_Matcher;
type Compiled_Regexp_Array is
array (Positive range <>) of Pattern_Matcher_Access;
function "+"
(P : GNAT.Regpat.Pattern_Matcher) return Pattern_Matcher_Access;
-- Allocate some memory for the pattern matcher. This is only a convenience
-- function to help create the array of compiled regular expressions.
procedure Expect
(Descriptor : in out Process_Descriptor;
Result : out Expect_Match;
Regexps : Regexp_Array;
Timeout : Integer := 10_000;
Full_Buffer : Boolean := False);
-- Wait till a string matching one of the regular expressions in Regexps
-- is found. This function returns the index of the regexp that matched.
-- This command is blocking, but will timeout after Timeout milliseconds.
-- In that case, Timeout is returned.
procedure Expect
(Descriptor : in out Process_Descriptor;
Result : out Expect_Match;
Regexps : Compiled_Regexp_Array;
Timeout : Integer := 10_000;
Full_Buffer : Boolean := False);
-- Same as the previous one, but with precompiled regular expressions.
-- This can be much faster if you are using them multiple times.
procedure Expect
(Descriptor : in out Process_Descriptor;
Result : out Expect_Match;
Regexps : Regexp_Array;
Matched : out GNAT.Regpat.Match_Array;
Timeout : Integer := 10_000;
Full_Buffer : Boolean := False);
-- Same as above, except that you can also access the parenthesis
-- groups inside the matching regular expression.
--
-- The first index in Matched must be 0, or Constraint_Error will be
-- raised. The index 0 contains the indexes for the whole string that was
-- matched, the index 1 contains the indexes for the first parentheses
-- pair, and so on.
procedure Expect
(Descriptor : in out Process_Descriptor;
Result : out Expect_Match;
Regexps : Compiled_Regexp_Array;
Matched : out GNAT.Regpat.Match_Array;
Timeout : Integer := 10_000;
Full_Buffer : Boolean := False);
-- Same as above, but with precompiled regular expressions. The first index
-- in Matched must be 0, or Constraint_Error will be raised.
-------------------------------------------
-- Working on the output (multi-process) --
-------------------------------------------
type Multiprocess_Regexp is record
Descriptor : Process_Descriptor_Access;
Regexp : Pattern_Matcher_Access;
end record;
type Multiprocess_Regexp_Array is
array (Positive range <>) of Multiprocess_Regexp;
procedure Free (Regexp : in out Multiprocess_Regexp);
-- Free the memory occupied by Regexp
function Has_Process (Regexp : Multiprocess_Regexp_Array) return Boolean;
-- Return True if at least one entry in Regexp is non-null, ie there is
-- still at least one process to monitor
function First_Dead_Process
(Regexp : Multiprocess_Regexp_Array) return Natural;
-- Find the first entry in Regexp that corresponds to a dead process that
-- wasn't Free-d yet. This function is called in general when Expect
-- (below) raises the exception Process_Died. This returns 0 if no process
-- has died yet.
procedure Expect
(Result : out Expect_Match;
Regexps : Multiprocess_Regexp_Array;
Matched : out GNAT.Regpat.Match_Array;
Timeout : Integer := 10_000;
Full_Buffer : Boolean := False);
-- Same as above, but for multi processes. Any of the entries in
-- Regexps can have a null Descriptor or Regexp. Such entries will
-- simply be ignored. Therefore when a process terminates, you can
-- simply reset its entry.
--
-- The expect loop would therefore look like:
--
-- Processes : Multiprocess_Regexp_Array (...) := ...;
-- R : Natural;
--
-- while Has_Process (Processes) loop
-- begin
-- Expect (Result, Processes, Timeout => -1);
-- ... process output of process Result (output, full buffer,...)
--
-- exception
-- when Process_Died =>
-- -- Free memory
-- R := First_Dead_Process (Processes);
-- Close (Processes (R).Descriptor.all, Status);
-- Free (Processes (R));
-- end;
-- end loop;
procedure Expect
(Result : out Expect_Match;
Regexps : Multiprocess_Regexp_Array;
Timeout : Integer := 10_000;
Full_Buffer : Boolean := False);
-- Same as the previous one, but for multiple processes. This procedure
-- finds the first regexp that match the associated process.
------------------------
-- Getting the output --
------------------------
procedure Flush
(Descriptor : in out Process_Descriptor;
Timeout : Integer := 0);
-- Discard all output waiting from the process.
--
-- This output is simply discarded, and no filter is called. This output
-- will also not be visible by the next call to Expect, nor will any output
-- currently buffered.
--
-- Timeout is the delay for which we wait for output to be available from
-- the process. If 0, we only get what is immediately available.
function Expect_Out (Descriptor : Process_Descriptor) return String;
-- Return the string matched by the last Expect call.
--
-- The returned string is in fact the concatenation of all the strings read
-- from the file descriptor up to, and including, the characters that
-- matched the regular expression.
--
-- For instance, with an input "philosophic", and a regular expression "hi"
-- in the call to expect, the strings returned the first and second time
-- would be respectively "phi" and "losophi".
function Expect_Out_Match (Descriptor : Process_Descriptor) return String;
-- Return the string matched by the last Expect call.
--
-- The returned string includes only the character that matched the
-- specific regular expression. All the characters that came before are
-- simply discarded.
--
-- For instance, with an input "philosophic", and a regular expression
-- "hi" in the call to expect, the strings returned the first and second
-- time would both be "hi".
----------------
-- Exceptions --
----------------
Invalid_Process : exception;
-- Raised by most subprograms above when the parameter Descriptor is not a
-- valid process or is a closed process.
Process_Died : exception;
-- Raised by all the expect subprograms if Descriptor was originally a
-- valid process that died while Expect was executing. It is also raised
-- when Expect receives an end-of-file.
private
type Filter_List_Elem;
type Filter_List is access Filter_List_Elem;
type Filter_List_Elem is record
Filter : Filter_Function;
User_Data : System.Address;
Filter_On : Filter_Type;
Next : Filter_List;
end record;
type Pipe_Type is record
Input, Output : GNAT.OS_Lib.File_Descriptor;
end record;
-- This type represents a pipe, used to communicate between two processes
procedure Set_Up_Communications
(Pid : in out Process_Descriptor;
Err_To_Out : Boolean;
Pipe1 : not null access Pipe_Type;
Pipe2 : not null access Pipe_Type;
Pipe3 : not null access Pipe_Type);
-- Set up all the communication pipes and file descriptors prior to
-- spawning the child process.
procedure Set_Up_Parent_Communications
(Pid : in out Process_Descriptor;
Pipe1 : in out Pipe_Type;
Pipe2 : in out Pipe_Type;
Pipe3 : in out Pipe_Type);
-- Finish the set up of the pipes while in the parent process
procedure Set_Up_Child_Communications
(Pid : in out Process_Descriptor;
Pipe1 : in out Pipe_Type;
Pipe2 : in out Pipe_Type;
Pipe3 : in out Pipe_Type;
Cmd : String;
Args : System.Address);
-- Finish the set up of the pipes while in the child process This also
-- spawns the child process (based on Cmd). On systems that support fork,
-- this procedure is executed inside the newly created process.
procedure Close_Input (Pid : in out Process_Descriptor);
-- Closes input file descriptor. Set Input_Fd to Invalid_Fd as well as
-- Output_Fd and Error_Fd when they share same file descriptor.
type Process_Descriptor is tagged record
Pid : aliased Process_Id := Invalid_Pid;
Input_Fd : GNAT.OS_Lib.File_Descriptor := GNAT.OS_Lib.Invalid_FD;
Output_Fd : GNAT.OS_Lib.File_Descriptor := GNAT.OS_Lib.Invalid_FD;
Error_Fd : GNAT.OS_Lib.File_Descriptor := GNAT.OS_Lib.Invalid_FD;
Filters_Lock : Integer := 0;
Filters : Filter_List := null;
Buffer : GNAT.OS_Lib.String_Access := null;
Buffer_Size : Natural := 0;
Buffer_Index : Natural := 0;
Last_Match_Start : Natural := 0;
Last_Match_End : Natural := 0;
end record;
-- The following subprogram is provided for use in the body, and also
-- possibly in future child units providing extensions to this package.
procedure Portable_Execvp
(Pid : not null access Process_Id;
Cmd : String;
Args : System.Address);
pragma Import (C, Portable_Execvp, "__gnat_expect_portable_execvp");
-- Executes, in a portable way, the command Cmd (full path must be
-- specified), with the given Args, which must be an array of string
-- pointers. Note that the first element in Args must be the executable
-- name, and the last element must be a null pointer. The returned value
-- in Pid is the process ID, or zero if not supported on the platform.
end GNAT.Expect;
| 42.638037 | 79 | 0.627446 |
9aecb1a161a7a557f6dcd80ffdc135329edd8f92 | 2,149 | ads | Ada | source/oasis/program-elements-constrained_array_types.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-constrained_array_types.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-constrained_array_types.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Type_Definitions;
with Program.Lexical_Elements;
with Program.Elements.Discrete_Ranges;
with Program.Elements.Component_Definitions;
package Program.Elements.Constrained_Array_Types is
pragma Pure (Program.Elements.Constrained_Array_Types);
type Constrained_Array_Type is
limited interface and Program.Elements.Type_Definitions.Type_Definition;
type Constrained_Array_Type_Access is
access all Constrained_Array_Type'Class with Storage_Size => 0;
not overriding function Index_Subtypes
(Self : Constrained_Array_Type)
return not null Program.Elements.Discrete_Ranges
.Discrete_Range_Vector_Access is abstract;
not overriding function Component_Definition
(Self : Constrained_Array_Type)
return not null Program.Elements.Component_Definitions
.Component_Definition_Access is abstract;
type Constrained_Array_Type_Text is limited interface;
type Constrained_Array_Type_Text_Access is
access all Constrained_Array_Type_Text'Class with Storage_Size => 0;
not overriding function To_Constrained_Array_Type_Text
(Self : aliased in out Constrained_Array_Type)
return Constrained_Array_Type_Text_Access is abstract;
not overriding function Array_Token
(Self : Constrained_Array_Type_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Left_Bracket_Token
(Self : Constrained_Array_Type_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Right_Bracket_Token
(Self : Constrained_Array_Type_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Of_Token
(Self : Constrained_Array_Type_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Constrained_Array_Types;
| 34.66129 | 77 | 0.771056 |
9a0b7ba4de3fdaf3d9516deaeadcc442d3fa0086 | 735 | ads | Ada | Ada/Benchmark/src/primes.ads | kkirstein/proglang-playground | d00be09ba2bb2351c6f5287cc4d93fcaf21f75fd | [
"MIT"
] | null | null | null | Ada/Benchmark/src/primes.ads | kkirstein/proglang-playground | d00be09ba2bb2351c6f5287cc4d93fcaf21f75fd | [
"MIT"
] | null | null | null | Ada/Benchmark/src/primes.ads | kkirstein/proglang-playground | d00be09ba2bb2351c6f5287cc4d93fcaf21f75fd | [
"MIT"
] | null | null | null | with Ada.Numerics.Big_Numbers.Big_Integers;
use Ada.Numerics.Big_Numbers.Big_Integers;
with Ada.Containers.Vectors;
package Primes is
function Is_Prime (N : Natural) return Boolean;
function Is_Prime (N : Big_Natural) return Boolean;
package Prime_Vectors is new Ada.Containers.Vectors (Index_Type => Natural,
Element_Type => Natural);
package Big_Prime_Vectors is new Ada.Containers.Vectors (Index_Type => Natural,
Element_Type => Big_Natural);
function Get_Primes (Limit : Natural) return Prime_Vectors.Vector;
function Get_Primes (Limit : Big_Natural) return Big_Prime_Vectors.Vector;
end Primes;
| 38.684211 | 85 | 0.665306 |
5e27222a2af4007cb4e5c8219457ce1645a9db4b | 9,911 | adb | Ada | src/Processors/LaTeX/latex_writer.adb | fintatarta/eugen | 2c384838ff0e81b51172310ce5d0e47d71ffd4fd | [
"MIT"
] | null | null | null | src/Processors/LaTeX/latex_writer.adb | fintatarta/eugen | 2c384838ff0e81b51172310ce5d0e47d71ffd4fd | [
"MIT"
] | null | null | null | src/Processors/LaTeX/latex_writer.adb | fintatarta/eugen | 2c384838ff0e81b51172310ce5d0e47d71ffd4fd | [
"MIT"
] | null | null | null | pragma Ada_2012;
with Ada.Strings.Fixed;
package body Latex_Writer is
-- The result of function 'Image associated to discrete types has
-- a space at the beginning. That space is quite annoying and needs
-- to be trimmed. This function is here so that everyone can use it
function Chop (X : String) return String
is (Ada.Strings.Fixed.Trim (X, Ada.Strings.Both));
function Image (X : Integer) return String
is (Chop (Integer'Image (X)));
-------------------------
-- Print_Default_Macro --
-------------------------
procedure Print_Default_Macro (Output : File_Access;
Command_Name : String;
Definition : String;
N_Parameters : Natural)
is
begin
Put (File =>
Output.all,
Item =>
"\ifdef{" & Command_Name & "}"
& "{}"
& "{\newcommand{" & Command_Name & "}");
if N_Parameters > 0 then
Put (Output.all, "[" & Image (N_Parameters) & "]");
end if;
Put_Line (Output.all, "{" & Definition & "}}");
end Print_Default_Macro;
------------
-- Within --
------------
procedure Within
(Output : File_Access;
Env_Name : String;
Callback : access procedure (Output : File_Access);
Parameter : String := "")
is
begin
Put (Output.all, "\begin{" & Env_Name & "}");
if Parameter /= "" then
Put (Output.all, "{" & Parameter & "}");
end if;
New_Line (Output.all);
Callback (Output);
New_Line (Output.all);
Put_Line (Output.all, "\end{" & Env_Name & "}");
end Within;
-----------------------
-- Within_Table_Like --
-----------------------
procedure Within_Table_Like
(Output : File_Access;
Env_Name : String;
Callback : access procedure (Output : File_Access;
Table : in out Table_Handler))
is
Arg : constant Parameter_List (2 .. 1) := (others => <>);
begin
Within_Table_Like (Output => Output,
Env_Name => Env_Name,
Callback => Callback,
Parameters => Arg);
end Within_Table_Like;
-----------------------
-- Within_Table_Like --
-----------------------
procedure Within_Table_Like
(Output : File_Access;
Env_Name : String;
Callback : access procedure (Output : File_Access;
Table : in out Table_Handler);
Parameter : String)
is
begin
Within_Table_Like (Output => Output,
Env_Name => Env_Name,
Callback => Callback,
Parameters => (1 => To_Unbounded_String (Parameter)));
end Within_Table_Like;
-----------------------
-- Within_Table_Like --
-----------------------
procedure Within_Table_Like
(Output : File_Access;
Env_Name : String;
Callback : access procedure (Output : File_Access;
Table : in out Table_Handler);
Parameters : Parameter_List)
is
T : Table_Handler := Table_Handler'(State => Begin_Row,
Output => Output,
Default_Style => To_Unbounded_String (""),
Default_Head => To_Unbounded_String (""));
begin
Put (Output.all, "\begin{" & Env_Name & "}");
for K in Parameters'Range loop
Put (Output.all, "{" & To_String (Parameters (K)) & "}");
end loop;
New_Line (Output.all);
Callback (Output, T);
New_Line (Output.all);
Put_Line (Output.all, "\end{" & Env_Name & "}");
end Within_Table_Like;
------------------
-- Within_Table --
------------------
procedure Within_Table
(Output : File_Access;
Table_Spec : String;
Callback : access procedure (Output : File_Access;
Table : in out Table_Handler);
Default_Style : String := "";
Default_Head : String := "";
Caption : String := "";
Width : String := "\textwidth")
is
use Ada.Strings.Fixed;
T : Table_Handler := Table_Handler'(State => Begin_Row,
Output => Output,
Default_Style => To_Unbounded_String (Default_Style),
Default_Head => To_Unbounded_String (Default_Head));
Use_Tabularx : constant Boolean := Index (Table_Spec, "X") > 0;
Env_Name : constant String :=
(if Use_Tabularx then "tabularx" else "tabular");
Width_Spec : constant String := (if Use_Tabularx then "{" & Width & "}" else "");
begin
if Caption /= "" then
Put_Line (Output.all, "\begin{table}");
Put_Line (Output.all, "\caption{" & Caption & "}");
end if;
Put_Line (Output.all, "\centering");
Put_Line (Output.all,
"\begin{" & Env_Name & "}"
& Width_Spec
& "{" & Table_Spec & "}");
Callback (Output, T);
New_Line (Output.all);
Put_Line (Output.all, "\end{" & Env_Name & "}");
if Caption /= "" then
Put_Line (Output.all, "\end{table}");
end if;
end Within_Table;
-----------------
-- Apply_Style --
-----------------
function Apply_Style (Content : String;
Style : Style_Spec;
Default_Style : Unbounded_String)
return String
is
begin
if Style /= "" then
return String (Style) & "{" & Content & "}";
elsif Default_Style /= "" then
return To_String (Default_Style) & "{" & Content & "}";
else
return Content;
end if;
end Apply_Style;
procedure Put_If_In_State (Table : in out Table_Handler;
Content : String;
State : Table_State)
is
begin
if Table.State = State then
Put (Table.Output.all, Content);
end if;
end Put_If_In_State;
---------
-- Put --
---------
procedure Put
(Table : in out Table_Handler; Content : String; Style : String := "")
is
begin
Put_If_In_State (Table, " & ", Middle_Row);
Put (Table.Output.all, Apply_Style (Content, Style_Spec (Style), Table.Default_Style));
Table.State := Middle_Row;
end Put;
-------------
-- New_Row --
-------------
procedure New_Row (Table : in out Table_Handler) is
begin
Put_Line (Table.Output.all, "\\");
Table.State := Begin_Row;
end New_Row;
-----------
-- hline --
-----------
procedure Hline (Table : in out Table_Handler;
Full : Boolean := True) is
begin
Put_If_In_State (Table, "\\", Middle_Row);
if Full then
Put_Line (Table.Output.all, "\hline");
end if;
Table.State := Begin_Row;
end Hline;
procedure Cline (Table : in out Table_Handler; From, To : Positive)
is
begin
Put_If_In_State (Table, "\\", Middle_Row);
Put_Line (Table.Output.all, "\cline{" & Image (From) & "-" & Image (To) & "}");
Table.State := Begin_Row;
end Cline;
-----------------
-- Multicolumn --
-----------------
procedure Multicolumn (Table : in out Table_Handler;
Span : Positive;
Spec : String;
Content : String)
is
begin
Put_If_In_State (Table, "&", Middle_Row);
Put (Table.Output.all, "\multicolumn{" & Image (Span) & "}{" & Spec & "}");
Put_Line (Table.Output.all, "{" & Content & "}");
Table.State := Middle_Row;
end Multicolumn;
----------
-- Head --
----------
procedure Head (Table : in out Table_Handler;
Content : String;
Bar : Bar_Position := Default;
Style : String := "")
is
True_Bar : constant Bar_Position :=
(if Bar /= Default
then
Bar
elsif Table.State = Begin_Row then
Both
else
Right);
function Bar_Maybe (X : Boolean) return String
is (if X then "|" else "");
begin
Table.Multicolumn (Span => 1,
Content => Apply_Style (Content => Content,
Style => Style_Spec (Style),
Default_Style => Table.Default_Head),
Spec =>
Bar_Maybe (True_Bar = Left or True_Bar = Both) &
"c" &
Bar_Maybe (True_Bar = Right or True_Bar = Both));
end Head;
----------
-- Hbox --
----------
function Hbox (Content : String;
Size : Latex_Length := Zero;
Align : Align_Type := Center)
return String
is
begin
return "\hbox to "
& Image (Size)
& "{"
& (case Align is
when Center | Left => "\hss",
when Right => "")
& "{" & Content & "}"
& (case Align is
when Center | Right => "\hss",
when Left => "")
& "}";
end Hbox;
end Latex_Writer;
| 29.235988 | 95 | 0.459489 |
3053c2040f2d205852458cde9fbd04da0eed696a | 2,149 | ads | Ada | tools-src/gnu/gcc/gcc/ada/gnatbind.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/gnatbind.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/gnatbind.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T B I N D --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992,1993,1994 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Main program of GNAT binder
procedure Gnatbind;
| 67.15625 | 78 | 0.355514 |
193aa4028a3ef9cd98d1cfe1e459362ba12bddfd | 2,394 | adb | Ada | src/init_project.adb | bracke/websitegenerator | d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b | [
"CC0-1.0"
] | 1 | 2022-02-14T11:45:43.000Z | 2022-02-14T11:45:43.000Z | src/init_project.adb | bracke/websitegenerator | d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b | [
"CC0-1.0"
] | null | null | null | src/init_project.adb | bracke/websitegenerator | d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b | [
"CC0-1.0"
] | null | null | null | with Ada.Text_IO;
with Ada.Directories;
with Ada.Command_Line;
with Templates_Parser;
with CLIC.TTY;
with Filesystem;
with Commands;
with GNAT.Strings;
with Ada.Characters.Conversions;
with Generator;
with Globals;
package body Init_Project is
package IO renames Ada.Text_IO;
package TT renames CLIC.TTY;
use Ada.Characters.Conversions;
use Ada.Directories;
use GNAT.Strings;
use Generator.aString;
Errors : constant Boolean := False;
Filter : constant Filter_Type :=
(Ordinary_File => True, Special_File => False, Directory => True);
procedure Init (Path : String; Blueprint : String; ToDo : Action) is
Blueprint_Folder : constant String := Get_Blueprint_Folder;
App_Blueprint_Folder : constant String :=
Compose (Blueprint_Folder, "site");
Blueprint_Path : XString;
Name : constant String := Simple_Name (Path);
begin
if Blueprint /= "" then
Blueprint_Path := To_XString (
To_Wide_Wide_String (Compose (App_Blueprint_Folder, Blueprint)));
else
Blueprint_Path := To_XString (
To_Wide_Wide_String (Compose (App_Blueprint_Folder,
Globals.Blueprint_Default)));
end if;
Templates_Parser.Insert
(Commands.Translations, Templates_Parser.Assoc ("SITENAME", Name));
if Exists (To_String (To_String (Blueprint_Path)))
then
IO.Put_Line
(TT.Italic ("Creating a new project") & " " & TT.Bold (Path) & ":");
Iterate (To_String (To_String (Blueprint_Path)), Path, ToDo);
IO.New_Line;
if Errors then
IO.Put_Line
(TT.Warn ("Created site") & " " & TT.Bold
(Name) & " " & "with errors.");
else
IO.Put_Line (TT.Success ("Successfully created site")
& " " & TT.Warn (TT.Bold (Name)));
end if;
IO.New_Line;
IO.Put_Line
(TT.Info
(TT.Description ("Build your site using") & " " &
TT.Terminal ("wg publish")));
IO.Put_Line
(TT.Info
(TT.Description ("Add components and other items using") & " " &
TT.Terminal ("wg generate")));
else
IO.Put_Line (TT.Error ("Blueprint not found: " &
To_String (To_String (Blueprint_Path))));
end if;
end Init;
end Init_Project; | 30.692308 | 77 | 0.602757 |
9af7d5d5982598b3d8850c70ced449c1f964c8ef | 5,118 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-pack33.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/s-pack33.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/s-pack33.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 3 3 --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1999 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
with Unchecked_Conversion;
package body System.Pack_33 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_33;
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);
------------
-- Get_33 --
------------
function Get_33 (Arr : System.Address; N : Natural) return Bits_33 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_33;
------------
-- Set_33 --
------------
procedure Set_33 (Arr : System.Address; N : Natural; E : Bits_33) 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_33;
end System.Pack_33;
| 43.008403 | 78 | 0.47245 |
c7e4bcbe2abe67370f9d71e29d1597de5c54cce7 | 4,000 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95022a.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/c9/c95022a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95022a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | --C95022A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
--CHECK THAT IT IS POSSIBLE TO ACCEPT AN ENTRY CALL FROM INSIDE THE
--THE BODY OF AN ACCEPT STATEMENT.
--CHECK THE CASE OF NORMAL ENTRY TERMINATION.
-- JEAN-PIERRE ROSEN 25-FEB-1984
-- JBG 6/1/84
-- FOUR CLIENT TASKS CALL ONE SERVER TASK. EACH CLIENT CALLS JUST ONE
-- ENTRY OF THE SERVER TASK. THE TEST CHECKS TO BE SURE THAT CALLS FROM
-- DIFFERENT TASKS ARE NOT MIXED UP.
WITH REPORT; USE REPORT;
PROCEDURE C95022A IS
BEGIN
TEST("C95022A", "CHECK THAT EMBEDDED RENDEZVOUS ARE PROCESSED " &
"CORRECTLY");
DECLARE
TASK TYPE CLIENT IS
ENTRY GET_ID (I : INTEGER);
ENTRY RESTART;
END CLIENT;
T_ARR : ARRAY (1..4) OF CLIENT;
TASK SERVER IS
ENTRY E1 (I : IN OUT INTEGER);
ENTRY E2 (I : IN OUT INTEGER);
ENTRY E3 (I : IN OUT INTEGER);
ENTRY E4 (I : IN OUT INTEGER);
END SERVER;
TASK BODY SERVER IS
BEGIN
ACCEPT E1 (I : IN OUT INTEGER) DO
ACCEPT E2 (I : IN OUT INTEGER) DO
I := IDENT_INT(I);
ACCEPT E3 (I : IN OUT INTEGER) DO
ACCEPT E4 (I : IN OUT INTEGER) DO
I := IDENT_INT(I);
END E4;
I := IDENT_INT(I);
END E3;
END E2;
I := IDENT_INT(I);
END E1;
FOR I IN 1 .. 4 LOOP
T_ARR(I).RESTART;
END LOOP;
END SERVER;
TASK BODY CLIENT IS
ID : INTEGER;
SAVE_ID : INTEGER;
BEGIN
ACCEPT GET_ID (I : INTEGER) DO
ID := I;
END GET_ID;
SAVE_ID := ID;
CASE ID IS
WHEN 1 => SERVER.E1(ID);
WHEN 2 => SERVER.E2(ID);
WHEN 3 => SERVER.E3(ID);
WHEN 4 => SERVER.E4(ID);
WHEN OTHERS => FAILED("INCORRECT ID");
END CASE;
ACCEPT RESTART; -- WAIT FOR ALL TASKS TO HAVE COMPLETED
-- RENDEZVOUS
IF ID /= SAVE_ID THEN
FAILED("SCRAMBLED EMBEDDED RENDEZVOUS");
END IF;
EXCEPTION
WHEN OTHERS => FAILED("EXCEPTION IN CLIENT");
END CLIENT;
BEGIN
FOR I IN 1 .. 4 LOOP
T_ARR(I).GET_ID(I);
END LOOP;
END;
RESULT;
END C95022A;
| 34.482759 | 79 | 0.50975 |
8bdea4d99b8e189dda3905c43b681c77428a7b51 | 8,858 | ads | Ada | bb-runtimes/src/system/system-pikeos-arm-ravenscar-full.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/system/system-pikeos-arm-ravenscar-full.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/system/system-pikeos-arm-ravenscar-full.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M --
-- --
-- S p e c --
-- (PikeOS ARM Version) --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- This is a Ravenscar version of this package for ARM PikeOS targets
pragma Restrictions (No_Exception_Registration);
-- Disable exception name registration. This capability is not used because
-- it is only required by exception stream attributes which are not supported
-- in this run time.
pragma Profile (Jorvik);
-- This is a Ravenscar run time
package System is
pragma Pure;
-- Note that we take advantage of the implementation permission to make
-- this unit Pure instead of Preelaborable; see RM 13.7.1(15). In Ada
-- 2005, this is Pure in any case (AI-362).
pragma No_Elaboration_Code_All;
-- Allow the use of that restriction in units that WITH this unit
type Name is (SYSTEM_NAME_GNAT);
System_Name : constant Name := SYSTEM_NAME_GNAT;
-- System-Dependent Named Numbers
Min_Int : constant := -2 ** (Standard'Max_Integer_Size - 1);
Max_Int : constant := 2 ** (Standard'Max_Integer_Size - 1) - 1;
Max_Binary_Modulus : constant := 2 ** Standard'Max_Integer_Size;
Max_Nonbinary_Modulus : constant := 2 ** Integer'Size - 1;
Max_Base_Digits : constant := Long_Long_Float'Digits;
Max_Digits : constant := Long_Long_Float'Digits;
Max_Mantissa : constant := Standard'Max_Integer_Size - 1;
Fine_Delta : constant := 2.0 ** (-Max_Mantissa);
Tick : constant := 0.000_000_001; -- 1 ns
-- Storage-related Declarations
type Address is private;
pragma Preelaborable_Initialization (Address);
Null_Address : constant Address;
Storage_Unit : constant := 8;
Word_Size : constant := 32;
Memory_Size : constant := 2 ** 32;
-- Address comparison
function "<" (Left, Right : Address) return Boolean;
function "<=" (Left, Right : Address) return Boolean;
function ">" (Left, Right : Address) return Boolean;
function ">=" (Left, Right : Address) return Boolean;
function "=" (Left, Right : Address) return Boolean;
pragma Import (Intrinsic, "<");
pragma Import (Intrinsic, "<=");
pragma Import (Intrinsic, ">");
pragma Import (Intrinsic, ">=");
pragma Import (Intrinsic, "=");
-- Other System-Dependent Declarations
type Bit_Order is (High_Order_First, Low_Order_First);
Default_Bit_Order : constant Bit_Order := Low_Order_First;
pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning
-- Priority-related Declarations (RM D.1)
-- For simplicity there is a 1-1 correspondence between Ada and PikeOS
-- priorities. PikeOS priority 0 is reserved by the idle thread, so not
-- available to Ada.
-- PikeOS priorities are 0 .. 255
-- Priorities greather than 245 are reserved to the system software (PSSW)
-- This implementation reserves priorities 224-239 to interrupts
-- Priorities 240-245 are reserved to HM and PikeOS exception handlers
Max_Priority : constant Positive := 223;
Max_Interrupt_Priority : constant Positive := 239;
subtype Any_Priority is Integer range 1 .. Max_Interrupt_Priority;
subtype Priority is Any_Priority
range Any_Priority'First .. Max_Priority;
subtype Interrupt_Priority is Any_Priority
range Priority'Last + 1 .. Any_Priority'Last;
Default_Priority : constant Priority :=
(Priority'First + Priority'Last) / 2;
private
type Address is mod Memory_Size;
Null_Address : constant Address := 0;
--------------------------------------
-- System Implementation Parameters --
--------------------------------------
-- These parameters provide information about the target that is used
-- by the compiler. They are in the private part of System, where they
-- can be accessed using the special circuitry in the Targparm unit
-- whose source should be consulted for more detailed descriptions
-- of the individual switch values.
Atomic_Sync_Default : constant Boolean := False;
Backend_Divide_Checks : constant Boolean := False;
Backend_Overflow_Checks : constant Boolean := True;
Command_Line_Args : constant Boolean := False;
Configurable_Run_Time : constant Boolean := True;
Denorm : constant Boolean := True;
Duration_32_Bits : constant Boolean := False;
Exit_Status_Supported : constant Boolean := False;
Fractional_Fixed_Ops : constant Boolean := False;
Frontend_Layout : constant Boolean := False;
Machine_Overflows : constant Boolean := False;
Machine_Rounds : constant Boolean := True;
Preallocated_Stacks : constant Boolean := True;
Signed_Zeros : constant Boolean := True;
Stack_Check_Default : constant Boolean := False;
Stack_Check_Probes : constant Boolean := True;
Stack_Check_Limits : constant Boolean := False;
Support_Aggregates : constant Boolean := True;
Support_Composite_Assign : constant Boolean := True;
Support_Composite_Compare : constant Boolean := True;
Support_Long_Shifts : constant Boolean := True;
Always_Compatible_Rep : constant Boolean := True;
Suppress_Standard_Library : constant Boolean := False;
Use_Ada_Main_Program_Name : constant Boolean := False;
Frontend_Exceptions : constant Boolean := False;
ZCX_By_Default : constant Boolean := True;
-- Select the appropriate entry point, linker script, and libraries for a
-- PikeOS partition.
-- Traditionally the entry point of a native application is _p4_entry. For
-- an APEX application, it is _begin.
-- In order to use the same link options for both personalities, _begin is
-- used for native as well.
pragma Linker_Options
("-u__p4_start" & ASCII.NUL & "-e__p4_start" & ASCII.NUL &
"-u_p4_entry" & ASCII.NUL &
"-nostdlib" & ASCII.NUL &
"-T../ld/arm-app.ld" & ASCII.NUL &
"-lvm" & ASCII.NUL & "-lp4" & ASCII.NUL & "-lstand" & ASCII.NUL &
"-lgcc");
end System;
| 46.376963 | 79 | 0.575525 |
5e7dc763f73ce0c9c0cb9583f1958fccee9813e0 | 2,677 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/g-regpat.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/g-regpat.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/g-regpat.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . R E G P A T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1986 by University of Toronto. --
-- Copyright (C) 1999-2010, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package does not require a body, since it is a package renaming. We
-- provide a dummy file containing a No_Body pragma so that previous versions
-- of the body (which did exist) will not interfere.
pragma No_Body;
| 70.447368 | 78 | 0.391857 |
5e5834a69ec905fb52890a1fd734461144101950 | 357 | ads | Ada | source/tasking/a-astaco.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/tasking/a-astaco.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/tasking/a-astaco.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- with Ada.Task_Identification;
package Ada.Asynchronous_Task_Control is
pragma Preelaborate;
-- procedure Hold (T : Task_Identification.Task_Id);
-- procedure Continue (T : Task_Identification.Task_Id);
-- function Is_Held (T : Task_Identification.Task_Id)
-- return Boolean;
end Ada.Asynchronous_Task_Control;
| 29.75 | 57 | 0.773109 |
c7707e8ed2e03411c922f1894dc515da76f0a908 | 42,671 | adb | Ada | tests/natools-constant_indefinite_ordered_map_tests.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | tests/natools-constant_indefinite_ordered_map_tests.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | tests/natools-constant_indefinite_ordered_map_tests.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- Copyright (c) 2014-2017, 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. --
------------------------------------------------------------------------------
with Ada.Containers;
with Ada.Strings.Unbounded;
with Natools.Constant_Indefinite_Ordered_Maps;
package body Natools.Constant_Indefinite_Ordered_Map_Tests is
package Test_Maps is new
Constant_Indefinite_Ordered_Maps
(Key_Type => String,
Element_Type => Integer);
function Image (Map : Test_Maps.Unsafe_Maps.Map) return String;
function Image (Map : Test_Maps.Updatable_Map) return String;
function Sample_Map return Test_Maps.Unsafe_Maps.Map;
function Sample_Map return Test_Maps.Updatable_Map
is (Test_Maps.Create (Sample_Map));
------------------------------
-- Local Helper Subprograms --
------------------------------
function Image (Map : Test_Maps.Unsafe_Maps.Map) return String is
use Ada.Strings.Unbounded;
Result : Unbounded_String;
First : Boolean := True;
procedure Process (Cursor : Test_Maps.Unsafe_Maps.Cursor);
procedure Process (Cursor : Test_Maps.Unsafe_Maps.Cursor) is
begin
if First then
First := False;
else
Append (Result, ", ");
end if;
Append (Result, Test_Maps.Unsafe_Maps.Key (Cursor));
Append (Result, " ->");
Append
(Result, Integer'Image (Test_Maps.Unsafe_Maps.Element (Cursor)));
end Process;
begin
Append (Result, "(");
Map.Iterate (Process'Access);
Append (Result, ")");
return To_String (Result);
end Image;
function Image (Map : Test_Maps.Updatable_Map) return String is
begin
return Image (Map.To_Unsafe_Map);
end Image;
function Sample_Map return Test_Maps.Unsafe_Maps.Map is
Result : Test_Maps.Unsafe_Maps.Map;
begin
for I in 0 .. 9 loop
Result.Insert
((1 => '1',
2 => Character'Val (Character'Pos ('0') + I)),
I + 10);
Result.Insert
((1 => '2',
2 => Character'Val (Character'Pos ('0') + I)),
I + 20);
end loop;
return Result;
end Sample_Map;
-------------------------
-- Complete Test Suite --
-------------------------
procedure All_Tests (Report : in out NT.Reporter'Class) is
begin
Consistency (Report);
Cursor_Operations (Report);
Direct_Access (Report);
Empty_Map (Report);
Iterations (Report);
Map_Updates (Report);
Unsafe_Map_Roundtrip (Report);
Ada_2012_Indexing (Report);
Ada_2012_Iteration (Report);
Ada_2012_Errors (Report);
Range_Iterators (Report);
Update_Constructors (Report);
Update_Constructor_Exceptions (Report);
Rank (Report);
end All_Tests;
----------------------
-- Individual Tests --
----------------------
procedure Ada_2012_Errors (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Errors in Ada 2012 extensions");
begin
declare
Map : Test_Maps.Updatable_Map := Sample_Map;
Fixed_Map : constant Test_Maps.Updatable_Map := Sample_Map;
Empty_Map : constant Test_Maps.Updatable_Map
:= Test_Maps.Create (Test_Maps.Unsafe_Maps.Empty_Map);
I : Integer;
begin
for Position in Empty_Map.Iterate loop
Test.Fail ("Found element in empty map:");
Test.Info (" (" & Test_Maps.Key (Position)
& " ->" & Integer'Image (Test_Maps.Element (Position)) & ')');
end loop;
for Position in reverse Empty_Map.Iterate loop
Test.Fail ("Found element in reverse empty map:");
Test.Info (" (" & Test_Maps.Key (Position)
& " ->" & Integer'Image (Test_Maps.Element (Position)) & ')');
end loop;
begin
I := Fixed_Map ("#1");
Test.Fail ("Found value " & Integer'Image (I) & " for key ""#1""");
exception
when Constraint_Error => null;
when Error : others =>
Test.Fail ("Unexpected exception for value ""#1""");
Test.Report_Exception (Error, NT.Fail);
end;
begin
I := Fixed_Map (Fixed_Map.Find ("#2"));
Test.Fail ("Found value " & Integer'Image (I) & " for key ""#2""");
exception
when Constraint_Error => null;
when Error : others =>
Test.Fail ("Unexpected exception with value for ""#2""");
Test.Report_Exception (Error, NT.Fail);
end;
begin
I := Fixed_Map (Map.Find ("20"));
Test.Fail ("Found value " & Integer'Image (I)
& " for key ""20"" in foreign map");
exception
when Program_Error => null;
when Error : others =>
Test.Fail ("Unexpected exception with for foreign cursor");
Test.Report_Exception (Error, NT.Fail);
end;
begin
Map ("#3") := 93;
Test.Fail ("Found node for key ""#3""");
exception
when Constraint_Error => null;
when Error : others =>
Test.Fail ("Unexpected exception for value ""#3""");
Test.Report_Exception (Error, NT.Fail);
end;
begin
Map (Map.Find ("#4")) := 94;
Test.Fail ("Found node for key ""#4""");
exception
when Constraint_Error => null;
when Error : others =>
Test.Fail ("Unexpected exception with node for ""#4""");
Test.Report_Exception (Error, NT.Fail);
end;
begin
Map (Fixed_Map.Find ("20")) := 95;
Test.Fail ("Found node for key ""20"" in foreign map");
exception
when Program_Error => null;
when Error : others =>
Test.Fail ("Unexpected exception with node for foreign cursor");
Test.Report_Exception (Error, NT.Fail);
end;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Ada_2012_Errors;
procedure Ada_2012_Indexing (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Ada 2012 user-defined indexing");
procedure Test_Constant (Map : in Test_Maps.Updatable_Map);
procedure Test_Constant (Map : in Test_Maps.Updatable_Map) is
I : Integer;
begin
I := Map ("25");
if I /= 25 then
Test.Fail ("Unexpacted value" & Integer'Image (I)
& " for Map (""25"")");
end if;
I := Map (Map.Find ("12"));
if I /= 12 then
Test.Fail ("Unexpacted value" & Integer'Image (I)
& " for Map (""12"")");
end if;
end Test_Constant;
begin
declare
Map : Test_Maps.Updatable_Map := Sample_Map;
I : Integer;
begin
I := Map ("15");
if I /= 15 then
Test.Fail ("Unexpacted value" & Integer'Image (I)
& " for Map (""15"")");
end if;
Map ("23") := 2;
I := Map.Element ("23");
if I /= 2 then
Test.Fail ("Unexpected value" & Integer'Image (I)
& " for updated Map (""23"")");
Test.Info ("Full map: " & Image (Map));
end if;
Test_Constant (Map);
end;
exception
when Error : others => Test.Report_Exception (Error);
end Ada_2012_Indexing;
procedure Ada_2012_Iteration (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Ada 2012 user-defined iteration");
begin
declare
Map : Test_Maps.Updatable_Map := Sample_Map;
Expected, Direction : Integer;
Abort_Loop : Boolean := False;
procedure Test_Element (Element : in Integer);
procedure Test_Element (Element : in Integer) is
begin
if Expected /= Element then
Test.Fail ("Got element" & Integer'Image (Element)
& ", expected" & Integer'Image (Expected));
Test.Info ("Current map: " & Image (Map));
Abort_Loop := True;
end if;
Expected := Expected + Direction;
end Test_Element;
begin
Direction := 1;
Expected := 10;
Abort_Loop := False;
for Element of Map loop
Test_Element (Element);
exit when Abort_Loop;
end loop;
Direction := -1;
Expected := 29;
Abort_Loop := False;
for Element of reverse Map loop
Test_Element (Element);
exit when Abort_Loop;
end loop;
Expected := 59;
Direction := -1;
for Element of Map loop
Element := Expected;
Expected := Expected + Direction;
end loop;
Direction := 1;
Expected := 40;
Abort_Loop := False;
for Element of reverse Map loop
Test_Element (Element);
exit when Abort_Loop;
end loop;
Direction := 1;
Expected := 50;
Abort_Loop := False;
for Position in reverse Map.Iterate (Map.Find ("19")) loop
Test_Element (Test_Maps.Element (Position));
exit when Abort_Loop;
end loop;
Direction := -1;
Expected := 50;
Abort_Loop := False;
for Position in Map.Iterate (Map.Find ("19")) loop
Test_Element (Test_Maps.Element (Position));
exit when Abort_Loop;
end loop;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Ada_2012_Iteration;
procedure Consistency (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Consistency checks");
begin
if Test_Maps.Has_Element (Test_Maps.No_Element) then
Test.Fail ("No_Element has an element");
end if;
declare
use type Ada.Containers.Count_Type;
use type Test_Maps.Cursor;
Map : constant Test_Maps.Updatable_Map := Sample_Map;
Cursor : Test_Maps.Cursor;
begin
if Map.Length /= 20 then
Test.Fail ("Unexpected map length:"
& Ada.Containers.Count_Type'Image (Map.Length));
end if;
Cursor := Map.First;
if Test_Maps.Key (Cursor) /= Map.First_Key then
Test.Fail ("Key (First) /= First_Key");
end if;
if Test_Maps.Element (Cursor) /= Map.First_Element then
Test.Fail ("Element (First) /= First_Element");
end if;
if Test_Maps.Previous (Cursor) /= Test_Maps.No_Element then
Test.Fail ("Previous (First) has element");
end if;
Test_Maps.Next (Cursor);
if Cursor < Map.First then
Test.Fail ("Second < First");
end if;
if Cursor < Map.First_Key then
Test.Fail ("Second < First_Key");
end if;
if not (Map.First_Key < Cursor) then
Test.Fail ("Second <= First_Key");
end if;
Cursor := Map.Last;
if Test_Maps.Key (Cursor) /= Map.Last_Key then
Test.Fail ("Key (Last) /= Last_Key");
end if;
if Test_Maps.Element (Cursor) /= Map.Last_Element then
Test.Fail ("Element (Last) /= Last_Element");
end if;
if Test_Maps.Next (Cursor) /= Test_Maps.No_Element then
Test.Fail ("Next (Last) has element");
end if;
Test_Maps.Previous (Cursor);
if Cursor > Map.Last then
Test.Fail ("Before_Last > Last");
end if;
if Cursor > Map.Last_Key then
Test.Fail ("Before_Last > Last_Key");
end if;
if not (Map.Last_Key > Cursor) then
Test.Fail ("Before_Last >= Last_Key");
end if;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Consistency;
procedure Cursor_Operations (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Cursor operations");
begin
declare
procedure Check (Cursor : in Test_Maps.Cursor);
procedure Check (Key : in String; Element : in Integer);
Expected : String := "??";
procedure Check (Cursor : in Test_Maps.Cursor) is
begin
Test_Maps.Query_Element (Cursor, Check'Access);
end Check;
procedure Check (Key : in String; Element : in Integer) is
begin
if Key /= Expected or Element /= Integer'Value (Expected) then
Test.Fail ("Expected """ & Expected
& """, got (""" & Key
& " ->" & Integer'Image (Element) & ')');
end if;
end Check;
Map : constant Test_Maps.Updatable_Map := Sample_Map;
Cursor, Alternate : Test_Maps.Cursor;
begin
if Test_Maps.Has_Element (Cursor) then
Test.Fail ("Default cursor is not empty");
return;
end if;
Expected := "17";
Cursor := Map.Find (Expected);
if not Test_Maps.Has_Element (Cursor) then
Test.Fail ("Map.Find (""17"") has no element");
return;
end if;
Check (Cursor);
Alternate := Test_Maps.Previous (Cursor);
Expected := "16";
Check (Alternate);
Alternate := Test_Maps.Next (Cursor);
Expected := "18";
Check (Alternate);
Test_Maps.Clear (Alternate);
if Test_Maps.Has_Element (Alternate) then
Test.Fail ("Clear cursor has element");
return;
end if;
Test_Maps.Next (Alternate);
if Test_Maps.Has_Element (Alternate) then
Test.Fail ("Next (Empty_Cursor) has element");
return;
end if;
Test_Maps.Previous (Alternate);
if Test_Maps.Has_Element (Alternate) then
Test.Fail ("Previous (Empty_Cursor) has element");
end if;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Cursor_Operations;
procedure Direct_Access (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Direct node access");
begin
declare
use type Test_Maps.Cursor;
Map : constant Test_Maps.Updatable_Map := Sample_Map;
Img : String := "??";
Cursor : Test_Maps.Cursor;
begin
for I in 10 .. 29 loop
Img (1) := Character'Val (Character'Pos ('0') + I / 10);
Img (2) := Character'Val (Character'Pos ('0') + I mod 10);
if not Map.Contains (Img) then
Test.Fail ("Sample_Map should contain key """ & Img & '"');
elsif Map.Floor (Img) /= Map.Ceiling (Img) then
Test.Fail ("Floor /= Ceiling for existing key """ & Img & '"');
elsif Map.Element (Img) /= I then
Test.Fail ("Unexpected element"
& Integer'Image (Map.Element (Img))
& " for key """ & Img & '"');
end if;
Cursor := Map.Floor ("1");
if Test_Maps.Has_Element (Cursor) then
Test.Fail ("Map.Floor (""1"") is not empty ("""
& Test_Maps.Key (Cursor) & '"');
end if;
Cursor := Map.Find ("2");
if Test_Maps.Has_Element (Cursor) then
Test.Fail ("Map.Find (""2"") is not empty ("""
& Test_Maps.Key (Cursor) & '"');
end if;
Cursor := Map.Ceiling ("3");
if Test_Maps.Has_Element (Cursor) then
Test.Fail ("Map.Ceiling (""3"") is not empty ("""
& Test_Maps.Key (Cursor) & '"');
end if;
Cursor := Map.Floor ("2");
if not Test_Maps.Has_Element (Cursor) then
Test.Fail ("Map.Floor (""2"") is empty");
elsif Test_Maps.Key (Cursor) /= "19" then
Test.Fail ("Map.Floor (""2"") returns unexpected node """
& Test_Maps.Key (Cursor) & '"');
end if;
Cursor := Map.Ceiling ("2");
if not Test_Maps.Has_Element (Cursor) then
Test.Fail ("Map.Ceiling (""2"") is empty");
elsif Test_Maps.Key (Cursor) /= "20" then
Test.Fail ("Map.Ceiling (""2"") returns unexpected node """
& Test_Maps.Key (Cursor) & '"');
end if;
end loop;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Direct_Access;
procedure Empty_Map (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Operations on empty map");
begin
declare
use type Ada.Containers.Count_Type;
use type Test_Maps.Updatable_Map;
procedure Fail_Test (Cursor : in Test_Maps.Cursor);
procedure Fail_Test (Cursor : in Test_Maps.Cursor) is
pragma Unreferenced (Cursor);
begin
Test.Fail ("Unexpected callback use");
end Fail_Test;
Cursor : Test_Maps.Cursor;
Map : Test_Maps.Updatable_Map;
pragma Unmodified (Map);
begin
Map.Iterate (Fail_Test'Access);
Map.Reverse_Iterate (Fail_Test'Access);
if Test_Maps.Has_Element (Map.First) then
Test.Fail ("Empty_Map.First has an element");
end if;
if Test_Maps.Has_Element (Map.Last) then
Test.Fail ("Empty_Map.Last has an element");
end if;
if not Map.To_Unsafe_Map.Is_Empty then
Test.Fail ("Empty_Map.To_Unsafe_Map is not empty");
end if;
if Map.Length /= 0 then
Test.Fail ("Empty_Map.Length is not zero");
end if;
if Map.Contains ("foo") then
Test.Fail ("Empty_Map.Contains (""foo"")");
end if;
Cursor := Map.Find ("2");
if Test_Maps.Has_Element (Cursor) then
Test.Fail ("Empty_Map.Find (""2"") has element ("""
& Test_Maps.Key (Cursor) & """ ->"
& Integer'Image (Test_Maps.Element (Cursor)) & ')');
end if;
Cursor := Map.Floor ("2");
if Test_Maps.Has_Element (Cursor) then
Test.Fail ("Empty_Map.Floor (""2"") has element ("""
& Test_Maps.Key (Cursor) & """ ->"
& Integer'Image (Test_Maps.Element (Cursor)) & ')');
end if;
Cursor := Map.Ceiling ("2");
if Test_Maps.Has_Element (Cursor) then
Test.Fail ("Empty_Map.Ceiling (""2"") has element ("""
& Test_Maps.Key (Cursor) & """ ->"
& Integer'Image (Test_Maps.Element (Cursor)) & ')');
end if;
if Map /= Test_Maps.Create (Test_Maps.Unsafe_Maps.Empty_Map) then
Test.Fail ("Empty_Map /= Create (Unsafe_Empty_Map)");
end if;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Empty_Map;
procedure Iterations (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Iterative visit of the whole container");
begin
declare
Map : constant Test_Maps.Updatable_Map := Sample_Map;
procedure Check (Key : in String; Element : in Integer);
procedure Check_Cursor (Cursor : in Test_Maps.Cursor);
procedure Init_Backward (Id_Char : in Character);
procedure Init_Forward (Id_Char : in Character);
Id : String := "??";
Index : Integer := 0;
Direction : Integer := 1;
procedure Check (Key : in String; Element : in Integer) is
Space_Image : constant String := Integer'Image (Index);
Image : constant String
:= Space_Image (Space_Image'First + 1 .. Space_Image'Last);
begin
if Key /= Image then
Test.Fail (Id & '.' & Image
& ". unexpected key """ & Key & '"');
end if;
if Element /= Index then
Test.Fail (Id & '.' & Image
& ". unexpected element" & Integer'Image (Element));
end if;
Index := Index + Direction;
end Check;
procedure Check_Cursor (Cursor : in Test_Maps.Cursor) is
begin
Check (Test_Maps.Key (Cursor), Test_Maps.Element (Cursor));
end Check_Cursor;
procedure Init_Backward (Id_Char : in Character) is
begin
Id := Id_Char & 'b';
Index := 29;
Direction := -1;
end Init_Backward;
procedure Init_Forward (Id_Char : in Character) is
begin
Id := Id_Char & 'f';
Index := 10;
Direction := 1;
end Init_Forward;
begin
begin
Init_Forward ('1');
Map.Iterate (Check_Cursor'Access);
end;
begin
Init_Backward ('1');
Map.Reverse_Iterate (Check_Cursor'Access);
end;
declare
Cursor : Test_Maps.Cursor := Map.First;
begin
Init_Forward ('2');
while Test_Maps.Has_Element (Cursor) loop
Check_Cursor (Cursor);
Test_Maps.Next (Cursor);
end loop;
end;
declare
Cursor : Test_Maps.Cursor := Map.Last;
begin
Init_Backward ('2');
while Test_Maps.Has_Element (Cursor) loop
Check_Cursor (Cursor);
Test_Maps.Previous (Cursor);
end loop;
end;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Iterations;
procedure Map_Updates (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Map updates");
begin
declare
use type Test_Maps.Updatable_Map;
procedure Update (Key : in String; Element : in out Integer);
procedure Update (Key : in String; Element : in out Integer) is
pragma Unreferenced (Key);
begin
Element := 7;
end Update;
Map_A : Test_Maps.Updatable_Map := Sample_Map;
Map_B : Test_Maps.Updatable_Map := Sample_Map;
Cursor : Test_Maps.Cursor;
begin
if Map_A = Map_B then
Test.Fail ("Unrelated maps are equal");
return;
end if;
Cursor := Map_A.Find ("17");
pragma Assert (Test_Maps.Has_Element (Cursor));
if Test_Maps.Is_Related (Map_B, Cursor) then
Test.Fail ("Map_B and Cursor should be unrelated");
return;
end if;
Map_A.Update_Element (Cursor, Update'Access);
if Test_Maps.Element (Cursor) /= 7 then
Test.Fail ("Update failure, element is"
& Integer'Image (Test_Maps.Element (Cursor))
& ", should be 7");
end if;
Test_Maps.Move (Map_B, Map_A);
if not Map_A.Is_Empty then
Test.Fail ("Move source is not empty");
end if;
if not Test_Maps.Is_Related (Map_B, Cursor) then
Test.Fail ("Move target is not related to old source");
else
Map_B.Update_Element (Cursor, Update'Access);
end if;
Map_A.Replace (Map_B.To_Unsafe_Map);
if Map_A.Is_Empty then
Test.Fail ("Replaced map is empty");
end if;
if Map_A.Element ("17") /= 7 then
Test.Fail ("Unexpected value"
& Integer'Image (Map_A.Element ("17"))
& "for Map_A.Element (""17"")");
end if;
Map_B.Clear;
if not Map_B.Is_Empty then
Test.Fail ("Cleared map is not empty");
end if;
if Test_Maps.Is_Related (Map_B, Cursor) then
Test.Fail ("Clear map is still related to cursor");
end if;
if (not Test_Maps.Has_Element (Cursor))
or else Test_Maps.Element (Cursor) /= 7
then
Test.Fail ("Orphaned cursor has lost its value");
end if;
Test_Maps.Next (Cursor);
if (not Test_Maps.Has_Element (Cursor))
or else Test_Maps.Element (Cursor) /= 18
then
Test.Fail ("Moved orphaned cursor has lost its value");
end if;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Map_Updates;
procedure Range_Iterators (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Map updates");
begin
declare
Map : constant Test_Maps.Updatable_Map := Sample_Map;
Expected, Direction : Integer;
Abort_Loop : Boolean := False;
procedure Test_Element (Element : in Integer);
procedure Test_Element (Element : in Integer) is
begin
if Expected /= Element then
Test.Fail ("Got element" & Integer'Image (Element)
& ", expected" & Integer'Image (Expected));
Test.Info ("Current map: " & Image (Map));
Abort_Loop := True;
end if;
Expected := Expected + Direction;
end Test_Element;
begin
Direction := 1;
Expected := 10;
Abort_Loop := False;
for Position in Map.Iterate loop
Test_Element (Test_Maps.Element (Position));
exit when Abort_Loop;
end loop;
Direction := 1;
Expected := 15;
Abort_Loop := False;
for Position in Map.Iterate (Map.Find ("15"), Map.Find ("25")) loop
Test_Element (Test_Maps.Element (Position));
exit when Abort_Loop;
end loop;
Test_Element (26);
Direction := -1;
Expected := 23;
Abort_Loop := False;
for Position in reverse Map.Iterate (Map.Find ("13"), Map.Find ("23"))
loop
Test_Element (Test_Maps.Element (Position));
exit when Abort_Loop;
end loop;
Test_Element (12);
Direction := 1;
Expected := 99;
Abort_Loop := False;
for Position in Map.Iterate (Map.Find ("17"), Map.Find ("16")) loop
Test_Element (Test_Maps.Element (Position));
exit when Abort_Loop;
end loop;
Test_Element (99);
Direction := 1;
Expected := 99;
Abort_Loop := False;
for Position in reverse Map.Iterate (Map.Find ("27"), Map.Find ("26"))
loop
Test_Element (Test_Maps.Element (Position));
exit when Abort_Loop;
end loop;
Test_Element (99);
Direction := 1;
Expected := 10;
Abort_Loop := False;
for Position in Map.Iterate (Map.First, Map.Find ("20")) loop
Test_Element (Test_Maps.Element (Position));
exit when Abort_Loop;
end loop;
Test_Element (21);
Direction := -1;
Expected := 29;
Abort_Loop := False;
for Position in reverse Map.Iterate (Map.Find ("25"), Map.Last) loop
Test_Element (Test_Maps.Element (Position));
exit when Abort_Loop;
end loop;
Test_Element (24);
end;
exception
when Error : others => Test.Report_Exception (Error);
end Range_Iterators;
procedure Rank (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Rank function");
begin
declare
Map : constant Test_Maps.Updatable_Map := Sample_Map;
procedure Test_Rank
(Cursor : in Test_Maps.Cursor;
Expected : in Ada.Containers.Count_Type;
Name : in String);
procedure Test_Rank
(Cursor : in Test_Maps.Cursor;
Expected : in Ada.Containers.Count_Type;
Name : in String)
is
use type Ada.Containers.Count_Type;
Actual : constant Ada.Containers.Count_Type
:= Test_Maps.Rank (Cursor);
begin
if Actual /= Expected then
Test.Fail ("Expected rank"
& Ada.Containers.Count_Type'Image (Expected)
& " for " & Name & ", found"
& Ada.Containers.Count_Type'Image (Actual));
end if;
end Test_Rank;
begin
Test_Rank (Test_Maps.No_Element, 0, "No_Element");
Test_Rank (Map.First, 1, "Map.First");
Test_Rank (Map.Last, 20, "Map.Last");
Test_Rank (Test_Maps.Next (Map.First), 2, "Next (Map.First)");
Test_Rank (Test_Maps.Next (Map.Last), 0, "Next (Map.Last)");
end;
exception
when Error : others => Test.Report_Exception (Error);
end Rank;
procedure Unsafe_Map_Roundtrip (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("Constant_Map <-> Unsafe_Map roundtrip");
begin
declare
use type Test_Maps.Unsafe_Maps.Map;
Unsafe : constant Test_Maps.Unsafe_Maps.Map := Sample_Map;
Safe : constant Test_Maps.Updatable_Map := Test_Maps.Create (Unsafe);
Roundtrip : constant Test_Maps.Unsafe_Maps.Map := Safe.To_Unsafe_Map;
begin
if Unsafe /= Roundtrip then
Test.Fail;
Test.Info ("Original: " & Image (Unsafe));
Test.Info ("Roundtrip: " & Image (Roundtrip));
end if;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Unsafe_Map_Roundtrip;
procedure Update_Constructors (Report : in out NT.Reporter'Class) is
Test : NT.Test := Report.Item ("""Update"" constructors");
procedure Check_Map
(Map : in Test_Maps.Updatable_Map;
Context : in String;
Expected_Length : in Ada.Containers.Count_Type;
Dump : out Boolean);
-- Base map consistency check
procedure Check_Map_Not_Value
(Map : in Test_Maps.Updatable_Map;
Context : in String;
Expected_Length : in Ada.Containers.Count_Type;
Key : in String);
-- Check consistency and that Key does not exist
procedure Check_Map_Value
(Map : in Test_Maps.Updatable_Map;
Context : in String;
Expected_Length : in Ada.Containers.Count_Type;
Key : in String;
Value : in Integer);
-- Check consistency and that Key exists and is associated with Value
procedure Check_Map
(Map : in Test_Maps.Updatable_Map;
Context : in String;
Expected_Length : in Ada.Containers.Count_Type;
Dump : out Boolean)
is
use type Ada.Containers.Count_Type;
I : Integer;
Current : Test_Maps.Cursor := Map.First;
Previous : Test_Maps.Cursor;
begin
Dump := False;
if Map.Length /= Expected_Length then
Test.Fail (Context & ": found length"
& Ada.Containers.Count_Type'Image (Map.Length)
& ", expected:"
& Ada.Containers.Count_Type'Image (Expected_Length));
Dump := True;
end if;
if not Test_Maps.Has_Element (Current) then
return;
end if;
loop
begin
I := Integer'Value (Test_Maps.Key (Current));
exception
when Constraint_Error =>
Test.Fail (Context & ": Invalid key """
& Test_Maps.Key (Current) & '"');
Dump := True;
exit;
end;
if I /= abs Test_Maps.Element (Current) then
Test.Fail (Context & ": Inconsistent key """
& Test_Maps.Key (Current) & """ and value "
& Integer'Image (Test_Maps.Element (Current)));
Dump := True;
end if;
Previous := Current;
Test_Maps.Next (Current);
exit when not Test_Maps.Has_Element (Current);
if Test_Maps.Key (Previous) >= Test_Maps.Key (Current) then
Test.Fail (Context & ": Inconsistent ordering of keys """
& Test_Maps.Key (Previous) & """ and """
& Test_Maps.Key (Current));
Dump := True;
end if;
end loop;
end Check_Map;
procedure Check_Map_Not_Value
(Map : in Test_Maps.Updatable_Map;
Context : in String;
Expected_Length : in Ada.Containers.Count_Type;
Key : in String)
is
Dump : Boolean;
Position : constant Test_Maps.Cursor := Map.Find (Key);
begin
Check_Map (Map, Context, Expected_Length, Dump);
if Test_Maps.Has_Element (Position) then
Test.Fail (Context & ": unexpected key """
& Test_Maps.Key (Position) & """ found with value "
& Integer'Image (Test_Maps.Element (Position)));
Dump := True;
end if;
if Dump then
Test.Info (Context & ": Map dump " & Image (Map));
end if;
end Check_Map_Not_Value;
procedure Check_Map_Value
(Map : in Test_Maps.Updatable_Map;
Context : in String;
Expected_Length : in Ada.Containers.Count_Type;
Key : in String;
Value : in Integer)
is
Dump : Boolean;
Position : constant Test_Maps.Cursor := Map.Find (Key);
begin
Check_Map (Map, Context, Expected_Length, Dump);
if not Test_Maps.Has_Element (Position) then
Test.Fail (Context & ": key """ & Key & """ not found");
Dump := True;
elsif Test_Maps.Element (Position) /= Value then
Test.Fail (Context & ": key """ & Key & """ found with value "
& Integer'Image (Test_Maps.Element (Position))
& " instead of "
& Integer'Image (Value));
Dump := True;
end if;
if Dump then
Test.Info (Context & ": Map dump " & Image (Map));
end if;
end Check_Map_Value;
begin
declare
Base : constant Test_Maps.Updatable_Map := Sample_Map;
Position : Test_Maps.Cursor;
begin
Check_Map_Not_Value (Base, "Base", 20, "152");
Check_Map_Value
(Test_Maps.Insert (Test_Maps.Empty_Updatable_Map, "1", -1),
"Insert on empty map", 1,
"1", -1);
Check_Map_Value
(Test_Maps.Insert (Base, "152", 152),
"Insert", 21,
"152", 152);
Check_Map_Value
(Base.Include ("21 ", 21),
"Inserting Include", 21,
"21 ", 21);
Check_Map_Value
(Base.Include ("21", -21),
"Replacing Include", 20,
"21", -21);
Check_Map_Value
(Base.Replace ("28", -28),
"Replace", 20,
"28", -28);
Check_Map_Not_Value
(Test_Maps.Delete (Base, "11"),
"Delete", 19, "11");
Check_Map_Not_Value
(Test_Maps.Exclude (Base, "27"),
"Exclude", 19, "27");
Check_Map_Not_Value
(Test_Maps.Exclude (Test_Maps.Empty_Updatable_Map, "23"),
"Empty Exclude", 0, "23");
Check_Map_Value
(Test_Maps.Replace_Element (Base, Base.Find ("12"), -12, Position),
"Replace_Element", 20,
"12", -12);
if Test_Maps.Key (Position) /= "12" then
Test.Fail ("Output Position key is """
& Test_Maps.Key (Position) & """, expected ""12""");
end if;
if Test_Maps.Element (Position) /= -12 then
Test.Fail ("Output Position element is "
& Integer'Image (Test_Maps.Element (Position))
& ", expected -12");
end if;
declare
use type Test_Maps.Updatable_Map;
Derived : constant Test_Maps.Updatable_Map := Base.Exclude ("foo");
begin
if Derived /= Base then
Test.Fail ("No-op Exclude return differing maps");
Test.Info ("Base: " & Image (Base));
Test.Info ("Excluded: " & Image (Derived));
end if;
end;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Update_Constructors;
procedure Update_Constructor_Exceptions
(Report : in out NT.Reporter'Class)
is
Test : NT.Test := Report.Item
("Exceptions raised in ""Update"" constructors");
begin
declare
Map : constant Test_Maps.Updatable_Map := Sample_Map;
Unrelated_Map : constant Test_Maps.Updatable_Map := Sample_Map;
Unrelated_Position : constant Test_Maps.Cursor
:= Unrelated_Map.Find ("19");
Output : Test_Maps.Updatable_Map;
begin
Insert :
declare
Name : constant String := "Insert with used key";
begin
Output := Test_Maps.Insert (Map, "14", -14);
Test.Fail ("Expected exception in " & Name);
Test.Info ("Result: " & Image (Output));
exception
when Constraint_Error => null;
when others =>
Test.Fail ("Unexpected exception in " & Name);
end Insert;
Empty_Replace :
declare
Name : constant String := "Replace on empty map";
begin
Output := Test_Maps.Empty_Updatable_Map.Replace ("14", -14);
Test.Fail ("Expected exception in " & Name);
Test.Info ("Result: " & Image (Output));
exception
when Constraint_Error => null;
when others =>
Test.Fail ("Unexpected exception in " & Name);
end Empty_Replace;
Replace :
declare
Name : constant String := "Replace with non-existent key";
begin
Output := Map.Replace ("-14", -14);
Test.Fail ("Expected exception in " & Name);
Test.Info ("Result: " & Image (Output));
exception
when Constraint_Error => null;
when others =>
Test.Fail ("Unexpected exception in " & Name);
end Replace;
Replace_Element :
declare
Name : constant String := "Replace_Element with empty cursor";
Position : constant Test_Maps.Cursor := Map.Find ("-18");
begin
Output := Test_Maps.Replace_Element (Map, Position, -18);
Test.Fail ("Expected exception in " & Name);
Test.Info ("Result: " & Image (Output));
exception
when Constraint_Error => null;
when others =>
Test.Fail ("Unexpected exception in " & Name);
end Replace_Element;
Unrelated_Replace_Element :
declare
Name : constant String := "Replace_Element with unrelated cursor";
begin
Output := Test_Maps.Replace_Element (Map, Unrelated_Position, -1);
Test.Fail ("Expected exception in " & Name);
Test.Info ("Result: " & Image (Output));
exception
when Program_Error => null;
when others =>
Test.Fail ("Unexpected exception in " & Name);
end Unrelated_Replace_Element;
Empty_Delete_Key :
declare
Name : constant String := "Delete on empty map";
begin
Output := Test_Maps.Delete (Test_Maps.Empty_Updatable_Map, "24");
Test.Fail ("Expected exception in " & Name);
Test.Info ("Result: " & Image (Output));
exception
when Constraint_Error => null;
when others =>
Test.Fail ("Unexpected exception in " & Name);
end Empty_Delete_Key;
Delete_Key :
declare
Name : constant String := "Delete with non-existent key";
begin
Output := Test_Maps.Delete (Map, "-24");
Test.Fail ("Expected exception in " & Name);
Test.Info ("Result: " & Image (Output));
exception
when Constraint_Error => null;
when others =>
Test.Fail ("Unexpected exception in " & Name);
end Delete_Key;
Delete_Empty_Cursor :
declare
Name : constant String := "Delete with empty cursor";
begin
Output := Test_Maps.Delete (Map, Test_Maps.No_Element);
Test.Fail ("Expected exception in " & Name);
Test.Info ("Result: " & Image (Output));
exception
when Constraint_Error => null;
when others =>
Test.Fail ("Unexpected exception in " & Name);
end Delete_Empty_Cursor;
Delete_Unrelated_Cursor :
declare
Name : constant String := "Delete with unrelated cursor";
begin
Output := Test_Maps.Delete (Map, Unrelated_Position);
Test.Fail ("Expected exception in " & Name);
Test.Info ("Result: " & Image (Output));
exception
when Program_Error => null;
when others =>
Test.Fail ("Unexpected exception in " & Name);
end Delete_Unrelated_Cursor;
end;
exception
when Error : others => Test.Report_Exception (Error);
end Update_Constructor_Exceptions;
end Natools.Constant_Indefinite_Ordered_Map_Tests;
| 33.310695 | 79 | 0.53793 |
302f8180e1aef102bb02c2a6494b849aa62e2a1a | 789 | adb | Ada | Ada/exception/catch_error.adb | egustafson/sandbox | 9804e966347b33558b0497a04edb1a591d2d7773 | [
"Apache-2.0"
] | 2 | 2019-09-27T21:25:26.000Z | 2019-12-29T11:26:54.000Z | Ada/exception/catch_error.adb | egustafson/sandbox | 9804e966347b33558b0497a04edb1a591d2d7773 | [
"Apache-2.0"
] | 7 | 2020-08-11T17:32:14.000Z | 2020-08-11T17:32:39.000Z | Ada/exception/catch_error.adb | egustafson/sandbox | 9804e966347b33558b0497a04edb1a591d2d7773 | [
"Apache-2.0"
] | 2 | 2016-07-18T10:55:50.000Z | 2020-08-19T01:46:08.000Z | with Ada.Text_IO, Ada.Integer_Text_IO;
use Ada.Text_IO, Ada.Integer_Text_IO;
procedure Catch_Error is
subtype Small_Integer is Integer range 0 .. 1000;
Result : Small_Integer;
Multiplicand : Small_Integer;
begin
Multiplicand := 2;
-- The following should evaluate to an out of range value
-- and thus should raise the Constraint_Error exception.
Result := Small_Integer'Last * Multiplicand;
Put("The result of multiplying ");
Put(Small_Integer'Last);
Put(" and ");
Put(Multiplicand);
Put(" is ");
Put(Result);
Put_Line(".");
exception
when Constraint_Error =>
Put("The result was out of the range ");
Put(Small_Integer'First);
Put(" .. ");
Put(Small_Integer'Last);
Put_Line(".");
end Catch_Error;
| 21.324324 | 60 | 0.662864 |
a0bd4d9b22158dbb68868edbace20ec6ad07223d | 3,098 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c97205a.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/c9/c97205a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c97205a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C97205A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT IF THE RENDEZVOUS IS IMMEDIATELY POSSIBLE (FOR A
-- CONDITIONAL ENTRY CALL), IT IS PERFORMED.
-- CASE A: SINGLE ENTRY; THE CALLED TASK IS EXECUTING AN ACCEPT
-- STATEMENT.
-- WRG 7/13/86
-- PWN 09/11/94 REMOVED PRAGMA PRIORITY FOR ADA 9X.
with Impdef;
WITH REPORT; USE REPORT;
WITH SYSTEM; USE SYSTEM;
PROCEDURE C97205A IS
RENDEZVOUS_OCCURRED : BOOLEAN := FALSE;
STATEMENTS_AFTER_CALL_EXECUTED : BOOLEAN := FALSE;
COUNT : POSITIVE := 1;
BEGIN
TEST ("C97205A", "CHECK THAT IF THE RENDEZVOUS IS IMMEDIATELY " &
"POSSIBLE (FOR A CONDITIONAL ENTRY CALL), IT " &
"IS PERFORMED");
DECLARE
TASK T IS
ENTRY E (B : IN OUT BOOLEAN);
END T;
TASK BODY T IS
BEGIN
ACCEPT E (B : IN OUT BOOLEAN) DO
B := IDENT_BOOL (TRUE);
END E;
END T;
BEGIN
WHILE NOT STATEMENTS_AFTER_CALL_EXECUTED LOOP
DELAY 1.0 * Impdef.One_Second;
SELECT
T.E (RENDEZVOUS_OCCURRED);
STATEMENTS_AFTER_CALL_EXECUTED := IDENT_BOOL (TRUE);
ELSE
IF COUNT < 60 * 60 THEN
COUNT := COUNT + 1;
ELSE
FAILED ("NO RENDEZVOUS AFTER AT LEAST ONE " &
"HOUR ELAPSED");
EXIT;
END IF;
END SELECT;
END LOOP;
END;
IF NOT RENDEZVOUS_OCCURRED THEN
FAILED ("RENDEZVOUS DID NOT OCCUR");
END IF;
IF COUNT > 1 THEN
COMMENT ("DELAYED" & POSITIVE'IMAGE(COUNT) & " SECONDS");
END IF;
RESULT;
END C97205A;
| 32.610526 | 79 | 0.570045 |
1ea46288edf969cd7b00ef6456e955394e6091a1 | 2,258 | ads | Ada | src/formatted_output_natural.ads | VitalijBondarenko/Formatted_Output_NG | 91fbdba8b2c720d9769a52f2b2152c14236adaa0 | [
"MIT"
] | null | null | null | src/formatted_output_natural.ads | VitalijBondarenko/Formatted_Output_NG | 91fbdba8b2c720d9769a52f2b2152c14236adaa0 | [
"MIT"
] | null | null | null | src/formatted_output_natural.ads | VitalijBondarenko/Formatted_Output_NG | 91fbdba8b2c720d9769a52f2b2152c14236adaa0 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (c) 2016 Vitalij 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 Formatted_Output.Integer_Output;
package Formatted_Output_Natural is
new Formatted_Output.Integer_Output (Natural);
| 68.424242 | 78 | 0.441541 |
1a646736b1ba982e316827645f29e9fbcb736928 | 2,262 | ads | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-cgarso.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-cgarso.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-cgarso.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . G E N E R I C _ A R R A Y _ S O R T --
-- --
-- S p e c --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
generic
type Index_Type is (<>);
type Element_Type is private;
type Array_Type is array (Index_Type range <>) of Element_Type;
with function "<" (Left, Right : Element_Type) return Boolean is <>;
procedure Ada.Containers.Generic_Array_Sort (Container : in out Array_Type);
pragma Pure (Ada.Containers.Generic_Array_Sort);
-- Reorders the elements of Container such that the elements are sorted
-- smallest first as determined by the generic formal "<" operator provided.
-- Any exception raised during evaluation of "<" is propagated.
--
-- The actual function for the generic formal function "<" is expected to
-- return the same value each time it is called with a particular pair of
-- element values. It should not modify Container and it should define a
-- strict weak ordering relationship: irreflexive, asymmetric, transitive, and
-- in addition, if x < y for any values x and y, then for all other values z,
-- (x < z) or (z < y). If the actual for "<" behaves in some other manner,
-- the behavior of the instance of Generic_Array_Sort is unspecified. The
-- number of times Generic_Array_Sort calls "<" is unspecified.
| 61.135135 | 79 | 0.5084 |
389c986c99fba8faa7b84bf0aa8af8ca5e25ed81 | 1,773 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_alloc_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_alloc_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_alloc_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 swig;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_alloc_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;
red : aliased Interfaces.Unsigned_16;
green : aliased Interfaces.Unsigned_16;
blue : aliased Interfaces.Unsigned_16;
pad1 : aliased swig.int8_t_Array (0 .. 1);
pixel : aliased Interfaces.Unsigned_32;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_alloc_color_reply_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_alloc_color_reply_t.Item,
Element_Array => xcb.xcb_alloc_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_alloc_color_reply_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_alloc_color_reply_t.Pointer,
Element_Array => xcb.xcb_alloc_color_reply_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_alloc_color_reply_t;
| 29.55 | 76 | 0.651438 |
304c0811d3133b96fc72a6a2ca7155c6a9eaccc6 | 6,734 | adb | Ada | src/orig/dds-request_reply-connext_c_untyped_impl.adb | alexcamposruiz/dds-requestreply | 9f29d34554b5d3e9291151c6e92d2ce6cc31bb71 | [
"MIT"
] | null | null | null | src/orig/dds-request_reply-connext_c_untyped_impl.adb | alexcamposruiz/dds-requestreply | 9f29d34554b5d3e9291151c6e92d2ce6cc31bb71 | [
"MIT"
] | null | null | null | src/orig/dds-request_reply-connext_c_untyped_impl.adb | alexcamposruiz/dds-requestreply | 9f29d34554b5d3e9291151c6e92d2ce6cc31bb71 | [
"MIT"
] | 2 | 2020-04-06T19:34:15.000Z | 2020-04-06T19:50:03.000Z | pragma Ada_2012;
package body DDS.Request_Reply.connext_c_untyped_impl is
----------------------------------------------------
-- RTI_Connext_EntityUntypedImpl_Wait_For_Samples --
----------------------------------------------------
function RTI_Connext_EntityUntypedImpl_Wait_For_Samples
(Self : not null access RTI_Connext_EntityUntypedImpl;
Max_Wait : DDS.Duration_T; Min_Sample_Count : DDS.Natural;
Waitset : not null DDS.WaitSet.Ref_Access;
Initial_Condition : DDS.ReadCondition.Ref_Access;
Condition : DDS.ReadCondition.Ref_Access) return Dds.ReturnCode_T
is
begin
pragma Compile_Time_Warning (Standard.True,
"RTI_Connext_EntityUntypedImpl_Wait_For_Samples unimplemented");
return raise Program_Error
with "Unimplemented function RTI_Connext_EntityUntypedImpl_Wait_For_Samples";
end RTI_Connext_EntityUntypedImpl_Wait_For_Samples;
-----------------------------------------------------
-- RTI_Connext_EntityUntypedImpl_Get_Sample_Loaned --
-----------------------------------------------------
function RTI_Connext_EntityUntypedImpl_Get_Sample_Loaned
(Self : not null access RTI_Connext_EntityUntypedImpl;
Received_Data : System.Address; Data_Count : out DDS.Integer;
Is_Loan : DDS.Boolean; DataSeqContiguousBuffer : System.Address;
Info_Seq : not null access DDS.SampleInfo_Seq.Sequence;
Data_Seq_Len : DDS.long; Data_Seq_Max_Len : DDS.long;
Ownership : DDS.Boolean; Max_Samples : DDS.long;
Read_Condition : DDS.ReadCondition.Ref_Access; Take : DDS.Boolean)
return Dds.ReturnCode_T
is
begin
pragma Compile_Time_Warning (Standard.True,
"RTI_Connext_EntityUntypedImpl_Get_Sample_Loaned unimplemented");
return raise Program_Error
with "Unimplemented function RTI_Connext_EntityUntypedImpl_Get_Sample_Loaned";
end RTI_Connext_EntityUntypedImpl_Get_Sample_Loaned;
-----------------------------------------------
-- RTI_Connext_EntityUntypedImpl_Send_Sample --
-----------------------------------------------
function RTI_Connext_EntityUntypedImpl_Send_Sample
(Self : not null access RTI_Connext_EntityUntypedImpl;
Data : System.Address; Info : not null access DDS.WriteParams_T)
return DDS.ReturnCode_T
is
begin
pragma Compile_Time_Warning (Standard.True,
"RTI_Connext_EntityUntypedImpl_Send_Sample unimplemented");
return raise Program_Error
with "Unimplemented function RTI_Connext_EntityUntypedImpl_Send_Sample";
end RTI_Connext_EntityUntypedImpl_Send_Sample;
-------------------------------------------------------
-- RTI_Connext_EntityUntypedImpl_wait_for_any_sample --
-------------------------------------------------------
function RTI_Connext_EntityUntypedImpl_wait_for_any_sample
(Self : not null access RTI_Connext_EntityUntypedImpl;
max_wait : Duration_t; Min_Sample_Count : Integer) return DDS
.ReturnCode_T
is
begin
pragma Compile_Time_Warning (Standard.True,
"RTI_Connext_EntityUntypedImpl_wait_for_any_sample unimplemented");
return raise Program_Error
with "Unimplemented function RTI_Connext_EntityUntypedImpl_wait_for_any_sample";
end RTI_Connext_EntityUntypedImpl_wait_for_any_sample;
-----------------------------------------------
-- RTI_Connext_EntityUntypedImpl_Return_Loan --
-----------------------------------------------
function RTI_Connext_EntityUntypedImpl_Return_Loan
(Self : not null access RTI_Connext_EntityUntypedImpl;
dataArray : System.Address;
Info_Seq : not null access SampleInfo_Seq.Sequence) return DDS
.ReturnCode_T
is
begin
pragma Compile_Time_Warning (Standard.True,
"RTI_Connext_EntityUntypedImpl_Return_Loan unimplemented");
return raise Program_Error
with "Unimplemented function RTI_Connext_EntityUntypedImpl_Return_Loan";
end RTI_Connext_EntityUntypedImpl_Return_Loan;
--------------------------------------------------
-- RTI_Connext_EntityUntypedImpl_Get_Datawriter --
--------------------------------------------------
function RTI_Connext_EntityUntypedImpl_Get_Datawriter
(Self : not null access RTI_Connext_EntityUntypedImpl)
return DDS.DataWriter.Ref_Access
is
begin
pragma Compile_Time_Warning (Standard.True,
"RTI_Connext_EntityUntypedImpl_Get_Datawriter unimplemented");
return raise Program_Error
with "Unimplemented function RTI_Connext_EntityUntypedImpl_Get_Datawriter";
end RTI_Connext_EntityUntypedImpl_Get_Datawriter;
--------------------------------------------------
-- RTI_Connext_EntityUntypedImpl_Get_Datareader --
--------------------------------------------------
function RTI_Connext_EntityUntypedImpl_Get_Datareader
(Self : not null access RTI_Connext_EntityUntypedImpl)
return DDS.DataReader.Ref_Access
is
begin
pragma Compile_Time_Warning (Standard.True,
"RTI_Connext_EntityUntypedImpl_Get_Datareader unimplemented");
return raise Program_Error
with "Unimplemented function RTI_Connext_EntityUntypedImpl_Get_Datareader";
end RTI_Connext_EntityUntypedImpl_Get_Datareader;
------------------------------------------
-- RTI_Connext_EntityUntypedImpl_Delete --
------------------------------------------
function RTI_Connext_EntityUntypedImpl_Delete
(Self : RTI_Connext_EntityUntypedImpl_Access) return ReturnCode_t
is
begin
pragma Compile_Time_Warning (Standard.True,
"RTI_Connext_EntityUntypedImpl_Delete unimplemented");
return raise Program_Error
with "Unimplemented function RTI_Connext_EntityUntypedImpl_Delete";
end RTI_Connext_EntityUntypedImpl_Delete;
-----------------------------------------------------------
-- RTI_Connext_EntityUntypedImpl_Validate_Receive_Params --
-----------------------------------------------------------
function RTI_Connext_EntityUntypedImpl_Validate_Receive_Params
(Self : not null access RTI_Connext_EntityUntypedImpl;
METHOD_NAME : Standard.String; Min_Count : long; Max_Count : long;
Max_Wait : Duration_T) return Boolean
is
begin
pragma Compile_Time_Warning (Standard.True,
"RTI_Connext_EntityUntypedImpl_Validate_Receive_Params unimplemented");
return raise Program_Error
with "Unimplemented function RTI_Connext_EntityUntypedImpl_Validate_Receive_Params";
end RTI_Connext_EntityUntypedImpl_Validate_Receive_Params;
end DDS.Request_Reply.connext_c_untyped_impl;
| 44.013072 | 94 | 0.659341 |
305d1f877df5cc29cd4f9602646764a9fee7c585 | 13,396 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-mmap.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-mmap.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-mmap.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . M M A P --
-- --
-- S p e c --
-- --
-- Copyright (C) 2007-2020, AdaCore --
-- --
-- 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. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides memory mapping of files. Depending on your operating
-- system, this might provide a more efficient method for accessing the
-- contents of files.
-- A description of memory-mapping is available on the sqlite page, at:
-- http://www.sqlite.org/mmap.html
--
-- The traditional method for reading a file is to allocate a buffer in the
-- application address space, then open the file and copy its contents. When
-- memory mapping is available though, the application asks the operating
-- system to return a pointer to the requested page, if possible. If the
-- requested page has been or can be mapped into the application address
-- space, the system returns a pointer to that page for the application to
-- use without having to copy anything. Skipping the copy step is what makes
-- memory mapped I/O faster.
--
-- When memory mapping is not available, this package automatically falls
-- back to the traditional copy method.
--
-- Example of use for this package, when reading a file that can be fully
-- mapped
--
-- declare
-- File : Mapped_File;
-- Str : Str_Access;
-- begin
-- File := Open_Read ("/tmp/file_on_disk");
-- Read (File); -- read the whole file
-- Str := Data (File);
-- for S in 1 .. Last (File) loop
-- Put (Str (S));
-- end loop;
-- Close (File);
-- end;
--
-- When the file is big, or you only want to access part of it at a given
-- time, you can use the following type of code.
-- declare
-- File : Mapped_File;
-- Str : Str_Access;
-- Offs : File_Size := 0;
-- Page : constant Integer := Get_Page_Size;
-- begin
-- File := Open_Read ("/tmp/file_on_disk");
-- while Offs < Length (File) loop
-- Read (File, Offs, Length => Long_Integer (Page) * 4);
-- Str := Data (File);
--
-- -- Print characters for this chunk:
-- for S in Integer (Offs - Offset (File)) + 1 .. Last (File) loop
-- Put (Str (S));
-- end loop;
--
-- -- Since we are reading multiples of Get_Page_Size, we can simplify
-- -- with
-- -- for S in 1 .. Last (File) loop ...
--
-- Offs := Offs + Long_Integer (Last (File));
-- end loop;
with Interfaces.C;
with System.Strings;
package System.Mmap is
type Mapped_File is private;
-- File to be mapped in memory.
-- This package will use the fastest possible algorithm to load the
-- file in memory. On systems that support it, the file is not really
-- loaded in memory. Instead, a call to the mmap() system call (or
-- CreateFileMapping()) will keep the file on disk, but make it
-- accessible as if it was in memory.
-- When the system does not support it, the file is actually loaded in
-- memory through calls to read(), and written back with write() when you
-- close it. This is of course much slower.
-- Legacy: each mapped file has a "default" mapped region in it.
type Mapped_Region is private;
-- A representation of part of a file in memory. Actual reading/writing
-- is done through a mapped region. After being returned by Read, a mapped
-- region must be free'd when done. If the original Mapped_File was open
-- for reading, it can be closed before the mapped region is free'd.
Invalid_Mapped_File : constant Mapped_File;
Invalid_Mapped_Region : constant Mapped_Region;
type Unconstrained_String is new String (Positive);
type Str_Access is access all Unconstrained_String;
pragma No_Strict_Aliasing (Str_Access);
type File_Size is new Interfaces.C.size_t;
function To_Str_Access
(Str : System.Strings.String_Access) return Str_Access;
-- Convert Str. The returned value points to the same memory block, but no
-- longer includes the bounds, which you need to manage yourself
function Open_Read
(Filename : String;
Use_Mmap_If_Available : Boolean := True) return Mapped_File;
-- Open a file for reading. The same file can be shared by multiple
-- processes, that will see each others's changes as they occur.
-- Any attempt to write the data might result in a segmentation fault,
-- depending on how the file is open.
-- Name_Error is raised if the file does not exist.
-- Filename should be compatible with the filesystem.
function Open_Read_No_Exception
(Filename : String;
Use_Mmap_If_Available : Boolean := True) return Mapped_File;
-- Like Open_Read but return Invalid_Mapped_File in case of error
function Open_Write
(Filename : String;
Use_Mmap_If_Available : Boolean := True) return Mapped_File;
-- Open a file for writing.
-- You cannot change the length of the file.
-- Name_Error is raised if the file does not exist
-- Filename should be compatible with the filesystem.
procedure Close (File : in out Mapped_File);
-- Close the file, and unmap the memory that is used for the region
-- contained in File. If the system does not support the unmmap() system
-- call or equivalent, or these were not available for the file itself,
-- then the file is written back to the disk if it was opened for writing.
procedure Free (Region : in out Mapped_Region);
-- Unmap the memory that is used for this region and deallocate the region
procedure Read
(File : Mapped_File;
Region : in out Mapped_Region;
Offset : File_Size := 0;
Length : File_Size := 0;
Mutable : Boolean := False);
-- Read a specific part of File and set Region to the corresponding mapped
-- region, or re-use it if possible.
-- Offset is the number of bytes since the beginning of the file at which
-- we should start reading. Length is the number of bytes that should be
-- read. If set to 0, as much of the file as possible is read (presumably
-- the whole file unless you are reading a _huge_ file).
-- Note that no (un)mapping is is done if that part of the file is already
-- available through Region.
-- If the file was opened for writing, any modification you do to the
-- data stored in File will be stored on disk (either immediately when the
-- file is opened through a mmap() system call, or when the file is closed
-- otherwise).
-- Mutable is processed only for reading files. If set to True, the
-- data can be modified, even through it will not be carried through the
-- underlying file, nor it is guaranteed to be carried through remapping.
-- This function takes care of page size alignment issues. The accessors
-- below only expose the region that has been requested by this call, even
-- if more bytes were actually mapped by this function.
-- TODO??? Enable to have a private copy for readable files
function Read
(File : Mapped_File;
Offset : File_Size := 0;
Length : File_Size := 0;
Mutable : Boolean := False) return Mapped_Region;
-- Likewise, return a new mapped region
procedure Read
(File : Mapped_File;
Offset : File_Size := 0;
Length : File_Size := 0;
Mutable : Boolean := False);
-- Likewise, use the legacy "default" region in File
function Length (File : Mapped_File) return File_Size;
-- Size of the file on the disk
function Offset (Region : Mapped_Region) return File_Size;
-- Return the offset, in the physical file on disk, corresponding to the
-- requested mapped region. The first byte in the file has offest 0.
function Offset (File : Mapped_File) return File_Size;
-- Likewise for the region contained in File
function Last (Region : Mapped_Region) return Integer;
-- Return the number of requested bytes mapped in this region. It is
-- erroneous to access Data for indices outside 1 .. Last (Region).
-- Such accesses may cause Storage_Error to be raised.
function Last (File : Mapped_File) return Integer;
-- Return the number of requested bytes mapped in the region contained in
-- File. It is erroneous to access Data for indices outside of 1 .. Last
-- (File); such accesses may cause Storage_Error to be raised.
function Data (Region : Mapped_Region) return Str_Access;
-- The data mapped in Region as requested. The result is an unconstrained
-- string, so you cannot use the usual 'First and 'Last attributes.
-- Instead, these are respectively 1 and Size.
function Data (File : Mapped_File) return Str_Access;
-- Likewise for the region contained in File
function Is_Mutable (Region : Mapped_Region) return Boolean;
-- Return whether it is safe to change bytes in Data (Region). This is true
-- for regions from writeable files, for regions mapped with the "Mutable"
-- flag set, and for regions that are copied in a buffer. Note that it is
-- not specified whether empty regions are mutable or not, since there is
-- no byte no modify.
function Is_Mmapped (File : Mapped_File) return Boolean;
-- Whether regions for this file are opened through an mmap() system call
-- or equivalent. This is in general irrelevant to your application, unless
-- the file can be accessed by multiple concurrent processes or tasks. In
-- such a case, and if the file is indeed mmap-ed, then the various parts
-- of the file can be written simulatenously, and thus you cannot ensure
-- the integrity of the file. If the file is not mmapped, the latest
-- process to Close it overwrite what other processes have done.
function Get_Page_Size return Integer;
-- Returns the number of bytes in a page. Once a file is mapped from the
-- disk, its offset and Length should be multiples of this page size (which
-- is ensured by this package in any case). Knowing this page size allows
-- you to map as much memory as possible at once, thus potentially reducing
-- the number of system calls to read the file by chunks.
function Read_Whole_File
(Filename : String;
Empty_If_Not_Found : Boolean := False)
return System.Strings.String_Access;
-- Returns the whole contents of the file.
-- The returned string must be freed by the user.
-- This is a convenience function, which is of course slower than the ones
-- above since we also need to allocate some memory, actually read the file
-- and copy the bytes.
-- If the file does not exist, null is returned. However, if
-- Empty_If_Not_Found is True, then the empty string is returned instead.
-- Filename should be compatible with the filesystem.
private
pragma Inline (Data, Length, Last, Offset, Is_Mmapped, To_Str_Access);
type Mapped_File_Record;
type Mapped_File is access Mapped_File_Record;
type Mapped_Region_Record;
type Mapped_Region is access Mapped_Region_Record;
Invalid_Mapped_File : constant Mapped_File := null;
Invalid_Mapped_Region : constant Mapped_Region := null;
end System.Mmap;
| 47.503546 | 79 | 0.632353 |
301a672ba96df382839bb2454744daade50a3f5f | 6,961 | adb | Ada | 3-mid/opengl/source/lean/renderer/opengl-impostor-terrain.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/lean/renderer/opengl-impostor-terrain.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/lean/renderer/opengl-impostor-terrain.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
openGL.Camera,
openGL.Texture,
ada.unchecked_Deallocation;
package body openGL.Impostor.terrain
is
overriding
procedure set_Target (Self : in out Item; Target : in openGL.Visual.view)
is
begin
set_Target (openGL.impostor.item (Self), Target); -- Base class call.
Self.expand_X := 0.02;
Self.expand_Y := 0.02;
end set_Target;
procedure free (Self : in out View)
is
procedure deallocate is new ada.unchecked_Deallocation (Item'Class, View);
begin
destroy (Self.all);
deallocate (Self);
end free;
overriding
function current_Camera_look_at_Rotation (Self : in Item) return Matrix_3x3
is
begin
return Self.current_Camera_look_at_Rotation;
end current_Camera_look_at_Rotation;
overriding
function update_Required (Self : access Item; the_Camera : access Camera.item'Class) return Boolean
is
begin
Self.current_pixel_Region := Self.get_pixel_Region (camera_Spin => the_Camera.Spin,
camera_Site => the_Camera.Site,
camera_projection_Transform => the_Camera.projection_Transform,
camera_Viewport => the_Camera.Viewport);
declare
use GL;
use type GL.glInt;
update_Required : Boolean := Self.general_Update_required (the_Camera.Site, Self.current_pixel_Region);
copy_x_Offset : gl.glInt := 0;
copy_y_Offset : gl.glInt := 0;
copy_X : gl.glInt := Self.current_pixel_Region.X;
copy_Y : gl.glInt := Self.current_pixel_Region.Y;
copy_Width : gl.glSizeI := Self.current_pixel_Region.Width;
copy_Height : gl.glSizeI := Self.current_pixel_Region.Height;
viewport_Width : constant Integer := the_Camera.Viewport.Max (1) - the_Camera.Viewport.Min (1) + 1;
viewport_Height : constant Integer := the_Camera.Viewport.Max (2) - the_Camera.Viewport.Min (2) + 1;
Complete_left : Boolean;
Complete_right : Boolean;
Complete_top : Boolean;
Complete_bottom : Boolean;
now_Complete : Boolean;
begin
if copy_X < 0
then
copy_x_Offset := -copy_X;
copy_X := 0;
copy_Width := copy_Width - glSizeI (copy_x_Offset);
Complete_left := False;
Complete_right := True;
if copy_Width < 1
then
Self.is_Valid := False;
return False; -- NB: Short circuit return !
end if;
elsif copy_X + glInt (copy_Width) > glInt (Viewport_Width)
then
copy_Width := glSizeI (viewport_Width) - glSizeI (copy_X);
Complete_left := True;
Complete_right := False;
if copy_Width < 1
then
Self.is_Valid := False;
return False; -- NB: Short circuit return !
end if;
else
Complete_left := True;
Complete_right := True;
end if;
if copy_Y < 0
then
copy_y_Offset := -copy_Y;
copy_Y := 0;
copy_Height := copy_Height - glSizeI (copy_y_Offset);
Complete_top := True;
Complete_bottom := False;
if copy_Height < 1
then
Self.is_Valid := False;
return False; -- NB: Short circuit return !
end if;
elsif copy_Y + glInt (copy_Height) > glInt (Viewport_Height)
then
copy_Height := glSizeI (viewport_Height) - glSizeI (copy_Y);
Complete_top := False;
Complete_bottom := True;
if copy_Height < 1
then
Self.is_Valid := False;
return False; -- NB: Short circuit return !
end if;
else
Complete_top := True;
Complete_bottom := True;
end if;
now_Complete := Complete_left
and Complete_right
and Complete_top
and Complete_bottom;
if not update_Required
then -- Only do further tests if update not already required.
if Self.prior_Complete
then
if now_Complete
and then Self.size_Update_required (Self.current_pixel_Region)
then
update_Required := True;
end if;
else
if copy_Width > Self.prior_copy_Width
then
update_Required := True;
end if;
if copy_Height > Self.prior_copy_Height
then
update_Required := True;
end if;
end if;
end if;
if update_Required
then
Self.current_Width_pixels := Self.current_pixel_Region.Width; -- Cache current state.
Self.current_Height_pixels := Self.current_pixel_Region.Height;
Self.current_copy_X_Offset := copy_X_Offset;
Self.current_copy_Y_Offset := copy_Y_Offset;
Self.current_copy_X := copy_X;
Self.current_copy_Y := copy_Y;
Self.current_copy_Width := copy_Width;
Self.current_copy_Height := copy_Height;
Self.current_Complete := now_Complete;
Self.prior_copy_Width := Self.current_copy_Width; -- Set prior state.
Self.prior_copy_Height := Self.current_copy_Height;
Self.prior_Complete := Self.current_Complete;
end if;
Self.is_Valid := True;
Self.current_Camera_look_at_Rotation := the_Camera.Spin;
return update_Required;
end;
end update_Required;
overriding
procedure pre_update (Self : in out Item; the_Camera : access Camera.item'Class)
is
pragma unreferenced (the_Camera);
begin
Self.expand_X := 0.0;
Self.expand_Y := 0.0;
end pre_update;
overriding
procedure update (Self : in out Item; the_Camera : access Camera.item'Class;
texture_Pool : in Texture.Pool_view)
is
begin
Self.expand_X := 0.0;
Self.expand_Y := 0.0;
Impostor.item (Self).update (the_Camera, texture_Pool); -- Base class 'update'.
end update;
overriding
procedure post_update (Self : in out Item; the_Camera : access Camera.item'Class)
is
begin
null;
end post_update;
end openGL.Impostor.terrain;
| 30.134199 | 121 | 0.540583 |
9a2d2b4f7827e61725f1e907d08a23e3976f958c | 13,685 | adb | Ada | source/league/league-json-documents.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/league-json-documents.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/league-json-documents.adb | 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 --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013-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 League.JSON.Arrays.Internals;
with League.JSON.Objects.Internals;
with League.Stream_Element_Vectors.Internals;
with League.Strings.Internals;
with Matreshka.Internals.Stream_Element_Vectors;
with Matreshka.Internals.Strings;
with Matreshka.Internals.Text_Codecs.UTF16;
with Matreshka.Internals.Text_Codecs.UTF8;
with Matreshka.JSON_Generator;
with Matreshka.JSON_Parser;
with Matreshka.JSON_Types;
package body League.JSON.Documents is
use type Matreshka.JSON_Types.Shared_JSON_Array_Access;
use type Matreshka.JSON_Types.Shared_JSON_Object_Access;
------------
-- Adjust --
------------
overriding procedure Adjust (Self : in out JSON_Document) is
begin
Matreshka.JSON_Documents.Reference (Self.Data);
end Adjust;
--------------
-- Finalize --
--------------
overriding procedure Finalize (Self : in out JSON_Document) is
use type Matreshka.JSON_Documents.Shared_JSON_Document_Access;
begin
-- Finalize can be called more than once (as specified by language
-- standard), thus implementation should provide protection from
-- multiple finalization.
if Self.Data /= null then
Matreshka.JSON_Documents.Dereference (Self.Data);
end if;
end Finalize;
---------------
-- From_JSON --
---------------
function From_JSON
(Data : Ada.Streams.Stream_Element_Array) return JSON_Document is
begin
return
From_JSON
(League.Stream_Element_Vectors.To_Stream_Element_Vector (Data));
end From_JSON;
---------------
-- From_JSON --
---------------
function From_JSON
(Data : League.Stream_Element_Vectors.Stream_Element_Vector)
return JSON_Document
is
use type Ada.Streams.Stream_Element;
use type Ada.Streams.Stream_Element_Offset;
C1 : Ada.Streams.Stream_Element;
C2 : Ada.Streams.Stream_Element;
C3 : Ada.Streams.Stream_Element;
C4 : Ada.Streams.Stream_Element;
Encoding : JSON_Encoding := UTF8;
Decoded : Matreshka.Internals.Strings.Shared_String_Access;
begin
if Data.Length >= 4 then
-- Automatic detection of encoding form according to RFC-4627:
--
-- "Since the first two characters of a JSON text will always be
-- ASCII characters [RFC0020], it is possible to determine whether an
-- octet stream is UTF-8, UTF-16 (BE or LE), or UTF-32 (BE or LE) by
-- looking at the pattern of nulls in the first four octets.
--
-- 00 00 00 xx UTF-32BE
-- 00 xx 00 xx UTF-16BE
-- xx 00 00 00 UTF-32LE
-- xx 00 xx 00 UTF-16LE
-- xx xx xx xx UTF-8"
--
-- UTF-8 is checked first because it is most widely used encoding.
C1 := Data.Element (1);
C2 := Data.Element (2);
C3 := Data.Element (3);
C4 := Data.Element (4);
if C1 /= 0 and C2 /= 0 and C3 /= 0 and C4 /= 0 then
-- xx xx xx xx UTF-8
Encoding := UTF8;
elsif C1 = 0 and C2 /= 0 and C3 = 0 and C4 /= 0 then
-- 00 xx 00 xx UTF-16BE
Encoding := UTF16BE;
elsif C1 /= 0 and C2 = 0 and C3 /= 0 and C4 = 0 then
-- xx 00 xx 00 UTF-16LE
Encoding := UTF16LE;
elsif C1 = 0 and C2 = 0 and C3 = 0 and C4 /= 0 then
-- 00 00 00 xx UTF-32BE
Encoding := UTF32BE;
elsif C1 /= 0 and C2 = 0 and C3 = 0 and C4 = 0 then
-- xx 00 00 00 UTF-32LE
Encoding := UTF32LE;
else
-- Encoding is not detected.
raise Program_Error;
end if;
end if;
case Encoding is
when UTF8 =>
declare
Decoder : Matreshka.Internals.Text_Codecs.Abstract_Decoder'Class
:= Matreshka.Internals.Text_Codecs.UTF8.Decoder
(Matreshka.Internals.Text_Codecs.Raw);
begin
Decoder.Decode (Data.To_Stream_Element_Array, Decoded);
if Decoder.Is_Mailformed then
Matreshka.Internals.Strings.Dereference (Decoded);
return League.JSON.Documents.Empty_JSON_Document;
end if;
end;
when UTF16 =>
-- Must never be happen.
raise Program_Error;
when UTF16BE =>
declare
Decoder : Matreshka.Internals.Text_Codecs.Abstract_Decoder'Class
:= Matreshka.Internals.Text_Codecs.UTF16.BE_Decoder
(Matreshka.Internals.Text_Codecs.Raw);
begin
Decoder.Decode (Data.To_Stream_Element_Array, Decoded);
if Decoder.Is_Mailformed then
Matreshka.Internals.Strings.Dereference (Decoded);
return League.JSON.Documents.Empty_JSON_Document;
end if;
end;
when UTF16LE =>
declare
Decoder : Matreshka.Internals.Text_Codecs.Abstract_Decoder'Class
:= Matreshka.Internals.Text_Codecs.UTF16.LE_Decoder
(Matreshka.Internals.Text_Codecs.Raw);
begin
Decoder.Decode (Data.To_Stream_Element_Array, Decoded);
if Decoder.Is_Mailformed then
Matreshka.Internals.Strings.Dereference (Decoded);
return League.JSON.Documents.Empty_JSON_Document;
end if;
end;
when UTF32 =>
-- Must never be happen.
raise Program_Error;
when UTF32BE =>
-- XX Decoder is not implemented.
raise Program_Error;
when UTF32LE =>
-- XX Decoder is not implemented.
raise Program_Error;
end case;
return From_JSON (League.Strings.Internals.Wrap (Decoded));
end From_JSON;
---------------
-- From_JSON --
---------------
function From_JSON
(Data : League.Strings.Universal_String) return JSON_Document
is
Result : League.JSON.Documents.JSON_Document;
Success : Boolean;
begin
Matreshka.JSON_Parser.Parse (Data, Result, Success);
if Success then
return Result;
else
return Empty_JSON_Document;
end if;
end From_JSON;
--------------
-- Is_Array --
--------------
function Is_Array (Self : JSON_Document'Class) return Boolean is
begin
return Self.Data.Array_Value /= null;
end Is_Array;
--------------
-- Is_Empty --
--------------
function Is_Empty (Self : JSON_Document'Class) return Boolean is
begin
return Self.Data.Array_Value = null and Self.Data.Object_Value = null;
end Is_Empty;
---------------
-- Is_Object --
---------------
function Is_Object (Self : JSON_Document'Class) return Boolean is
begin
return Self.Data.Object_Value /= null;
end Is_Object;
---------------
-- Set_Array --
---------------
procedure Set_Array
(Self : in out JSON_Document'Class;
Value : League.JSON.Arrays.JSON_Array) is
begin
Matreshka.JSON_Documents.Mutate (Self.Data);
-- Cleanup.
if Self.Data.Array_Value /= null then
Matreshka.JSON_Types.Dereference (Self.Data.Array_Value);
end if;
if Self.Data.Object_Value /= null then
Matreshka.JSON_Types.Dereference (Self.Data.Object_Value);
end if;
-- Set new value.
Self.Data.Array_Value := League.JSON.Arrays.Internals.Internal (Value);
Matreshka.JSON_Types.Reference (Self.Data.Array_Value);
end Set_Array;
----------------
-- Set_Object --
----------------
procedure Set_Object
(Self : in out JSON_Document'Class;
Value : League.JSON.Objects.JSON_Object) is
begin
Matreshka.JSON_Documents.Mutate (Self.Data);
-- Cleanup.
if Self.Data.Array_Value /= null then
Matreshka.JSON_Types.Dereference (Self.Data.Array_Value);
end if;
if Self.Data.Object_Value /= null then
Matreshka.JSON_Types.Dereference (Self.Data.Object_Value);
end if;
-- Set new value.
Self.Data.Object_Value := League.JSON.Objects.Internals.Internal (Value);
Matreshka.JSON_Types.Reference (Self.Data.Object_Value);
end Set_Object;
-------------
-- To_JSON --
-------------
function To_JSON
(Self : JSON_Document'Class;
Encoding : JSON_Encoding := UTF8)
return League.Stream_Element_Vectors.Stream_Element_Vector
is
Aux : constant League.Strings.Universal_String := To_JSON (Self);
Result :
Matreshka.Internals.Stream_Element_Vectors
.Shared_Stream_Element_Vector_Access;
begin
if Encoding /= UTF8 then
-- XXX Not implemented yet.
raise Program_Error;
end if;
declare
Encoder : Matreshka.Internals.Text_Codecs.Abstract_Encoder'Class
:= Matreshka.Internals.Text_Codecs.UTF8.Encoder;
begin
Encoder.Encode (League.Strings.Internals.Internal (Aux), Result);
return League.Stream_Element_Vectors.Internals.Wrap (Result);
end;
end To_JSON;
-------------
-- To_JSON --
-------------
function To_JSON
(Self : JSON_Document'Class) return League.Strings.Universal_String is
begin
return Matreshka.JSON_Generator.Generate (Self);
end To_JSON;
-------------------
-- To_JSON_Array --
-------------------
function To_JSON_Array
(Self : JSON_Document'Class) return League.JSON.Arrays.JSON_Array is
begin
if Self.Data.Array_Value /= null then
return League.JSON.Arrays.Internals.Create (Self.Data.Array_Value);
else
return League.JSON.Arrays.Empty_JSON_Array;
end if;
end To_JSON_Array;
--------------------
-- To_JSON_Object --
--------------------
function To_JSON_Object
(Self : JSON_Document'Class) return League.JSON.Objects.JSON_Object is
begin
if Self.Data.Object_Value /= null then
return League.JSON.Objects.Internals.Create (Self.Data.Object_Value);
else
return League.JSON.Objects.Empty_JSON_Object;
end if;
end To_JSON_Object;
end League.JSON.Documents;
| 32.817746 | 79 | 0.545488 |
a0ed3d5977760334f4c52348e53f5d2450fcb1d9 | 3,365 | ads | Ada | tools/scitools/conf/understand/ada/ada05/s-geveop.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/ada05/s-geveop.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada05/s-geveop.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . G E N E R I C _ V E C T O R _ O P E R A T I O N S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2002-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. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains generic procedures for vector operations on arrays.
-- If the arguments are aligned on word boundaries and the word size is a
-- multiple M of the element size, the operations will be done M elements
-- at a time using vector operations on a word.
-- All routines assume argument arrays have the same length, and arguments
-- with mode "in" do not alias arguments with mode "out" or "in out".
-- If the number N of elements to be processed is not a multiple of M
-- the final N rem M elements will be processed one item at a time.
with System.Vectors;
with System.Storage_Elements;
generic
type Element is (<>);
type Index is (<>);
type Element_Array is array (Index range <>) of Element;
package System.Generic_Vector_Operations is
pragma Pure;
generic
with function Element_Op (X, Y : Element) return Element;
with function Vector_Op (X, Y : Vectors.Vector) return Vectors.Vector;
procedure Binary_Operation
(R, X, Y : System.Address;
Length : System.Storage_Elements.Storage_Count);
generic
with function Element_Op (X : Element) return Element;
with function Vector_Op (X : Vectors.Vector) return Vectors.Vector;
procedure Unary_Operation
(R, X : System.Address;
Length : System.Storage_Elements.Storage_Count);
end System.Generic_Vector_Operations;
| 48.768116 | 78 | 0.518574 |
Subsets and Splits